Equal Dimension Dominating in SuperHyperGraphs

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

DOI: 10.5281/zenodo.8067469
CITATIONS
1 author:
Henry Garrett
501 PUBLICATIONS 21,236 CITATIONS
SEE PROFILE
Some of the authors of this publication are also working on these related projects:
Featured Articles View project
Neutrosophic Graphs View project
All content following this page was uploaded by Henry Garrett on 21 June 2023.
The user has requested enhancement of the downloaded file.

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

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

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

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

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

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

Motivation 129
13 Extreme Applications in Cancer’s Extreme Recognition 141
14 Case 1: The Initial Extreme Steps Toward Extreme SuperHyperBipart-

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

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

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

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

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

21 Extreme SuperHyperTotal But As The Extensions Excerpt From Dense

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

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

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

Scientific Research 267

29 Neutrosophic Preliminaries Of This Scientific Research On the Re-

deemed Ways 271
30 Neutrosophic SuperHyperEqual Dimension Dominating But As The Extensions

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

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

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

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

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

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

39 Neutrosophic SuperHyperJoin But As The Extensions Excerpt From

40 Neutrosophic SuperHyperPerfect But As The Extensions Excerpt From

41 Neutrosophic SuperHyperTotal But As The Extensions Excerpt From

42 Neutrosophic SuperHyperConnected But As The Extensions Excerpt

From Dense And Super Forms 417
43 Background 431
Bibliography 437
44 Books’ Contributions 463
45 “SuperHyperGraph-Based Books”: | Featured Tweets 475
46 CV 503

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

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

11.1 an Extreme SuperHyperPath Associated to the Notions of Extreme SuperHyperEqual

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

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

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

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


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


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

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

35.1 a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic

44.1 [HG282] Henry Garrett, “New Ideas On Super Dimity By Hyper Dimple Of
Equal Dimension Dominating In Recognition of Cancer With (Neutrosophic)
SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zenodo.8067409). . . . . . . . . . 464
44.4 [HG283] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic
SuperHyperGraph By Equal Dimension Dominating As Hyper Dimple On Super
Dimity”, Zenodo 2023, (doi: 10.5281/zenodo.8067384). . . . . . . . . . . . . . . . . 466
44.7 [HG181b] Henry Garrett, “Equal Dimension Dominating In SuperHyperGraphs”.
Dr. Henry Garrett, 2023 (doi: 10.5281/zenodo.8067469). . . . . . . . . . . . . . . . 471


45.1 “SuperHyperGraph-Based Books”: | Featured Tweets . . . . . . . . . . . . . . . . 476

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

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

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

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

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

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

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

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

SuperHyperGraphs by two (Extreme/Neutrosophic) notions, namely, Extreme Equal Dimension 4
Dominating In SuperHyperGraphs and Neutrosophic Equal Dimension Dominating In SuperHy- 5
perGraphs. With scientific research on the basic scientific research properties, the scientific 6
research book starts to make Extreme Equal Dimension Dominating In SuperHyperGraphs 7
theory and Neutrosophic Equal Dimension Dominating In SuperHyperGraphs theory more 8
(Extremely/Neutrosophicly) understandable. 9
10
In the some chapters, in some researches, new setting is introduced for new SuperHyper- 11
Notions, namely, a Equal Dimension Dominating In SuperHyperGraphs and Neutrosophic Equal 12
Dimension Dominating In SuperHyperGraphs . Two different types of SuperHyperDefinitions 13
are debut for them but the scientific research goes further and the SuperHyperNotion, Super- 14
HyperUniform, and SuperHyperClass based on that are well-defined and well-reviewed. The 15
literature review is implemented in the whole of this research. For shining the elegancy and the 16
significancy of this research, the comparison between this SuperHyperNotion with other Super- 17
HyperNotions and fundamental SuperHyperNumbers are featured. The definitions are followed 18
by the examples and the instances thus the clarifications are driven with different tools. The 19
applications are figured out to make sense about the theoretical aspect of this ongoing research. 20
The “Cancer’s Recognition” are the under scientific research to figure out the challenges make 21
sense about ongoing and upcoming research. The special case is up. The cells are viewed in the 22
deemed ways. There are different types of them. Some of them are individuals and some of them 23
are well-modeled by the group of cells. These types are all officially called “SuperHyperVertex” 24
but the relations amid them all officially called “SuperHyperEdge”. The frameworks “SuperHy- 25
perGraph” and “Neutrosophic SuperHyperGraph” are chosen and elected to scientific research 26
about “Cancer’s Recognition”. Thus these complex and dense SuperHyperModels open up some 27
avenues to scientific research on theoretical segments and “Cancer’s Recognition”. Some avenues 28
are posed to pursue this research. It’s also officially collected in the form of some questions and 29
some problems. Assume a SuperHyperGraph. Then δ−Equal Dimension Dominating In Super- 30
HyperGraphs is a maximal of SuperHyperVertices with a maximum cardinality such that either 31
of the following expressions hold for the (Neutrosophic) cardinalities of SuperHyperNeighbors of 32
s ∈ S : there are |S ∩ N (s)| > |S ∩ (V \ N (s))| + δ; and |S ∩ N (s)| < |S ∩ (V \ N (s))| + δ. The 33
1
first Expression, holds if S is an δ−SuperHyperOffensive. And the second Expression, holds if 34

S is an δ−SuperHyperDefensive; a Neutrosophic δ−Equal Dimension Dominating In Super- 35
HyperGraphs is a maximal Neutrosophic of SuperHyperVertices with maximum Neutrosophic 36
cardinality such that either of the following expressions hold for the Neutrosophic cardinalities of 37
SuperHyperNeighbors of s ∈ S there are: |S ∩N (s)|N eutrosophic > |S ∩(V \N (s))|N eutrosophic +δ; 38
and |S ∩ N (s)|N eutrosophic < |S ∩ (V \ N (s))|N eutrosophic + δ. The first Expression, holds if 39
S is a Neutrosophic δ−SuperHyperOffensive. And the second Expression, holds if S is a 40

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

SuperHyperGraphs more understandable. Assume a Neutrosophic SuperHyperGraph. There 76
are some Neutrosophic SuperHyperClasses if the intended Table holds. Thus SuperHyperPath, 77
Equal Dimension Dominating In SuperHyperGraphs, SuperHyperStar, SuperHyperBipart- 78
ite, SuperHyperMultiPartite, and SuperHyperWheel, are “Neutrosophic SuperHyperPath”, 79

“Neutrosophic Equal Dimension Dominating In SuperHyperGraphs”, “Neutrosophic Super- 80

HyperStar”, “Neutrosophic SuperHyperBipartite”, “Neutrosophic SuperHyperMultiPartite”, 81
and “Neutrosophic SuperHyperWheel” if the intended Table holds. A SuperHyperGraph has a 82
“Neutrosophic Equal Dimension Dominating In SuperHyperGraphs” where it’s the strongest [the 83
maximum Neutrosophic value from all the Equal Dimension Dominating In SuperHyperGraphs 84
amid the maximum value amid all SuperHyperVertices from a Equal Dimension Dominating 85
In SuperHyperGraphs .] Equal Dimension Dominating In SuperHyperGraphs . A graph is a 86

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

There isn’t any formation of any Equal Dimension Dominating In SuperHyperGraphs but 126
literarily, it’s the deformation of any Equal Dimension Dominating In SuperHyperGraphs. It, 127
literarily, deforms and it doesn’t form. A basic familiarity with SuperHyperGraph theory and 128
Neutrosophic SuperHyperGraph theory are proposed. 129
Keywords: SuperHyperGraph, (Neutrosophic) Equal Dimension Dominating In SuperHyper- 130
Graphs, Cancer’s Recognition 131

AMS Subject Classification: 05C17, 05C22, 05E45 132
133
In the some chapters, in some researches, new setting is introduced for new SuperHyper- 134
Notion, namely, Neutrosophic Equal Dimension Dominating In SuperHyperGraphs . Two 135
different types of SuperHyperDefinitions are debut for them but the scientific research goes 136
further and the SuperHyperNotion, SuperHyperUniform, and SuperHyperClass based on that 137
are well-defined and well-reviewed. The literature review is implemented in the whole of this 138
research. For shining the elegancy and the significancy of this research, the comparison between 139
this SuperHyperNotion with other SuperHyperNotions and fundamental SuperHyperNum- 140

bers are featured. The definitions are followed by the examples and the instances thus the 141
clarifications are driven with different tools. The applications are figured out to make sense 142
about the theoretical aspect of this ongoing research. The “Cancer’s Neutrosophic Recognition” 143
are the under scientific research to figure out the challenges make sense about ongoing and 144
upcoming research. The special case is up. The cells are viewed in the deemed ways. There are 145
different types of them. Some of them are individuals and some of them are well-modeled by 146
the group of cells. These types are all officially called “SuperHyperVertex” but the relations 147
amid them all officially called “SuperHyperEdge”. The frameworks “SuperHyperGraph” and 148
“Neutrosophic SuperHyperGraph” are chosen and elected to scientific research about “Cancer’s 149
Neutrosophic Recognition”. Thus these complex and dense SuperHyperModels open up some 150
avenues to scientific research on theoretical segments and “Cancer’s Neutrosophic Recognition”. 151
Some avenues are posed to pursue this research. It’s also officially collected in the form 152
of some questions and some problems. Assume a SuperHyperGraph. Then an “δ−Equal 153
Dimension Dominating In SuperHyperGraphs” is a maximal Equal Dimension Dominating 154
In SuperHyperGraphs of SuperHyperVertices with maximum cardinality such that either of 155
the following expressions hold for the (Neutrosophic) cardinalities of SuperHyperNeighbors 156
of s ∈ S : |S ∩ N (s)| > |S ∩ (V \ N (s))| + δ, |S ∩ N (s)| < |S ∩ (V \ N (s))| + δ. The first 157
Expression, holds if S is an “δ−SuperHyperOffensive”. And the second Expression, holds 158

if S is an “δ−SuperHyperDefensive”; a“Neutrosophic δ−Equal Dimension Dominating In 159
SuperHyperGraphs” is a maximal Neutrosophic Equal Dimension Dominating In SuperHy- 160
perGraphs of SuperHyperVertices with maximum Neutrosophic cardinality such that either 161
of the following expressions hold for the Neutrosophic cardinalities of SuperHyperNeighbors 162
of s ∈ S : |S ∩ N (s)|N eutrosophic > |S ∩ (V \ N (s))|N eutrosophic + δ, |S ∩ N (s)|N eutrosophic < 163
|S ∩ (V \ N (s))|N eutrosophic + δ. The first Expression, holds if S is a “Neutrosophic 164

δ−SuperHyperOffensive”. And the second Expression, holds if S is a “Neutrosophic 165
δ−SuperHyperDefensive”. It’s useful to define “Neutrosophic” version of Equal Dimen- 166
sion Dominating In SuperHyperGraphs . Since there’s more ways to get type-results to 167
make Equal Dimension Dominating In SuperHyperGraphs more understandable. For the 168
sake of having Neutrosophic Equal Dimension Dominating In SuperHyperGraphs, there’s a 169
need to “redefine” the notion of “Equal Dimension Dominating In SuperHyperGraphs ”. The 170

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

SuperHyperClasses if the intended Table holds. Thus SuperHyperPath, Equal Dimension Dom- 202
inating In SuperHyperGraphs, SuperHyperStar, SuperHyperBipartite, SuperHyperMultiPartite, 203
and SuperHyperWheel, are “Neutrosophic SuperHyperPath”, “Neutrosophic Equal Dimension 204
Dominating In SuperHyperGraphs”, “Neutrosophic SuperHyperStar”, “Neutrosophic SuperHy- 205
perBipartite”, “Neutrosophic SuperHyperMultiPartite”, and “Neutrosophic SuperHyperWheel” 206

if the intended Table holds. A SuperHyperGraph has “Neutrosophic Equal Dimension Dominat- 207
ing In SuperHyperGraphs” where it’s the strongest [the maximum Neutrosophic value from all 208
Equal Dimension Dominating In SuperHyperGraphs amid the maximum value amid all Super- 209
HyperVertices from a Equal Dimension Dominating In SuperHyperGraphs .] Equal Dimension 210
Dominating In SuperHyperGraphs . A graph is SuperHyperUniform if it’s SuperHyperGraph 211
and the number of elements of SuperHyperEdges are the same. Assume a Neutrosophic 212
SuperHyperGraph. There are some SuperHyperClasses as follows. It’s SuperHyperPath if it’s 213
only one SuperVertex as intersection amid two given SuperHyperEdges with two exceptions; it’s 214
Equal Dimension Dominating In SuperHyperGraphs if it’s only one SuperVertex as intersection 215
amid two given SuperHyperEdges; it’s SuperHyperStar it’s only one SuperVertex as intersection 216

amid all SuperHyperEdges; it’s SuperHyperBipartite it’s only one SuperVertex as intersection 217
amid two given SuperHyperEdges and these SuperVertices, forming two separate sets, has 218
no SuperHyperEdge in common; it’s SuperHyperMultiPartite it’s only one SuperVertex as 219
intersection amid two given SuperHyperEdges and these SuperVertices, forming multi separate 220
sets, has no SuperHyperEdge in common; it’s SuperHyperWheel if it’s only one SuperVertex as 221
intersection amid two given SuperHyperEdges and one SuperVertex has one SuperHyperEdge 222
with any common SuperVertex. The SuperHyperModel proposes the specific designs and 223
the specific architectures. The SuperHyperModel is officially called “SuperHyperGraph” and 224
“Neutrosophic SuperHyperGraph”. In this SuperHyperModel, The “specific” cells and “specific 225
group” of cells are SuperHyperModeled as “SuperHyperVertices” and the common and intended 226
properties between “specific” cells and “specific group” of cells are SuperHyperModeled as 227
“SuperHyperEdges”. Sometimes, it’s useful to have some degrees of determinacy, indeterminacy, 228
and neutrality to have more precise SuperHyperModel which in this case the SuperHyperModel 229
is called “Neutrosophic”. In the future research, the foundation will be based on the “Cancer’s 230
Neutrosophic Recognition” and the results and the definitions will be introduced in redeemed 231
ways. The Neutrosophic recognition of the cancer in the long-term function. The specific region 232
cancer on the complex tracks and between complicated groups of cells could be fantasized 240
by a Neutrosophic SuperHyperPath(-/Equal Dimension Dominating In SuperHyperGraphs, 241

is to find either the longest Equal Dimension Dominating In SuperHyperGraphs or the strongest 243
Equal Dimension Dominating In SuperHyperGraphs in those Neutrosophic SuperHyperModels. 244
For the longest Equal Dimension Dominating In SuperHyperGraphs, called Equal Dimension 245
Dominating In SuperHyperGraphs, and the strongest Equal Dimension Dominating In Super- 246
HyperGraphs, called Neutrosophic Equal Dimension Dominating In SuperHyperGraphs, some 247

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

258
Some scientific studies and scientific researches about neutrosophic graphs, are proposed 259
as book in the following by Henry Garrett (2022) which is indexed by Google Scholar and has 260
more than 3181 readers in Scribd. It’s titled “Beyond Neutrosophic Graphs” and published by 261

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

978-1-59973-743-0 (http://fs.unm.edu/NeutrosophicDuality.pdf). 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




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

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

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

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

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

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

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

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

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

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

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

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

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


HG179b; HG180b; HG181b]. Two popular scientific research books in Scribd in the terms 459
of high readers, 4728 and 5721 respectively, on neutrosophic science is on [HG32b; HG44b]. 460
Some scientific studies and scientific researches about neutrosophic graphs, are proposed as 461
book in Ref. [HG32b] by Henry Garrett (2023) which is indexed by Google Scholar and has 462

more than 4728 readers in Scribd. It’s titled “Beyond Neutrosophic Graphs” and published 463
by Dr. Henry Garrett. This research book covers different types of notions and settings in 464
neutrosophic graph theory and neutrosophic SuperHyperGraph theory. 465
Also, some scientific studies and scientific researches about neutrosophic graphs, are proposed 466
as book in Ref. [HG44b] by Henry Garrett (2023) which is indexed by Google Scholar and 467
has more than 5721 readers in Scribd. It’s titled “Neutrosophic Duality” and published by Dr. 468
Henry Garrett. This research book presents different types of notions SuperHyperResolving and 469
SuperHyperDominating in the setting of duality in neutrosophic graph theory and neutrosophic 470
SuperHyperGraph theory. This research book has scrutiny on the complement of the intended set 471
and the intended set, simultaneously. It’s smart to consider a set but acting on its complement 472
that what’s done in this research book which is popular in the terms of high readers in Scribd. 473
See the seminal scientific researches [HG11s; HG22s; HG33s]. The formalization of the 474
notions on the framework of notions in SuperHyperGraphs, Neutrosophic notions in Supe- 475

rHyperGraphs theory, and (Neutrosophic) SuperHyperGraphs theory at [HG44s; HG55s; 476
HG277; HG278; HG279; HG280; HG281; HG282; HG283] alongside scientific re- 497
search books at [HG60b; HG61b; HG62b; HG63b; HG64b; HG65b; HG66b; HG67b; 498




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

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

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

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

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

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

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

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

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

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

2023, (doi: 10.5281/zenodo.8067409). 611
By Dimension Dominating As Hyper Dimple On Super Dimity”, Zenodo 2023, (doi: 613
10.5281/zenodo.8061927). 614
HG280 [29] Henry Garrett, “New Ideas On Super Dimity By Hyper Dimple Of Dimension Dominating 615
In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 616
10.5281/zenodo.8062016). 617
By Reverse Connective Dominating As Hyper Conceit On Super Con”, Zenodo 2023, (doi: 619
10.5281/zenodo.8057696). 620

HG278 [31] Henry Garrett, “New Ideas On Super Con By Hyper Conceit Of Reverse Connective 621
2023, (doi: 10.5281/zenodo.8057753). 623
By Equal Connective Dominating As Hyper Conceit On Super Con”, Zenodo 2023, (doi: 625
10.5281/zenodo.8052893). 626
HG276 [33] Henry Garrett, “New Ideas On Super Con By Hyper Conceit Of Equal Connective 627
2023, (doi: 10.5281/zenodo.8052925). 629
By Connective Dominating As Hyper Conceit On Super Con”, Zenodo 2023, (doi: 631
10.5281/zenodo.8051346). 632
HG274 [35] Henry Garrett, “New Ideas On Super Con By Hyper Conceit Of Connective Dominating 633
10.5281/zenodo.8051360). 635
HG273 [36] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyper- 636
Graph By United Dominating As Hyper Ultra On Super Units”, Zenodo 2023, (doi: 637
10.5281/zenodo.8025707). 638
HG272 [37] Henry Garrett, “New Ideas On Super Units By Hyper Ultra Of United Dominating 639
10.5281/zenodo.8027275). 641
By Zero Forcing As Hyper ford On Super forceps”, Zenodo 2023, (doi: 10.5281/zen- 643
odo.8017246). 644
HG270 [39] Henry Garrett, “New Ideas On Super forceps By Hyper ford Of Zero Forcing In 645
Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 646
10.5281/zenodo.8020128). 647
By Matrix-Based As Hyper mat On Super matte”, Zenodo 2023, (doi: 10.5281/zen- 649
odo.7978571). 650
HG268 [41] Henry Garrett, “New Ideas On Super mat By Hyper matte Of Matrix-Based In 651
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 652
10.5281/zenodo.7978857). 653
Graph By Dominating-Edges As Hyper Dome On Super Eddy”, Zenodo 2023, (doi: 655
10.5281/zenodo.7940830). 656
HG266 [43] Henry Garrett, “New Ideas On Super Eddy By Hyper Dome Of Dominating-Edges 657
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 658
10.5281/zenodo.7943578). 659

Graph By Edge-Gap As Hyper Gape On Super Gab”, Zenodo 2023, (doi: 10.5281/zen- 661
odo.7916595). 662
HG264 [45] Henry Garrett, “New Ideas On Super Gab By Hyper Gape Of Edge-Gap In Cancer’s 663
Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zen- 664
odo.7923632). 665
By Eulerian-Type-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, 667
(doi: 10.5281/zenodo.7904698). 668
HG262 [47] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Type- 669
Cycle-Neighbor In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 670
2023, (doi: 10.5281/zenodo.7904671). 671
By Eulerian-Type-Cycle-Decomposition As Hyper Decompress On Super Decompensation”, 673
Zenodo 2023, (doi: 10.5281/zenodo.7904529). 674
HG260 [49] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of Eulerian- 675
Type-Cycle-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyper- 676
Graph”, Zenodo 2023, (doi: 10.5281/zenodo.7904401). 677
By Eulerian-Type-Cycle-Cut As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 679
10.5281/zenodo.7871026). 680
Cycle-Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 682
2023, (doi: 10.5281/zenodo.7874647). 683
By Eulerian-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 685
10.5281/zenodo.7857856). 686
HG256 [53] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Cycle- 687
Neighbor In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 688
2023, (doi: 10.5281/zenodo.7857841). 689
By Eulerian-Cycle-Decomposition As Hyper Decompress On Super Decompensation”, 691
Cycle-Decomposition In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, 694
Graph By Eulerian-Cycle-Cut As Hyper Eulogy On Super EULA”, Zenodo 2023, (doi: 697
10.5281/zenodo.7853867). 698

HG252 [57] Henry Garrett, “New Ideas On Super EULA By Hyper Eulogy Of Eulerian-Cycle-Cut 699
10.5281/zenodo.7853922). 701
By Eulerian-Type-Path-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, 703
(doi: 10.5281/zenodo.7851519). 704
HG250 [59] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Type-Path- 705
Neighbor In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, 706
(doi: 10.5281/zenodo.7851550). 707
By Eulerian-Type-Path-Decomposition As Hyper Decompress On Super Decompensation”, 709
Type-Path-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 712
By Eulerian-Type-Path-Cut As Hyper Eulogy On Super EULA”, Zenodo 2023, (doi: 715
10.5281/zenodo.7834229). 716
HG246 [63] Henry Garrett, “New Ideas On Super EULA By Hyper Eulogy Of Eulerian-Type-Path-Cut 717
10.5281/zenodo.7834261). 719
By Eulerian-Path-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 721
10.5281/zenodo.7824560). 722
HG244 [65] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Path- 723
(doi: 10.5281/zenodo.7824623). 725
By Eulerian-Path-Decomposition As Hyper Decompress On Super Decompensation”, 727

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

By Eulerian-Path-Cut As Hyper Eulogy-Path-Cut On Super EULA-Path-Cut”, Zenodo 738
2023, (doi: 10.5281/zenodo.7809358). 739
HG238 [71] Henry Garrett, “New Ideas On Super EULA By Hyper Eulogy Of Eulerian-Path-Cut 740
10.5281/zenodo.7809219). 742
Graph By Eulerian-Path-Cut As Hyper Eulogy On Super EULA”, Zenodo 2023, (doi: 744
10.5281/zenodo.7809328). 745
By Hamiltonian-Type-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 747
2023, (doi: 10.5281/zenodo.7806767). 748
HG235 [74] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Hamiltonian-Type- 749
2023, (doi: 10.5281/zenodo.7806838). 751
By Hamiltonian-Type-Cycle-Decomposition As Hyper Decompress On Super Decompensa- 753
tion”, Zenodo 2023, (doi: 10.5281/zenodo.7804238). 754
HG233 [76] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of 755
Hamiltonian-Type-Cycle-Decomposition In Cancer’s Recognition With (Neutrosophic) 756
SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zenodo.7804228). 757
By Hamiltonian-Type-Cycle-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi: 759
10.5281/zenodo.7799902). 760
HG231 [78] Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Type- 761
Cycle-Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, 762
(doi: 10.5281/zenodo.7804218). 763
By Hamiltonian-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, 765
(doi: 10.5281/zenodo.7796334). 766
By Hamiltonian-Cycle-Decomposition As Hyper Decompress On Super Decompensation”, 768
By Hamiltonian-Cycle-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi: 771
10.5281/zenodo.7791952). 772
HG225 [82] Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Cycle- 773
Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 774
10.5281/zenodo.7791982). 775

By Hamiltonian-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 777
10.5281/zenodo.7790026). 778
HG223 [84] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Hamiltonian-Neighbor 779
10.5281/zenodo.7790052). 781
By Hamiltonian-Decomposition As Hyper Decompress On Super Decompensation”, Zenodo 783
2023, (doi: 10.5281/zenodo.7787066). 784
Hamiltonian-Decomposition In Recognition of Cancer With (Neutrosophic) SuperHy- 786
perGraph”, Zenodo 2023, (doi: 10.5281/zenodo.7787094). 787
By Hamiltonian-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi: 789
10.5281/zenodo.7781476). 790
HG219 [88] Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Cut 791
10.5281/zenodo.7783082). 793
Graph By Trace-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 795
10.5281/zenodo.7777857). 796
HG217 [90] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Trace-Neighbor 797
10.5281/zenodo.7779286). 799
HG215 [91] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 800
By Trace-Decomposition As Hyper Decompress On Super Decompensation”, Zenodo 2023, 801
(doi: 10.5281/zenodo.7771831). 802
HG214 [92] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of Trace- 803
Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 804
2023, (doi: 10.5281/zenodo.7772468). 805
By Trace-Cut As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 807
10.13140/RG.2.2.20913.25446). 808
HG212 [94] Henry Garrett, “New Ideas On Super Tract By Hyper Track Of Trace-Cut In Cancer’s 809
odo.7764916). 811
By Edge-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 813
10.13140/RG.2.2.11770.98247). 814

HG210 [96] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Edge-Neighbor In 815
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 816
10.13140/RG.2.2.12400.12808). 817
By Edge-Decomposition As Hyper Decompress On Super Decompensation”, ResearchGate 819
2023, (doi: 10.13140/RG.2.2.22545.10089). 820
Edge-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 822
ResearchGate 2023, (doi: 10.13140/RG.2.2.29544.34564). 823
HG207 [99] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyper- 824
Graph By Edge-Cut As Hyper Edify On Super Eddy”, ResearchGate 2023, (doi: 825
10.13140/RG.2.2.11377.76644). 826
HG206 [100] Henry Garrett, “New Ideas On Super Eddy By Hyper Edify Of Edge-Cut In Can- 827
cer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 828
10.13140/RG.2.2.23750.96329). 829
By Vertex-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 831
10.13140/RG.2.2.31366.24641). 832
HG204 [102] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Vertex-Neighbor In 833
10.13140/RG.2.2.34721.68960). 835
By Vertex-Decomposition As Hyper Decompress On Super Decompensation”, ResearchGate 837
2023, (doi: 10.13140/RG.2.2.30212.81289). 838
Vertex-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 840
Graph By Vertex-Cut As Hyper Vertu On Super Vertigo”, ResearchGate 2023, (doi: 843
10.13140/RG.2.2.24288.35842). 844
HG200 [106] Henry Garrett, “New Ideas On Super Vertigo By Hyper Vertu Of Vertex-Cut In 845
10.13140/RG.2.2.32467.25124). 847
By Stable-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 849
10.13140/RG.2.2.31025.45925). 850
HG198 [108] Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of Stable-Neighbor In 851
10.13140/RG.2.2.17184.25602). 853

By Stable-Decompositions As Hyper Stain On Super Stagy”, ResearchGate 2023, (doi: 855
10.13140/RG.2.2.23423.28327). 856
HG196 [110] Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Decompositions In 857
10.13140/RG.2.2.28456.44805). 859
Graph By Stable-Cut As Hyper Stain On Super Stagy”, ResearchGate 2023, (doi: 861
10.13140/RG.2.2.23525.68320). 862
HG194 [112] Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Cut In Can- 863
10.13140/RG.2.2.20170.24000). 865
By Clique-Neighbors As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 867
10.13140/RG.2.2.36475.59683). 868
HG192 [114] Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of Clique-Neighbors In 869
10.13140/RG.2.2.29764.71046). 871
By Clique-Decompositions As Hyper Decompile On Super Decommission”, ResearchGate 873
2023, (doi: 10.13140/RG.2.2.18780.87683). 874
Clique- Decompositions In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 876
Graph By Clique-Cut As Hyper Click On Super Cliche”, ResearchGate 2023, (doi: 879
10.13140/RG.2.2.26134.01603). 880
HG188 [118] Henry Garrett, “New Ideas On Super Cliff By Hyper Cling Of Clique-Cut In Can- 881
10.13140/RG.2.2.27392.30721). 883
HG187 [119] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHy- 884
perGraph By Space As Hyper Spin On Super Spacy”, ResearchGate 2023, (doi: 885
10.13140/RG.2.2.33028.40321). 886
Graph By List- Coloring As Hyper List On Super Lisle”, ResearchGate 2023, (doi: 888
10.13140/RG.2.2.21389.20966). 889
HG185 [121] Henry Garrett, “New Ideas On Super Lith By Hyper Lite Of List-Coloring In 890
10.13140/RG.2.2.16356.04489). 892

perGraph By Space As Hyper Sparse On Super Spark”, ResearchGate 2023, (doi: 894
10.13140/RG.2.2.21756.21129). 895
HG183 [123] Henry Garrett, “New Ideas On Super Solidarity By Hyper Soul Of Space In 896
Cancer’s Recognition With (Extreme) SuperHyperGraph”, ResearchGate 2023, (doi: 897
10.13140/RG.2.2.30983.68009). 898
By Edge-Connectivity As Hyper Disclosure On Super Closure”, ResearchGate 2023, (doi: 900
10.13140/RG.2.2.28552.29445). 901
HG181 [125] Henry Garrett, “New Ideas On Super Uniform By Hyper Deformation Of Edge-Connectivity 902
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, 903
(doi: 10.13140/RG.2.2.10936.21761). 904
By Vertex-Connectivity As Hyper Leak On Super Structure”, ResearchGate 2023, (doi: 906
10.13140/RG.2.2.35105.89447). 907
HG179 [127] Henry Garrett, “New Ideas On Super System By Hyper Explosions Of Vertex-Connectivity 908
(doi: 10.13140/RG.2.2.30072.72960). 910
By Tree-Decomposition As Hyper Forward On Super Returns”, ResearchGate 2023, (doi: 912
10.13140/RG.2.2.31147.52003). 913
HG177 [129] Henry Garrett, “New Ideas On Super Nodes By Hyper Moves Of Tree-Decomposition In 914
10.13140/RG.2.2.32825.24163). 916
Graph By Chord As Hyper Excellence On Super Excess”, ResearchGate 2023, (doi: 918
10.13140/RG.2.2.13059.58401). 919
HG175 [131] Henry Garrett, “New Ideas On Super Gap By Hyper Navigations Of Chord In 920
10.13140/RG.2.2.11172.14720). 922
By SuperHyper(i,j)-Domination As Hyper Controller On Super Waves”, ResearchGate 924
2023, (doi: 10.13140/RG.2.2.22011.80165). 925
HG173 [133] Henry Garrett, “New Ideas On Super Coincidence By Hyper Routes Of SuperHyper(i,j)- 926
Domination In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchG- 927
ate 2023, (doi: 10.13140/RG.2.2.30819.84003). 928
By SuperHyperEdge-Domination As Hyper Reversion On Super Indirection”, ResearchGate 930
2023, (doi: 10.13140/RG.2.2.10493.84962). 931

HG171 [135] Henry Garrett, “New Ideas On Super Obstacles By Hyper Model Of SuperHyperEdge- 932
ate 2023, (doi: 10.13140/RG.2.2.13849.29280). 934
By SuperHyperK-Domination As Hyper k-Actions On Super Patterns”, ResearchGate 936
2023, (doi: 10.13140/RG.2.2.19944.14086). 937
HG169 [137] Henry Garrett, “New Ideas On Super Harmony By Hyper k-Function Of SuperHyperK- 938
ate 2023, (doi: 10.13140/RG.2.2.23299.58404). 940
By SuperHyperK-Number As Hyper k-Partition On Super Layers”, ResearchGate 2023, 942
(doi: 10.13140/RG.2.2.33103.76968). 943
HG167 [139] Henry Garrett, “New Ideas On Super Gradient By Hyper k-Class Of SuperHyperK-Number 944
(doi: 10.13140/RG.2.2.23037.44003). 946
By SuperHyperOrder As Hyper Enumerations On Super Landmarks”, ResearchGate 2023, 948
(doi: 10.13140/RG.2.2.35646.56641). 949
HG165 [141] Henry Garrett, “New Ideas On Super Analogous By Hyper Visions Of SuperHyperOrder In 950
10.13140/RG.2.2.18030.48967). 952
By SuperHyperColoring As Hyper Categories On Super Neighbors”, ResearchGate 2023, 954
(doi: 10.13140/RG.2.2.13973.81121). 955
HG163 [143] Henry Garrett, “New Ideas On Super Relations By Hyper Identifications Of SuperHyper- 956
Coloring In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 957
2023, (doi: 10.13140/RG.2.2.34106.47047). 958
HG162 [144] Henry Garrett, “New Ideas On Super Contradiction By Hyper Detection of SuperHyper- 959
Defensive In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 960
By SuperHyperDimension As Hyper Distinguishing On Super Distances”, ResearchGate 963
2023, (doi: 10.13140/RG.2.2.31956.88961). 964
HG160 [146] Henry Garrett, “New Ideas On Super Locations By Hyper Differing Of SuperHyperDi- 965
mension In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 966
2023, (doi: 10.13140/RG.2.2.15179.67361). 967
By SuperHyperDominating As Hyper Closing On Super Messy”, ResearchGate 2023, (doi: 969
10.13140/RG.2.2.21510.45125). 970

HG158 [148] Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDom- 971
inating In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 972
2023, (doi: 10.13140/RG.2.2.13121.84321). 973
By SuperHyperConnected As Hyper Group On Super Surge”, ResearchGate 2023, (doi: 975
10.13140/RG.2.2.11758.69441). 976
HG156 [150] Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of SuperHyperCon- 977
nected In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 978
2023, (doi: 10.13140/RG.2.2.31891.35367). 979
By SuperHyperTotal As Hyper Covering On Super Infections”, ResearchGate 2023, (doi: 981
10.13140/RG.2.2.19360.87048). 982
HG154 [152] Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal 983
In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 984
10.13140/RG.2.2.32363.21286). 985
HG153 [153] Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect 986
10.13140/RG.2.2.23266.81602). 988
By SuperHyperPerfect As Hyper Idealism On Super Vacancy”, ResearchGate 2023, (doi: 990
10.13140/RG.2.2.19911.37285). 991
By SuperHyperJoin As Hyper Separations On Super Sorts”, ResearchGate 2023, (doi: 993
10.13140/RG.2.2.11050.90569). 994
HG150 [156] Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of SuperHy- 995
perJoin In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 996
2023, (doi: 10.13140/RG.2.2.17761.79206). 997
HG149 [157] Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of Super- 998
HyperDuality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 999
HG148 [158] Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph 1001
By SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchG- 1002
ate 2023, (doi: 10.13140/RG.2.2.33275.80161). 1003
By Path SuperHyperColoring As Hyper Correction On Super Faults”, ResearchGate 2023, 1005
(doi: 10.13140/RG.2.2.30182.50241). 1006
HG146 [160] Henry Garrett, “New Ideas On Super Reflections By Hyper Rotations Of Path SuperHy- 1007
perColoring In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 1008

HG145 [161] Henry Garrett, “New Ideas As Hyper Deformations On Super Chains In Cancer’s 1010
Neutrosophic Recognition and Neutrosophic SuperHyperGraph By SuperHyperDensity”, 1011
HG144 [162] Henry Garrett, “New Ideas As Hyper Ignorance By SuperHyperDensity On Super 1013
Resistances In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 1014
ResearchGate 2023, (doi:10.13140/RG.2.2.16800.05123). 1015
HG143 [163] Henry Garrett, “New Research On Cancer’s Recognition and Neutrosophic SuperHyper- 1016
Graph By Eulerian SuperHyperCycles and Hamiltonian Sets As Hyper Covering Versus 1017
Super separations-VI ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.29913.80482). 1018
Super separations-V ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.33269.24809). 1021
Super separations-IV ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.34946.96960). 1024
HG140 [166] Henry Garrett, “A Research On Cancer’s Recognition and Neutrosophic SuperHyperGraph 1025
By Eulerian SuperHyperCycles and Hamiltonian Sets As Hyper Covering Versus Super 1026
separations-III ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.14814.31040). 1027
separations-II ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.15653.17125). 1030
separations-I ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.25719.50089). 1033
HG137 [169] Henry Garrett, “New Ideas On Super Disruptions In Cancer’s Extreme Recognition 1034
As Neutrosophic SuperHyperGraph By Hyper Plans Called SuperHyperConnectivities”, 1035
HG136 [170] Henry Garrett, “Cancer’s Neutrosophic Recognition As Neutrosophic SuperHyperGraph 1037
By SuperHyperConnectivities As Hyper Diagnosis On Super Mechanism”, ResearchGate 1038
2023, (doi: 10.13140/RG.2.2.17252.24968). 1039
HG135 [171] Henry Garrett,“Cancer’s Recognition and (Neutrosophic) SuperHyperGraph By the Criteria 1040
of Eulerian and Hamiltonian Type-Sets As Hyper Modified Cycles On Super Mess”, 1041
ResearchGate 2023,(doi: 10.13140/RG.2.2.16652.59525). 1042
HG134 [172] Henry Garrett,“Eulerian and Hamiltonian In Cancer’s Neutrosophic Recognition and 1043
Neutrosophic SuperHyperGraph On Super Interactions By Hyper Extensions of Cycles”, 1044
HG132 [173] Henry Garrett,“SuperHyperGirth Type-Results on extreme SuperHyperGirth theory and 1046
(Neutrosophic) SuperHyperGraphs Toward Cancer’s extreme Recognition”, Preprints 2023, 1047
2023010396 (doi: 10.20944/preprints202301.0396.v1). 1048

HG131 [174] Henry Garrett,“Neutrosophic SuperHyperGraphs Warns Hyper Landmark of neutrosophic 1049
SuperHyperGirth In Super Type-Versions of Cancer’s neutrosophic Recognition”, Preprints 1050
2023, 2023010395 (doi: 10.20944/preprints202301.0395.v1). 1051
HG130 [175] Henry Garrett,“The Constructions of (Neutrosophic) SuperHyperGraphs on the Cancer’s 1052
Recognition in The Confrontation With Super Attacks In Hyper Situations By Implementing 1053
(Neutrosophic) 1-Failed SuperHyperForcing in The Technical Approaches to Neutralize 1054
SuperHyperViews”, ResearchGate 2023, (doi: 10.13140/RG.2.2.26240.51204). 1055
HG129 [176] Henry Garrett,“(Neutrosophic) 1-Failed SuperHyperForcing As the Entrepreneurs on 1056
Cancer’s Recognitions To Fail Forcing Style As the Super Classes With Hyper Effects 1057
In The Background of the Framework is So-Called (Neutrosophic) SuperHyperGraphs”, 1058
HG128 [177] Henry Garrett,“Super Actions On The Types of Hyper Levels In The Sensible Neutrosophic 1060
SuperHyperGirth On Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyper- 1061
Graph”, ResearchGate 2023,(doi: 10.13140/RG.2.2.26836.88960). 1062
HG127 [178] Henry Garrett,“SuperHyperGirth Approaches on the Super Challenges on the Cancer’s 1063
Recognition In the Hyper Model of (Neutrosophic) SuperHyperGraph”, ResearchGate 1064

2023,(doi: 10.13140/RG.2.2.36745.93289). 1065
HG126 [179] Henry Garrett,“Extreme SuperHyperClique as the Firm Scheme of Confrontation under 1066
HG125 [180] Henry Garrett,“Uncertainty On The Act And Effect Of Cancer Alongside The Foggy 1069
10.20944/preprints202301.0282.v1). 1072
HG124 [181] Henry Garrett,“Neutrosophic Version Of Separates Groups Of Cells In Cancer’s 1073
10.20944/preprints202301.0267.v1).). 1075

(doi: 10.20944/preprints202301.0265.v1). 1080
HG122 [183] Henry Garrett,“Breaking the Continuity and Uniformity of Cancer In The Worst Case of 1081
prints202301.0262.v1). 1084

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

10.13140/RG.2.2.35061.65767). 1093
HG25 [187] Henry Garrett,“The Focus on The Partitions Obtained By Parallel Moves In The 1094
Cancer’s Extreme Recognition With Different Types of Extreme SuperHyperMatching 1095

Set and Polynomial on (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 1096
10.13140/RG.2.2.18494.15680). 1097
HG26 [188] Henry Garrett,“Extreme Failed SuperHyperClique Decides the Failures on the Can- 1098
cer’s Recognition in the Perfect Connections of Cancer’s Attacks By SuperHy- 1099

perModels Named (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 1100
10.13140/RG.2.2.32530.73922). 1101
HG27 [189] Henry Garrett,“Indeterminacy On The All Possible Connections of Cells In Front 1102
of Cancer’s Attacks In The Terms of Neutrosophic Failed SuperHyperClique on Can- 1103

cer’s Recognition called Neutrosophic SuperHyperGraphs”, ResearchGate 2023, (doi: 1104
10.13140/RG.2.2.15897.70243). 1105
10.13140/RG.2.2.32530.73922). 1109
prints202301.0105.v1). 1112
HG28 [192] Henry Garrett,“Perfect Directions Toward Idealism in Cancer’s Neutrosophic Recogni- 1113
tion Forwarding Neutrosophic SuperHyperClique on Neutrosophic SuperHyperGraphs”, 1114

HG29 [193] Henry Garrett,“Demonstrating Complete Connections in Every Embedded Regions 1116
and Sub-Regions in the Terms of Cancer’s Recognition and (Neutrosophic) Su- 1117
perHyperGraphs With (Neutrosophic) SuperHyperClique”, ResearchGate 2023, (doi: 1118

10.13140/RG.2.2.23172.19849). 1119


HG30 [196] Henry Garrett,“Different Neutrosophic Types of Neutrosophic Regions titled neut- 1126
rosophic Failed SuperHyperStable in Cancer’s Neutrosophic Recognition modeled 1127
in the Form of Neutrosophic SuperHyperGraphs”, ResearchGate 2023, (doi: 1128
10.13140/RG.2.2.17385.36968). 1129
Preprints 2023, 2023010044 1132
10.20944/preprints202301.0043.v1). 1135
HG31 [199] Henry Garrett, “Using the Tool As (Neutrosophic) Failed SuperHyperStable To SuperHy- 1136
perModel Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs”, ResearchGate 1137
2023, (doi: 10.13140/RG.2.2.28945.92007). 1138
SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 1143
10.13140/RG.2.2.35774.77123). 1144
HG35 [203] Henry Garrett, “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Re- 1148
cognitions And (Neutrosophic) SuperHyperGraphs”, ResearchGate 2022, (doi: 1149
10.13140/RG.2.2.29430.88642). 1150
(doi: 10.20944/preprints202212.0549.v1). 1156
(Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, ResearchGate 2022, (doi: 1158
10.13140/RG.2.2.19380.94084). 1159

SuperHyperClasses”, ResearchGate 2022, (doi: 10.13140/RG.2.2.14426.41923). 1167
(doi: 10.20944/preprints202212.0500.v1). 1170
Graph With SuperHyperModeling of Cancer’s Recognitions”, ResearchGate 2022 (doi: 1172
10.13140/RG.2.2.20993.12640). 1173
HG952 [211] Henry Garrett,“Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic 1174

HG95 [212] Henry Garrett, “Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic Su- 1177
perHyperGraphs And SuperHyperGraphs Alongside Applications in Cancer’s Treatments”, 1178
ResearchGate 2022 (doi: 10.13140/RG.2.2.23123.04641). 1179
HG37 [215] Henry Garrett, “Basic Neutrosophic Notions Concerning SuperHyperDominating and 1186
Neutrosophic SuperHyperResolving in SuperHyperGraph”, ResearchGate 2022 (doi: 1187
10.13140/RG.2.2.29173.86244). 1188
HG38 [216] Henry Garrett, “Initial Material of Neutrosophic Preliminaries to Study Some Neutrosophic 1189
Notions Based on Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic SuperHyper- 1190
Graph (NSHG)”, ResearchGate 2022 (doi: 10.13140/RG.2.2.25385.88160). 1191
HG181b [217] Henry Garrett, “Equal Dimension Dominating In SuperHyperGraphs”. Dr. Henry Garrett, 1192
2023 (doi: 10.5281/zenodo.8067469). 1193
HG180b [218] Henry Garrett, “Dimension Dominating In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1194
(doi: 10.5281/zenodo.8062076). 1195
HG179b [219] Henry Garrett, “Reverse Connective Dominating In SuperHyperGraphs”. Dr. Henry 1196
Garrett, 2023 (doi: 10.5281/zenodo.8057817). 1197
HG178b [220] Henry Garrett, “Equal Connective Dominating In SuperHyperGraphs”. Dr. Henry Garrett, 1198
2023 (doi: 10.5281/zenodo.8052976). 1199
HG177b [221] Henry Garrett, “Connective Dominating In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1200
(doi: 10.5281/zenodo.8051368). 1201

HG176b [222] Henry Garrett, “United Dominating In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1202
(doi: 10.5281/zenodo.8027488). 1203
HG175b [223] Henry Garrett, “Zero Forcing In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1204
10.5281/zenodo.8020181). 1205
HG174b [224] Henry Garrett, “Matrix-Based In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1206
10.5281/zenodo.7978921). 1207
HG173b [225] Henry Garrett, “Collections of Math II”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1208
odo.7943878). 1209
HG172b [226] Henry Garrett, “Dominating-Edges In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1210
10.5281/zenodo.7943871). 1211
HG171b [227] Henry Garrett, “Edge-Gap In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1212
10.5281/zenodo.7923786). 1213
HG170b [228] Henry Garrett, “Eulerian-Type-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 1214
2023 (doi: 10.5281/zenodo.7905287). 1215
HG169b [229] Henry Garrett, “Eulerian-Type-Cycle-Decomposition In SuperHyperGraphs”. Dr. Henry 1216

HG168b [230] Henry Garrett, “Eulerian-Type-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 1218
2023 (doi: 10.5281/zenodo.7874677). 1219
HG167b [231] Henry Garrett, “Eulerian-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1220
(doi: 10.5281/zenodo.7857906). 1221
HG166b [232] Henry Garrett, “Eulerian-Cycle-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 1222
2023 (doi: 10.5281/zenodo.7856329). 1223
HG165b [233] Henry Garrett, “Eulerian-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1224
10.5281/zenodo.7854561). 1225
HG164b [234] Henry Garrett, “Eulerian-Type-Path-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 1226
2023 (doi: 10.5281/zenodo.7851893). 1227
HG163b [235] Henry Garrett, “Eulerian-Type-Path-Decomposition In SuperHyperGraphs”. Dr. Henry 1228

HG162b [236] Henry Garrett, “Eulerian-Type-Path-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1230
(doi: 10.5281/zenodo.7835063). 1231
HG161b [237] Henry Garrett, “Eulerian-Path-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1232
(doi: 10.5281/zenodo.7826705). 1233
HG160b [238] Henry Garrett, “Eulerian-Path-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 1234
2023 (doi: 10.5281/zenodo.7820680). 1235
HG159b [239] Henry Garrett, “Eulerian-Path-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1236
10.5281/zenodo.7812750). 1237

HG158b [240] Henry Garrett, “Hamiltonian-Type-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry 1238

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

HG156b [242] Henry Garrett, “Hamiltonian-Type-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 1242
2023 (doi: 10.5281/zenodo.7807782). 1243
HG155b [243] Henry Garrett, “Hamiltonian-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 1244
2023 (doi: 10.5281/zenodo.7804449). 1245
HG154b [244] Henry Garrett, “Hamiltonian-Cycle-Decomposition In SuperHyperGraphs”. Dr. Henry 1246

HG153b [245] Henry Garrett, “Hamiltonian-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1248
(doi: 10.5281/zenodo.7792307). 1249
HG152b [246] Henry Garrett, “Hamiltonian-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1250
(doi: 10.5281/zenodo.7790728). 1251
HG151b [247] Henry Garrett, “Hamiltonian-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 1252
2023 (doi: 10.5281/zenodo.7787712). 1253
HG150b [248] Henry Garrett, “Hamiltonian-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1254
10.5281/zenodo.7783791). 1255
HG149b [249] Henry Garrett, “Trace-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1256
10.5281/zenodo.7780123). 1257
HG148b [250] Henry Garrett, “Trace-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1258
(doi: 10.5281/zenodo.7773119). 1259
HG147b [251] Henry Garrett, “SuperHyperDuality”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1260
odo.7637762). 1261
HG146b [252] Henry Garrett, “Trace-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1262
10.5281/zenodo.7766174). 1263
HG145b [253] Henry Garrett, “Edge-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1264
10.5281/zenodo.7762232). 1265
HG144b [254] Henry Garrett, “Edge-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1266
(doi: 10.5281/zenodo.7758601). 1267
HG143b [255] Henry Garrett, “Edge-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1268
10.5281/zenodo.7754661). 1269
HG142b [256] Henry Garrett, “Vertex-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1270
10.5281/zenodo.7750995) . 1271
HG141b [257] Henry Garrett, “Vertex-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1272
(doi: 10.5281/zenodo.7749875). 1273

HG140b [258] Henry Garrett, “Vertex-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1274
10.5281/zenodo.7747236). 1275
HG139b [259] Henry Garrett, “Stable-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1276
10.5281/zenodo.7742587). 1277
HG138b [260] Henry Garrett, “Stable-Decompositions In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1278
(doi: 10.5281/zenodo.7738635). 1279
HG137b [261] Henry Garrett, “Stable-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1280
10.5281/zenodo.7734719). 1281
HG136b [262] Henry Garrett, “Clique-Neighbors In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1282
10.5281/zenodo.7730484). 1283
HG135b [263] Henry Garrett, “Clique-Decompositions In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1284
(doi: 10.5281/zenodo.7730469). 1285
HG134b [264] Henry Garrett, “Clique-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1286
10.5281/zenodo.7722865). 1287
HG133b [265] Henry Garrett, “Space In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1288
odo.7713563). 1289
odo.7709116). 1291
HG131b [267] Henry Garrett, “Edge-Connectivity In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1292
10.5281/zenodo.7706415). 1293
HG130b [268] Henry Garrett, “Vertex-Connectivity In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1294
10.5281/zenodo.7706063). 1295
HG129b [269] Henry Garrett, “Tree-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1296
10.5281/zenodo.7701906). 1297
HG128b [270] Henry Garrett, “Chord In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1298
odo.7700205). 1299
HG127b [271] Henry Garrett, “(i,j)-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1300
10.5281/zenodo.7694876). 1301
HG126b [272] Henry Garrett, “Edge-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1302
10.5281/zenodo.7679410). 1303
HG125b [273] Henry Garrett, “K-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1304
10.5281/zenodo.7675982). 1305
HG124b [274] Henry Garrett, “K-Number In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1306
10.5281/zenodo.7672388). 1307
HG123b [275] Henry Garrett, “Order In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1308
odo.7668648). 1309

HG122b [276] Henry Garrett, “Coloring In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1310
10.5281/zenodo.7662810). 1311
HG121b [277] Henry Garrett, “Dimension In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1312
10.5281/zenodo.7659162). 1313
HG120b [278] Henry Garrett, “Cancer In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1314
odo.7653233). 1315
HG119b [279] Henry Garrett, “SuperHyperWheel”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1316
odo.7653204). 1317
HG118b [280] Henry Garrett, “SuperHyperMultipartite”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1318
odo.7653142). 1319
HG117b [281] Henry Garrett, “SuperHyperBipartite”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1320
odo.7653117). 1321
HG116b [282] Henry Garrett, “SuperHyperStar”. Dr. Henry Garrett, 2023 (doi: 10.5281/zenodo.7653089). 1322
HG115b [283] Henry Garrett, “SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1323
odo.7651687). 1324
HG114b [284] Henry Garrett, “SuperHyperPath”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1325
odo.7651619). 1326
HG113b [285] Henry Garrett, “SuperHyperDomination”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1327
odo.7651439). 1328
HG112b [286] Henry Garrett, “SuperHyperDominating”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1329
odo.7650729). 1330
HG111b [287] Henry Garrett, “SuperHyperConnected”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1331
odo.7647868). 1332
HG110b [288] Henry Garrett, “SuperHyperTotal”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1333
odo.7647017). 1334
HG109b [289] Henry Garrett, “SuperHyperPerfect”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1335
odo.7644894). 1336
HG108b [290] Henry Garrett, “SuperHyperJoin”. Dr. Henry Garrett, 2023 (doi: 10.5281/zenodo.7641880). 1337
HG107b [291] Henry Garrett, “Path SuperHyperColoring”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1338
odo.7632923). 1339
HG106b [292] Henry Garrett, “SuperHyperDensity”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1340
odo.7623459). 1341
HG105b [293] Henry Garrett, “Neutrosophic SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 1342
10.5281/zenodo.7606416). 1343

HG104b [294] Henry Garrett, “Extreme SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 1344
10.5281/zenodo.7606416). 1345
HG103b [295] Henry Garrett, “SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1346
odo.7606404). 1347
HG102b [296] Henry Garrett, “Neutrosophic SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 1348
10.5281/zenodo.7580018). 1349
HG101b [297] Henry Garrett, “Extreme SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1350
odo.7580018). 1351
odo.7580018). 1353
odo.7579929). 1355
HG98b [300] Henry Garrett, “Neutrosophic SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 1356
10.5281/zenodo.7563170). 1357
HG97b [301] Henry Garrett, “Extreme SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1358
odo.7563164). 1359
HG96b [302] Henry Garrett, “SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1360
odo.7563160). 1361
odo.7563160). 1363
HG94b [304] Henry Garrett, “Overlook On SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 1364
10.5281/zenodo.7563160). 1365
HG93b [305] Henry Garrett, “Neutrosophic SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 1366
10.5281/zenodo.7557063). 1367
HG92b [306] Henry Garrett, “Extreme SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 1368
10.5281/zenodo.7557009). 1369
HG91b [307] Henry Garrett, “Overlook On SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 1370
10.5281/zenodo.7539484). 1371
HG90b [308] Henry Garrett, “Neutrosophic Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1372
10.5281/zenodo.7523390). 1373
HG89b [309] Henry Garrett, “Extreme Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1374
10.5281/zenodo.7523390). 1375
HG88b [310] Henry Garrett, “Overlook On Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1376
10.5281/zenodo.7523390). 1377
HG87b [311] Henry Garrett, “Extreme SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1378
odo.7574952). 1379

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

HG68b [330] Henry Garrett, “Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1416
odo.7523390). 1417
HG67b [331] Henry Garrett, “SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1418
odo.7523357). 1419
HG66b [332] Henry Garrett, “Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1420
odo.7504782). 1421
HG65b [333] Henry Garrett, “SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1422
odo.7499395). 1423
HG64b [334] Henry Garrett, “Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1424
odo.7497450). 1425
HG63b [335] Henry Garrett, “SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1426
odo.7494862). 1427
HG62b [336] Henry Garrett, “SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1428
odo.7493845). 1429
HG61b [337] Henry Garrett, “SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1430
odo.7480110). 1431
HG60b [338] Henry Garrett, “Neut. SuperHyperEdges”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1432
odo.7378758). 1433
HG32b [339] Henry Garrett, “Beyond Neutrosophic Graphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1434
odo.6320305). 1435
HG44b [340] Henry Garrett, “Neutrosophic Duality”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1436
odo.6677173). 1437

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

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

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

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

CHAPTER 5 1546
Extreme Equal Dimension Dominating 1547
Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of SuperHyperDu- 1548
ality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, ResearchGate 1549
2023, (doi: 10.13140/RG.2.2.34953.52320). 1550

Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph By 1551
SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchGate 2023, 1552
(doi: 10.13140/RG.2.2.33275.80161). 1553
Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 1554
10.13140/RG.2.2.11050.90569). 1556
Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of SuperHyperJoin 1557
10.13140/RG.2.2.17761.79206). 1559
10.13140/RG.2.2.19911.37285). 1562
Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect 1563
10.13140/RG.2.2.23266.81602). 1565
10.13140/RG.2.2.19360.87048). 1568
Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal 1569
10.13140/RG.2.2.32363.21286). 1571
10.13140/RG.2.2.11758.69441). 1574
Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of SuperHyperConnected 1575
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 1576
10.13140/RG.2.2.31891.35367). 1577
10.13140/RG.2.2.21510.45125). 1580
51
Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDominating 1581
10.13140/RG.2.2.13121.84321). 1583

CHAPTER 6 1584
New Ideas On Super Dimity By Hyper 1585
Dimple Of Equal Dimension Dominating 1586
In Recognition of Cancer With 1587
(Neutrosophic) SuperHyperGraph 1588
53
CHAPTER 7 1589
ABSTRACT 1590
In this scientific research, (Different Neutrosophic Types of Neutrosophic SuperHyperEqual 1591

Dimension Dominating). Let a Neutrosophic SuperHyperGraph (NSHG) S be a Equal Dimension 1592
0
Dominating pair S = (V, E). Consider a Neutrosophic SuperHyperSet V = {V1 , V2 , . . . , Vs } 1593
0 0 0
and E = {E1 , E2 , . . . , Ez }. Then either V or E is called Neutrosophic e-SuperHyperEqual 1594
Dimension Dominating if the following expression is called Neutrosophic e-SuperHyperEqual Dimension 1595
Dominating criteria holds 1596
∀Ea ∈ EN SHG , ∃Eb ∈ E 0 : ∃Vc ∈ VN SHG , Vc ∈ Ea , Eb

And ∀Ea , Eb ∈ EN SHG , ∃Ec ∈ E 0 : d(Ea , Ec ) ≥ d(Eb , Ec );
Neutrosophic re-SuperHyperEqual Dimension Dominating if the following expression is called Neutro- 1597
sophic e-SuperHyperEqual Dimension Dominating criteria holds 1598

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

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

And ∀Va , Vb ∈ VN SHG , ∃Vc ∈ V 0 : d(Va , Vc ) ≥ d(Vb , Vc );
Neutrosophic rv-SuperHyperEqual Dimension Dominating if the following expression is called 1602
Neutrosophic v-SuperHyperEqual Dimension Dominating criteria holds 1603

and |Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; Neutrosophic Super- 1604
HyperEqual Dimension Dominating if it’s either of Neutrosophic e-SuperHyperEqual Dimension Dominating, 1605
Neutrosophic re-SuperHyperEqual Dimension Dominating, Neutrosophic v-SuperHyperEqual Dimension Dom- 1606
inating, and Neutrosophic rv-SuperHyperEqual Dimension Dominating. ((Neutrosophic) SuperHyperEqual 1607
Dimension Dominating). Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 1608
55
Consider a Neutrosophic SuperHyperEdge (NSHE) E = {V1 , V2 , . . . , Vs }. Then E is called an Ex- 1609

treme SuperHyperEqual Dimension Dominating if it’s either of Neutrosophic e-SuperHyperEqual Dimension 1610
Dominating, Neutrosophic re-SuperHyperEqual Dimension Dominating, Neutrosophic v-SuperHyperEqual 1611
Dimension Dominating, and Neutrosophic rv-SuperHyperEqual Dimension Dominating and C(N SHG) for an 1612
Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme cardinality of an Extreme 1613
SuperHyperSet S of high Extreme cardinality of the Extreme SuperHyperEdges in the consec- 1614
utive Extreme sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such 1615
that they form the Extreme SuperHyperEqual Dimension Dominating; a Neutrosophic SuperHyperEqual 1616
Dimension Dominating if it’s either of Neutrosophic e-SuperHyperEqual Dimension Dominating, Neutrosophic 1617
re-SuperHyperEqual Dimension Dominating, Neutrosophic v-SuperHyperEqual Dimension Dominating, and 1618
Neutrosophic rv-SuperHyperEqual Dimension Dominating and C(N SHG) for a Neutrosophic Super- 1619
HyperGraph N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic 1620
SuperHyperEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality con- 1621

secutive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they 1622
form the Neutrosophic SuperHyperEqual Dimension Dominating; an Extreme SuperHyperEqual Dimen- 1623
sion Dominating SuperHyperPolynomial if it’s either of Neutrosophic e-SuperHyperEqual Dimension 1624
Dimension Dominating, and Neutrosophic rv-SuperHyperEqual Dimension Dominating and C(N SHG) for 1626
an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains 1627

the Extreme coefficients defined as the Extreme number of the maximum Extreme cardinality 1628
of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme cardinal- 1629
ity consecutive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 1630
form the Extreme SuperHyperEqual Dimension Dominating; and the Extreme power is correspon- 1631
ded to its Extreme coefficient; a Neutrosophic SuperHyperEqual Dimension Dominating SuperHyper- 1632
Polynomial if it’s either of Neutrosophic e-SuperHyperEqual Dimension Dominating, Neutrosophic 1633

Neutrosophic rv-SuperHyperEqual Dimension Dominating and C(N SHG) for a Neutrosophic SuperHy- 1635
perGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains the Neutrosophic 1636
coefficients defined as the Neutrosophic number of the maximum Neutrosophic cardinality of 1637
the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic 1638
cardinality consecutive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices 1639

such that they form the Neutrosophic SuperHyperEqual Dimension Dominating; and the Neutrosophic 1640
power is corresponded to its Neutrosophic coefficient; an Extreme V-SuperHyperEqual Dimen- 1641
sion Dominating if it’s either of Neutrosophic e-SuperHyperEqual Dimension Dominating, Neutrosophic 1642
Neutrosophic rv-SuperHyperEqual Dimension Dominating and C(N SHG) for an Extreme SuperHy- 1644
perGraph N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet 1645
S of high Extreme cardinality of the Extreme SuperHyperVertices in the consecutive Ex- 1646
treme sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 1647
form the Extreme SuperHyperEqual Dimension Dominating; a Neutrosophic V-SuperHyperEqual Dimen- 1648

SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consec- 1653
utive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form 1654

the Neutrosophic SuperHyperEqual Dimension Dominating; an Extreme V-SuperHyperEqual Dimension 1655

Dominating SuperHyperPolynomial if it’s either of Neutrosophic e-SuperHyperEqual Dimension Dominat- 1656
ing, Neutrosophic re-SuperHyperEqual Dimension Dominating, Neutrosophic v-SuperHyperEqual Dimension 1657
Dominating, and Neutrosophic rv-SuperHyperEqual Dimension Dominating and C(N SHG) for an Extreme 1658
SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme 1659
coefficients defined as the Extreme number of the maximum Extreme cardinality of the Extreme 1660
SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality consecutive 1661

Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the Extreme 1662
SuperHyperEqual Dimension Dominating; and the Extreme power is corresponded to its Extreme coef- 1663
ficient; a Neutrosophic SuperHyperEqual Dimension Dominating SuperHyperPolynomial if it’s either of 1664
Neutrosophic e-SuperHyperEqual Dimension Dominating, Neutrosophic re-SuperHyperEqual Dimension Dom- 1665
inating, Neutrosophic v-SuperHyperEqual Dimension Dominating, and Neutrosophic rv-SuperHyperEqual 1666
Dimension Dominating and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the 1667
Neutrosophic SuperHyperPolynomial contains the Neutrosophic coefficients defined as the 1668
Neutrosophic number of the maximum Neutrosophic cardinality of the Neutrosophic SuperHy- 1669
perVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive 1670
Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form 1671
the Neutrosophic SuperHyperEqual Dimension Dominating; and the Neutrosophic power is corres- 1672
ponded to its Neutrosophic coefficient. In this scientific research, new setting is introduced 1673
for new SuperHyperNotions, namely, a SuperHyperEqual Dimension Dominating and Neutrosophic 1674
SuperHyperEqual Dimension Dominating. Two different types of SuperHyperDefinitions are debut 1675
for them but the research goes further and the SuperHyperNotion, SuperHyperUniform, and 1676
SuperHyperClass based on that are well-defined and well-reviewed. The literature review is 1677
implemented in the whole of this research. For shining the elegancy and the significancy of this 1678
research, the comparison between this SuperHyperNotion with other SuperHyperNotions and 1679
fundamental SuperHyperNumbers are featured. The definitions are followed by the examples 1680
and the instances thus the clarifications are driven with different tools. The applications are 1681
figured out to make sense about the theoretical aspect of this ongoing research. The “Cancer’s 1682
Recognition” are the under research to figure out the challenges make sense about ongoing and 1683
“Neutrosophic SuperHyperGraph” are chosen and elected to research about “Cancer’s Recog- 1688
nition”. Thus these complex and dense SuperHyperModels open up some avenues to research 1689
on theoretical segments and “Cancer’s Recognition”. Some avenues are posed to pursue this 1690
research. It’s also officially collected in the form of some questions and some problems. Assume 1691
a SuperHyperGraph. Assume a SuperHyperGraph. Then δ−SuperHyperEqual Dimension Dominating 1692
is a maximal of SuperHyperVertices with a maximum cardinality such that either of the 1693
following expressions hold for the (Neutrosophic) cardinalities of SuperHyperNeighbors of 1694
first Expression, holds if S is an δ−SuperHyperOffensive. And the second Expression, holds 1696
if S is an δ−SuperHyperDefensive; a Neutrosophic δ−SuperHyperEqual Dimension Dominating is a 1697
maximal Neutrosophic of SuperHyperVertices with maximum Neutrosophic cardinality such 1698
that either of the following expressions hold for the Neutrosophic cardinalities of SuperHy- 1699
perNeighbors of s ∈ S there are: |S ∩ N (s)|N eutrosophic > |S ∩ (V \ N (s))|N eutrosophic + δ; 1700

and |S ∩ N (s)|N eutrosophic < |S ∩ (V \ N (s))|N eutrosophic + δ. The first Expression, holds 1701
if S is a Neutrosophic δ−SuperHyperOffensive. And the second Expression, holds if S is a 1702
Neutrosophic δ−SuperHyperDefensive It’s useful to define a “Neutrosophic” version of a 1703
SuperHyperEqual Dimension Dominating . Since there’s more ways to get type-results to make a 1704
SuperHyperEqual Dimension Dominating more understandable. For the sake of having Neutrosophic 1705
SuperHyperEqual Dimension Dominating, there’s a need to “redefine” the notion of a “SuperHyperEqual 1706
Dimension Dominating ”. The SuperHyperVertices and the SuperHyperEdges are assigned by the 1707
labels from the letters of the alphabets. In this procedure, there’s the usage of the position 1708
of labels to assign to the values. Assume a SuperHyperEqual Dimension Dominating . It’s redefined 1709
a Neutrosophic SuperHyperEqual Dimension Dominating if the mentioned Table holds, concerning, 1710
“The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges Belong to 1711
The Neutrosophic SuperHyperGraph” with the key points, “The Values of The Vertices & 1712
The Number of Position in Alphabet”, “The Values of The SuperVertices&The maximum 1713
SuperHyperEqual Dimension Dominating . It’s the main. It’ll be disciplinary to have the foundation of 1718
previous definition in the kind of SuperHyperClass. If there’s a need to have all SuperHyperEqual 1719
Dimension Dominating until the SuperHyperEqual Dimension Dominating, then it’s officially called a “Super- 1720
HyperEqual Dimension Dominating” but otherwise, it isn’t a SuperHyperEqual Dimension Dominating . There 1721
are some instances about the clarifications for the main definition titled a “SuperHyperEqual 1722
Dimension Dominating ”. These two examples get more scrutiny and discernment since there are 1723
characterized in the disciplinary ways of the SuperHyperClass based on a SuperHyperEqual 1724
Dimension Dominating . For the sake of having a Neutrosophic SuperHyperEqual Dimension Dominating, 1725
there’s a need to “redefine” the notion of a “Neutrosophic SuperHyperEqual Dimension Dominating” 1726
and a “Neutrosophic SuperHyperEqual Dimension Dominating ”. The SuperHyperVertices and the 1727
And a SuperHyperEqual Dimension Dominating are redefined to a “Neutrosophic SuperHyperEqual 1731

Dimension Dominating” if the intended Table holds. It’s useful to define “Neutrosophic” version 1732
of SuperHyperClasses. Since there’s more ways to get Neutrosophic type-results to make a 1733
Neutrosophic SuperHyperEqual Dimension Dominating more understandable. Assume a Neutrosophic 1734
SuperHyperGraph. There are some Neutrosophic SuperHyperClasses if the intended Table holds. 1735
Thus SuperHyperPath, SuperHyperEqual Dimension Dominating, SuperHyperStar, SuperHyperBi- 1736

partite, SuperHyperMultiPartite, and SuperHyperWheel, are “Neutrosophic SuperHyperPath”, 1737
“Neutrosophic SuperHyperEqual Dimension Dominating”, “Neutrosophic SuperHyperStar”, “Neutro- 1738
sophic SuperHyperBipartite”, “Neutrosophic SuperHyperMultiPartite”, and “Neutrosophic 1739
SuperHyperWheel” if the intended Table holds. A SuperHyperGraph has a “Neutrosophic Su- 1740
perHyperEqual Dimension Dominating” where it’s the strongest [the maximum Neutrosophic value from 1741
all the SuperHyperEqual Dimension Dominating amid the maximum value amid all SuperHyperVertices 1742
from a SuperHyperEqual Dimension Dominating .] SuperHyperEqual Dimension Dominating . A graph is a 1743
are the same. Assume a Neutrosophic SuperHyperGraph. There are some SuperHyperClasses 1745
as follows. It’s SuperHyperPath if it’s only one SuperVertex as intersection amid two given 1746

SuperHyperEdges with two exceptions; it’s SuperHyperEqual Dimension Dominating if it’s only one 1747
SuperVertex as intersection amid two given SuperHyperEdges; it’s SuperHyperStar it’s only one 1748
SuperVertex as intersection amid all SuperHyperEdges; it’s SuperHyperBipartite it’s only one 1749
SuperVertex as intersection amid two given SuperHyperEdges and these SuperVertices, forming 1750
two separate sets, has no SuperHyperEdge in common; it’s SuperHyperMultiPartite it’s only 1751
one SuperVertex as intersection amid two given SuperHyperEdges and these SuperVertices, 1752
cancer on the complex tracks and between complicated groups of cells could be fantasized by 1772
a Neutrosophic SuperHyperPath(-/SuperHyperEqual Dimension Dominating, SuperHyperStar, Super- 1773
HyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find either the 1774
longest SuperHyperEqual Dimension Dominating or the strongest SuperHyperEqual Dimension Dominating 1775
in those Neutrosophic SuperHyperModels. For the longest SuperHyperEqual Dimension Dominating, 1776
called SuperHyperEqual Dimension Dominating, and the strongest SuperHyperEqual Dimension Dominating, 1777
called Neutrosophic SuperHyperEqual Dimension Dominating, some general results are introduced. 1778
Beyond that in SuperHyperStar, all possible SuperHyperPaths have only two SuperHyperEdges 1779
but it’s not enough since it’s essential to have at least three SuperHyperEdges to form any 1780
style of a SuperHyperEqual Dimension Dominating. There isn’t any formation of any SuperHyperEqual 1781
Dimension Dominating but literarily, it’s the deformation of any SuperHyperEqual Dimension Dominating. It, 1782
literarily, deforms and it doesn’t form. A basic familiarity with Neutrosophic SuperHyperEqual 1783
Dimension Dominating theory, SuperHyperGraphs, and Neutrosophic SuperHyperGraphs theory are 1784
proposed. 1785
Keywords: Neutrosophic SuperHyperGraph, SuperHyperEqual Dimension Dominating, Cancer’s 1786
Neutrosophic Recognition 1787


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

Then the research has taken more motivations to define SuperHyperClasses and to find some 1849
connections amid this SuperHyperNotion with other SuperHyperNotions. It motivates us to get 1850
some instances and examples to make clarifications about the framework of this research. The 1851
general results and some results about some connections are some avenues to make key point of 1852
this research, “Cancer’s Recognition”, more understandable and more clear. 1853
The framework of this research is as follows. In the beginning, I introduce basic definitions 1854
to clarify about preliminaries. In the subsection “Preliminaries”, initial definitions about 1855
SuperHyperGraphs and Extreme SuperHyperGraph are deeply-introduced and in-depth- 1856
discussed. The elementary concepts are clarified and illustrated completely and sometimes 1857
review literature are applied to make sense about what’s going to figure out about the upcoming 1858
sections. The main definitions and their clarifications alongside some results about new 1859
notions, SuperHyperEqual Dimension Dominating and Extreme SuperHyperEqual Dimension Dominating, are 1860
figured out in sections “ SuperHyperEqual Dimension Dominating” and “Extreme SuperHyperEqual 1861
Dimension Dominating”. In the sense of tackling on getting results and in Equal Dimension Dominating 1862
to make sense about continuing the research, the ideas of SuperHyperUniform and Extreme 1863
SuperHyperUniform are introduced and as their consequences, corresponded SuperHyperClasses 1864
are figured out to debut what’s done in this section, titled “Results on SuperHyperClasses” 1865
and “Results on Extreme SuperHyperClasses”. As going back to origin of the notions, 1866

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

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

terization of the Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG11s],Definition 2.7,p.3), 1893
[t-norm](Ref.[HG11s], Definition 2.7, p.3), and [Characterization of the Neutrosophic Super- 1894
HyperGraph (NSHG)](Ref.[HG11s],Definition 2.7,p.3), [Neutrosophic Strength of the Neutro- 1895
sophic SuperHyperPaths] (Ref.[HG11s],Definition 5.3,p.7), and [Different Neutrosophic Types 1896
of Neutrosophic SuperHyperEdges (NSHE)] (Ref.[HG11s],Definition 5.4,p.7). Also, the new 1897
ideas and their clarifications are addressed to Ref.[HG38]. 1898

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

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

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

Let X be a Equal Dimension Dominating of points (objects) with generic elements in X denoted by x. A
single valued Neutrosophic set A (SVNS A) is characterized by truth-membership function
TA (x), an indeterminacy-membership function IA (x), and a falsity-membership function FA (x).
For each point x in X, TA (x), IA (x), FA (x) ∈ [0, 1]. A SVNS A can be written as
A = {< x : TA (x), IA (x), FA (x) >, x ∈ X}.
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). 1902
Assume V 0 is a given set. a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E), 1903
where 1904
0
(i) V = {V1 , V2 , . . . , Vn } a finite set of finite single valued Neutrosophic subsets of V ; 1905
(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); 1906
(iii) E = {E1 , E2 , . . . , En0 } a finite set of finite single valued Neutrosophic subsets of V ; 1907
(iv) E = {(Ei0 , TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 )) : TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 ) ≥ 0}, (i 0
= 1908
0
1, 2, . . . , n ); 1909
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 1910
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 1911

P
(vii) i supp(Vi ) = V, (i = 1, 2, . . . , n); 1912
0 0
P
(viii) i0 supp(Ei ) = V, (i = 1, 2, . . . , n ); 1913
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 . 1914
Here the Neutrosophic SuperHyperEdges (NSHE) Ej 0 and the Neutrosophic SuperHyperVertices 1915
(NSHV) Vj are single valued Neutrosophic sets. TV 0 (Vi ), IV 0 (Vi ), and FV 0 (Vi ) denote the 1916
degree of truth-membership, the degree of indeterminacy-membership and the degree of 1917
falsity-membership the Neutrosophic SuperHyperVertex (NSHV) Vi to the Neutrosophic 1918

SuperHyperVertex (NSHV) V. TV0 (Ei0 ), TV0 (Ei0 ), and TV0 (Ei0 ) denote the degree of truth- 1919
membership, the degree of indeterminacy-membership and the degree of falsity-membership 1920
of the Neutrosophic SuperHyperEdge (NSHE) Ei0 to the Neutrosophic SuperHyperEdge 1921
(NSHE) E. Thus, the ii0 th element of the Equal Dimension Dominating of Neutrosophic 1922
SuperHyperGraph (NSHG) are of the form (Vi , TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 )), the sets V and E 1923
are crisp sets. 1924

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

(Ref.[HG11s],Definition 2.7,p.3). 1926
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). The Neutro- 1927
sophic SuperHyperEdges (NSHE) Ei0 and the Neutrosophic SuperHyperVertices (NSHV) Vi of 1928
Neutrosophic SuperHyperGraph (NSHG) S = (V, E) could be characterized as follow-up items. 1929
(i) If |Vi | = 1, then Vi is called vertex; 1930
(ii) if |Vi | ≥ 1, then Vi is called SuperVertex; 1931
(iii) if for all Vi s are incident in Ei0 , |Vi | = 1, and |Ei0 | = 2, then Ei0 is called edge; 1932
(iv) if for all Vi s are incident in Ei0 , |Vi | = 1, and |Ei0 | ≥ 2, then Ei0 is called HyperEdge; 1933
(v) if there’s a Vi is incident in Ei0 such that |Vi | ≥ 1, and |Ei0 | = 2, then Ei0 is called 1934
SuperEdge; 1935
(vi) if there’s a Vi is incident in Ei0 such that |Vi | ≥ 1, and |Ei0 | ≥ 2, then Ei0 is called 1936
SuperHyperEdge. 1937
If we choose different types of binary operations, then we could get hugely diverse types of 1938
general forms of Neutrosophic SuperHyperGraph (NSHG). 1939
Definition 9.0.7 (t-norm). (Ref.[HG11s], Definition 2.7, p.3). 1940

A binary operation ⊗ : [0, 1] × [0, 1] → [0, 1] is a t-norm if it satisfies the following for 1941
x, y, z, w ∈ [0, 1]: 1942
(i) 1 ⊗ x = x; 1943
(ii) x ⊗ y = y ⊗ x; 1944
(iii) x ⊗ (y ⊗ z) = (x ⊗ y) ⊗ z; 1945
(iv) If w ≤ x and y ≤ z then w ⊗ y ≤ x ⊗ z. 1946

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

where 1949

(i) V = {V1 , V2 , . . . , Vn } a finite set of finite single valued Neutrosophic subsets of V 0 ; 1950
(iv) E = {(Ei0 , TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 )) : TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 ) ≥ 0}, (i0 = 1953
1, 2, . . . , n0 ); 1954
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 1955
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 1956
P
(vii) i supp(Vi ) = V, (i = 1, 2, . . . , n); 1957
0 0
P
(viii) i0 supp(Ei ) = V, (i = 1, 2, . . . , n ). 1958
0

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

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

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

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. 2016
(i) If for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | = 2, then NSHP is called path; 2017
(ii) if for all Ej 0 , |Ej 0 | = 2, and there’s Vi , |Vi | ≥ 1, then NSHP is called SuperPath; 2018
(iii) if for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | ≥ 2, then NSHP is called HyperPath; 2019
(iv) if there are Vi , Ej 0 , |Vi | ≥ 1, |Ej 0 | ≥ 2, then NSHP is called Neutrosophic SuperHy- 2020
perPath . 2021
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 2022
(i) Neutrosophic t-strength (min{T (Vi )}, m, n)si=1 ; 2023
(ii) Neutrosophic i-strength (m, min{I(Vi )}, n)si=1 ; 2024
(iii) Neutrosophic f-strength (m, n, min{F (Vi )})si=1 ; 2025
(iv) Neutrosophic strength (min{T (Vi )}, min{I(Vi )}, min{F (Vi )})si=1 . 2026
Definition 9.0.17 (Different Neutrosophic Types of Neutrosophic SuperHyperEdges (NSHE)). 2027

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

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


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

(xii) Neutrosophic Connective if (T (E), I(E), F (E)) ≥ maximum number of Neutrosophic 2040
strength of SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex (NSHV) Vi 2041
to Neutrosophic SuperHyperVertex (NSHV) Vj where 1 ≤ i, j ≤ s. 2042
Definition 9.0.18. (Different Neutrosophic Types of Neutrosophic SuperHyperEqual Dimension 2043

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

or E 0 is called 2047
(i) Neutrosophic e-SuperHyperEqual Dimension Dominating if the following expression is 2048

called Neutrosophic e-SuperHyperEqual Dimension Dominating criteria holds 2049

(ii) Neutrosophic re-SuperHyperEqual Dimension Dominating if the following expression is 2050

called Neutrosophic re-SuperHyperEqual Dimension Dominating criteria holds 2051

and |Ei |NEUTROSOPHIC CARDINALITY = |Ej |NEUTROSOPHIC CARDINALITY ; 2052
(iii) Neutrosophic v-SuperHyperEqual Dimension Dominating if the following expression is 2053
called Neutrosophic v-SuperHyperEqual Dimension Dominating criteria holds 2054

(iv) Neutrosophic rv-SuperHyperEqual Dimension Dominating if the following expression is 2055

and |Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; 2057
(v) Neutrosophic SuperHyperEqual Dimension Dominating if it’s either of Neutrosophic e- 2058

SuperHyperEqual Dimension Dominating, Neutrosophic re-SuperHyperEqual Dimension Dominating, 2059
Neutrosophic v-SuperHyperEqual Dimension Dominating, and Neutrosophic rv-SuperHyperEqual 2060
Dimension Dominating. 2061

Definition 9.0.19. ((Neutrosophic) SuperHyperEqual Dimension Dominating). 2062

(i) an Extreme SuperHyperEqual Dimension Dominating if it’s either of Neutrosophic e- 2065

Dimension Dominating and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is 2068
the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Extreme 2069
cardinality of the Extreme SuperHyperEdges in the consecutive Extreme sequence of 2070

Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 2071
Extreme SuperHyperEqual Dimension Dominating; 2072
(ii) a Neutrosophic SuperHyperEqual Dimension Dominating if it’s either of Neutrosophic 2073

e-SuperHyperEqual Dimension Dominating, Neutrosophic re-SuperHyperEqual Dimension Dominating, 2074
Dimension Dominating and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 2076
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a 2077

Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive Neutrosophic 2078
SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the 2079
Neutrosophic SuperHyperEqual Dimension Dominating; 2080
(iii) an Extreme SuperHyperEqual Dimension Dominating SuperHyperPolynomial if 2081

it’s either of Neutrosophic e-SuperHyperEqual Dimension Dominating, Neutrosophic re- 2082
SuperHyperEqual Dimension Dominating, Neutrosophic v-SuperHyperEqual Dimension Dominating, and 2083
Neutrosophic rv-SuperHyperEqual Dimension Dominating and C(N SHG) for an Extreme Super- 2084
HyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme 2085
coefficients defined as the Extreme number of the maximum Extreme cardinality of the 2086
Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme cardinal- 2087
ity consecutive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that 2088
they form the Extreme SuperHyperEqual Dimension Dominating; and the Extreme power is 2089
corresponded to its Extreme coefficient; 2090
(iv) a Neutrosophic SuperHyperEqual Dimension Dominating SuperHyperPolynomial 2091

if it’s either of Neutrosophic e-SuperHyperEqual Dimension Dominating, Neutrosophic re- 2092
Neutrosophic rv-SuperHyperEqual Dimension Dominating and C(N SHG) for a Neutrosophic 2094
SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains 2095
the Neutrosophic coefficients defined as the Neutrosophic number of the maximum Neutro- 2096
sophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet 2097

S of high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and Neutro- 2098
sophic SuperHyperVertices such that they form the Neutrosophic SuperHyperEqual Dimension 2099
Dominating; and the Neutrosophic power is corresponded to its Neutrosophic coefficient; 2100
(v) an Extreme V-SuperHyperEqual Dimension Dominating if it’s either of Neutrosophic e- 2101



cardinality of the Extreme SuperHyperVertices in the consecutive Extreme sequence of 2106
(vi) a Neutrosophic V-SuperHyperEqual Dimension Dominating if it’s either of Neutrosophic 2109


is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a 2113
(vii) an Extreme V-SuperHyperEqual Dimension Dominating SuperHyperPolynomial if 2117

Neutrosophic rv-SuperHyperEqual Dimension Dominating and C(N SHG) for an Extreme Su- 2120
perHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the 2121
Extreme coefficients defined as the Extreme number of the maximum Extreme cardinality 2122
of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme 2123
cardinality consecutive Extreme SuperHyperEdges and Extreme SuperHyperVertices such 2124

that they form the Extreme SuperHyperEqual Dimension Dominating; and the Extreme power is 2125
(viii) a Neutrosophic SuperHyperEqual Dimension Dominating SuperHyperPolynomial 2127

the Neutrosophic coefficients defined as the Neutrosophic number of the maximum Neut- 2132
rosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHy- 2133
perSet S of high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges 2134
and Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHy- 2135
perEqual Dimension Dominating; and the Neutrosophic power is corresponded to its Neutrosophic 2136
coefficient. 2137
Definition 9.0.20. ((Extreme/Neutrosophic)δ−SuperHyperEqual Dimension Dominating). 2138

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

SuperHyperEqual Dimension Dominating such that either of the following expressions hold for 2141
the Neutrosophic cardinalities of SuperHyperNeighbors of s ∈ S : 2142
|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 2143
(29.1), holds if S is an δ−SuperHyperDefensive; 2144

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

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

of Neutrosophic SuperHyperEqual Dimension Dominating such that either of the following 2146
Neutrosophic expressions hold for the Neutrosophic cardinalities of SuperHyperNeighbors 2147
of s ∈ S : 2148
|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 2149

the Expression (29.1), holds if S is a Neutrosophic δ−SuperHyperDefensive. 2150
For the sake of having a Neutrosophic SuperHyperEqual Dimension Dominating, there’s a need to 2151
“redefine” the notion of “Neutrosophic SuperHyperGraph”. The SuperHyperVertices and the 2152
there’s the usage of the position of labels to assign to the values. 2154
136DEF1 Definition 9.0.21. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 2155
It’s redefined Neutrosophic SuperHyperGraph if the Table (29.1) holds. 2156
It’s useful to define a “Neutrosophic” version of SuperHyperClasses. Since there’s more ways 2157
to get Neutrosophic type-results to make a Neutrosophic more understandable. 2158
136DEF2 Definition 9.0.22. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = 2159

(V, E). There are some Neutrosophic SuperHyperClasses if the Table (29.2) holds. 2160
Thus Neutrosophic SuperHyperPath , SuperHyperEqual Dimension Dominating, SuperHyperStar, 2161

SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, are Neutrosophic 2162
SuperHyperPath, Neutrosophic SuperHyperCycle, Neutrosophic SuperHyperStar, 2163
Neutrosophic SuperHyperBipartite, Neutrosophic SuperHyperMultiPartite, and 2164
Neutrosophic SuperHyperWheel if the Table (29.2) holds. 2165
It’s useful to define a “Neutrosophic” version of a Neutrosophic SuperHyperEqual Dimension 2166
Dominating. Since there’s more ways to get type-results to make a Neutrosophic SuperHyperEqual 2167
Dimension Dominating more Neutrosophicly understandable. 2168
“redefine” the Neutrosophic notion of “Neutrosophic SuperHyperEqual Dimension Dominating”. The 2170
2173

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

136TBL4

136TBL1
136DEF1 Definition 9.0.23. Assume a SuperHyperEqual Dimension Dominating. It’s redefined a Neutrosophic 2174
SuperHyperEqual Dimension Dominating if the Table (29.3) holds. 2175

CHAPTER 10 2176
Extreme SuperHyper But As The Equal Dimension Dominating 2177
Extensions Excerpt From Dense And 2178
Super Forms 2179
Definition 10.0.1. (Extreme event). 2180
Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) 2181
is a probability Equal Dimension Dominating. Any Extreme k-subset of A of V is called Extreme 2182
k-event and if k = 2, then Extreme subset of A of V is called Extreme event. The following 2183
expression is called Extreme probability of A. 2184
X
E(A) = E(a). (10.1)
a∈A
Definition 10.0.2. (Extreme Independent). 2185

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

s-independent if the following expression is called Extreme s-independent criteria 2188
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 2189
following expression is called Extreme independent criteria 2190
E(A ∩ B) = P (A)P (B). (10.2)
Definition 10.0.3. (Extreme Variable). 2191

is a probability Equal Dimension Dominating. Any k-function Equal Dimension Dominating like E is called 2193
Extreme k-Variable. If k = 2, then any 2-function Equal Dimension Dominating like E is called 2194
Extreme Variable. 2195
The notion of independent on Extreme Variable is likewise. 2196
Definition 10.0.4. (Extreme Expectation). 2197
Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) is 2198
77
a probability Equal Dimension Dominating. an Extreme k-Variable E has a number is called Extreme 2199
Expectation if the following expression is called Extreme Expectation criteria 2200
X
Ex(E) = E(α)P (α).
α∈V
Definition 10.0.5. (Extreme Crossing). 2201

a probability Equal Dimension Dominating. an Extreme number is called Extreme Crossing if the 2203
following expression is called Extreme Crossing criteria 2204
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 2205
S = (V, E) is a probability Equal Dimension Dominating. Let m and n propose special Equal Dimension 2206
Dominating. Then with m ≥ 4n, 2207
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 Equal Dimension Dominating p := 4n/m, and set H := G[S] and H := G[S].
Define random variables X, Y, Z on V as follows: X is the Extreme number of SuperHyperVer-
tices, Y the Extreme number of SuperHyperEdges, and Z the Extreme number of crossings of H.
The trivial bound noted above, when applied to H, yields the inequality Z ≥ cr(H) ≥ Y − 3X.
By linearity of Extreme Expectation,
E(Z) ≥ E(Y ) − 3E(X).
Now E(X) = pn, E(Y ) = p2 m (each SuperHyperEdge having some SuperHyperEnds) and
E(Z) = p4 cr(G) (each crossing being defined by some SuperHyperVertices). Hence
p4 cr(G) ≥ p2 m − 3pn.
Dividing both sides by p4 , we have: 2208
pm − 3n n 1 3 2
cr(G) ≥ 3
= 3 = m n .
p (4n/m) 64
2209
Theorem 10.0.7. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). 2210
Consider S = (V, E) is a probability Equal Dimension Dominating. Let P be a SuperHyperSet of n 2211
points in the plane, and let l be the Extreme number of √ SuperHyperLines in the plane passing 2212
through at least k + 1 of these points, where 1 ≤ k ≤ 2 2n. Then l < 32n2 /k 3 . 2213
Proof. Form an Extreme SuperHyperGraph G with SuperHyperVertex SuperHyperSet P whose 2214

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

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

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

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

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

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

S = (V, E) is a probability Equal Dimension Dominating. Let X be an Extreme Variable and let t be 2273
a positive real number. Then 2274
2
2 Ex((X − Ex(X)) ) V (X)
E(|X − Ex(X)| ≥ t) = E((X − Ex(X)) ≥ t2 ) ≤ 2
= .
t t2
2275
Consider S = (V, E) is a probability Equal Dimension Dominating. Let Xn be an Extreme Variable in a 2277
probability Equal Dimension Dominating (Vn , En ), n ≥ 1. If Ex(Xn ) 6= 0 and V (Xn ) << E 2 (Xn ), then 2278
E(Xn = 0) → 0 as n → ∞
S = (V, E) is a probability Equal Dimension Dominating. Set X := Xn and t := |Ex(Xn )| in 2280
Chebyshev’s Inequality, and observe that E(Xn = 0) ≤ E(|Xn − Ex(Xn )| ≥ |Ex(Xn )|) because 2281
|Xn − Ex(Xn )| = |Ex(Xn )| when Xn = 0. 2282
Consider S = (V, E) is a probability Equal Dimension Dominating. Let G ∈ Gn,1/2 . For 0 ≤ k ≤ n, set 2284
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 2285
one. Then almost surely α(G) takes one of the three values k ∗ − 2, k ∗ − 1, k ∗ . 2286
S = (V, E) is a probability Equal Dimension Dominating. As in the proof of related Theorem, the 2288
result is straightforward. 2289
Consider S = (V, E) is a probability Equal Dimension Dominating. Let G ∈ Gn,1/2 and let f and k ∗ be 2291
as defined in previous Theorem. Then either: 2292
(i). f (k ∗ ) << 1, in which case almost surely α(G) is equal to either k ∗ − 2 or k ∗ − 1, or 2293
(ii). f (k ∗ − 1) >> 1, in which case almost surely α(G) is equal to either k ∗ − 1 or k ∗ . 2294
S = (V, E) is a probability Equal Dimension Dominating. The latter is straightforward. 2296
Definition 10.0.17. (Extreme Threshold). 2297
a probability Equal Dimension Dominating. Let P be a monotone property of SuperHyperGraphs (one 2299
which is preserved when SuperHyperEdges are added). Then a Extreme Threshold for P is 2300
a function f (n) such that: 2301
(i). if p << f (n), then G ∈ Gn,p almost surely does not have P, 2302
(ii). if p >> f (n), then G ∈ Gn,p almost surely has P. 2303

Definition 10.0.18. (Extreme Balanced). 2304

a probability Equal Dimension Dominating. Let F be a fixed Extreme SuperHyperGraph. Then 2306
there is a threshold function for the property of containing a copy of F as an Extreme 2307
SubSuperHyperGraph is called Extreme Balanced. 2308
Consider S = (V, E) is a probability Equal Dimension Dominating. Let F be a nonempty balanced 2310
Extreme SubSuperHyperGraph with k SuperHyperVertices and l SuperHyperEdges. Then n−k/l 2311

is a threshold function for the property of containing F as an Extreme SubSuperHyperGraph. 2312
136EXM1 Example 10.0.20. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E) in 2315
the mentioned Extreme Figures in every Extreme items. 2316
• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperEqual 2317
Dimension Dominating, is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 2318
are some empty Extreme SuperHyperEdges but E2 is a loop Extreme SuperHyperEdge and 2319
E4 is an Extreme SuperHyperEdge. Thus in the terms of Extreme SuperHyperNeighbor, 2320
there’s only one Extreme SuperHyperEdge, namely, E4 . The Extreme SuperHyperVertex, 2321
V3 is Extreme isolated means that there’s no Extreme SuperHyperEdge has it as an 2322
Extreme endpoint. Thus the Extreme SuperHyperVertex, V3 , is excluded in every given 2323
Extreme SuperHyperEqual Dimension Dominating. 2324
C(N SHG)Extreme Equal Dimension Dominating =

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

SuperHyperEdge. Thus in the terms of Extreme SuperHyperNeighbor, there’s only 2329
one Extreme SuperHyperEdge, namely, E4 . The Extreme SuperHyperVertex, V3 is 2330
Extreme isolated means that there’s no Extreme SuperHyperEdge has it as an Extreme 2331
endpoint. Thus the Extreme SuperHyperVertex, V3 , is excluded in every given Extreme 2332
SuperHyperEqual Dimension Dominating. 2333

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

{}.
= 0z 0 .
{}.
= 0z 0 .
2337



{}.
= 0z 0 .
{}.
= 0z 0 .
2340

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

= z 7−c .
2343

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

{EN SHG − {Ei }}.

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

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

= z 3−a .
2352

{E3i+1 , E23 }3i=0 .
= z 3−a .
{V3i+1 , V11 }3i=0 .
= z 3−a .
2355

{EN SHG − {E1 , E5 }}.



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

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


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

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


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

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


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

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


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

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


{V2 , V17 , V7 , V27 }.

= z 2−a .
2379

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


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

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


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

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


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

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

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

(V, E). There’s only one Extreme SuperHyperEdge E ∈ EESHG:(V,E) has only the maximum 2401
possibilities of the distinct interior Extreme SuperHyperVertices inside of any given Extreme 2402
quasi-R-Equal Dimension Dominating minus all Extreme SuperHypeNeighbor to some of them but not 2403
all of them. In other words, there’s only an unique Extreme SuperHyperEdge E ∈ EESHG:(V,E) 2404
has only two distinct Extreme SuperHyperVertices in an Extreme quasi-R-Equal Dimension Dominating, 2405
minus all Extreme SuperHypeNeighbor to some of them but not all of them. 2406
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-Equal Dimension Dominating is at least
V \ (V \ {aE , bE , cE , . . . , zE }).
It’s straightforward that the Extreme cardinality of the Extreme R-Equal Dimension Dominating is at least 2407
the maximum Extreme number of Extreme SuperHyperVertices of the Extreme SuperHyperEdges 2408
with the maximum number of the Extreme SuperHyperEdges. In other words, the maximum 2409

SuperHyperEqual Dimension Dominating in the Extreme Example (42.0.3) 95NHG2
number of the Extreme SuperHyperEdges contains the maximum Extreme number of Extreme 2410
SuperHyperVertices are renamed to Extreme Equal Dimension Dominating in some cases but the 2411
maximum number of the Extreme SuperHyperEdge with the maximum Extreme number of 2412
Extreme SuperHyperVertices, has the Extreme SuperHyperVertices are contained in an Extreme 2413
R-Equal Dimension Dominating. 2414
Proposition 10.0.24. Assume a simple Extreme SuperHyperGraph ESHG : (V, E). Then the
Extreme number of type-result-R-Equal Dimension Dominating has, the least Extreme cardinality, the
lower sharp Extreme bound for Extreme cardinality, is the Extreme cardinality of
V \ V \ {aE , bE 0 , cE 00 , cE 000 }E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .
If there’s an Extreme type-result-R-Equal Dimension Dominating with the least Extreme cardinality, the 2415
lower sharp Extreme bound for cardinality. 2416
Proposition 10.0.25. Assume a connected loopless Extreme SuperHyperGraph ESHG : (V, E). 2417
Then in the worst case, literally, 2418
C(N SHG)ExtremeQuasi−EqualDimensionDominating
= {V1 , E1 , V2 , E2 , V3 , E3 , V4 , E4 , V1 }.
C(N SHG)ExtremeQuasi−EqualDimensionDominatingSuperHyperP olynomial = z 4 .
C(N SHG)ExtremeQuasi−EqualDimensionDominating = {V1 , V2 , V3 , V4 , V1 }.
C(N SHG)ExtremeR−Quasi−EqualDimensionDominatingSuperHyperP olynomial = z 5 .

Is an Extreme type-result-Equal Dimension Dominating. In other words, the least cardinality, the lower 2419
sharp bound for the cardinality, of an Extreme type-result-Equal Dimension Dominating is the cardinality 2420
of 2421
= {V1 , E1 , V2 , E2 , V3 , E3 , V4 , E4 , V1 }.
C(N SHG)ExtremeQuasi−EqualDimensionDominatingSuperHyperP olynomial = z 4 .
C(N SHG)ExtremeQuasi−EqualDimensionDominating = {V1 , V2 , V3 , V4 , V1 }.
C(N SHG)ExtremeR−Quasi−EqualDimensionDominatingSuperHyperP 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-Equal Dimension Dominating
since neither amount of Extreme SuperHyperEdges nor amount of SuperHyperVertices where
amount refers to the Extreme number of SuperHyperVertices(-/SuperHyperEdges) more than
one to form any kind of SuperHyperEdges or any number of SuperHyperEdges. Let us consider
the Extreme SuperHyperSet
V \ V \ {aE , bE , cE , . . . , aE 0 , bE 0 , cE 0 , . . .}E,E 0 ={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .
This Extreme SuperHyperSet of the Extreme SuperHyperVertices has the eligibilities to propose
property such that there’s no Extreme SuperHyperVertex of an Extreme SuperHyperEdge is
common and there’s an Extreme SuperHyperEdge for all Extreme SuperHyperVertices but the
maximum Extreme cardinality indicates that these Extreme type-SuperHyperSets couldn’t give
us the Extreme lower bound in the term of Extreme sharpness. In other words, the Extreme
SuperHyperSet
V \ V \ {aE , bE , cE , . . . , aE 0 , bE 0 , cE 0 , . . .}E,E 0 ={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }}
of the Extreme SuperHyperVertices implies at least on-quasi-triangle style is up but sometimes

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

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

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

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

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

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

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

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

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

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

2423
Extreme R-Equal Dimension Dominating =

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

is fixed that means Ex = E ∈ EESHG:(V,E) . for all Extreme intended SuperHyperVertices
but in an Extreme Equal Dimension Dominating, Ex = E ∈ EESHG:(V,E) could be different and it’s
not unique. To sum them up, in a connected Extreme SuperHyperGraph ESHG : (V, E). If
an Extreme SuperHyperEdge E ∈ EESHG:(V,E) has z Extreme SuperHyperVertices, then the
Extreme cardinality of the Extreme R-Equal Dimension Dominating is at least
V \ (V \ {aE , bE , cE , . . . , zE }).
It’s straightforward that the Extreme cardinality of the Extreme R-Equal Dimension Dominating 2424
is at least the maximum Extreme number of Extreme SuperHyperVertices of the Extreme 2425
SuperHyperEdges with the maximum number of the Extreme SuperHyperEdges. In other 2426
words, the maximum number of the Extreme SuperHyperEdges contains the maximum Extreme 2427
number of Extreme SuperHyperVertices are renamed to Extreme Equal Dimension Dominating in some 2428
cases but the maximum number of the Extreme SuperHyperEdge with the maximum Extreme 2429
number of Extreme SuperHyperVertices, has the Extreme SuperHyperVertices are contained in 2430
an Extreme R-Equal Dimension Dominating. 2431
The obvious SuperHyperGraph has no Extreme SuperHyperEdges. But the non-obvious 2432
Extreme SuperHyperModel is up. The quasi-SuperHyperModel addresses some issues about 2433
the Extreme optimal SuperHyperObject. It specially delivers some remarks on the Extreme 2434
SuperHyperSet of the Extreme SuperHyperVertices such that there’s distinct amount of Extreme 2435
SuperHyperEdges for distinct amount of Extreme SuperHyperVertices up to all taken from that 2436
Extreme SuperHyperSet of the Extreme SuperHyperVertices but this Extreme SuperHyperSet of 2437
the Extreme SuperHyperVertices is either has the maximum Extreme SuperHyperCardinality or 2438
it doesn’t have maximum Extreme SuperHyperCardinality. In a non-obvious SuperHyperModel, 2439
there’s at least one Extreme SuperHyperEdge containing at least all Extreme SuperHyperVertices. 2440
Thus it forms an Extreme quasi-R-Equal Dimension Dominating where the Extreme completion of the 2441
Extreme incidence is up in that. Thus it’s, literarily, an Extreme embedded R-Equal Dimension 2442
Dominating. The SuperHyperNotions of embedded SuperHyperSet and quasi-SuperHyperSet 2443
coincide. In the original setting, these types of SuperHyperSets only don’t satisfy on the 2444
maximum SuperHyperCardinality. Thus the embedded setting is elected such that those 2445
SuperHyperSets have the maximum Extreme SuperHyperCardinality and they’re Extreme 2446
SuperHyperOptimal. The less than two distinct types of Extreme SuperHyperVertices are 2447
included in the minimum Extreme style of the embedded Extreme R-Equal Dimension Dominating. 2448
The interior types of the Extreme SuperHyperVertices are deciders. Since the Extreme number 2449
of SuperHyperNeighbors are only affected by the interior Extreme SuperHyperVertices. The 2450
common connections, more precise and more formal, the perfect unique connections inside 2451
the Extreme SuperHyperSet for any distinct types of Extreme SuperHyperVertices pose the 2452
Extreme R-Equal Dimension Dominating. Thus Extreme exterior SuperHyperVertices could be used 2453
only in one Extreme SuperHyperEdge and in Extreme SuperHyperRelation with the interior 2454
Extreme SuperHyperVertices in that Extreme SuperHyperEdge. In the embedded Extreme 2455
Equal Dimension Dominating, there’s the usage of exterior Extreme SuperHyperVertices since they’ve 2456

more connections inside more than outside. Thus the title “exterior” is more relevant than 2457
the title “interior”. One Extreme SuperHyperVertex has no connection, inside. Thus, the 2458
Extreme SuperHyperSet of the Extreme SuperHyperVertices with one SuperHyperElement 2459
has been ignored in the exploring to lead on the optimal case implying the Extreme R-Equal 2460
Dimension Dominating. The Extreme R-Equal Dimension Dominating with the exclusion of the exclusion 2461
of all Extreme SuperHyperVertices in one Extreme SuperHyperEdge and with other terms, 2462
the Extreme R-Equal Dimension Dominating with the inclusion of all Extreme SuperHyperVertices in 2463
one Extreme SuperHyperEdge, is an Extreme quasi-R-Equal Dimension Dominating. To sum them 2464
up, in a connected non-obvious Extreme SuperHyperGraph ESHG : (V, E). There’s only 2465
one Extreme SuperHyperEdge E ∈ EESHG:(V,E) has only the maximum possibilities of the 2466
distinct interior Extreme SuperHyperVertices inside of any given Extreme quasi-R-Equal Dimension 2467
Dominating minus all Extreme SuperHypeNeighbor to some of them but not all of them. In other 2468
words, there’s only an unique Extreme SuperHyperEdge E ∈ EESHG:(V,E) has only two distinct 2469
Extreme SuperHyperVertices in an Extreme quasi-R-Equal Dimension Dominating, minus all Extreme 2470
SuperHypeNeighbor to some of them but not all of them. 2471
The main definition of the Extreme R-Equal Dimension Dominating has two titles. an Extreme quasi-R- 2472
Equal Dimension Dominating and its corresponded quasi-maximum Extreme R-SuperHyperCardinality 2473
are two titles in the terms of quasi-R-styles. For any Extreme number, there’s an Extreme 2474
quasi-R-Equal Dimension Dominating with that quasi-maximum Extreme SuperHyperCardinality in 2475

the terms of the embedded Extreme SuperHyperGraph. If there’s an embedded Extreme 2476
SuperHyperGraph, then the Extreme quasi-SuperHyperNotions lead us to take the collection of 2477
all the Extreme quasi-R-Equal Dimension Dominatings for all Extreme numbers less than its Extreme 2478
corresponded maximum number. The essence of the Extreme Equal Dimension Dominating ends up 2479
but this essence starts up in the terms of the Extreme quasi-R-Equal Dimension Dominating, again 2480
and more in the operations of collecting all the Extreme quasi-R-Equal Dimension Dominatings acted 2481
on the all possible used formations of the Extreme SuperHyperGraph to achieve one Extreme 2482
number. This Extreme number is 2483
considered as the equivalence class for all corresponded quasi-R-Equal Dimension Dominatings. 2484
Let zExtreme Number , SExtreme SuperHyperSet and GExtreme Equal Dimension Dominating be an Extreme 2485
number, an Extreme SuperHyperSet and an Extreme Equal Dimension Dominating. Then 2486
[zExtreme Number ]Extreme Class = {SExtreme SuperHyperSet |

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

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

To get more precise perceptions, the follow-up expressions propose another formal technical 2489
definition for the Extreme Equal Dimension Dominating. 2490
GExtreme Equal Dimension Dominating =

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

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

= max zExtreme Number

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


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


2496

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

2497


2498


Now, the extension of these types of approaches is up. Since the new term, “Extreme Super- 2499
HyperNeighborhood”, could be redefined as the collection of the Extreme SuperHyperVertices 2500
such that any amount of its Extreme SuperHyperVertices are incident to an Extreme SuperHy- 2501
perEdge. It’s, literarily, another name for “Extreme Quasi-Equal Dimension Dominating” but, precisely, 2502
it’s the generalization of “Extreme Quasi-Equal Dimension Dominating” since “Extreme Quasi-Equal 2503
Dimension Dominating” happens “Extreme Equal Dimension Dominating” in an Extreme SuperHyperGraph 2504
as initial framework and background but “Extreme SuperHyperNeighborhood” may not happens 2505
“Extreme Equal Dimension Dominating” in an Extreme SuperHyperGraph as initial framework and 2506
preliminarily background since there are some ambiguities about the Extreme SuperHyperCar- 2507
dinality arise from it. To get orderly keywords, the terms, “Extreme SuperHyperNeighborhood”, 2508
“Extreme Quasi-Equal Dimension Dominating”, and “Extreme Equal Dimension Dominating” are up. 2509
Thus, let 2510

zExtreme Number , NExtreme SuperHyperNeighborhood and 2511
GExtreme Equal Dimension Dominating be an Extreme number, an Extreme SuperHyperNeighborhood 2512
and an Extreme Equal Dimension Dominating and the new terms are up. 2513
GExtreme Equal Dimension Dominating ∈ ∪zExtreme Number

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


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

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

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

2517

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

2518


2519


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

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

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

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

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

includes only one Extreme SuperHyperVertex. But the Extreme SuperHyperSet of Extreme
SuperHyperVertices,
doesn’t have less than two SuperHyperVertices inside the intended Extreme SuperHyperSet
since they’ve come from at least so far an SuperHyperEdge. Thus the non-obvious simple
Extreme type-SuperHyperSet of the Extreme R-Equal Dimension Dominating is up. To sum them up,
the Extreme SuperHyperSet of Extreme SuperHyperVertices,
Is the non-obvious simple Extreme type-SuperHyperSet of the Extreme R-Equal Dimension Dominating.
Since the Extreme SuperHyperSet of the Extreme SuperHyperVertices,
(V \ V \ {x, z}) ∪ {xy}
or
(V \ V \ {x, z}) ∪ {zy}
is an Extreme R-Equal Dimension Dominating C(ESHG) for an Extreme SuperHyperGraph
ESHG : (V, E) is the Extreme SuperHyperSet S of Extreme SuperHyperVertices such
that there’s no an Extreme SuperHyperEdge for some Extreme SuperHyperVertices instead of
all given by that Extreme type-SuperHyperSet called the Extreme Equal Dimension Dominating and
it’s an Extreme Equal Dimension Dominating. Since it’s
the maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme Su-

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

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

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

“Extreme R-Equal Dimension Dominating” 2524
amid those obvious[non-obvious] simple Extreme type-SuperHyperSets called the 2525
Extreme R-Equal Dimension Dominating, 2526
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-Equal Dimension Dominating amid those obvious simple Extreme type-SuperHyperSets of
the Extreme Equal Dimension Dominating, are
In a connected Extreme SuperHyperGraph ESHG : (V, E).

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

Assume a connected Extreme SuperHyperGraph ESHG : (V, E). Let an Extreme SuperHy- 2533
perEdge ESHE : E ∈ EESHG:(V,E) has some Extreme SuperHyperVertices r. Consider all 2534
Extreme numbers of those Extreme SuperHyperVertices from that Extreme SuperHyperEdge 2535
excluding excluding more than r distinct Extreme SuperHyperVertices, exclude to any given 2536
Extreme SuperHyperSet of the Extreme SuperHyperVertices. Consider there’s an Extreme 2537
R-Equal Dimension Dominating with the least cardinality, the lower sharp Extreme bound for Extreme 2538
cardinality. Assume a connected Extreme SuperHyperGraph ESHG : (V, E). The Extreme 2539
SuperHyperSet of the Extreme SuperHyperVertices VESHE \ {z} is an Extreme SuperHyperSet 2540
S of the Extreme SuperHyperVertices such that there’s an Extreme SuperHyperEdge to have 2541
some Extreme SuperHyperVertices uniquely but it isn’t an Extreme R-Equal Dimension Dominating. 2542
Since it doesn’t have 2543
2544

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

perVertices such that there’s an Extreme SuperHyperEdge to have some SuperHyperVertices 2546
uniquely. The Extreme SuperHyperSet of the Extreme SuperHyperVertices VESHE ∪ {z} is 2547
the maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme SuperHyper- 2548
Vertices but it isn’t an Extreme R-Equal Dimension Dominating. Since it doesn’t do the Extreme 2549
procedure such that such that there’s an Extreme SuperHyperEdge to have some Extreme 2550
SuperHyperVertices uniquely [there are at least one Extreme SuperHyperVertex outside 2551
implying there’s, sometimes in the connected Extreme SuperHyperGraph ESHG : (V, E), 2552
an Extreme SuperHyperVertex, titled its Extreme SuperHyperNeighbor, to that Extreme 2553
SuperHyperVertex in the Extreme SuperHyperSet S so as S doesn’t do “the Extreme pro- 2554
cedure”.]. There’s only one Extreme SuperHyperVertex outside the intended Extreme 2555
SuperHyperSet, VESHE ∪ {z}, in the terms of Extreme SuperHyperNeighborhood. Thus the 2556
obvious Extreme R-Equal Dimension Dominating, VESHE is up. The obvious simple Extreme type- 2557
SuperHyperSet of the Extreme R-Equal Dimension Dominating, VESHE , is an Extreme SuperHyperSet, 2558
VESHE , includes only all Extreme SuperHyperVertices does forms any kind of Extreme 2559
pairs are titled Extreme SuperHyperNeighbors in a connected Extreme SuperHyperGraph 2560
ESHG : (V, E). Since the Extreme SuperHyperSet of the Extreme SuperHyperVertices VESHE , 2561
is the maximum Extreme SuperHyperCardinality of an Extreme SuperHyperSet S of 2562
Extreme SuperHyperVertices such that there’s an Extreme SuperHyperEdge to have some 2563
Extreme SuperHyperVertices uniquely. Thus, in a connected Extreme SuperHyperGraph 2564
ESHG : (V, E). Any Extreme R-Equal Dimension Dominating only contains all interior Extreme 2565
SuperHyperVertices and all exterior Extreme SuperHyperVertices from the unique Extreme 2566
SuperHyperEdge where there’s any of them has all possible Extreme SuperHyperNeighbors in 2567
and there’s all Extreme SuperHyperNeighborhoods in with no exception minus all Extreme 2568
SuperHypeNeighbors to some of them not all of them but everything is possible about Extreme 2569
SuperHyperNeighborhoods and Extreme SuperHyperNeighbors out. 2570
The SuperHyperNotion, namely, Equal Dimension Dominating, is up. There’s neither empty Su- 2571
perHyperEdge nor loop SuperHyperEdge. The following Extreme SuperHyperSet of Ex- 2572
treme SuperHyperEdges[SuperHyperVertices] is the simple Extreme type-SuperHyperSet 2573
of the Extreme Equal Dimension Dominating. The Extreme SuperHyperSet of Extreme SuperHy- 2574
perEdges[SuperHyperVertices], 2575
|EESHG:(V,E) |Extreme Cardinality
b c
= {E2i−1 }i=1 2
.
C(N SHG)ExtremeQuasi−EqualDimensionDominatingSuperHyperP olynomial
= 2z b 2 c
.
C(N SHG)ExtremeR−Quasi−EqualDimensionDominating = {Vi }si=1 , {Vj }tj=1 .
C(N SHG)ExtremeR−Quasi−EqualDimensionDominatingSuperHyperP olynomial
= az s + bz t .
is the simple Extreme type-SuperHyperSet of the Extreme Equal Dimension Dominating. The Extreme 2576
SuperHyperSet of the Extreme SuperHyperEdges[SuperHyperVertices], 2577

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

ESHG : (V, E) is an Extreme type-SuperHyperSet with 2579
2580
the maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme Su- 2581
perHyperEdges[SuperHyperVertices] such that there’s no Extreme SuperHyperVertex of an 2582

Extreme SuperHyperEdge is common and there’s an Extreme SuperHyperEdge for all Extreme 2583
SuperHyperVertices. There are not only two Extreme SuperHyperVertices inside the intended 2584
Extreme SuperHyperSet. Thus the non-obvious Extreme Equal Dimension Dominating is up. The 2585
obvious simple Extreme type-SuperHyperSet called the Extreme Equal Dimension Dominating is an 2586
Extreme SuperHyperSet includes only two Extreme SuperHyperVertices. But the Extreme 2587
SuperHyperSet of the Extreme SuperHyperEdges[SuperHyperVertices], 2588
b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Doesn’t have less than three SuperHyperVertices inside the intended Extreme SuperHyper- 2589
Set. Thus the non-obvious simple Extreme type-SuperHyperSet of the Extreme Equal Dimension 2590
Dominating is up. To sum them up, the Extreme SuperHyperSet of the Extreme SuperHy- 2591
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 Equal Dimension Dominating. 2593
Since the Extreme SuperHyperSet of the Extreme SuperHyperEdges[SuperHyperVertices], 2594
b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Is an Extreme Equal Dimension Dominating C(ESHG) for an Extreme SuperHyperGraph ESHG : 2595
(V, E) is the Extreme SuperHyperSet S of Extreme SuperHyperVertices such that there’s 2596
no an Extreme SuperHyperEdge for some Extreme SuperHyperVertices given by that Ex- 2597
treme type-SuperHyperSet called the Extreme Equal Dimension Dominating and it’s an Extreme 2598
Equal Dimension Dominating. Since it’s 2599
2600
the maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme Su- 2601
perHyperEdges[SuperHyperVertices] such that there’s no Extreme SuperHyperVertex of an 2602

Extreme SuperHyperEdge is common and there’s an Extreme SuperHyperEdge for all Extreme 2603
SuperHyperVertices. There aren’t only less than three Extreme SuperHyperVertices inside the 2604
intended Extreme SuperHyperSet, 2605
b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Thus the non-obvious Extreme Equal Dimension Dominating , 2606
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 Equal Dimension Dominating , 2607
not: 2608
b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Is the Extreme SuperHyperSet, not: 2609
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 2610
ESHG : (V, E). It’s interesting to mention that the only non-obvious simple Extreme type- 2611
SuperHyperSet called the 2612
“Extreme Equal Dimension Dominating ” 2613
amid those obvious[non-obvious] simple Extreme type-SuperHyperSets called the 2614
Extreme ,
Equal Dimension Dominating 2615
is only and only 2616
b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
In a connected Extreme SuperHyperGraph ESHG : (V, E). 2617

CHAPTER 11 2618
The Extreme Departures on The 2619
Theoretical Results Toward Theoretical 2620
Motivations 2621
The previous Extreme approach apply on the upcoming Extreme results on Extreme 2622
SuperHyperClasses. 2623
Proposition 11.0.1. Assume a connected Extreme SuperHyperPath ESHP : (V, E). Then 2624

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

Dimension Dominating in the Example (42.0.5) 136NSHG18a
...,
EXT ERN AL
E |EN SHG | , V |EN SHG |
3 3
be a longest path taken from a connected Extreme SuperHyperPath ESHP : (V, E). There’s a 2627
new way to redefine as 2628
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 2629
to ViEXT ERN AL in the literatures of SuperHyperEqual Dimension Dominating. The latter is 2630
straightforward. 2631
136EXM18a Example 11.0.2. In the Figure (31.1), the connected Extreme SuperHyperPath ESHP : (V, E), 2632
is highlighted and featured. The Extreme SuperHyperSet, in the Extreme SuperHyperModel 2633
(31.1), is the SuperHyperEqual Dimension Dominating. 2634
Proposition 11.0.3. Assume a connected Extreme SuperHyperCycle ESHC : (V, E). Then 2635

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

136EXM19a Example 11.0.4. In the Figure (31.2), the connected Extreme SuperHyperCycle N SHC : 2643
(V, E), is highlighted and featured. The obtained Extreme SuperHyperSet, in the Extreme 2644
SuperHyperModel (31.2), is the Extreme SuperHyperEqual Dimension Dominating. 2645

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

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

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

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

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

136EXM20a Example 11.0.6. In the Figure (31.3), the connected Extreme SuperHyperStar ESHS : (V, E), 2654
is highlighted and featured. The obtained Extreme SuperHyperSet, by the Algorithm in previous 2655
Extreme result, of the Extreme SuperHyperVertices of the connected Extreme SuperHyperStar 2656
ESHS : (V, E), in the Extreme SuperHyperModel (31.3), is the Extreme SuperHyperEqual 2657
Proposition 11.0.7. Assume a connected Extreme SuperHyperBipartite ESHB : (V, E). Then 2659

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


= z b−a .
{VN SHG − {VPi , VPj }i6=j }.
= z b−a .
Proof. Let 2660
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
2661
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 2662
a new way to redefine as 2663

straightforward. Then there’s no at least one SuperHyperEqual Dimension Dominating. Thus the 2666
notion of quasi may be up but the SuperHyperNotions based on SuperHyperEqual Dimension 2667
Dominating could be applied. There are only two SuperHyperParts. Thus every SuperHyperPart 2668
could have one SuperHyperVertex as the representative in the 2669
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperEqual Dimension Dominating taken from a connected Extreme SuperHyperBi- 2670
partite ESHB : (V, E). Thus only some SuperHyperVertices and only minimum-Extreme-of- 2671
SuperHyperPart SuperHyperEdges are attained in any solution 2672
P :

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

Extreme SuperHyperEqual Dimension Dominating in the Example (42.0.11) 136NSHG21a
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
The latter is straightforward. 2673
136EXM21a Example 11.0.8. In the Extreme Figure (31.4), the connected Extreme SuperHyperBipartite 2674
ESHB : (V, E), is Extreme highlighted and Extreme featured. The obtained Extreme 2675
SuperHyperSet, by the Extreme Algorithm in previous Extreme result, of the Extreme 2676
SuperHyperVertices of the connected Extreme SuperHyperBipartite ESHB : (V, E), in the 2677
Extreme SuperHyperModel (31.4), is the Extreme SuperHyperEqual Dimension Dominating. 2678
Proposition 11.0.9. Assume a connected Extreme SuperHyperMultipartite ESHM : (V, E). 2679
Then 2680

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

Proof. Let 2681
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
j N SHG
2682
P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
...,
EXT ERN AL
j N SHG
is a longest SuperHyperEqual Dimension Dominating taken from a connected Extreme SuperHyper- 2683
Multipartite ESHM : (V, E). There’s a new way to redefine as 2684

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

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

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

SuperHyperEqual Dimension Dominating in the Example (42.0.13) 136NSHG22a
136EXM22a Example 11.0.10. In the Figure (31.5), the connected Extreme SuperHyperMultipartite 2696
ESHM : (V, E), is highlighted and Extreme featured. The obtained Extreme SuperHyperSet, by 2697
the Algorithm in previous Extreme result, of the Extreme SuperHyperVertices of the connected 2698
Extreme SuperHyperMultipartite ESHM : (V, E), in the Extreme SuperHyperModel (31.5), is 2699
the Extreme SuperHyperEqual Dimension Dominating. 2700
Proposition 11.0.11. Assume a connected Extreme SuperHyperWheel ESHW : (V, E ∪ E ∗ ). 2701

Then, 2702

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

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

Extreme SuperHyperEqual Dimension Dominating in the Extreme Example (42.0.15) 136NSHG23a
P :
E1∗ , V1EXT ERN AL ,
E2∗ , CEN T ER
is a longest SuperHyperEqual Dimension Dominating taken from a connected Extreme SuperHyper- 2704
Wheel ESHW : (V, E). There’s a new way to redefine as 2705

straightforward. Then there’s at least one SuperHyperEqual Dimension Dominating. Thus the notion 2708
of quasi isn’t up and the SuperHyperNotions based on SuperHyperEqual Dimension Dominating 2709
could be applied. The unique embedded SuperHyperEqual Dimension Dominating proposes some 2710
longest SuperHyperEqual Dimension Dominating excerpt from some representatives. The latter is 2711
136EXM23a Example 11.0.12. In the Extreme Figure (31.6), the connected Extreme SuperHyperWheel 2713
N SHW : (V, E), is Extreme highlighted and featured. The obtained Extreme SuperHyperSet, 2714
by the Algorithm in previous result, of the Extreme SuperHyperVertices of the connected 2715
Extreme SuperHyperWheel ESHW : (V, E), in the Extreme SuperHyperModel (31.6), is the 2716
Extreme SuperHyperEqual Dimension Dominating. 2717

CHAPTER 12 2718
The Surveys of Mathematical Sets On 2719
The Results But As The Initial Motivation 2720
For the SuperHyperEqual Dimension Dominating, Extreme SuperHyperEqual Dimension Dominating, and the 2721
Extreme SuperHyperEqual Dimension Dominating, some general results are introduced. 2722
Remark 12.0.1. Let remind that the Extreme SuperHyperEqual Dimension Dominating is “redefined” 2723
on the positions of the alphabets. 2724
Corollary 12.0.2. Assume Extreme SuperHyperEqual Dimension Dominating. Then 2725
Extreme SuperHyperEqualDimensionDominating =
{theSuperHyperEqualDimensionDominatingof theSuperHyperV ertices |
max |SuperHyperOf f ensive
SuperHyperEqualDimensionDominating
|ExtremecardinalityamidthoseSuperHyperEqualDimensionDominating. }
plus one Extreme SuperHypeNeighbor to one. Where σi is the unary operation on the 2726
SuperHyperVertices of the SuperHyperGraph to assign the determinacy, the indeterminacy 2727
and the neutrality, for i = 1, 2, 3, respectively. 2728
Corollary 12.0.3. Assume an Extreme SuperHyperGraph on the same identical letter of the 2729
alphabet. Then the notion of Extreme SuperHyperEqual Dimension Dominating and SuperHyperEqual 2730
Dimension Dominating coincide. 2731
alphabet. Then a consecutive sequence of the SuperHyperVertices is an Extreme SuperHyperEqual 2733
Dimension Dominating if and only if it’s a SuperHyperEqual Dimension Dominating. 2734
alphabet. Then a consecutive sequence of the SuperHyperVertices is a strongest SuperHyperEqual 2736
Dimension Dominating if and only if it’s a longest SuperHyperEqual Dimension Dominating. 2737
Corollary 12.0.6. Assume SuperHyperClasses of an Extreme SuperHyperGraph on the same 2738
identical letter of the alphabet. Then its Extreme SuperHyperEqual Dimension Dominating is its 2739
SuperHyperEqual Dimension Dominating and reversely. 2740
129
Corollary 12.0.7. Assume an Extreme SuperHyperPath(-/SuperHyperEqual Dimension Dominating, 2741

SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel) on the same 2742
identical letter of the alphabet. Then its Extreme SuperHyperEqual Dimension Dominating is its 2743
Corollary 12.0.8. Assume an Extreme SuperHyperGraph. Then its Extreme SuperHyperEqual 2745
isn’t well-defined if and only if its SuperHyperEqual Dimension Dominating isn’t well-
Dimension Dominating 2746
defined. 2747
Corollary 12.0.9. Assume SuperHyperClasses of an Extreme SuperHyperGraph. Then its 2748

Extreme SuperHyperEqual Dimension Dominating isn’t well-defined if and only if its SuperHyperEqual 2749
Dimension Dominating isn’t well-defined. 2750
SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). Then its 2752

Extreme SuperHyperEqual Dimension Dominating isn’t well-defined if and only if its SuperHyperEqual 2753
Corollary 12.0.11. Assume an Extreme SuperHyperGraph. Then its Extreme SuperHyperEqual 2755
is well-defined if and only if its SuperHyperEqual Dimension Dominating is well-defined.
Corollary 12.0.12. Assume SuperHyperClasses of an Extreme SuperHyperGraph. Then its 2757

Extreme SuperHyperEqual Dimension Dominating is well-defined if and only if its SuperHyperEqual 2758
Dimension Dominating is well-defined. 2759

Extreme SuperHyperEqual Dimension Dominating is well-defined if and only if its SuperHyperEqual 2762
Proposition 12.0.14. Let ESHG : (V, E) be an Extreme SuperHyperGraph. Then V is 2764
(i) : the dual SuperHyperDefensive SuperHyperEqual Dimension Dominating; 2765
(ii) : the strong dual SuperHyperDefensive SuperHyperEqual Dimension Dominating; 2766
(iii) : the connected dual SuperHyperDefensive SuperHyperEqual Dimension Dominating; 2767
(iv) : the δ-dual SuperHyperDefensive SuperHyperEqual Dimension Dominating; 2768
(v) : the strong δ-dual SuperHyperDefensive SuperHyperEqual Dimension Dominating; 2769
(vi) : the connected δ-dual SuperHyperDefensive SuperHyperEqual Dimension Dominating. 2770
Proposition 12.0.15. Let N T G : (V, E, σ, µ) be an Extreme SuperHyperGraph. Then ∅ is 2771
(i) : the SuperHyperDefensive SuperHyperEqual Dimension Dominating; 2772
(ii) : the strong SuperHyperDefensive SuperHyperEqual Dimension Dominating; 2773
(iii) : the connected defensive SuperHyperDefensive SuperHyperEqual Dimension Dominating; 2774
(iv) : the δ-SuperHyperDefensive SuperHyperEqual Dimension Dominating; 2775

(v) : the strong δ-SuperHyperDefensive SuperHyperEqual Dimension Dominating; 2776
(vi) : the connected δ-SuperHyperDefensive SuperHyperEqual Dimension Dominating. 2777
Proposition 12.0.16. Let ESHG : (V, E) be an Extreme SuperHyperGraph. Then an 2778

independent SuperHyperSet is 2779
(iii) : the connected SuperHyperDefensive SuperHyperEqual Dimension Dominating; 2782
Proposition 12.0.17. Let ESHG : (V, E) be an Extreme SuperHyperUniform SuperHyperGraph 2786

which is a SuperHyperEqual Dimension Dominating/SuperHyperPath. Then V is a maximal 2787
(i) : SuperHyperDefensive SuperHyperEqual Dimension Dominating; 2788
(ii) : strong SuperHyperDefensive SuperHyperEqual Dimension Dominating; 2789
(iii) : connected SuperHyperDefensive SuperHyperEqual Dimension Dominating; 2790
(iv) : O(ESHG)-SuperHyperDefensive SuperHyperEqual Dimension Dominating; 2791
(v) : strong O(ESHG)-SuperHyperDefensive SuperHyperEqual Dimension Dominating; 2792
(vi) : connected O(ESHG)-SuperHyperDefensive SuperHyperEqual Dimension Dominating; 2793
Where the exterior SuperHyperVertices and the interior SuperHyperVertices coincide. 2794
Proposition 12.0.18. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is a 2795
SuperHyperUniform SuperHyperWheel. Then V is a maximal 2796
(i) : dual SuperHyperDefensive SuperHyperEqual Dimension Dominating; 2797
(ii) : strong dual SuperHyperDefensive SuperHyperEqual Dimension Dominating; 2798
(iii) : connected dual SuperHyperDefensive SuperHyperEqual Dimension Dominating; 2799
(iv) : O(ESHG)-dual SuperHyperDefensive SuperHyperEqual Dimension Dominating; 2800
(v) : strong O(ESHG)-dual SuperHyperDefensive SuperHyperEqual Dimension Dominating; 2801
(vi) : connected O(ESHG)-dual SuperHyperDefensive SuperHyperEqual Dimension Dominating; 2802
which is a SuperHyperEqual Dimension Dominating/SuperHyperPath. Then the number of 2805

(i) : the SuperHyperEqual Dimension Dominating; 2806
(ii) : the SuperHyperEqual Dimension Dominating; 2807
(iii) : the connected SuperHyperEqual Dimension Dominating; 2808
(iv) : the O(ESHG)-SuperHyperEqual Dimension Dominating; 2809
(v) : the strong O(ESHG)-SuperHyperEqual Dimension Dominating; 2810
(vi) : the connected O(ESHG)-SuperHyperEqual Dimension Dominating. 2811
is one and it’s only V. Where the exterior SuperHyperVertices and the interior SuperHyperVertices 2812
coincide. 2813

which is a SuperHyperWheel. Then the number of 2815
(i) : the dual SuperHyperEqual Dimension Dominating; 2816
(ii) : the dual SuperHyperEqual Dimension Dominating; 2817
(iii) : the dual connected SuperHyperEqual Dimension Dominating; 2818
(iv) : the dual O(ESHG)-SuperHyperEqual Dimension Dominating; 2819
(v) : the strong dual O(ESHG)-SuperHyperEqual Dimension Dominating; 2820
(vi) : the connected dual O(ESHG)-SuperHyperEqual Dimension Dominating. 2821
coincide. 2823

which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperComplete 2825
SuperHyperMultipartite. Then a SuperHyperSet contains [the SuperHyperCenter and] the half of 2826
multiplying r with the number of all the SuperHyperEdges plus one of all the SuperHyperVertices 2827
is a 2828
O(ESHG)
(iv) : 2 + 1-dual SuperHyperDefensive SuperHyperEqual Dimension Dominating; 2832
O(ESHG)
(v) : strong 2 + 1-dual SuperHyperDefensive SuperHyperEqual Dimension Dominating; 2833
O(ESHG)
(vi) : connected 2 + 1-dual SuperHyperDefensive SuperHyperEqual Dimension Dominating. 2834


SuperHyperMultipartite. Then a SuperHyperSet contains the half of multiplying r with the 2837
number of all the SuperHyperEdges plus one of all the SuperHyperVertices in the biggest 2838
SuperHyperPart is a 2839
(iv) : δ-SuperHyperDefensive SuperHyperEqual Dimension Dominating; 2843
(v) : strong δ-SuperHyperDefensive SuperHyperEqual Dimension Dominating; 2844
(vi) : connected δ-SuperHyperDefensive SuperHyperEqual Dimension Dominating. 2845

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

Proposition 12.0.25. Let ESHG : (V, E) be an Extreme SuperHyperGraph. Then the number 2866
is at most O(ESHG) and the Extreme number is at most On (ESHG). 2867
Proposition 12.0.26. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is 2868
SuperHyperComplete. The number is O(ESHG:(V,E)) 2 + 1 and the Extreme number is 2869

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

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

2 + 1)-SuperHyperDefensive SuperHyperEqual Dimension Dominating. 2876
Proposition 12.0.27. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is ∅. The 2877
number is 0 and the Extreme number is 0, for an independent SuperHyperSet in the setting of 2878
dual 2879
(iv) : 0-SuperHyperDefensive SuperHyperEqual Dimension Dominating; 2883
Proposition 12.0.28. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is SuperHy- 2886
perComplete. Then there’s no independent SuperHyperSet. 2887
Proposition 12.0.29. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is SuperHy- 2888
perEqual Dimension Dominating/SuperHyperPath/SuperHyperWheel. The number is O(ESHG : (V, E)) 2889
and the Extreme number is On (ESHG : (V, E)), in the setting of a dual 2890
(iv) : O(ESHG : (V, E))-SuperHyperDefensive SuperHyperEqual Dimension Dominating; 2894
(v) : strong O(ESHG : (V, E))-SuperHyperDefensive SuperHyperEqual Dimension Dominating; 2895
(vi) : connected O(ESHG : (V, E))-SuperHyperDefensive SuperHyperEqual Dimension Dominating. 2896

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


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

(ii) Γ = b n2 c + 1 and corresponded SuperHyperSet is S = {v2 , v4 , · · · , vn−1 }; 2929
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· ,vn−1 } Σ3i=1 σi (s)}; 2930
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn−1 } and S2 = {v1 , v3 , · · · , vn−1 } are only a dual 2931
Proposition 12.0.37. Let ESHG : (V, E) be an even SuperHyperPath. Then 2933
(i) the set S = {v2 , v4 , · · · .vn } is a dual SuperHyperDefensive SuperHyperEqual Dimension 2934
Dominating; 2935
(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · .vn } and {v1 , v3 , · · · .vn−1 }; 2936
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 2937
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 2938
Proposition 12.0.38. Let ESHG : (V, E) be an even SuperHyperEqual Dimension Dominating. Then 2940
(i) the SuperHyperSet S = {v2 , v4 , · · · , vn } is a dual SuperHyperDefensive SuperHyperEqual 2941
(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · , vn } and {v1 , v3 , · · · , vn−1 }; 2943
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } σ(s), Σs∈S={v1 ,v3 ,··· ,vn−1 } σ(s)}; 2944
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn } and S2 = {v1 , v3 , · · · , vn−1 } are only dual 2945
Proposition 12.0.39. Let ESHG : (V, E) be an odd SuperHyperEqual Dimension Dominating. Then 2947

(iii) Γs = min{Σs∈S={v2 ,v4 ,··· .vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 2951
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn−1 } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 2952
Proposition 12.0.40. Let ESHG : (V, E) be SuperHyperStar. Then 2954
(i) the SuperHyperSet S = {c} is a dual maximal SuperHyperEqual Dimension Dominating; 2955
(ii) Γ = 1; 2956
(iii) Γs = Σ3i=1 σi (c); 2957
(iv) the SuperHyperSets S = {c} and S ⊂ S 0 are only dual SuperHyperEqual Dimension Dominating. 2958
Proposition 12.0.41. Let ESHG : (V, E) be SuperHyperWheel. Then 2959

6+3(i−1)≤n
(i) the SuperHyperSet S = {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is a dual maximal 2960
SuperHyperDefensive SuperHyperEqual Dimension Dominating; 2961
6+3(i−1)≤n
(ii) Γ = |{v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 |; 2962
(iii) Γs = Σ{v1 ,v3 }∪{v6 ,v9 ··· ,vi+6 ,··· ,vn }6+3(i−1)≤n Σ3i=1 σi (s); 2963
i=1
6+3(i−1)≤n
(iv) the SuperHyperSet {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is only a dual maximal 2964
SuperHyperDefensive SuperHyperEqual Dimension Dominating. 2965
Proposition 12.0.42. Let ESHG : (V, E) be an odd SuperHyperComplete. Then 2966
b n c+1
(i) the SuperHyperSet S = {vi }i=1
2
is a dual SuperHyperDefensive SuperHyperEqual Dimension 2967
Dominating; 2968
(ii) Γ = b n2 c + 1; 2969
(iii) Γs = min{Σs∈S Σ3i=1 σi (s)} 2

b n c+1 ; 2970
S={vi }i=1
b n c+1
(iv) the SuperHyperSet S = {vi }i=1
2
is only a dual SuperHyperDefensive SuperHyperEqual 2971
Proposition 12.0.43. Let ESHG : (V, E) be an even SuperHyperComplete. Then 2973
bnc
2
Dominating; 2975
(ii) Γ = b n2 c; 2976

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

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

Dimension Dominating for N SHF; 2983
(ii) Γ = m for N SHF : (V, E); 2984
(iii) Γs = Σm 3
i=1 Σj=1 σj (ci ) for N SHF : (V, E); 2985
(iv) the SuperHyperSets S = {c1 , c2 , · · · , cm } and S ⊂ S 0 are only dual SuperHyperEqual Dimension 2986
Dominating for N SHF : (V, E). 2987
Proposition 12.0.45. Let N SHF : (V, E) be an m-SuperHyperFamily of odd SuperHyperCom- 2988
plete SuperHyperGraphs with common Extreme SuperHyperVertex SuperHyperSet. Then 2989

b n c+1
is a dual maximal SuperHyperDefensive SuperHyperEqual 2990
(ii) Γ = b n2 c + 1 for N SHF : (V, E); 2992

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

plete SuperHyperGraphs with common Extreme SuperHyperVertex SuperHyperSet. Then 2997
bnc
(i) the SuperHyperSet S = {vi }i=1 2
Dominating for N SHF : (V, E); 2999
(ii) Γ = b n2 c for N SHF : (V, E); 3000

bnc for N SHF : (V, E); 3001
S={vi }i=1
bnc
2
are only dual maximal SuperHyperEqual Dimension Dominating 3002
for N SHF : (V, E). 3003
following statements hold; 3005
(i) if s ≥ t and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 3006

SuperHyperEqual Dimension Dominating, then S is an s-SuperHyperDefensive SuperHyperEqual 3007
(ii) if s ≤ t and a SuperHyperSet S of SuperHyperVertices is a dual t-SuperHyperDefensive 3009

SuperHyperEqual Dimension Dominating, then S is a dual s-SuperHyperDefensive SuperHyperEqual 3010
(i) if s ≥ t + 2 and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 3014
SuperHyperEqual Dimension Dominating, then S is an s-SuperHyperPowerful SuperHyperEqual 3015


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

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

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

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

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

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

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

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

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


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

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


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

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

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


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

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

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


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

SuperHyperEqual Dimension Dominating 136NSHGaa21aa
143
Belong to The Extreme SuperHyperBipartite

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

ESHB : (V, E), in the Extreme SuperHyperModel (34.1), is the Extreme SuperHyperEqual 3115

CHAPTER 15 3117
Case 2: The Increasing Extreme Steps 3118
Toward Extreme 3119
SuperHyperMultipartite as Extreme 3120
SuperHyperModel 3121
Step 4. (Extreme Solution) In the Extreme Figure (35.1), the Extreme SuperHyperMultipart- 3122
ite is Extreme highlighted and Extreme featured. 3123
By using the Extreme Figure (35.1) and the Table (35.1), the Extreme SuperHyperMulti- 3124
partite is obtained. 3125
The obtained Extreme SuperHyperSet, by the Extreme Algorithm in previous result, 3126
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 3127

ESHM : (V, E), in the Extreme SuperHyperModel (35.1), is the Extreme SuperHyperEqual 3128

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

CHAPTER 18 3178
Extreme SuperHyperDuality But As The 3179
Super Forms 3181
Definition 18.0.1. (Different Extreme Types of Extreme SuperHyperDuality). 3182

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

Va ∈ Ei , Ej ; 3186
(ii) Extreme re-SuperHyperDuality if ∀Ei ∈ E 0 , ∃Ej ∈ EESHG:(V,E) \ E 0 such that 3187
Va ∈ Ei , Ej and |Ei |Extreme CARDINALITY = |Ej |Extreme CARDINALITY ; 3188
(iii) Extreme v-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 3189
Vi , Vj ∈ Ea ; 3190
(iv) Extreme rv-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 3191
Vi , Vj ∈ Ea and |Vi |Extreme CARDINALITY = |Vj |Extreme CARDINALITY ; 3192
(v) Extreme SuperHyperDuality if it’s either of Extreme e-SuperHyperDuality, 3193
Extreme re-SuperHyperDuality, Extreme v-SuperHyperDuality, and Extreme rv- 3194

SuperHyperDuality. 3195
Definition 18.0.2. ((Extreme) SuperHyperDuality). 3196

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

SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3201
is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Extreme 3202
Extreme SuperHyperDuality; 3205
151
(ii) a Extreme SuperHyperDuality if it’s either of Extreme e-SuperHyperDuality, Extreme 3206

re-SuperHyperDuality, Extreme v-SuperHyperDuality, and Extreme rv-SuperHyperDuality 3207
and C(N SHG) for a Extreme SuperHyperGraph N SHG : (V, E) is the maximum 3208
Extreme cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet 3209
S of high Extreme cardinality consecutive Extreme SuperHyperEdges and Extreme 3210
SuperHyperVertices such that they form the Extreme SuperHyperDuality; 3211
(iii) an Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of Extreme 3212

e-SuperHyperDuality, Extreme re-SuperHyperDuality, Extreme v-SuperHyperDuality, 3213
and Extreme rv-SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph 3214
N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients 3215
defined as the Extreme number of the maximum Extreme cardinality of the Extreme 3216
SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme cardinality consecutive 3217
Extreme SuperHyperDuality; and the Extreme power is corresponded to its Extreme 3219
coefficient; 3220
(iv) a Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of Extreme 3221

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

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

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

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

of Extreme e-SuperHyperDuality, Extreme re-SuperHyperDuality, Extreme v- 3244
SuperHyperDuality, and Extreme rv-SuperHyperDuality and C(N SHG) for an Extreme 3245
SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the 3246


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

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


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

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 3321
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 3324
ViEXT ERN AL in the literatures of SuperHyperDuality. The latter is straightforward. 3325
(31.1), is the SuperHyperDuality. 3328
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 3330
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3

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



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

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

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

is a longest SuperHyperDuality taken from a connected Extreme SuperHyperMultipartite 3370

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

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

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

∃!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 3395
SuperHyperDuality proposes some longest SuperHyperDuality excerpt from some representatives. 3396
Extreme SuperHyperDuality. 3402

CHAPTER 19 3403
Extreme SuperHyperJoin But As The 3404
Super Forms 3406
Definition 19.0.1. (Different Extreme Types of Extreme SuperHyperJoin). 3407

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

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

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

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

Vi , Vj ∈ Ea ; ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; and |Vi |Extreme CARDINALITY = 3418
|Vj |Extreme CARDINALITY ; 3419
(v) Extreme SuperHyperJoin if it’s either of Extreme e-SuperHyperJoin, Extreme re- 3420
SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme rv-SuperHyperJoin. 3421
Definition 19.0.2. ((Extreme) SuperHyperJoin). 3422

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

re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme rv-SuperHyperJoin and 3426
C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme 3427
cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme 3428
SuperHyperEdges in the consecutive Extreme sequence of Extreme SuperHyperEdges and 3429
Extreme SuperHyperVertices such that they form the Extreme SuperHyperJoin; 3430
165
(ii) a Extreme SuperHyperJoin if it’s either of Extreme e-SuperHyperJoin, Extreme 3431

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

SuperHyperJoin, Extreme re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme 3438
rv-SuperHyperJoin and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3439
is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined as the 3440
Extreme number of the maximum Extreme cardinality of the Extreme SuperHyperEdges 3441
of an Extreme SuperHyperSet S of high Extreme cardinality consecutive Extreme 3442
SuperHyperEdges and Extreme SuperHyperVertices such that they form the Extreme 3443
SuperHyperJoin; and the Extreme power is corresponded to its Extreme coefficient; 3444
(iv) a Extreme SuperHyperJoin SuperHyperPolynomial if it’s either of Extreme e- 3445

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


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

C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum 3461
Extreme cardinality of the Extreme SuperHyperVertices of an Extreme SuperHyperSet 3462
SuperHyperVertices such that they form the Extreme SuperHyperJoin; 3464
(vii) an Extreme R-SuperHyperJoin SuperHyperPolynomial if it’s either of Extreme 3465
e-SuperHyperJoin, Extreme re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme 3466

Extreme number of the maximum Extreme cardinality of the Extreme SuperHyperVertices 3469

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

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

SuperHyperJoin. 3490
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 3492
Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. Thus in the terms of 3493
Extreme SuperHyperNeighbor, there’s only one Extreme SuperHyperEdge, namely, E4 . 3494
The Extreme SuperHyperVertex, V3 is Extreme isolated means that there’s no Extreme 3495
SuperHyperEdge has it as an Extreme endpoint. Thus the Extreme SuperHyperVertex, 3496
V3 , is excluded in every given Extreme SuperHyperJoin. 3497

is up. The Extreme Algorithm is Extremely straightforward. 3499


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

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

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


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

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



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

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

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


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

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

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

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

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

CHAPTER 20 3620
Extreme SuperHyperPerfect But As The 3621
Super Forms 3623
Definition 20.0.1. (Different Extreme Types of Extreme SuperHyperPerfect). 3624

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

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

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

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

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

re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, and Extreme rv-SuperHyperPerfect. 3636
Definition 20.0.2. ((Extreme) SuperHyperPerfect). 3637

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

Extreme re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, and Extreme rv- 3641
SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3642
Extreme SuperHyperPerfect; 3646
179
(ii) a Extreme SuperHyperPerfect if it’s either of Extreme e-SuperHyperPerfect, Extreme 3647

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

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

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

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

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

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

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


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

SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality 3698
consecutive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 3699
form the Extreme SuperHyperPerfect; and the Extreme power is corresponded to its 3700
Extreme coefficient. 3701
• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperPer- 3704
fect, is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are some 3705
SuperHyperPerfect. 3711
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 3713
are some empty Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. 3714
SuperHyperVertex, V3 , is excluded in every given Extreme SuperHyperPerfect. 3718


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

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

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

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

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



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

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

Then 3809

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



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

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

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


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

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

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

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

re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Extreme rv-SuperHyperTotal. 3858
Definition 21.0.2. ((Extreme) SuperHyperTotal). 3859

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

re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Extreme rv-SuperHyperTotal and 3863
SuperHyperEdges in the consecutive Extreme sequence of Extreme SuperHyperEdges and 3866
Extreme SuperHyperVertices such that they form the Extreme SuperHyperTotal; 3867
(ii) a Extreme SuperHyperTotal if it’s either of Extreme e-SuperHyperTotal, Extreme 3868

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

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

treme rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph N SHG : 3876
(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
(iv) a Extreme SuperHyperTotal SuperHyperPolynomial if it’s either of Extreme e- 3882

SuperHyperTotal, Extreme re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Ex- 3883
(V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined 3885
as the Extreme number of the maximum Extreme cardinality of the Extreme SuperHy- 3886
perEdges of an Extreme SuperHyperSet S of high Extreme cardinality consecutive Extreme 3887
SuperHyperTotal; and the Extreme power is corresponded to its Extreme coefficient; 3889
(v) an Extreme R-SuperHyperTotal if it’s either of Extreme e-SuperHyperTotal, Extreme 3890

re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Extreme rv-SuperHyperTotal and 3891
SuperHyperVertices in the consecutive Extreme sequence of Extreme SuperHyperEdges 3894
and Extreme SuperHyperVertices such that they form the Extreme SuperHyperTotal; 3895
(vi) a Extreme R-SuperHyperTotal if it’s either of Extreme e-SuperHyperTotal, Extreme 3896

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

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

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

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



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

ViEXT ERN AL in the literatures of SuperHyperTotal. The latter is straightforward. 3983
(31.1), is the SuperHyperTotal. 3986
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 3988
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. 3995
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 3997
P : ViEXT ERN AL , Ei , CEN T ER, Ej .

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

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

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

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

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



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

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



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

CHAPTER 22 4059
Extreme SuperHyperConnected But As 4060
The Extensions Excerpt From Dense And 4061
Super Forms 4062
Definition 22.0.1. (Different Extreme Types of Extreme SuperHyperConnected). 4063

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

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

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

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

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

Extreme re-SuperHyperConnected, Extreme v-SuperHyperConnected, and Extreme rv- 4077
SuperHyperConnected. 4078
Definition 22.0.2. ((Extreme) SuperHyperConnected). 4079
(i) an Extreme SuperHyperConnected if it’s either of Extreme e-SuperHyperConnected, 4082

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

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

Extreme e-SuperHyperConnected, Extreme re-SuperHyperConnected, Extreme v- 4096
SuperHyperConnected, and Extreme rv-SuperHyperConnected and C(N SHG) for an 4097
Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial con- 4098
tains the Extreme coefficients defined as the Extreme number of the maximum Extreme 4099
cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high 4100
Extreme cardinality consecutive Extreme SuperHyperEdges and Extreme SuperHyperVer- 4101
tices such that they form the Extreme SuperHyperConnected; and the Extreme power is 4102
(iv) a Extreme SuperHyperConnected SuperHyperPolynomial if it’s either of 4104


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

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

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

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

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

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

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

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

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


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

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

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 4204
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. 4208
(31.1), is the SuperHyperConnected. 4211
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 4213
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. 4220
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 4222



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

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

is a longest SuperHyperConnected taken from a connected Extreme SuperHyperBipartite 4241

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


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

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

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


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

CHAPTER 23 4286
Background 4287
221



[HG11] by Henry Garrett (2022), “Extremism of the Attacked Body Under the Cancer’s Cir- 4357
cumstances Where Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs” in Ref. 4358
“Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic SuperHyperStable To Act 4361
on Cancer’s Neutrosophic Recognitions In Special ViewPoints” in Ref. [HG14] by Henry 4362

[HG15] by Henry Garrett (2022), “(Neutrosophic) SuperHyperStable on Cancer’s Recogni- 4365
tion by Well- SuperHyperModelled (Neutrosophic) SuperHyperGraphs ” in Ref. [HG16] by 4366


SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints” in 4368
Ref. [HG12] by Henry Garrett (2022), “Basic Notions on (Neutrosophic) SuperHyperFor- 4369
cing And (Neutrosophic) SuperHyperModeling in Cancer’s Recognitions And (Neutrosophic) 4370
SuperHyperGraphs” in Ref. [HG17] by Henry Garrett (2022), “Neutrosophic Messy-Style 4371
SuperHyperGraphs To Form Neutrosophic SuperHyperStable To Act on Cancer’s Neutrosophic 4372
Recognitions In Special ViewPoints” in Ref. [HG18] by Henry Garrett (2022),“(Neutrosophic) 4373

SuperHyperModeling of Cancer’s Recognitions Featuring (Neutrosophic) SuperHyperDefensive 4374
SuperHyperAlliances” in Ref. [HG19] by Henry Garrett (2022), “(Neutrosophic) SuperHy- 4375
perAlliances With SuperHyperDefensive and SuperHyperOffensive Type-SuperHyperSet On 4376
(Neutrosophic) SuperHyperGraph With (Neutrosophic) SuperHyperModeling of Cancer’s Re- 4377
cognitions And Related (Neutrosophic) SuperHyperClasses” in Ref. [HG20] by Henry Garrett 4378
(2022), “SuperHyperGirth on SuperHyperGraph and Neutrosophic SuperHyperGraph With Supe- 4379

rHyperModeling of Cancer’s Recognitions” in Ref. [HG21] by Henry Garrett (2022), “Some 4380
SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic SuperHyperGraphs and Su- 4381
perHyperGraphs Alongside Applications in Cancer’s Treatments” in Ref. [HG22] by Henry 4382
Garrett (2022), “SuperHyperDominating and SuperHyperResolving on Neutrosophic SuperHy- 4383
perGraphs And Their Directions in Game Theory and Neutrosophic SuperHyperClasses” in Ref. 4384
[HG23] by Henry Garrett (2022), “SuperHyperMatching By (R-)Definitions And Polynomials 4385

To Monitor Cancer’s Recognition In Neutrosophic SuperHyperGraphs” in Ref. [HG24] by Henry 4386
Garrett (2023), “The Focus on The Partitions Obtained By Parallel Moves In The Cancer’s 4387
Extreme Recognition With Different Types of Extreme SuperHyperMatching Set and Polynomial 4388
on (Neutrosophic) SuperHyperGraphs” in Ref. [HG25] by Henry Garrett (2023), “Extreme 4389
Failed SuperHyperClique Decides the Failures on the Cancer’s Recognition in the Perfect Con- 4390
nections of Cancer’s Attacks By SuperHyperModels Named (Neutrosophic) SuperHyperGraphs” 4391

in Ref. [HG26] by Henry Garrett (2023), “Indeterminacy On The All Possible Connections 4392
of Cells In Front of Cancer’s Attacks In The Terms of Neutrosophic Failed SuperHyperClique 4393
on Cancer’s Recognition called Neutrosophic SuperHyperGraphs” in Ref. [HG27] by Henry 4394
Garrett (2023), “Perfect Directions Toward Idealism in Cancer’s Neutrosophic Recognition For- 4395
warding Neutrosophic SuperHyperClique on Neutrosophic SuperHyperGraphs” in Ref. [HG28] 4396
by Henry Garrett (2023), “Demonstrating Complete Connections in Every Embedded Regions 4397
and Sub-Regions in the Terms of Cancer’s Recognition and (Neutrosophic) SuperHyperGraphs 4398
With (Neutrosophic) SuperHyperClique” in Ref. [HG29] by Henry Garrett (2023), “Different 4399
Neutrosophic Types of Neutrosophic Regions titled neutrosophic Failed SuperHyperStable in 4400
Cancer’s Neutrosophic Recognition modeled in the Form of Neutrosophic SuperHyperGraphs” 4401
in Ref. [HG30] by Henry Garrett (2023), “Using the Tool As (Neutrosophic) Failed SuperHy- 4402
perStable To SuperHyperModel Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs” 4403
ViewPoints” in Ref. [HG32] by Henry Garrett (2023), “(Neutrosophic) SuperHyperStable 4406
on Cancer’s Recognition by Well-SuperHyperModelled (Neutrosophic) SuperHyperGraphs” in 4407
Ref. [HG33] by Henry Garrett (2023), “Neutrosophic 1-Failed SuperHyperForcing in the 4408
SuperHyperFunction To Use Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic Re- 4409
cognition And Beyond” in Ref. [HG34] by Henry Garrett (2022), “(Neutrosophic) 1-Failed 4410
SuperHyperForcing in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs” in Ref. 4411
[HG35] by Henry Garrett (2022), “Basic Notions on (Neutrosophic) SuperHyperForcing And 4412

(Neutrosophic) SuperHyperModeling in Cancer’s Recognitions And (Neutrosophic) SuperHyper- 4413

Graphs” in Ref. [HG36] by Henry Garrett (2022), “Basic Neutrosophic Notions Concerning 4414
SuperHyperDominating and Neutrosophic SuperHyperResolving in SuperHyperGraph” in Ref. 4415
[HG37] by Henry Garrett (2022), “Initial Material of Neutrosophic Preliminaries to Study 4416
Some Neutrosophic Notions Based on Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic 4417
SuperHyperGraph (NSHG)” in Ref. [HG38] by Henry Garrett (2022), and [HG44s; HG55s; 4418
HG277; HG278; HG279; HG280; HG281], there are some endeavors to formalize the basic 4439
SuperHyperNotions about neutrosophic SuperHyperGraph and SuperHyperGraph alongside 4440
scientific research books at [HG60b; HG61b; HG62b; HG63b; HG64b; HG65b; HG66b; 4441



See the seminal scientific researches [HG11s; HG22s; HG33s]. The formalization of the notions 4470
on the framework of notions in SuperHyperGraphs, Neutrosophic notions in SuperHyperGraphs 4471

theory, and (Neutrosophic) SuperHyperGraphs theory at [HG44s; HG55s; HG4; HG5; HG6; 4472
HG279; HG280; HG281] alongside scientific research books at [HG60b; HG61b; HG62b; 4493



HG174b; HG175b; HG176b; HG177b; HG178b; HG179b; HG180b]. Two popular 4507
scientific research books in Scribd in the terms of high readers, 4728 and 5721 respectively, on 4508
neutrosophic science is on [HG32b; HG44b]. 4509

Bibliography 4510
10.33140/JMTCM.01.03.09) 4533
227



10.20944/preprints202301.0282.v1). 4549

10.20944/preprints202301.0267.v1). 4552

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

prints202301.0105.v1). 4570

Preprints 2023, 2023010044 4576
10.20944/preprints202301.0043.v1). 4579

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

(doi: 10.20944/preprints202212.0500.v1). 4595
10.5281/zenodo.8061927). 4604

10.5281/zenodo.8062016). 4607
10.5281/zenodo.8057696). 4610
2023, (doi: 10.5281/zenodo.8057753). 4613
10.5281/zenodo.8052893). 4616

2023, (doi: 10.5281/zenodo.8052925). 4619
10.5281/zenodo.8051346). 4622
10.5281/zenodo.8051360). 4625
10.5281/zenodo.8025707). 4628
10.5281/zenodo.8027275). 4631
odo.8017246). 4634
10.5281/zenodo.8020128). 4637
odo.7978571). 4640
10.5281/zenodo.7978857). 4643
10.5281/zenodo.7940830). 4646
10.5281/zenodo.7943578). 4649
odo.7916595). 4652
odo.7923632). 4655

(doi: 10.5281/zenodo.7904698). 4658
2023, (doi: 10.5281/zenodo.7904671). 4661
10.5281/zenodo.7871026). 4670
2023, (doi: 10.5281/zenodo.7874647). 4673
10.5281/zenodo.7857856). 4676
2023, (doi: 10.5281/zenodo.7857841). 4679
10.5281/zenodo.7853867). 4688
10.5281/zenodo.7853922). 4691
(doi: 10.5281/zenodo.7851519). 4694

(doi: 10.5281/zenodo.7851550). 4697
10.5281/zenodo.7834229). 4706
10.5281/zenodo.7834261). 4709
10.5281/zenodo.7824560). 4712
(doi: 10.5281/zenodo.7824623). 4715
2023, (doi: 10.5281/zenodo.7809365). 4726
2023, (doi: 10.5281/zenodo.7809358). 4729
10.5281/zenodo.7809219). 4732

10.5281/zenodo.7809328). 4735
2023, (doi: 10.5281/zenodo.7806767). 4738
2023, (doi: 10.5281/zenodo.7806838). 4741
10.5281/zenodo.7799902). 4750
(doi: 10.5281/zenodo.7804218). 4753
(doi: 10.5281/zenodo.7796334). 4756
10.5281/zenodo.7791952). 4762
10.5281/zenodo.7791982). 4765
10.5281/zenodo.7790026). 4768
10.5281/zenodo.7790052). 4771

2023, (doi: 10.5281/zenodo.7787066). 4774
10.5281/zenodo.7781476). 4780
10.5281/zenodo.7783082). 4783
10.5281/zenodo.7777857). 4786
10.5281/zenodo.7779286). 4789
(doi: 10.5281/zenodo.7771831). 4792
2023, (doi: 10.5281/zenodo.7772468). 4795
10.13140/RG.2.2.20913.25446). 4798
odo.7764916). 4801
10.13140/RG.2.2.11770.98247). 4804
10.13140/RG.2.2.12400.12808). 4807
2023, (doi: 10.13140/RG.2.2.22545.10089). 4810

10.13140/RG.2.2.11377.76644). 4816
10.13140/RG.2.2.23750.96329). 4819
10.13140/RG.2.2.31366.24641). 4822
10.13140/RG.2.2.34721.68960). 4825
2023, (doi: 10.13140/RG.2.2.30212.81289). 4828
10.13140/RG.2.2.24288.35842). 4834
10.13140/RG.2.2.32467.25124). 4837
10.13140/RG.2.2.31025.45925). 4840
10.13140/RG.2.2.17184.25602). 4843
10.13140/RG.2.2.23423.28327). 4846
10.13140/RG.2.2.28456.44805). 4849

10.13140/RG.2.2.23525.68320). 4852
10.13140/RG.2.2.20170.24000). 4855
10.13140/RG.2.2.36475.59683). 4858
10.13140/RG.2.2.29764.71046). 4861
2023, (doi: 10.13140/RG.2.2.18780.87683). 4864
10.13140/RG.2.2.26134.01603). 4870
10.13140/RG.2.2.27392.30721). 4873
10.13140/RG.2.2.33028.40321). 4876
10.13140/RG.2.2.21389.20966). 4879
10.13140/RG.2.2.16356.04489). 4882
10.13140/RG.2.2.21756.21129). 4885
10.13140/RG.2.2.30983.68009). 4888

10.13140/RG.2.2.28552.29445). 4891
(doi: 10.13140/RG.2.2.10936.21761). 4894
10.13140/RG.2.2.35105.89447). 4897
(doi: 10.13140/RG.2.2.30072.72960). 4900
10.13140/RG.2.2.31147.52003). 4903
10.13140/RG.2.2.32825.24163). 4906
10.13140/RG.2.2.13059.58401). 4909
10.13140/RG.2.2.11172.14720). 4912
2023, (doi: 10.13140/RG.2.2.22011.80165). 4915
ate 2023, (doi: 10.13140/RG.2.2.30819.84003). 4918
2023, (doi: 10.13140/RG.2.2.10493.84962). 4921
ate 2023, (doi: 10.13140/RG.2.2.13849.29280). 4924
2023, (doi: 10.13140/RG.2.2.19944.14086). 4927

ate 2023, (doi: 10.13140/RG.2.2.23299.58404). 4930
(doi: 10.13140/RG.2.2.33103.76968). 4933
(doi: 10.13140/RG.2.2.23037.44003). 4936
(doi: 10.13140/RG.2.2.35646.56641). 4939
10.13140/RG.2.2.18030.48967). 4942
(doi: 10.13140/RG.2.2.13973.81121). 4945
2023, (doi: 10.13140/RG.2.2.34106.47047). 4948
2023, (doi: 10.13140/RG.2.2.31956.88961). 4954
2023, (doi: 10.13140/RG.2.2.15179.67361). 4957
10.13140/RG.2.2.21510.45125). 4960
2023, (doi: 10.13140/RG.2.2.13121.84321). 4963
10.13140/RG.2.2.11758.69441). 4966

2023, (doi: 10.13140/RG.2.2.31891.35367). 4969
10.13140/RG.2.2.19360.87048). 4972
10.13140/RG.2.2.32363.21286). 4975
10.13140/RG.2.2.23266.81602). 4978
10.13140/RG.2.2.19911.37285). 4981
10.13140/RG.2.2.11050.90569). 4984
2023, (doi: 10.13140/RG.2.2.17761.79206). 4987
ate 2023, (doi: 10.13140/RG.2.2.33275.80161). 4993
(doi: 10.13140/RG.2.2.30182.50241). 4996


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

2023010396 (doi: 10.20944/preprints202301.0396.v1). 5038
2023, 2023010395 (doi: 10.20944/preprints202301.0395.v1). 5041


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


10.20944/preprints202301.0282.v1). 5062

10.20944/preprints202301.0267.v1).). 5065

(doi: 10.20944/preprints202301.0265.v1). 5070
prints202301.0262.v1). 5074


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

10.13140/RG.2.2.35061.65767). 5083

10.13140/RG.2.2.18494.15680). 5087
10.13140/RG.2.2.32530.73922). 5091
10.13140/RG.2.2.15897.70243). 5095

10.13140/RG.2.2.32530.73922). 5099
prints202301.0105.v1). 5102
10.13140/RG.2.2.23172.19849). 5109

10.13140/RG.2.2.17385.36968). 5119
Preprints 2023, 2023010044 5122

10.20944/preprints202301.0043.v1). 5125

2023, (doi: 10.13140/RG.2.2.28945.92007). 5128
10.13140/RG.2.2.35774.77123). 5134

10.13140/RG.2.2.29430.88642). 5140
(doi: 10.20944/preprints202212.0549.v1). 5146
10.13140/RG.2.2.19380.94084). 5149


(doi: 10.20944/preprints202212.0500.v1). 5160

10.13140/RG.2.2.20993.12640). 5163

10.13140/RG.2.2.29173.86244). 5178
(doi: 10.5281/zenodo.8062076). 5183
2023 (doi: 10.5281/zenodo.8052976). 5187
(doi: 10.5281/zenodo.8051368). 5189
(doi: 10.5281/zenodo.8027488). 5191
10.5281/zenodo.8020181). 5193
10.5281/zenodo.7978921). 5195
odo.7943878). 5197

10.5281/zenodo.7943871). 5199
10.5281/zenodo.7923786). 5201
2023 (doi: 10.5281/zenodo.7905287). 5203

2023 (doi: 10.5281/zenodo.7874677). 5207
(doi: 10.5281/zenodo.7857906). 5209
2023 (doi: 10.5281/zenodo.7856329). 5211
10.5281/zenodo.7854561). 5213
2023 (doi: 10.5281/zenodo.7851893). 5215

(doi: 10.5281/zenodo.7835063). 5219
(doi: 10.5281/zenodo.7826705). 5221
2023 (doi: 10.5281/zenodo.7820680). 5223
10.5281/zenodo.7812750). 5225

2023 (doi: 10.5281/zenodo.7807782). 5231
2023 (doi: 10.5281/zenodo.7804449). 5233


(doi: 10.5281/zenodo.7792307). 5237
(doi: 10.5281/zenodo.7790728). 5239
2023 (doi: 10.5281/zenodo.7787712). 5241
10.5281/zenodo.7783791). 5243
10.5281/zenodo.7780123). 5245
(doi: 10.5281/zenodo.7773119). 5247
odo.7637762). 5249
10.5281/zenodo.7766174). 5251
10.5281/zenodo.7762232). 5253
(doi: 10.5281/zenodo.7758601). 5255
10.5281/zenodo.7754661). 5257
10.5281/zenodo.7750995) . 5259
(doi: 10.5281/zenodo.7749875). 5261
10.5281/zenodo.7747236). 5263
10.5281/zenodo.7742587). 5265
(doi: 10.5281/zenodo.7738635). 5267
10.5281/zenodo.7734719). 5269

10.5281/zenodo.7730484). 5271
(doi: 10.5281/zenodo.7730469). 5273
10.5281/zenodo.7722865). 5275
odo.7713563). 5277
odo.7709116). 5279
10.5281/zenodo.7706415). 5281
10.5281/zenodo.7706063). 5283
10.5281/zenodo.7701906). 5285
odo.7700205). 5287
10.5281/zenodo.7694876). 5289
10.5281/zenodo.7679410). 5291
10.5281/zenodo.7675982). 5293
10.5281/zenodo.7672388). 5295
odo.7668648). 5297
10.5281/zenodo.7662810). 5299
10.5281/zenodo.7659162). 5301
odo.7653233). 5303
odo.7653204). 5305

odo.7653142). 5307
odo.7653117). 5309
odo.7651687). 5312
odo.7651619). 5314
odo.7651439). 5316
odo.7650729). 5318
odo.7647868). 5320
odo.7647017). 5322
odo.7644894). 5324
odo.7632923). 5327
odo.7623459). 5329
10.5281/zenodo.7606416). 5331
10.5281/zenodo.7606416). 5333
odo.7606404). 5335
10.5281/zenodo.7580018). 5337
odo.7580018). 5339

odo.7580018). 5341
odo.7579929). 5343
10.5281/zenodo.7563170). 5345
odo.7563164). 5347
odo.7563160). 5349
odo.7563160). 5351
10.5281/zenodo.7563160). 5353
10.5281/zenodo.7557063). 5355
10.5281/zenodo.7557009). 5357
10.5281/zenodo.7539484). 5359
10.5281/zenodo.7523390). 5361
10.5281/zenodo.7523390). 5363
10.5281/zenodo.7523390). 5365
odo.7574952). 5367
10.5281/zenodo.7574992). 5369
odo.7523357). 5371
10.5281/zenodo.7523357). 5373
10.5281/zenodo.7504782). 5375

10.5281/zenodo.7504782). 5377
10.5281/zenodo.7504782). 5379
10.5281/zenodo.7499395). 5381
odo.7499395). 5383
10.5281/zenodo.7499395). 5385
10.5281/zenodo.7497450). 5387
10.5281/zenodo.7497450). 5389
10.5281/zenodo.7494862). 5391
odo.7494862). 5393
10.5281/zenodo.7494862). 5395
10.5281/zenodo.7493845). 5397
odo.7493845). 5399
10.5281/zenodo.7493845). 5401
odo.7539484). 5403
odo.7523390). 5405
odo.7523357). 5407
odo.7504782). 5409
odo.7499395). 5411

odo.7497450). 5413
odo.7494862). 5415
odo.7493845). 5417
odo.7480110). 5419
odo.7378758). 5421
odo.6320305). 5423
odo.6677173). 5425

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

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

SuperHyperK-Domination” on “SuperHyperGraph” and “Neutrosophic SuperHyperGraph”. 5506
Then the research has taken more motivations to define SuperHyperClasses and to find some 5507
connections amid this SuperHyperNotion with other SuperHyperNotions. It motivates us to get 5508
some instances and examples to make clarifications about the framework of this research. The 5509
general results and some results about some connections are some avenues to make key point of 5510
this research, “Cancer’s Recognition”, more understandable and more clear. 5511
Some SuperHyperClasses and some Neutrosophic SuperHyperClasses are the cases of this 5512
research on the modeling of the regions where are under the attacks of the cancer to 5513
recognize this disease as it’s mentioned on the title “Cancer’s Recognitions”. To formalize 5514
the instances on the SuperHyperNotion, SuperHyperK-Domination, the new SuperHyperClasses 5515
and SuperHyperClasses, are introduced. Some general results are gathered in the section on the 5516
SuperHyperK-Domination and the Neutrosophic SuperHyperK-Domination. The clarifications, 5517

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

CHAPTER 25 5528
Neutrosophic Equal Dimension 5529
Dominating 5530
Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of SuperHyperDu- 5531
ality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, ResearchGate 5532
2023, (doi: 10.13140/RG.2.2.34953.52320). 5533
Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph By 5534
SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchGate 2023, 5535
(doi: 10.13140/RG.2.2.33275.80161). 5536
10.13140/RG.2.2.11050.90569). 5539
Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of SuperHyperJoin 5540
10.13140/RG.2.2.17761.79206). 5542
10.13140/RG.2.2.19911.37285). 5545
Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect 5546
10.13140/RG.2.2.23266.81602). 5548
10.13140/RG.2.2.19360.87048). 5551
Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal 5552
10.13140/RG.2.2.32363.21286). 5554
10.13140/RG.2.2.11758.69441). 5557
Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of SuperHyperConnected 5558
10.13140/RG.2.2.31891.35367). 5560
257

10.13140/RG.2.2.21510.45125). 5563
Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDominating 5564
10.13140/RG.2.2.13121.84321). 5566

CHAPTER 26 5567
New Ideas In Recognition of Cancer And 5568
Neutrosophic SuperHyperGraph By 5569
Equal Dimension Dominating As Hyper 5570
Dimple On Super Dimity 5571
259
CHAPTER 27 5572
ABSTRACT 5573
In this scientific research, (Different Neutrosophic Types of Neutrosophic SuperHyperEqual 5574

Dimension Dominating). Let a Neutrosophic SuperHyperGraph (NSHG) S be a Equal Dimension 5575
0
Dominating pair S = (V, E). Consider a Neutrosophic SuperHyperSet V = {V1 , V2 , . . . , Vs } 5576
0 0 0
and E = {E1 , E2 , . . . , Ez }. Then either V or E is called Neutrosophic e-SuperHyperEqual 5577
Dimension Dominating if the following expression is called Neutrosophic e-SuperHyperEqual Dimension 5578
Dominating criteria holds 5579

Neutrosophic re-SuperHyperEqual Dimension Dominating if the following expression is called Neutro- 5580
sophic e-SuperHyperEqual Dimension Dominating criteria holds 5581

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

SuperHyperEqual Dimension Dominating if the following expression is called Neutrosophic v- 5583
SuperHyperEqual Dimension Dominating criteria holds 5584

Neutrosophic rv-SuperHyperEqual Dimension Dominating if the following expression is called 5585
Neutrosophic v-SuperHyperEqual Dimension Dominating criteria holds 5586

and |Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; Neutrosophic Super- 5587
HyperEqual Dimension Dominating if it’s either of Neutrosophic e-SuperHyperEqual Dimension Dominating, 5588
Neutrosophic re-SuperHyperEqual Dimension Dominating, Neutrosophic v-SuperHyperEqual Dimension Dom- 5589
inating, and Neutrosophic rv-SuperHyperEqual Dimension Dominating. ((Neutrosophic) SuperHyperEqual 5590
Dimension Dominating). Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 5591
261
Consider a Neutrosophic SuperHyperEdge (NSHE) E = {V1 , V2 , . . . , Vs }. Then E is called an Ex- 5592

treme SuperHyperEqual Dimension Dominating if it’s either of Neutrosophic e-SuperHyperEqual Dimension 5593
Dimension Dominating, and Neutrosophic rv-SuperHyperEqual Dimension Dominating and C(N SHG) for an 5595
Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme cardinality of an Extreme 5596
SuperHyperSet S of high Extreme cardinality of the Extreme SuperHyperEdges in the consec- 5597
utive Extreme sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such 5598
that they form the Extreme SuperHyperEqual Dimension Dominating; a Neutrosophic SuperHyperEqual 5599
Dimension Dominating if it’s either of Neutrosophic e-SuperHyperEqual Dimension Dominating, Neutrosophic 5600
SuperHyperEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality con- 5604

secutive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they 5605
form the Neutrosophic SuperHyperEqual Dimension Dominating; an Extreme SuperHyperEqual Dimen- 5606
sion Dominating SuperHyperPolynomial if it’s either of Neutrosophic e-SuperHyperEqual Dimension 5607
Dimension Dominating, and Neutrosophic rv-SuperHyperEqual Dimension Dominating and C(N SHG) for 5609
an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains 5610

the Extreme coefficients defined as the Extreme number of the maximum Extreme cardinality 5611
of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme cardinal- 5612
ity consecutive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 5613
form the Extreme SuperHyperEqual Dimension Dominating; and the Extreme power is correspon- 5614
ded to its Extreme coefficient; a Neutrosophic SuperHyperEqual Dimension Dominating SuperHyper- 5615
Polynomial if it’s either of Neutrosophic e-SuperHyperEqual Dimension Dominating, Neutrosophic 5616

Neutrosophic rv-SuperHyperEqual Dimension Dominating and C(N SHG) for a Neutrosophic SuperHy- 5618
perGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains the Neutrosophic 5619
coefficients defined as the Neutrosophic number of the maximum Neutrosophic cardinality of 5620
the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic 5621
cardinality consecutive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices 5622

such that they form the Neutrosophic SuperHyperEqual Dimension Dominating; and the Neutrosophic 5623
power is corresponded to its Neutrosophic coefficient; an Extreme V-SuperHyperEqual Dimen- 5624
Neutrosophic rv-SuperHyperEqual Dimension Dominating and C(N SHG) for an Extreme SuperHy- 5627
perGraph N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet 5628
S of high Extreme cardinality of the Extreme SuperHyperVertices in the consecutive Ex- 5629
treme sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 5630
form the Extreme SuperHyperEqual Dimension Dominating; a Neutrosophic V-SuperHyperEqual Dimen- 5631

SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consec- 5636
utive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form 5637

the Neutrosophic SuperHyperEqual Dimension Dominating; an Extreme V-SuperHyperEqual Dimension 5638

Dominating SuperHyperPolynomial if it’s either of Neutrosophic e-SuperHyperEqual Dimension Dominat- 5639
ing, Neutrosophic re-SuperHyperEqual Dimension Dominating, Neutrosophic v-SuperHyperEqual Dimension 5640
Dominating, and Neutrosophic rv-SuperHyperEqual Dimension Dominating and C(N SHG) for an Extreme 5641
SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme 5642
coefficients defined as the Extreme number of the maximum Extreme cardinality of the Extreme 5643
SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality consecutive 5644

Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the Extreme 5645
SuperHyperEqual Dimension Dominating; and the Extreme power is corresponded to its Extreme coef- 5646
ficient; a Neutrosophic SuperHyperEqual Dimension Dominating SuperHyperPolynomial if it’s either of 5647
Neutrosophic e-SuperHyperEqual Dimension Dominating, Neutrosophic re-SuperHyperEqual Dimension Dom- 5648
inating, Neutrosophic v-SuperHyperEqual Dimension Dominating, and Neutrosophic rv-SuperHyperEqual 5649
Dimension Dominating and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the 5650
Neutrosophic SuperHyperPolynomial contains the Neutrosophic coefficients defined as the 5651
Neutrosophic number of the maximum Neutrosophic cardinality of the Neutrosophic SuperHy- 5652
perVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive 5653
Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form 5654
the Neutrosophic SuperHyperEqual Dimension Dominating; and the Neutrosophic power is corres- 5655
ponded to its Neutrosophic coefficient. In this scientific research, new setting is introduced 5656
for new SuperHyperNotions, namely, a SuperHyperEqual Dimension Dominating and Neutrosophic 5657
SuperHyperEqual Dimension Dominating. Two different types of SuperHyperDefinitions are debut 5658
for them but the research goes further and the SuperHyperNotion, SuperHyperUniform, and 5659
SuperHyperClass based on that are well-defined and well-reviewed. The literature review is 5660
implemented in the whole of this research. For shining the elegancy and the significancy of this 5661
research, the comparison between this SuperHyperNotion with other SuperHyperNotions and 5662
fundamental SuperHyperNumbers are featured. The definitions are followed by the examples 5663
and the instances thus the clarifications are driven with different tools. The applications are 5664
figured out to make sense about the theoretical aspect of this ongoing research. The “Cancer’s 5665
Recognition” are the under research to figure out the challenges make sense about ongoing and 5666
“Neutrosophic SuperHyperGraph” are chosen and elected to research about “Cancer’s Recog- 5671
nition”. Thus these complex and dense SuperHyperModels open up some avenues to research 5672
on theoretical segments and “Cancer’s Recognition”. Some avenues are posed to pursue this 5673
research. It’s also officially collected in the form of some questions and some problems. Assume 5674
a SuperHyperGraph. Assume a SuperHyperGraph. Then δ−SuperHyperEqual Dimension Dominating 5675
is a maximal of SuperHyperVertices with a maximum cardinality such that either of the 5676
following expressions hold for the (Neutrosophic) cardinalities of SuperHyperNeighbors of 5677
first Expression, holds if S is an δ−SuperHyperOffensive. And the second Expression, holds 5679
if S is an δ−SuperHyperDefensive; a Neutrosophic δ−SuperHyperEqual Dimension Dominating is a 5680
maximal Neutrosophic of SuperHyperVertices with maximum Neutrosophic cardinality such 5681
that either of the following expressions hold for the Neutrosophic cardinalities of SuperHy- 5682
perNeighbors of s ∈ S there are: |S ∩ N (s)|N eutrosophic > |S ∩ (V \ N (s))|N eutrosophic + δ; 5683

and |S ∩ N (s)|N eutrosophic < |S ∩ (V \ N (s))|N eutrosophic + δ. The first Expression, holds 5684
if S is a Neutrosophic δ−SuperHyperOffensive. And the second Expression, holds if S is a 5685
Neutrosophic δ−SuperHyperDefensive It’s useful to define a “Neutrosophic” version of a 5686
SuperHyperEqual Dimension Dominating . Since there’s more ways to get type-results to make a 5687
SuperHyperEqual Dimension Dominating more understandable. For the sake of having Neutrosophic 5688
SuperHyperEqual Dimension Dominating, there’s a need to “redefine” the notion of a “SuperHyperEqual 5689
Dimension Dominating ”. The SuperHyperVertices and the SuperHyperEdges are assigned by the 5690
labels from the letters of the alphabets. In this procedure, there’s the usage of the position 5691
of labels to assign to the values. Assume a SuperHyperEqual Dimension Dominating . It’s redefined 5692
a Neutrosophic SuperHyperEqual Dimension Dominating if the mentioned Table holds, concerning, 5693
“The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges Belong to 5694
The Neutrosophic SuperHyperGraph” with the key points, “The Values of The Vertices & 5695
The Number of Position in Alphabet”, “The Values of The SuperVertices&The maximum 5696
SuperHyperEqual Dimension Dominating . It’s the main. It’ll be disciplinary to have the foundation of 5701
previous definition in the kind of SuperHyperClass. If there’s a need to have all SuperHyperEqual 5702
Dimension Dominating until the SuperHyperEqual Dimension Dominating, then it’s officially called a “Super- 5703
HyperEqual Dimension Dominating” but otherwise, it isn’t a SuperHyperEqual Dimension Dominating . There 5704
are some instances about the clarifications for the main definition titled a “SuperHyperEqual 5705
Dimension Dominating ”. These two examples get more scrutiny and discernment since there are 5706
characterized in the disciplinary ways of the SuperHyperClass based on a SuperHyperEqual 5707
Dimension Dominating . For the sake of having a Neutrosophic SuperHyperEqual Dimension Dominating, 5708
there’s a need to “redefine” the notion of a “Neutrosophic SuperHyperEqual Dimension Dominating” 5709
and a “Neutrosophic SuperHyperEqual Dimension Dominating ”. The SuperHyperVertices and the 5710
And a SuperHyperEqual Dimension Dominating are redefined to a “Neutrosophic SuperHyperEqual 5714

Dimension Dominating” if the intended Table holds. It’s useful to define “Neutrosophic” version 5715
of SuperHyperClasses. Since there’s more ways to get Neutrosophic type-results to make a 5716
Neutrosophic SuperHyperEqual Dimension Dominating more understandable. Assume a Neutrosophic 5717
SuperHyperGraph. There are some Neutrosophic SuperHyperClasses if the intended Table holds. 5718
Thus SuperHyperPath, SuperHyperEqual Dimension Dominating, SuperHyperStar, SuperHyperBi- 5719

partite, SuperHyperMultiPartite, and SuperHyperWheel, are “Neutrosophic SuperHyperPath”, 5720
“Neutrosophic SuperHyperEqual Dimension Dominating”, “Neutrosophic SuperHyperStar”, “Neutro- 5721
sophic SuperHyperBipartite”, “Neutrosophic SuperHyperMultiPartite”, and “Neutrosophic 5722
SuperHyperWheel” if the intended Table holds. A SuperHyperGraph has a “Neutrosophic Su- 5723
perHyperEqual Dimension Dominating” where it’s the strongest [the maximum Neutrosophic value from 5724
all the SuperHyperEqual Dimension Dominating amid the maximum value amid all SuperHyperVertices 5725
from a SuperHyperEqual Dimension Dominating .] SuperHyperEqual Dimension Dominating . A graph is a 5726
are the same. Assume a Neutrosophic SuperHyperGraph. There are some SuperHyperClasses 5728
as follows. It’s SuperHyperPath if it’s only one SuperVertex as intersection amid two given 5729

SuperHyperEdges with two exceptions; it’s SuperHyperEqual Dimension Dominating if it’s only one 5730
SuperVertex as intersection amid two given SuperHyperEdges; it’s SuperHyperStar it’s only one 5731
SuperVertex as intersection amid all SuperHyperEdges; it’s SuperHyperBipartite it’s only one 5732
SuperVertex as intersection amid two given SuperHyperEdges and these SuperVertices, forming 5733
two separate sets, has no SuperHyperEdge in common; it’s SuperHyperMultiPartite it’s only 5734
one SuperVertex as intersection amid two given SuperHyperEdges and these SuperVertices, 5735
cancer on the complex tracks and between complicated groups of cells could be fantasized by 5755
a Neutrosophic SuperHyperPath(-/SuperHyperEqual Dimension Dominating, SuperHyperStar, Super- 5756
HyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find either the 5757
longest SuperHyperEqual Dimension Dominating or the strongest SuperHyperEqual Dimension Dominating 5758
in those Neutrosophic SuperHyperModels. For the longest SuperHyperEqual Dimension Dominating, 5759
called SuperHyperEqual Dimension Dominating, and the strongest SuperHyperEqual Dimension Dominating, 5760
called Neutrosophic SuperHyperEqual Dimension Dominating, some general results are introduced. 5761
Beyond that in SuperHyperStar, all possible SuperHyperPaths have only two SuperHyperEdges 5762
but it’s not enough since it’s essential to have at least three SuperHyperEdges to form any 5763
style of a SuperHyperEqual Dimension Dominating. There isn’t any formation of any SuperHyperEqual 5764
Dimension Dominating but literarily, it’s the deformation of any SuperHyperEqual Dimension Dominating. It, 5765
literarily, deforms and it doesn’t form. A basic familiarity with Neutrosophic SuperHyperEqual 5766
Dimension Dominating theory, SuperHyperGraphs, and Neutrosophic SuperHyperGraphs theory are 5767
proposed. 5768
Keywords: Neutrosophic SuperHyperGraph, SuperHyperEqual Dimension Dominating, Cancer’s 5769


CHAPTER 28 5772
Applied Notions Under The Scrutiny Of 5773
The Motivation Of This Scientific 5774
Research 5775
In this scientific research, there are some ideas in the featured frameworks of motivations. I 5776
try to bring the motivations in the narrative ways. Some cells have been faced with some 5777
attacks from the situation which is caused by the cancer’s attacks. In this case, there are 5778
some embedded analysis on the ongoing situations which in that, the cells could be labelled 5779
as some groups and some groups or individuals have excessive labels which all are raised from 5780
the behaviors to overcome the cancer’s attacks. In the embedded situations, the individuals 5781
of cells and the groups of cells could be considered as “new groups”. Thus it motivates us to 5782
find the proper SuperHyperModels for getting more proper analysis on this messy story. I’ve 5783
found the SuperHyperModels which are officially called “SuperHyperGraphs” and “Neutrosophic 5784
SuperHyperGraphs”. In this SuperHyperModel, the cells and the groups of cells are defined as 5785
“SuperHyperVertices” and the relations between the individuals of cells and the groups of cells 5786
are defined as “SuperHyperEdges”. Thus it’s another motivation for us to do research on this 5787
SuperHyperModel based on the “Cancer’s Recognition”. Sometimes, the situations get worst. 5788
The situation is passed from the certainty and precise style. Thus it’s the beyond them. There 5789
are three descriptions, namely, the degrees of determinacy, indeterminacy and neutrality, for any 5790
object based on vague forms, namely, incomplete data, imprecise data, and uncertain analysis. 5791
The latter model could be considered on the previous SuperHyperModel. It’s SuperHyperModel. 5792
It’s SuperHyperGraph but it’s officially called “Neutrosophic SuperHyperGraphs”. The cancer 5793
is the disease but the model is going to figure out what’s going on this phenomenon. The special 5794
case of this disease is considered and as the consequences of the model, some parameters are used. 5795
The cells are under attack of this disease but the moves of the cancer in the special region are the 5796
matter of mind. The recognition of the cancer could help to find some treatments for this disease. 5797
The SuperHyperGraph and Neutrosophic SuperHyperGraph are the SuperHyperModels on the 5798
“Cancer’s Recognition” and both bases are the background of this research. Sometimes the 5799
of the moves of the cancer in the forms of alliances’ styles with the formation of the design and 5802
the architecture are formally called “ SuperHyperEqual Dimension Dominating” in the themes of jargons 5803
and buzzwords. The prefix “SuperHyper” refers to the theme of the embedded styles to figure 5804
267
out the background for the SuperHyperNotions. The recognition of the cancer in the long-term 5805
function. The specific region has been assigned by the model [it’s called SuperHyperGraph] 5806
and the long cycle of the move from the cancer is identified by this research. Sometimes the 5807
move of the cancer hasn’t be easily identified since there are some determinacy, indeterminacy 5808
and neutrality about the moves and the effects of the cancer on that region; this event leads us 5809
to choose another model [it’s said to be Neutrosophic SuperHyperGraph] to have convenient 5810
perception on what’s happened and what’s done. There are some specific models, which are 5811
well-known and they’ve got the names, and some general models. The moves and the traces of 5812
the cancer on the complex tracks and between complicated groups of cells could be fantasized 5813
by a Neutrosophic SuperHyperPath (-/SuperHyperEqual Dimension Dominating, SuperHyperStar, 5814
SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find either 5815
the optimal SuperHyperEqual Dimension Dominating or the Neutrosophic SuperHyperEqual Dimension 5816
Dominating in those Neutrosophic SuperHyperModels. Some general results are introduced. 5817
Beyond that in SuperHyperStar, all possible Neutrosophic SuperHyperPath s have only two 5818
SuperHyperEdges but it’s not enough since it’s essential to have at least three SuperHyperEdges 5819
to form any style of a SuperHyperEqual Dimension Dominating. There isn’t any formation of any 5820
SuperHyperEqual Dimension Dominating but literarily, it’s the deformation of any SuperHyperEqual 5821
Dimension Dominating. It, literarily, deforms and it doesn’t form. 5822
Question 28.0.1. How to define the SuperHyperNotions and to do research on them to find the 5823
“ amount of SuperHyperEqual Dimension Dominating” of either individual of cells or the groups of cells 5824
based on the fixed cell or the fixed group of cells, extensively, the “amount of SuperHyperEqual 5825
Dimension Dominating” based on the fixed groups of cells or the fixed groups of group of cells? 5826
Question 28.0.2. What are the best descriptions for the “Cancer’s Recognition” in terms of 5827
these messy and dense SuperHyperModels where embedded notions are illustrated? 5828
Thus it motivates us to define different types of “ SuperHyperEqual Dimension Dominating” and 5830
“Neutrosophic SuperHyperEqual Dimension Dominating” on “SuperHyperGraph” and “Neutrosophic 5831

SuperHyperGraph”. Then the research has taken more motivations to define SuperHyperClasses 5832
and to find some connections amid this SuperHyperNotion with other SuperHyperNotions. It 5833
motivates us to get some instances and examples to make clarifications about the framework of 5834
this research. The general results and some results about some connections are some avenues to 5835
make key point of this research, “Cancer’s Recognition”, more understandable and more clear. 5836
The framework of this research is as follows. In the beginning, I introduce basic definitions 5837
to clarify about preliminaries. In the subsection “Preliminaries”, initial definitions about 5838
SuperHyperGraphs and Neutrosophic SuperHyperGraph are deeply-introduced and in-depth- 5839
discussed. The elementary concepts are clarified and illustrated completely and sometimes 5840
review literature are applied to make sense about what’s going to figure out about the upcoming 5841
sections. The main definitions and their clarifications alongside some results about new notions, 5842
SuperHyperEqual Dimension Dominating and Neutrosophic SuperHyperEqual Dimension Dominating, are 5843
figured out in sections “ SuperHyperEqual Dimension Dominating” and “Neutrosophic SuperHyperEqual 5844
Dimension Dominating”. In the sense of tackling on getting results and in Equal Dimension Dominating to 5845
make sense about continuing the research, the ideas of SuperHyperUniform and Neutrosophic 5846
SuperHyperUniform are introduced and as their consequences, corresponded SuperHyperClasses 5847
are figured out to debut what’s done in this section, titled “Results on SuperHyperClasses” 5848
and “Results on Neutrosophic SuperHyperClasses”. As going back to origin of the notions, 5849

there are some smart steps toward the common notions to extend the new notions in new 5850
frameworks, SuperHyperGraph and Neutrosophic SuperHyperGraph, in the sections “Results 5851
on SuperHyperClasses” and “Results on Neutrosophic SuperHyperClasses”. The starter research 5852
about the general SuperHyperRelations and as concluding and closing section of theoretical 5853
research are contained in the section “General Results”. Some general SuperHyperRelations 5854
are fundamental and they are well-known as fundamental SuperHyperNotions as elicited 5855
and discussed in the sections, “General Results”, “ SuperHyperEqual Dimension Dominating”, 5856
“Neutrosophic SuperHyperEqual Dimension Dominating”, “Results on SuperHyperClasses” and “Results 5857
on Neutrosophic SuperHyperClasses”. There are curious questions about what’s done about 5858
the SuperHyperNotions to make sense about excellency of this research and going to figure out 5859
the word “best” as the description and adjective for this research as presented in section, 5860
“ SuperHyperEqual Dimension Dominating”. The keyword of this research debut in the section 5861
“Applications in Cancer’s Recognition” with two cases and subsections “Case 1: The Initial 5862
Steps Toward SuperHyperBipartite as SuperHyperModel” and “Case 2: The Increasing Steps 5863
Toward SuperHyperMultipartite as SuperHyperModel”. In the section, “Open Problems”, there 5864
are some scrutiny and discernment on what’s done and what’s happened in this research in 5865
the terms of “questions” and “problems” to make sense to figure out this research in featured 5866
style. The advantages and the limitations of this research alongside about what’s done in this 5867
research to make sense and to get sense about what’s figured out are included in the section, 5868
“Conclusion and Closing Remarks”. 5869

CHAPTER 29 5870
Neutrosophic Preliminaries Of This 5871
Scientific Research On the Redeemed 5872
Ways 5873
In this section, the basic material in this scientific research, is referred to [Single Valued Neut- 5874
rosophic Set](Ref.[HG11s],Definition 2.2,p.2), [Neutrosophic Set](Ref.[HG11s],Definition 5875

2.1,p.1), [Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG11s],Definition 2.5,p.2), [Charac- 5876
terization of the Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG11s],Definition 2.7,p.3), 5877
[t-norm](Ref.[HG11s], Definition 2.7, p.3), and [Characterization of the Neutrosophic Super- 5878
HyperGraph (NSHG)](Ref.[HG11s],Definition 2.7,p.3), [Neutrosophic Strength of the Neutro- 5879
sophic SuperHyperPaths] (Ref.[HG11s],Definition 5.3,p.7), and [Different Neutrosophic Types 5880
of Neutrosophic SuperHyperEdges (NSHE)] (Ref.[HG11s],Definition 5.4,p.7). Also, the new 5881

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

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

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

TA (x), IA (x), FA (x) >, x ∈ X}:
TA (X) = min[TA (vi ), TA (vj )]vi ,vj ∈X ,
IA (X) = min[IA (vi ), IA (vj )]vi ,vj ∈X ,
and FA (X) = min[FA (vi ), FA (vj )]vi ,vj ∈X .
TA (x), IA (x), FA (x) >, x ∈ X}:
Definition 29.0.5 (Neutrosophic SuperHyperGraph (NSHG)). (Ref.[HG11s],Definition 5886
2.5,p.2). 5887
Assume V 0 is a given set. a Neutrosophic SuperHyperGraph (NSHG) S is a pair 5888
S = (V, E), where 5889
1, 2, . . . , n0 ); 5894
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 5895
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 5896

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



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

A binary operation ⊗ : [0, 1] × [0, 1] → [0, 1] is a t-norm if it satisfies the following for 5926
x, y, z, w ∈ [0, 1]: 5927
(i) 1 ⊗ x = x; 5928
(ii) x ⊗ y = y ⊗ x; 5929
(iii) x ⊗ (y ⊗ z) = (x ⊗ y) ⊗ z; 5930
(iv) If w ≤ x and y ≤ z then w ⊗ y ≤ x ⊗ z. 5931

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

where 5934

1, 2, . . . , n0 ); 5939
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 5940
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 5941
P
(vii) i supp(Vi ) = V, (i = 1, 2, . . . , n); 5942
0 0
P
(viii) i0 supp(Ei ) = V, (i = 1, 2, . . . , n ). 5943
0

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

Definition 29.0.12. A graph is SuperHyperUniform if it’s SuperHyperGraph and the number 5970
of elements of SuperHyperEdges are the same. 5971
To get more visions on SuperHyperUniform, the some SuperHyperClasses are introduced. It 5972
makes to have SuperHyperUniform more understandable. 5973
Definition 29.0.13. Assume a Neutrosophic SuperHyperGraph. There are some SuperHyper- 5974
Classes as follows. 5975
(i). It’s Neutrosophic SuperHyperPath if it’s only one SuperVertex as intersection amid 5976
two given SuperHyperEdges with two exceptions; 5977
(ii). it’s SuperHyperCycle if it’s only one SuperVertex as intersection amid two given 5978
SuperHyperEdges; 5979
(iii). it’s SuperHyperStar it’s only one SuperVertex as intersection amid all SuperHyperEdges; 5980
(iv). it’s SuperHyperBipartite it’s only one SuperVertex as intersection amid two given Supe- 5981
rHyperEdges and these SuperVertices, forming two separate sets, has no SuperHyperEdge 5982
in common; 5983
(v). it’s SuperHyperMultiPartite it’s only one SuperVertex as intersection amid two 5984
given SuperHyperEdges and these SuperVertices, forming multi separate sets, has no 5985
SuperHyperEdge in common; 5986
(vi). it’s SuperHyperWheel if it’s only one SuperVertex as intersection amid two given 5987
SuperHyperEdges and one SuperVertex has one SuperHyperEdge with any common 5988
SuperVertex. 5989
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 5990
(NSHV) V1 to Neutrosophic SuperHyperVertex (NSHV) Vs if either of following conditions hold: 5991
(i) Vi , Vi+1 ∈ Ei0 ; 5992
(ii) there’s a vertex vi ∈ Vi such that vi , Vi+1 ∈ Ei0 ; 5993
(iii) there’s a SuperVertex Vi0 ∈ Vi such that Vi0 , Vi+1 ∈ Ei0 ; 5994
(iv) there’s a vertex vi+1 ∈ Vi+1 such that Vi , vi+1 ∈ Ei0 ; 5995
0 0
(v) there’s a SuperVertex Vi+1 ∈ Vi+1 such that Vi , Vi+1 ∈ E i0 ; 5996
(vi) there are a vertex vi ∈ Vi and a vertex vi+1 ∈ Vi+1 such that vi , vi+1 ∈ Ei0 ; 5997
0 0
(vii) there are a vertex vi ∈ Vi and a SuperVertex Vi+1 ∈ Vi+1 such that vi , Vi+1 ∈ Ei0 ; 5998
(viii) there are a SuperVertex Vi0 ∈ Vi and a vertex vi+1 ∈ Vi+1 such that Vi0 , vi+1 ∈ Ei0 ; 5999
(ix) there are a SuperVertex Vi0 ∈ Vi and a SuperVertex Vi+1

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

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. 6001
(i) If for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | = 2, then NSHP is called path; 6002
(ii) if for all Ej 0 , |Ej 0 | = 2, and there’s Vi , |Vi | ≥ 1, then NSHP is called SuperPath; 6003
(iii) if for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | ≥ 2, then NSHP is called HyperPath; 6004
(iv) if there are Vi , Ej 0 , |Vi | ≥ 1, |Ej 0 | ≥ 2, then NSHP is called Neutrosophic SuperHy- 6005
perPath . 6006
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 6007
(i) Neutrosophic t-strength (min{T (Vi )}, m, n)si=1 ; 6008
(ii) Neutrosophic i-strength (m, min{I(Vi )}, n)si=1 ; 6009
(iii) Neutrosophic f-strength (m, n, min{F (Vi )})si=1 ; 6010
(iv) Neutrosophic strength (min{T (Vi )}, min{I(Vi )}, min{F (Vi )})si=1 . 6011
Definition 29.0.17 (Different Neutrosophic Types of Neutrosophic SuperHyperEdges (NSHE)). 6012

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

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


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

(xii) Neutrosophic Connective if (T (E), I(E), F (E)) ≥ maximum number of Neutrosophic 6025
strength of SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex (NSHV) Vi 6026
to Neutrosophic SuperHyperVertex (NSHV) Vj where 1 ≤ i, j ≤ s. 6027
Definition 29.0.18. (Different Neutrosophic Types of Neutrosophic SuperHyperEqual Dimension 6028

Dominating). 6029

(i) Neutrosophic e-SuperHyperEqual Dimension Dominating if the following expression is 6033

called Neutrosophic e-SuperHyperEqual Dimension Dominating criteria holds 6034

(ii) Neutrosophic re-SuperHyperEqual Dimension Dominating if the following expression is 6035

called Neutrosophic re-SuperHyperEqual Dimension Dominating criteria holds 6036

and |Ei |NEUTROSOPHIC CARDINALITY = |Ej |NEUTROSOPHIC CARDINALITY ; 6037
(iii) Neutrosophic v-SuperHyperEqual Dimension Dominating if the following expression is 6038

(iv) Neutrosophic rv-SuperHyperEqual Dimension Dominating if the following expression is 6040

and |Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; 6042
(v) Neutrosophic SuperHyperEqual Dimension Dominating if it’s either of Neutrosophic e- 6043


Definition 29.0.19. ((Neutrosophic) SuperHyperEqual Dimension Dominating). 6047

(i) an Extreme SuperHyperEqual Dimension Dominating if it’s either of Neutrosophic e- 6050


(ii) a Neutrosophic SuperHyperEqual Dimension Dominating if it’s either of Neutrosophic 6058


(iii) an Extreme SuperHyperEqual Dimension Dominating SuperHyperPolynomial if 6066

Neutrosophic rv-SuperHyperEqual Dimension Dominating and C(N SHG) for an Extreme Super- 6069
HyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme 6070
coefficients defined as the Extreme number of the maximum Extreme cardinality of the 6071
Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme cardinal- 6072
ity consecutive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that 6073
they form the Extreme SuperHyperEqual Dimension Dominating; and the Extreme power is 6074
(iv) a Neutrosophic SuperHyperEqual Dimension Dominating SuperHyperPolynomial 6076


S of high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and Neutro- 6083
sophic SuperHyperVertices such that they form the Neutrosophic SuperHyperEqual Dimension 6084
Dominating; and the Neutrosophic power is corresponded to its Neutrosophic coefficient; 6085
(v) an Extreme V-SuperHyperEqual Dimension Dominating if it’s either of Neutrosophic e- 6086



(vi) a Neutrosophic V-SuperHyperEqual Dimension Dominating if it’s either of Neutrosophic 6094


(vii) an Extreme V-SuperHyperEqual Dimension Dominating SuperHyperPolynomial if 6102

Neutrosophic rv-SuperHyperEqual Dimension Dominating and C(N SHG) for an Extreme Su- 6105
perHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the 6106

that they form the Extreme SuperHyperEqual Dimension Dominating; and the Extreme power is 6110
(viii) a Neutrosophic SuperHyperEqual Dimension Dominating SuperHyperPolynomial 6112

the Neutrosophic coefficients defined as the Neutrosophic number of the maximum Neut- 6117
rosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHy- 6118
perSet S of high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges 6119
and Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHy- 6120
perEqual Dimension Dominating; and the Neutrosophic power is corresponded to its Neutrosophic 6121
coefficient. 6122
Definition 29.0.20. ((Extreme/Neutrosophic)δ−SuperHyperEqual Dimension Dominating). 6123

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

SuperHyperEqual Dimension Dominating such that either of the following expressions hold for 6126
the Neutrosophic cardinalities of SuperHyperNeighbors of s ∈ S : 6127
|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 6128
(29.1), holds if S is an δ−SuperHyperDefensive; 6129


136TBL3
(ii) a Neutrosophic δ−SuperHyperEqual Dimension Dominating is a Neutrosophic kind 6130

of Neutrosophic SuperHyperEqual Dimension Dominating such that either of the following 6131
Neutrosophic expressions hold for the Neutrosophic cardinalities of SuperHyperNeighbors 6132
of s ∈ S : 6133
|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 6134

the Expression (29.1), holds if S is a Neutrosophic δ−SuperHyperDefensive. 6135
“redefine” the notion of “Neutrosophic SuperHyperGraph”. The SuperHyperVertices and the 6137
there’s the usage of the position of labels to assign to the values. 6139
136DEF1 Definition 29.0.21. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 6140
It’s redefined Neutrosophic SuperHyperGraph if the Table (29.1) holds. 6141
It’s useful to define a “Neutrosophic” version of SuperHyperClasses. Since there’s more ways 6142
to get Neutrosophic type-results to make a Neutrosophic more understandable. 6143
136DEF2 Definition 29.0.22. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = 6144

(V, E). There are some Neutrosophic SuperHyperClasses if the Table (29.2) holds. 6145
Thus Neutrosophic SuperHyperPath , SuperHyperEqual Dimension Dominating, SuperHyperStar, 6146

SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, are Neutrosophic 6147
SuperHyperPath, Neutrosophic SuperHyperCycle, Neutrosophic SuperHyperStar, 6148
Neutrosophic SuperHyperBipartite, Neutrosophic SuperHyperMultiPartite, and 6149
Neutrosophic SuperHyperWheel if the Table (29.2) holds. 6150
It’s useful to define a “Neutrosophic” version of a Neutrosophic SuperHyperEqual Dimension 6151
Dominating. Since there’s more ways to get type-results to make a Neutrosophic SuperHyperEqual 6152
Dimension Dominating more Neutrosophicly understandable. 6153
“redefine” the Neutrosophic notion of “Neutrosophic SuperHyperEqual Dimension Dominating”. The 6155
6158

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

136TBL4

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

CHAPTER 30 6161
Neutrosophic SuperHyper But Equal Dimension Dominating 6162
As The Extensions Excerpt From Dense 6163
And Super Forms 6164
Definition 30.0.1. (Neutrosophic event). 6165
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 6166

S = (V, E) is a probability Equal Dimension Dominating. Any Neutrosophic k-subset of A of V 6167
is called Neutrosophic k-event and if k = 2, then Neutrosophic subset of A of V is called 6168
Neutrosophic event. The following expression is called Neutrosophic probability of A. 6169
X
E(A) = E(a). (30.1)
a∈A
Definition 30.0.2. (Neutrosophic Independent). 6170

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) is 6171
a probability Equal Dimension Dominating. s Neutrosophic k-events Ai , i ∈ I is called Neutrosophic 6172

s-independent if the following expression is called Neutrosophic s-independent criteria 6173
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. 6174
The following expression is called Neutrosophic independent criteria 6175
E(A ∩ B) = P (A)P (B). (30.2)
Definition 30.0.3. (Neutrosophic Variable). 6176

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) 6177
is a probability Equal Dimension Dominating. Any k-function Equal Dimension Dominating like E is called 6178
Neutrosophic k-Variable. If k = 2, then any 2-function Equal Dimension Dominating like E is 6179
called Neutrosophic Variable. 6180
The notion of independent on Neutrosophic Variable is likewise. 6181
Definition 30.0.4. (Neutrosophic Expectation). 6182
283
is a probability Equal Dimension Dominating. A Neutrosophic k-Variable E has a number is called 6184
Neutrosophic Expectation if the following expression is called Neutrosophic Expectation 6185
criteria 6186
X
Ex(E) = E(α)P (α).
α∈V
Definition 30.0.5. (Neutrosophic Crossing). 6187

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) is 6188
a probability Equal Dimension Dominating. A Neutrosophic number is called Neutrosophic Crossing 6189
if the following expression is called Neutrosophic Crossing criteria 6190
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). 6191
Consider S = (V, E) is a probability Equal Dimension Dominating. Let m and n propose special Equal 6192
Dimension Dominating. Then with m ≥ 4n, 6193
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 Equal Dimension Dominating p := 4n/m, and set H := G[S] and
H := G[S].
Define random variables X, Y, Z on V as follows: X is the Neutrosophic number of
SuperHyperVertices, Y the Neutrosophic number of SuperHyperEdges, and Z the Neutrosophic
number of crossings of H. The trivial bound noted above, when applied to H, yields the
inequality Z ≥ cr(H) ≥ Y − 3X. By linearity of Neutrosophic Expectation,
E(Z) ≥ E(Y ) − 3E(X).
Now E(X) = pn, E(Y ) = p2 m (each SuperHyperEdge having some SuperHyperEnds) and
E(Z) = p4 cr(G) (each crossing being defined by some SuperHyperVertices). Hence
p4 cr(G) ≥ p2 m − 3pn.
Dividing both sides by p4 , we have: 6194
pm − 3n n 1 3 2
cr(G) ≥ = 3 = 64 m n .
p3 (4n/m)
6195
Theorem 30.0.7. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 6196
Consider S = (V, E) is a probability Equal Dimension Dominating. Let P be a SuperHyperSet of n points 6197
in the plane, and let l be the Neutrosophic number of√SuperHyperLines in the plane passing 6198
through at least k + 1 of these points, where 1 ≤ k ≤ 2 2n. Then l < 32n2 /k 3 . 6199
Proof. Form a Neutrosophic SuperHyperGraph G with SuperHyperVertex SuperHyperSet P 6200

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

points in the plane, and let k be the number of pairs of points of P at unit SuperHyperDistance. 6208
Then k < 5n4/3 . 6209
Proof. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = 6210
(V, E) is a probability Equal Dimension Dominating. Draw a SuperHyperUnit SuperHyperCircle around 6211
each SuperHyperPoint of P. Let ni be the Neutrosophic number of these SuperHyperCircles 6212
i = 0n−1 ni = n and k = 12 i = 0n−1 ini .
P P
passing through exactly i points of P. Then 6213
Now form a Neutrosophic SuperHyperGraph H with SuperHyperVertex SuperHyperSet P 6214
whose SuperHyperEdges are the SuperHyperArcs between consecutive SuperHyperPoints on 6215
the SuperHyperCircles that pass through at least three SuperHyperPoints of P. Then 6216
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 6217

SuperHyperEdges. Delete from H one of each SuperHyperPair of parallel SuperHyperEdges, 6218
so as to obtain a simple Neutrosophic SuperHyperGraph G with e(G) ≥ k − n. Now 6219
cr(G) ≤ n(n − 1) because G is formed from at most n SuperHyperCircles, and any two 6220
SuperHyperCircles cross at most twice. Thus either e(G) < 4n, in which case k < 5n < 5n4/3 , 6221
3
or n2 > n(n − 1) ≥ cr(G) ≥ (k − n) /64n2 by the Neutrosophic Crossing Lemma, and 6222
4/3 4/3
k < 4n + n < 5n . 6223
Proposition 30.0.9. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 6224
Consider S = (V, E) is a probability Equal Dimension Dominating. Let X be a nonnegative Neutrosophic 6225
Variable and t a positive real number. Then 6226
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. 6227
Corollary 30.0.10. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 6228
Consider S = (V, E) is a probability Equal Dimension Dominating. Let Xn be a nonnegative integer- 6229
valued variable in a probability Equal Dimension Dominating (Vn , En ), n ≥ 1. If E(Xn ) → 0 as n → ∞, 6230
then P (Xn = 0) → 1 as n → ∞. 6231
Proof. 6232
Consider S = (V, E) is a probability Equal Dimension Dominating. A special SuperHyperGraph in Gn,p 6234
almost surely has stability number at most d2p−1 log ne. 6235

Proof. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 6236
S = (V, E) is a probability Equal Dimension Dominating. A special SuperHyperGraph in Gn,p is 6237
up. Let G ∈ Gn,p and let S be a given SuperHyperSet of k + 1 SuperHyperVertices of G, 6238
where k ∈ N. The probability that S is a stable SuperHyperSet of G is (1 − p)(k+1)choose2 , this 6239
being the probability that none of the (k + 1)choose2 pairs of SuperHyperVertices of S is a 6240
SuperHyperEdge of the Neutrosophic SuperHyperGraph G. 6241
Let AS denote the event that S is a stable SuperHyperSet of G, and let XS denote the indicator 6242
Neutrosophic Variable for this Neutrosophic Event. By equation, we have 6243
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 6244
X
X= {XS : S ⊆ V, |S| = k + 1}
and so, by those, 6245
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: 6246
nk+1
(n choose k+1) ≤ and1 − p ≤ e−p .
(k + 1)!
This yields the following upper bound on E(X). 6247
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 6248
least as fast as the logarithm of n, implies that E(X) → 0 as n → ∞. Because X is integer-valued 6249
and nonnegative, we deduce from Corollary that P (X = 0) → 1 as n → ∞. Consequently, a 6250
Neutrosophic SuperHyperGraph in Gn,p almost surely has stability number at most k. 6251
Definition 30.0.12. (Neutrosophic Variance). 6252
is a probability Equal Dimension Dominating. A Neutrosophic k-Variable E has a number is called 6254
Neutrosophic Variance if the following expression is called Neutrosophic Variance 6255
criteria 6256
2
V x(E) = Ex((X − Ex(X)) ).
Consider S = (V, E) is a probability Equal Dimension Dominating. Let X be a Neutrosophic Variable 6258
and let t be a positive real number. Then 6259
V (X)
E(|X − Ex(X)| ≥ t) ≤ .
t2

S = (V, E) is a probability Equal Dimension Dominating. Let X be a Neutrosophic Variable and let t 6261
be a positive real number. Then 6262
2
2 Ex((X − Ex(X)) ) V (X)
E(|X − Ex(X)| ≥ t) = E((X − Ex(X)) ≥ t2 ) ≤ 2
= .
t t2
6263
Consider S = (V, E) is a probability Equal Dimension Dominating. Let Xn be a Neutrosophic Variable 6265
in a probability Equal Dimension Dominating (Vn , En ), n ≥ 1. If Ex(Xn ) 6= 0 and V (Xn ) << E 2 (Xn ), 6266
then 6267
E(Xn = 0) → 0 as n → ∞
S = (V, E) is a probability Equal Dimension Dominating. Set X := Xn and t := |Ex(Xn )| in 6269
Chebyshev’s Inequality, and observe that E(Xn = 0) ≤ E(|Xn − Ex(Xn )| ≥ |Ex(Xn )|) because 6270
|Xn − Ex(Xn )| = |Ex(Xn )| when Xn = 0. 6271
Consider S = (V, E) is a probability Equal Dimension Dominating. Let G ∈ Gn,1/2 . For 0 ≤ k ≤ n, set 6273
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 6274
one. Then almost surely α(G) takes one of the three values k ∗ − 2, k ∗ − 1, k ∗ . 6275
S = (V, E) is a probability Equal Dimension Dominating. As in the proof of related Theorem, the 6277
result is straightforward. 6278
Consider S = (V, E) is a probability Equal Dimension Dominating. Let G ∈ Gn,1/2 and let f and k ∗ be 6280
as defined in previous Theorem. Then either: 6281
(i). f (k ∗ ) << 1, in which case almost surely α(G) is equal to either k ∗ − 2 or k ∗ − 1, or 6282
(ii). f (k ∗ − 1) >> 1, in which case almost surely α(G) is equal to either k ∗ − 1 or k ∗ . 6283
Definition 30.0.17. (Neutrosophic Threshold). 6286

is a probability Equal Dimension Dominating. Let P be a monotone property of SuperHyperGraphs 6288
(one which is preserved when SuperHyperEdges are added). Then a Neutrosophic Threshold 6289
for P is a function f (n) such that: 6290
(i). if p << f (n), then G ∈ Gn,p almost surely does not have P, 6291
(ii). if p >> f (n), then G ∈ Gn,p almost surely has P. 6292

Definition 30.0.18. (Neutrosophic Balanced). 6293

is a probability Equal Dimension Dominating. Let F be a fixed Neutrosophic SuperHyperGraph. Then 6295
there is a threshold function for the property of containing a copy of F as a Neutrosophic 6296
SubSuperHyperGraph is called Neutrosophic Balanced. 6297
Theorem 30.0.19. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = 6298

(V, E). Consider S = (V, E) is a probability Equal Dimension Dominating. Let F be a nonempty 6299
balanced Neutrosophic SubSuperHyperGraph with k SuperHyperVertices and l SuperHyperEdges. 6300
Then n−k/l is a threshold function for the property of containing F as a Neutrosophic 6301
SubSuperHyperGraph. 6302
136EXM1 Example 30.0.20. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E) 6305
in the mentioned Neutrosophic Figures in every Neutrosophic items. 6306
• On the Figure (30.1), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 6307

SuperHyperEqual Dimension Dominating, is up. The Neutrosophic Algorithm is Neutrosophicly 6308
straightforward. E1 and E3 are some empty Neutrosophic SuperHyperEdges but E2 6309
is a loop Neutrosophic SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. 6310

Thus in the terms of Neutrosophic SuperHyperNeighbor, there’s only one Neutrosophic 6311
SuperHyperEdge, namely, E4 . The Neutrosophic SuperHyperVertex, V3 is Neutrosophic 6312
isolated means that there’s no Neutrosophic SuperHyperEdge has it as a Neutrosophic 6313
endpoint. Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in every given 6314
Neutrosophic SuperHyperEqual Dimension Dominating. 6315
C(N SHG)Neutrosophic Equal Dimension Dominating =

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

straightforward. E1 , E2 and E3 are some empty Neutrosophic SuperHyperEdges 6319
but E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of Neutrosophic 6320
SuperHyperNeighbor, there’s only one Neutrosophic SuperHyperEdge, namely, E4 . The 6321
Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means that there’s no 6322
Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. Thus the Neutrosophic 6323

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

Neutrosophic SuperHyperEqual Dimension Dominating in the Neutrosophic Example (42.0.3) 136NSHG1
SuperHyperVertex, V3 , is excluded in every given Neutrosophic SuperHyperEqual Dimension 6324

Dominating. 6325

{}.
= 0z 0 .
{}.
= 0z 0 .
6326


{}.
= 0z 0 .
{}.



= 0z 0 .
6330


{}.
= 0z 0 .
{}.
= 0z 0 .
6334






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


{Ei }22
i=12 .
= z 3−a .



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


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




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


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


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


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







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


{EN SHG − {E1 , E2 }}.


= z 2−a .
{VN SHG − {V1 , V5 }}.
= z 5−a .
6366


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




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


{E3i+1 }1i=0 .


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


{E3i+1 }1i=0 .


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


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







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


{E3i+1 }3i=0 .



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


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


= z 3−a .
6398


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


Neutrosophic SuperHyperEqual Dimension Dominating in the Neutrosophic Example (42.0.3) 95NHG1

{E2i+3 }1i=0 .
= z 1−a .
{V1 , V10 , V6 }.
= z 4−a .
6406
Proposition 30.0.21. Assume a connected Neutrosophic SuperHyperGraph ESHG : (V, E). The 6407
all interior Neutrosophic SuperHyperVertices belong to any Neutrosophic quasi-R-Equal Dimension 6408


Neutrosophic SuperHyperEqual Dimension Dominating in the Neutrosophic Example (42.0.3) 95NHG2
Dominating if for any of them, and any of other corresponded Neutrosophic SuperHyperVertex, 6409
some interior Neutrosophic SuperHyperVertices are mutually Neutrosophic SuperHyperNeighbors 6410
with no Neutrosophic exception at all minus all Neutrosophic SuperHypeNeighbors to any amount 6411
of them. 6412
Proposition 30.0.22. Assume a connected non-obvious Neutrosophic SuperHyperGraph ESHG : 6413
(V, E). There’s only one Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) has only the maximum 6414
possibilities of the distinct interior Neutrosophic SuperHyperVertices inside of any given 6415
Neutrosophic quasi-R-Equal Dimension Dominating minus all Neutrosophic SuperHypeNeighbor to some 6416
of them but not all of them. In other words, there’s only an unique Neutrosophic SuperHyperEdge 6417
E ∈ EESHG:(V,E) has only two distinct Neutrosophic SuperHyperVertices in an Neutrosophic 6418
quasi-R-Equal Dimension Dominating, minus all Neutrosophic SuperHypeNeighbor to some of them but 6419
not all of them. 6420
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-Equal Dimension Dominating is at least
V \ (V \ {aE , bE , cE , . . . , zE }).
It’s straightforward that the Neutrosophic cardinality of the Neutrosophic R-Equal Dimension Dominating 6421
is at least the maximum Neutrosophic number of Neutrosophic SuperHyperVertices of the 6422
Neutrosophic SuperHyperEdges with the maximum number of the Neutrosophic SuperHyperEdges. 6423
In other words, the maximum number of the Neutrosophic SuperHyperEdges contains 6424
the maximum Neutrosophic number of Neutrosophic SuperHyperVertices are renamed to 6425

Neutrosophic Equal Dimension Dominating in some cases but the maximum number of the Neutrosophic 6426
SuperHyperEdge with the maximum Neutrosophic number of Neutrosophic SuperHyperVertices, 6427
has the Neutrosophic SuperHyperVertices are contained in a Neutrosophic R-Equal Dimension 6428
Dominating. 6429
Proposition 30.0.24. Assume a simple Neutrosophic SuperHyperGraph ESHG : (V, E). Then
the Neutrosophic number of type-result-R-Equal Dimension Dominating has, the least Neutrosophic
cardinality, the lower sharp Neutrosophic bound for Neutrosophic cardinality, is the Neutrosophic
cardinality of
V \ V \ {aE , bE 0 , cE 00 , cE 000 }E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .
If there’s a Neutrosophic type-result-R-Equal Dimension Dominating with the least Neutrosophic 6430
cardinality, the lower sharp Neutrosophic bound for cardinality. 6431
Proposition 30.0.25. Assume a connected loopless Neutrosophic SuperHyperGraph ESHG : 6432

(V, E). Then in the worst case, literally, 6433
C(N SHG)N eutrosophicQuasi−EqualDimensionDominating

= {V1 , E1 , V2 , E2 , V3 , E3 , V4 , E4 , V1 }.
C(N SHG)N eutrosophicQuasi−EqualDimensionDominatingSuperHyperP olynomial = z 4 .
C(N SHG)N eutrosophicQuasi−EqualDimensionDominating = {V1 , V2 , V3 , V4 , V1 }.
C(N SHG)N eutrosophicR−Quasi−EqualDimensionDominatingSuperHyperP olynomial = z 5 .
Is a Neutrosophic type-result-Equal Dimension Dominating. In other words, the least cardinality, the 6434
lower sharp bound for the cardinality, of a Neutrosophic type-result-Equal Dimension Dominating is the 6435
cardinality of 6436

= {V1 , E1 , V2 , E2 , V3 , E3 , V4 , E4 , V1 }.
C(N SHG)N eutrosophicQuasi−EqualDimensionDominatingSuperHyperP olynomial = z 4 .
C(N SHG)N eutrosophicQuasi−EqualDimensionDominating = {V1 , V2 , V3 , V4 , V1 }.
C(N SHG)N eutrosophicR−Quasi−EqualDimensionDominatingSuperHyperP 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-Equal Dimension Dominating
since neither amount of Neutrosophic SuperHyperEdges nor amount of SuperHyperVertices
where amount refers to the Neutrosophic number of SuperHyperVertices(-/SuperHyperEdges)
more than one to form any kind of SuperHyperEdges or any number of SuperHyperEdges. Let
us consider the Neutrosophic SuperHyperSet
V \ V \ {aE , bE , cE , . . . , aE 0 , bE 0 , cE 0 , . . .}E,E 0 ={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .
This Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices has the eligibilities

to propose property such that there’s no Neutrosophic SuperHyperVertex of a Neutrosophic
SuperHyperEdge is common and there’s an Neutrosophic SuperHyperEdge for all Neutrosophic

SuperHyperVertices but the maximum Neutrosophic cardinality indicates that these Neutro-
sophic type-SuperHyperSets couldn’t give us the Neutrosophic lower bound in the term of
Neutrosophic sharpness. In other words, the Neutrosophic SuperHyperSet
of the Neutrosophic SuperHyperVertices implies at least on-quasi-triangle style is up but

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

to the supposition on the connected loopless Neutrosophic SuperHyperGraph ESHG : (V, E).
Thus the minimum case never happens in the generality of the connected loopless Neutrosophic
SuperHyperGraphs. Thus if we assume in the worst case, literally,
Is a quasi-R-Equal Dimension Dominating. In other words, the least cardinality, the lower sharp bound
for the cardinality, of a quasi-R-Equal Dimension Dominating is the cardinality of
Then we’ve lost some connected loopless Neutrosophic SuperHyperClasses of the connected
loopless Neutrosophic SuperHyperGraphs titled free-triangle, on-triangle, and their quasi-types
but the SuperHyperStable is only up in this quasi-R-Equal Dimension Dominating. It’s the contradiction
to that fact on the generality. There are some counterexamples to deny this statement. One of
them comes from the setting of the graph titled path and cycle as the counterexamples-classes or
reversely direction star as the examples-classes, are well-known classes in that setting and they
could be considered as the examples-classes and counterexamples-classes for the tight bound of
Let V \ V \ {z} in mind. There’s no necessity on the SuperHyperEdge since we need at least
two SuperHyperVertices to form a SuperHyperEdge. It doesn’t withdraw the principles of the
main definition since there’s no condition to be satisfied but the condition is on the existence of
the SuperHyperEdge instead of acting on the SuperHyperVertices. In other words, if there’s a
SuperHyperEdge, then the Neutrosophic SuperHyperSet has the necessary condition for the
intended definition to be applied. Thus the V \ V \ {z} is withdrawn not by the conditions of
the main definition but by the necessity of the pre-condition on the usage of the main definition.
The Neutrosophic structure of the Neutrosophic R-Equal Dimension Dominating decorates the
Neutrosophic SuperHyperVertices don’t have received any Neutrosophic connections so as
this Neutrosophic style implies different versions of Neutrosophic SuperHyperEdges with
the maximum Neutrosophic cardinality in the terms of Neutrosophic SuperHyperVertices
are spotlight. The lower Neutrosophic bound is to have the maximum Neutrosophic
groups of Neutrosophic SuperHyperVertices have perfect Neutrosophic connections inside
each of SuperHyperEdges and the outside of this Neutrosophic SuperHyperSet doesn’t

matter but regarding the connectedness of the used Neutrosophic SuperHyperGraph arising
from its Neutrosophic properties taken from the fact that it’s simple. If there’s no more
than one Neutrosophic SuperHyperVertex in the targeted Neutrosophic SuperHyperSet,
then there’s no Neutrosophic connection. Furthermore, the Neutrosophic existence of one
Neutrosophic SuperHyperVertex has no Neutrosophic effect to talk about the Neutrosophic
R-Equal Dimension Dominating. Since at least two Neutrosophic SuperHyperVertices involve
to make a title in the Neutrosophic background of the Neutrosophic SuperHyperGraph.
The Neutrosophic SuperHyperGraph is obvious if it has no Neutrosophic SuperHyperEdge
but at least two Neutrosophic SuperHyperVertices make the Neutrosophic version of
Neutrosophic SuperHyperEdge. Thus in the Neutrosophic setting of non-obvious Neutrosophic
SuperHyperGraph, there are at least one Neutrosophic SuperHyperEdge. It’s necessary to
mention that the word “Simple” is used as Neutrosophic adjective for the initial Neutrosophic
SuperHyperGraph, induces there’s no Neutrosophic appearance of the loop Neutrosophic
version of the Neutrosophic SuperHyperEdge and this Neutrosophic SuperHyperGraph is
said to be loopless. The Neutrosophic adjective “loop” on the basic Neutrosophic framework
engages one Neutrosophic SuperHyperVertex but it never happens in this Neutrosophic setting.
With these Neutrosophic bases, on a Neutrosophic SuperHyperGraph, there’s at least one
Neutrosophic SuperHyperEdge thus there’s at least a Neutrosophic R-Equal Dimension Dominating has
the Neutrosophic cardinality of a Neutrosophic SuperHyperEdge. Thus, a Neutrosophic R-Equal
Dimension Dominating has the Neutrosophic cardinality at least a Neutrosophic SuperHyperEdge.
Assume a Neutrosophic SuperHyperSet V \ V \ {z}. This Neutrosophic SuperHyperSet isn’t a
Neutrosophic R-Equal Dimension Dominating since either the Neutrosophic SuperHyperGraph is an
obvious Neutrosophic SuperHyperModel thus it never happens since there’s no Neutrosophic
usage of this Neutrosophic framework and even more there’s no Neutrosophic connection
inside or the Neutrosophic SuperHyperGraph isn’t obvious and as its consequences, there’s a
Neutrosophic contradiction with the term “Neutrosophic R-Equal Dimension Dominating” since the
maximum Neutrosophic cardinality never happens for this Neutrosophic style of the Neutrosophic
SuperHyperSet and beyond that there’s no Neutrosophic connection inside as mentioned in first
Neutrosophic case in the forms of drawback for this selected Neutrosophic SuperHyperSet. Let
Comes up. This Neutrosophic case implies having the Neutrosophic style of on-quasi-triangle
Neutrosophic style on the every Neutrosophic elements of this Neutrosophic SuperHyperSet.
Precisely, the Neutrosophic R-Equal Dimension Dominating is the Neutrosophic SuperHyperSet of the
Neutrosophic SuperHyperVertices such that some Neutrosophic amount of the Neutrosophic
SuperHyperVertices are on-quasi-triangle Neutrosophic style. The Neutrosophic cardinality of
the v SuperHypeSet
Is the maximum in comparison to the Neutrosophic SuperHyperSet
But the lower Neutrosophic bound is up. Thus the minimum Neutrosophic cardinality of the
maximum Neutrosophic cardinality ends up the Neutrosophic discussion. The first Neutrosophic

term refers to the Neutrosophic setting of the Neutrosophic SuperHyperGraph but this key
point is enough since there’s a Neutrosophic SuperHyperClass of a Neutrosophic SuperHy-
perGraph has no on-quasi-triangle Neutrosophic style amid some amount of its Neutrosophic
SuperHyperVertices. This Neutrosophic setting of the Neutrosophic SuperHyperModel proposes
a Neutrosophic SuperHyperSet has only some amount Neutrosophic SuperHyperVertices from
one Neutrosophic SuperHyperEdge such that there’s no Neutrosophic amount of Neutrosophic
SuperHyperEdges more than one involving these some amount of these Neutrosophic SuperHy-
perVertices. The Neutrosophic cardinality of this Neutrosophic SuperHyperSet is the maximum
and the Neutrosophic case is occurred in the minimum Neutrosophic situation. To sum them
up, the Neutrosophic SuperHyperSet
Has the maximum Neutrosophic cardinality such that
Contains some Neutrosophic SuperHyperVertices such that there’s distinct-covers-order-amount

Neutrosophic SuperHyperEdges for amount of Neutrosophic SuperHyperVertices taken from
the Neutrosophic SuperHyperSet
It means that the Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices
Is a Neutrosophic R-Equal Dimension Dominating for the Neutrosophic SuperHyperGraph as used

Neutrosophic background in the Neutrosophic terms of worst Neutrosophic case and the common
theme of the lower Neutrosophic bound occurred in the specific Neutrosophic SuperHyperClasses
of the Neutrosophic SuperHyperGraphs which are Neutrosophic free-quasi-triangle.
Assume a Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) has z Neutrosophic number of
the Neutrosophic SuperHyperVertices. Then every Neutrosophic SuperHyperVertex has at
least no Neutrosophic SuperHyperEdge with others in common. Thus those Neutrosophic
SuperHyperVertices have the eligibles to be contained in a Neutrosophic R-Equal Dimension Dominating.
Those Neutrosophic SuperHyperVertices are potentially included in a Neutrosophic style-R-Equal
Dimension Dominating. Formally, consider
V \ (V \ {aE , bE , cE , . . . , zE }).
Are the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) .

Thus
Zi ∼ Zj , i 6= j, i, j = 1, 2, . . . , z.
where the ∼ isn’t an equivalence relation but only the symmetric relation on the Neutrosophic
SuperHyperVertices of the Neutrosophic SuperHyperGraph. The formal definition is as follows.
Zi ∼ Zj , i 6= j, i, j = 1, 2, . . . , z

if and only if Zi and Zj are the Neutrosophic SuperHyperVertices and there’s only and only one
Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) between the Neutrosophic SuperHyperVertices
Zi and Zj . The other definition for the Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) in the
terms of Neutrosophic R-Equal Dimension Dominating is
{aE , bE , cE , . . . , zE } .
This definition coincides with the definition of the Neutrosophic R-Equal Dimension Dominating but
with slightly differences in the maximum Neutrosophic cardinality amid those Neutrosophic type-
SuperHyperSets of the Neutrosophic SuperHyperVertices. Thus the Neutrosophic SuperHyperSet
of the Neutrosophic SuperHyperVertices,
max |{Z1 , Z2 , . . . , Zz | Zi ∼ Zj , i 6= j, i, j = 1, 2, . . . , z}|Neutrosophic cardinality ,

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

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

Thus E ∈ EESHG:(V,E) is a Neutrosophic quasi-R-Equal Dimension Dominating where E ∈ EESHG:(V,E)

is fixed that means Ex = E ∈ EESHG:(V,E) . for all Neutrosophic intended SuperHyperVertices
but in a Neutrosophic Equal Dimension Dominating, Ex = E ∈ EESHG:(V,E) could be different and it’s
not unique. To sum them up, in a connected Neutrosophic SuperHyperGraph ESHG : (V, E).
If a Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) has z Neutrosophic SuperHyperVertices,
then the Neutrosophic cardinality of the Neutrosophic R-Equal Dimension Dominating is at least
V \ (V \ {aE , bE , cE , . . . , zE }).
It’s straightforward that the Neutrosophic cardinality of the Neutrosophic R-Equal Dimension Dom- 6439
inatingis at least the maximum Neutrosophic number of Neutrosophic SuperHyperVertices of 6440
the Neutrosophic SuperHyperEdges with the maximum number of the Neutrosophic SuperHy- 6441
perEdges. In other words, the maximum number of the Neutrosophic SuperHyperEdges contains 6442

the maximum Neutrosophic number of Neutrosophic SuperHyperVertices are renamed to Neut- 6443
rosophic Equal Dimension Dominating in some cases but the maximum number of the Neutrosophic 6444
SuperHyperEdge with the maximum Neutrosophic number of Neutrosophic SuperHyperVertices, 6445
has the Neutrosophic SuperHyperVertices are contained in a Neutrosophic R-Equal Dimension 6446
Dominating. 6447
The obvious SuperHyperGraph has no Neutrosophic SuperHyperEdges. But the non-obvious 6448
Neutrosophic SuperHyperModel is up. The quasi-SuperHyperModel addresses some issues about 6449
the Neutrosophic optimal SuperHyperObject. It specially delivers some remarks on the Neutro- 6450
sophic SuperHyperSet of the Neutrosophic SuperHyperVertices such that there’s distinct amount 6451
of Neutrosophic SuperHyperEdges for distinct amount of Neutrosophic SuperHyperVertices up 6452
to all taken from that Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices 6453
but this Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices is either has 6454
the maximum Neutrosophic SuperHyperCardinality or it doesn’t have maximum Neutrosophic 6455

SuperHyperCardinality. In a non-obvious SuperHyperModel, there’s at least one Neutrosophic 6456
SuperHyperEdge containing at least all Neutrosophic SuperHyperVertices. Thus it forms a 6457
Neutrosophic quasi-R-Equal Dimension Dominating where the Neutrosophic completion of the Neutro- 6458
sophic incidence is up in that. Thus it’s, literarily, a Neutrosophic embedded R-Equal Dimension 6459
Dominating. The SuperHyperNotions of embedded SuperHyperSet and quasi-SuperHyperSet 6460
coincide. In the original setting, these types of SuperHyperSets only don’t satisfy on the 6461
maximum SuperHyperCardinality. Thus the embedded setting is elected such that those Super- 6462
HyperSets have the maximum Neutrosophic SuperHyperCardinality and they’re Neutrosophic 6463
SuperHyperOptimal. The less than two distinct types of Neutrosophic SuperHyperVertices are 6464
included in the minimum Neutrosophic style of the embedded Neutrosophic R-Equal Dimension 6465
Dominating. The interior types of the Neutrosophic SuperHyperVertices are deciders. Since the 6466
Neutrosophic number of SuperHyperNeighbors are only affected by the interior Neutrosophic 6467
SuperHyperVertices. The common connections, more precise and more formal, the perfect 6468
unique connections inside the Neutrosophic SuperHyperSet for any distinct types of Neutro- 6469
sophic SuperHyperVertices pose the Neutrosophic R-Equal Dimension Dominating. Thus Neutrosophic 6470
exterior SuperHyperVertices could be used only in one Neutrosophic SuperHyperEdge and in 6471
Neutrosophic SuperHyperRelation with the interior Neutrosophic SuperHyperVertices in that 6472
Neutrosophic SuperHyperEdge. In the embedded Neutrosophic Equal Dimension Dominating, there’s 6473
the usage of exterior Neutrosophic SuperHyperVertices since they’ve more connections inside 6474
more than outside. Thus the title “exterior” is more relevant than the title “interior”. One Neut- 6475
rosophic SuperHyperVertex has no connection, inside. Thus, the Neutrosophic SuperHyperSet 6476
of the Neutrosophic SuperHyperVertices with one SuperHyperElement has been ignored in the 6477
exploring to lead on the optimal case implying the Neutrosophic R-Equal Dimension Dominating. The 6478
Neutrosophic R-Equal Dimension Dominating with the exclusion of the exclusion of all Neutrosophic 6479
SuperHyperVertices in one Neutrosophic SuperHyperEdge and with other terms, the Neutro- 6480
sophic R-Equal Dimension Dominating with the inclusion of all Neutrosophic SuperHyperVertices in 6481
one Neutrosophic SuperHyperEdge, is a Neutrosophic quasi-R-Equal Dimension Dominating. To sum 6482
them up, in a connected non-obvious Neutrosophic SuperHyperGraph ESHG : (V, E). There’s 6483
only one Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) has only the maximum possibilities 6484
of the distinct interior Neutrosophic SuperHyperVertices inside of any given Neutrosophic 6485
quasi-R-Equal Dimension Dominating minus all Neutrosophic SuperHypeNeighbor to some of them 6486
but not all of them. In other words, there’s only an unique Neutrosophic SuperHyperEdge 6487
E ∈ EESHG:(V,E) has only two distinct Neutrosophic SuperHyperVertices in an Neutrosophic 6488

quasi-R-Equal Dimension Dominating, minus all Neutrosophic SuperHypeNeighbor to some of them 6489
but not all of them. 6490
The main definition of the Neutrosophic R-Equal Dimension Dominating has two titles. a Neut- 6491
rosophic quasi-R-Equal Dimension Dominating and its corresponded quasi-maximum Neutrosophic 6492
R-SuperHyperCardinality are two titles in the terms of quasi-R-styles. For any Neutrosophic 6493
number, there’s a Neutrosophic quasi-R-Equal Dimension Dominating with that quasi-maximum Neut- 6494
rosophic SuperHyperCardinality in the terms of the embedded Neutrosophic SuperHyper- 6495

Graph. If there’s an embedded Neutrosophic SuperHyperGraph, then the Neutrosophic quasi- 6496
SuperHyperNotions lead us to take the collection of all the Neutrosophic quasi-R-Equal Dimension 6497
Dominatings for all Neutrosophic numbers less than its Neutrosophic corresponded maximum 6498
number. The essence of the Neutrosophic Equal Dimension Dominating ends up but this essence starts 6499
up in the terms of the Neutrosophic quasi-R-Equal Dimension Dominating, again and more in the 6500
operations of collecting all the Neutrosophic quasi-R-Equal Dimension Dominatings acted on the all 6501
possible used formations of the Neutrosophic SuperHyperGraph to achieve one Neutrosophic 6502
number. This Neutrosophic number is 6503
considered as the equivalence class for all corresponded quasi-R-Equal Dimension Dominatings. Let 6504
zNeutrosophic Number , SNeutrosophic SuperHyperSet and GNeutrosophic Equal Dimension Dominating be a Neut- 6505
rosophic number, a Neutrosophic SuperHyperSet and a Neutrosophic Equal Dimension Dominating. 6506
Then 6507
[zNeutrosophic Number ]Neutrosophic Class = {SNeutrosophic SuperHyperSet |

SNeutrosophic SuperHyperSet = GNeutrosophic Equal Dimension Dominating ,
|SNeutrosophic SuperHyperSet |Neutrosophic Cardinality
= zNeutrosophic Number }.
As its consequences, the formal definition of the Neutrosophic Equal Dimension Dominating is re- 6508
formalized and redefined as follows. 6509
GNeutrosophic Equal Dimension Dominating ∈ ∪zNeutrosophic Number

[zNeutrosophic Number ]Neutrosophic Class =
∪zNeutrosophic Number
{SNeutrosophic SuperHyperSet |
= zNeutrosophic Number }.
To get more precise perceptions, the follow-up expressions propose another formal technical 6510
definition for the Neutrosophic Equal Dimension Dominating. 6511
GNeutrosophic Equal Dimension Dominating =

{S ∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class =
∪zNeutrosophic Number {SNeutrosophic SuperHyperSet |

= zNeutrosophic Number |
= max zNeutrosophic Number }.
[zNeutrosophic Number ]Neutrosophic Class
In more concise and more convenient ways, the modified definition for the Neutrosophic Equal 6512
Dimension Dominating poses the upcoming expressions. 6513

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

= max zNeutrosophic Number

And then, 6515


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

6517

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


6518


6519


Now, the extension of these types of approaches is up. Since the new term, “Neutrosophic 6520
SuperHyperNeighborhood”, could be redefined as the collection of the Neutrosophic Super- 6521
HyperVertices such that any amount of its Neutrosophic SuperHyperVertices are incident to 6522
a Neutrosophic SuperHyperEdge. It’s, literarily, another name for “Neutrosophic Quasi-Equal 6523
Dimension Dominating” but, precisely, it’s the generalization of “Neutrosophic Quasi-Equal Dimension 6524
Dominating” since “Neutrosophic Quasi-Equal Dimension Dominating” happens “Neutrosophic Equal Dimen- 6525
sion Dominating” in a Neutrosophic SuperHyperGraph as initial framework and background but 6526
“Neutrosophic SuperHyperNeighborhood” may not happens “Neutrosophic Equal Dimension Dominat- 6527
ing” in a Neutrosophic SuperHyperGraph as initial framework and preliminarily background 6528

since there are some ambiguities about the Neutrosophic SuperHyperCardinality arise from it. 6529
To get orderly keywords, the terms, “Neutrosophic SuperHyperNeighborhood”, “Neutrosophic 6530
Quasi-Equal Dimension Dominating”, and “Neutrosophic Equal Dimension Dominating” are up. 6531
Thus, let 6532
zNeutrosophic Number , NNeutrosophic SuperHyperNeighborhood and 6533

GNeutrosophic Equal Dimension Dominating be a Neutrosophic number, a Neutrosophic SuperHyper- 6534
Neighborhood and a Neutrosophic Equal Dimension Dominating and the new terms are up. 6535
GNeutrosophic Equal Dimension Dominating ∈ ∪zNeutrosophic Number

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

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

6537

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

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

6540

∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class =

6541



6542


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

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

Graph 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 Equal Dimension Dominating is related to the Neutrosophic SuperHyperSet of the
Neutrosophic SuperHyperVertices,
There’s not only one Neutrosophic SuperHyperVertex inside the intended Neutrosophic
SuperHyperSet. Thus the non-obvious Neutrosophic Equal Dimension Dominating is up. The obvious
simple Neutrosophic type-SuperHyperSet called the Neutrosophic Equal Dimension Dominating is a
Neutrosophic SuperHyperSet includes only one Neutrosophic SuperHyperVertex. But the
Neutrosophic SuperHyperSet of Neutrosophic SuperHyperVertices,

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

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

rosophic SuperHyperVertices such that there’s no a Neutrosophic SuperHyperEdge for some
amount Neutrosophic SuperHyperVertices instead of all given by that Neutrosophic type-
SuperHyperSet called the Neutrosophic Equal Dimension Dominating. There isn’t only less than two
Neutrosophic SuperHyperVertices inside the intended Neutrosophic SuperHyperSet,
Thus the non-obvious Neutrosophic R-Equal Dimension Dominating,
is up. The non-obvious simple Neutrosophic type-SuperHyperSet of the Neutrosophic Equal
Dimension Dominating, not:
Is the Neutrosophic SuperHyperSet, not:
does includes only less than two SuperHyperVertices in a connected Neutrosophic Super- 6543
HyperGraph ESHG : (V, E) but it’s impossible in the case, they’ve corresponded to an 6544
SuperHyperEdge. It’s interesting to mention that the only non-obvious simple Neutrosophic 6545
type-SuperHyperSet called the 6546
“Neutrosophic R-Equal Dimension Dominating” 6547

amid those obvious[non-obvious] simple Neutrosophic type-SuperHyperSets called the 6548
Neutrosophic R-Equal Dimension Dominating, 6549
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-Equal Dimension Dominating amid those obvious simple Neutrosophic type-
SuperHyperSets of the Neutrosophic Equal Dimension Dominating, are
In a connected Neutrosophic SuperHyperGraph ESHG : (V, E).

To sum them up, assume a connected loopless Neutrosophic SuperHyperGraph ESHG : (V, E).
Then in the worst case, literally,
is a Neutrosophic R-Equal Dimension Dominating. In other words, the least cardinality, the lower sharp
bound for the cardinality, of a Neutrosophic R-Equal Dimension Dominating is the cardinality of
6550
To sum them up, in a connected Neutrosophic SuperHyperGraph ESHG : (V, E). The all 6551
interior Neutrosophic SuperHyperVertices belong to any Neutrosophic quasi-R-Equal Dimension 6552
Dominating if for any of them, and any of other corresponded Neutrosophic SuperHyperVertex, 6553
some interior Neutrosophic SuperHyperVertices are mutually Neutrosophic SuperHyperNeigh- 6554
bors with no Neutrosophic exception at all minus all Neutrosophic SuperHypeNeighbors to any 6555
amount of them. 6556
Assume a connected Neutrosophic SuperHyperGraph ESHG : (V, E). Let a Neutrosophic Supe- 6557
rHyperEdge ESHE : E ∈ EESHG:(V,E) has some Neutrosophic SuperHyperVertices r. Consider 6558
all Neutrosophic numbers of those Neutrosophic SuperHyperVertices from that Neutrosophic 6559
SuperHyperEdge excluding excluding more than r distinct Neutrosophic SuperHyperVertices, 6560
exclude to any given Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices. 6561
Consider there’s a Neutrosophic R-Equal Dimension Dominating with the least cardinality, the lower 6562
sharp Neutrosophic bound for Neutrosophic cardinality. Assume a connected Neutrosophic 6563
SuperHyperGraph ESHG : (V, E). The Neutrosophic SuperHyperSet of the Neutrosophic 6564
SuperHyperVertices VESHE \ {z} is a Neutrosophic SuperHyperSet S of the Neutrosophic Su- 6565
perHyperVertices such that there’s a Neutrosophic SuperHyperEdge to have some Neutrosophic 6566
SuperHyperVertices uniquely but it isn’t a Neutrosophic R-Equal Dimension Dominating. Since it 6567
doesn’t have 6568
6569

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

rosophic SuperHyperVertices such that there’s a Neutrosophic SuperHyperEdge to have some 6571
SuperHyperVertices uniquely. The Neutrosophic SuperHyperSet of the Neutrosophic Supe- 6572
rHyperVertices VESHE ∪ {z} is the maximum Neutrosophic cardinality of a Neutrosophic 6573
SuperHyperSet S of Neutrosophic SuperHyperVertices but it isn’t a Neutrosophic R-Equal Dimension 6574
Dominating. Since it doesn’t do the Neutrosophic procedure such that such that there’s a Neut- 6575
rosophic SuperHyperEdge to have some Neutrosophic SuperHyperVertices uniquely [there are at 6576
least one Neutrosophic SuperHyperVertex outside implying there’s, sometimes in the connected 6577
Neutrosophic SuperHyperGraph ESHG : (V, E), a Neutrosophic SuperHyperVertex, titled its 6578
Neutrosophic SuperHyperNeighbor, to that Neutrosophic SuperHyperVertex in the Neutrosophic 6579
SuperHyperSet S so as S doesn’t do “the Neutrosophic procedure”.]. There’s only one Neutro- 6580
sophic SuperHyperVertex outside the intended Neutrosophic SuperHyperSet, VESHE ∪ {z}, in 6581
the terms of Neutrosophic SuperHyperNeighborhood. Thus the obvious Neutrosophic R-Equal 6582
Dimension Dominating, VESHE is up. The obvious simple Neutrosophic type-SuperHyperSet of the 6583
Neutrosophic R-Equal Dimension Dominating, VESHE , is a Neutrosophic SuperHyperSet, VESHE , 6584
includes only all Neutrosophic SuperHyperVertices does forms any kind of Neutrosophic pairs 6585
are titled Neutrosophic SuperHyperNeighbors in a connected Neutrosophic SuperHyperGraph 6586
ESHG : (V, E). Since the Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVer- 6587
tices VESHE , is the maximum Neutrosophic SuperHyperCardinality of a Neutrosophic 6588

SuperHyperSet S of Neutrosophic SuperHyperVertices such that there’s a Neutrosophic 6589
SuperHyperEdge to have some Neutrosophic SuperHyperVertices uniquely. Thus, in a connected 6590
Neutrosophic SuperHyperGraph ESHG : (V, E). Any Neutrosophic R-Equal Dimension Dominating 6591
only contains all interior Neutrosophic SuperHyperVertices and all exterior Neutrosophic 6592
SuperHyperVertices from the unique Neutrosophic SuperHyperEdge where there’s any of them 6593
has all possible Neutrosophic SuperHyperNeighbors in and there’s all Neutrosophic SuperHy- 6594
perNeighborhoods in with no exception minus all Neutrosophic SuperHypeNeighbors to some of 6595
them not all of them but everything is possible about Neutrosophic SuperHyperNeighborhoods 6596
and Neutrosophic SuperHyperNeighbors out. 6597
The SuperHyperNotion, namely, Equal Dimension Dominating, is up. There’s neither empty SuperHy- 6598
perEdge nor loop SuperHyperEdge. The following Neutrosophic SuperHyperSet of Neutrosophic 6599
SuperHyperEdges[SuperHyperVertices] is the simple Neutrosophic type-SuperHyperSet of 6600

the Neutrosophic Equal Dimension Dominating. The Neutrosophic SuperHyperSet of Neutrosophic 6601
SuperHyperEdges[SuperHyperVertices], 6602

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

Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperEdges[SuperHyperVertices], 6604

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

Graph ESHG : (V, E) is a Neutrosophic type-SuperHyperSet with 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 are not only two Neut- 6611
rosophic SuperHyperVertices inside the intended Neutrosophic SuperHyperSet. Thus the 6612
non-obvious Neutrosophic Equal Dimension Dominating is up. The obvious simple Neutrosophic type- 6613
SuperHyperSet called the Neutrosophic Equal Dimension Dominating is a Neutrosophic SuperHyperSet 6614
includes only two Neutrosophic SuperHyperVertices. But the Neutrosophic SuperHyperSet of 6615
the Neutrosophic SuperHyperEdges[SuperHyperVertices], 6616

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- 6617
Set. Thus the non-obvious simple Neutrosophic type-SuperHyperSet of the Neutrosophic Equal 6618
Dimension Dominating is up. To sum them up, the Neutrosophic SuperHyperSet of the Neutrosophic 6619
SuperHyperEdges[SuperHyperVertices], 6620

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 Equal Di- 6621
. Since the Neutrosophic SuperHyperSet of the Neutrosophic SuperHy-
mension Dominating 6622

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

that there’s no a Neutrosophic SuperHyperEdge for some Neutrosophic SuperHyperVertices 6626
given by that Neutrosophic type-SuperHyperSet called the Neutrosophic Equal Dimension Dominating 6627
and it’s an Neutrosophic Equal Dimension Dominating. Since it’s 6628
6629
rosophic SuperHyperEdges[SuperHyperVertices] such that there’s no Neutrosophic Super- 6631

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

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

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 Equal Dimension 6636
, not:
Dominating 6637

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

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- 6639
HyperGraph ESHG : (V, E). It’s interesting to mention that the only non-obvious simple 6640
Neutrosophic type-SuperHyperSet called the 6641
“Neutrosophic Equal Dimension Dominating ” 6642
amid those obvious[non-obvious] simple Neutrosophic type-SuperHyperSets called the 6643
Neutrosophic ,
Equal Dimension Dominating 6644
is only and only 6645

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


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

CHAPTER 31 6647
The Neutrosophic Departures on The 6648
Theoretical Results Toward Theoretical 6649
Motivations 6650
The previous Neutrosophic approach apply on the upcoming Neutrosophic results on 6651
Neutrosophic SuperHyperClasses. 6652
Proposition 31.0.1. Assume a connected Neutrosophic SuperHyperPath ESHP : (V, E). Then 6653

|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 6654
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V |EN SHG |
, E |EN SHG |
3 3
6655
P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
327
Figure 31.1: a Neutrosophic SuperHyperPath Associated to the Notions of Neutrosophic

...,
EXT ERN AL
3 3
be a longest path taken from a connected Neutrosophic SuperHyperPath ESHP : (V, E). 6656

136EXM18a Example 31.0.2. In the Figure (31.1), the connected Neutrosophic SuperHyperPath ESHP : 6661
(V, E), is highlighted and featured. The Neutrosophic SuperHyperSet, in the Neutrosophic 6662
SuperHyperModel (31.1), is the SuperHyperEqual Dimension Dominating. 6663
Proposition 31.0.3. Assume a connected Neutrosophic SuperHyperCycle ESHC : (V, E). Then 6664

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

136EXM19a Example 31.0.4. In the Figure (31.2), the connected Neutrosophic SuperHyperCycle N SHC : 6672
(V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, in the 6673
Neutrosophic SuperHyperModel (31.2), is the Neutrosophic SuperHyperEqual Dimension Dominating. 6674

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

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

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

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

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

136EXM20a Example 31.0.6. In the Figure (31.3), the connected Neutrosophic SuperHyperStar ESHS : 6683
(V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, by the Algorithm 6684
in previous Neutrosophic result, of the Neutrosophic SuperHyperVertices of the connected 6685
Neutrosophic SuperHyperStar ESHS : (V, E), in the Neutrosophic SuperHyperModel (31.3), is 6686
the Neutrosophic SuperHyperEqual Dimension Dominating. 6687
Proposition 31.0.7. Assume a connected Neutrosophic SuperHyperBipartite ESHB : (V, E). 6688

Then 6689

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

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

Figure 31.4: Neutrosophic SuperHyperBipartite Neutrosophic Associated to the Neutrosophic

Notions of Neutrosophic SuperHyperEqual Dimension Dominating in the Example (42.0.11) 136NSHG21a
is a longest SuperHyperEqual Dimension Dominating taken from a connected Neutrosophic SuperHyper- 6700
Bipartite ESHB : (V, E). Thus only some SuperHyperVertices and only minimum-Neutrosophic- 6701
of-SuperHyperPart SuperHyperEdges are attained in any solution 6702
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
136EXM21a Example 31.0.8. In the Neutrosophic Figure (31.4), the connected Neutrosophic SuperHy- 6704
perBipartite ESHB : (V, E), is Neutrosophic highlighted and Neutrosophic featured. The 6705
obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous Neutrosophic 6706

result, of the Neutrosophic SuperHyperVertices of the connected Neutrosophic SuperHyper- 6707
Bipartite ESHB : (V, E), in the Neutrosophic SuperHyperModel (31.4), is the Neutrosophic 6708
Proposition 31.0.9. Assume a connected Neutrosophic SuperHyperMultipartite ESHM : (V, E). 6710
Then 6711


= z b−a .
= z b−a .
Proof. Let 6712
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
j N SHG
6713
P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
...,
EXT ERN AL
j N SHG
is a longest SuperHyperEqual Dimension Dominating taken from a connected Neutrosophic SuperHy- 6714
perMultipartite ESHM : (V, E). There’s a new way to redefine as 6715

0
Dominating could be applied. There are only z SuperHyperParts. Thus every SuperHyperPart 6720
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest path taken from a connected Neutrosophic SuperHyperMultipartite ESHM : (V, E). 6722
Thus only some SuperHyperVertices and only minimum-Neutrosophic-of-SuperHyperPart 6723
P :

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

V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
136EXM22a Example 31.0.10. In the Figure (31.5), the connected Neutrosophic SuperHyperMultipartite 6727
ESHM : (V, E), is highlighted and Neutrosophic featured. The obtained Neutrosophic 6728
SuperHyperSet, by the Algorithm in previous Neutrosophic result, of the Neutrosophic 6729
SuperHyperVertices of the connected Neutrosophic SuperHyperMultipartite ESHM : (V, E), 6730
in the Neutrosophic SuperHyperModel (31.5), is the Neutrosophic SuperHyperEqual Dimension 6731
Dominating. 6732
∗
Proposition 31.0.11. Assume a connected Neutrosophic SuperHyperWheel ESHW : (V, E∪E ). 6733
Then, 6734

|E |
{E3i+2 }i=0ESHP ∪ E ∗ .
| min |E | |Ei |
{E3i+2 } ESHP ∪E ∗
=z i=0 .
|E |
EXT ERN AL
{V2i+2 }i=0ESHP ∪ V ∗ .

| min |E | |Vi |
{V EXT ERN AL } ESHP ∪V ∗
=z 2i+2 i=0 .
Proof. Let 6735
P :
CEN T ER, E2∗
6736
P :
E1∗ , V1EXT ERN AL ,
E2∗ , CEN T ER
is a longest SuperHyperEqual Dimension Dominating taken from a connected Neutrosophic SuperHy- 6737
perWheel ESHW : (V, E). There’s a new way to redefine as 6738

straightforward. Then there’s at least one SuperHyperEqual Dimension Dominating. Thus the notion 6741
of quasi isn’t up and the SuperHyperNotions based on SuperHyperEqual Dimension Dominating 6742
could be applied. The unique embedded SuperHyperEqual Dimension Dominating proposes some 6743
longest SuperHyperEqual Dimension Dominating excerpt from some representatives. The latter is 6744
136EXM23a Example 31.0.12. In the Neutrosophic Figure (31.6), the connected Neutrosophic SuperHyper- 6746
Wheel N SHW : (V, E), is Neutrosophic highlighted and featured. The obtained Neutrosophic 6747
SuperHyperSet, by the Algorithm in previous result, of the Neutrosophic SuperHyperVer- 6748
tices of the connected Neutrosophic SuperHyperWheel ESHW : (V, E), in the Neutrosophic 6749
SuperHyperModel (31.6), is the Neutrosophic SuperHyperEqual Dimension Dominating. 6750

Figure 31.6: a Neutrosophic SuperHyperWheel Neutrosophic Associated to the Neutrosophic

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

CHAPTER 32 6751
The Surveys of Mathematical Sets On 6752
The Results But As The Initial Motivation 6753
For the SuperHyperEqual Dimension Dominating, Neutrosophic SuperHyperEqual Dimension Dominating, and 6754
the Neutrosophic SuperHyperEqual Dimension Dominating, some general results are introduced. 6755
Remark 32.0.1. Let remind that the Neutrosophic SuperHyperEqual Dimension Dominating is 6756
“redefined” on the positions of the alphabets. 6757
Corollary 32.0.2. Assume Neutrosophic SuperHyperEqual Dimension Dominating. Then 6758
N eutrosophic SuperHyperEqualDimensionDominating =
{theSuperHyperEqualDimensionDominatingof theSuperHyperV ertices |
max |SuperHyperOf f ensive
SuperHyperEqualDimensionDominating
|N eutrosophiccardinalityamidthoseSuperHyperEqualDimensionDominating. }
plus one Neutrosophic SuperHypeNeighbor to one. Where σi is the unary operation on the 6759
SuperHyperVertices of the SuperHyperGraph to assign the determinacy, the indeterminacy and 6760
the neutrality, for i = 1, 2, 3, respectively. 6761
Corollary 32.0.3. Assume a Neutrosophic SuperHyperGraph on the same identical letter of the 6762
alphabet. Then the notion of Neutrosophic SuperHyperEqual Dimension Dominating and SuperHyperEqual 6763
Dimension Dominating coincide. 6764
Corollary 32.0.4. Assume a Neutrosophic SuperHyperGraph on the same identical letter of 6765
the alphabet. Then a consecutive sequence of the SuperHyperVertices is a Neutrosophic 6766
SuperHyperEqual Dimension Dominating if and only if it’s a SuperHyperEqual Dimension Dominating. 6767
Corollary 32.0.5. Assume a Neutrosophic SuperHyperGraph on the same identical letter of the 6768
alphabet. Then a consecutive sequence of the SuperHyperVertices is a strongest SuperHyperEqual 6769
Dimension Dominating if and only if it’s a longest SuperHyperEqual Dimension Dominating. 6770
Corollary 32.0.6. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph on the same 6771
identical letter of the alphabet. Then its Neutrosophic SuperHyperEqual Dimension Dominating is its 6772
339
Corollary 32.0.7. Assume a Neutrosophic SuperHyperPath(-/SuperHyperEqual Dimension Dominating, 6774

SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel) on the same 6775
identical letter of the alphabet. Then its Neutrosophic SuperHyperEqual Dimension Dominating is its 6776
Corollary 32.0.8. Assume a Neutrosophic SuperHyperGraph. Then its Neutrosophic SuperHy- 6778
perEqual Dimension Dominating isn’t well-defined if and only if its SuperHyperEqual Dimension Dominating 6779
isn’t well-defined. 6780
Corollary 32.0.9. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph. Then its 6781

Neutrosophic SuperHyperEqual Dimension Dominating isn’t well-defined if and only if its SuperHyperEqual 6782

Neutrosophic SuperHyperEqual Dimension Dominating isn’t well-defined if and only if its SuperHyperEqual 6786
Corollary 32.0.11. Assume a Neutrosophic SuperHyperGraph. Then its Neutrosophic Super- 6788
HyperEqual Dimension Dominating is well-defined if and only if its SuperHyperEqual Dimension Dominating is 6789
well-defined. 6790
Corollary 32.0.12. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph. Then its 6791
Neutrosophic SuperHyperEqual Dimension Dominating is well-defined if and only if its SuperHyperEqual 6792

Neutrosophic SuperHyperEqual Dimension Dominating is well-defined if and only if its SuperHyperEqual 6796
Proposition 32.0.14. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. Then V is 6798
(i) : the dual SuperHyperDefensive SuperHyperEqual Dimension Dominating; 6799
(ii) : the strong dual SuperHyperDefensive SuperHyperEqual Dimension Dominating; 6800
(iii) : the connected dual SuperHyperDefensive SuperHyperEqual Dimension Dominating; 6801
(iv) : the δ-dual SuperHyperDefensive SuperHyperEqual Dimension Dominating; 6802
(v) : the strong δ-dual SuperHyperDefensive SuperHyperEqual Dimension Dominating; 6803
(vi) : the connected δ-dual SuperHyperDefensive SuperHyperEqual Dimension Dominating. 6804
Proposition 32.0.15. Let N T G : (V, E, σ, µ) be a Neutrosophic SuperHyperGraph. Then ∅ is 6805
(iii) : the connected defensive SuperHyperDefensive SuperHyperEqual Dimension Dominating; 6808

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

independent SuperHyperSet is 6813
(iii) : the connected SuperHyperDefensive SuperHyperEqual Dimension Dominating; 6816
Proposition 32.0.17. Let ESHG : (V, E) be a Neutrosophic SuperHyperUniform SuperHyper- 6820

Graph which is a SuperHyperEqual Dimension Dominating/SuperHyperPath. Then V is a maximal 6821
(iv) : O(ESHG)-SuperHyperDefensive SuperHyperEqual Dimension Dominating; 6825
(v) : strong O(ESHG)-SuperHyperDefensive SuperHyperEqual Dimension Dominating; 6826
(vi) : connected O(ESHG)-SuperHyperDefensive SuperHyperEqual Dimension Dominating; 6827
Proposition 32.0.18. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is a 6829
SuperHyperUniform SuperHyperWheel. Then V is a maximal 6830
(iv) : O(ESHG)-dual SuperHyperDefensive SuperHyperEqual Dimension Dominating; 6834
(v) : strong O(ESHG)-dual SuperHyperDefensive SuperHyperEqual Dimension Dominating; 6835
(vi) : connected O(ESHG)-dual SuperHyperDefensive SuperHyperEqual Dimension Dominating; 6836
Graph which is a SuperHyperEqual Dimension Dominating/SuperHyperPath. Then the number of 6839

(i) : the SuperHyperEqual Dimension Dominating; 6840
(ii) : the SuperHyperEqual Dimension Dominating; 6841
(iii) : the connected SuperHyperEqual Dimension Dominating; 6842
(iv) : the O(ESHG)-SuperHyperEqual Dimension Dominating; 6843
(v) : the strong O(ESHG)-SuperHyperEqual Dimension Dominating; 6844
(vi) : the connected O(ESHG)-SuperHyperEqual Dimension Dominating. 6845
coincide. 6847

Graph which is a SuperHyperWheel. Then the number of 6849
(i) : the dual SuperHyperEqual Dimension Dominating; 6850
(ii) : the dual SuperHyperEqual Dimension Dominating; 6851
(iii) : the dual connected SuperHyperEqual Dimension Dominating; 6852
(iv) : the dual O(ESHG)-SuperHyperEqual Dimension Dominating; 6853
(v) : the strong dual O(ESHG)-SuperHyperEqual Dimension Dominating; 6854
(vi) : the connected dual O(ESHG)-SuperHyperEqual Dimension Dominating. 6855
coincide. 6857
Proposition 32.0.21. Let ESHG : (V, E) be a Neutrosophic SuperHyperUniform SuperHy- 6858

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


Graph which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperCom- 6870
plete SuperHyperMultipartite. Then a SuperHyperSet contains the half of multiplying r with 6871
the number of all the SuperHyperEdges plus one of all the SuperHyperVertices in the biggest 6872
SuperHyperPart is a 6873
(iv) : δ-SuperHyperDefensive SuperHyperEqual Dimension Dominating; 6877
(v) : strong δ-SuperHyperDefensive SuperHyperEqual Dimension Dominating; 6878
(vi) : connected δ-SuperHyperDefensive SuperHyperEqual Dimension Dominating. 6879
Graph which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperCom- 6881

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

Proposition 32.0.25. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. Then the 6900
number is at most O(ESHG) and the Neutrosophic number is at most On (ESHG). 6901
Proposition 32.0.26. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is 6902
SuperHyperComplete. The number is O(ESHG:(V,E)) 2 + 1 and the Neutrosophic number is 6903

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


Proposition 32.0.27. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is ∅. The 6911
number is 0 and the Neutrosophic number is 0, for an independent SuperHyperSet in the setting 6912
of dual 6913
(iv) : 0-SuperHyperDefensive SuperHyperEqual Dimension Dominating; 6917

SuperHyperComplete. Then there’s no independent SuperHyperSet. 6921

SuperHyperEqual Dimension Dominating/SuperHyperPath/SuperHyperWheel. The number is O(ESHG : 6923
(V, E)) and the Neutrosophic number is On (ESHG : (V, E)), in the setting of a dual 6924
(iv) : O(ESHG : (V, E))-SuperHyperDefensive SuperHyperEqual Dimension Dominating; 6928
(v) : strong O(ESHG : (V, E))-SuperHyperDefensive SuperHyperEqual Dimension Dominating; 6929
(vi) : connected O(ESHG : (V, E))-SuperHyperDefensive SuperHyperEqual Dimension Dominating. 6930


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


Proposition 32.0.31. Let N SHF : (V, E) be a SuperHyperFamily of the ESHGs : (V, E) 6941
Neutrosophic SuperHyperGraphs which are from one-type SuperHyperClass which the result is 6942
obtained for the individuals. Then the results also hold for the SuperHyperFamily N SHF : (V, E) 6943
of these specific SuperHyperClasses of the Neutrosophic SuperHyperGraphs. 6944
Proposition 32.0.32. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph. If S is a 6945

dual SuperHyperDefensive SuperHyperEqual Dimension Dominating, then ∀v ∈ V \ S, ∃x ∈ S such that 6946
(i) v ∈ Ns (x); 6947
(ii) vx ∈ E. 6948
Proposition 32.0.33. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph. If S is 6949

a dual SuperHyperDefensive SuperHyperEqual Dimension Dominating, then 6950
(i) S is SuperHyperEqual Dimension Dominating set; 6951
(ii) there’s S ⊆ S 0 such that |S 0 | is SuperHyperChromatic number. 6952
Proposition 32.0.34. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph. Then 6953
(i) Γ ≤ O; 6954
(ii) Γs ≤ On . 6955
Proposition 32.0.35. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph which is 6956
connected. Then 6957
(i) Γ ≤ O − 1; 6958
(ii) Γs ≤ On − Σ3i=1 σi (x). 6959
Proposition 32.0.36. Let ESHG : (V, E) be an odd SuperHyperPath. Then 6960

(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· ,vn−1 } Σ3i=1 σi (s)}; 6964
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn−1 } and S2 = {v1 , v3 , · · · , vn−1 } are only a dual 6965
Proposition 32.0.37. Let ESHG : (V, E) be an even SuperHyperPath. Then 6967
(i) the set S = {v2 , v4 , · · · .vn } is a dual SuperHyperDefensive SuperHyperEqual Dimension 6968
Dominating; 6969
(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · .vn } and {v1 , v3 , · · · .vn−1 }; 6970
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 6971
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 6972
Proposition 32.0.38. Let ESHG : (V, E) be an even SuperHyperEqual Dimension Dominating. Then 6974
(i) the SuperHyperSet S = {v2 , v4 , · · · , vn } is a dual SuperHyperDefensive SuperHyperEqual 6975
(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · , vn } and {v1 , v3 , · · · , vn−1 }; 6977
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } σ(s), Σs∈S={v1 ,v3 ,··· ,vn−1 } σ(s)}; 6978
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn } and S2 = {v1 , v3 , · · · , vn−1 } are only dual 6979
Proposition 32.0.39. Let ESHG : (V, E) be an odd SuperHyperEqual Dimension Dominating. Then 6981

(iii) Γs = min{Σs∈S={v2 ,v4 ,··· .vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 6985
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn−1 } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 6986
Proposition 32.0.40. Let ESHG : (V, E) be SuperHyperStar. Then 6988
(i) the SuperHyperSet S = {c} is a dual maximal SuperHyperEqual Dimension Dominating; 6989
(ii) Γ = 1; 6990
(iii) Γs = Σ3i=1 σi (c); 6991
(iv) the SuperHyperSets S = {c} and S ⊂ S 0 are only dual SuperHyperEqual Dimension Dominating. 6992
Proposition 32.0.41. Let ESHG : (V, E) be SuperHyperWheel. Then 6993

6+3(i−1)≤n
(i) the SuperHyperSet S = {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is a dual maximal 6994
6+3(i−1)≤n
(ii) Γ = |{v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 |; 6996
(iii) Γs = Σ{v1 ,v3 }∪{v6 ,v9 ··· ,vi+6 ,··· ,vn }6+3(i−1)≤n Σ3i=1 σi (s); 6997
i=1
6+3(i−1)≤n
(iv) the SuperHyperSet {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is only a dual maximal 6998
Proposition 32.0.42. Let ESHG : (V, E) be an odd SuperHyperComplete. Then 7000
b n c+1
2
Dominating; 7002
(ii) Γ = b n2 c + 1; 7003

b n c+1 ; 7004
S={vi }i=1
b n c+1
(iv) the SuperHyperSet S = {vi }i=1
2
is only a dual SuperHyperDefensive SuperHyperEqual 7005
Proposition 32.0.43. Let ESHG : (V, E) be an even SuperHyperComplete. Then 7007
bnc
2
Dominating; 7009
(ii) Γ = b n2 c; 7010

bnc ; 7011
S={vi }i=1
bnc
(iv) the SuperHyperSet S = {vi }i=1 2
is only a dual maximal SuperHyperDefensive SuperHy- 7012
perEqual Dimension Dominating. 7013
Proposition 32.0.44. Let N SHF : (V, E) be a m-SuperHyperFamily of Neutrosophic SuperHy- 7014

perStars with common Neutrosophic SuperHyperVertex SuperHyperSet. Then 7015
(i) the SuperHyperSet S = {c1 , c2 , · · · , cm } is a dual SuperHyperDefensive SuperHyperEqual 7016

(ii) Γ = m for N SHF : (V, E); 7018
(iii) Γs = Σm 3
i=1 Σj=1 σj (ci ) for N SHF : (V, E); 7019
(iv) the SuperHyperSets S = {c1 , c2 , · · · , cm } and S ⊂ S 0 are only dual SuperHyperEqual Dimension 7020
Proposition 32.0.45. Let N SHF : (V, E) be an m-SuperHyperFamily of odd SuperHyperCom- 7022
plete SuperHyperGraphs with common Neutrosophic SuperHyperVertex SuperHyperSet. Then 7023

b n c+1
is a dual maximal SuperHyperDefensive SuperHyperEqual 7024
(ii) Γ = b n2 c + 1 for N SHF : (V, E); 7026

b n c+1 for N SHF : (V, E); 7027
S={vi }i=1
b n c+1
are only a dual maximal SuperHyperEqual Dimension 7028
Proposition 32.0.46. Let N SHF : (V, E) be a m-SuperHyperFamily of even SuperHyperCom- 7030

plete SuperHyperGraphs with common Neutrosophic SuperHyperVertex SuperHyperSet. Then 7031
bnc
(i) the SuperHyperSet S = {vi }i=1 2
Dominating for N SHF : (V, E); 7033
(ii) Γ = b n2 c for N SHF : (V, E); 7034

bnc for N SHF : (V, E); 7035
S={vi }i=1
bnc
2
are only dual maximal SuperHyperEqual Dimension Dominating 7036
for N SHF : (V, E). 7037
(i) if s ≥ t and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 7040

SuperHyperEqual Dimension Dominating, then S is an s-SuperHyperDefensive SuperHyperEqual 7041

SuperHyperEqual Dimension Dominating, then S is a dual s-SuperHyperDefensive SuperHyperEqual 7044
(i) if s ≥ t + 2 and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 7048
SuperHyperEqual Dimension Dominating, then S is an s-SuperHyperPowerful SuperHyperEqual 7049


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

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

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

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

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

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

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

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

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


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

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


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

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

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


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

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

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


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

353
Belong to The Neutrosophic SuperHyperBipartite

136TBLaa21aa
By using the Neutrosophic Figure (34.1) and the Table (34.1), the Neutrosophic SuperHy- 7148
perBipartite is obtained. 7149
The obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous 7150
Neutrosophic result, of the Neutrosophic SuperHyperVertices of the connected Neut- 7151
rosophic SuperHyperBipartite ESHB : (V, E), in the Neutrosophic SuperHyperModel 7152
(34.1), is the Neutrosophic SuperHyperEqual Dimension Dominating. 7153

CHAPTER 35 7154
Case 2: The Increasing Neutrosophic 7155
Steps Toward Neutrosophic 7156
SuperHyperMultipartite as 7157
Neutrosophic SuperHyperModel 7158
Step 4. (Neutrosophic Solution) In the Neutrosophic Figure (35.1), the Neutrosophic Super- 7159
HyperMultipartite is Neutrosophic highlighted and Neutrosophic featured. 7160
By using the Neutrosophic Figure (35.1) and the Table (35.1), the Neutrosophic SuperHy- 7161
perMultipartite is obtained. 7162
The obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous 7163
Figure 35.1: a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic

355
Belong to The Neutrosophic SuperHyperMultipartite

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

perMultipartite ESHM : (V, E), in the Neutrosophic SuperHyperModel (35.1), is the 7165
Neutrosophic SuperHyperEqual Dimension Dominating. 7166

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

CHAPTER 38 7215
Neutrosophic SuperHyperDuality But As 7216
Super Forms 7218
Definition 38.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperDuality). 7219

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

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

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

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

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

Neutrosophic re-SuperHyperDuality, Neutrosophic v-SuperHyperDuality, and Neutro- 7232
sophic rv-SuperHyperDuality. 7233
Definition 38.0.2. ((Neutrosophic) SuperHyperDuality). 7234

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

sophic rv-SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : 7239
(V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Ex- 7240
treme cardinality of the Extreme SuperHyperEdges in the consecutive Extreme sequence 7241
of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 7242
361
(ii) a Neutrosophic SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 7244

sophic rv-SuperHyperDuality and C(N SHG) for a Neutrosophic SuperHyperGraph 7246
N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic SuperHy- 7247
perEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive 7248
Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they 7249
form the Neutrosophic SuperHyperDuality; 7250
(iii) an Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of Neut- 7251
rosophic e-SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic v- 7252

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

SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for a Neut- 7262
rosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 7263
contains the Neutrosophic coefficients defined as the Neutrosophic number of the max- 7264
imum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic 7265
SuperHyperSet S of high Neutrosophic cardinality consecutive Neutrosophic SuperHy- 7266
perEdges and Neutrosophic SuperHyperVertices such that they form the Neutrosophic 7267
SuperHyperDuality; and the Neutrosophic power is corresponded to its Neutrosophic 7268
coefficient; 7269
(v) an Extreme R-SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 7270

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

SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic v-SuperHyperDuality,7278
and Neutrosophic rv-SuperHyperDuality and C(N SHG) for a Neutrosophic SuperHyper- 7279
Graph N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic 7280
SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 7281
consecutive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such 7282
that they form the Neutrosophic SuperHyperDuality; 7283
(vii) an Extreme R-SuperHyperDuality SuperHyperPolynomial if it’s either of 7284

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

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

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

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

imum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic 7298
SuperHyperDuality; and the Neutrosophic power is corresponded to its Neutrosophic 7301
coefficient. 7302
136EXM1 Example 38.0.3. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E) in 7303
the mentioned Neutrosophic Figures in every Neutrosophic items. 7304

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7306
E1 and E3 are some empty Extreme SuperHyperEdges but E2 is a loop Neutrosophic 7307
SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of 7308
Neutrosophic SuperHyperNeighbor, there’s only one Neutrosophic SuperHyperEdge, 7309
namely, E4 . The Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means 7310
that there’s no Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. 7311
Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in every given Neutrosophic 7312
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 7316
SuperHyperEdge. Thus in the terms of Neutrosophic SuperHyperNeighbor, there’s only 7317
one Neutrosophic SuperHyperEdge, namely, E4 . The Neutrosophic SuperHyperVertex, V3 7318
is Neutrosophic isolated means that there’s no Neutrosophic SuperHyperEdge has it as 7319
a Neutrosophic endpoint. Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in 7320

every given Neutrosophic SuperHyperDuality. 7321




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

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


the Neutrosophic SuperHyperDuality. 7392
Then 7394
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 7395
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL


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

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

(V, E). Then 7415

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


Then there’s at least one SuperHyperDuality. Thus the notion of quasi isn’t up and 7421
the SuperHyperNotions based on SuperHyperDuality could be applied. There are only z 0 7422
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. 7434
Proposition 38.0.14. Assume a connected Neutrosophic SuperHyperWheel ESHW : (V, E). 7435
Then, 7436
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 7437
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 7438


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

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

CHAPTER 39 7451
Neutrosophic SuperHyperJoin But As 7452
Super Forms 7454
Definition 39.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperJoin). 7455

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

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

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

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

Neutrosophic re-SuperHyperJoin, Neutrosophic v-SuperHyperJoin, and Neutrosophic 7470
rv-SuperHyperJoin. 7471
Definition 39.0.2. ((Neutrosophic) SuperHyperJoin). 7472

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

375

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

rv-SuperHyperJoin and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7484
Neutrosophic SuperHyperJoin; 7488
(iii) an Extreme SuperHyperJoin SuperHyperPolynomial if it’s either of Neutrosophic 7489

e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic v-SuperHyperJoin, 7490
and Neutrosophic rv-SuperHyperJoin and C(N SHG) for an Extreme SuperHyperGraph 7491
Extreme SuperHyperJoin; and the Extreme power is corresponded to its Extreme 7496
coefficient; 7497
(iv) a Neutrosophic SuperHyperJoin SuperHyperPolynomial if it’s either of 7498

Neutrosophic e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic v- 7499
SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for a Neutrosophic 7500
S of high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and 7504

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

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

rv-SuperHyperJoin and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7516
Neutrosophic SuperHyperJoin; 7520

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

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

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

SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for a Neutrosophic 7532

the Neutrosophic coefficients defined as the Neutrosophic number of the maximum 7534
Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic 7535
SuperHyperJoin; and the Neutrosophic power is corresponded to its Neutrosophic 7538
coefficient. 7539
SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7543

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

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




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


SuperHyperModel (31.1), is the SuperHyperJoin. 7609

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

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

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


the Neutrosophic SuperHyperJoin. 7629
Then 7631
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 7632
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 7638
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperJoin taken from a connected Neutrosophic SuperHyperBipartite 7640

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


(V, E). Then 7651

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

is a longest SuperHyperJoin taken from a connected Neutrosophic SuperHyperMultipartite 7653


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

Then, 7671

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

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


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

CHAPTER 40 7685
Neutrosophic SuperHyperPerfect But As 7686
Super Forms 7688
Definition 40.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperPerfect). 7689

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

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

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

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

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

Neutrosophic re-SuperHyperPerfect, Neutrosophic v-SuperHyperPerfect, and Neutrosophic 7702
rv-SuperHyperPerfect. 7703
Definition 40.0.2. ((Neutrosophic) SuperHyperPerfect). 7704

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

rv-SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 7709
389
(ii) a Neutrosophic SuperHyperPerfect if it’s either of Neutrosophic e-SuperHyperPerfect, 7714

rv-SuperHyperPerfect and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : 7716
(V, E) is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges 7717
of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive 7718
Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they 7719
form the Neutrosophic SuperHyperPerfect; 7720
(iii) an Extreme SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7721

rosophic e-SuperHyperPerfect, Neutrosophic re-SuperHyperPerfect, Neutrosophic v- 7722
SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for an Ex- 7723
ality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme 7726
(iv) a Neutrosophic SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7730

SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for a Neut- 7732
imum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic 7735
SuperHyperPerfect; and the Neutrosophic power is corresponded to its Neutrosophic 7738
coefficient; 7739
(v) an Extreme R-SuperHyperPerfect if it’s either of Neutrosophic e-SuperHyperPerfect, 7740

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

SuperHyperPerfect, Neutrosophic re-SuperHyperPerfect, Neutrosophic v-SuperHyperPerfect,7748
and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for a Neutrosophic SuperHyper- 7749
Graph N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic 7750
SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 7751
consecutive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such 7752
that they form the Neutrosophic SuperHyperPerfect; 7753
(vii) an Extreme R-SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7754

SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for an Ex- 7756

ality of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme 7759
(viii) a Neutrosophic SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7763

SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for a Neut- 7765
imum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic 7768

SuperHyperPerfect; and the Neutrosophic power is corresponded to its Neutrosophic 7771
coefficient. 7772

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7776

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





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

SuperHyperModel (31.1), is the SuperHyperPerfect. 7842
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 7844
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3

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

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



the Neutrosophic SuperHyperPerfect. 7862
Then 7864
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 7865
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 7869
there’s no at least one SuperHyperPerfect. Thus the notion of quasi may be up but the 7870
SuperHyperNotions based on SuperHyperPerfect could be applied. There are only two 7871
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperPerfect taken from a connected Neutrosophic SuperHyperBipartite 7874

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

(V, E). Then 7885

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



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

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

is a longest SuperHyperPerfect taken from a connected Neutrosophic SuperHyperWheel 7908


ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is straightforward. Then there’s 7911
at least one SuperHyperPerfect. Thus the notion of quasi isn’t up and the SuperHyperNotions 7912
based on SuperHyperPerfect could be applied. The unique embedded SuperHyperPerfect 7913
proposes some longest SuperHyperPerfect excerpt from some representatives. The latter is 7914
SuperHyperModel (31.6), is the Neutrosophic SuperHyperPerfect. 7920

CHAPTER 41 7921
Neutrosophic SuperHyperTotal But As 7922
Super Forms 7924
Definition 41.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperTotal). 7925

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

Va ∈ Ei , Ej ; 7930
(ii) Neutrosophic re-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that 7931

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

Vi , Vj ∈ Ea ; 7934
(iv) Neutrosophic rv-SuperHyperTotal if ∀Vi ∈ VESHG:(V,E) , ∃!Vj ∈ V 0 , such that 7935

Vi , Vj ∈ Ea ; and |Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; 7936
(v) Neutrosophic SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 7937

Neutrosophic re-SuperHyperTotal, Neutrosophic v-SuperHyperTotal, and Neutrosophic 7938
rv-SuperHyperTotal. 7939
Definition 41.0.2. ((Neutrosophic) SuperHyperTotal). 7940

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

rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 7945
Extreme SuperHyperTotal; 7949
403
(ii) a Neutrosophic SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 7950

rv-SuperHyperTotal and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7952
Neutrosophic SuperHyperTotal; 7956
(iii) an Extreme SuperHyperTotal SuperHyperPolynomial if it’s either of Neutrosophic 7957
e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v-SuperHyperTotal, 7958

and Neutrosophic rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph 7959
Extreme SuperHyperTotal; and the Extreme power is corresponded to its Extreme 7964
coefficient; 7965
(iv) a Neutrosophic SuperHyperTotal SuperHyperPolynomial if it’s either of 7966
Neutrosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v- 7967

SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for a Neutro- 7968
sophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 7969
contains the Neutrosophic coefficients defined as the Neutrosophic number of the maximum 7970
Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHy- 7971
perSet S of high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and 7972
Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperTotal; 7973
and the Neutrosophic power is corresponded to its Neutrosophic coefficient; 7974
(v) an Extreme R-SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 7975

rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 7977
Extreme SuperHyperTotal; 7981
(vi) a Neutrosophic R-SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 7982

rv-SuperHyperTotal and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7984
Neutrosophic SuperHyperTotal; 7988
(vii) an Extreme R-SuperHyperTotal SuperHyperPolynomial if it’s either of Neut- 7989

rosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v- 7990
SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for an Extreme 7991

that they form the Extreme SuperHyperTotal; and the Extreme power is corresponded to 7996
its Extreme coefficient; 7997
(viii) a Neutrosophic SuperHyperTotal SuperHyperPolynomial if it’s either of 7998
Neutrosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v- 7999

SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for a Neutro- 8000
sophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 8001
contains the Neutrosophic coefficients defined as the Neutrosophic number of the maximum 8002
Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic Supe- 8003
rHyperSet S of high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges 8004
and Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyper- 8005
Total; and the Neutrosophic power is corresponded to its Neutrosophic coefficient. 8006

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 8010

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




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

SuperHyperModel (31.1), is the SuperHyperTotal. 8076
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 8078
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. 8085
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 8087


the Neutrosophic SuperHyperTotal. 8096
Then 8098
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 8099
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

based on SuperHyperTotal could be applied. There are only two SuperHyperParts. Thus every 8105
P :

V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperTotal taken from a connected Neutrosophic SuperHyperBipartite 8107

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
(V, E). Then 8118

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

is a longest SuperHyperTotal taken from a connected Neutrosophic SuperHyperMultipartite 8120


based on SuperHyperTotal could be applied. There are only z 0 SuperHyperParts. Thus every 8125
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. 8136
Then, 8138
∗
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 8139
P : ViEXT ERN AL , Ei∗ , CEN T ER, Ej .
is a longest SuperHyperTotal taken from a connected Neutrosophic SuperHyperWheel ESHW : 8140


at least one SuperHyperTotal. Thus the notion of quasi isn’t up and the SuperHyperNotions 8144
based on SuperHyperTotal could be applied. The unique embedded SuperHyperTotal 8145
proposes some longest SuperHyperTotal excerpt from some representatives. The latter is 8146
SuperHyperModel (31.6), is the Neutrosophic SuperHyperTotal. 8152

CHAPTER 42 8153
Neutrosophic SuperHyperConnected But 8154
As The Extensions Excerpt From Dense 8155
And Super Forms 8156
Definition 42.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperConnected). 8157

(i) Neutrosophic e-SuperHyperConnected if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such 8161
that Va ∈ Ei , Ej ; and ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; 8162
(ii) Neutrosophic re-SuperHyperConnected if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ 8163

E 0 , such that Va ∈ Ei , Ej ; ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; and 8164
|Ei |NEUTROSOPHIC CARDINALITY = |Ej |NEUTROSOPHIC CARDINALITY ; 8165
(iii) Neutrosophic v-SuperHyperConnected if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such 8166

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

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

8171
Neutrosophic re-SuperHyperConnected, Neutrosophic v-SuperHyperConnected, and Neut- 8172
rosophic rv-SuperHyperConnected. 8173
Definition 42.0.2. ((Neutrosophic) SuperHyperConnected). 8174

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

8177
Neutrosophic re-SuperHyperConnected, Neutrosophic v-SuperHyperConnected, and Neut- 8178
rosophic rv-SuperHyperConnected and C(N SHG) for an Extreme SuperHyperGraph 8179
N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of 8180
417
high Extreme cardinality of the Extreme SuperHyperEdges in the consecutive Extreme 8181
sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 8182
form the Extreme SuperHyperConnected; 8183
(ii) a Neutrosophic SuperHyperConnected if it’s either of Neutrosophic e- 8184

SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neutrosophic v- 8185
SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) 8186
for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic car- 8187
dinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of high 8188
Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and Neutrosophic 8189

SuperHyperVertices such that they form the Neutrosophic SuperHyperConnected; 8190
(iii) an Extreme SuperHyperConnected SuperHyperPolynomial if it’s either of Neut- 8191
rosophic e-SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neutrosophic 8192

v-SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) for 8193
an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial 8194
contains the Extreme coefficients defined as the Extreme number of the maximum Extreme 8195
(iv) a Neutrosophic SuperHyperConnected SuperHyperPolynomial if it’s either of 8200

Neutrosophic e-SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neut- 8201
rosophic v-SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and 8202
C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic 8203
SuperHyperPolynomial contains the Neutrosophic coefficients defined as the Neutrosophic 8204
number of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges 8205
of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive Neutro- 8206

sophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the 8207
Neutrosophic SuperHyperConnected; and the Neutrosophic power is corresponded to its 8208
Neutrosophic coefficient; 8209
(v) an Extreme R-SuperHyperConnected if it’s either of Neutrosophic e- 8210

SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) 8212
for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme cardinality 8213
of an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme SuperHyper- 8214
Vertices in the consecutive Extreme sequence of Extreme SuperHyperEdges and Extreme 8215
SuperHyperVertices such that they form the Extreme SuperHyperConnected; 8216
(vi) a Neutrosophic R-SuperHyperConnected if it’s either of Neutrosophic e- 8217

SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) for a 8219
Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic cardinality 8220
of the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S of high 8221
Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and Neutrosophic 8222
SuperHyperVertices such that they form the Neutrosophic SuperHyperConnected; 8223

(vii) an Extreme R-SuperHyperConnected SuperHyperPolynomial if it’s either of 8224

C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme Super- 8227
HyperPolynomial contains the Extreme coefficients defined as the Extreme number of 8228

and the Extreme power is corresponded to its Extreme coefficient; 8232
(viii) a Neutrosophic SuperHyperConnected SuperHyperPolynomial if it’s either of 8233

C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic 8236
SuperHyperPolynomial contains the Neutrosophic coefficients defined as the Neutrosophic 8237
number of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices 8238
of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive Neutro- 8239

sophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the 8240
Neutrosophic SuperHyperConnected; and the Neutrosophic power is corresponded to its 8241
Neutrosophic coefficient. 8242
• On the Figure (30.1), the Neutrosophic SuperHyperNotion, namely, Neutrosophic Super- 8245
HyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 8246
SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of Neutro- 8248
sophic SuperHyperNeighbor, there’s only one Neutrosophic SuperHyperEdge, namely, E4 . 8249

The Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means that there’s no 8250
Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. Thus the Neutrosophic 8251
SuperHyperVertex, V3 , is excluded in every given Neutrosophic SuperHyperConnected. 8252
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. 8260


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 8304
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. 8311
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 8313
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. 8320
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 8322



the Neutrosophic SuperHyperConnected. 8331
Then 8333
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 8334
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 8339
SuperHyperNotions based on SuperHyperConnected could be applied. There are only two 8340
P :

V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperConnected taken from a connected Neutrosophic SuperHyperBipartite 8343

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
(V, E). Then 8354
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 8355
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

is a longest SuperHyperConnected taken from a connected Neutrosophic SuperHyperMultipartite 8356


there’s no at least one SuperHyperConnected. Thus the notion of quasi may be up but 8360
the SuperHyperNotions based on SuperHyperConnected could be applied. There are only 8361
z 0 SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as the 8362
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. 8373
Then, 8375
∗
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 8376
P : V EXT ERN AL i , E ∗ i , CEN T ER, Ej .

is a longest SuperHyperConnected taken from a connected Neutrosophic SuperHyperWheel 8377


to ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is straightforward. 8380
Then there’s at least one SuperHyperConnected. Thus the notion of quasi isn’t up and 8381
the SuperHyperNotions based on SuperHyperConnected could be applied. The unique 8382
embedded SuperHyperConnected proposes some longest SuperHyperConnected excerpt from 8383
some representatives. The latter is straightforward. 8384
SuperHyperModel (31.6), is the Neutrosophic SuperHyperConnected. 8389

CHAPTER 43 8390
Background 8391
431



[HG11] by Henry Garrett (2022), “Extremism of the Attacked Body Under the Cancer’s Cir- 8461
cumstances Where Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs” in Ref. 8462
“Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic SuperHyperStable To Act 8465
on Cancer’s Neutrosophic Recognitions In Special ViewPoints” in Ref. [HG14] by Henry 8466

[HG15] by Henry Garrett (2022), “(Neutrosophic) SuperHyperStable on Cancer’s Recogni- 8469
tion by Well- SuperHyperModelled (Neutrosophic) SuperHyperGraphs ” in Ref. [HG16] by 8470


SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints” in 8472
Ref. [HG12] by Henry Garrett (2022), “Basic Notions on (Neutrosophic) SuperHyperFor- 8473
cing And (Neutrosophic) SuperHyperModeling in Cancer’s Recognitions And (Neutrosophic) 8474
SuperHyperGraphs” in Ref. [HG17] by Henry Garrett (2022), “Neutrosophic Messy-Style 8475
SuperHyperGraphs To Form Neutrosophic SuperHyperStable To Act on Cancer’s Neutrosophic 8476
Recognitions In Special ViewPoints” in Ref. [HG18] by Henry Garrett (2022),“(Neutrosophic) 8477

SuperHyperModeling of Cancer’s Recognitions Featuring (Neutrosophic) SuperHyperDefensive 8478
SuperHyperAlliances” in Ref. [HG19] by Henry Garrett (2022), “(Neutrosophic) SuperHy- 8479
perAlliances With SuperHyperDefensive and SuperHyperOffensive Type-SuperHyperSet On 8480
(Neutrosophic) SuperHyperGraph With (Neutrosophic) SuperHyperModeling of Cancer’s Re- 8481
cognitions And Related (Neutrosophic) SuperHyperClasses” in Ref. [HG20] by Henry Garrett 8482
(2022), “SuperHyperGirth on SuperHyperGraph and Neutrosophic SuperHyperGraph With Supe- 8483

rHyperModeling of Cancer’s Recognitions” in Ref. [HG21] by Henry Garrett (2022), “Some 8484
SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic SuperHyperGraphs and Su- 8485
perHyperGraphs Alongside Applications in Cancer’s Treatments” in Ref. [HG22] by Henry 8486
Garrett (2022), “SuperHyperDominating and SuperHyperResolving on Neutrosophic SuperHy- 8487
perGraphs And Their Directions in Game Theory and Neutrosophic SuperHyperClasses” in Ref. 8488
[HG23] by Henry Garrett (2022), “SuperHyperMatching By (R-)Definitions And Polynomials 8489

To Monitor Cancer’s Recognition In Neutrosophic SuperHyperGraphs” in Ref. [HG24] by Henry 8490
Garrett (2023), “The Focus on The Partitions Obtained By Parallel Moves In The Cancer’s 8491
Extreme Recognition With Different Types of Extreme SuperHyperMatching Set and Polynomial 8492
on (Neutrosophic) SuperHyperGraphs” in Ref. [HG25] by Henry Garrett (2023), “Extreme 8493
Failed SuperHyperClique Decides the Failures on the Cancer’s Recognition in the Perfect Con- 8494
nections of Cancer’s Attacks By SuperHyperModels Named (Neutrosophic) SuperHyperGraphs” 8495

in Ref. [HG26] by Henry Garrett (2023), “Indeterminacy On The All Possible Connections 8496
of Cells In Front of Cancer’s Attacks In The Terms of Neutrosophic Failed SuperHyperClique 8497
on Cancer’s Recognition called Neutrosophic SuperHyperGraphs” in Ref. [HG27] by Henry 8498
Garrett (2023), “Perfect Directions Toward Idealism in Cancer’s Neutrosophic Recognition For- 8499
warding Neutrosophic SuperHyperClique on Neutrosophic SuperHyperGraphs” in Ref. [HG28] 8500
by Henry Garrett (2023), “Demonstrating Complete Connections in Every Embedded Regions 8501
and Sub-Regions in the Terms of Cancer’s Recognition and (Neutrosophic) SuperHyperGraphs 8502
With (Neutrosophic) SuperHyperClique” in Ref. [HG29] by Henry Garrett (2023), “Different 8503
Neutrosophic Types of Neutrosophic Regions titled neutrosophic Failed SuperHyperStable in 8504
Cancer’s Neutrosophic Recognition modeled in the Form of Neutrosophic SuperHyperGraphs” 8505
in Ref. [HG30] by Henry Garrett (2023), “Using the Tool As (Neutrosophic) Failed SuperHy- 8506
perStable To SuperHyperModel Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs” 8507
ViewPoints” in Ref. [HG32] by Henry Garrett (2023), “(Neutrosophic) SuperHyperStable 8510
on Cancer’s Recognition by Well-SuperHyperModelled (Neutrosophic) SuperHyperGraphs” in 8511
Ref. [HG33] by Henry Garrett (2023), “Neutrosophic 1-Failed SuperHyperForcing in the 8512
SuperHyperFunction To Use Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic Re- 8513
cognition And Beyond” in Ref. [HG34] by Henry Garrett (2022), “(Neutrosophic) 1-Failed 8514
SuperHyperForcing in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs” in Ref. 8515
[HG35] by Henry Garrett (2022), “Basic Notions on (Neutrosophic) SuperHyperForcing And 8516

(Neutrosophic) SuperHyperModeling in Cancer’s Recognitions And (Neutrosophic) SuperHyper- 8517

Graphs” in Ref. [HG36] by Henry Garrett (2022), “Basic Neutrosophic Notions Concerning 8518
SuperHyperDominating and Neutrosophic SuperHyperResolving in SuperHyperGraph” in Ref. 8519
[HG37] by Henry Garrett (2022), “Initial Material of Neutrosophic Preliminaries to Study 8520
Some Neutrosophic Notions Based on Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic 8521
SuperHyperGraph (NSHG)” in Ref. [HG38] by Henry Garrett (2022), and [HG44s; HG55s; 8522
HG277; HG278; HG279; HG280; HG281], there are some endeavors to formalize the basic 8543
SuperHyperNotions about neutrosophic SuperHyperGraph and SuperHyperGraph alongside 8544
scientific research books at [HG60b; HG61b; HG62b; HG63b; HG64b; HG65b; HG66b; 8545



See the seminal scientific researches [HG11s; HG22s; HG33s]. The formalization of the notions 8574
on the framework of notions in SuperHyperGraphs, Neutrosophic notions in SuperHyperGraphs 8575

theory, and (Neutrosophic) SuperHyperGraphs theory at [HG44s; HG55s; HG4; HG5; HG6; 8576
HG279; HG280; HG281] alongside scientific research books at [HG60b; HG61b; HG62b; 8597



HG174b; HG175b; HG176b; HG177b; HG178b; HG179b; HG180b]. Two popular 8611
scientific research books in Scribd in the terms of high readers, 4728 and 5721 respectively, on 8612
neutrosophic science is on [HG32b; HG44b]. 8613

Bibliography 8614
10.33140/JMTCM.01.03.09) 8637
437



10.20944/preprints202301.0282.v1). 8653

10.20944/preprints202301.0267.v1). 8656

(doi: 10.20944/preprints202301.0265.v1). 8661
prints202301.0262.v1). 8665
2023010224, (doi: 10.20944/preprints202301.0224.v1). 8671

prints202301.0105.v1). 8674

Preprints 2023, 2023010044 8680
10.20944/preprints202301.0043.v1). 8683

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

(doi: 10.20944/preprints202212.0500.v1). 8699
10.5281/zenodo.8061927). 8708

10.5281/zenodo.8062016). 8711
10.5281/zenodo.8057696). 8714
2023, (doi: 10.5281/zenodo.8057753). 8717
10.5281/zenodo.8052893). 8720

2023, (doi: 10.5281/zenodo.8052925). 8723
10.5281/zenodo.8051346). 8726
10.5281/zenodo.8051360). 8729
10.5281/zenodo.8025707). 8732
10.5281/zenodo.8027275). 8735
odo.8017246). 8738
10.5281/zenodo.8020128). 8741
odo.7978571). 8744
10.5281/zenodo.7978857). 8747
10.5281/zenodo.7940830). 8750
10.5281/zenodo.7943578). 8753
odo.7916595). 8756
odo.7923632). 8759

(doi: 10.5281/zenodo.7904698). 8762
2023, (doi: 10.5281/zenodo.7904671). 8765
10.5281/zenodo.7871026). 8774
2023, (doi: 10.5281/zenodo.7874647). 8777
10.5281/zenodo.7857856). 8780
2023, (doi: 10.5281/zenodo.7857841). 8783
10.5281/zenodo.7853867). 8792
10.5281/zenodo.7853922). 8795
(doi: 10.5281/zenodo.7851519). 8798

(doi: 10.5281/zenodo.7851550). 8801
10.5281/zenodo.7834229). 8810
10.5281/zenodo.7834261). 8813
10.5281/zenodo.7824560). 8816
(doi: 10.5281/zenodo.7824623). 8819
2023, (doi: 10.5281/zenodo.7809365). 8830
2023, (doi: 10.5281/zenodo.7809358). 8833
10.5281/zenodo.7809219). 8836

10.5281/zenodo.7809328). 8839
2023, (doi: 10.5281/zenodo.7806767). 8842
2023, (doi: 10.5281/zenodo.7806838). 8845
10.5281/zenodo.7799902). 8854
(doi: 10.5281/zenodo.7804218). 8857
(doi: 10.5281/zenodo.7796334). 8860
10.5281/zenodo.7791952). 8866
10.5281/zenodo.7791982). 8869
10.5281/zenodo.7790026). 8872
10.5281/zenodo.7790052). 8875

2023, (doi: 10.5281/zenodo.7787066). 8878
10.5281/zenodo.7781476). 8884
10.5281/zenodo.7783082). 8887
10.5281/zenodo.7777857). 8890
10.5281/zenodo.7779286). 8893
(doi: 10.5281/zenodo.7771831). 8896
2023, (doi: 10.5281/zenodo.7772468). 8899
10.13140/RG.2.2.20913.25446). 8902
odo.7764916). 8905
10.13140/RG.2.2.11770.98247). 8908
10.13140/RG.2.2.12400.12808). 8911
2023, (doi: 10.13140/RG.2.2.22545.10089). 8914

10.13140/RG.2.2.11377.76644). 8920
10.13140/RG.2.2.23750.96329). 8923
10.13140/RG.2.2.31366.24641). 8926
10.13140/RG.2.2.34721.68960). 8929
2023, (doi: 10.13140/RG.2.2.30212.81289). 8932
10.13140/RG.2.2.24288.35842). 8938
10.13140/RG.2.2.32467.25124). 8941
10.13140/RG.2.2.31025.45925). 8944
10.13140/RG.2.2.17184.25602). 8947
10.13140/RG.2.2.23423.28327). 8950
10.13140/RG.2.2.28456.44805). 8953

10.13140/RG.2.2.23525.68320). 8956
10.13140/RG.2.2.20170.24000). 8959
10.13140/RG.2.2.36475.59683). 8962
10.13140/RG.2.2.29764.71046). 8965
2023, (doi: 10.13140/RG.2.2.18780.87683). 8968
10.13140/RG.2.2.26134.01603). 8974
10.13140/RG.2.2.27392.30721). 8977
10.13140/RG.2.2.33028.40321). 8980
10.13140/RG.2.2.21389.20966). 8983
10.13140/RG.2.2.16356.04489). 8986
10.13140/RG.2.2.21756.21129). 8989
10.13140/RG.2.2.30983.68009). 8992

10.13140/RG.2.2.28552.29445). 8995
(doi: 10.13140/RG.2.2.10936.21761). 8998
10.13140/RG.2.2.35105.89447). 9001
(doi: 10.13140/RG.2.2.30072.72960). 9004
10.13140/RG.2.2.31147.52003). 9007
10.13140/RG.2.2.32825.24163). 9010
10.13140/RG.2.2.13059.58401). 9013
10.13140/RG.2.2.11172.14720). 9016
2023, (doi: 10.13140/RG.2.2.22011.80165). 9019
ate 2023, (doi: 10.13140/RG.2.2.30819.84003). 9022
2023, (doi: 10.13140/RG.2.2.10493.84962). 9025
ate 2023, (doi: 10.13140/RG.2.2.13849.29280). 9028
2023, (doi: 10.13140/RG.2.2.19944.14086). 9031

ate 2023, (doi: 10.13140/RG.2.2.23299.58404). 9034
(doi: 10.13140/RG.2.2.33103.76968). 9037
(doi: 10.13140/RG.2.2.23037.44003). 9040
(doi: 10.13140/RG.2.2.35646.56641). 9043
10.13140/RG.2.2.18030.48967). 9046
(doi: 10.13140/RG.2.2.13973.81121). 9049
2023, (doi: 10.13140/RG.2.2.34106.47047). 9052
2023, (doi: 10.13140/RG.2.2.31956.88961). 9058
2023, (doi: 10.13140/RG.2.2.15179.67361). 9061
10.13140/RG.2.2.21510.45125). 9064
2023, (doi: 10.13140/RG.2.2.13121.84321). 9067
10.13140/RG.2.2.11758.69441). 9070

2023, (doi: 10.13140/RG.2.2.31891.35367). 9073
10.13140/RG.2.2.19360.87048). 9076
10.13140/RG.2.2.32363.21286). 9079
10.13140/RG.2.2.23266.81602). 9082
10.13140/RG.2.2.19911.37285). 9085
10.13140/RG.2.2.11050.90569). 9088
2023, (doi: 10.13140/RG.2.2.17761.79206). 9091
ate 2023, (doi: 10.13140/RG.2.2.33275.80161). 9097
(doi: 10.13140/RG.2.2.30182.50241). 9100


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

2023010396 (doi: 10.20944/preprints202301.0396.v1). 9142
2023, 2023010395 (doi: 10.20944/preprints202301.0395.v1). 9145


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


10.20944/preprints202301.0282.v1). 9166

10.20944/preprints202301.0267.v1).). 9169

(doi: 10.20944/preprints202301.0265.v1). 9174
prints202301.0262.v1). 9178


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

10.13140/RG.2.2.35061.65767). 9187

10.13140/RG.2.2.18494.15680). 9191
10.13140/RG.2.2.32530.73922). 9195
10.13140/RG.2.2.15897.70243). 9199

10.13140/RG.2.2.32530.73922). 9203
prints202301.0105.v1). 9206
10.13140/RG.2.2.23172.19849). 9213

10.13140/RG.2.2.17385.36968). 9223
Preprints 2023, 2023010044 9226

10.20944/preprints202301.0043.v1). 9229

2023, (doi: 10.13140/RG.2.2.28945.92007). 9232
10.13140/RG.2.2.35774.77123). 9238

10.13140/RG.2.2.29430.88642). 9244
(doi: 10.20944/preprints202212.0549.v1). 9250
10.13140/RG.2.2.19380.94084). 9253


(doi: 10.20944/preprints202212.0500.v1). 9264

10.13140/RG.2.2.20993.12640). 9267

10.13140/RG.2.2.29173.86244). 9282
(doi: 10.5281/zenodo.8062076). 9287
2023 (doi: 10.5281/zenodo.8052976). 9291
(doi: 10.5281/zenodo.8051368). 9293
(doi: 10.5281/zenodo.8027488). 9295
10.5281/zenodo.8020181). 9297
10.5281/zenodo.7978921). 9299
odo.7943878). 9301

10.5281/zenodo.7943871). 9303
10.5281/zenodo.7923786). 9305
2023 (doi: 10.5281/zenodo.7905287). 9307

2023 (doi: 10.5281/zenodo.7874677). 9311
(doi: 10.5281/zenodo.7857906). 9313
2023 (doi: 10.5281/zenodo.7856329). 9315
10.5281/zenodo.7854561). 9317
2023 (doi: 10.5281/zenodo.7851893). 9319

(doi: 10.5281/zenodo.7835063). 9323
(doi: 10.5281/zenodo.7826705). 9325
2023 (doi: 10.5281/zenodo.7820680). 9327
10.5281/zenodo.7812750). 9329

2023 (doi: 10.5281/zenodo.7807782). 9335
2023 (doi: 10.5281/zenodo.7804449). 9337


(doi: 10.5281/zenodo.7792307). 9341
(doi: 10.5281/zenodo.7790728). 9343
2023 (doi: 10.5281/zenodo.7787712). 9345
10.5281/zenodo.7783791). 9347
10.5281/zenodo.7780123). 9349
(doi: 10.5281/zenodo.7773119). 9351
odo.7637762). 9353
10.5281/zenodo.7766174). 9355
10.5281/zenodo.7762232). 9357
(doi: 10.5281/zenodo.7758601). 9359
10.5281/zenodo.7754661). 9361
10.5281/zenodo.7750995) . 9363
(doi: 10.5281/zenodo.7749875). 9365
10.5281/zenodo.7747236). 9367
10.5281/zenodo.7742587). 9369
(doi: 10.5281/zenodo.7738635). 9371
10.5281/zenodo.7734719). 9373

10.5281/zenodo.7730484). 9375
(doi: 10.5281/zenodo.7730469). 9377
10.5281/zenodo.7722865). 9379
odo.7713563). 9381
odo.7709116). 9383
10.5281/zenodo.7706415). 9385
10.5281/zenodo.7706063). 9387
10.5281/zenodo.7701906). 9389
odo.7700205). 9391
10.5281/zenodo.7694876). 9393
10.5281/zenodo.7679410). 9395
10.5281/zenodo.7675982). 9397
10.5281/zenodo.7672388). 9399
odo.7668648). 9401
10.5281/zenodo.7662810). 9403
10.5281/zenodo.7659162). 9405
odo.7653233). 9407
odo.7653204). 9409

odo.7653142). 9411
odo.7653117). 9413
odo.7651687). 9416
odo.7651619). 9418
odo.7651439). 9420
odo.7650729). 9422
odo.7647868). 9424
odo.7647017). 9426
odo.7644894). 9428
odo.7632923). 9431
odo.7623459). 9433
10.5281/zenodo.7606416). 9435
10.5281/zenodo.7606416). 9437
odo.7606404). 9439
10.5281/zenodo.7580018). 9441
odo.7580018). 9443

odo.7580018). 9445
odo.7579929). 9447
10.5281/zenodo.7563170). 9449
odo.7563164). 9451
odo.7563160). 9453
odo.7563160). 9455
10.5281/zenodo.7563160). 9457
10.5281/zenodo.7557063). 9459
10.5281/zenodo.7557009). 9461
10.5281/zenodo.7539484). 9463
10.5281/zenodo.7523390). 9465
10.5281/zenodo.7523390). 9467
10.5281/zenodo.7523390). 9469
odo.7574952). 9471
10.5281/zenodo.7574992). 9473
odo.7523357). 9475
10.5281/zenodo.7523357). 9477
10.5281/zenodo.7504782). 9479

10.5281/zenodo.7504782). 9481
10.5281/zenodo.7504782). 9483
10.5281/zenodo.7499395). 9485
odo.7499395). 9487
10.5281/zenodo.7499395). 9489
10.5281/zenodo.7497450). 9491
10.5281/zenodo.7497450). 9493
10.5281/zenodo.7494862). 9495
odo.7494862). 9497
10.5281/zenodo.7494862). 9499
10.5281/zenodo.7493845). 9501
odo.7493845). 9503
10.5281/zenodo.7493845). 9505
odo.7539484). 9507
odo.7523390). 9509
odo.7523357). 9511
odo.7504782). 9513
odo.7499395). 9515

odo.7497450). 9517
odo.7494862). 9519
odo.7493845). 9521
odo.7480110). 9523
odo.7378758). 9525
odo.6320305). 9527
odo.6677173). 9529

CHAPTER 44 9530
Books’ Contributions 9531
“Books’ Contributions”: | Featured Threads 9532

The following references are cited by chapters. 9533
9534
[Ref282] 9535
Henry Garrett, “New Ideas On Super Dimity By Hyper Dimple Of Equal Dimension Domin- 9536
ating In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 9537
10.5281/zenodo.8067409). 9538
9539
[Ref283] 9540
Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph 9541
10.5281/zenodo.8067384). 9543
9544
The links to the contributions of this scientific research book are listed below. 9545
[HG282] 9546
10.5281/zenodo.8067409). 9549
9550
[TITLE] “New Ideas On Super Dimity By Hyper Dimple Of Equal Dimension Dominat- 9551
ing In Recognition of Cancer With (Neutrosophic) SuperHyperGraph” 9552

9553
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ResearchGate”] 9554
https://www.researchgate.net/publication/371755885 9555
9556
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “Scribd”:] 9557
https://www.scribd.com/document/654572967 9558
9559
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ZENODO_ORG”:] 9560
https://zenodo.org/record/8067409 9561
9562
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “academia”:] 9563
https://www.academia.edu/103685836 9564
463
Figure 44.1: [HG282] Henry Garrett, “New Ideas On Super Dimity By Hyper Dimple Of Equal
Dimension Dominating In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”,
Zenodo 2023, (doi: 10.5281/zenodo.8067409).
9565
[ADDRESSED CITATION] 9566
10.5281/zenodo.8067409). 9569
[ASSIGNED NUMBER] #282 Article 9570
[DATE] June 2023 9571

[DOI] 10.5281/zenodo.8067409 9572
[LICENSE] CC BY-NC-ND 4.0 9573
[PROJECT] Neutrosophic SuperHyperGraphs and SuperHyperGraphs 9574
[AVAILABLE AT TWITTER’S IDS] WordPress ResearchGate Scribd academia ZEN- 9575
ODO_ORG Twitter facebook LinkedIn Amazon googlebooks GooglePlay 9576
9577
[HG283] 9578
10.5281/zenodo.8067384). 9581
9582
[TITLE] “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph By 9583

Equal Dimension Dominating As Hyper Dimple On Super Dimity” 9584
9585
https://www.researchgate.net/publication/371756020 9587
9588
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “Scribd”:] 9589


Figure 44.4: [HG283] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic
SuperHyperGraph By Equal Dimension Dominating As Hyper Dimple On Super Dimity”,
https://www.scribd.com/document/654568722 9590
9591
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ZENODO_ORG”:] 9592
9594
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “academia”:] 9595
https://www.academia.edu/103685293 9596
9597
10.5281/zenodo.8067384). 9601
[ASSIGNED NUMBER] #283 Article 9602
[DATE] June 2023 9603
[DOI] 10.5281/zenodo.8067384 9604
[LICENSE] CC BY-NC-ND 4.0 9605

[PROJECT] Neutrosophic SuperHyperGraphs and SuperHyperGraphs 9606
[AVAILABLE AT TWITTER’S IDS] 9607
WordPress ResearchGate Scribd academia ZENODO_ORG Twitter facebook LinkedIn Amazon 9608
googlebooks GooglePlay 9609
9610
[ASSIGNED NUMBER] | Book #181 9611

HG181b
Henry Garrett, “Equal Dimension Dominating In SuperHyperGraphs”. Dr. Henry Garrett, 9613
2023 (doi: 10.5281/zenodo.8067469). 9614


[TITLE] Equal Dimension Dominating In SuperHyperGraphs 9615

#Latest_Updates 9616
#The_Links 9617
9621
9623
#The_Links 9624
9625
[ASSIGNED NUMBER] | Book #181 9626

9627
[TITLE] Equal Dimension Dominating In SuperHyperGraphs 9628
9629
9633
– 9634
9635
[PUBLISHER] 9636
(Paperback): https://www.amazon.com/dp/- 9637
(Hardcover): https://www.amazon.com/dp/- 9638

(Kindle Edition): https://www.amazon.com/dp/- 9639
9640
– 9641
9642
[ISBN] 9643
(Paperback): - 9644
(Hardcover): - 9645
(Kindle Edition): CC BY-NC-ND 4.0 9646
(EBook): CC BY-NC-ND 4.0 9647
9648
– 9649
9650
[PRINT LENGTH] 9651
(Paperback): - pages 9652
(Hardcover): - pages 9653
(Kindle Edition): - pages 9654
(E-Book): - pages 9655
9656
– 9657
9658
9660

#The_Links 9661
9662
https://www.researchgate.net/publication/- 9664
9665
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “WordPress”] 9666
https://drhenrygarrett.wordpress.com/2023/07/22/ 9667
Equal-Dimension-Dominating-In-SuperHyperGraphs/ 9668
9669
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “Scribd”] 9670
https://www.scribd.com/document/- 9671
9672
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “academia”] 9673
https://www.academia.edu/- 9674
9675
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ZENODO_ORG”] 9676
9678
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “googlebooks”] 9679
https://books.google.com/books/about?id=- 9680
9681
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “GooglePlay”] 9682
https://play.google.com/store/books/details?id=- 9683

[TITLE] Equal Dimension Dominating In SuperHyperGraphs (Published Version) 9684

9685
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “WordPress”] 9686
9687
https://drhenrygarrett.wordpress.com/2023/07/22/ 9688
Equal-Dimension-Dominating-In-SuperHyperGraphs/ 9689
9690
– 9691
9692
[POSTED BY] Dr. Henry Garrett 9693
9694
[DATE] June 021, 2023 9695

9696
[POSTED IN] 181 | Equal Dimension Dominating In SuperHyperGraphs 9697
9698
[TAGS] 9699
Applications, Applied Mathematics, Applied Research, Cancer, Cancer’s Recognitions, Combin- 9700
atorics, Edge, Edges, Graph Theory, Graphs, Latest Research, Literature Reviews, Modeling, 9701
Neutrosophic Graph, Neutrosophic Graph Theory, Neutrosophic Science, Neutrosophic Su- 9702
perHyperClasses, Neutrosophic SuperHyperGraph, Neutrosophic SuperHyperGraph Theory, 9703
neutrosophic SuperHyperGraphs, Neutrosophic Equal Dimension Dominating In SuperHyper- 9704
Graphs, Open Problems, Open Questions, Problems, Pure Math, Pure Mathematics, Questions, 9705
Real-World Applications, Recent Research, Recognitions, Research, scientific research Article, 9706
scientific research Articles, scientific research Book, scientific research Chapter, scientific 9707
research Chapters, Review, SuperHyperClasses, SuperHyperEdges, SuperHyperGraph, Super- 9708

HyperGraph Theory, SuperHyperGraphs, Equal Dimension Dominating In SuperHyperGraphs, 9709
SuperHyperModeling, SuperHyperVertices, Theoretical Research, Vertex, Vertices. 9710
In this scientific research book, there are some scientific research chapters on “Extreme Equal 9711
Dimension Dominating In SuperHyperGraphs” and “Neutrosophic Equal Dimension Dominating 9712
In SuperHyperGraphs” about some scientific research on Equal Dimension Dominating In 9713
SuperHyperGraphs by two (Extreme/Neutrosophic) notions, namely, Extreme Equal Dimension 9714

Dominating In SuperHyperGraphs and Neutrosophic Equal Dimension Dominating In SuperHy- 9715
perGraphs. With scientific research on the basic scientific research properties, the scientific 9716
research book starts to make Extreme Equal Dimension Dominating In SuperHyperGraphs 9717
theory and Neutrosophic Equal Dimension Dominating In SuperHyperGraphs theory more 9718
(Extremely/Neutrosophicly) understandable. 9719

HG181b1.png
Figure 44.7: [HG181b] Henry Garrett, “Equal Dimension Dominating In SuperHyperGraphs”.

Dr. Henry Garrett, 2023 (doi: 10.5281/zenodo.8067469).

HG181b2.png


HG181b3.png


CHAPTER 45 9720
“SuperHyperGraph-Based Books”: | 9721
Featured Tweets 9722
“SuperHyperGraph-Based Books”: | Featured Tweets 9723
475
Figure 45.1: “SuperHyperGraph-Based Books”: | Featured Tweets

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

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
























CHAPTER 46 9724
CV 9725
503
9726
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
9727
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)
9728
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

9729

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

9730
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

9731
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

9732
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

9733
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

9734
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).
9735
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

9736
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

9737
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

9738
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

9739
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

9740
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

9741
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

9742
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

9743
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

9744
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

9745
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).
9746
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

9747

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

9748
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

9749

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: -
9750
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

9751
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).
9752
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
9753
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
9754
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
9755
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).
9756
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

9757
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).
9758
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”,

9759
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).
9760
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).
9761
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
9762
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).
9763

(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).
9764
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).
9765
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

9766
[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

9767
[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

9768
[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

9769
[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

9770
[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

9771
[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

9772
[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

9773
[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

9774
[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

9775
[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

9776
[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

9777
[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

9778
[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

9779
[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

9780
[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

9781
[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

9782
[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

9783
[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

9784
[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

9785
[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

9786
[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

9787
[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

9788
[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

9789
[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

9790
[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

9791
[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
9792
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

9793
[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

9794
[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

9795
[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

9796
[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

9797
[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
9798
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

9799
“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

9800
[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
9801
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

9802
[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

9803
[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

9804
[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

9805
[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

9806
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

9807
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
9808
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
9809
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

9810
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

9811
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
-
9812
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

9813
Анализ моделей и руководство за пределами Подход и проблемы в двух моде-

лях 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

9814
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
9815
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
9816
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

9817
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
9818
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
...
9819
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/
9820
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
9821
9822
9823
Henry Garrett
01/23/2022
9824
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
9825
View publication stats

Equal Dimension Dominating in SuperHyperGraphs

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Equal Dimension Dominating in SuperHyperGraphs

Uploaded by

Copyright:

Available Formats

See discussions, stats, and author profiles for this publication at: https://www.researchgate.

Equal Dimension Dominating In SuperHyperGraphs

Book · June 2023

501 PUBLICATIONS 21,236 CITATIONS

Featured Articles View project

Neutrosophic Graphs View project

The user has requested enhancement of the downloaded file.

Dr. Henry Garrett

4 Cancer In Extreme SuperHyperGraph 47

5 Extreme Equal Dimension Dominating 51

6 New Ideas On Super Dimity By Hyper Dimple Of Equal Dimension

8 Applied Notions Under The Scrutiny Of The Motivation Of This

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

10 Extreme SuperHyperEqual Dimension Dominating But As The Extensions

11 The Extreme Departures on The Theoretical Results Toward Theoretical

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

13 Extreme Applications in Cancer’s Extreme Recognition 141

14 Case 1: The Initial Extreme Steps Toward Extreme SuperHyperBipart-

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

16 Wondering Open Problems But As The Directions To Forming The

17 Conclusion and Closing Remarks 149

18 Extreme SuperHyperDuality But As The Extensions Excerpt From

19 Extreme SuperHyperJoin But As The Extensions Excerpt From Dense

20 Extreme SuperHyperPerfect But As The Extensions Excerpt From

21 Extreme SuperHyperTotal But As The Extensions Excerpt From Dense

22 Extreme SuperHyperConnected But As The Extensions Excerpt From

24 Cancer In Neutrosophic SuperHyperGraph 253

25 Neutrosophic Equal Dimension Dominating 257

26 New Ideas In Recognition of Cancer And Neutrosophic SuperHyper-

28 Applied Notions Under The Scrutiny Of The Motivation Of This

Henry Garrett · Independent Researcher · Department of Mathematics ·

29 Neutrosophic Preliminaries Of This Scientific Research On the Re-

30 Neutrosophic SuperHyperEqual Dimension Dominating But As The Extensions

31 The Neutrosophic Departures on The Theoretical Results Toward

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

33 Neutrosophic Applications in Cancer’s Neutrosophic Recognition 351

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

35 Case 2: The Increasing Neutrosophic Steps Toward Neutrosophic

36 Wondering Open Problems But As The Directions To Forming The

37 Conclusion and Closing Remarks 359

38 Neutrosophic SuperHyperDuality But As The Extensions Excerpt From

39 Neutrosophic SuperHyperJoin But As The Extensions Excerpt From

40 Neutrosophic SuperHyperPerfect But As The Extensions Excerpt From

41 Neutrosophic SuperHyperTotal But As The Extensions Excerpt From

42 Neutrosophic SuperHyperConnected But As The Extensions Excerpt

44 Books’ Contributions 463

45 “SuperHyperGraph-Based Books”: | Featured Tweets 475

Henry Garrett · Independent Researcher · Department of Mathematics ·

10.1 The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme

10.17The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme

11.1 an Extreme SuperHyperPath Associated to the Notions of Extreme SuperHyperEqual

14.1 an Extreme SuperHyperBipartite Associated to the Notions of Extreme SuperHy-

15.1 an Extreme SuperHyperMultipartite Associated to the Notions of Extreme

30.1 The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions

Henry Garrett · Independent Researcher · Department of Mathematics ·

30.6 The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions

Henry Garrett · Independent Researcher · Department of Mathematics ·

30.21The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions

31.1 a Neutrosophic SuperHyperPath Associated to the Notions of Neutrosophic

34.1 a Neutrosophic SuperHyperBipartite Associated to the Notions of Neutrosophic

35.1 a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic

Henry Garrett · Independent Researcher · Department of Mathematics ·

44.8 [HG181b] Henry Garrett, “Equal Dimension Dominating In SuperHyperGraphs”.