Strict Dimension Dominating in SuperHyperGraphs

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

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

inating In Recognition of Cancer With (Neutrosophic) SuperHyperGraph 53
7 ABSTRACT 55
8 Applied Notions Under The Scrutiny Of The Motivation Of This

Scientific Research 61
9 Extreme Preliminaries Of This Scientific Research On the Redeemed Ways 65
10 Extreme SuperHyperStrict 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 Strict Dimension Dominating 257
26 New Ideas In Recognition of Cancer And Neutrosophic SuperHyper-

Graph By Strict 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 SuperHyperStrict 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

SuperHyperStrict 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 SuperHyperStrict

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

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

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

of Neutrosophic SuperHyperStrict 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

SuperHyperStrict Dimension Dominating in the Example (42.0.5) . . . . . . . . . . . . . . 328
31.2 a Neutrosophic SuperHyperCycle Associated to the Neutrosophic Notions of
Neutrosophic SuperHyperStrict Dimension Dominating in the Neutrosophic Example (42.0.7) 330
31.3 a Neutrosophic SuperHyperStar Associated to the Neutrosophic Notions of
Neutrosophic SuperHyperStrict Dimension Dominating in the Neutrosophic Example (42.0.9) 331
31.4 Neutrosophic SuperHyperBipartite Neutrosophic Associated to the Neutrosophic
Notions of Neutrosophic SuperHyperStrict Dimension Dominating in the Example (42.0.11) 333
31.5 a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic
SuperHyperStrict Dimension Dominating in the Example (42.0.13) . . . . . . . . . . . . . 335
31.6 a Neutrosophic SuperHyperWheel Neutrosophic Associated to the Neutrosophic
Notions of Neutrosophic SuperHyperStrict 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 [HG292] Henry Garrett, “New Ideas On Super Con By Hyper Conceit Of
Strict Dimension Dominating In Recognition of Cancer With (Neutrosophic)
SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zenodo.8080068). . . . . . . . . . 464
44.4 [HG293] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic
SuperHyperGraph By Strict Dimension Dominating As Hyper Dimple On Super
Dimity”, Zenodo 2023, (doi: 10.5281/zenodo.8084436). . . . . . . . . . . . . . . . . 466
44.7 [HG186b] Henry Garrett, “Strict Dimension Dominating In SuperHyperGraphs”.
Dr. Henry Garrett, 2023 (doi: 10.5281/zenodo.8086310). . . . . . . . . . . . . . . . 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 Strict 1
Dimension Dominating In SuperHyperGraphs” and “Neutrosophic Strict Dimension Dominating 2
In SuperHyperGraphs” about some scientific research on Strict Dimension Dominating In 3

SuperHyperGraphs by two (Extreme/Neutrosophic) notions, namely, Extreme Strict Dimension 4
Dominating In SuperHyperGraphs and Neutrosophic Strict Dimension Dominating In SuperHy- 5
perGraphs. With scientific research on the basic scientific research properties, the scientific 6
research book starts to make Extreme Strict Dimension Dominating In SuperHyperGraphs 7
theory and Neutrosophic Strict 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 Strict Dimension Dominating In SuperHyperGraphs and Neutrosophic Strict 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 δ−Strict 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 first 33
1
Expression, holds if S is an δ−SuperHyperOffensive. And the second Expression, holds if S is an 34

δ−SuperHyperDefensive; a Neutrosophic δ−Strict Dimension Dominating In SuperHyperGraphs 35
is a maximal Neutrosophic of SuperHyperVertices with maximum Neutrosophic cardinality 36
such that either of the following expressions hold for the Neutrosophic cardinalities of Super- 37
HyperNeighbors 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 Strict 41
Dimension Dominating In SuperHyperGraphs . Since there’s more ways to get type-results 42
to make a Strict Dimension Dominating In SuperHyperGraphs more understandable. For the 43
sake of having Neutrosophic Strict Dimension Dominating In SuperHyperGraphs, there’s a 44
need to “redefine” the notion of a “Strict 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 Strict Dimension Dominating In SuperHyperGraphs . It’s redefined a Neutrosophic 48
Strict 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
Strict 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 Strict Dimension Dominating In SuperHyperGraphs until the Strict Dimension 59
Dominating In SuperHyperGraphs, then it’s officially called a “Strict Dimension Dominating 60
In SuperHyperGraphs” but otherwise, it isn’t a Strict Dimension Dominating In SuperHyper- 61
Graphs . There are some instances about the clarifications for the main definition titled a 62
“Strict 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 Strict Dimension Dominating In SuperHyperGraphs . For the sake of having a 65
Neutrosophic Strict Dimension Dominating In SuperHyperGraphs, there’s a need to “redefine” 66
the notion of a “Neutrosophic Strict Dimension Dominating In SuperHyperGraphs” and a 67
“Neutrosophic Strict 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 Strict Dimension Dominating In SuperHyperGraphs are redefined 72
to a “Neutrosophic Strict 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 Strict 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
Strict Dimension Dominating In SuperHyperGraphs, SuperHyperStar, SuperHyperBipart- 78
ite, SuperHyperMultiPartite, and SuperHyperWheel, are “Neutrosophic SuperHyperPath”, 79

“Neutrosophic Strict Dimension Dominating In SuperHyperGraphs”, “Neutrosophic SuperHy- 80

perStar”, “Neutrosophic SuperHyperBipartite”, “Neutrosophic SuperHyperMultiPartite”, and 81
“Neutrosophic SuperHyperWheel” if the intended Table holds. A SuperHyperGraph has a 82
“Neutrosophic Strict Dimension Dominating In SuperHyperGraphs” where it’s the strongest [the 83
maximum Neutrosophic value from all the Strict Dimension Dominating In SuperHyperGraphs 84
amid the maximum value amid all SuperHyperVertices from a Strict Dimension Dominating 85
In SuperHyperGraphs .] Strict 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 Strict 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(-/Strict Dimension Dominating In SuperHyperGraphs, 116
SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim 117
is to find either the longest Strict Dimension Dominating In SuperHyperGraphs or the strongest 118
Strict Dimension Dominating In SuperHyperGraphs in those Neutrosophic SuperHyperModels. 119
For the longest Strict Dimension Dominating In SuperHyperGraphs, called Strict Dimension 120
Dominating In SuperHyperGraphs, and the strongest Strict Dimension Dominating In Super- 121
HyperGraphs, called Neutrosophic Strict 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 Strict Dimension Dominating In SuperHyperGraphs. 125

There isn’t any formation of any Strict Dimension Dominating In SuperHyperGraphs but 126
literarily, it’s the deformation of any Strict 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) Strict 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 Strict 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 “δ−Strict 153
Dimension Dominating In SuperHyperGraphs” is a maximal Strict 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 δ−Strict Dimension Dominating In 159
SuperHyperGraphs” is a maximal Neutrosophic Strict 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 Strict Dimen- 166
sion Dominating In SuperHyperGraphs . Since there’s more ways to get type-results to 167
make Strict Dimension Dominating In SuperHyperGraphs more understandable. For the 168
sake of having Neutrosophic Strict Dimension Dominating In SuperHyperGraphs, there’s a 169
need to “redefine” the notion of “Strict Dimension Dominating In SuperHyperGraphs ”. The 170

Assume a Strict Dimension Dominating In SuperHyperGraphs . It’s redefined Neutrosophic 173
Strict 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
Strict 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 Strict Dimension Dominating In SuperHyperGraphs until the Strict Dimension 184
Dominating In SuperHyperGraphs, then it’s officially called “Strict Dimension Dominating In 185
SuperHyperGraphs” but otherwise, it isn’t Strict Dimension Dominating In SuperHyperGraphs 186
. There are some instances about the clarifications for the main definition titled “Strict 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 Strict Dimension Dominating In SuperHyperGraphs . For the sake of having Neutrosophic 190
Strict Dimension Dominating In SuperHyperGraphs, there’s a need to “redefine” the notion 191
of “Neutrosophic Strict Dimension Dominating In SuperHyperGraphs” and “Neutrosophic 192
Strict 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 Strict Dimension Dominating In SuperHyperGraphs are redefined “Neutrosophic Strict 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 Strict Dimension Dominating In SuperHyperGraphs more 200
understandable. Assume a Neutrosophic SuperHyperGraph. There are some Neutrosophic 201

SuperHyperClasses if the intended Table holds. Thus SuperHyperPath, Strict Dimension Dom- 202
inating In SuperHyperGraphs, SuperHyperStar, SuperHyperBipartite, SuperHyperMultiPartite, 203
and SuperHyperWheel, are “Neutrosophic SuperHyperPath”, “Neutrosophic Strict 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 Strict Dimension Dominat- 207
ing In SuperHyperGraphs” where it’s the strongest [the maximum Neutrosophic value from all 208
Strict Dimension Dominating In SuperHyperGraphs amid the maximum value amid all Super- 209
HyperVertices from a Strict Dimension Dominating In SuperHyperGraphs .] Strict 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
Strict 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(-/Strict Dimension Dominating In SuperHyperGraphs, 241

is to find either the longest Strict Dimension Dominating In SuperHyperGraphs or the strongest 243
Strict Dimension Dominating In SuperHyperGraphs in those Neutrosophic SuperHyperModels. 244
For the longest Strict Dimension Dominating In SuperHyperGraphs, called Strict Dimension 245
Dominating In SuperHyperGraphs, and the strongest Strict Dimension Dominating In Super- 246
HyperGraphs, called Neutrosophic Strict 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 Strict Dimension Dominating In SuperHyperGraphs. 250
There isn’t any formation of any Strict Dimension Dominating In SuperHyperGraphs but 251
literarily, it’s the deformation of any Strict 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 Strict 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 by 276
Florida: GLOBAL KNOWLEDGE - Publishing House 848 Brickell Ave Ste 950 Miami, Florida 277
33131 United States. This research book presents different types of notions SuperHyperResolving 278
and Strict Dimension Dominating In SuperHyperGraphs in the setting of duality in neutrosophic 279
graph theory and neutrosophic SuperHyperGraph theory. This research book has scrutiny on 280
the complement of the intended set and the intended set, simultaneously. It’s smart to consider 281
a set but acting on its complement that what’s done in this research book which is popular in 282
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 “Neutrosophic 1-Failed SuperHyperForcing 321
in the SuperHyperFunction to UseNeutrosophic SuperHyperGraphs on Cancer’s Neutrosophic 322
Recognition andBeyond” in Ref. [HG66s] by Henry Garrett (2023). In this research article, a 323
novel approach is implemented on SuperHyperGraph and neutrosophic SuperHyperGraph based 324
13
on fundamental SuperHyperNumber and using neutrosophic SuperHyperClasses of neutrosophic 325

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

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

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

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

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

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

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

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

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

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



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

HG287; HG288; HG289; HG290; HG291; HG292; HG293] alongside scientific re- 511
search books at [HG60b; HG61b; HG62b; HG63b; HG64b; HG65b; HG66b; HG67b; 512

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

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

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

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

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

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

HG290 [30] Henry Garrett, “New Ideas On Super Con By Hyper Conceit Of Reverse Strict Connective 636
In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 637
10.5281/zenodo.8080068). 638
By Unequal Connective Dominating As Hyper Conceit On Super Con”, Zenodo 2023, 640
(doi: 10.5281/zenodo.8078445). 641
HG288 [32] Henry Garrett, “New Ideas On Super Con By Hyper Conceit Of Unequal Connective 642
2023, (doi: 10.5281/zenodo.8078543). 644
By Strict Connective Dominating As Hyper Conceit On Super Con”, Zenodo 2023, (doi: 646
10.5281/zenodo.8076416). 647
HG286 [34] Henry Garrett, “New Ideas On Super Con By Hyper Conceit Of Strict Connective 648
2023, (doi: 10.5281/zenodo.8076399). 650
By Reverse Dimension Dominating As Hyper Dimple On Super Dimity”, Zenodo 2023, 652
(doi: 10.5281/zenodo.8072171). 653
HG284 [36] Henry Garrett, “New Ideas On Super Dimity By Hyper Dimple Of Reverse Dimension 654
2023, (doi: 10.5281/zenodo.8072267). 656
By Equal Dimension Dominating As Hyper Dimple On Super Dimity”, Zenodo 2023, (doi: 658
10.5281/zenodo.8067384). 659
HG282 [38] Henry Garrett, “New Ideas On Super Dimity By Hyper Dimple Of Equal Dimension 660
2023, (doi: 10.5281/zenodo.8067409). 662
By Dimension Dominating As Hyper Dimple On Super Dimity”, Zenodo 2023, (doi: 664
10.5281/zenodo.8061927). 665
HG280 [40] Henry Garrett, “New Ideas On Super Dimity By Hyper Dimple Of Dimension Dominating 666
10.5281/zenodo.8062016). 668
By Reverse Connective Dominating As Hyper Conceit On Super Con”, Zenodo 2023, (doi: 670
10.5281/zenodo.8057696). 671
HG278 [42] Henry Garrett, “New Ideas On Super Con By Hyper Conceit Of Reverse Connective 672
2023, (doi: 10.5281/zenodo.8057753). 674

By Equal Connective Dominating As Hyper Conceit On Super Con”, Zenodo 2023, (doi: 676
10.5281/zenodo.8052893). 677
HG276 [44] Henry Garrett, “New Ideas On Super Con By Hyper Conceit Of Equal Connective 678
2023, (doi: 10.5281/zenodo.8052925). 680
By Connective Dominating As Hyper Conceit On Super Con”, Zenodo 2023, (doi: 682
10.5281/zenodo.8051346). 683
HG274 [46] Henry Garrett, “New Ideas On Super Con By Hyper Conceit Of Connective Dominating 684
10.5281/zenodo.8051360). 686
HG273 [47] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyper- 687
Graph By United Dominating As Hyper Ultra On Super Units”, Zenodo 2023, (doi: 688
10.5281/zenodo.8025707). 689
HG272 [48] Henry Garrett, “New Ideas On Super Units By Hyper Ultra Of United Dominating 690
10.5281/zenodo.8027275). 692
By Zero Forcing As Hyper ford On Super forceps”, Zenodo 2023, (doi: 10.5281/zen- 694
odo.8017246). 695
HG270 [50] Henry Garrett, “New Ideas On Super forceps By Hyper ford Of Zero Forcing In 696
Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 697
10.5281/zenodo.8020128). 698
By Matrix-Based As Hyper mat On Super matte”, Zenodo 2023, (doi: 10.5281/zen- 700
odo.7978571). 701
HG268 [52] Henry Garrett, “New Ideas On Super mat By Hyper matte Of Matrix-Based In 702
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 703
10.5281/zenodo.7978857). 704
Graph By Dominating-Edges As Hyper Dome On Super Eddy”, Zenodo 2023, (doi: 706
10.5281/zenodo.7940830). 707
HG266 [54] Henry Garrett, “New Ideas On Super Eddy By Hyper Dome Of Dominating-Edges 708
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 709
10.5281/zenodo.7943578). 710
Graph By Edge-Gap As Hyper Gape On Super Gab”, Zenodo 2023, (doi: 10.5281/zen- 712
odo.7916595). 713

HG264 [56] Henry Garrett, “New Ideas On Super Gab By Hyper Gape Of Edge-Gap In Cancer’s 714
Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zen- 715
odo.7923632). 716
By Eulerian-Type-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, 718
(doi: 10.5281/zenodo.7904698). 719
HG262 [58] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Type- 720
Cycle-Neighbor In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 721
2023, (doi: 10.5281/zenodo.7904671). 722
By Eulerian-Type-Cycle-Decomposition As Hyper Decompress On Super Decompensation”, 724
Zenodo 2023, (doi: 10.5281/zenodo.7904529). 725
HG260 [60] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of Eulerian- 726
Type-Cycle-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyper- 727
Graph”, Zenodo 2023, (doi: 10.5281/zenodo.7904401). 728
By Eulerian-Type-Cycle-Cut As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 730
10.5281/zenodo.7871026). 731
Cycle-Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 733
2023, (doi: 10.5281/zenodo.7874647). 734
By Eulerian-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 736
10.5281/zenodo.7857856). 737
HG256 [64] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Cycle- 738
Neighbor In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 739
2023, (doi: 10.5281/zenodo.7857841). 740
By Eulerian-Cycle-Decomposition As Hyper Decompress On Super Decompensation”, 742
Cycle-Decomposition In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, 745
Graph By Eulerian-Cycle-Cut As Hyper Eulogy On Super EULA”, Zenodo 2023, (doi: 748
10.5281/zenodo.7853867). 749
HG252 [68] Henry Garrett, “New Ideas On Super EULA By Hyper Eulogy Of Eulerian-Cycle-Cut 750
10.5281/zenodo.7853922). 752

By Eulerian-Type-Path-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, 754
(doi: 10.5281/zenodo.7851519). 755
HG250 [70] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Type-Path- 756
Neighbor In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, 757
(doi: 10.5281/zenodo.7851550). 758
By Eulerian-Type-Path-Decomposition As Hyper Decompress On Super Decompensation”, 760
Type-Path-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 763
By Eulerian-Type-Path-Cut As Hyper Eulogy On Super EULA”, Zenodo 2023, (doi: 766
10.5281/zenodo.7834229). 767
HG246 [74] Henry Garrett, “New Ideas On Super EULA By Hyper Eulogy Of Eulerian-Type-Path-Cut 768
10.5281/zenodo.7834261). 770
By Eulerian-Path-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 772
10.5281/zenodo.7824560). 773
HG244 [76] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Path- 774
(doi: 10.5281/zenodo.7824623). 776
By Eulerian-Path-Decomposition As Hyper Decompress On Super Decompensation”, 778
Path-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 781

As Hyper Tool On Super Toot”, Zenodo 2023, (doi: 10.5281/zenodo.7812236). 784
By initial Eulerian-Path-Cut As Hyper initial Eulogy On Super initial EULA”, Zenodo 786
2023, (doi: 10.5281/zenodo.7809365). 787
By Eulerian-Path-Cut As Hyper Eulogy-Path-Cut On Super EULA-Path-Cut”, Zenodo 789
2023, (doi: 10.5281/zenodo.7809358). 790

HG238 [82] Henry Garrett, “New Ideas On Super EULA By Hyper Eulogy Of Eulerian-Path-Cut 791
10.5281/zenodo.7809219). 793
Graph By Eulerian-Path-Cut As Hyper Eulogy On Super EULA”, Zenodo 2023, (doi: 795
10.5281/zenodo.7809328). 796
By Hamiltonian-Type-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 798
2023, (doi: 10.5281/zenodo.7806767). 799
HG235 [85] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Hamiltonian-Type- 800
2023, (doi: 10.5281/zenodo.7806838). 802
By Hamiltonian-Type-Cycle-Decomposition As Hyper Decompress On Super Decompensa- 804
tion”, Zenodo 2023, (doi: 10.5281/zenodo.7804238). 805
HG233 [87] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of 806
Hamiltonian-Type-Cycle-Decomposition In Cancer’s Recognition With (Neutrosophic) 807
SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zenodo.7804228). 808
By Hamiltonian-Type-Cycle-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi: 810
10.5281/zenodo.7799902). 811
HG231 [89] Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Type- 812
Cycle-Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, 813
(doi: 10.5281/zenodo.7804218). 814
By Hamiltonian-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, 816
(doi: 10.5281/zenodo.7796334). 817
By Hamiltonian-Cycle-Decomposition As Hyper Decompress On Super Decompensation”, 819
By Hamiltonian-Cycle-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi: 822
10.5281/zenodo.7791952). 823
HG225 [93] Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Cycle- 824
Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 825
10.5281/zenodo.7791982). 826
By Hamiltonian-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 828
10.5281/zenodo.7790026). 829

HG223 [95] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Hamiltonian-Neighbor 830
10.5281/zenodo.7790052). 832
By Hamiltonian-Decomposition As Hyper Decompress On Super Decompensation”, Zenodo 834
2023, (doi: 10.5281/zenodo.7787066). 835
Hamiltonian-Decomposition In Recognition of Cancer With (Neutrosophic) SuperHy- 837
perGraph”, Zenodo 2023, (doi: 10.5281/zenodo.7787094). 838
By Hamiltonian-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi: 840
10.5281/zenodo.7781476). 841
HG219 [99] Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Cut 842
10.5281/zenodo.7783082). 844
Graph By Trace-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 846
10.5281/zenodo.7777857). 847
HG217 [101] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Trace-Neighbor 848
10.5281/zenodo.7779286). 850
HG215 [102] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 851
By Trace-Decomposition As Hyper Decompress On Super Decompensation”, Zenodo 2023, 852
(doi: 10.5281/zenodo.7771831). 853
HG214 [103] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of Trace- 854
Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 855
2023, (doi: 10.5281/zenodo.7772468). 856
By Trace-Cut As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 858
10.13140/RG.2.2.20913.25446). 859
HG212 [105] Henry Garrett, “New Ideas On Super Tract By Hyper Track Of Trace-Cut In Cancer’s 860
odo.7764916). 862
By Edge-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 864
10.13140/RG.2.2.11770.98247). 865
HG210 [107] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Edge-Neighbor In 866
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 867
10.13140/RG.2.2.12400.12808). 868

By Edge-Decomposition As Hyper Decompress On Super Decompensation”, ResearchGate 870
2023, (doi: 10.13140/RG.2.2.22545.10089). 871
Edge-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 873
ResearchGate 2023, (doi: 10.13140/RG.2.2.29544.34564). 874
HG207 [110] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyper- 875
Graph By Edge-Cut As Hyper Edify On Super Eddy”, ResearchGate 2023, (doi: 876
10.13140/RG.2.2.11377.76644). 877
HG206 [111] Henry Garrett, “New Ideas On Super Eddy By Hyper Edify Of Edge-Cut In Can- 878
cer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 879
10.13140/RG.2.2.23750.96329). 880
By Vertex-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 882
10.13140/RG.2.2.31366.24641). 883
HG204 [113] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Vertex-Neighbor In 884
10.13140/RG.2.2.34721.68960). 886
By Vertex-Decomposition As Hyper Decompress On Super Decompensation”, ResearchGate 888
2023, (doi: 10.13140/RG.2.2.30212.81289). 889
Vertex-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 891
Graph By Vertex-Cut As Hyper Vertu On Super Vertigo”, ResearchGate 2023, (doi: 894
10.13140/RG.2.2.24288.35842). 895
HG200 [117] Henry Garrett, “New Ideas On Super Vertigo By Hyper Vertu Of Vertex-Cut In 896
10.13140/RG.2.2.32467.25124). 898
By Stable-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 900
10.13140/RG.2.2.31025.45925). 901
HG198 [119] Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of Stable-Neighbor In 902
10.13140/RG.2.2.17184.25602). 904
By Stable-Decompositions As Hyper Stain On Super Stagy”, ResearchGate 2023, (doi: 906
10.13140/RG.2.2.23423.28327). 907

HG196 [121] Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Decompositions In 908
10.13140/RG.2.2.28456.44805). 910
Graph By Stable-Cut As Hyper Stain On Super Stagy”, ResearchGate 2023, (doi: 912
10.13140/RG.2.2.23525.68320). 913
HG194 [123] Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Cut In Can- 914
10.13140/RG.2.2.20170.24000). 916
By Clique-Neighbors As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 918
10.13140/RG.2.2.36475.59683). 919
HG192 [125] Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of Clique-Neighbors In 920
10.13140/RG.2.2.29764.71046). 922
By Clique-Decompositions As Hyper Decompile On Super Decommission”, ResearchGate 924
2023, (doi: 10.13140/RG.2.2.18780.87683). 925
Clique- Decompositions In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 927
Graph By Clique-Cut As Hyper Click On Super Cliche”, ResearchGate 2023, (doi: 930
10.13140/RG.2.2.26134.01603). 931
HG188 [129] Henry Garrett, “New Ideas On Super Cliff By Hyper Cling Of Clique-Cut In Can- 932
10.13140/RG.2.2.27392.30721). 934
HG187 [130] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHy- 935
perGraph By Space As Hyper Spin On Super Spacy”, ResearchGate 2023, (doi: 936
10.13140/RG.2.2.33028.40321). 937
Graph By List- Coloring As Hyper List On Super Lisle”, ResearchGate 2023, (doi: 939
10.13140/RG.2.2.21389.20966). 940
HG185 [132] Henry Garrett, “New Ideas On Super Lith By Hyper Lite Of List-Coloring In 941
10.13140/RG.2.2.16356.04489). 943
perGraph By Space As Hyper Sparse On Super Spark”, ResearchGate 2023, (doi: 945
10.13140/RG.2.2.21756.21129). 946

HG183 [134] Henry Garrett, “New Ideas On Super Solidarity By Hyper Soul Of Space In 947
Cancer’s Recognition With (Extreme) SuperHyperGraph”, ResearchGate 2023, (doi: 948
10.13140/RG.2.2.30983.68009). 949
By Edge-Connectivity As Hyper Disclosure On Super Closure”, ResearchGate 2023, (doi: 951
10.13140/RG.2.2.28552.29445). 952
HG181 [136] Henry Garrett, “New Ideas On Super Uniform By Hyper Deformation Of Edge-Connectivity 953
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, 954
(doi: 10.13140/RG.2.2.10936.21761). 955
By Vertex-Connectivity As Hyper Leak On Super Structure”, ResearchGate 2023, (doi: 957
10.13140/RG.2.2.35105.89447). 958
HG179 [138] Henry Garrett, “New Ideas On Super System By Hyper Explosions Of Vertex-Connectivity 959
(doi: 10.13140/RG.2.2.30072.72960). 961
By Tree-Decomposition As Hyper Forward On Super Returns”, ResearchGate 2023, (doi: 963
10.13140/RG.2.2.31147.52003). 964
HG177 [140] Henry Garrett, “New Ideas On Super Nodes By Hyper Moves Of Tree-Decomposition In 965
10.13140/RG.2.2.32825.24163). 967
Graph By Chord As Hyper Excellence On Super Excess”, ResearchGate 2023, (doi: 969
10.13140/RG.2.2.13059.58401). 970
HG175 [142] Henry Garrett, “New Ideas On Super Gap By Hyper Navigations Of Chord In 971
10.13140/RG.2.2.11172.14720). 973
By SuperHyper(i,j)-Domination As Hyper Controller On Super Waves”, ResearchGate 975
2023, (doi: 10.13140/RG.2.2.22011.80165). 976
HG173 [144] Henry Garrett, “New Ideas On Super Coincidence By Hyper Routes Of SuperHyper(i,j)- 977
Domination In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchG- 978
ate 2023, (doi: 10.13140/RG.2.2.30819.84003). 979
By SuperHyperEdge-Domination As Hyper Reversion On Super Indirection”, ResearchGate 981
2023, (doi: 10.13140/RG.2.2.10493.84962). 982
HG171 [146] Henry Garrett, “New Ideas On Super Obstacles By Hyper Model Of SuperHyperEdge- 983
ate 2023, (doi: 10.13140/RG.2.2.13849.29280). 985

By SuperHyperK-Domination As Hyper k-Actions On Super Patterns”, ResearchGate 987
2023, (doi: 10.13140/RG.2.2.19944.14086). 988
HG169 [148] Henry Garrett, “New Ideas On Super Harmony By Hyper k-Function Of SuperHyperK- 989
ate 2023, (doi: 10.13140/RG.2.2.23299.58404). 991
By SuperHyperK-Number As Hyper k-Partition On Super Layers”, ResearchGate 2023, 993
(doi: 10.13140/RG.2.2.33103.76968). 994
HG167 [150] Henry Garrett, “New Ideas On Super Gradient By Hyper k-Class Of SuperHyperK-Number 995
(doi: 10.13140/RG.2.2.23037.44003). 997
By SuperHyperOrder As Hyper Enumerations On Super Landmarks”, ResearchGate 2023, 999
(doi: 10.13140/RG.2.2.35646.56641). 1000
HG165 [152] Henry Garrett, “New Ideas On Super Analogous By Hyper Visions Of SuperHyperOrder In 1001
10.13140/RG.2.2.18030.48967). 1003
By SuperHyperColoring As Hyper Categories On Super Neighbors”, ResearchGate 2023, 1005
(doi: 10.13140/RG.2.2.13973.81121). 1006
HG163 [154] Henry Garrett, “New Ideas On Super Relations By Hyper Identifications Of SuperHyper- 1007
Coloring In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 1008
2023, (doi: 10.13140/RG.2.2.34106.47047). 1009
HG162 [155] Henry Garrett, “New Ideas On Super Contradiction By Hyper Detection of SuperHyper- 1010
Defensive In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 1011
By SuperHyperDimension As Hyper Distinguishing On Super Distances”, ResearchGate 1014
2023, (doi: 10.13140/RG.2.2.31956.88961). 1015
HG160 [157] Henry Garrett, “New Ideas On Super Locations By Hyper Differing Of SuperHyperDi- 1016
mension In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 1017
2023, (doi: 10.13140/RG.2.2.15179.67361). 1018
By SuperHyperDominating As Hyper Closing On Super Messy”, ResearchGate 2023, (doi: 1020
10.13140/RG.2.2.21510.45125). 1021
HG158 [159] Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDom- 1022
inating In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 1023
2023, (doi: 10.13140/RG.2.2.13121.84321). 1024

By SuperHyperConnected As Hyper Group On Super Surge”, ResearchGate 2023, (doi: 1026
10.13140/RG.2.2.11758.69441). 1027
HG156 [161] Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of SuperHyperCon- 1028
nected In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 1029
2023, (doi: 10.13140/RG.2.2.31891.35367). 1030
By SuperHyperTotal As Hyper Covering On Super Infections”, ResearchGate 2023, (doi: 1032
10.13140/RG.2.2.19360.87048). 1033
HG154 [163] Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal 1034
In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 1035
10.13140/RG.2.2.32363.21286). 1036
HG153 [164] Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect 1037
10.13140/RG.2.2.23266.81602). 1039
By SuperHyperPerfect As Hyper Idealism On Super Vacancy”, ResearchGate 2023, (doi: 1041
10.13140/RG.2.2.19911.37285). 1042
By SuperHyperJoin As Hyper Separations On Super Sorts”, ResearchGate 2023, (doi: 1044
10.13140/RG.2.2.11050.90569). 1045
HG150 [167] Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of SuperHy- 1046
perJoin In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 1047
2023, (doi: 10.13140/RG.2.2.17761.79206). 1048
HG149 [168] Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of Super- 1049
HyperDuality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 1050
HG148 [169] Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph 1052
By SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchG- 1053
ate 2023, (doi: 10.13140/RG.2.2.33275.80161). 1054
By Path SuperHyperColoring As Hyper Correction On Super Faults”, ResearchGate 2023, 1056
(doi: 10.13140/RG.2.2.30182.50241). 1057
HG146 [171] Henry Garrett, “New Ideas On Super Reflections By Hyper Rotations Of Path SuperHy- 1058
perColoring In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 1059
HG145 [172] Henry Garrett, “New Ideas As Hyper Deformations On Super Chains In Cancer’s 1061
Neutrosophic Recognition and Neutrosophic SuperHyperGraph By SuperHyperDensity”, 1062

HG144 [173] Henry Garrett, “New Ideas As Hyper Ignorance By SuperHyperDensity On Super 1064
Resistances In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 1065
ResearchGate 2023, (doi:10.13140/RG.2.2.16800.05123). 1066
HG143 [174] Henry Garrett, “New Research On Cancer’s Recognition and Neutrosophic SuperHyper- 1067
Graph By Eulerian SuperHyperCycles and Hamiltonian Sets As Hyper Covering Versus 1068
Super separations-VI ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.29913.80482). 1069
Super separations-V ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.33269.24809). 1072
Super separations-IV ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.34946.96960). 1075
HG140 [177] Henry Garrett, “A Research On Cancer’s Recognition and Neutrosophic SuperHyperGraph 1076
By Eulerian SuperHyperCycles and Hamiltonian Sets As Hyper Covering Versus Super 1077
separations-III ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.14814.31040). 1078
separations-II ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.15653.17125). 1081
separations-I ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.25719.50089). 1084
HG137 [180] Henry Garrett, “New Ideas On Super Disruptions In Cancer’s Extreme Recognition 1085
As Neutrosophic SuperHyperGraph By Hyper Plans Called SuperHyperConnectivities”, 1086
HG136 [181] Henry Garrett, “Cancer’s Neutrosophic Recognition As Neutrosophic SuperHyperGraph 1088
By SuperHyperConnectivities As Hyper Diagnosis On Super Mechanism”, ResearchGate 1089
2023, (doi: 10.13140/RG.2.2.17252.24968). 1090
HG135 [182] Henry Garrett,“Cancer’s Recognition and (Neutrosophic) SuperHyperGraph By the Criteria 1091
of Eulerian and Hamiltonian Type-Sets As Hyper Modified Cycles On Super Mess”, 1092
ResearchGate 2023,(doi: 10.13140/RG.2.2.16652.59525). 1093
HG134 [183] Henry Garrett,“Eulerian and Hamiltonian In Cancer’s Neutrosophic Recognition and 1094
Neutrosophic SuperHyperGraph On Super Interactions By Hyper Extensions of Cycles”, 1095
HG132 [184] Henry Garrett,“SuperHyperGirth Type-Results on extreme SuperHyperGirth theory and 1097
(Neutrosophic) SuperHyperGraphs Toward Cancer’s extreme Recognition”, Preprints 2023, 1098
2023010396 (doi: 10.20944/preprints202301.0396.v1). 1099
HG131 [185] Henry Garrett,“Neutrosophic SuperHyperGraphs Warns Hyper Landmark of neutrosophic 1100
SuperHyperGirth In Super Type-Versions of Cancer’s neutrosophic Recognition”, Preprints 1101
2023, 2023010395 (doi: 10.20944/preprints202301.0395.v1). 1102

HG130 [186] Henry Garrett,“The Constructions of (Neutrosophic) SuperHyperGraphs on the Cancer’s 1103
Recognition in The Confrontation With Super Attacks In Hyper Situations By Implementing 1104
(Neutrosophic) 1-Failed SuperHyperForcing in The Technical Approaches to Neutralize 1105
SuperHyperViews”, ResearchGate 2023, (doi: 10.13140/RG.2.2.26240.51204). 1106
HG129 [187] Henry Garrett,“(Neutrosophic) 1-Failed SuperHyperForcing As the Entrepreneurs on 1107

Cancer’s Recognitions To Fail Forcing Style As the Super Classes With Hyper Effects 1108
In The Background of the Framework is So-Called (Neutrosophic) SuperHyperGraphs”, 1109
HG128 [188] Henry Garrett,“Super Actions On The Types of Hyper Levels In The Sensible Neutrosophic 1111
SuperHyperGirth On Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyper- 1112
Graph”, ResearchGate 2023,(doi: 10.13140/RG.2.2.26836.88960). 1113
HG127 [189] Henry Garrett,“SuperHyperGirth Approaches on the Super Challenges on the Cancer’s 1114
Recognition In the Hyper Model of (Neutrosophic) SuperHyperGraph”, ResearchGate 1115
2023,(doi: 10.13140/RG.2.2.36745.93289). 1116
HG126 [190] Henry Garrett,“Extreme SuperHyperClique as the Firm Scheme of Confrontation under 1117

HG125 [191] Henry Garrett,“Uncertainty On The Act And Effect Of Cancer Alongside The Foggy 1120
10.20944/preprints202301.0282.v1). 1123
HG124 [192] Henry Garrett,“Neutrosophic Version Of Separates Groups Of Cells In Cancer’s 1124
10.20944/preprints202301.0267.v1).). 1126
(doi: 10.20944/preprints202301.0265.v1). 1131
HG122 [194] Henry Garrett,“Breaking the Continuity and Uniformity of Cancer In The Worst Case of 1132
prints202301.0262.v1). 1135
2023010224, (doi: 10.20944/preprints202301.0224.v1). 1141

HG24 [197] Henry Garrett,“SuperHyperMatching By (R-)Definitions And Polynomials To Monitor 1142

Cancer’s Recognition In Neutrosophic SuperHyperGraphs”, ResearchGate 2023,(doi: 1143
10.13140/RG.2.2.35061.65767). 1144
HG25 [198] Henry Garrett,“The Focus on The Partitions Obtained By Parallel Moves In The 1145
Cancer’s Extreme Recognition With Different Types of Extreme SuperHyperMatching 1146
Set and Polynomial on (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 1147
10.13140/RG.2.2.18494.15680). 1148
HG26 [199] Henry Garrett,“Extreme Failed SuperHyperClique Decides the Failures on the Can- 1149
cer’s Recognition in the Perfect Connections of Cancer’s Attacks By SuperHy- 1150

perModels Named (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 1151
10.13140/RG.2.2.32530.73922). 1152
HG27 [200] Henry Garrett,“Indeterminacy On The All Possible Connections of Cells In Front 1153
of Cancer’s Attacks In The Terms of Neutrosophic Failed SuperHyperClique on Can- 1154
cer’s Recognition called Neutrosophic SuperHyperGraphs”, ResearchGate 2023, (doi: 1155
10.13140/RG.2.2.15897.70243). 1156
10.13140/RG.2.2.32530.73922). 1160
prints202301.0105.v1). 1163
HG28 [203] Henry Garrett,“Perfect Directions Toward Idealism in Cancer’s Neutrosophic Recogni- 1164
tion Forwarding Neutrosophic SuperHyperClique on Neutrosophic SuperHyperGraphs”, 1165

HG29 [204] Henry Garrett,“Demonstrating Complete Connections in Every Embedded Regions 1167
and Sub-Regions in the Terms of Cancer’s Recognition and (Neutrosophic) Su- 1168
perHyperGraphs With (Neutrosophic) SuperHyperClique”, ResearchGate 2023, (doi: 1169
10.13140/RG.2.2.23172.19849). 1170

HG30 [207] Henry Garrett,“Different Neutrosophic Types of Neutrosophic Regions titled neut- 1177
rosophic Failed SuperHyperStable in Cancer’s Neutrosophic Recognition modeled 1178
in the Form of Neutrosophic SuperHyperGraphs”, ResearchGate 2023, (doi: 1179
10.13140/RG.2.2.17385.36968). 1180

Preprints 2023, 2023010044 1183

10.20944/preprints202301.0043.v1). 1186
HG31 [210] Henry Garrett, “Using the Tool As (Neutrosophic) Failed SuperHyperStable To SuperHy- 1187
perModel Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs”, ResearchGate 1188
2023, (doi: 10.13140/RG.2.2.28945.92007). 1189
SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 1194
10.13140/RG.2.2.35774.77123). 1195

HG35 [214] Henry Garrett, “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Re- 1199
cognitions And (Neutrosophic) SuperHyperGraphs”, ResearchGate 2022, (doi: 1200
10.13140/RG.2.2.29430.88642). 1201
(doi: 10.20944/preprints202212.0549.v1). 1207
(Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, ResearchGate 2022, (doi: 1209

10.13140/RG.2.2.19380.94084). 1210
SuperHyperClasses”, ResearchGate 2022, (doi: 10.13140/RG.2.2.14426.41923). 1218

(doi: 10.20944/preprints202212.0500.v1). 1221
Graph With SuperHyperModeling of Cancer’s Recognitions”, ResearchGate 2022 (doi: 1223
10.13140/RG.2.2.20993.12640). 1224
HG952 [222] Henry Garrett,“Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic 1225

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

ResearchGate 2022 (doi: 10.13140/RG.2.2.23123.04641). 1230
HG37 [226] Henry Garrett, “Basic Neutrosophic Notions Concerning SuperHyperDominating and 1237
Neutrosophic SuperHyperResolving in SuperHyperGraph”, ResearchGate 2022 (doi: 1238
10.13140/RG.2.2.29173.86244). 1239
HG38 [227] Henry Garrett, “Initial Material of Neutrosophic Preliminaries to Study Some Neutrosophic 1240
Notions Based on Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic SuperHyper- 1241
Graph (NSHG)”, ResearchGate 2022 (doi: 10.13140/RG.2.2.25385.88160). 1242
HG186b [228] Henry Garrett, “Strict Dimension Dominating In SuperHyperGraphs”. Dr. Henry Garrett, 1243
2023 (doi: 10.5281/zenodo.8086310). 1244
HG185b [229] Henry Garrett, “Reverse Strict Connective In SuperHyperGraphs”. Dr. Henry Garrett, 1245
2023 (doi: 10.5281/zenodo.8080167). 1246
HG184b [230] Henry Garrett, “Unequal Connective Dominating In SuperHyperGraphs”. Dr. Henry 1247
Garrett, 2023 (doi: 10.5281/zenodo.8078574). 1248
HG183b [231] Henry Garrett, “Strict Connective Dominating In SuperHyperGraphs”. Dr. Henry Garrett, 1249
2023 (doi: 10.5281/zenodo.8076449). 1250
HG182b [232] Henry Garrett, “Reverse Dimension Dominating In SuperHyperGraphs”. Dr. Henry 1251
HG181b [233] Henry Garrett, “Equal Dimension Dominating In SuperHyperGraphs”. Dr. Henry Garrett, 1253
2023 (doi: 10.5281/zenodo.8067469). 1254
HG180b [234] Henry Garrett, “Dimension Dominating In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1255
(doi: 10.5281/zenodo.8062076). 1256

HG179b [235] Henry Garrett, “Reverse Connective Dominating In SuperHyperGraphs”. Dr. Henry 1257
HG178b [236] Henry Garrett, “Equal Connective Dominating In SuperHyperGraphs”. Dr. Henry Garrett, 1259
2023 (doi: 10.5281/zenodo.8052976). 1260
HG177b [237] Henry Garrett, “Connective Dominating In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1261
(doi: 10.5281/zenodo.8051368). 1262
HG176b [238] Henry Garrett, “United Dominating In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1263
(doi: 10.5281/zenodo.8027488). 1264
HG175b [239] Henry Garrett, “Zero Forcing In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1265
10.5281/zenodo.8020181). 1266
HG174b [240] Henry Garrett, “Matrix-Based In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1267
10.5281/zenodo.7978921). 1268
HG173b [241] Henry Garrett, “Collections of Math II”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1269
odo.7943878). 1270
HG172b [242] Henry Garrett, “Dominating-Edges In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1271
10.5281/zenodo.7943871). 1272
HG171b [243] Henry Garrett, “Edge-Gap In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1273
10.5281/zenodo.7923786). 1274
HG170b [244] Henry Garrett, “Eulerian-Type-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 1275
2023 (doi: 10.5281/zenodo.7905287). 1276
HG169b [245] Henry Garrett, “Eulerian-Type-Cycle-Decomposition In SuperHyperGraphs”. Dr. Henry 1277

HG168b [246] Henry Garrett, “Eulerian-Type-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 1279
2023 (doi: 10.5281/zenodo.7874677). 1280
HG167b [247] Henry Garrett, “Eulerian-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1281
(doi: 10.5281/zenodo.7857906). 1282
HG166b [248] Henry Garrett, “Eulerian-Cycle-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 1283
2023 (doi: 10.5281/zenodo.7856329). 1284
HG165b [249] Henry Garrett, “Eulerian-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1285
10.5281/zenodo.7854561). 1286
HG164b [250] Henry Garrett, “Eulerian-Type-Path-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 1287
2023 (doi: 10.5281/zenodo.7851893). 1288
HG163b [251] Henry Garrett, “Eulerian-Type-Path-Decomposition In SuperHyperGraphs”. Dr. Henry 1289

HG162b [252] Henry Garrett, “Eulerian-Type-Path-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1291
(doi: 10.5281/zenodo.7835063). 1292

HG161b [253] Henry Garrett, “Eulerian-Path-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1293
(doi: 10.5281/zenodo.7826705). 1294
HG160b [254] Henry Garrett, “Eulerian-Path-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 1295
2023 (doi: 10.5281/zenodo.7820680). 1296
HG159b [255] Henry Garrett, “Eulerian-Path-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1297
10.5281/zenodo.7812750). 1298
HG158b [256] Henry Garrett, “Hamiltonian-Type-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry 1299

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

HG156b [258] Henry Garrett, “Hamiltonian-Type-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 1303
2023 (doi: 10.5281/zenodo.7807782). 1304
HG155b [259] Henry Garrett, “Hamiltonian-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 1305
2023 (doi: 10.5281/zenodo.7804449). 1306
HG154b [260] Henry Garrett, “Hamiltonian-Cycle-Decomposition In SuperHyperGraphs”. Dr. Henry 1307

HG153b [261] Henry Garrett, “Hamiltonian-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1309
(doi: 10.5281/zenodo.7792307). 1310
HG152b [262] Henry Garrett, “Hamiltonian-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1311
(doi: 10.5281/zenodo.7790728). 1312
HG151b [263] Henry Garrett, “Hamiltonian-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 1313
2023 (doi: 10.5281/zenodo.7787712). 1314
HG150b [264] Henry Garrett, “Hamiltonian-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1315
10.5281/zenodo.7783791). 1316
HG149b [265] Henry Garrett, “Trace-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1317
10.5281/zenodo.7780123). 1318
HG148b [266] Henry Garrett, “Trace-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1319
(doi: 10.5281/zenodo.7773119). 1320
HG147b [267] Henry Garrett, “SuperHyperDuality”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1321
odo.7637762). 1322
HG146b [268] Henry Garrett, “Trace-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1323
10.5281/zenodo.7766174). 1324
HG145b [269] Henry Garrett, “Edge-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1325
10.5281/zenodo.7762232). 1326
HG144b [270] Henry Garrett, “Edge-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1327
(doi: 10.5281/zenodo.7758601). 1328

HG143b [271] Henry Garrett, “Edge-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1329
10.5281/zenodo.7754661). 1330
HG142b [272] Henry Garrett, “Vertex-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1331
10.5281/zenodo.7750995) . 1332
HG141b [273] Henry Garrett, “Vertex-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1333
(doi: 10.5281/zenodo.7749875). 1334
HG140b [274] Henry Garrett, “Vertex-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1335
10.5281/zenodo.7747236). 1336
HG139b [275] Henry Garrett, “Stable-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1337
10.5281/zenodo.7742587). 1338
HG138b [276] Henry Garrett, “Stable-Decompositions In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1339
(doi: 10.5281/zenodo.7738635). 1340
HG137b [277] Henry Garrett, “Stable-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1341
10.5281/zenodo.7734719). 1342
HG136b [278] Henry Garrett, “Clique-Neighbors In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1343
10.5281/zenodo.7730484). 1344
HG135b [279] Henry Garrett, “Clique-Decompositions In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1345
(doi: 10.5281/zenodo.7730469). 1346
HG134b [280] Henry Garrett, “Clique-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1347
10.5281/zenodo.7722865). 1348
HG133b [281] Henry Garrett, “Space In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1349
odo.7713563). 1350
odo.7709116). 1352
HG131b [283] Henry Garrett, “Edge-Connectivity In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1353
10.5281/zenodo.7706415). 1354
HG130b [284] Henry Garrett, “Vertex-Connectivity In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1355
10.5281/zenodo.7706063). 1356
HG129b [285] Henry Garrett, “Tree-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1357
10.5281/zenodo.7701906). 1358
HG128b [286] Henry Garrett, “Chord In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1359
odo.7700205). 1360
HG127b [287] Henry Garrett, “(i,j)-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1361
10.5281/zenodo.7694876). 1362
HG126b [288] Henry Garrett, “Edge-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1363
10.5281/zenodo.7679410). 1364

HG125b [289] Henry Garrett, “K-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1365
10.5281/zenodo.7675982). 1366
HG124b [290] Henry Garrett, “K-Number In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1367
10.5281/zenodo.7672388). 1368
HG123b [291] Henry Garrett, “Order In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1369
odo.7668648). 1370
HG122b [292] Henry Garrett, “Coloring In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1371
10.5281/zenodo.7662810). 1372
HG121b [293] Henry Garrett, “Dimension In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1373
10.5281/zenodo.7659162). 1374
HG120b [294] Henry Garrett, “Cancer In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1375
odo.7653233). 1376
HG119b [295] Henry Garrett, “SuperHyperWheel”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1377
odo.7653204). 1378
HG118b [296] Henry Garrett, “SuperHyperMultipartite”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1379
odo.7653142). 1380
HG117b [297] Henry Garrett, “SuperHyperBipartite”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1381
odo.7653117). 1382
HG116b [298] Henry Garrett, “SuperHyperStar”. Dr. Henry Garrett, 2023 (doi: 10.5281/zenodo.7653089). 1383
HG115b [299] Henry Garrett, “SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1384
odo.7651687). 1385
HG114b [300] Henry Garrett, “SuperHyperPath”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1386
odo.7651619). 1387
HG113b [301] Henry Garrett, “SuperHyperDomination”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1388
odo.7651439). 1389
HG112b [302] Henry Garrett, “SuperHyperDominating”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1390
odo.7650729). 1391
HG111b [303] Henry Garrett, “SuperHyperConnected”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1392
odo.7647868). 1393
HG110b [304] Henry Garrett, “SuperHyperTotal”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1394
odo.7647017). 1395
HG109b [305] Henry Garrett, “SuperHyperPerfect”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1396
odo.7644894). 1397
HG108b [306] Henry Garrett, “SuperHyperJoin”. Dr. Henry Garrett, 2023 (doi: 10.5281/zenodo.7641880). 1398

HG107b [307] Henry Garrett, “Path SuperHyperColoring”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1399
odo.7632923). 1400
HG106b [308] Henry Garrett, “SuperHyperDensity”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1401
odo.7623459). 1402
HG105b [309] Henry Garrett, “Neutrosophic SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 1403
10.5281/zenodo.7606416). 1404
HG104b [310] Henry Garrett, “Extreme SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 1405
10.5281/zenodo.7606416). 1406
HG103b [311] Henry Garrett, “SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1407
odo.7606404). 1408
HG102b [312] Henry Garrett, “Neutrosophic SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 1409
10.5281/zenodo.7580018). 1410
HG101b [313] Henry Garrett, “Extreme SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1411
odo.7580018). 1412
odo.7580018). 1414
odo.7579929). 1416
HG98b [316] Henry Garrett, “Neutrosophic SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 1417
10.5281/zenodo.7563170). 1418
HG97b [317] Henry Garrett, “Extreme SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1419
odo.7563164). 1420
HG96b [318] Henry Garrett, “SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1421
odo.7563160). 1422
odo.7563160). 1424
HG94b [320] Henry Garrett, “Overlook On SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 1425
10.5281/zenodo.7563160). 1426
HG93b [321] Henry Garrett, “Neutrosophic SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 1427
10.5281/zenodo.7557063). 1428
HG92b [322] Henry Garrett, “Extreme SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 1429
10.5281/zenodo.7557009). 1430
HG91b [323] Henry Garrett, “Overlook On SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 1431
10.5281/zenodo.7539484). 1432
HG90b [324] Henry Garrett, “Neutrosophic Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1433
10.5281/zenodo.7523390). 1434

HG89b [325] Henry Garrett, “Extreme Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1435
10.5281/zenodo.7523390). 1436
HG88b [326] Henry Garrett, “Overlook On Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1437
10.5281/zenodo.7523390). 1438
HG87b [327] Henry Garrett, “Extreme SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1439
odo.7574952). 1440
HG86b [328] Henry Garrett, “Neutrosophic SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1441
10.5281/zenodo.7574992). 1442
odo.7523357). 1444
HG84b [330] Henry Garrett, “Overlook On SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1445
10.5281/zenodo.7523357). 1446
HG83b [331] Henry Garrett, “Neutrosophic Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1447
10.5281/zenodo.7504782). 1448
HG82b [332] Henry Garrett, “Extreme Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1449
10.5281/zenodo.7504782). 1450
HG81b [333] Henry Garrett, “Overlook On Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1451
10.5281/zenodo.7504782). 1452
HG80b [334] Henry Garrett, “Neutrosophic SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1453
10.5281/zenodo.7499395). 1454
HG79b [335] Henry Garrett, “Extreme SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1455
odo.7499395). 1456
HG78b [336] Henry Garrett, “Overlook On SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1457
10.5281/zenodo.7499395). 1458
HG77b [337] Henry Garrett, “Neutrosophic Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1459
10.5281/zenodo.7497450). 1460
HG76b [338] Henry Garrett, “Extreme Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1461
10.5281/zenodo.7497450). 1462
HG75b [339] Henry Garrett, “Neutrosophic SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1463
10.5281/zenodo.7494862). 1464
HG74b [340] Henry Garrett, “Extreme SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1465
odo.7494862). 1466
HG73b [341] Henry Garrett, “Overlook On SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1467
10.5281/zenodo.7494862). 1468
HG72b [342] Henry Garrett, “Neutrosophic SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 1469
10.5281/zenodo.7493845). 1470

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

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

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

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

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

CHAPTER 5 1607
Extreme Strict Dimension Dominating 1608
Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of SuperHyperDu- 1609
ality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, ResearchGate 1610
2023, (doi: 10.13140/RG.2.2.34953.52320). 1611

Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph By 1612
SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchGate 2023, 1613
(doi: 10.13140/RG.2.2.33275.80161). 1614
Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 1615
10.13140/RG.2.2.11050.90569). 1617
Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of SuperHyperJoin 1618
10.13140/RG.2.2.17761.79206). 1620
10.13140/RG.2.2.19911.37285). 1623
Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect 1624
10.13140/RG.2.2.23266.81602). 1626
10.13140/RG.2.2.19360.87048). 1629
Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal 1630
10.13140/RG.2.2.32363.21286). 1632
10.13140/RG.2.2.11758.69441). 1635
Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of SuperHyperConnected 1636
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 1637
10.13140/RG.2.2.31891.35367). 1638
10.13140/RG.2.2.21510.45125). 1641
51
Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDominating 1642
10.13140/RG.2.2.13121.84321). 1644

CHAPTER 6 1645
New Ideas On Super Dimity By Hyper 1646
Dimple Of Strict Dimension Dominating 1647
In Recognition of Cancer With 1648
(Neutrosophic) SuperHyperGraph 1649
53
CHAPTER 7 1650
ABSTRACT 1651
In this scientific research, (Different Neutrosophic Types of Neutrosophic SuperHyperStrict 1652

Dimension Dominating). Assume a Neutrosophic SuperHyperGraph (NSHG) S is a Strict Dimension 1653
0
Dominating pair S = (V, E). Consider a Neutrosophic SuperHyperSet V = {V1 , V2 , . . . , Vs } and 1654
0 0 0
E = {E1 , E2 , . . . , Ez }. Then either V or E is called Neutrosophic e-SuperHyperStrict Dimension 1655
Dominating if the following expression is called Neutrosophic e-SuperHyperStrict Dimension Dominating 1656
criteria holds 1657
∀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-SuperHyperStrict Dimension Dominating if the following expression is called Neutro- 1658
sophic e-SuperHyperStrict Dimension Dominating criteria holds 1659

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

SuperHyperStrict Dimension Dominating if the following expression is called Neutrosophic v- 1661
SuperHyperStrict Dimension Dominating criteria holds 1662
∀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-SuperHyperStrict Dimension Dominating if the following expression is called Neutro- 1663
sophic v-SuperHyperStrict Dimension Dominating criteria holds 1664

and |Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; Neutrosophic Super- 1665
HyperStrict Dimension Dominating if it’s either of Neutrosophic e-SuperHyperStrict Dimension Dominating, 1666
Neutrosophic re-SuperHyperStrict Dimension Dominating, Neutrosophic v-SuperHyperStrict Dimension Dom- 1667
inating, and Neutrosophic rv-SuperHyperStrict Dimension Dominating. ((Neutrosophic) SuperHyperStrict 1668
Dimension Dominating). Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 1669
55
Consider a Neutrosophic SuperHyperEdge (NSHE) E = {V1 , V2 , . . . , Vs }. Then E is called an Ex- 1670

treme SuperHyperStrict Dimension Dominating if it’s either of Neutrosophic e-SuperHyperStrict Dimension 1671
Dominating, Neutrosophic re-SuperHyperStrict Dimension Dominating, Neutrosophic v-SuperHyperStrict 1672
Dimension Dominating, and Neutrosophic rv-SuperHyperStrict Dimension Dominating and C(N SHG) for 1673
an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme cardinality of an 1674
Extreme SuperHyperSet S of high Extreme cardinality of the Extreme SuperHyperEdges in the 1675
consecutive Extreme sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices 1676

such that they form the Extreme SuperHyperStrict Dimension Dominating; a Neutrosophic Super- 1677
Neutrosophic re-SuperHyperStrict Dimension Dominating, Neutrosophic v-SuperHyperStrict Dimension 1679
Dominating, and Neutrosophic rv-SuperHyperStrict Dimension Dominating and C(N SHG) for a Neut- 1680
rosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic cardinality of the 1681
Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic car- 1682

dinality consecutive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such 1683
that they form the Neutrosophic SuperHyperStrict Dimension Dominating; an Extreme SuperHyperStrict 1684
Dimension Dominating SuperHyperPolynomial if it’s either of Neutrosophic e-SuperHyperStrict Dimension 1685
an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial con- 1688

tains the Extreme coefficients defined as the Extreme number of the maximum Extreme 1689
cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Ex- 1690
treme cardinality consecutive Extreme SuperHyperEdges and Extreme SuperHyperVertices 1691
such that they form the Extreme SuperHyperStrict Dimension Dominating; and the Extreme power 1692
is corresponded to its Extreme coefficient; a Neutrosophic SuperHyperStrict Dimension Dominat- 1693
ing SuperHyperPolynomial if it’s either of Neutrosophic e-SuperHyperStrict Dimension Dominating, 1694

Dominating, and Neutrosophic rv-SuperHyperStrict Dimension Dominating and C(N SHG) for a Neutro- 1696
sophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains 1697
the Neutrosophic coefficients defined as the Neutrosophic number of the maximum Neutro- 1698
sophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of 1699
high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and Neutrosophic 1700

SuperHyperVertices such that they form the Neutrosophic SuperHyperStrict Dimension Dominat- 1701
ing; and the Neutrosophic power is corresponded to its Neutrosophic coefficient; an Extreme 1702
V-SuperHyperStrict Dimension Dominating if it’s either of Neutrosophic e-SuperHyperStrict Dimension 1703
Dimension Dominating, and Neutrosophic rv-SuperHyperStrict Dimension Dominating and C(N SHG) for an 1705
Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme cardinality of an Extreme 1706
SuperHyperSet S of high Extreme cardinality of the Extreme SuperHyperVertices in the consecut- 1707
ive Extreme sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that 1708
they form the Extreme SuperHyperStrict Dimension Dominating; a Neutrosophic V-SuperHyperStrict 1709
Dimension Dominating if it’s either of Neutrosophic e-SuperHyperStrict Dimension Dominating, Neutrosophic 1710
re-SuperHyperStrict Dimension Dominating, Neutrosophic v-SuperHyperStrict Dimension Dominating, and 1711

Neutrosophic rv-SuperHyperStrict Dimension Dominating and C(N SHG) for a Neutrosophic Super- 1712
HyperGraph N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic 1713
SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consec- 1714
utive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form 1715

the Neutrosophic SuperHyperStrict Dimension Dominating; an Extreme V-SuperHyperStrict Dimension 1716

Dominating SuperHyperPolynomial if it’s either of Neutrosophic e-SuperHyperStrict Dimension Dominat- 1717
ing, Neutrosophic re-SuperHyperStrict Dimension Dominating, Neutrosophic v-SuperHyperStrict Dimension 1718
Dominating, and Neutrosophic rv-SuperHyperStrict Dimension Dominating and C(N SHG) for an Extreme 1719
SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme 1720
coefficients defined as the Extreme number of the maximum Extreme cardinality of the Extreme 1721
SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality consecutive 1722

Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the Extreme 1723
SuperHyperStrict Dimension Dominating; and the Extreme power is corresponded to its Extreme coef- 1724
ficient; a Neutrosophic SuperHyperStrict Dimension Dominating SuperHyperPolynomial if it’s either of 1725
Neutrosophic e-SuperHyperStrict Dimension Dominating, Neutrosophic re-SuperHyperStrict Dimension Dom- 1726
inating, Neutrosophic v-SuperHyperStrict Dimension Dominating, and Neutrosophic rv-SuperHyperStrict 1727
Dimension Dominating and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the 1728
Neutrosophic SuperHyperPolynomial contains the Neutrosophic coefficients defined as the 1729
Neutrosophic number of the maximum Neutrosophic cardinality of the Neutrosophic SuperHy- 1730
perVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive 1731
Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form 1732
the Neutrosophic SuperHyperStrict Dimension Dominating; and the Neutrosophic power is corres- 1733
ponded to its Neutrosophic coefficient. In this scientific research, new setting is introduced 1734
for new SuperHyperNotions, namely, a SuperHyperStrict Dimension Dominating and Neutrosophic 1735
SuperHyperStrict Dimension Dominating. Two different types of SuperHyperDefinitions are debut 1736
for them but the research goes further and the SuperHyperNotion, SuperHyperUniform, and 1737
SuperHyperClass based on that are well-defined and well-reviewed. The literature review is 1738
implemented in the whole of this research. For shining the elegancy and the significancy of this 1739
research, the comparison between this SuperHyperNotion with other SuperHyperNotions and 1740
fundamental SuperHyperNumbers are featured. The definitions are followed by the examples 1741
and the instances thus the clarifications are driven with different tools. The applications are 1742
figured out to make sense about the theoretical aspect of this ongoing research. The “Cancer’s 1743
Recognition” are the under research to figure out the challenges make sense about ongoing and 1744
“Neutrosophic SuperHyperGraph” are chosen and elected to research about “Cancer’s Recog- 1749
nition”. Thus these complex and dense SuperHyperModels open up some avenues to research 1750
on theoretical segments and “Cancer’s Recognition”. Some avenues are posed to pursue this 1751
research. It’s also officially collected in the form of some questions and some problems. Assume 1752
a SuperHyperGraph. Assume a SuperHyperGraph. Then δ−SuperHyperStrict Dimension Dominating 1753
is a maximal of SuperHyperVertices with a maximum cardinality such that either of the 1754
following expressions hold for the (Neutrosophic) cardinalities of SuperHyperNeighbors of 1755
s ∈ S : there are |S ∩ N (s)| > |S ∩ (V \ N (s))| + δ; and |S ∩ N (s)| < |S ∩ (V \ N (s))| + δ. The 1756
first Expression, holds if S is an δ−SuperHyperOffensive. And the second Expression, holds 1757
if S is an δ−SuperHyperDefensive; a Neutrosophic δ−SuperHyperStrict Dimension Dominating is a 1758
maximal Neutrosophic of SuperHyperVertices with maximum Neutrosophic cardinality such 1759
that either of the following expressions hold for the Neutrosophic cardinalities of SuperHy- 1760
perNeighbors of s ∈ S there are: |S ∩ N (s)|N eutrosophic > |S ∩ (V \ N (s))|N eutrosophic + δ; 1761

and |S ∩ N (s)|N eutrosophic < |S ∩ (V \ N (s))|N eutrosophic + δ. The first Expression, holds 1762
if S is a Neutrosophic δ−SuperHyperOffensive. And the second Expression, holds if S is a 1763
Neutrosophic δ−SuperHyperDefensive It’s useful to define a “Neutrosophic” version of a 1764
SuperHyperStrict Dimension Dominating . Since there’s more ways to get type-results to make a 1765
SuperHyperStrict Dimension Dominating more understandable. For the sake of having Neutrosophic 1766
SuperHyperStrict Dimension Dominating, there’s a need to “redefine” the notion of a “SuperHyperStrict 1767
Dimension Dominating ”. The SuperHyperVertices and the SuperHyperEdges are assigned by the 1768
labels from the letters of the alphabets. In this procedure, there’s the usage of the position 1769
of labels to assign to the values. Assume a SuperHyperStrict Dimension Dominating . It’s redefined 1770
a Neutrosophic SuperHyperStrict Dimension Dominating if the mentioned Table holds, concerning, 1771
“The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges Belong to 1772
The Neutrosophic SuperHyperGraph” with the key points, “The Values of The Vertices & 1773
The Number of Position in Alphabet”, “The Values of The SuperVertices&The maximum 1774
SuperHyperStrict Dimension Dominating . It’s the main. It’ll be disciplinary to have the foundation of 1779
previous definition in the kind of SuperHyperClass. If there’s a need to have all SuperHyperStrict 1780
Dimension Dominating until the SuperHyperStrict Dimension Dominating, then it’s officially called a “Super- 1781
HyperStrict Dimension Dominating” but otherwise, it isn’t a SuperHyperStrict Dimension Dominating . There 1782
are some instances about the clarifications for the main definition titled a “SuperHyperStrict 1783
Dimension Dominating ”. These two examples get more scrutiny and discernment since there are 1784
characterized in the disciplinary ways of the SuperHyperClass based on a SuperHyperStrict 1785
Dimension Dominating . For the sake of having a Neutrosophic SuperHyperStrict Dimension Dominating, 1786
there’s a need to “redefine” the notion of a “Neutrosophic SuperHyperStrict Dimension Dominating” 1787
and a “Neutrosophic SuperHyperStrict Dimension Dominating ”. The SuperHyperVertices and the 1788
And a SuperHyperStrict Dimension Dominating are redefined to a “Neutrosophic SuperHyperStrict 1792

Dimension Dominating” if the intended Table holds. It’s useful to define “Neutrosophic” version 1793
of SuperHyperClasses. Since there’s more ways to get Neutrosophic type-results to make a 1794
Neutrosophic SuperHyperStrict Dimension Dominating more understandable. Assume a Neutrosophic 1795
SuperHyperGraph. There are some Neutrosophic SuperHyperClasses if the intended Table holds. 1796
Thus SuperHyperPath, SuperHyperStrict Dimension Dominating, SuperHyperStar, SuperHyperBi- 1797

partite, SuperHyperMultiPartite, and SuperHyperWheel, are “Neutrosophic SuperHyperPath”, 1798
“Neutrosophic SuperHyperStrict Dimension Dominating”, “Neutrosophic SuperHyperStar”, “Neutro- 1799
sophic SuperHyperBipartite”, “Neutrosophic SuperHyperMultiPartite”, and “Neutrosophic 1800
SuperHyperWheel” if the intended Table holds. A SuperHyperGraph has a “Neutrosophic Su- 1801
perHyperStrict Dimension Dominating” where it’s the strongest [the maximum Neutrosophic value from 1802
all the SuperHyperStrict Dimension Dominating amid the maximum value amid all SuperHyperVertices 1803
from a SuperHyperStrict Dimension Dominating .] SuperHyperStrict Dimension Dominating . A graph is a 1804
are the same. Assume a Neutrosophic SuperHyperGraph. There are some SuperHyperClasses 1806
as follows. It’s SuperHyperPath if it’s only one SuperVertex as intersection amid two given 1807

SuperHyperEdges with two exceptions; it’s SuperHyperStrict Dimension Dominating if it’s only one 1808
SuperVertex as intersection amid two given SuperHyperEdges; it’s SuperHyperStar it’s only one 1809
SuperVertex as intersection amid all SuperHyperEdges; it’s SuperHyperBipartite it’s only one 1810
SuperVertex as intersection amid two given SuperHyperEdges and these SuperVertices, forming 1811
two separate sets, has no SuperHyperEdge in common; it’s SuperHyperMultiPartite it’s only 1812
one SuperVertex as intersection amid two given SuperHyperEdges and these SuperVertices, 1813
cancer on the complex tracks and between complicated groups of cells could be fantasized by 1833
a Neutrosophic SuperHyperPath(-/SuperHyperStrict Dimension Dominating, SuperHyperStar, Super- 1834
HyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find either the 1835
longest SuperHyperStrict Dimension Dominating or the strongest SuperHyperStrict Dimension Dominating 1836
in those Neutrosophic SuperHyperModels. For the longest SuperHyperStrict Dimension Dominating, 1837
called SuperHyperStrict Dimension Dominating, and the strongest SuperHyperStrict Dimension Dominating, 1838
called Neutrosophic SuperHyperStrict Dimension Dominating, some general results are introduced. 1839
Beyond that in SuperHyperStar, all possible SuperHyperPaths have only two SuperHyperEdges 1840
but it’s not enough since it’s essential to have at least three SuperHyperEdges to form any 1841
style of a SuperHyperStrict Dimension Dominating. There isn’t any formation of any SuperHyperStrict 1842
Dimension Dominating but literarily, it’s the deformation of any SuperHyperStrict Dimension Dominating. It, 1843
literarily, deforms and it doesn’t form. A basic familiarity with Neutrosophic SuperHyperStrict 1844
Dimension Dominating theory, SuperHyperGraphs, and Neutrosophic SuperHyperGraphs theory are 1845
proposed. 1846
Keywords: Neutrosophic SuperHyperGraph, SuperHyperStrict Dimension Dominating, Cancer’s 1847
Neutrosophic Recognition 1848


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

Then the research has taken more motivations to define SuperHyperClasses and to find some 1910
connections amid this SuperHyperNotion with other SuperHyperNotions. It motivates us to get 1911
some instances and examples to make clarifications about the framework of this research. The 1912
general results and some results about some connections are some avenues to make key point of 1913
this research, “Cancer’s Recognition”, more understandable and more clear. 1914
The framework of this research is as follows. In the beginning, I introduce basic definitions 1915
to clarify about preliminaries. In the subsection “Preliminaries”, initial definitions about 1916
SuperHyperGraphs and Extreme SuperHyperGraph are deeply-introduced and in-depth- 1917
discussed. The elementary concepts are clarified and illustrated completely and sometimes 1918
review literature are applied to make sense about what’s going to figure out about the upcoming 1919
sections. The main definitions and their clarifications alongside some results about new 1920
notions, SuperHyperStrict Dimension Dominating and Extreme SuperHyperStrict Dimension Dominating, are 1921
figured out in sections “ SuperHyperStrict Dimension Dominating” and “Extreme SuperHyperStrict 1922
Dimension Dominating”. In the sense of tackling on getting results and in Strict Dimension Dominating 1923
to make sense about continuing the research, the ideas of SuperHyperUniform and Extreme 1924
SuperHyperUniform are introduced and as their consequences, corresponded SuperHyperClasses 1925
are figured out to debut what’s done in this section, titled “Results on SuperHyperClasses” 1926
and “Results on Extreme SuperHyperClasses”. As going back to origin of the notions, 1927

there are some smart steps toward the common notions to extend the new notions in new 1928
frameworks, SuperHyperGraph and Extreme SuperHyperGraph, in the sections “Results on 1929
SuperHyperClasses” and “Results on Extreme SuperHyperClasses”. The starter research 1930
about the general SuperHyperRelations and as concluding and closing section of theoretical 1931
research are contained in the section “General Results”. Some general SuperHyperRelations 1932
are fundamental and they are well-known as fundamental SuperHyperNotions as elicited 1933
and discussed in the sections, “General Results”, “ SuperHyperStrict Dimension Dominating”, 1934
“Extreme SuperHyperStrict Dimension Dominating”, “Results on SuperHyperClasses” and “Results 1935
on Extreme SuperHyperClasses”. There are curious questions about what’s done about the 1936
SuperHyperNotions to make sense about excellency of this research and going to figure out 1937
the word “best” as the description and adjective for this research as presented in section, 1938
“ SuperHyperStrict Dimension Dominating”. The keyword of this research debut in the section 1939
“Applications in Cancer’s Recognition” with two cases and subsections “Case 1: The Initial 1940
Steps Toward SuperHyperBipartite as SuperHyperModel” and “Case 2: The Increasing Steps 1941
Toward SuperHyperMultipartite as SuperHyperModel”. In the section, “Open Problems”, there 1942
are some scrutiny and discernment on what’s done and what’s happened in this research in 1943
the terms of “questions” and “problems” to make sense to figure out this research in featured 1944
style. The advantages and the limitations of this research alongside about what’s done in this 1945
research to make sense and to get sense about what’s figured out are included in the section, 1946
“Conclusion and Closing Remarks”. 1947

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

terization of the Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG11s],Definition 2.7,p.3), 1954
[t-norm](Ref.[HG11s], Definition 2.7, p.3), and [Characterization of the Neutrosophic Super- 1955
HyperGraph (NSHG)](Ref.[HG11s],Definition 2.7,p.3), [Neutrosophic Strength of the Neutro- 1956
sophic SuperHyperPaths] (Ref.[HG11s],Definition 5.3,p.7), and [Different Neutrosophic Types 1957
of Neutrosophic SuperHyperEdges (NSHE)] (Ref.[HG11s],Definition 5.4,p.7). Also, the new 1958
ideas and their clarifications are addressed to Ref.[HG38]. 1959

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

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

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

Let X be a Strict 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). 1963
Assume V 0 is a given set. a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E), 1964
where 1965
0
(i) V = {V1 , V2 , . . . , Vn } a finite set of finite single valued Neutrosophic subsets of V ; 1966
(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); 1967
(iii) E = {E1 , E2 , . . . , En0 } a finite set of finite single valued Neutrosophic subsets of V ; 1968
(iv) E = {(Ei0 , TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 )) : TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 ) ≥ 0}, (i 0
= 1969
0
1, 2, . . . , n ); 1970
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 1971
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 1972

P
(vii) i supp(Vi ) = V, (i = 1, 2, . . . , n); 1973
0 0
P
(viii) i0 supp(Ei ) = V, (i = 1, 2, . . . , n ); 1974
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 . 1975
Here the Neutrosophic SuperHyperEdges (NSHE) Ej 0 and the Neutrosophic SuperHyperVertices 1976
(NSHV) Vj are single valued Neutrosophic sets. TV 0 (Vi ), IV 0 (Vi ), and FV 0 (Vi ) denote the 1977
degree of truth-membership, the degree of indeterminacy-membership and the degree of 1978
falsity-membership the Neutrosophic SuperHyperVertex (NSHV) Vi to the Neutrosophic 1979

SuperHyperVertex (NSHV) V. TV0 (Ei0 ), TV0 (Ei0 ), and TV0 (Ei0 ) denote the degree of truth- 1980
membership, the degree of indeterminacy-membership and the degree of falsity-membership 1981
of the Neutrosophic SuperHyperEdge (NSHE) Ei0 to the Neutrosophic SuperHyperEdge 1982
(NSHE) E. Thus, the ii0 th element of the Strict Dimension Dominating of Neutrosophic 1983
SuperHyperGraph (NSHG) are of the form (Vi , TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 )), the sets V and E 1984
are crisp sets. 1985

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

(Ref.[HG11s],Definition 2.7,p.3). 1987
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). The Neutro- 1988
sophic SuperHyperEdges (NSHE) Ei0 and the Neutrosophic SuperHyperVertices (NSHV) Vi of 1989
Neutrosophic SuperHyperGraph (NSHG) S = (V, E) could be characterized as follow-up items. 1990
(i) If |Vi | = 1, then Vi is called vertex; 1991
(ii) if |Vi | ≥ 1, then Vi is called SuperVertex; 1992
(iii) if for all Vi s are incident in Ei0 , |Vi | = 1, and |Ei0 | = 2, then Ei0 is called edge; 1993
(iv) if for all Vi s are incident in Ei0 , |Vi | = 1, and |Ei0 | ≥ 2, then Ei0 is called HyperEdge; 1994
(v) if there’s a Vi is incident in Ei0 such that |Vi | ≥ 1, and |Ei0 | = 2, then Ei0 is called 1995
SuperEdge; 1996
(vi) if there’s a Vi is incident in Ei0 such that |Vi | ≥ 1, and |Ei0 | ≥ 2, then Ei0 is called 1997
SuperHyperEdge. 1998
If we choose different types of binary operations, then we could get hugely diverse types of 1999
general forms of Neutrosophic SuperHyperGraph (NSHG). 2000
Definition 9.0.7 (t-norm). (Ref.[HG11s], Definition 2.7, p.3). 2001

A binary operation ⊗ : [0, 1] × [0, 1] → [0, 1] is a t-norm if it satisfies the following for 2002
x, y, z, w ∈ [0, 1]: 2003
(i) 1 ⊗ x = x; 2004
(ii) x ⊗ y = y ⊗ x; 2005
(iii) x ⊗ (y ⊗ z) = (x ⊗ y) ⊗ z; 2006
(iv) If w ≤ x and y ≤ z then w ⊗ y ≤ x ⊗ z. 2007

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

where 2010

(i) V = {V1 , V2 , . . . , Vn } a finite set of finite single valued Neutrosophic subsets of V 0 ; 2011
(iv) E = {(Ei0 , TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 )) : TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 ) ≥ 0}, (i0 = 2014
1, 2, . . . , n0 ); 2015
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 2016
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 2017
P
(vii) i supp(Vi ) = V, (i = 1, 2, . . . , n); 2018
0 0
P
(viii) i0 supp(Ei ) = V, (i = 1, 2, . . . , n ). 2019
0

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

Definition 9.0.12. A graph is SuperHyperUniform if it’s SuperHyperGraph and the number 2046
of elements of SuperHyperEdges are the same. 2047
To get more visions on SuperHyperUniform, the some SuperHyperClasses are introduced. It 2048
makes to have SuperHyperUniform more understandable. 2049
Definition 9.0.13. Assume a Neutrosophic SuperHyperGraph. There are some SuperHyper- 2050
Classes as follows. 2051
(i). It’s Neutrosophic SuperHyperPath if it’s only one SuperVertex as intersection amid 2052
two given SuperHyperEdges with two exceptions; 2053
(ii). it’s SuperHyperCycle if it’s only one SuperVertex as intersection amid two given 2054
SuperHyperEdges; 2055
(iii). it’s SuperHyperStar it’s only one SuperVertex as intersection amid all SuperHyperEdges; 2056
(iv). it’s SuperHyperBipartite it’s only one SuperVertex as intersection amid two given Supe- 2057
rHyperEdges and these SuperVertices, forming two separate sets, has no SuperHyperEdge 2058
in common; 2059
(v). it’s SuperHyperMultiPartite it’s only one SuperVertex as intersection amid two 2060
given SuperHyperEdges and these SuperVertices, forming multi separate sets, has no 2061
SuperHyperEdge in common; 2062
(vi). it’s SuperHyperWheel if it’s only one SuperVertex as intersection amid two given 2063
SuperHyperEdges and one SuperVertex has one SuperHyperEdge with any common 2064
SuperVertex. 2065
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 2066
(NSHV) V1 to Neutrosophic SuperHyperVertex (NSHV) Vs if either of following conditions hold: 2067
(i) Vi , Vi+1 ∈ Ei0 ; 2068
(ii) there’s a vertex vi ∈ Vi such that vi , Vi+1 ∈ Ei0 ; 2069
(iii) there’s a SuperVertex Vi0 ∈ Vi such that Vi0 , Vi+1 ∈ Ei0 ; 2070
(iv) there’s a vertex vi+1 ∈ Vi+1 such that Vi , vi+1 ∈ Ei0 ; 2071
0 0
(v) there’s a SuperVertex Vi+1 ∈ Vi+1 such that Vi , Vi+1 ∈ E i0 ; 2072
(vi) there are a vertex vi ∈ Vi and a vertex vi+1 ∈ Vi+1 such that vi , vi+1 ∈ Ei0 ; 2073
0 0
(vii) there are a vertex vi ∈ Vi and a SuperVertex Vi+1 ∈ Vi+1 such that vi , Vi+1 ∈ Ei0 ; 2074
(viii) there are a SuperVertex Vi0 ∈ Vi and a vertex vi+1 ∈ Vi+1 such that Vi0 , vi+1 ∈ Ei0 ; 2075
(ix) there are a SuperVertex Vi0 ∈ Vi and a SuperVertex Vi+1

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

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. 2077
(i) If for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | = 2, then NSHP is called path; 2078
(ii) if for all Ej 0 , |Ej 0 | = 2, and there’s Vi , |Vi | ≥ 1, then NSHP is called SuperPath; 2079
(iii) if for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | ≥ 2, then NSHP is called HyperPath; 2080
(iv) if there are Vi , Ej 0 , |Vi | ≥ 1, |Ej 0 | ≥ 2, then NSHP is called Neutrosophic SuperHy- 2081
perPath . 2082
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 2083
(i) Neutrosophic t-strength (min{T (Vi )}, m, n)si=1 ; 2084
(ii) Neutrosophic i-strength (m, min{I(Vi )}, n)si=1 ; 2085
(iii) Neutrosophic f-strength (m, n, min{F (Vi )})si=1 ; 2086
(iv) Neutrosophic strength (min{T (Vi )}, min{I(Vi )}, min{F (Vi )})si=1 . 2087
Definition 9.0.17 (Different Neutrosophic Types of Neutrosophic SuperHyperEdges (NSHE)). 2088

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

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


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

(xii) Neutrosophic Connective if (T (E), I(E), F (E)) ≥ maximum number of Neutrosophic 2101
strength of SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex (NSHV) Vi 2102
to Neutrosophic SuperHyperVertex (NSHV) Vj where 1 ≤ i, j ≤ s. 2103
Definition 9.0.18. (Different Neutrosophic Types of Neutrosophic SuperHyperStrict Dimension 2104

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

or E 0 is called 2108
(i) Neutrosophic e-SuperHyperStrict Dimension Dominating if the following expression is 2109

called Neutrosophic e-SuperHyperStrict Dimension Dominating criteria holds 2110

(ii) Neutrosophic re-SuperHyperStrict Dimension Dominating if the following expression is 2111

called Neutrosophic re-SuperHyperStrict Dimension Dominating criteria holds 2112

and |Ei |NEUTROSOPHIC CARDINALITY = |Ej |NEUTROSOPHIC CARDINALITY ; 2113
(iii) Neutrosophic v-SuperHyperStrict Dimension Dominating if the following expression is 2114
called Neutrosophic v-SuperHyperStrict Dimension Dominating criteria holds 2115

(iv) Neutrosophic rv-SuperHyperStrict Dimension Dominating if the following expression is 2116

and |Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; 2118
(v) Neutrosophic SuperHyperStrict Dimension Dominating if it’s either of Neutrosophic e- 2119

SuperHyperStrict Dimension Dominating, Neutrosophic re-SuperHyperStrict Dimension Dominating, 2120
Neutrosophic v-SuperHyperStrict Dimension Dominating, and Neutrosophic rv-SuperHyperStrict 2121
Dimension Dominating. 2122

Definition 9.0.19. ((Neutrosophic) SuperHyperStrict Dimension Dominating). 2123

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

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

Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 2132
Extreme SuperHyperStrict Dimension Dominating; 2133
(ii) a Neutrosophic SuperHyperStrict Dimension Dominating if it’s either of Neutrosophic 2134

e-SuperHyperStrict Dimension Dominating, Neutrosophic re-SuperHyperStrict Dimension Dominating, 2135
Dimension Dominating and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 2137
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a 2138

Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive Neutrosophic 2139
SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the 2140
Neutrosophic SuperHyperStrict Dimension Dominating; 2141
(iii) an Extreme SuperHyperStrict Dimension Dominating SuperHyperPolynomial if 2142

it’s either of Neutrosophic e-SuperHyperStrict Dimension Dominating, Neutrosophic re- 2143
SuperHyperStrict Dimension Dominating, Neutrosophic v-SuperHyperStrict Dimension Dominating, and 2144
Neutrosophic rv-SuperHyperStrict Dimension Dominating and C(N SHG) for an Extreme Super- 2145
HyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme 2146
coefficients defined as the Extreme number of the maximum Extreme cardinality of the 2147
Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme cardinal- 2148
ity consecutive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that 2149
they form the Extreme SuperHyperStrict Dimension Dominating; and the Extreme power is 2150
corresponded to its Extreme coefficient; 2151
(iv) a Neutrosophic SuperHyperStrict Dimension Dominating SuperHyperPolynomial 2152

if it’s either of Neutrosophic e-SuperHyperStrict Dimension Dominating, Neutrosophic re- 2153
Neutrosophic rv-SuperHyperStrict Dimension Dominating and C(N SHG) for a Neutrosophic 2155
SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains 2156
sophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet 2158

S of high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and Neutro- 2159
sophic SuperHyperVertices such that they form the Neutrosophic SuperHyperStrict Dimension 2160
Dominating; and the Neutrosophic power is corresponded to its Neutrosophic coefficient; 2161
(v) an Extreme V-SuperHyperStrict Dimension Dominating if it’s either of Neutrosophic 2162



cardinality of the Extreme SuperHyperVertices in the consecutive Extreme sequence of 2167
(vi) a Neutrosophic V-SuperHyperStrict Dimension Dominating if it’s either of Neutrosophic 2170


is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a 2174
(vii) an Extreme V-SuperHyperStrict Dimension Dominating SuperHyperPolynomial if 2178

Neutrosophic rv-SuperHyperStrict Dimension Dominating and C(N SHG) for an Extreme Su- 2181
perHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the 2182
Extreme coefficients defined as the Extreme number of the maximum Extreme cardinality 2183
of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme 2184
cardinality consecutive Extreme SuperHyperEdges and Extreme SuperHyperVertices such 2185

that they form the Extreme SuperHyperStrict Dimension Dominating; and the Extreme power is 2186
(viii) a Neutrosophic SuperHyperStrict Dimension Dominating SuperHyperPolynomial 2188

the Neutrosophic coefficients defined as the Neutrosophic number of the maximum Neut- 2193
rosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHy- 2194
perSet S of high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges 2195
and Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHy- 2196
perStrict Dimension Dominating; and the Neutrosophic power is corresponded to its Neutrosophic 2197
coefficient. 2198
Definition 9.0.20. ((Extreme/Neutrosophic)δ−SuperHyperStrict Dimension Dominating). 2199

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

SuperHyperStrict Dimension Dominating such that either of the following expressions hold for 2202
the Neutrosophic cardinalities of SuperHyperNeighbors of s ∈ S : 2203
|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 2204
(29.1), holds if S is an δ−SuperHyperDefensive; 2205

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 δ−SuperHyperStrict Dimension Dominating is a Neutrosophic kind 2206

of Neutrosophic SuperHyperStrict Dimension Dominating such that either of the following 2207
Neutrosophic expressions hold for the Neutrosophic cardinalities of SuperHyperNeighbors 2208
of s ∈ S : 2209
|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 2210

the Expression (29.1), holds if S is a Neutrosophic δ−SuperHyperDefensive. 2211
For the sake of having a Neutrosophic SuperHyperStrict Dimension Dominating, there’s a need to 2212
“redefine” the notion of “Neutrosophic SuperHyperGraph”. The SuperHyperVertices and the 2213
there’s the usage of the position of labels to assign to the values. 2215
136DEF1 Definition 9.0.21. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 2216
It’s redefined Neutrosophic SuperHyperGraph if the Table (29.1) holds. 2217
It’s useful to define a “Neutrosophic” version of SuperHyperClasses. Since there’s more ways 2218
to get Neutrosophic type-results to make a Neutrosophic more understandable. 2219
136DEF2 Definition 9.0.22. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = 2220

(V, E). There are some Neutrosophic SuperHyperClasses if the Table (29.2) holds. 2221
Thus Neutrosophic SuperHyperPath , SuperHyperStrict Dimension Dominating, SuperHyperStar, 2222

SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, are Neutrosophic 2223
SuperHyperPath, Neutrosophic SuperHyperCycle, Neutrosophic SuperHyperStar, 2224
Neutrosophic SuperHyperBipartite, Neutrosophic SuperHyperMultiPartite, and 2225
Neutrosophic SuperHyperWheel if the Table (29.2) holds. 2226
It’s useful to define a “Neutrosophic” version of a Neutrosophic SuperHyperStrict Dimension 2227
Dominating. Since there’s more ways to get type-results to make a Neutrosophic SuperHyperStrict 2228
Dimension Dominating more Neutrosophicly understandable. 2229
“redefine” the Neutrosophic notion of “Neutrosophic SuperHyperStrict Dimension Dominating”. The 2231
2234

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

136TBL4

136TBL1
136DEF1 Definition 9.0.23. Assume a SuperHyperStrict Dimension Dominating. It’s redefined a Neutrosophic 2235
SuperHyperStrict Dimension Dominating if the Table (29.3) holds. 2236

CHAPTER 10 2237
Extreme SuperHyper But As The Strict Dimension Dominating 2238
Extensions Excerpt From Dense And 2239
Super Forms 2240
Definition 10.0.1. (Extreme event). 2241
Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) 2242
is a probability Strict Dimension Dominating. Any Extreme k-subset of A of V is called Extreme 2243
k-event and if k = 2, then Extreme subset of A of V is called Extreme event. The following 2244
expression is called Extreme probability of A. 2245
X
E(A) = E(a). (10.1)
a∈A
Definition 10.0.2. (Extreme Independent). 2246

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

s-independent if the following expression is called Extreme s-independent criteria 2249
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 2250
following expression is called Extreme independent criteria 2251
E(A ∩ B) = P (A)P (B). (10.2)
Definition 10.0.3. (Extreme Variable). 2252

is a probability Strict Dimension Dominating. Any k-function Strict Dimension Dominating like E is called 2254
Extreme k-Variable. If k = 2, then any 2-function Strict Dimension Dominating like E is called 2255
Extreme Variable. 2256
The notion of independent on Extreme Variable is likewise. 2257
Definition 10.0.4. (Extreme Expectation). 2258
Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) is 2259
77
a probability Strict Dimension Dominating. an Extreme k-Variable E has a number is called Extreme 2260
Expectation if the following expression is called Extreme Expectation criteria 2261
X
Ex(E) = E(α)P (α).
α∈V
Definition 10.0.5. (Extreme Crossing). 2262

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

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

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

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

as to obtain a simple Extreme SuperHyperGraph G with e(G) ≥ k − n. Now cr(G) ≤ n(n − 1) 2294
because G is formed from at most n SuperHyperCircles, and any two SuperHyperCircles cross 2295
at most twice. Thus either e(G) < 4n, in which case k < 5n < 5n4/3 , or n2 > n(n − 1) ≥ 2296
3
cr(G) ≥ (k − n) /64n2 by the Extreme Crossing Lemma, and k < 4n4/3 + n < 5n4/3 . 2297
Proposition 10.0.9. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). 2298
Consider S = (V, E) is a probability Strict Dimension Dominating. Let X be a nonnegative Extreme 2299
Variable and t a positive real number. Then 2300
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. 2301
Corollary 10.0.10. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). 2302
Consider S = (V, E) is a probability Strict Dimension Dominating. Let Xn be a nonnegative integer- 2303
valued variable in a probability Strict Dimension Dominating (Vn , En ), n ≥ 1. If E(Xn ) → 0 as n → ∞, 2304
then P (Xn = 0) → 1 as n → ∞. 2305
Proof. 2306
Consider S = (V, E) is a probability Strict Dimension Dominating. A special SuperHyperGraph in Gn,p 2308
almost surely has stability number at most d2p−1 log ne. 2309

S = (V, E) is a probability Strict Dimension Dominating. A special SuperHyperGraph in Gn,p is 2311
up. Let G ∈ Gn,p and let S be a given SuperHyperSet of k + 1 SuperHyperVertices of G, 2312
where k ∈ N. The probability that S is a stable SuperHyperSet of G is (1 − p)(k+1)choose2 , this 2313
being the probability that none of the (k + 1)choose2 pairs of SuperHyperVertices of S is a 2314
SuperHyperEdge of the Extreme SuperHyperGraph G. 2315
Let AS denote the event that S is a stable SuperHyperSet of G, and let XS denote the indicator 2316
Extreme Variable for this Extreme Event. By equation, we have 2317
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 2318
X
X= {XS : S ⊆ V, |S| = k + 1}
and so, by those, 2319
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: 2320
nk+1
(n choose k+1) ≤ and1 − p ≤ e−p .
(k + 1)!
This yields the following upper bound on E(X). 2321
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 2322
least as fast as the logarithm of n, implies that E(X) → 0 as n → ∞. Because X is integer-valued 2323
and nonnegative, we deduce from Corollary that P (X = 0) → 1 as n → ∞. Consequently, an 2324
Extreme SuperHyperGraph in Gn,p almost surely has stability number at most k. 2325
Definition 10.0.12. (Extreme Variance). 2326

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

S = (V, E) is a probability Strict Dimension Dominating. Let X be an Extreme Variable and let t be a 2334
positive real number. Then 2335
2
2 Ex((X − Ex(X)) ) V (X)
E(|X − Ex(X)| ≥ t) = E((X − Ex(X)) ≥ t2 ) ≤ 2
= .
t t2
2336
Consider S = (V, E) is a probability Strict Dimension Dominating. Let Xn be an Extreme Variable in a 2338
probability Strict Dimension Dominating (Vn , En ), n ≥ 1. If Ex(Xn ) 6= 0 and V (Xn ) << E 2 (Xn ), then 2339
E(Xn = 0) → 0 as n → ∞
S = (V, E) is a probability Strict Dimension Dominating. Set X := Xn and t := |Ex(Xn )| in 2341
Chebyshev’s Inequality, and observe that E(Xn = 0) ≤ E(|Xn − Ex(Xn )| ≥ |Ex(Xn )|) because 2342
|Xn − Ex(Xn )| = |Ex(Xn )| when Xn = 0. 2343
Consider S = (V, E) is a probability Strict Dimension Dominating. Let G ∈ Gn,1/2 . For 0 ≤ k ≤ n, set 2345
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 2346
one. Then almost surely α(G) takes one of the three values k ∗ − 2, k ∗ − 1, k ∗ . 2347
S = (V, E) is a probability Strict Dimension Dominating. As in the proof of related Theorem, the 2349
result is straightforward. 2350
Consider S = (V, E) is a probability Strict Dimension Dominating. Let G ∈ Gn,1/2 and let f and k ∗ be 2352
as defined in previous Theorem. Then either: 2353
(i). f (k ∗ ) << 1, in which case almost surely α(G) is equal to either k ∗ − 2 or k ∗ − 1, or 2354
(ii). f (k ∗ − 1) >> 1, in which case almost surely α(G) is equal to either k ∗ − 1 or k ∗ . 2355
S = (V, E) is a probability Strict Dimension Dominating. The latter is straightforward. 2357
Definition 10.0.17. (Extreme Threshold). 2358
a probability Strict Dimension Dominating. Let P be a monotone property of SuperHyperGraphs (one 2360
which is preserved when SuperHyperEdges are added). Then a Extreme Threshold for P is 2361
a function f (n) such that: 2362
(i). if p << f (n), then G ∈ Gn,p almost surely does not have P, 2363
(ii). if p >> f (n), then G ∈ Gn,p almost surely has P. 2364

Definition 10.0.18. (Extreme Balanced). 2365

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

is a threshold function for the property of containing F as an Extreme SubSuperHyperGraph. 2373
136EXM1 Example 10.0.20. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E) in 2376
the mentioned Extreme Figures in every Extreme items. 2377
• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperStrict 2378
Dimension Dominating, is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 2379
are some empty Extreme SuperHyperEdges but E2 is a loop Extreme SuperHyperEdge and 2380
E4 is an Extreme SuperHyperEdge. Thus in the terms of Extreme SuperHyperNeighbor, 2381
there’s only one Extreme SuperHyperEdge, namely, E4 . The Extreme SuperHyperVertex, 2382
V3 is Extreme isolated means that there’s no Extreme SuperHyperEdge has it as an 2383
Extreme endpoint. Thus the Extreme SuperHyperVertex, V3 , is excluded in every given 2384
Extreme SuperHyperStrict Dimension Dominating. 2385
C(N SHG)Extreme Strict Dimension Dominating =

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

SuperHyperEdge. Thus in the terms of Extreme SuperHyperNeighbor, there’s only 2390
one Extreme SuperHyperEdge, namely, E4 . The Extreme SuperHyperVertex, V3 is 2391
Extreme isolated means that there’s no Extreme SuperHyperEdge has it as an Extreme 2392
endpoint. Thus the Extreme SuperHyperVertex, V3 , is excluded in every given Extreme 2393
SuperHyperStrict Dimension Dominating. 2394

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

{}.
= 0z 0 .
{}.
= 0z 0 .
2398



{}.
= 0z 0 .
{}.
= 0z 0 .
2401

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

= z 7−c .
2404

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

{EN SHG − {Ei }}.

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

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

= z 3−a .
2413

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

{EN SHG − {E1 , E5 }}.



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

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


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

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


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

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


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

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


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

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


{V2 , V17 , V7 , V27 }.

= z 2−a .
2440

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


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

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


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

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


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

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

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

(V, E). There’s only one Extreme SuperHyperEdge E ∈ EESHG:(V,E) has only the maximum 2462
possibilities of the distinct interior Extreme SuperHyperVertices inside of any given Extreme 2463
quasi-R-Strict Dimension Dominating minus all Extreme SuperHypeNeighbor to some of them but not 2464
all of them. In other words, there’s only an unique Extreme SuperHyperEdge E ∈ EESHG:(V,E) 2465
has only two distinct Extreme SuperHyperVertices in an Extreme quasi-R-Strict Dimension Dominating, 2466
minus all Extreme SuperHypeNeighbor to some of them but not all of them. 2467
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-Strict Dimension Dominating is at least
V \ (V \ {aE , bE , cE , . . . , zE }).
It’s straightforward that the Extreme cardinality of the Extreme R-Strict Dimension Dominating is at least 2468
the maximum Extreme number of Extreme SuperHyperVertices of the Extreme SuperHyperEdges 2469
with the maximum number of the Extreme SuperHyperEdges. In other words, the maximum 2470

SuperHyperStrict Dimension Dominating in the Extreme Example (42.0.3) 95NHG2
number of the Extreme SuperHyperEdges contains the maximum Extreme number of Extreme 2471
SuperHyperVertices are renamed to Extreme Strict Dimension Dominating in some cases but the 2472
maximum number of the Extreme SuperHyperEdge with the maximum Extreme number of 2473
Extreme SuperHyperVertices, has the Extreme SuperHyperVertices are contained in an Extreme 2474
R-Strict Dimension Dominating. 2475
Proposition 10.0.24. Assume a simple Extreme SuperHyperGraph ESHG : (V, E). Then the
Extreme number of type-result-R-Strict Dimension Dominating has, the least Extreme cardinality, the
lower sharp Extreme bound for Extreme cardinality, is the Extreme cardinality of
V \ V \ {aE , bE 0 , cE 00 , cE 000 }E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .
If there’s an Extreme type-result-R-Strict Dimension Dominating with the least Extreme cardinality, the 2476
lower sharp Extreme bound for cardinality. 2477
Proposition 10.0.25. Assume a connected loopless Extreme SuperHyperGraph ESHG : (V, E). 2478
Then in the worst case, literally, 2479
C(N SHG)ExtremeQuasi−StrictDimensionDominating
= {V1 , E1 , V2 , E2 , V3 , E3 , V4 , E4 , V1 }.
C(N SHG)ExtremeQuasi−StrictDimensionDominatingSuperHyperP olynomial = z 4 .
C(N SHG)ExtremeQuasi−StrictDimensionDominating = {V1 , V2 , V3 , V4 , V1 }.
C(N SHG)ExtremeR−Quasi−StrictDimensionDominatingSuperHyperP olynomial = z 5 .

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

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

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

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

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

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

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

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

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

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

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

2484
Extreme R-Strict Dimension Dominating =

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

is fixed that means Ex = E ∈ EESHG:(V,E) . for all Extreme intended SuperHyperVertices
but in an Extreme Strict Dimension Dominating, Ex = E ∈ EESHG:(V,E) could be different and it’s
not unique. To sum them up, in a connected Extreme SuperHyperGraph ESHG : (V, E). If
an Extreme SuperHyperEdge E ∈ EESHG:(V,E) has z Extreme SuperHyperVertices, then the
Extreme cardinality of the Extreme R-Strict Dimension Dominating is at least
V \ (V \ {aE , bE , cE , . . . , zE }).
It’s straightforward that the Extreme cardinality of the Extreme R-Strict Dimension Dominating 2485
is at least the maximum Extreme number of Extreme SuperHyperVertices of the Extreme 2486
SuperHyperEdges with the maximum number of the Extreme SuperHyperEdges. In other 2487
words, the maximum number of the Extreme SuperHyperEdges contains the maximum Extreme 2488
number of Extreme SuperHyperVertices are renamed to Extreme Strict Dimension Dominating in some 2489
cases but the maximum number of the Extreme SuperHyperEdge with the maximum Extreme 2490
number of Extreme SuperHyperVertices, has the Extreme SuperHyperVertices are contained in 2491
an Extreme R-Strict Dimension Dominating. 2492
The obvious SuperHyperGraph has no Extreme SuperHyperEdges. But the non-obvious 2493
Extreme SuperHyperModel is up. The quasi-SuperHyperModel addresses some issues about 2494
the Extreme optimal SuperHyperObject. It specially delivers some remarks on the Extreme 2495
SuperHyperSet of the Extreme SuperHyperVertices such that there’s distinct amount of Extreme 2496
SuperHyperEdges for distinct amount of Extreme SuperHyperVertices up to all taken from that 2497
Extreme SuperHyperSet of the Extreme SuperHyperVertices but this Extreme SuperHyperSet of 2498
the Extreme SuperHyperVertices is either has the maximum Extreme SuperHyperCardinality or 2499
it doesn’t have maximum Extreme SuperHyperCardinality. In a non-obvious SuperHyperModel, 2500
there’s at least one Extreme SuperHyperEdge containing at least all Extreme SuperHyperVertices. 2501
Thus it forms an Extreme quasi-R-Strict Dimension Dominating where the Extreme completion of the 2502
Extreme incidence is up in that. Thus it’s, literarily, an Extreme embedded R-Strict Dimension 2503
Dominating. The SuperHyperNotions of embedded SuperHyperSet and quasi-SuperHyperSet 2504
coincide. In the original setting, these types of SuperHyperSets only don’t satisfy on the 2505
maximum SuperHyperCardinality. Thus the embedded setting is elected such that those 2506
SuperHyperSets have the maximum Extreme SuperHyperCardinality and they’re Extreme 2507
SuperHyperOptimal. The less than two distinct types of Extreme SuperHyperVertices are 2508
included in the minimum Extreme style of the embedded Extreme R-Strict Dimension Dominating. 2509
The interior types of the Extreme SuperHyperVertices are deciders. Since the Extreme number 2510
of SuperHyperNeighbors are only affected by the interior Extreme SuperHyperVertices. The 2511
common connections, more precise and more formal, the perfect unique connections inside 2512
the Extreme SuperHyperSet for any distinct types of Extreme SuperHyperVertices pose the 2513
Extreme R-Strict Dimension Dominating. Thus Extreme exterior SuperHyperVertices could be used 2514
only in one Extreme SuperHyperEdge and in Extreme SuperHyperRelation with the interior 2515
Extreme SuperHyperVertices in that Extreme SuperHyperEdge. In the embedded Extreme 2516
Strict Dimension Dominating, there’s the usage of exterior Extreme SuperHyperVertices since they’ve 2517

more connections inside more than outside. Thus the title “exterior” is more relevant than 2518
the title “interior”. One Extreme SuperHyperVertex has no connection, inside. Thus, the 2519
Extreme SuperHyperSet of the Extreme SuperHyperVertices with one SuperHyperElement 2520
has been ignored in the exploring to lead on the optimal case implying the Extreme R-Strict 2521
Dimension Dominating. The Extreme R-Strict Dimension Dominating with the exclusion of the exclusion 2522
of all Extreme SuperHyperVertices in one Extreme SuperHyperEdge and with other terms, 2523
the Extreme R-Strict Dimension Dominating with the inclusion of all Extreme SuperHyperVertices in 2524
one Extreme SuperHyperEdge, is an Extreme quasi-R-Strict Dimension Dominating. To sum them 2525
up, in a connected non-obvious Extreme SuperHyperGraph ESHG : (V, E). There’s only 2526
one Extreme SuperHyperEdge E ∈ EESHG:(V,E) has only the maximum possibilities of the 2527
distinct interior Extreme SuperHyperVertices inside of any given Extreme quasi-R-Strict Dimension 2528
Dominating minus all Extreme SuperHypeNeighbor to some of them but not all of them. In other 2529
words, there’s only an unique Extreme SuperHyperEdge E ∈ EESHG:(V,E) has only two distinct 2530
Extreme SuperHyperVertices in an Extreme quasi-R-Strict Dimension Dominating, minus all Extreme 2531
SuperHypeNeighbor to some of them but not all of them. 2532
The main definition of the Extreme R-Strict Dimension Dominating has two titles. an Extreme quasi-R- 2533
Strict Dimension Dominating and its corresponded quasi-maximum Extreme R-SuperHyperCardinality 2534
are two titles in the terms of quasi-R-styles. For any Extreme number, there’s an Extreme 2535
quasi-R-Strict Dimension Dominating with that quasi-maximum Extreme SuperHyperCardinality in 2536

the terms of the embedded Extreme SuperHyperGraph. If there’s an embedded Extreme 2537
SuperHyperGraph, then the Extreme quasi-SuperHyperNotions lead us to take the collection of 2538
all the Extreme quasi-R-Strict Dimension Dominatings for all Extreme numbers less than its Extreme 2539
corresponded maximum number. The essence of the Extreme Strict Dimension Dominating ends up 2540
but this essence starts up in the terms of the Extreme quasi-R-Strict Dimension Dominating, again 2541
and more in the operations of collecting all the Extreme quasi-R-Strict Dimension Dominatings acted 2542
on the all possible used formations of the Extreme SuperHyperGraph to achieve one Extreme 2543
number. This Extreme number is 2544
considered as the equivalence class for all corresponded quasi-R-Strict Dimension Dominatings. 2545
Let zExtreme Number , SExtreme SuperHyperSet and GExtreme Strict Dimension Dominating be an Extreme 2546
number, an Extreme SuperHyperSet and an Extreme Strict Dimension Dominating. Then 2547
[zExtreme Number ]Extreme Class = {SExtreme SuperHyperSet |

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

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

To get more precise perceptions, the follow-up expressions propose another formal technical 2550
definition for the Extreme Strict Dimension Dominating. 2551
GExtreme Strict Dimension Dominating =

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

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

= max zExtreme Number

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


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


2557

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

2558


2559


Now, the extension of these types of approaches is up. Since the new term, “Extreme Super- 2560
HyperNeighborhood”, could be redefined as the collection of the Extreme SuperHyperVertices 2561
such that any amount of its Extreme SuperHyperVertices are incident to an Extreme SuperHy- 2562
perEdge. It’s, literarily, another name for “Extreme Quasi-Strict Dimension Dominating” but, precisely, 2563
it’s the generalization of “Extreme Quasi-Strict Dimension Dominating” since “Extreme Quasi-Strict 2564
Dimension Dominating” happens “Extreme Strict Dimension Dominating” in an Extreme SuperHyperGraph 2565
as initial framework and background but “Extreme SuperHyperNeighborhood” may not happens 2566
“Extreme Strict Dimension Dominating” in an Extreme SuperHyperGraph as initial framework and 2567
preliminarily background since there are some ambiguities about the Extreme SuperHyperCar- 2568
dinality arise from it. To get orderly keywords, the terms, “Extreme SuperHyperNeighborhood”, 2569
“Extreme Quasi-Strict Dimension Dominating”, and “Extreme Strict Dimension Dominating” are up. 2570
Thus, let 2571

zExtreme Number , NExtreme SuperHyperNeighborhood and 2572
GExtreme Strict Dimension Dominating be an Extreme number, an Extreme SuperHyperNeighborhood 2573
and an Extreme Strict Dimension Dominating and the new terms are up. 2574
GExtreme Strict 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 |
2575

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

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

2578

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

2579


2580


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

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

type-SuperHyperSet called the Extreme Strict 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-Strict Dimension Dominating is up. To sum them up,
the Extreme SuperHyperSet of Extreme SuperHyperVertices,
Is the non-obvious simple Extreme type-SuperHyperSet of the Extreme R-Strict 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-Strict Dimension Dominating C(ESHG) for an Extreme SuperHyperGraph
ESHG : (V, E) is the Extreme SuperHyperSet S of Extreme SuperHyperVertices such
that there’s no an Extreme SuperHyperEdge for some Extreme SuperHyperVertices instead of
all given by that Extreme type-SuperHyperSet called the Extreme Strict Dimension Dominating and
it’s an Extreme Strict Dimension Dominating. Since it’s
the maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme Su-

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

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

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

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

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

Assume a connected Extreme SuperHyperGraph ESHG : (V, E). Let an Extreme SuperHy- 2594
perEdge ESHE : E ∈ EESHG:(V,E) has some Extreme SuperHyperVertices r. Consider all 2595
Extreme numbers of those Extreme SuperHyperVertices from that Extreme SuperHyperEdge 2596
excluding excluding more than r distinct Extreme SuperHyperVertices, exclude to any given 2597
Extreme SuperHyperSet of the Extreme SuperHyperVertices. Consider there’s an Extreme 2598
R-Strict Dimension Dominating with the least cardinality, the lower sharp Extreme bound for Extreme 2599
cardinality. Assume a connected Extreme SuperHyperGraph ESHG : (V, E). The Extreme 2600
SuperHyperSet of the Extreme SuperHyperVertices VESHE \ {z} is an Extreme SuperHyperSet 2601
S of the Extreme SuperHyperVertices such that there’s an Extreme SuperHyperEdge to have 2602
some Extreme SuperHyperVertices uniquely but it isn’t an Extreme R-Strict Dimension Dominating. 2603
Since it doesn’t have 2604
2605

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

perVertices such that there’s an Extreme SuperHyperEdge to have some SuperHyperVertices 2607
uniquely. The Extreme SuperHyperSet of the Extreme SuperHyperVertices VESHE ∪ {z} is 2608
the maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme SuperHyper- 2609
Vertices but it isn’t an Extreme R-Strict Dimension Dominating. Since it doesn’t do the Extreme 2610
procedure such that such that there’s an Extreme SuperHyperEdge to have some Extreme 2611
SuperHyperVertices uniquely [there are at least one Extreme SuperHyperVertex outside 2612
implying there’s, sometimes in the connected Extreme SuperHyperGraph ESHG : (V, E), 2613
an Extreme SuperHyperVertex, titled its Extreme SuperHyperNeighbor, to that Extreme 2614
SuperHyperVertex in the Extreme SuperHyperSet S so as S doesn’t do “the Extreme pro- 2615
cedure”.]. There’s only one Extreme SuperHyperVertex outside the intended Extreme 2616
SuperHyperSet, VESHE ∪ {z}, in the terms of Extreme SuperHyperNeighborhood. Thus the 2617
obvious Extreme R-Strict Dimension Dominating, VESHE is up. The obvious simple Extreme type- 2618
SuperHyperSet of the Extreme R-Strict Dimension Dominating, VESHE , is an Extreme SuperHyperSet, 2619
VESHE , includes only all Extreme SuperHyperVertices does forms any kind of Extreme 2620
pairs are titled Extreme SuperHyperNeighbors in a connected Extreme SuperHyperGraph 2621
ESHG : (V, E). Since the Extreme SuperHyperSet of the Extreme SuperHyperVertices VESHE , 2622
is the maximum Extreme SuperHyperCardinality of an Extreme SuperHyperSet S of 2623
Extreme SuperHyperVertices such that there’s an Extreme SuperHyperEdge to have some 2624
Extreme SuperHyperVertices uniquely. Thus, in a connected Extreme SuperHyperGraph 2625
ESHG : (V, E). Any Extreme R-Strict Dimension Dominating only contains all interior Extreme 2626
SuperHyperVertices and all exterior Extreme SuperHyperVertices from the unique Extreme 2627
SuperHyperEdge where there’s any of them has all possible Extreme SuperHyperNeighbors in 2628
and there’s all Extreme SuperHyperNeighborhoods in with no exception minus all Extreme 2629
SuperHypeNeighbors to some of them not all of them but everything is possible about Extreme 2630
SuperHyperNeighborhoods and Extreme SuperHyperNeighbors out. 2631
The SuperHyperNotion, namely, Strict Dimension Dominating, is up. There’s neither empty Su- 2632
perHyperEdge nor loop SuperHyperEdge. The following Extreme SuperHyperSet of Ex- 2633
treme SuperHyperEdges[SuperHyperVertices] is the simple Extreme type-SuperHyperSet 2634
of the Extreme Strict Dimension Dominating. The Extreme SuperHyperSet of Extreme SuperHy- 2635
perEdges[SuperHyperVertices], 2636
|EESHG:(V,E) |Extreme Cardinality
b c
= {E2i−1 }i=1 2
.
C(N SHG)ExtremeQuasi−StrictDimensionDominatingSuperHyperP olynomial
= 2z b 2 c
.
C(N SHG)ExtremeR−Quasi−StrictDimensionDominating = {Vi }si=1 , {Vj }tj=1 .
C(N SHG)ExtremeR−Quasi−StrictDimensionDominatingSuperHyperP olynomial
= az s + bz t .
is the simple Extreme type-SuperHyperSet of the Extreme Strict Dimension Dominating. The Extreme 2637
SuperHyperSet of the Extreme SuperHyperEdges[SuperHyperVertices], 2638

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

ESHG : (V, E) is an Extreme type-SuperHyperSet with 2640
2641
the maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme Su- 2642
perHyperEdges[SuperHyperVertices] such that there’s no Extreme SuperHyperVertex of an 2643

Extreme SuperHyperEdge is common and there’s an Extreme SuperHyperEdge for all Extreme 2644
SuperHyperVertices. There are not only two Extreme SuperHyperVertices inside the intended 2645
Extreme SuperHyperSet. Thus the non-obvious Extreme Strict Dimension Dominating is up. The 2646
obvious simple Extreme type-SuperHyperSet called the Extreme Strict Dimension Dominating is an 2647
Extreme SuperHyperSet includes only two Extreme SuperHyperVertices. But the Extreme 2648
SuperHyperSet of the Extreme SuperHyperEdges[SuperHyperVertices], 2649
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- 2650
Set. Thus the non-obvious simple Extreme type-SuperHyperSet of the Extreme Strict Dimension 2651
Dominating is up. To sum them up, the Extreme SuperHyperSet of the Extreme SuperHy- 2652
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 Strict Dimension Dominating. 2654
Since the Extreme SuperHyperSet of the Extreme SuperHyperEdges[SuperHyperVertices], 2655
b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Is an Extreme Strict Dimension Dominating C(ESHG) for an Extreme SuperHyperGraph ESHG : 2656
(V, E) is the Extreme SuperHyperSet S of Extreme SuperHyperVertices such that there’s 2657
no an Extreme SuperHyperEdge for some Extreme SuperHyperVertices given by that Ex- 2658
treme type-SuperHyperSet called the Extreme Strict Dimension Dominating and it’s an Extreme 2659
Strict Dimension Dominating. Since it’s 2660
2661
the maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme Su- 2662
perHyperEdges[SuperHyperVertices] such that there’s no Extreme SuperHyperVertex of an 2663

Extreme SuperHyperEdge is common and there’s an Extreme SuperHyperEdge for all Extreme 2664
SuperHyperVertices. There aren’t only less than three Extreme SuperHyperVertices inside the 2665
intended Extreme SuperHyperSet, 2666
b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Thus the non-obvious Extreme Strict Dimension Dominating , 2667
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 Strict Dimension Dominating , 2668
not: 2669
b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Is the Extreme SuperHyperSet, not: 2670
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 2671
ESHG : (V, E). It’s interesting to mention that the only non-obvious simple Extreme type- 2672
SuperHyperSet called the 2673
“Extreme Strict Dimension Dominating ” 2674
amid those obvious[non-obvious] simple Extreme type-SuperHyperSets called the 2675
Extreme ,
Strict Dimension Dominating 2676
is only and only 2677
b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
In a connected Extreme SuperHyperGraph ESHG : (V, E). 2678

CHAPTER 11 2679
The Extreme Departures on The 2680
Theoretical Results Toward Theoretical 2681
Motivations 2682
The previous Extreme approach apply on the upcoming Extreme results on Extreme 2683
SuperHyperClasses. 2684
Proposition 11.0.1. Assume a connected Extreme SuperHyperPath ESHP : (V, E). Then 2685

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

in the Example (42.0.5)
Dimension Dominating 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 2688
new way to redefine as 2689
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 2690
to ViEXT ERN AL in the literatures of SuperHyperStrict Dimension Dominating. The latter is 2691
straightforward. 2692
136EXM18a Example 11.0.2. In the Figure (31.1), the connected Extreme SuperHyperPath ESHP : (V, E), 2693
is highlighted and featured. The Extreme SuperHyperSet, in the Extreme SuperHyperModel 2694
(31.1), is the SuperHyperStrict Dimension Dominating. 2695
Proposition 11.0.3. Assume a connected Extreme SuperHyperCycle ESHC : (V, E). Then 2696

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

136EXM19a Example 11.0.4. In the Figure (31.2), the connected Extreme SuperHyperCycle N SHC : 2704
(V, E), is highlighted and featured. The obtained Extreme SuperHyperSet, in the Extreme 2705
SuperHyperModel (31.2), is the Extreme SuperHyperStrict Dimension Dominating. 2706

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

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

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

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

SuperHyperStrict 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 2710
way to redefine as 2711

136EXM20a Example 11.0.6. In the Figure (31.3), the connected Extreme SuperHyperStar ESHS : (V, E), 2715
is highlighted and featured. The obtained Extreme SuperHyperSet, by the Algorithm in previous 2716
Extreme result, of the Extreme SuperHyperVertices of the connected Extreme SuperHyperStar 2717
ESHS : (V, E), in the Extreme SuperHyperModel (31.3), is the Extreme SuperHyperStrict 2718
Proposition 11.0.7. Assume a connected Extreme SuperHyperBipartite ESHB : (V, E). Then 2720

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


= z b−a .
{VN SHG − {VPi , VPj }i6=j }.
= z b−a .
Proof. Let 2721
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
2722
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 2723
a new way to redefine as 2724

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

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

Extreme SuperHyperStrict Dimension Dominating in the Example (42.0.11) 136NSHG21a
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
The latter is straightforward. 2734
136EXM21a Example 11.0.8. In the Extreme Figure (31.4), the connected Extreme SuperHyperBipartite 2735
ESHB : (V, E), is Extreme highlighted and Extreme featured. The obtained Extreme 2736
SuperHyperSet, by the Extreme Algorithm in previous Extreme result, of the Extreme 2737
SuperHyperVertices of the connected Extreme SuperHyperBipartite ESHB : (V, E), in the 2738
Extreme SuperHyperModel (31.4), is the Extreme SuperHyperStrict Dimension Dominating. 2739
Proposition 11.0.9. Assume a connected Extreme SuperHyperMultipartite ESHM : (V, E). 2740
Then 2741

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

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

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

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

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

SuperHyperStrict Dimension Dominating in the Example (42.0.13) 136NSHG22a
136EXM22a Example 11.0.10. In the Figure (31.5), the connected Extreme SuperHyperMultipartite 2757
ESHM : (V, E), is highlighted and Extreme featured. The obtained Extreme SuperHyperSet, by 2758
the Algorithm in previous Extreme result, of the Extreme SuperHyperVertices of the connected 2759
Extreme SuperHyperMultipartite ESHM : (V, E), in the Extreme SuperHyperModel (31.5), is 2760
the Extreme SuperHyperStrict Dimension Dominating. 2761
Proposition 11.0.11. Assume a connected Extreme SuperHyperWheel ESHW : (V, E ∪ E ∗ ). 2762

Then, 2763

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

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

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

straightforward. Then there’s at least one SuperHyperStrict Dimension Dominating. Thus the notion 2769
of quasi isn’t up and the SuperHyperNotions based on SuperHyperStrict Dimension Dominating 2770
could be applied. The unique embedded SuperHyperStrict Dimension Dominating proposes some 2771
longest SuperHyperStrict Dimension Dominating excerpt from some representatives. The latter is 2772
136EXM23a Example 11.0.12. In the Extreme Figure (31.6), the connected Extreme SuperHyperWheel 2774
N SHW : (V, E), is Extreme highlighted and featured. The obtained Extreme SuperHyperSet, 2775
by the Algorithm in previous result, of the Extreme SuperHyperVertices of the connected 2776
Extreme SuperHyperWheel ESHW : (V, E), in the Extreme SuperHyperModel (31.6), is the 2777
Extreme SuperHyperStrict Dimension Dominating. 2778

CHAPTER 12 2779
The Surveys of Mathematical Sets On 2780
The Results But As The Initial Motivation 2781
For the SuperHyperStrict Dimension Dominating, Extreme SuperHyperStrict Dimension Dominating, and the 2782
Extreme SuperHyperStrict Dimension Dominating, some general results are introduced. 2783
Remark 12.0.1. Let remind that the Extreme SuperHyperStrict Dimension Dominating is “redefined” 2784
on the positions of the alphabets. 2785
Corollary 12.0.2. Assume Extreme SuperHyperStrict Dimension Dominating. Then 2786
Extreme SuperHyperStrictDimensionDominating =
{theSuperHyperStrictDimensionDominatingof theSuperHyperV ertices |
max |SuperHyperOf f ensive
SuperHyperStrictDimensionDominating
|ExtremecardinalityamidthoseSuperHyperStrictDimensionDominating. }
plus one Extreme SuperHypeNeighbor to one. Where σi is the unary operation on the 2787
SuperHyperVertices of the SuperHyperGraph to assign the determinacy, the indeterminacy 2788
and the neutrality, for i = 1, 2, 3, respectively. 2789
Corollary 12.0.3. Assume an Extreme SuperHyperGraph on the same identical letter of the 2790
alphabet. Then the notion of Extreme SuperHyperStrict Dimension Dominating and SuperHyperStrict 2791
Dimension Dominating coincide. 2792
alphabet. Then a consecutive sequence of the SuperHyperVertices is an Extreme SuperHyperStrict 2794
Dimension Dominating if and only if it’s a SuperHyperStrict Dimension Dominating. 2795
alphabet. Then a consecutive sequence of the SuperHyperVertices is a strongest SuperHyperStrict 2797
Dimension Dominating if and only if it’s a longest SuperHyperStrict Dimension Dominating. 2798
Corollary 12.0.6. Assume SuperHyperClasses of an Extreme SuperHyperGraph on the same 2799
identical letter of the alphabet. Then its Extreme SuperHyperStrict Dimension Dominating is its 2800
SuperHyperStrict Dimension Dominating and reversely. 2801
129
Corollary 12.0.7. Assume an Extreme SuperHyperPath(-/SuperHyperStrict Dimension Dominating, 2802

SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel) on the same 2803
identical letter of the alphabet. Then its Extreme SuperHyperStrict Dimension Dominating is its 2804
Corollary 12.0.8. Assume an Extreme SuperHyperGraph. Then its Extreme SuperHyperStrict 2806
isn’t well-defined if and only if its SuperHyperStrict Dimension Dominating isn’t well-
Dimension Dominating 2807
defined. 2808
Corollary 12.0.9. Assume SuperHyperClasses of an Extreme SuperHyperGraph. Then its 2809

Extreme SuperHyperStrict Dimension Dominating isn’t well-defined if and only if its SuperHyperStrict 2810
Dimension Dominating isn’t well-defined. 2811
SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). Then its 2813

Extreme SuperHyperStrict Dimension Dominating isn’t well-defined if and only if its SuperHyperStrict 2814
Corollary 12.0.11. Assume an Extreme SuperHyperGraph. Then its Extreme SuperHyperStrict 2816
is well-defined if and only if its SuperHyperStrict Dimension Dominating is well-defined.
Corollary 12.0.12. Assume SuperHyperClasses of an Extreme SuperHyperGraph. Then its 2818

Extreme SuperHyperStrict Dimension Dominating is well-defined if and only if its SuperHyperStrict 2819
Dimension Dominating is well-defined. 2820

Extreme SuperHyperStrict Dimension Dominating is well-defined if and only if its SuperHyperStrict 2823
Proposition 12.0.14. Let ESHG : (V, E) be an Extreme SuperHyperGraph. Then V is 2825
(i) : the dual SuperHyperDefensive SuperHyperStrict Dimension Dominating; 2826
(ii) : the strong dual SuperHyperDefensive SuperHyperStrict Dimension Dominating; 2827
(iii) : the connected dual SuperHyperDefensive SuperHyperStrict Dimension Dominating; 2828
(iv) : the δ-dual SuperHyperDefensive SuperHyperStrict Dimension Dominating; 2829
(v) : the strong δ-dual SuperHyperDefensive SuperHyperStrict Dimension Dominating; 2830
(vi) : the connected δ-dual SuperHyperDefensive SuperHyperStrict Dimension Dominating. 2831
Proposition 12.0.15. Let N T G : (V, E, σ, µ) be an Extreme SuperHyperGraph. Then ∅ is 2832
(i) : the SuperHyperDefensive SuperHyperStrict Dimension Dominating; 2833
(ii) : the strong SuperHyperDefensive SuperHyperStrict Dimension Dominating; 2834
(iii) : the connected defensive SuperHyperDefensive SuperHyperStrict Dimension Dominating; 2835
(iv) : the δ-SuperHyperDefensive SuperHyperStrict Dimension Dominating; 2836

(v) : the strong δ-SuperHyperDefensive SuperHyperStrict Dimension Dominating; 2837
(vi) : the connected δ-SuperHyperDefensive SuperHyperStrict Dimension Dominating. 2838
Proposition 12.0.16. Let ESHG : (V, E) be an Extreme SuperHyperGraph. Then an 2839

independent SuperHyperSet is 2840
(iii) : the connected SuperHyperDefensive SuperHyperStrict Dimension Dominating; 2843
Proposition 12.0.17. Let ESHG : (V, E) be an Extreme SuperHyperUniform SuperHyperGraph 2847

which is a SuperHyperStrict Dimension Dominating/SuperHyperPath. Then V is a maximal 2848
(i) : SuperHyperDefensive SuperHyperStrict Dimension Dominating; 2849
(ii) : strong SuperHyperDefensive SuperHyperStrict Dimension Dominating; 2850
(iii) : connected SuperHyperDefensive SuperHyperStrict Dimension Dominating; 2851
(iv) : O(ESHG)-SuperHyperDefensive SuperHyperStrict Dimension Dominating; 2852
(v) : strong O(ESHG)-SuperHyperDefensive SuperHyperStrict Dimension Dominating; 2853
(vi) : connected O(ESHG)-SuperHyperDefensive SuperHyperStrict Dimension Dominating; 2854
Where the exterior SuperHyperVertices and the interior SuperHyperVertices coincide. 2855
Proposition 12.0.18. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is a 2856
SuperHyperUniform SuperHyperWheel. Then V is a maximal 2857
(i) : dual SuperHyperDefensive SuperHyperStrict Dimension Dominating; 2858
(ii) : strong dual SuperHyperDefensive SuperHyperStrict Dimension Dominating; 2859
(iii) : connected dual SuperHyperDefensive SuperHyperStrict Dimension Dominating; 2860
(iv) : O(ESHG)-dual SuperHyperDefensive SuperHyperStrict Dimension Dominating; 2861
(v) : strong O(ESHG)-dual SuperHyperDefensive SuperHyperStrict Dimension Dominating; 2862
(vi) : connected O(ESHG)-dual SuperHyperDefensive SuperHyperStrict Dimension Dominating; 2863
which is a SuperHyperStrict Dimension Dominating/SuperHyperPath. Then the number of 2866

(i) : the SuperHyperStrict Dimension Dominating; 2867
(ii) : the SuperHyperStrict Dimension Dominating; 2868
(iii) : the connected SuperHyperStrict Dimension Dominating; 2869
(iv) : the O(ESHG)-SuperHyperStrict Dimension Dominating; 2870
(v) : the strong O(ESHG)-SuperHyperStrict Dimension Dominating; 2871
(vi) : the connected O(ESHG)-SuperHyperStrict Dimension Dominating. 2872
is one and it’s only V. Where the exterior SuperHyperVertices and the interior SuperHyperVertices 2873
coincide. 2874

which is a SuperHyperWheel. Then the number of 2876
(i) : the dual SuperHyperStrict Dimension Dominating; 2877
(ii) : the dual SuperHyperStrict Dimension Dominating; 2878
(iii) : the dual connected SuperHyperStrict Dimension Dominating; 2879
(iv) : the dual O(ESHG)-SuperHyperStrict Dimension Dominating; 2880
(v) : the strong dual O(ESHG)-SuperHyperStrict Dimension Dominating; 2881
(vi) : the connected dual O(ESHG)-SuperHyperStrict Dimension Dominating. 2882
coincide. 2884

which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperComplete 2886
SuperHyperMultipartite. Then a SuperHyperSet contains [the SuperHyperCenter and] the half of 2887
multiplying r with the number of all the SuperHyperEdges plus one of all the SuperHyperVertices 2888
is a 2889
O(ESHG)
(iv) : 2 + 1-dual SuperHyperDefensive SuperHyperStrict Dimension Dominating; 2893
O(ESHG)
(v) : strong 2 + 1-dual SuperHyperDefensive SuperHyperStrict Dimension Dominating; 2894
O(ESHG)
(vi) : connected 2 + 1-dual SuperHyperDefensive SuperHyperStrict Dimension Dominating. 2895


SuperHyperMultipartite. Then a SuperHyperSet contains the half of multiplying r with the 2898
number of all the SuperHyperEdges plus one of all the SuperHyperVertices in the biggest 2899
SuperHyperPart is a 2900
(iv) : δ-SuperHyperDefensive SuperHyperStrict Dimension Dominating; 2904
(v) : strong δ-SuperHyperDefensive SuperHyperStrict Dimension Dominating; 2905
(vi) : connected δ-SuperHyperDefensive SuperHyperStrict Dimension Dominating. 2906

SuperHyperMultipartite. Then Then the number of 2909
O(ESHG)
O(ESHG)
O(ESHG)
is one and it’s only S, a SuperHyperSet contains [the SuperHyperCenter and] the half of 2916
multiplying r with the number of all the SuperHyperEdges plus one of all the SuperHyperVertices. 2917
Proposition 12.0.24. Let ESHG : (V, E) be an Extreme SuperHyperGraph. The number of 2919
connected component is |V − S| if there’s a SuperHyperSet which is a dual 2920
(iv) : SuperHyperStrict Dimension Dominating; 2924
(v) : strong 1-SuperHyperDefensive SuperHyperStrict Dimension Dominating; 2925
(vi) : connected 1-SuperHyperDefensive SuperHyperStrict Dimension Dominating. 2926

Proposition 12.0.25. Let ESHG : (V, E) be an Extreme SuperHyperGraph. Then the number 2927
is at most O(ESHG) and the Extreme number is at most On (ESHG). 2928
Proposition 12.0.26. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is 2929
SuperHyperComplete. The number is O(ESHG:(V,E)) 2 + 1 and the Extreme number is 2930

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

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

2 + 1)-SuperHyperDefensive SuperHyperStrict Dimension Dominating. 2937
Proposition 12.0.27. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is ∅. The 2938
number is 0 and the Extreme number is 0, for an independent SuperHyperSet in the setting of 2939
dual 2940
(iv) : 0-SuperHyperDefensive SuperHyperStrict Dimension Dominating; 2944
Proposition 12.0.28. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is SuperHy- 2947
perComplete. Then there’s no independent SuperHyperSet. 2948
Proposition 12.0.29. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is SuperHy- 2949
perStrict Dimension Dominating/SuperHyperPath/SuperHyperWheel. The number is O(ESHG : (V, E)) 2950
and the Extreme number is On (ESHG : (V, E)), in the setting of a dual 2951
(iv) : O(ESHG : (V, E))-SuperHyperDefensive SuperHyperStrict Dimension Dominating; 2955
(v) : strong O(ESHG : (V, E))-SuperHyperDefensive SuperHyperStrict Dimension Dominating; 2956
(vi) : connected O(ESHG : (V, E))-SuperHyperDefensive SuperHyperStrict Dimension Dominating. 2957

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


Proposition 12.0.31. Let N SHF : (V, E) be a SuperHyperFamily of the ESHGs : (V, E) 2968
Extreme SuperHyperGraphs which are from one-type SuperHyperClass which the result is obtained 2969
for the individuals. Then the results also hold for the SuperHyperFamily N SHF : (V, E) of 2970
these specific SuperHyperClasses of the Extreme SuperHyperGraphs. 2971
Proposition 12.0.32. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph. If S is a dual 2972
SuperHyperDefensive SuperHyperStrict Dimension Dominating, then ∀v ∈ V \ S, ∃x ∈ S such that 2973
(i) v ∈ Ns (x); 2974
(ii) vx ∈ E. 2975
Proposition 12.0.33. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph. If S is a dual 2976
SuperHyperDefensive SuperHyperStrict Dimension Dominating, then 2977
(i) S is SuperHyperStrict Dimension Dominating set; 2978
(ii) there’s S ⊆ S 0 such that |S 0 | is SuperHyperChromatic number. 2979
Proposition 12.0.34. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph. Then 2980
(i) Γ ≤ O; 2981
(ii) Γs ≤ On . 2982
Proposition 12.0.35. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph which is 2983
connected. Then 2984
(i) Γ ≤ O − 1; 2985
(ii) Γs ≤ On − Σ3i=1 σi (x). 2986
Proposition 12.0.36. Let ESHG : (V, E) be an odd SuperHyperPath. Then 2987
(i) the SuperHyperSet S = {v2 , v4 , · · · , vn−1 } is a dual SuperHyperDefensive SuperHyperStrict 2988
Dimension Dominating; 2989

(ii) Γ = b n2 c + 1 and corresponded SuperHyperSet is S = {v2 , v4 , · · · , vn−1 }; 2990
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· ,vn−1 } Σ3i=1 σi (s)}; 2991
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn−1 } and S2 = {v1 , v3 , · · · , vn−1 } are only a dual 2992
Proposition 12.0.37. Let ESHG : (V, E) be an even SuperHyperPath. Then 2994
(i) the set S = {v2 , v4 , · · · .vn } is a dual SuperHyperDefensive SuperHyperStrict Dimension 2995
Dominating; 2996
(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · .vn } and {v1 , v3 , · · · .vn−1 }; 2997
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 2998
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 2999
Proposition 12.0.38. Let ESHG : (V, E) be an even SuperHyperStrict Dimension Dominating. Then 3001
(i) the SuperHyperSet S = {v2 , v4 , · · · , vn } is a dual SuperHyperDefensive SuperHyperStrict 3002
(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · , vn } and {v1 , v3 , · · · , vn−1 }; 3004
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } σ(s), Σs∈S={v1 ,v3 ,··· ,vn−1 } σ(s)}; 3005
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn } and S2 = {v1 , v3 , · · · , vn−1 } are only dual 3006
Proposition 12.0.39. Let ESHG : (V, E) be an odd SuperHyperStrict Dimension Dominating. Then 3008

(iii) Γs = min{Σs∈S={v2 ,v4 ,··· .vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 3012
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn−1 } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 3013
Proposition 12.0.40. Let ESHG : (V, E) be SuperHyperStar. Then 3015
(i) the SuperHyperSet S = {c} is a dual maximal SuperHyperStrict Dimension Dominating; 3016
(ii) Γ = 1; 3017
(iii) Γs = Σ3i=1 σi (c); 3018
(iv) the SuperHyperSets S = {c} and S ⊂ S 0 are only dual SuperHyperStrict Dimension Dominating. 3019
Proposition 12.0.41. Let ESHG : (V, E) be SuperHyperWheel. Then 3020

6+3(i−1)≤n
(i) the SuperHyperSet S = {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is a dual maximal 3021
SuperHyperDefensive SuperHyperStrict Dimension Dominating; 3022
6+3(i−1)≤n
(ii) Γ = |{v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 |; 3023
(iii) Γs = Σ{v1 ,v3 }∪{v6 ,v9 ··· ,vi+6 ,··· ,vn }6+3(i−1)≤n Σ3i=1 σi (s); 3024
i=1
6+3(i−1)≤n
(iv) the SuperHyperSet {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is only a dual maximal 3025
SuperHyperDefensive SuperHyperStrict Dimension Dominating. 3026
Proposition 12.0.42. Let ESHG : (V, E) be an odd SuperHyperComplete. Then 3027
b n c+1
(i) the SuperHyperSet S = {vi }i=1
2
is a dual SuperHyperDefensive SuperHyperStrict Dimension 3028
Dominating; 3029
(ii) Γ = b n2 c + 1; 3030
(iii) Γs = min{Σs∈S Σ3i=1 σi (s)} 2

b n c+1 ; 3031
S={vi }i=1
b n c+1
(iv) the SuperHyperSet S = {vi }i=1
2
is only a dual SuperHyperDefensive SuperHyperStrict 3032
Proposition 12.0.43. Let ESHG : (V, E) be an even SuperHyperComplete. Then 3034
bnc
2
Dominating; 3036
(ii) Γ = b n2 c; 3037

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

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

Dimension Dominating for N SHF; 3044
(ii) Γ = m for N SHF : (V, E); 3045
(iii) Γs = Σm 3
i=1 Σj=1 σj (ci ) for N SHF : (V, E); 3046
(iv) the SuperHyperSets S = {c1 , c2 , · · · , cm } and S ⊂ S 0 are only dual SuperHyperStrict Dimension 3047
Dominating for N SHF : (V, E). 3048
Proposition 12.0.45. Let N SHF : (V, E) be an m-SuperHyperFamily of odd SuperHyperCom- 3049
plete SuperHyperGraphs with common Extreme SuperHyperVertex SuperHyperSet. Then 3050

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

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

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

bnc for N SHF : (V, E); 3062
S={vi }i=1
bnc
2
are only dual maximal SuperHyperStrict Dimension Dominating 3063
for N SHF : (V, E). 3064
following statements hold; 3066
(i) if s ≥ t and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 3067

SuperHyperStrict Dimension Dominating, then S is an s-SuperHyperDefensive SuperHyperStrict 3068
(ii) if s ≤ t and a SuperHyperSet S of SuperHyperVertices is a dual t-SuperHyperDefensive 3070

SuperHyperStrict Dimension Dominating, then S is a dual s-SuperHyperDefensive SuperHyperStrict 3071
(i) if s ≥ t + 2 and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 3075
SuperHyperStrict Dimension Dominating, then S is an s-SuperHyperPowerful SuperHyperStrict 3076


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

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

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

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

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

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

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

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

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


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

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


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

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

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


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

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

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


CHAPTER 13 3141
Extreme Applications in Cancer’s 3142
Extreme Recognition 3143
The cancer is the Extreme disease but the Extreme model is going to figure out what’s going on 3144
this Extreme phenomenon. The special Extreme case of this Extreme disease is considered and 3145
as the consequences of the model, some parameters are used. The cells are under attack of this 3146
disease but the moves of the cancer in the special region are the matter of mind. The Extreme 3147
recognition of the cancer could help to find some Extreme treatments for this Extreme disease. 3148
In the following, some Extreme steps are Extreme devised on this disease. 3149
Step 1. (Extreme Definition) The Extreme recognition of the cancer in the long-term Extreme 3150
function. 3151
Step 2. (Extreme Issue) The specific region has been assigned by the Extreme model [it’s 3152
called Extreme SuperHyperGraph] and the long Extreme cycle of the move from the cancer 3153
is identified by this research. Sometimes the move of the cancer hasn’t be easily identified 3154
since there are some determinacy, indeterminacy and neutrality about the moves and the 3155
effects of the cancer on that region; this event leads us to choose another model [it’s said 3156
to be Extreme SuperHyperGraph] to have convenient perception on what’s happened and 3157
what’s done. 3158
Step 3. (Extreme Model) There are some specific Extreme models, which are well-known and 3159
they’ve got the names, and some general Extreme models. The moves and the Extreme 3160
traces of the cancer on the complex tracks and between complicated groups of cells 3161
could be fantasized by an Extreme SuperHyperPath(-/SuperHyperStrict Dimension Dominating, 3162
SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The 3163
aim is to find either the Extreme SuperHyperStrict Dimension Dominating or the Extreme 3164
SuperHyperStrict Dimension Dominating in those Extreme Extreme SuperHyperModels. 3165
141
CHAPTER 14 3166
Case 1: The Initial Extreme Steps 3167
Toward Extreme SuperHyperBipartite 3168
as Extreme SuperHyperModel 3169
Step 4. (Extreme Solution) In the Extreme Figure (34.1), the Extreme SuperHyperBipartite 3170
is Extreme highlighted and Extreme featured. 3171
By using the Extreme Figure (34.1) and the Table (34.1), the Extreme SuperHyperBipartite 3172
is obtained. 3173
The obtained Extreme SuperHyperSet, by the Extreme Algorithm in previous Extreme 3174
Figure 14.1: an Extreme SuperHyperBipartite Associated to the Notions of Extreme

SuperHyperStrict Dimension Dominating 136NSHGaa21aa
143
Belong to The Extreme SuperHyperBipartite

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

ESHB : (V, E), in the Extreme SuperHyperModel (34.1), is the Extreme SuperHyperStrict 3176

CHAPTER 15 3178
Case 2: The Increasing Extreme Steps 3179
Toward Extreme 3180
SuperHyperMultipartite as Extreme 3181
SuperHyperModel 3182
Step 4. (Extreme Solution) In the Extreme Figure (35.1), the Extreme SuperHyperMultipart- 3183
ite is Extreme highlighted and Extreme featured. 3184
By using the Extreme Figure (35.1) and the Table (35.1), the Extreme SuperHyperMulti- 3185
partite is obtained. 3186
The obtained Extreme SuperHyperSet, by the Extreme Algorithm in previous result, 3187
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 3188

ESHM : (V, E), in the Extreme SuperHyperModel (35.1), is the Extreme SuperHyperStrict 3189

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

CHAPTER 18 3239
Extreme SuperHyperDuality But As The 3240
Super Forms 3242
Definition 18.0.1. (Different Extreme Types of Extreme SuperHyperDuality). 3243

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

Va ∈ Ei , Ej ; 3247
(ii) Extreme re-SuperHyperDuality if ∀Ei ∈ E 0 , ∃Ej ∈ EESHG:(V,E) \ E 0 such that 3248
Va ∈ Ei , Ej and |Ei |Extreme CARDINALITY = |Ej |Extreme CARDINALITY ; 3249
(iii) Extreme v-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 3250
Vi , Vj ∈ Ea ; 3251
(iv) Extreme rv-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 3252
Vi , Vj ∈ Ea and |Vi |Extreme CARDINALITY = |Vj |Extreme CARDINALITY ; 3253
(v) Extreme SuperHyperDuality if it’s either of Extreme e-SuperHyperDuality, 3254
Extreme re-SuperHyperDuality, Extreme v-SuperHyperDuality, and Extreme rv- 3255

SuperHyperDuality. 3256
Definition 18.0.2. ((Extreme) SuperHyperDuality). 3257

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

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

re-SuperHyperDuality, Extreme v-SuperHyperDuality, and Extreme rv-SuperHyperDuality 3268
and C(N SHG) for a Extreme SuperHyperGraph N SHG : (V, E) is the maximum 3269
Extreme cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet 3270
S of high Extreme cardinality consecutive Extreme SuperHyperEdges and Extreme 3271
SuperHyperVertices such that they form the Extreme SuperHyperDuality; 3272
(iii) an Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of Extreme 3273

e-SuperHyperDuality, Extreme re-SuperHyperDuality, Extreme v-SuperHyperDuality, 3274
and Extreme rv-SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph 3275
N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients 3276
defined as the Extreme number of the maximum Extreme cardinality of the Extreme 3277
SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme cardinality consecutive 3278
Extreme SuperHyperDuality; and the Extreme power is corresponded to its Extreme 3280
coefficient; 3281
(iv) a Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of Extreme 3282

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

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

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

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

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


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

SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality 3318
consecutive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 3319
form the Extreme SuperHyperDuality; and the Extreme power is corresponded to its 3320
Extreme coefficient. 3321
136EXM1 Example 18.0.3. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E) in the 3322
mentioned Extreme Figures in every Extreme items. 3323
• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperDu- 3324
ality, is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are some 3325
empty Extreme SuperHyperEdges but E2 is a loop Extreme SuperHyperEdge and E4 is 3326
an Extreme SuperHyperEdge. Thus in the terms of Extreme SuperHyperNeighbor, there’s 3327
only one Extreme SuperHyperEdge, namely, E4 . The Extreme SuperHyperVertex, V3 is 3328
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- 3332
Duality, is up. The Extreme Algorithm is Extremely straightforward. E1 , E2 and E3 3333
are some empty Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. 3334
Thus in the terms of Extreme SuperHyperNeighbor, there’s only one Extreme SuperHy- 3335
perEdge, namely, E4 . The Extreme SuperHyperVertex, V3 is Extreme isolated means that 3336
there’s no Extreme SuperHyperEdge has it as an Extreme endpoint. Thus the Extreme 3337
SuperHyperVertex, V3 , is excluded in every given Extreme SuperHyperDuality. 3338


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

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 3382
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 3385
ViEXT ERN AL in the literatures of SuperHyperDuality. The latter is straightforward. 3386
(31.1), is the SuperHyperDuality. 3389
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 3391
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3

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



ESHS : (V, E), in the Extreme SuperHyperModel (31.3), is the Extreme SuperHyperDuality. 3408
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 3410
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. 3414
Then there’s at least one SuperHyperDuality. Thus the notion of quasi isn’t up and the 3415
SuperHyperNotions based on SuperHyperDuality could be applied. There are only two 3416
SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as the 3417
representative in the 3418
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 : 3419

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

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

is a longest SuperHyperDuality taken from a connected Extreme SuperHyperMultipartite 3431

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

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

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

∃!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 3456
SuperHyperDuality proposes some longest SuperHyperDuality excerpt from some representatives. 3457
Extreme SuperHyperDuality. 3463

CHAPTER 19 3464
Extreme SuperHyperJoin But As The 3465
Super Forms 3467
Definition 19.0.1. (Different Extreme Types of Extreme SuperHyperJoin). 3468

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

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

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

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

Vi , Vj ∈ Ea ; ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; and |Vi |Extreme CARDINALITY = 3479
|Vj |Extreme CARDINALITY ; 3480
(v) Extreme SuperHyperJoin if it’s either of Extreme e-SuperHyperJoin, Extreme re- 3481
SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme rv-SuperHyperJoin. 3482
Definition 19.0.2. ((Extreme) SuperHyperJoin). 3483

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

re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme rv-SuperHyperJoin and 3487
C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme 3488
cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme 3489
SuperHyperEdges in the consecutive Extreme sequence of Extreme SuperHyperEdges and 3490
Extreme SuperHyperVertices such that they form the Extreme SuperHyperJoin; 3491
165
(ii) a Extreme SuperHyperJoin if it’s either of Extreme e-SuperHyperJoin, Extreme 3492

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

SuperHyperJoin, Extreme re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme 3499
rv-SuperHyperJoin and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3500
is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined as the 3501
Extreme number of the maximum Extreme cardinality of the Extreme SuperHyperEdges 3502
of an Extreme SuperHyperSet S of high Extreme cardinality consecutive Extreme 3503
SuperHyperEdges and Extreme SuperHyperVertices such that they form the Extreme 3504
SuperHyperJoin; and the Extreme power is corresponded to its Extreme coefficient; 3505
(iv) a Extreme SuperHyperJoin SuperHyperPolynomial if it’s either of Extreme e- 3506

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


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

C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum 3522
Extreme cardinality of the Extreme SuperHyperVertices of an Extreme SuperHyperSet 3523
SuperHyperVertices such that they form the Extreme SuperHyperJoin; 3525
(vii) an Extreme R-SuperHyperJoin SuperHyperPolynomial if it’s either of Extreme 3526
e-SuperHyperJoin, Extreme re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme 3527

Extreme number of the maximum Extreme cardinality of the Extreme SuperHyperVertices 3530

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

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

SuperHyperJoin. 3551
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 3553
Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. Thus in the terms of 3554
Extreme SuperHyperNeighbor, there’s only one Extreme SuperHyperEdge, namely, E4 . 3555
The Extreme SuperHyperVertex, V3 is Extreme isolated means that there’s no Extreme 3556
SuperHyperEdge has it as an Extreme endpoint. Thus the Extreme SuperHyperVertex, 3557
V3 , is excluded in every given Extreme SuperHyperJoin. 3558

is up. The Extreme Algorithm is Extremely straightforward. 3560


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

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

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


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

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



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

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

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


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

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

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

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

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

CHAPTER 20 3681
Extreme SuperHyperPerfect But As The 3682
Super Forms 3684
Definition 20.0.1. (Different Extreme Types of Extreme SuperHyperPerfect). 3685

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

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

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

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

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

re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, and Extreme rv-SuperHyperPerfect. 3697
Definition 20.0.2. ((Extreme) SuperHyperPerfect). 3698

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

Extreme re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, and Extreme rv- 3702
SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3703
Extreme SuperHyperPerfect; 3707
179
(ii) a Extreme SuperHyperPerfect if it’s either of Extreme e-SuperHyperPerfect, Extreme 3708

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

e-SuperHyperPerfect, Extreme re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, 3715
and Extreme rv-SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph 3716
Extreme SuperHyperPerfect; and the Extreme power is corresponded to its Extreme 3721
coefficient; 3722
(iv) a Extreme SuperHyperPerfect SuperHyperPolynomial if it’s either of Extreme 3723

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

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

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

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

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


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

SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality 3759
consecutive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 3760
form the Extreme SuperHyperPerfect; and the Extreme power is corresponded to its 3761
Extreme coefficient. 3762
• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperPer- 3765
fect, is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are some 3766
SuperHyperPerfect. 3772
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 3774
are some empty Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. 3775
SuperHyperVertex, V3 , is excluded in every given Extreme SuperHyperPerfect. 3779


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

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

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

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

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



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

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

Then 3870

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



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

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

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


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

CHAPTER 21 3905
Extreme SuperHyperTotal But As The 3906
Super Forms 3908
Definition 21.0.1. (Different Extreme Types of Extreme SuperHyperTotal). 3909
(i) Extreme e-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that Va ∈ Ei , Ej ; 3912
(ii) Extreme re-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that Va ∈ 3913

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

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

re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Extreme rv-SuperHyperTotal. 3919
Definition 21.0.2. ((Extreme) SuperHyperTotal). 3920

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

re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Extreme rv-SuperHyperTotal and 3924
SuperHyperEdges in the consecutive Extreme sequence of Extreme SuperHyperEdges and 3927
Extreme SuperHyperVertices such that they form the Extreme SuperHyperTotal; 3928
(ii) a Extreme SuperHyperTotal if it’s either of Extreme e-SuperHyperTotal, Extreme 3929

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

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

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

SuperHyperTotal, Extreme re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Ex- 3944
(V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined 3946
as the Extreme number of the maximum Extreme cardinality of the Extreme SuperHy- 3947
perEdges of an Extreme SuperHyperSet S of high Extreme cardinality consecutive Extreme 3948
SuperHyperTotal; and the Extreme power is corresponded to its Extreme coefficient; 3950
(v) an Extreme R-SuperHyperTotal if it’s either of Extreme e-SuperHyperTotal, Extreme 3951

re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Extreme rv-SuperHyperTotal and 3952
SuperHyperVertices in the consecutive Extreme sequence of Extreme SuperHyperEdges 3955
and Extreme SuperHyperVertices such that they form the Extreme SuperHyperTotal; 3956
(vi) a Extreme R-SuperHyperTotal if it’s either of Extreme e-SuperHyperTotal, Extreme 3957

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

treme e-SuperHyperTotal, Extreme re-SuperHyperTotal, Extreme v-SuperHyperTotal, 3964
and Extreme rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph 3965
SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality consec- 3968
utive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form 3969
the Extreme SuperHyperTotal; and the Extreme power is corresponded to its Extreme 3970
coefficient; 3971
(viii) a Extreme SuperHyperTotal SuperHyperPolynomial if it’s either of Extreme e- 3972

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

(V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined as 3975
the Extreme number of the maximum Extreme cardinality of the Extreme SuperHyper- 3976
Vertices of an Extreme SuperHyperSet S of high Extreme cardinality consecutive Extreme 3977
SuperHyperTotal; and the Extreme power is corresponded to its Extreme coefficient. 3979
• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperTotal, 3982
is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are some empty 3983
Extreme SuperHyperEdges but E2 is a loop Extreme SuperHyperEdge and E4 is an 3984
Extreme SuperHyperEdge. Thus in the terms of Extreme SuperHyperNeighbor, there’s 3985
SuperHyperTotal. 3989
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 3991
Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. Thus in the terms of 3992
Extreme SuperHyperNeighbor, there’s only one Extreme SuperHyperEdge, namely, E4 . 3993
The Extreme SuperHyperVertex, V3 is Extreme isolated means that there’s no Extreme 3994
SuperHyperEdge has it as an Extreme endpoint. Thus the Extreme SuperHyperVertex, 3995
V3 , is excluded in every given Extreme SuperHyperTotal. 3996



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

ViEXT ERN AL in the literatures of SuperHyperTotal. The latter is straightforward. 4044
(31.1), is the SuperHyperTotal. 4047
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 4049
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. 4056
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 4058
P : ViEXT ERN AL , Ei , CEN T ER, Ej .

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

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

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

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

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



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

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



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

CHAPTER 22 4120
Extreme SuperHyperConnected But As 4121
The Extensions Excerpt From Dense And 4122
Super Forms 4123
Definition 22.0.1. (Different Extreme Types of Extreme SuperHyperConnected). 4124

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

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

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

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

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

Extreme re-SuperHyperConnected, Extreme v-SuperHyperConnected, and Extreme rv- 4138
SuperHyperConnected. 4139
Definition 22.0.2. ((Extreme) SuperHyperConnected). 4140
(i) an Extreme SuperHyperConnected if it’s either of Extreme e-SuperHyperConnected, 4143

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

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

Extreme e-SuperHyperConnected, Extreme re-SuperHyperConnected, Extreme v- 4157
SuperHyperConnected, and Extreme rv-SuperHyperConnected and C(N SHG) for an 4158
Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial con- 4159
cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high 4161
Extreme cardinality consecutive Extreme SuperHyperEdges and Extreme SuperHyperVer- 4162
tices such that they form the Extreme SuperHyperConnected; and the Extreme power is 4163
(iv) a Extreme SuperHyperConnected SuperHyperPolynomial if it’s either of 4165


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

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

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

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

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

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

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

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

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


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

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

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 4265
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. 4269
(31.1), is the SuperHyperConnected. 4272
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 4274
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. 4281
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 4283



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

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

is a longest SuperHyperConnected taken from a connected Extreme SuperHyperBipartite 4302

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


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

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



to ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is straightforward. 4337
Then there’s at least one SuperHyperConnected. Thus the notion of quasi isn’t up and 4338
the SuperHyperNotions based on SuperHyperConnected could be applied. The unique 4339
embedded SuperHyperConnected proposes some longest SuperHyperConnected excerpt from 4340
some representatives. The latter is straightforward. 4341
Extreme SuperHyperConnected. 4346

CHAPTER 23 4347
Background 4348
The seminal paper and groundbreaking article is titled “Super Hyper Dominating and Super 4378
Hyper Resolving on Neutrosophic Super Hyper Graphs and Their Directions in Game Theory and 4379
Neutrosophic Super Hyper Classes” in Ref. [HG44s] by Henry Garrett (2022). In this research 4380
article, a novel approach is implemented on SuperHyperGraph and neutrosophic SuperHyper- 4381
221
Graph based on fundamental SuperHyperNumber and using neutrosophic SuperHyperClasses 4382

of neutrosophic SuperHyperGraph. It’s published in prestigious and fancy journal is entitled 4383
“Journal of Mathematical Techniques and Computational Mathematics(JMTCM)” with ISO 4384
abbreviation “J Math Techniques Comput Math” in volume 1 and issue 3 with pages 242-263. 4385
The research article studies deeply with choosing directly neutrosophic SuperHyperGraph and 4386
SuperHyperGraph. It’s the breakthrough toward independent results based on initial background 4387
and fundamental SuperHyperNumbers. The seminal paper and groundbreaking article is titled 4388
“neutrosophic co-degree and neutrosophic degree alongside chromatic numbers in the setting of 4389
some classes related to neutrosophic hypergraphs” in Ref. [HG55s] by Henry Garrett (2023). 4390
In this research article, a novel approach is implemented on SuperHyperGraph and neutrosophic 4391
SuperHyperGraph based on general forms without using neutrosophic classes of neutrosophic 4392
SuperHyperGraph. It’s published in prestigious and fancy journal is entitled “Journal of Current 4393
Trends in Computer Science Research (JCTCSR)” with ISO abbreviation “J Curr Trends Comp 4394
Sci Res” in volume 2 and issue 1 with pages 16-24. The research article studies deeply with choos- 4395
ing neutrosophic hypergraphs instead of neutrosophic SuperHyperGraph. It’s the breakthrough 4396
toward independent results based on initial background. The research article studies deeply 4397
with choosing neutrosophic hypergraphs instead of neutrosophic SuperHyperGraph. It’s the 4398
breakthrough toward independent results based on initial background. In some articles are titled 4399
“0039 | Closing Numbers and Super-Closing Numbers as (Dual)Resolving and (Dual)Coloring 4400
alongside (Dual)Dominating in (Neutrosophic)n-SuperHyperGraph” in Ref. [HG4] by Henry 4401
Garrett (2022), “0049 | (Failed)1-Zero-Forcing Number in Neutrosophic Graphs” in Ref. [HG5] 4402
by Henry Garrett (2022), “Extreme SuperHyperClique as the Firm Scheme of Confrontation 4403
under Cancer’s Recognition as the Model in The Setting of (Neutrosophic) SuperHyperGraphs” in 4404
Ref. [HG6] by Henry Garrett (2022), “Uncertainty On The Act And Effect Of Cancer Alongside 4405
The Foggy Positions Of Cells Toward Neutrosophic Failed SuperHyperClique inside Neutrosophic 4406


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

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


SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints” in 4429
Ref. [HG12] by Henry Garrett (2022), “Basic Notions on (Neutrosophic) SuperHyperFor- 4430
cing And (Neutrosophic) SuperHyperModeling in Cancer’s Recognitions And (Neutrosophic) 4431
SuperHyperGraphs” in Ref. [HG17] by Henry Garrett (2022), “Neutrosophic Messy-Style 4432
SuperHyperGraphs To Form Neutrosophic SuperHyperStable To Act on Cancer’s Neutrosophic 4433
Recognitions In Special ViewPoints” in Ref. [HG18] by Henry Garrett (2022),“(Neutrosophic) 4434

SuperHyperModeling of Cancer’s Recognitions Featuring (Neutrosophic) SuperHyperDefensive 4435
SuperHyperAlliances” in Ref. [HG19] by Henry Garrett (2022), “(Neutrosophic) SuperHy- 4436
perAlliances With SuperHyperDefensive and SuperHyperOffensive Type-SuperHyperSet On 4437
(Neutrosophic) SuperHyperGraph With (Neutrosophic) SuperHyperModeling of Cancer’s Re- 4438
cognitions And Related (Neutrosophic) SuperHyperClasses” in Ref. [HG20] by Henry Garrett 4439
(2022), “SuperHyperGirth on SuperHyperGraph and Neutrosophic SuperHyperGraph With Supe- 4440

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

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

in Ref. [HG26] by Henry Garrett (2023), “Indeterminacy On The All Possible Connections 4453
of Cells In Front of Cancer’s Attacks In The Terms of Neutrosophic Failed SuperHyperClique 4454
on Cancer’s Recognition called Neutrosophic SuperHyperGraphs” in Ref. [HG27] by Henry 4455
Garrett (2023), “Perfect Directions Toward Idealism in Cancer’s Neutrosophic Recognition For- 4456
warding Neutrosophic SuperHyperClique on Neutrosophic SuperHyperGraphs” in Ref. [HG28] 4457
by Henry Garrett (2023), “Demonstrating Complete Connections in Every Embedded Regions 4458
and Sub-Regions in the Terms of Cancer’s Recognition and (Neutrosophic) SuperHyperGraphs 4459
With (Neutrosophic) SuperHyperClique” in Ref. [HG29] by Henry Garrett (2023), “Different 4460
Neutrosophic Types of Neutrosophic Regions titled neutrosophic Failed SuperHyperStable in 4461
Cancer’s Neutrosophic Recognition modeled in the Form of Neutrosophic SuperHyperGraphs” 4462
in Ref. [HG30] by Henry Garrett (2023), “Using the Tool As (Neutrosophic) Failed SuperHy- 4463
perStable To SuperHyperModel Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs” 4464
ViewPoints” in Ref. [HG32] by Henry Garrett (2023), “(Neutrosophic) SuperHyperStable 4467
on Cancer’s Recognition by Well-SuperHyperModelled (Neutrosophic) SuperHyperGraphs” in 4468
Ref. [HG33] by Henry Garrett (2023), “Neutrosophic 1-Failed SuperHyperForcing in the 4469
SuperHyperFunction To Use Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic Re- 4470
cognition And Beyond” in Ref. [HG34] by Henry Garrett (2022), “(Neutrosophic) 1-Failed 4471
SuperHyperForcing in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs” in Ref. 4472
[HG35] by Henry Garrett (2022), “Basic Notions on (Neutrosophic) SuperHyperForcing And 4473

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

Graphs” in Ref. [HG36] by Henry Garrett (2022), “Basic Neutrosophic Notions Concerning 4475
SuperHyperDominating and Neutrosophic SuperHyperResolving in SuperHyperGraph” in Ref. 4476
[HG37] by Henry Garrett (2022), “Initial Material of Neutrosophic Preliminaries to Study 4477
Some Neutrosophic Notions Based on Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic 4478
SuperHyperGraph (NSHG)” in Ref. [HG38] by Henry Garrett (2022), and [HG44s; HG55s; 4479
HG288; HG289; HG290; HG291], there are some endeavors to formalize the basic Super- 4501
HyperNotions about neutrosophic SuperHyperGraph and SuperHyperGraph alongside scientific 4502
research books at [HG60b; HG61b; HG62b; HG63b; HG64b; HG65b; HG66b; HG67b; 4503


HG179b; HG180b; HG181b; HG182b; HG183b; HG184b; HG185b]. Two popular 4517
scientific research books in Scribd in the terms of high readers, 4728 and 5721 respectively, on 4518
neutrosophic science is on [HG32b; HG44b]. 4519

See the seminal scientific researches [HG11s; HG22s; HG33s]. The formalization of the notions 4533
on the framework of notions in SuperHyperGraphs, Neutrosophic notions in SuperHyperGraphs 4534
theory, and (Neutrosophic) SuperHyperGraphs theory at [HG44s; HG55s; HG4; HG5; HG6; 4535
HG290; HG291] alongside scientific research books at [HG60b; HG61b; HG62b; HG63b; 4557


HG183b; HG184b; HG185b]. Two popular scientific research books in Scribd in the terms 4572
of high readers, 4728 and 5721 respectively, on neutrosophic science is on [HG32b; HG44b]. 4573

Bibliography 4574
10.33140/JMTCM.01.03.09) 4597
227



10.20944/preprints202301.0282.v1). 4613

10.20944/preprints202301.0267.v1). 4616

(doi: 10.20944/preprints202301.0265.v1). 4621
prints202301.0262.v1). 4625
2023010224, (doi: 10.20944/preprints202301.0224.v1). 4631

prints202301.0105.v1). 4634

Preprints 2023, 2023010044 4640
10.20944/preprints202301.0043.v1). 4643

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

(doi: 10.20944/preprints202212.0500.v1). 4659
10.5281/zenodo.8080100). 4668

10.5281/zenodo.8080068). 4671
(doi: 10.5281/zenodo.8078445). 4674
2023, (doi: 10.5281/zenodo.8078543). 4677
10.5281/zenodo.8076416). 4680

2023, (doi: 10.5281/zenodo.8076399). 4683
(doi: 10.5281/zenodo.8072171). 4686
2023, (doi: 10.5281/zenodo.8072267). 4689
10.5281/zenodo.8067384). 4692
2023, (doi: 10.5281/zenodo.8067409). 4695
10.5281/zenodo.8061927). 4698
10.5281/zenodo.8062016). 4701
10.5281/zenodo.8057696). 4704
2023, (doi: 10.5281/zenodo.8057753). 4707
10.5281/zenodo.8052893). 4710
2023, (doi: 10.5281/zenodo.8052925). 4713
10.5281/zenodo.8051346). 4716
10.5281/zenodo.8051360). 4719

10.5281/zenodo.8025707). 4722
10.5281/zenodo.8027275). 4725
odo.8017246). 4728
10.5281/zenodo.8020128). 4731
odo.7978571). 4734
10.5281/zenodo.7978857). 4737
10.5281/zenodo.7940830). 4740
10.5281/zenodo.7943578). 4743
odo.7916595). 4746
odo.7923632). 4749
(doi: 10.5281/zenodo.7904698). 4752
2023, (doi: 10.5281/zenodo.7904671). 4755

10.5281/zenodo.7871026). 4764
2023, (doi: 10.5281/zenodo.7874647). 4767
10.5281/zenodo.7857856). 4770
2023, (doi: 10.5281/zenodo.7857841). 4773
10.5281/zenodo.7853867). 4782
10.5281/zenodo.7853922). 4785
(doi: 10.5281/zenodo.7851519). 4788
(doi: 10.5281/zenodo.7851550). 4791

10.5281/zenodo.7834229). 4800
10.5281/zenodo.7834261). 4803
10.5281/zenodo.7824560). 4806
(doi: 10.5281/zenodo.7824623). 4809
2023, (doi: 10.5281/zenodo.7809365). 4820
2023, (doi: 10.5281/zenodo.7809358). 4823
10.5281/zenodo.7809219). 4826
10.5281/zenodo.7809328). 4829
2023, (doi: 10.5281/zenodo.7806767). 4832
2023, (doi: 10.5281/zenodo.7806838). 4835

10.5281/zenodo.7799902). 4844
(doi: 10.5281/zenodo.7804218). 4847
(doi: 10.5281/zenodo.7796334). 4850
10.5281/zenodo.7791952). 4856
10.5281/zenodo.7791982). 4859
10.5281/zenodo.7790026). 4862
10.5281/zenodo.7790052). 4865
2023, (doi: 10.5281/zenodo.7787066). 4868
10.5281/zenodo.7781476). 4874

10.5281/zenodo.7783082). 4877
10.5281/zenodo.7777857). 4880
10.5281/zenodo.7779286). 4883
(doi: 10.5281/zenodo.7771831). 4886
2023, (doi: 10.5281/zenodo.7772468). 4889
10.13140/RG.2.2.20913.25446). 4892
odo.7764916). 4895
10.13140/RG.2.2.11770.98247). 4898
10.13140/RG.2.2.12400.12808). 4901
2023, (doi: 10.13140/RG.2.2.22545.10089). 4904
10.13140/RG.2.2.11377.76644). 4910
10.13140/RG.2.2.23750.96329). 4913

10.13140/RG.2.2.31366.24641). 4916
10.13140/RG.2.2.34721.68960). 4919
2023, (doi: 10.13140/RG.2.2.30212.81289). 4922
10.13140/RG.2.2.24288.35842). 4928
10.13140/RG.2.2.32467.25124). 4931
10.13140/RG.2.2.31025.45925). 4934
10.13140/RG.2.2.17184.25602). 4937
10.13140/RG.2.2.23423.28327). 4940
10.13140/RG.2.2.28456.44805). 4943
10.13140/RG.2.2.23525.68320). 4946
10.13140/RG.2.2.20170.24000). 4949
10.13140/RG.2.2.36475.59683). 4952

10.13140/RG.2.2.29764.71046). 4955
2023, (doi: 10.13140/RG.2.2.18780.87683). 4958
10.13140/RG.2.2.26134.01603). 4964
10.13140/RG.2.2.27392.30721). 4967
10.13140/RG.2.2.33028.40321). 4970
10.13140/RG.2.2.21389.20966). 4973
10.13140/RG.2.2.16356.04489). 4976
10.13140/RG.2.2.21756.21129). 4979
10.13140/RG.2.2.30983.68009). 4982
10.13140/RG.2.2.28552.29445). 4985
(doi: 10.13140/RG.2.2.10936.21761). 4988
10.13140/RG.2.2.35105.89447). 4991

(doi: 10.13140/RG.2.2.30072.72960). 4994
10.13140/RG.2.2.31147.52003). 4997
10.13140/RG.2.2.32825.24163). 5000
10.13140/RG.2.2.13059.58401). 5003
10.13140/RG.2.2.11172.14720). 5006
2023, (doi: 10.13140/RG.2.2.22011.80165). 5009
ate 2023, (doi: 10.13140/RG.2.2.30819.84003). 5012
2023, (doi: 10.13140/RG.2.2.10493.84962). 5015
ate 2023, (doi: 10.13140/RG.2.2.13849.29280). 5018
2023, (doi: 10.13140/RG.2.2.19944.14086). 5021
ate 2023, (doi: 10.13140/RG.2.2.23299.58404). 5024
(doi: 10.13140/RG.2.2.33103.76968). 5027
(doi: 10.13140/RG.2.2.23037.44003). 5030

(doi: 10.13140/RG.2.2.35646.56641). 5033
10.13140/RG.2.2.18030.48967). 5036
(doi: 10.13140/RG.2.2.13973.81121). 5039
2023, (doi: 10.13140/RG.2.2.34106.47047). 5042
2023, (doi: 10.13140/RG.2.2.31956.88961). 5048
2023, (doi: 10.13140/RG.2.2.15179.67361). 5051
10.13140/RG.2.2.21510.45125). 5054
2023, (doi: 10.13140/RG.2.2.13121.84321). 5057
10.13140/RG.2.2.11758.69441). 5060
2023, (doi: 10.13140/RG.2.2.31891.35367). 5063
10.13140/RG.2.2.19360.87048). 5066
10.13140/RG.2.2.32363.21286). 5069

10.13140/RG.2.2.23266.81602). 5072
10.13140/RG.2.2.19911.37285). 5075
10.13140/RG.2.2.11050.90569). 5078
2023, (doi: 10.13140/RG.2.2.17761.79206). 5081
ate 2023, (doi: 10.13140/RG.2.2.33275.80161). 5087
(doi: 10.13140/RG.2.2.30182.50241). 5090

2023, (doi: 10.13140/RG.2.2.17252.24968). 5123
2023010396 (doi: 10.20944/preprints202301.0396.v1). 5132
2023, 2023010395 (doi: 10.20944/preprints202301.0395.v1). 5135



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

10.20944/preprints202301.0282.v1). 5156
10.20944/preprints202301.0267.v1).). 5159

(doi: 10.20944/preprints202301.0265.v1). 5164
prints202301.0262.v1). 5168

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

10.13140/RG.2.2.35061.65767). 5177
10.13140/RG.2.2.18494.15680). 5181
10.13140/RG.2.2.32530.73922). 5185

10.13140/RG.2.2.15897.70243). 5189
10.13140/RG.2.2.32530.73922). 5193
prints202301.0105.v1). 5196

10.13140/RG.2.2.23172.19849). 5203
10.13140/RG.2.2.17385.36968). 5213
Preprints 2023, 2023010044 5216
10.20944/preprints202301.0043.v1). 5219
2023, (doi: 10.13140/RG.2.2.28945.92007). 5222

10.13140/RG.2.2.35774.77123). 5228

10.13140/RG.2.2.29430.88642). 5234
(doi: 10.20944/preprints202212.0549.v1). 5240

10.13140/RG.2.2.19380.94084). 5243
(doi: 10.20944/preprints202212.0500.v1). 5254
10.13140/RG.2.2.20993.12640). 5257


10.13140/RG.2.2.29173.86244). 5272
2023 (doi: 10.5281/zenodo.8080167). 5277
2023 (doi: 10.5281/zenodo.8076449). 5281
2023 (doi: 10.5281/zenodo.8067469). 5285
(doi: 10.5281/zenodo.8062076). 5287
2023 (doi: 10.5281/zenodo.8052976). 5291
(doi: 10.5281/zenodo.8051368). 5293
(doi: 10.5281/zenodo.8027488). 5295
10.5281/zenodo.8020181). 5297
10.5281/zenodo.7978921). 5299

odo.7943878). 5301
10.5281/zenodo.7943871). 5303
10.5281/zenodo.7923786). 5305
2023 (doi: 10.5281/zenodo.7905287). 5307

2023 (doi: 10.5281/zenodo.7874677). 5311
(doi: 10.5281/zenodo.7857906). 5313
2023 (doi: 10.5281/zenodo.7856329). 5315
10.5281/zenodo.7854561). 5317
2023 (doi: 10.5281/zenodo.7851893). 5319

(doi: 10.5281/zenodo.7835063). 5323
(doi: 10.5281/zenodo.7826705). 5325
2023 (doi: 10.5281/zenodo.7820680). 5327
10.5281/zenodo.7812750). 5329


2023 (doi: 10.5281/zenodo.7807782). 5335

2023 (doi: 10.5281/zenodo.7804449). 5337

(doi: 10.5281/zenodo.7792307). 5341
(doi: 10.5281/zenodo.7790728). 5343
2023 (doi: 10.5281/zenodo.7787712). 5345
10.5281/zenodo.7783791). 5347
10.5281/zenodo.7780123). 5349
(doi: 10.5281/zenodo.7773119). 5351
odo.7637762). 5353
10.5281/zenodo.7766174). 5355
10.5281/zenodo.7762232). 5357
(doi: 10.5281/zenodo.7758601). 5359
10.5281/zenodo.7754661). 5361
10.5281/zenodo.7750995) . 5363
(doi: 10.5281/zenodo.7749875). 5365
10.5281/zenodo.7747236). 5367
10.5281/zenodo.7742587). 5369
(doi: 10.5281/zenodo.7738635). 5371

10.5281/zenodo.7734719). 5373
10.5281/zenodo.7730484). 5375
(doi: 10.5281/zenodo.7730469). 5377
10.5281/zenodo.7722865). 5379
odo.7713563). 5381
odo.7709116). 5383
10.5281/zenodo.7706415). 5385
10.5281/zenodo.7706063). 5387
10.5281/zenodo.7701906). 5389
odo.7700205). 5391
10.5281/zenodo.7694876). 5393
10.5281/zenodo.7679410). 5395
10.5281/zenodo.7675982). 5397
10.5281/zenodo.7672388). 5399
odo.7668648). 5401
10.5281/zenodo.7662810). 5403
10.5281/zenodo.7659162). 5405
odo.7653233). 5407

odo.7653204). 5409
odo.7653142). 5411
odo.7653117). 5413
odo.7651687). 5416
odo.7651619). 5418
odo.7651439). 5420
odo.7650729). 5422
odo.7647868). 5424
odo.7647017). 5426
odo.7644894). 5428
odo.7632923). 5431
odo.7623459). 5433
10.5281/zenodo.7606416). 5435
10.5281/zenodo.7606416). 5437
odo.7606404). 5439
10.5281/zenodo.7580018). 5441

odo.7580018). 5443
odo.7580018). 5445
odo.7579929). 5447
10.5281/zenodo.7563170). 5449
odo.7563164). 5451
odo.7563160). 5453
odo.7563160). 5455
10.5281/zenodo.7563160). 5457
10.5281/zenodo.7557063). 5459
10.5281/zenodo.7557009). 5461
10.5281/zenodo.7539484). 5463
10.5281/zenodo.7523390). 5465
10.5281/zenodo.7523390). 5467
10.5281/zenodo.7523390). 5469
odo.7574952). 5471
10.5281/zenodo.7574992). 5473
odo.7523357). 5475
10.5281/zenodo.7523357). 5477

10.5281/zenodo.7504782). 5479
10.5281/zenodo.7504782). 5481
10.5281/zenodo.7504782). 5483
10.5281/zenodo.7499395). 5485
odo.7499395). 5487
10.5281/zenodo.7499395). 5489
10.5281/zenodo.7497450). 5491
10.5281/zenodo.7497450). 5493
10.5281/zenodo.7494862). 5495
odo.7494862). 5497
10.5281/zenodo.7494862). 5499
10.5281/zenodo.7493845). 5501
odo.7493845). 5503
10.5281/zenodo.7493845). 5505
odo.7539484). 5507
odo.7523390). 5509
odo.7523357). 5511
odo.7504782). 5513

odo.7499395). 5515
odo.7497450). 5517
odo.7494862). 5519
odo.7493845). 5521
odo.7480110). 5523
odo.7378758). 5525
odo.6320305). 5527
odo.6677173). 5529

CHAPTER 24 5530
Cancer In Neutrosophic 5531
SuperHyperGraph 5532
The cancer is the Neutrosophic disease but the Neutrosophic model is going to figure out what’s 5533
going on this Neutrosophic phenomenon. The special Neutrosophic case of this Neutrosophic 5534
disease is considered and as the consequences of the model, some parameters are used. The cells 5535
are under attack of this disease but the moves of the cancer in the special region are the matter 5536
of mind. The Neutrosophic recognition of the cancer could help to find some Neutrosophic 5537
treatments for this Neutrosophic disease. 5538
In the following, some Neutrosophic steps are Neutrosophic devised on this disease. 5539
Step 1. (Neutrosophic Definition) The Neutrosophic recognition of the cancer in the long- 5540
term Neutrosophic function. 5541
Step 2. (Neutrosophic Issue) The specific region has been assigned by the Neutrosophic 5542
model [it’s called Neutrosophic SuperHyperGraph] and the long Neutrosophic cycle of the 5543
move from the cancer is identified by this research. Sometimes the move of the cancer 5544
hasn’t be easily identified since there are some determinacy, indeterminacy and neutrality 5545
about the moves and the effects of the cancer on that region; this event leads us to 5546
choose another model [it’s said to be Neutrosophic SuperHyperGraph] to have convenient 5547
perception on what’s happened and what’s done. 5548
Step 3. (Neutrosophic Model) There are some specific Neutrosophic models, which are well- 5549
known and they’ve got the names, and some general Neutrosophic models. The moves 5550
and the Neutrosophic traces of the cancer on the complex tracks and between complicated 5551
groups of cells could be fantasized by a Neutrosophic SuperHyperPath(-/SuperHyperK- 5552
Domination, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHy- 5553
perWheel). The aim is to find either the Neutrosophic SuperHyperK-Domination or the 5554
Neutrosophic SuperHyperK-Domination in those Neutrosophic Neutrosophic SuperHyper- 5555
Models. 5556
Some cells have been faced with some attacks from the situation which is caused by the 5557
cancer’s attacks. In this case, there are some embedded analysis on the ongoing situations 5558
which in that, the cells could be labelled as some groups and some groups or individuals have 5559
excessive labels which all are raised from the behaviors to overcome the cancer’s attacks. In 5560
the embedded situations, the individuals of cells and the groups of cells could be considered 5561
253
as “new groups”. Thus it motivates us to find the proper SuperHyperModels for getting more 5562
proper analysis on this messy story. I’ve found the SuperHyperModels which are officially called 5563
“SuperHyperGraphs” and “Neutrosophic SuperHyperGraphs”. In this SuperHyperModel, the 5564
cells and the groups of cells are defined as “SuperHyperVertices” and the relations between the 5565
individuals of cells and the groups of cells are defined as “SuperHyperEdges”. Thus it’s another 5566
motivation for us to do research on this SuperHyperModel based on the “Cancer’s Recognition”. 5567
Sometimes, the situations get worst. The situation is passed from the certainty and precise style. 5568
Thus it’s the beyond them. There are three descriptions, namely, the degrees of determinacy, 5569
indeterminacy and neutrality, for any object based on vague forms, namely, incomplete data, 5570
imprecise data, and uncertain analysis. The latter model could be considered on the previous 5571
SuperHyperModel. It’s SuperHyperModel. It’s SuperHyperGraph but it’s officially called 5572
“Neutrosophic SuperHyperGraphs”. The cancer is the disease but the model is going to figure 5573
out what’s going on this phenomenon. The special case of this disease is considered and as the 5574
consequences of the model, some parameters are used. The cells are under attack of this disease 5575
but the moves of the cancer in the special region are the matter of mind. The recognition of 5576
the cancer could help to find some treatments for this disease. The SuperHyperGraph and 5577
Neutrosophic SuperHyperGraph are the SuperHyperModels on the “Cancer’s Recognition” and 5578
both bases are the background of this research. Sometimes the cancer has been happened on the 5579
region, full of cells, groups of cells and embedded styles. In this segment, the SuperHyperModel 5580
proposes some SuperHyperNotions based on the connectivities of the moves of the cancer 5581
in the forms of alliances’ styles with the formation of the design and the architecture are 5582
formally called “ SuperHyperK-Domination” in the themes of jargons and buzzwords. The 5583
prefix “SuperHyper” refers to the theme of the embedded styles to figure out the background for 5584
the SuperHyperNotions. The recognition of the cancer in the long-term function. The specific 5585
region has been assigned by the model [it’s called SuperHyperGraph] and the long cycle of the 5586
move from the cancer is identified by this research. Sometimes the move of the cancer hasn’t be 5587
easily identified since there are some determinacy, indeterminacy and neutrality about the moves 5588
names, and some general models. The moves and the traces of the cancer on the complex tracks 5592
and between complicated groups of cells could be fantasized by a Neutrosophic SuperHyperPath 5593
(-/SuperHyperK-Domination, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, 5594
SuperHyperWheel). The aim is to find either the optimal SuperHyperK-Domination or the 5595
Neutrosophic SuperHyperK-Domination in those Neutrosophic SuperHyperModels. Some 5596
general results are introduced. Beyond that in SuperHyperStar, all possible Neutrosophic 5597
SuperHyperPath s have only two SuperHyperEdges but it’s not enough since it’s essential to 5598
have at least three SuperHyperEdges to form any style of a SuperHyperK-Domination. There 5599
isn’t any formation of any SuperHyperK-Domination but literarily, it’s the deformation of any 5600
SuperHyperK-Domination. It, literarily, deforms and it doesn’t form. 5601
amount of SuperHyperK-Domination” of either individual of cells or the groups of cells based on 5603
the fixed cell or the fixed group of cells, extensively, the “amount of SuperHyperK-Domination” 5604
based on the fixed groups of cells or the fixed groups of group of cells? 5605
Question 24.0.2. What are the best descriptions for the “Cancer’s Recognition” in terms of 5606

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

SuperHyperK-Domination” on “SuperHyperGraph” and “Neutrosophic SuperHyperGraph”. 5610
Then the research has taken more motivations to define SuperHyperClasses and to find some 5611
connections amid this SuperHyperNotion with other SuperHyperNotions. It motivates us to get 5612
some instances and examples to make clarifications about the framework of this research. The 5613
general results and some results about some connections are some avenues to make key point of 5614
this research, “Cancer’s Recognition”, more understandable and more clear. 5615
Some SuperHyperClasses and some Neutrosophic SuperHyperClasses are the cases of this 5616
research on the modeling of the regions where are under the attacks of the cancer to 5617
recognize this disease as it’s mentioned on the title “Cancer’s Recognitions”. To formalize 5618
the instances on the SuperHyperNotion, SuperHyperK-Domination, the new SuperHyperClasses 5619
and SuperHyperClasses, are introduced. Some general results are gathered in the section on the 5620
SuperHyperK-Domination and the Neutrosophic SuperHyperK-Domination. The clarifications, 5621

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

CHAPTER 25 5632
Neutrosophic Strict Dimension 5633
Dominating 5634
Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of SuperHyperDu- 5635
ality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, ResearchGate 5636
2023, (doi: 10.13140/RG.2.2.34953.52320). 5637
Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph By 5638
SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchGate 2023, 5639
(doi: 10.13140/RG.2.2.33275.80161). 5640
10.13140/RG.2.2.11050.90569). 5643
Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of SuperHyperJoin 5644
10.13140/RG.2.2.17761.79206). 5646
10.13140/RG.2.2.19911.37285). 5649
Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect 5650
10.13140/RG.2.2.23266.81602). 5652
10.13140/RG.2.2.19360.87048). 5655
Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal 5656
10.13140/RG.2.2.32363.21286). 5658
10.13140/RG.2.2.11758.69441). 5661
Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of SuperHyperConnected 5662
10.13140/RG.2.2.31891.35367). 5664
257

10.13140/RG.2.2.21510.45125). 5667
Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDominating 5668
10.13140/RG.2.2.13121.84321). 5670

CHAPTER 26 5671
New Ideas In Recognition of Cancer And 5672
Neutrosophic SuperHyperGraph By Strict 5673
Dimension Dominating As Hyper Dimple 5674
On Super Dimity 5675
259
CHAPTER 27 5676
ABSTRACT 5677
In this scientific research, (Different Neutrosophic Types of Neutrosophic SuperHyperStrict 5678

Dimension Dominating). Assume a Neutrosophic SuperHyperGraph (NSHG) S is a Strict Dimension 5679
0
Dominating pair S = (V, E). Consider a Neutrosophic SuperHyperSet V = {V1 , V2 , . . . , Vs } and 5680
0 0 0
E = {E1 , E2 , . . . , Ez }. Then either V or E is called Neutrosophic e-SuperHyperStrict Dimension 5681
Dominating if the following expression is called Neutrosophic e-SuperHyperStrict Dimension Dominating 5682
criteria holds 5683

Neutrosophic re-SuperHyperStrict Dimension Dominating if the following expression is called Neutro- 5684
sophic e-SuperHyperStrict Dimension Dominating criteria holds 5685

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

SuperHyperStrict Dimension Dominating if the following expression is called Neutrosophic v- 5687
SuperHyperStrict Dimension Dominating criteria holds 5688

Neutrosophic rv-SuperHyperStrict Dimension Dominating if the following expression is called Neutro- 5689
sophic v-SuperHyperStrict Dimension Dominating criteria holds 5690

and |Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; Neutrosophic Super- 5691
Neutrosophic re-SuperHyperStrict Dimension Dominating, Neutrosophic v-SuperHyperStrict Dimension Dom- 5693
inating, and Neutrosophic rv-SuperHyperStrict Dimension Dominating. ((Neutrosophic) SuperHyperStrict 5694
Dimension Dominating). Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 5695
261
Consider a Neutrosophic SuperHyperEdge (NSHE) E = {V1 , V2 , . . . , Vs }. Then E is called an Ex- 5696

treme SuperHyperStrict Dimension Dominating if it’s either of Neutrosophic e-SuperHyperStrict Dimension 5697
an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme cardinality of an 5700
Extreme SuperHyperSet S of high Extreme cardinality of the Extreme SuperHyperEdges in the 5701
consecutive Extreme sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices 5702

such that they form the Extreme SuperHyperStrict Dimension Dominating; a Neutrosophic Super- 5703
Dominating, and Neutrosophic rv-SuperHyperStrict Dimension Dominating and C(N SHG) for a Neut- 5706
rosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic cardinality of the 5707
Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic car- 5708

dinality consecutive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such 5709
that they form the Neutrosophic SuperHyperStrict Dimension Dominating; an Extreme SuperHyperStrict 5710
Dimension Dominating SuperHyperPolynomial if it’s either of Neutrosophic e-SuperHyperStrict Dimension 5711
an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial con- 5714

cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Ex- 5716
treme cardinality consecutive Extreme SuperHyperEdges and Extreme SuperHyperVertices 5717
such that they form the Extreme SuperHyperStrict Dimension Dominating; and the Extreme power 5718
is corresponded to its Extreme coefficient; a Neutrosophic SuperHyperStrict Dimension Dominat- 5719
ing SuperHyperPolynomial if it’s either of Neutrosophic e-SuperHyperStrict Dimension Dominating, 5720

Dominating, and Neutrosophic rv-SuperHyperStrict Dimension Dominating and C(N SHG) for a Neutro- 5722
sophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains 5723
sophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of 5725
high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and Neutrosophic 5726

SuperHyperVertices such that they form the Neutrosophic SuperHyperStrict Dimension Dominat- 5727
ing; and the Neutrosophic power is corresponded to its Neutrosophic coefficient; an Extreme 5728
V-SuperHyperStrict Dimension Dominating if it’s either of Neutrosophic e-SuperHyperStrict Dimension 5729
Dimension Dominating, and Neutrosophic rv-SuperHyperStrict Dimension Dominating and C(N SHG) for an 5731
Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme cardinality of an Extreme 5732
SuperHyperSet S of high Extreme cardinality of the Extreme SuperHyperVertices in the consecut- 5733
ive Extreme sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that 5734
they form the Extreme SuperHyperStrict Dimension Dominating; a Neutrosophic V-SuperHyperStrict 5735
Dimension Dominating if it’s either of Neutrosophic e-SuperHyperStrict Dimension Dominating, Neutrosophic 5736
re-SuperHyperStrict Dimension Dominating, Neutrosophic v-SuperHyperStrict Dimension Dominating, and 5737

Neutrosophic rv-SuperHyperStrict Dimension Dominating and C(N SHG) for a Neutrosophic Super- 5738
HyperGraph N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic 5739
SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consec- 5740
utive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form 5741

the Neutrosophic SuperHyperStrict Dimension Dominating; an Extreme V-SuperHyperStrict Dimension 5742

Dominating SuperHyperPolynomial if it’s either of Neutrosophic e-SuperHyperStrict Dimension Dominat- 5743
ing, Neutrosophic re-SuperHyperStrict Dimension Dominating, Neutrosophic v-SuperHyperStrict Dimension 5744
Dominating, and Neutrosophic rv-SuperHyperStrict Dimension Dominating and C(N SHG) for an Extreme 5745
SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme 5746
coefficients defined as the Extreme number of the maximum Extreme cardinality of the Extreme 5747
SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality consecutive 5748

Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the Extreme 5749
SuperHyperStrict Dimension Dominating; and the Extreme power is corresponded to its Extreme coef- 5750
ficient; a Neutrosophic SuperHyperStrict Dimension Dominating SuperHyperPolynomial if it’s either of 5751
Neutrosophic e-SuperHyperStrict Dimension Dominating, Neutrosophic re-SuperHyperStrict Dimension Dom- 5752
inating, Neutrosophic v-SuperHyperStrict Dimension Dominating, and Neutrosophic rv-SuperHyperStrict 5753
Dimension Dominating and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the 5754
Neutrosophic SuperHyperPolynomial contains the Neutrosophic coefficients defined as the 5755
Neutrosophic number of the maximum Neutrosophic cardinality of the Neutrosophic SuperHy- 5756
perVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive 5757
Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form 5758
the Neutrosophic SuperHyperStrict Dimension Dominating; and the Neutrosophic power is corres- 5759
ponded to its Neutrosophic coefficient. In this scientific research, new setting is introduced 5760
for new SuperHyperNotions, namely, a SuperHyperStrict Dimension Dominating and Neutrosophic 5761
SuperHyperStrict Dimension Dominating. Two different types of SuperHyperDefinitions are debut 5762
for them but the research goes further and the SuperHyperNotion, SuperHyperUniform, and 5763
SuperHyperClass based on that are well-defined and well-reviewed. The literature review is 5764
implemented in the whole of this research. For shining the elegancy and the significancy of this 5765
research, the comparison between this SuperHyperNotion with other SuperHyperNotions and 5766
fundamental SuperHyperNumbers are featured. The definitions are followed by the examples 5767
and the instances thus the clarifications are driven with different tools. The applications are 5768
figured out to make sense about the theoretical aspect of this ongoing research. The “Cancer’s 5769
Recognition” are the under research to figure out the challenges make sense about ongoing and 5770
“Neutrosophic SuperHyperGraph” are chosen and elected to research about “Cancer’s Recog- 5775
nition”. Thus these complex and dense SuperHyperModels open up some avenues to research 5776
on theoretical segments and “Cancer’s Recognition”. Some avenues are posed to pursue this 5777
research. It’s also officially collected in the form of some questions and some problems. Assume 5778
a SuperHyperGraph. Assume a SuperHyperGraph. Then δ−SuperHyperStrict Dimension Dominating 5779
is a maximal of SuperHyperVertices with a maximum cardinality such that either of the 5780
following expressions hold for the (Neutrosophic) cardinalities of SuperHyperNeighbors of 5781
s ∈ S : there are |S ∩ N (s)| > |S ∩ (V \ N (s))| + δ; and |S ∩ N (s)| < |S ∩ (V \ N (s))| + δ. The 5782
first Expression, holds if S is an δ−SuperHyperOffensive. And the second Expression, holds 5783
if S is an δ−SuperHyperDefensive; a Neutrosophic δ−SuperHyperStrict Dimension Dominating is a 5784
maximal Neutrosophic of SuperHyperVertices with maximum Neutrosophic cardinality such 5785
that either of the following expressions hold for the Neutrosophic cardinalities of SuperHy- 5786
perNeighbors of s ∈ S there are: |S ∩ N (s)|N eutrosophic > |S ∩ (V \ N (s))|N eutrosophic + δ; 5787

and |S ∩ N (s)|N eutrosophic < |S ∩ (V \ N (s))|N eutrosophic + δ. The first Expression, holds 5788
if S is a Neutrosophic δ−SuperHyperOffensive. And the second Expression, holds if S is a 5789
Neutrosophic δ−SuperHyperDefensive It’s useful to define a “Neutrosophic” version of a 5790
SuperHyperStrict Dimension Dominating . Since there’s more ways to get type-results to make a 5791
SuperHyperStrict Dimension Dominating more understandable. For the sake of having Neutrosophic 5792
SuperHyperStrict Dimension Dominating, there’s a need to “redefine” the notion of a “SuperHyperStrict 5793
Dimension Dominating ”. The SuperHyperVertices and the SuperHyperEdges are assigned by the 5794
labels from the letters of the alphabets. In this procedure, there’s the usage of the position 5795
of labels to assign to the values. Assume a SuperHyperStrict Dimension Dominating . It’s redefined 5796
a Neutrosophic SuperHyperStrict Dimension Dominating if the mentioned Table holds, concerning, 5797
“The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges Belong to 5798
The Neutrosophic SuperHyperGraph” with the key points, “The Values of The Vertices & 5799
The Number of Position in Alphabet”, “The Values of The SuperVertices&The maximum 5800
SuperHyperStrict Dimension Dominating . It’s the main. It’ll be disciplinary to have the foundation of 5805
previous definition in the kind of SuperHyperClass. If there’s a need to have all SuperHyperStrict 5806
Dimension Dominating until the SuperHyperStrict Dimension Dominating, then it’s officially called a “Super- 5807
HyperStrict Dimension Dominating” but otherwise, it isn’t a SuperHyperStrict Dimension Dominating . There 5808
are some instances about the clarifications for the main definition titled a “SuperHyperStrict 5809
Dimension Dominating ”. These two examples get more scrutiny and discernment since there are 5810
characterized in the disciplinary ways of the SuperHyperClass based on a SuperHyperStrict 5811
Dimension Dominating . For the sake of having a Neutrosophic SuperHyperStrict Dimension Dominating, 5812
there’s a need to “redefine” the notion of a “Neutrosophic SuperHyperStrict Dimension Dominating” 5813
and a “Neutrosophic SuperHyperStrict Dimension Dominating ”. The SuperHyperVertices and the 5814
And a SuperHyperStrict Dimension Dominating are redefined to a “Neutrosophic SuperHyperStrict 5818

Dimension Dominating” if the intended Table holds. It’s useful to define “Neutrosophic” version 5819
of SuperHyperClasses. Since there’s more ways to get Neutrosophic type-results to make a 5820
Neutrosophic SuperHyperStrict Dimension Dominating more understandable. Assume a Neutrosophic 5821
SuperHyperGraph. There are some Neutrosophic SuperHyperClasses if the intended Table holds. 5822
Thus SuperHyperPath, SuperHyperStrict Dimension Dominating, SuperHyperStar, SuperHyperBi- 5823

partite, SuperHyperMultiPartite, and SuperHyperWheel, are “Neutrosophic SuperHyperPath”, 5824
“Neutrosophic SuperHyperStrict Dimension Dominating”, “Neutrosophic SuperHyperStar”, “Neutro- 5825
sophic SuperHyperBipartite”, “Neutrosophic SuperHyperMultiPartite”, and “Neutrosophic 5826
SuperHyperWheel” if the intended Table holds. A SuperHyperGraph has a “Neutrosophic Su- 5827
perHyperStrict Dimension Dominating” where it’s the strongest [the maximum Neutrosophic value from 5828
all the SuperHyperStrict Dimension Dominating amid the maximum value amid all SuperHyperVertices 5829
from a SuperHyperStrict Dimension Dominating .] SuperHyperStrict Dimension Dominating . A graph is a 5830
are the same. Assume a Neutrosophic SuperHyperGraph. There are some SuperHyperClasses 5832
as follows. It’s SuperHyperPath if it’s only one SuperVertex as intersection amid two given 5833

SuperHyperEdges with two exceptions; it’s SuperHyperStrict Dimension Dominating if it’s only one 5834
SuperVertex as intersection amid two given SuperHyperEdges; it’s SuperHyperStar it’s only one 5835
SuperVertex as intersection amid all SuperHyperEdges; it’s SuperHyperBipartite it’s only one 5836
SuperVertex as intersection amid two given SuperHyperEdges and these SuperVertices, forming 5837
two separate sets, has no SuperHyperEdge in common; it’s SuperHyperMultiPartite it’s only 5838
one SuperVertex as intersection amid two given SuperHyperEdges and these SuperVertices, 5839
cancer on the complex tracks and between complicated groups of cells could be fantasized by 5859
a Neutrosophic SuperHyperPath(-/SuperHyperStrict Dimension Dominating, SuperHyperStar, Super- 5860
HyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find either the 5861
longest SuperHyperStrict Dimension Dominating or the strongest SuperHyperStrict Dimension Dominating 5862
in those Neutrosophic SuperHyperModels. For the longest SuperHyperStrict Dimension Dominating, 5863
called SuperHyperStrict Dimension Dominating, and the strongest SuperHyperStrict Dimension Dominating, 5864
called Neutrosophic SuperHyperStrict Dimension Dominating, some general results are introduced. 5865
Beyond that in SuperHyperStar, all possible SuperHyperPaths have only two SuperHyperEdges 5866
but it’s not enough since it’s essential to have at least three SuperHyperEdges to form any 5867
style of a SuperHyperStrict Dimension Dominating. There isn’t any formation of any SuperHyperStrict 5868
Dimension Dominating but literarily, it’s the deformation of any SuperHyperStrict Dimension Dominating. It, 5869
literarily, deforms and it doesn’t form. A basic familiarity with Neutrosophic SuperHyperStrict 5870
Dimension Dominating theory, SuperHyperGraphs, and Neutrosophic SuperHyperGraphs theory are 5871
proposed. 5872
Keywords: Neutrosophic SuperHyperGraph, SuperHyperStrict Dimension Dominating, Cancer’s 5873


CHAPTER 28 5876
Applied Notions Under The Scrutiny Of 5877
The Motivation Of This Scientific 5878
Research 5879
In this scientific research, there are some ideas in the featured frameworks of motivations. I 5880
try to bring the motivations in the narrative ways. Some cells have been faced with some 5881
attacks from the situation which is caused by the cancer’s attacks. In this case, there are 5882
some embedded analysis on the ongoing situations which in that, the cells could be labelled 5883
as some groups and some groups or individuals have excessive labels which all are raised from 5884
the behaviors to overcome the cancer’s attacks. In the embedded situations, the individuals 5885
of cells and the groups of cells could be considered as “new groups”. Thus it motivates us to 5886
find the proper SuperHyperModels for getting more proper analysis on this messy story. I’ve 5887
found the SuperHyperModels which are officially called “SuperHyperGraphs” and “Neutrosophic 5888
SuperHyperGraphs”. In this SuperHyperModel, the cells and the groups of cells are defined as 5889
“SuperHyperVertices” and the relations between the individuals of cells and the groups of cells 5890
are defined as “SuperHyperEdges”. Thus it’s another motivation for us to do research on this 5891
SuperHyperModel based on the “Cancer’s Recognition”. Sometimes, the situations get worst. 5892
The situation is passed from the certainty and precise style. Thus it’s the beyond them. There 5893
are three descriptions, namely, the degrees of determinacy, indeterminacy and neutrality, for any 5894
object based on vague forms, namely, incomplete data, imprecise data, and uncertain analysis. 5895
The latter model could be considered on the previous SuperHyperModel. It’s SuperHyperModel. 5896
It’s SuperHyperGraph but it’s officially called “Neutrosophic SuperHyperGraphs”. The cancer 5897
is the disease but the model is going to figure out what’s going on this phenomenon. The special 5898
case of this disease is considered and as the consequences of the model, some parameters are used. 5899
The cells are under attack of this disease but the moves of the cancer in the special region are the 5900
matter of mind. The recognition of the cancer could help to find some treatments for this disease. 5901
The SuperHyperGraph and Neutrosophic SuperHyperGraph are the SuperHyperModels on the 5902
“Cancer’s Recognition” and both bases are the background of this research. Sometimes the 5903
of the moves of the cancer in the forms of alliances’ styles with the formation of the design and 5906
the architecture are formally called “ SuperHyperStrict Dimension Dominating” in the themes of jargons 5907
and buzzwords. The prefix “SuperHyper” refers to the theme of the embedded styles to figure 5908
267
out the background for the SuperHyperNotions. The recognition of the cancer in the long-term 5909
function. The specific region has been assigned by the model [it’s called SuperHyperGraph] 5910
and the long cycle of the move from the cancer is identified by this research. Sometimes the 5911
move of the cancer hasn’t be easily identified since there are some determinacy, indeterminacy 5912
and neutrality about the moves and the effects of the cancer on that region; this event leads us 5913
to choose another model [it’s said to be Neutrosophic SuperHyperGraph] to have convenient 5914
perception on what’s happened and what’s done. There are some specific models, which are 5915
well-known and they’ve got the names, and some general models. The moves and the traces of 5916
the cancer on the complex tracks and between complicated groups of cells could be fantasized 5917
by a Neutrosophic SuperHyperPath (-/SuperHyperStrict Dimension Dominating, SuperHyperStar, 5918
SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find either 5919
the optimal SuperHyperStrict Dimension Dominating or the Neutrosophic SuperHyperStrict Dimension 5920
Dominating in those Neutrosophic SuperHyperModels. Some general results are introduced. 5921
Beyond that in SuperHyperStar, all possible Neutrosophic SuperHyperPath s have only two 5922
SuperHyperEdges but it’s not enough since it’s essential to have at least three SuperHyperEdges 5923
to form any style of a SuperHyperStrict Dimension Dominating. There isn’t any formation of any 5924
SuperHyperStrict Dimension Dominating but literarily, it’s the deformation of any SuperHyperStrict 5925
Dimension Dominating. It, literarily, deforms and it doesn’t form. 5926
Question 28.0.1. How to define the SuperHyperNotions and to do research on them to find the 5927
“ amount of SuperHyperStrict Dimension Dominating” of either individual of cells or the groups of cells 5928
based on the fixed cell or the fixed group of cells, extensively, the “amount of SuperHyperStrict 5929
Dimension Dominating” based on the fixed groups of cells or the fixed groups of group of cells? 5930
Question 28.0.2. What are the best descriptions for the “Cancer’s Recognition” in terms of 5931
these messy and dense SuperHyperModels where embedded notions are illustrated? 5932
Thus it motivates us to define different types of “ SuperHyperStrict Dimension Dominating” and 5934
“Neutrosophic SuperHyperStrict Dimension Dominating” on “SuperHyperGraph” and “Neutrosophic 5935

SuperHyperGraph”. Then the research has taken more motivations to define SuperHyperClasses 5936
and to find some connections amid this SuperHyperNotion with other SuperHyperNotions. It 5937
motivates us to get some instances and examples to make clarifications about the framework of 5938
this research. The general results and some results about some connections are some avenues to 5939
make key point of this research, “Cancer’s Recognition”, more understandable and more clear. 5940
The framework of this research is as follows. In the beginning, I introduce basic definitions 5941
to clarify about preliminaries. In the subsection “Preliminaries”, initial definitions about 5942
SuperHyperGraphs and Neutrosophic SuperHyperGraph are deeply-introduced and in-depth- 5943
discussed. The elementary concepts are clarified and illustrated completely and sometimes 5944
review literature are applied to make sense about what’s going to figure out about the upcoming 5945
sections. The main definitions and their clarifications alongside some results about new notions, 5946
SuperHyperStrict Dimension Dominating and Neutrosophic SuperHyperStrict Dimension Dominating, are 5947
figured out in sections “ SuperHyperStrict Dimension Dominating” and “Neutrosophic SuperHyperStrict 5948
Dimension Dominating”. In the sense of tackling on getting results and in Strict Dimension Dominating to 5949
make sense about continuing the research, the ideas of SuperHyperUniform and Neutrosophic 5950
SuperHyperUniform are introduced and as their consequences, corresponded SuperHyperClasses 5951
are figured out to debut what’s done in this section, titled “Results on SuperHyperClasses” 5952
and “Results on Neutrosophic SuperHyperClasses”. As going back to origin of the notions, 5953

there are some smart steps toward the common notions to extend the new notions in new 5954
frameworks, SuperHyperGraph and Neutrosophic SuperHyperGraph, in the sections “Results 5955
on SuperHyperClasses” and “Results on Neutrosophic SuperHyperClasses”. The starter research 5956
about the general SuperHyperRelations and as concluding and closing section of theoretical 5957
research are contained in the section “General Results”. Some general SuperHyperRelations 5958
are fundamental and they are well-known as fundamental SuperHyperNotions as elicited 5959
and discussed in the sections, “General Results”, “ SuperHyperStrict Dimension Dominating”, 5960
“Neutrosophic SuperHyperStrict Dimension Dominating”, “Results on SuperHyperClasses” and “Results 5961
on Neutrosophic SuperHyperClasses”. There are curious questions about what’s done about 5962
the SuperHyperNotions to make sense about excellency of this research and going to figure out 5963
the word “best” as the description and adjective for this research as presented in section, 5964
“ SuperHyperStrict Dimension Dominating”. The keyword of this research debut in the section 5965
“Applications in Cancer’s Recognition” with two cases and subsections “Case 1: The Initial 5966
Steps Toward SuperHyperBipartite as SuperHyperModel” and “Case 2: The Increasing Steps 5967
Toward SuperHyperMultipartite as SuperHyperModel”. In the section, “Open Problems”, there 5968
are some scrutiny and discernment on what’s done and what’s happened in this research in 5969
the terms of “questions” and “problems” to make sense to figure out this research in featured 5970
style. The advantages and the limitations of this research alongside about what’s done in this 5971
research to make sense and to get sense about what’s figured out are included in the section, 5972
“Conclusion and Closing Remarks”. 5973

CHAPTER 29 5974
Neutrosophic Preliminaries Of This 5975
Scientific Research On the Redeemed 5976
Ways 5977
In this section, the basic material in this scientific research, is referred to [Single Valued Neut- 5978
rosophic Set](Ref.[HG11s],Definition 2.2,p.2), [Neutrosophic Set](Ref.[HG11s],Definition 5979

2.1,p.1), [Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG11s],Definition 2.5,p.2), [Charac- 5980
terization of the Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG11s],Definition 2.7,p.3), 5981
[t-norm](Ref.[HG11s], Definition 2.7, p.3), and [Characterization of the Neutrosophic Super- 5982
HyperGraph (NSHG)](Ref.[HG11s],Definition 2.7,p.3), [Neutrosophic Strength of the Neutro- 5983
sophic SuperHyperPaths] (Ref.[HG11s],Definition 5.3,p.7), and [Different Neutrosophic Types 5984
of Neutrosophic SuperHyperEdges (NSHE)] (Ref.[HG11s],Definition 5.4,p.7). Also, the new 5985

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

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

Let X be a Strict 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 5990
2.5,p.2). 5991
Assume V 0 is a given set. a Neutrosophic SuperHyperGraph (NSHG) S is a pair 5992
S = (V, E), where 5993
1, 2, . . . , n0 ); 5998
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 5999
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 6000

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



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

A binary operation ⊗ : [0, 1] × [0, 1] → [0, 1] is a t-norm if it satisfies the following for 6030
x, y, z, w ∈ [0, 1]: 6031
(i) 1 ⊗ x = x; 6032
(ii) x ⊗ y = y ⊗ x; 6033
(iii) x ⊗ (y ⊗ z) = (x ⊗ y) ⊗ z; 6034
(iv) If w ≤ x and y ≤ z then w ⊗ y ≤ x ⊗ z. 6035

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

where 6038

1, 2, . . . , n0 ); 6043
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 6044
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 6045
P
(vii) i supp(Vi ) = V, (i = 1, 2, . . . , n); 6046
0 0
P
(viii) i0 supp(Ei ) = V, (i = 1, 2, . . . , n ). 6047
0

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

Definition 29.0.12. A graph is SuperHyperUniform if it’s SuperHyperGraph and the number 6074
of elements of SuperHyperEdges are the same. 6075
To get more visions on SuperHyperUniform, the some SuperHyperClasses are introduced. It 6076
makes to have SuperHyperUniform more understandable. 6077
Definition 29.0.13. Assume a Neutrosophic SuperHyperGraph. There are some SuperHyper- 6078
Classes as follows. 6079
(i). It’s Neutrosophic SuperHyperPath if it’s only one SuperVertex as intersection amid 6080
two given SuperHyperEdges with two exceptions; 6081
(ii). it’s SuperHyperCycle if it’s only one SuperVertex as intersection amid two given 6082
SuperHyperEdges; 6083
(iii). it’s SuperHyperStar it’s only one SuperVertex as intersection amid all SuperHyperEdges; 6084
(iv). it’s SuperHyperBipartite it’s only one SuperVertex as intersection amid two given Supe- 6085
rHyperEdges and these SuperVertices, forming two separate sets, has no SuperHyperEdge 6086
in common; 6087
(v). it’s SuperHyperMultiPartite it’s only one SuperVertex as intersection amid two 6088
given SuperHyperEdges and these SuperVertices, forming multi separate sets, has no 6089
SuperHyperEdge in common; 6090
(vi). it’s SuperHyperWheel if it’s only one SuperVertex as intersection amid two given 6091
SuperHyperEdges and one SuperVertex has one SuperHyperEdge with any common 6092
SuperVertex. 6093
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 6094
(NSHV) V1 to Neutrosophic SuperHyperVertex (NSHV) Vs if either of following conditions hold: 6095
(i) Vi , Vi+1 ∈ Ei0 ; 6096
(ii) there’s a vertex vi ∈ Vi such that vi , Vi+1 ∈ Ei0 ; 6097
(iii) there’s a SuperVertex Vi0 ∈ Vi such that Vi0 , Vi+1 ∈ Ei0 ; 6098
(iv) there’s a vertex vi+1 ∈ Vi+1 such that Vi , vi+1 ∈ Ei0 ; 6099
0 0
(v) there’s a SuperVertex Vi+1 ∈ Vi+1 such that Vi , Vi+1 ∈ E i0 ; 6100
(vi) there are a vertex vi ∈ Vi and a vertex vi+1 ∈ Vi+1 such that vi , vi+1 ∈ Ei0 ; 6101
0 0
(vii) there are a vertex vi ∈ Vi and a SuperVertex Vi+1 ∈ Vi+1 such that vi , Vi+1 ∈ Ei0 ; 6102
(viii) there are a SuperVertex Vi0 ∈ Vi and a vertex vi+1 ∈ Vi+1 such that Vi0 , vi+1 ∈ Ei0 ; 6103
(ix) there are a SuperVertex Vi0 ∈ Vi and a SuperVertex Vi+1

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

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. 6105
(i) If for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | = 2, then NSHP is called path; 6106
(ii) if for all Ej 0 , |Ej 0 | = 2, and there’s Vi , |Vi | ≥ 1, then NSHP is called SuperPath; 6107
(iii) if for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | ≥ 2, then NSHP is called HyperPath; 6108
(iv) if there are Vi , Ej 0 , |Vi | ≥ 1, |Ej 0 | ≥ 2, then NSHP is called Neutrosophic SuperHy- 6109
perPath . 6110
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 6111
(i) Neutrosophic t-strength (min{T (Vi )}, m, n)si=1 ; 6112
(ii) Neutrosophic i-strength (m, min{I(Vi )}, n)si=1 ; 6113
(iii) Neutrosophic f-strength (m, n, min{F (Vi )})si=1 ; 6114
(iv) Neutrosophic strength (min{T (Vi )}, min{I(Vi )}, min{F (Vi )})si=1 . 6115
Definition 29.0.17 (Different Neutrosophic Types of Neutrosophic SuperHyperEdges (NSHE)). 6116

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

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


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

(xii) Neutrosophic Connective if (T (E), I(E), F (E)) ≥ maximum number of Neutrosophic 6129
strength of SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex (NSHV) Vi 6130
to Neutrosophic SuperHyperVertex (NSHV) Vj where 1 ≤ i, j ≤ s. 6131
Definition 29.0.18. (Different Neutrosophic Types of Neutrosophic SuperHyperStrict Dimension 6132

Dominating). 6133

(i) Neutrosophic e-SuperHyperStrict Dimension Dominating if the following expression is 6137

called Neutrosophic e-SuperHyperStrict Dimension Dominating criteria holds 6138

(ii) Neutrosophic re-SuperHyperStrict Dimension Dominating if the following expression is 6139

called Neutrosophic re-SuperHyperStrict Dimension Dominating criteria holds 6140

and |Ei |NEUTROSOPHIC CARDINALITY = |Ej |NEUTROSOPHIC CARDINALITY ; 6141
(iii) Neutrosophic v-SuperHyperStrict Dimension Dominating if the following expression is 6142

(iv) Neutrosophic rv-SuperHyperStrict Dimension Dominating if the following expression is 6144

and |Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; 6146
(v) Neutrosophic SuperHyperStrict Dimension Dominating if it’s either of Neutrosophic e- 6147


Definition 29.0.19. ((Neutrosophic) SuperHyperStrict Dimension Dominating). 6151

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


(ii) a Neutrosophic SuperHyperStrict Dimension Dominating if it’s either of Neutrosophic 6162


(iii) an Extreme SuperHyperStrict Dimension Dominating SuperHyperPolynomial if 6170

Neutrosophic rv-SuperHyperStrict Dimension Dominating and C(N SHG) for an Extreme Super- 6173
HyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme 6174
coefficients defined as the Extreme number of the maximum Extreme cardinality of the 6175
Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme cardinal- 6176
ity consecutive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that 6177
they form the Extreme SuperHyperStrict Dimension Dominating; and the Extreme power is 6178
(iv) a Neutrosophic SuperHyperStrict Dimension Dominating SuperHyperPolynomial 6180


S of high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and Neutro- 6187
sophic SuperHyperVertices such that they form the Neutrosophic SuperHyperStrict Dimension 6188
Dominating; and the Neutrosophic power is corresponded to its Neutrosophic coefficient; 6189
(v) an Extreme V-SuperHyperStrict Dimension Dominating if it’s either of Neutrosophic 6190



(vi) a Neutrosophic V-SuperHyperStrict Dimension Dominating if it’s either of Neutrosophic 6198


(vii) an Extreme V-SuperHyperStrict Dimension Dominating SuperHyperPolynomial if 6206

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

that they form the Extreme SuperHyperStrict Dimension Dominating; and the Extreme power is 6214
(viii) a Neutrosophic SuperHyperStrict Dimension Dominating SuperHyperPolynomial 6216

the Neutrosophic coefficients defined as the Neutrosophic number of the maximum Neut- 6221
rosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHy- 6222
perSet S of high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges 6223
and Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHy- 6224
perStrict Dimension Dominating; and the Neutrosophic power is corresponded to its Neutrosophic 6225
coefficient. 6226
Definition 29.0.20. ((Extreme/Neutrosophic)δ−SuperHyperStrict Dimension Dominating). 6227

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

SuperHyperStrict Dimension Dominating such that either of the following expressions hold for 6230
the Neutrosophic cardinalities of SuperHyperNeighbors of s ∈ S : 6231
|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 6232
(29.1), holds if S is an δ−SuperHyperDefensive; 6233


136TBL3
(ii) a Neutrosophic δ−SuperHyperStrict Dimension Dominating is a Neutrosophic kind 6234

of Neutrosophic SuperHyperStrict Dimension Dominating such that either of the following 6235
Neutrosophic expressions hold for the Neutrosophic cardinalities of SuperHyperNeighbors 6236
of s ∈ S : 6237
|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 6238

the Expression (29.1), holds if S is a Neutrosophic δ−SuperHyperDefensive. 6239
“redefine” the notion of “Neutrosophic SuperHyperGraph”. The SuperHyperVertices and the 6241
there’s the usage of the position of labels to assign to the values. 6243
136DEF1 Definition 29.0.21. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 6244
It’s redefined Neutrosophic SuperHyperGraph if the Table (29.1) holds. 6245
It’s useful to define a “Neutrosophic” version of SuperHyperClasses. Since there’s more ways 6246
to get Neutrosophic type-results to make a Neutrosophic more understandable. 6247
136DEF2 Definition 29.0.22. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = 6248

(V, E). There are some Neutrosophic SuperHyperClasses if the Table (29.2) holds. 6249
Thus Neutrosophic SuperHyperPath , SuperHyperStrict Dimension Dominating, SuperHyperStar, 6250

SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, are Neutrosophic 6251
SuperHyperPath, Neutrosophic SuperHyperCycle, Neutrosophic SuperHyperStar, 6252
Neutrosophic SuperHyperBipartite, Neutrosophic SuperHyperMultiPartite, and 6253
Neutrosophic SuperHyperWheel if the Table (29.2) holds. 6254
It’s useful to define a “Neutrosophic” version of a Neutrosophic SuperHyperStrict Dimension 6255
Dominating. Since there’s more ways to get type-results to make a Neutrosophic SuperHyperStrict 6256
Dimension Dominating more Neutrosophicly understandable. 6257
“redefine” the Neutrosophic notion of “Neutrosophic SuperHyperStrict Dimension Dominating”. The 6259
6262

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

136TBL4

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

CHAPTER 30 6265
Neutrosophic SuperHyper But As Strict Dimension Dominating 6266
Super Forms 6268
Definition 30.0.1. (Neutrosophic event). 6269
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 6270

S = (V, E) is a probability Strict Dimension Dominating. Any Neutrosophic k-subset of A of V 6271
is called Neutrosophic k-event and if k = 2, then Neutrosophic subset of A of V is called 6272
Neutrosophic event. The following expression is called Neutrosophic probability of A. 6273
X
E(A) = E(a). (30.1)
a∈A
Definition 30.0.2. (Neutrosophic Independent). 6274

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

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

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) 6281
is a probability Strict Dimension Dominating. Any k-function Strict Dimension Dominating like E is called 6282
Neutrosophic k-Variable. If k = 2, then any 2-function Strict Dimension Dominating like E is 6283
called Neutrosophic Variable. 6284
The notion of independent on Neutrosophic Variable is likewise. 6285
Definition 30.0.4. (Neutrosophic Expectation). 6286
283
is a probability Strict Dimension Dominating. A Neutrosophic k-Variable E has a number is called 6288
Neutrosophic Expectation if the following expression is called Neutrosophic Expectation 6289
criteria 6290
X
Ex(E) = E(α)P (α).
α∈V
Definition 30.0.5. (Neutrosophic Crossing). 6291

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

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

points in the plane, and let k be the number of pairs of points of P at unit SuperHyperDistance. 6312
Then k < 5n4/3 . 6313
Proof. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = 6314
(V, E) is a probability Strict Dimension Dominating. Draw a SuperHyperUnit SuperHyperCircle around 6315
each SuperHyperPoint of P. Let ni be the Neutrosophic number of these SuperHyperCircles 6316
i = 0n−1 ni = n and k = 12 i = 0n−1 ini .
P P
passing through exactly i points of P. Then 6317
Now form a Neutrosophic SuperHyperGraph H with SuperHyperVertex SuperHyperSet P 6318
whose SuperHyperEdges are the SuperHyperArcs between consecutive SuperHyperPoints on 6319
the SuperHyperCircles that pass through at least three SuperHyperPoints of P. Then 6320
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 6321

SuperHyperEdges. Delete from H one of each SuperHyperPair of parallel SuperHyperEdges, 6322
so as to obtain a simple Neutrosophic SuperHyperGraph G with e(G) ≥ k − n. Now 6323
cr(G) ≤ n(n − 1) because G is formed from at most n SuperHyperCircles, and any two 6324
SuperHyperCircles cross at most twice. Thus either e(G) < 4n, in which case k < 5n < 5n4/3 , 6325
3
or n2 > n(n − 1) ≥ cr(G) ≥ (k − n) /64n2 by the Neutrosophic Crossing Lemma, and 6326
4/3 4/3
k < 4n + n < 5n . 6327
Proposition 30.0.9. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 6328
Consider S = (V, E) is a probability Strict Dimension Dominating. Let X be a nonnegative Neutrosophic 6329
Variable and t a positive real number. Then 6330
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. 6331
Corollary 30.0.10. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 6332
Consider S = (V, E) is a probability Strict Dimension Dominating. Let Xn be a nonnegative integer- 6333
valued variable in a probability Strict Dimension Dominating (Vn , En ), n ≥ 1. If E(Xn ) → 0 as n → ∞, 6334
then P (Xn = 0) → 1 as n → ∞. 6335
Proof. 6336
Consider S = (V, E) is a probability Strict Dimension Dominating. A special SuperHyperGraph in Gn,p 6338
almost surely has stability number at most d2p−1 log ne. 6339

Proof. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 6340
S = (V, E) is a probability Strict Dimension Dominating. A special SuperHyperGraph in Gn,p is 6341
up. Let G ∈ Gn,p and let S be a given SuperHyperSet of k + 1 SuperHyperVertices of G, 6342
where k ∈ N. The probability that S is a stable SuperHyperSet of G is (1 − p)(k+1)choose2 , this 6343
being the probability that none of the (k + 1)choose2 pairs of SuperHyperVertices of S is a 6344
SuperHyperEdge of the Neutrosophic SuperHyperGraph G. 6345
Let AS denote the event that S is a stable SuperHyperSet of G, and let XS denote the indicator 6346
Neutrosophic Variable for this Neutrosophic Event. By equation, we have 6347
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 6348
X
X= {XS : S ⊆ V, |S| = k + 1}
and so, by those, 6349
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: 6350
nk+1
(n choose k+1) ≤ and1 − p ≤ e−p .
(k + 1)!
This yields the following upper bound on E(X). 6351
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 6352
least as fast as the logarithm of n, implies that E(X) → 0 as n → ∞. Because X is integer-valued 6353
and nonnegative, we deduce from Corollary that P (X = 0) → 1 as n → ∞. Consequently, a 6354
Neutrosophic SuperHyperGraph in Gn,p almost surely has stability number at most k. 6355
Definition 30.0.12. (Neutrosophic Variance). 6356
is a probability Strict Dimension Dominating. A Neutrosophic k-Variable E has a number is called 6358
Neutrosophic Variance if the following expression is called Neutrosophic Variance 6359
criteria 6360
2
V x(E) = Ex((X − Ex(X)) ).
Consider S = (V, E) is a probability Strict Dimension Dominating. Let X be a Neutrosophic Variable 6362
and let t be a positive real number. Then 6363
V (X)
E(|X − Ex(X)| ≥ t) ≤ .
t2

S = (V, E) is a probability Strict Dimension Dominating. Let X be a Neutrosophic Variable and let t 6365
be a positive real number. Then 6366
2
2 Ex((X − Ex(X)) ) V (X)
E(|X − Ex(X)| ≥ t) = E((X − Ex(X)) ≥ t2 ) ≤ 2
= .
t t2
6367
Consider S = (V, E) is a probability Strict Dimension Dominating. Let Xn be a Neutrosophic Variable 6369
in a probability Strict Dimension Dominating (Vn , En ), n ≥ 1. If Ex(Xn ) 6= 0 and V (Xn ) << E 2 (Xn ), 6370
then 6371
E(Xn = 0) → 0 as n → ∞
S = (V, E) is a probability Strict Dimension Dominating. Set X := Xn and t := |Ex(Xn )| in 6373
Chebyshev’s Inequality, and observe that E(Xn = 0) ≤ E(|Xn − Ex(Xn )| ≥ |Ex(Xn )|) because 6374
|Xn − Ex(Xn )| = |Ex(Xn )| when Xn = 0. 6375
Consider S = (V, E) is a probability Strict Dimension Dominating. Let G ∈ Gn,1/2 . For 0 ≤ k ≤ n, set 6377
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 6378
one. Then almost surely α(G) takes one of the three values k ∗ − 2, k ∗ − 1, k ∗ . 6379
S = (V, E) is a probability Strict Dimension Dominating. As in the proof of related Theorem, the 6381
result is straightforward. 6382
Consider S = (V, E) is a probability Strict Dimension Dominating. Let G ∈ Gn,1/2 and let f and k ∗ be 6384
as defined in previous Theorem. Then either: 6385
(i). f (k ∗ ) << 1, in which case almost surely α(G) is equal to either k ∗ − 2 or k ∗ − 1, or 6386
(ii). f (k ∗ − 1) >> 1, in which case almost surely α(G) is equal to either k ∗ − 1 or k ∗ . 6387
Definition 30.0.17. (Neutrosophic Threshold). 6390

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

Definition 30.0.18. (Neutrosophic Balanced). 6397

is a probability Strict Dimension Dominating. Let F be a fixed Neutrosophic SuperHyperGraph. Then 6399
there is a threshold function for the property of containing a copy of F as a Neutrosophic 6400
SubSuperHyperGraph is called Neutrosophic Balanced. 6401
Theorem 30.0.19. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = 6402

(V, E). Consider S = (V, E) is a probability Strict Dimension Dominating. Let F be a nonempty 6403
balanced Neutrosophic SubSuperHyperGraph with k SuperHyperVertices and l SuperHyperEdges. 6404
Then n−k/l is a threshold function for the property of containing F as a Neutrosophic 6405
SubSuperHyperGraph. 6406
136EXM1 Example 30.0.20. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E) 6409
in the mentioned Neutrosophic Figures in every Neutrosophic items. 6410
• On the Figure (30.1), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 6411

SuperHyperStrict Dimension Dominating, is up. The Neutrosophic Algorithm is Neutrosophicly 6412
straightforward. E1 and E3 are some empty Neutrosophic SuperHyperEdges but E2 6413
is a loop Neutrosophic SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. 6414

Thus in the terms of Neutrosophic SuperHyperNeighbor, there’s only one Neutrosophic 6415
SuperHyperEdge, namely, E4 . The Neutrosophic SuperHyperVertex, V3 is Neutrosophic 6416
isolated means that there’s no Neutrosophic SuperHyperEdge has it as a Neutrosophic 6417
endpoint. Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in every given 6418
Neutrosophic SuperHyperStrict Dimension Dominating. 6419
C(N SHG)Neutrosophic Strict Dimension Dominating =

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

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

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

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

Dominating. 6429

{}.
= 0z 0 .
{}.
= 0z 0 .
6430


{}.
= 0z 0 .
{}.



= 0z 0 .
6434


{}.
= 0z 0 .
{}.
= 0z 0 .
6438






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


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



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


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




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


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


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


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







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


{EN SHG − {E1 , E2 }}.


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


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




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


{E3i+1 }1i=0 .


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


{E3i+1 }1i=0 .


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


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







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


{E3i+1 }3i=0 .



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


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


= z 3−a .
6502


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


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

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


Neutrosophic SuperHyperStrict Dimension Dominating in the Neutrosophic Example (42.0.3) 95NHG2
Dominating if for any of them, and any of other corresponded Neutrosophic SuperHyperVertex, 6513
some interior Neutrosophic SuperHyperVertices are mutually Neutrosophic SuperHyperNeighbors 6514
with no Neutrosophic exception at all minus all Neutrosophic SuperHypeNeighbors to any amount 6515
of them. 6516
Proposition 30.0.22. Assume a connected non-obvious Neutrosophic SuperHyperGraph ESHG : 6517
(V, E). There’s only one Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) has only the maximum 6518
possibilities of the distinct interior Neutrosophic SuperHyperVertices inside of any given 6519
Neutrosophic quasi-R-Strict Dimension Dominating minus all Neutrosophic SuperHypeNeighbor to some 6520
of them but not all of them. In other words, there’s only an unique Neutrosophic SuperHyperEdge 6521
E ∈ EESHG:(V,E) has only two distinct Neutrosophic SuperHyperVertices in an Neutrosophic 6522
quasi-R-Strict Dimension Dominating, minus all Neutrosophic SuperHypeNeighbor to some of them but 6523
not all of them. 6524
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-Strict Dimension Dominating is at least
V \ (V \ {aE , bE , cE , . . . , zE }).
It’s straightforward that the Neutrosophic cardinality of the Neutrosophic R-Strict Dimension Dominating 6525
is at least the maximum Neutrosophic number of Neutrosophic SuperHyperVertices of the 6526
Neutrosophic SuperHyperEdges with the maximum number of the Neutrosophic SuperHyperEdges. 6527
In other words, the maximum number of the Neutrosophic SuperHyperEdges contains 6528
the maximum Neutrosophic number of Neutrosophic SuperHyperVertices are renamed to 6529

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

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

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

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

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

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

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

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

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

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

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

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

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

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

z
and
is formalized with mathematical literatures on the Neutrosophic R-Strict 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, 6541
Neutrosophic R-Strict Dimension Dominating =

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

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

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

the maximum Neutrosophic number of Neutrosophic SuperHyperVertices are renamed to Neut- 6547
rosophic Strict Dimension Dominating in some cases but the maximum number of the Neutrosophic 6548
SuperHyperEdge with the maximum Neutrosophic number of Neutrosophic SuperHyperVertices, 6549
has the Neutrosophic SuperHyperVertices are contained in a Neutrosophic R-Strict Dimension 6550
Dominating. 6551
The obvious SuperHyperGraph has no Neutrosophic SuperHyperEdges. But the non-obvious 6552
Neutrosophic SuperHyperModel is up. The quasi-SuperHyperModel addresses some issues about 6553
the Neutrosophic optimal SuperHyperObject. It specially delivers some remarks on the Neutro- 6554
sophic SuperHyperSet of the Neutrosophic SuperHyperVertices such that there’s distinct amount 6555
of Neutrosophic SuperHyperEdges for distinct amount of Neutrosophic SuperHyperVertices up 6556
to all taken from that Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices 6557
but this Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices is either has 6558
the maximum Neutrosophic SuperHyperCardinality or it doesn’t have maximum Neutrosophic 6559

SuperHyperCardinality. In a non-obvious SuperHyperModel, there’s at least one Neutrosophic 6560
SuperHyperEdge containing at least all Neutrosophic SuperHyperVertices. Thus it forms a 6561
Neutrosophic quasi-R-Strict Dimension Dominating where the Neutrosophic completion of the Neutro- 6562
sophic incidence is up in that. Thus it’s, literarily, a Neutrosophic embedded R-Strict Dimension 6563
Dominating. The SuperHyperNotions of embedded SuperHyperSet and quasi-SuperHyperSet 6564
coincide. In the original setting, these types of SuperHyperSets only don’t satisfy on the 6565
maximum SuperHyperCardinality. Thus the embedded setting is elected such that those Super- 6566
HyperSets have the maximum Neutrosophic SuperHyperCardinality and they’re Neutrosophic 6567
SuperHyperOptimal. The less than two distinct types of Neutrosophic SuperHyperVertices are 6568
included in the minimum Neutrosophic style of the embedded Neutrosophic R-Strict Dimension 6569
Dominating. The interior types of the Neutrosophic SuperHyperVertices are deciders. Since the 6570
Neutrosophic number of SuperHyperNeighbors are only affected by the interior Neutrosophic 6571
SuperHyperVertices. The common connections, more precise and more formal, the perfect 6572
unique connections inside the Neutrosophic SuperHyperSet for any distinct types of Neutro- 6573
sophic SuperHyperVertices pose the Neutrosophic R-Strict Dimension Dominating. Thus Neutrosophic 6574
exterior SuperHyperVertices could be used only in one Neutrosophic SuperHyperEdge and in 6575
Neutrosophic SuperHyperRelation with the interior Neutrosophic SuperHyperVertices in that 6576
Neutrosophic SuperHyperEdge. In the embedded Neutrosophic Strict Dimension Dominating, there’s 6577
the usage of exterior Neutrosophic SuperHyperVertices since they’ve more connections inside 6578
more than outside. Thus the title “exterior” is more relevant than the title “interior”. One Neut- 6579
rosophic SuperHyperVertex has no connection, inside. Thus, the Neutrosophic SuperHyperSet 6580
of the Neutrosophic SuperHyperVertices with one SuperHyperElement has been ignored in the 6581
exploring to lead on the optimal case implying the Neutrosophic R-Strict Dimension Dominating. The 6582
Neutrosophic R-Strict Dimension Dominating with the exclusion of the exclusion of all Neutrosophic 6583
SuperHyperVertices in one Neutrosophic SuperHyperEdge and with other terms, the Neutro- 6584
sophic R-Strict Dimension Dominating with the inclusion of all Neutrosophic SuperHyperVertices in one 6585
Neutrosophic SuperHyperEdge, is a Neutrosophic quasi-R-Strict Dimension Dominating. To sum them 6586
up, in a connected non-obvious Neutrosophic SuperHyperGraph ESHG : (V, E). There’s only 6587
one Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) has only the maximum possibilities of the 6588
distinct interior Neutrosophic SuperHyperVertices inside of any given Neutrosophic quasi-R-Strict 6589
Dimension Dominating minus all Neutrosophic SuperHypeNeighbor to some of them but not all of 6590
them. In other words, there’s only an unique Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) 6591
has only two distinct Neutrosophic SuperHyperVertices in an Neutrosophic quasi-R-Strict Dimension 6592

Dominating, minus all Neutrosophic SuperHypeNeighbor to some of them but not all of them. 6593
The main definition of the Neutrosophic R-Strict Dimension Dominating has two titles. a Neut- 6594
rosophic quasi-R-Strict Dimension Dominating and its corresponded quasi-maximum Neutrosophic 6595
R-SuperHyperCardinality are two titles in the terms of quasi-R-styles. For any Neutrosophic 6596
number, there’s a Neutrosophic quasi-R-Strict Dimension Dominating with that quasi-maximum Neut- 6597
rosophic SuperHyperCardinality in the terms of the embedded Neutrosophic SuperHyper- 6598
Graph. If there’s an embedded Neutrosophic SuperHyperGraph, then the Neutrosophic quasi- 6599
SuperHyperNotions lead us to take the collection of all the Neutrosophic quasi-R-Strict Dimension 6600
Dominatings for all Neutrosophic numbers less than its Neutrosophic corresponded maximum 6601
number. The essence of the Neutrosophic Strict Dimension Dominating ends up but this essence starts 6602
up in the terms of the Neutrosophic quasi-R-Strict Dimension Dominating, again and more in the 6603
operations of collecting all the Neutrosophic quasi-R-Strict Dimension Dominatings acted on the all 6604
possible used formations of the Neutrosophic SuperHyperGraph to achieve one Neutrosophic 6605
number. This Neutrosophic number is 6606
considered as the equivalence class for all corresponded quasi-R-Strict Dimension Dominatings. Let 6607
zNeutrosophic Number , SNeutrosophic SuperHyperSet and GNeutrosophic Strict Dimension Dominating be a Neut- 6608
rosophic number, a Neutrosophic SuperHyperSet and a Neutrosophic Strict Dimension Dominating. 6609
Then 6610
[zNeutrosophic Number ]Neutrosophic Class = {SNeutrosophic SuperHyperSet |

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

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

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


= max zNeutrosophic Number }.
[zNeutrosophic Number ]Neutrosophic Class
In more concise and more convenient ways, the modified definition for the Neutrosophic Strict 6615
Dimension Dominating poses the upcoming expressions. 6616

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

= max zNeutrosophic Number

And then, 6618


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

6620

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


6621


6622


Now, the extension of these types of approaches is up. Since the new term, “Neutrosophic 6623
SuperHyperNeighborhood”, could be redefined as the collection of the Neutrosophic Super- 6624
HyperVertices such that any amount of its Neutrosophic SuperHyperVertices are incident to 6625
a Neutrosophic SuperHyperEdge. It’s, literarily, another name for “Neutrosophic Quasi-Strict 6626
Dimension Dominating” but, precisely, it’s the generalization of “Neutrosophic Quasi-Strict Dimension 6627
Dominating” since “Neutrosophic Quasi-Strict Dimension Dominating” happens “Neutrosophic Strict Dimen- 6628
sion Dominating” in a Neutrosophic SuperHyperGraph as initial framework and background but 6629
“Neutrosophic SuperHyperNeighborhood” may not happens “Neutrosophic Strict Dimension Dominat- 6630
ing” in a Neutrosophic SuperHyperGraph as initial framework and preliminarily background 6631

since there are some ambiguities about the Neutrosophic SuperHyperCardinality arise from it. 6632
To get orderly keywords, the terms, “Neutrosophic SuperHyperNeighborhood”, “Neutrosophic 6633
Quasi-Strict Dimension Dominating”, and “Neutrosophic Strict Dimension Dominating” are up. 6634
Thus, let 6635
zNeutrosophic Number , NNeutrosophic SuperHyperNeighborhood and 6636

GNeutrosophic Strict Dimension Dominating be a Neutrosophic number, a Neutrosophic SuperHyper- 6637
Neighborhood and a Neutrosophic Strict Dimension Dominating and the new terms are up. 6638
GNeutrosophic Strict Dimension Dominating ∈ ∪zNeutrosophic Number

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

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

6640

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

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

6643

∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class =

6644



6645


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

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

doesn’t have less than two SuperHyperVertices inside the intended Neutrosophic SuperHyperSet
since they’ve come from at least so far an SuperHyperEdge. Thus the non-obvious simple
Neutrosophic type-SuperHyperSet of the Neutrosophic R-Strict Dimension Dominating is up. To sum
them up, the Neutrosophic SuperHyperSet of Neutrosophic SuperHyperVertices,
Is the non-obvious simple Neutrosophic type-SuperHyperSet of the Neutrosophic R-Strict 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-Strict 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 Strict
Dimension Dominating and it’s an Neutrosophic Strict Dimension Dominating. Since it’s
the maximum Neutrosophic cardinality of a Neutrosophic SuperHyperSet S of Neut-

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

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

To sum them up, assume a connected loopless Neutrosophic SuperHyperGraph ESHG : (V, E).
Then in the worst case, literally,
is a Neutrosophic R-Strict Dimension Dominating. In other words, the least cardinality, the lower sharp
bound for the cardinality, of a Neutrosophic R-Strict Dimension Dominating is the cardinality of
6653
To sum them up, in a connected Neutrosophic SuperHyperGraph ESHG : (V, E). The all 6654
interior Neutrosophic SuperHyperVertices belong to any Neutrosophic quasi-R-Strict Dimension 6655
Dominating if for any of them, and any of other corresponded Neutrosophic SuperHyperVertex, 6656
some interior Neutrosophic SuperHyperVertices are mutually Neutrosophic SuperHyperNeigh- 6657
bors with no Neutrosophic exception at all minus all Neutrosophic SuperHypeNeighbors to any 6658
amount of them. 6659
Assume a connected Neutrosophic SuperHyperGraph ESHG : (V, E). Let a Neutrosophic Supe- 6660
rHyperEdge ESHE : E ∈ EESHG:(V,E) has some Neutrosophic SuperHyperVertices r. Consider 6661
all Neutrosophic numbers of those Neutrosophic SuperHyperVertices from that Neutrosophic 6662
SuperHyperEdge excluding excluding more than r distinct Neutrosophic SuperHyperVertices, 6663
exclude to any given Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices. 6664
Consider there’s a Neutrosophic R-Strict Dimension Dominating with the least cardinality, the lower 6665
sharp Neutrosophic bound for Neutrosophic cardinality. Assume a connected Neutrosophic 6666
SuperHyperGraph ESHG : (V, E). The Neutrosophic SuperHyperSet of the Neutrosophic 6667
SuperHyperVertices VESHE \ {z} is a Neutrosophic SuperHyperSet S of the Neutrosophic Su- 6668
perHyperVertices such that there’s a Neutrosophic SuperHyperEdge to have some Neutrosophic 6669
SuperHyperVertices uniquely but it isn’t a Neutrosophic R-Strict Dimension Dominating. Since it 6670
doesn’t have 6671
6672

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

rosophic SuperHyperVertices such that there’s a Neutrosophic SuperHyperEdge to have some 6674
SuperHyperVertices uniquely. The Neutrosophic SuperHyperSet of the Neutrosophic Supe- 6675
rHyperVertices VESHE ∪ {z} is the maximum Neutrosophic cardinality of a Neutrosophic 6676
SuperHyperSet S of Neutrosophic SuperHyperVertices but it isn’t a Neutrosophic R-Strict Dimension 6677
Dominating. Since it doesn’t do the Neutrosophic procedure such that such that there’s a Neut- 6678
rosophic SuperHyperEdge to have some Neutrosophic SuperHyperVertices uniquely [there are at 6679
least one Neutrosophic SuperHyperVertex outside implying there’s, sometimes in the connected 6680
Neutrosophic SuperHyperGraph ESHG : (V, E), a Neutrosophic SuperHyperVertex, titled its 6681
Neutrosophic SuperHyperNeighbor, to that Neutrosophic SuperHyperVertex in the Neutrosophic 6682
SuperHyperSet S so as S doesn’t do “the Neutrosophic procedure”.]. There’s only one Neutro- 6683
sophic SuperHyperVertex outside the intended Neutrosophic SuperHyperSet, VESHE ∪ {z}, in 6684
the terms of Neutrosophic SuperHyperNeighborhood. Thus the obvious Neutrosophic R-Strict 6685
Dimension Dominating, VESHE is up. The obvious simple Neutrosophic type-SuperHyperSet of the 6686
Neutrosophic R-Strict Dimension Dominating, VESHE , is a Neutrosophic SuperHyperSet, VESHE , 6687
includes only all Neutrosophic SuperHyperVertices does forms any kind of Neutrosophic pairs 6688
are titled Neutrosophic SuperHyperNeighbors in a connected Neutrosophic SuperHyperGraph 6689
ESHG : (V, E). Since the Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVer- 6690
tices VESHE , is the maximum Neutrosophic SuperHyperCardinality of a Neutrosophic 6691

SuperHyperSet S of Neutrosophic SuperHyperVertices such that there’s a Neutrosophic 6692
SuperHyperEdge to have some Neutrosophic SuperHyperVertices uniquely. Thus, in a connected 6693
Neutrosophic SuperHyperGraph ESHG : (V, E). Any Neutrosophic R-Strict Dimension Dominating 6694
only contains all interior Neutrosophic SuperHyperVertices and all exterior Neutrosophic 6695
SuperHyperVertices from the unique Neutrosophic SuperHyperEdge where there’s any of them 6696
has all possible Neutrosophic SuperHyperNeighbors in and there’s all Neutrosophic SuperHy- 6697
perNeighborhoods in with no exception minus all Neutrosophic SuperHypeNeighbors to some of 6698
them not all of them but everything is possible about Neutrosophic SuperHyperNeighborhoods 6699
and Neutrosophic SuperHyperNeighbors out. 6700
The SuperHyperNotion, namely, Strict Dimension Dominating, is up. There’s neither empty SuperHy- 6701
perEdge nor loop SuperHyperEdge. The following Neutrosophic SuperHyperSet of Neutrosophic 6702
SuperHyperEdges[SuperHyperVertices] is the simple Neutrosophic type-SuperHyperSet of 6703

the Neutrosophic Strict Dimension Dominating. The Neutrosophic SuperHyperSet of Neutrosophic 6704
SuperHyperEdges[SuperHyperVertices], 6705

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


Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperEdges[SuperHyperVertices], 6707

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

Graph ESHG : (V, E) is a Neutrosophic type-SuperHyperSet with 6709
6710
rosophic SuperHyperEdges[SuperHyperVertices] such that there’s no Neutrosophic Super- 6712
HyperVertex of a Neutrosophic SuperHyperEdge is common and there’s an Neutrosophic 6713
SuperHyperEdge for all Neutrosophic SuperHyperVertices. There are not only two Neut- 6714
rosophic SuperHyperVertices inside the intended Neutrosophic SuperHyperSet. Thus the 6715
non-obvious Neutrosophic Strict Dimension Dominating is up. The obvious simple Neutrosophic type- 6716
SuperHyperSet called the Neutrosophic Strict Dimension Dominating is a Neutrosophic SuperHyperSet 6717
includes only two Neutrosophic SuperHyperVertices. But the Neutrosophic SuperHyperSet of 6718
the Neutrosophic SuperHyperEdges[SuperHyperVertices], 6719

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- 6720
Set. Thus the non-obvious simple Neutrosophic type-SuperHyperSet of the Neutrosophic Strict 6721
Dimension Dominating is up. To sum them up, the Neutrosophic SuperHyperSet of the Neutrosophic 6722
SuperHyperEdges[SuperHyperVertices], 6723

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 Strict Di- 6724
mension Dominating. Since the Neutrosophic SuperHyperSet of the Neutrosophic SuperHy- 6725

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

that there’s no a Neutrosophic SuperHyperEdge for some Neutrosophic SuperHyperVertices 6729
given by that Neutrosophic type-SuperHyperSet called the Neutrosophic Strict Dimension Dominating 6730
and it’s an Neutrosophic Strict Dimension Dominating. Since it’s 6731
6732
rosophic SuperHyperEdges[SuperHyperVertices] such that there’s no Neutrosophic Super- 6734

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

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

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 Strict Dimension 6739
, not:
Dominating 6740

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

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- 6742
HyperGraph ESHG : (V, E). It’s interesting to mention that the only non-obvious simple 6743
Neutrosophic type-SuperHyperSet called the 6744
“Neutrosophic Strict Dimension Dominating ” 6745
amid those obvious[non-obvious] simple Neutrosophic type-SuperHyperSets called the 6746
Neutrosophic ,
is only and only 6748

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


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

CHAPTER 31 6750
The Neutrosophic Departures on The 6751
Theoretical Results Toward Theoretical 6752
Motivations 6753
The previous Neutrosophic approach apply on the upcoming Neutrosophic results on 6754
Neutrosophic SuperHyperClasses. 6755
Proposition 31.0.1. Assume a connected Neutrosophic SuperHyperPath ESHP : (V, E). Then 6756

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

136EXM18a Example 31.0.2. In the Figure (31.1), the connected Neutrosophic SuperHyperPath ESHP : 6764
(V, E), is highlighted and featured. The Neutrosophic SuperHyperSet, in the Neutrosophic 6765
SuperHyperModel (31.1), is the SuperHyperStrict Dimension Dominating. 6766
Proposition 31.0.3. Assume a connected Neutrosophic SuperHyperCycle ESHC : (V, E). Then 6767

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

136EXM19a Example 31.0.4. In the Figure (31.2), the connected Neutrosophic SuperHyperCycle N SHC : 6775
(V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, in the 6776
Neutrosophic SuperHyperModel (31.2), is the Neutrosophic SuperHyperStrict Dimension Dominating. 6777

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

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

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

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

Neutrosophic SuperHyperStrict 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 6781

136EXM20a Example 31.0.6. In the Figure (31.3), the connected Neutrosophic SuperHyperStar ESHS : 6786
(V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, by the Algorithm 6787
in previous Neutrosophic result, of the Neutrosophic SuperHyperVertices of the connected 6788
Neutrosophic SuperHyperStar ESHS : (V, E), in the Neutrosophic SuperHyperModel (31.3), is 6789
the Neutrosophic SuperHyperStrict Dimension Dominating. 6790
Proposition 31.0.7. Assume a connected Neutrosophic SuperHyperBipartite ESHB : (V, E). 6791

Then 6792

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

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

Figure 31.4: Neutrosophic SuperHyperBipartite Neutrosophic Associated to the Neutrosophic

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

result, of the Neutrosophic SuperHyperVertices of the connected Neutrosophic SuperHyper- 6810
Bipartite ESHB : (V, E), in the Neutrosophic SuperHyperModel (31.4), is the Neutrosophic 6811
Proposition 31.0.9. Assume a connected Neutrosophic SuperHyperMultipartite ESHM : (V, E). 6813
Then 6814


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

could be applied. There are only z 0 SuperHyperParts. Thus every SuperHyperPart could have 6823
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest path taken from a connected Neutrosophic SuperHyperMultipartite ESHM : (V, E). 6825
Thus only some SuperHyperVertices and only minimum-Neutrosophic-of-SuperHyperPart 6826
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 6830
ESHM : (V, E), is highlighted and Neutrosophic featured. The obtained Neutrosophic 6831
SuperHyperSet, by the Algorithm in previous Neutrosophic result, of the Neutrosophic 6832
SuperHyperVertices of the connected Neutrosophic SuperHyperMultipartite ESHM : (V, E), 6833
in the Neutrosophic SuperHyperModel (31.5), is the Neutrosophic SuperHyperStrict Dimension 6834
Dominating. 6835
∗
Proposition 31.0.11. Assume a connected Neutrosophic SuperHyperWheel ESHW : (V, E∪E ). 6836
Then, 6837

|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 6838
P :
CEN T ER, E2∗
6839
P :
E1∗ , V1EXT ERN AL ,
E2∗ , CEN T ER
is a longest SuperHyperStrict Dimension Dominating taken from a connected Neutrosophic SuperHy- 6840
perWheel ESHW : (V, E). There’s a new way to redefine as 6841

straightforward. Then there’s at least one SuperHyperStrict Dimension Dominating. Thus the notion 6844
of quasi isn’t up and the SuperHyperNotions based on SuperHyperStrict Dimension Dominating 6845
could be applied. The unique embedded SuperHyperStrict Dimension Dominating proposes some 6846
longest SuperHyperStrict Dimension Dominating excerpt from some representatives. The latter is 6847
136EXM23a Example 31.0.12. In the Neutrosophic Figure (31.6), the connected Neutrosophic SuperHyper- 6849
Wheel N SHW : (V, E), is Neutrosophic highlighted and featured. The obtained Neutrosophic 6850
SuperHyperSet, by the Algorithm in previous result, of the Neutrosophic SuperHyperVer- 6851
tices of the connected Neutrosophic SuperHyperWheel ESHW : (V, E), in the Neutrosophic 6852
SuperHyperModel (31.6), is the Neutrosophic SuperHyperStrict Dimension Dominating. 6853

Figure 31.6: a Neutrosophic SuperHyperWheel Neutrosophic Associated to the Neutrosophic

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

CHAPTER 32 6854
The Surveys of Mathematical Sets On 6855
The Results But As The Initial Motivation 6856
For the SuperHyperStrict Dimension Dominating, Neutrosophic SuperHyperStrict Dimension Dominating, and 6857
the Neutrosophic SuperHyperStrict Dimension Dominating, some general results are introduced. 6858
Remark 32.0.1. Let remind that the Neutrosophic SuperHyperStrict Dimension Dominating is 6859
“redefined” on the positions of the alphabets. 6860
Corollary 32.0.2. Assume Neutrosophic SuperHyperStrict Dimension Dominating. Then 6861
N eutrosophic SuperHyperStrictDimensionDominating =
{theSuperHyperStrictDimensionDominatingof theSuperHyperV ertices |
max |SuperHyperOf f ensive
SuperHyperStrictDimensionDominating
|N eutrosophiccardinalityamidthoseSuperHyperStrictDimensionDominating. }
plus one Neutrosophic SuperHypeNeighbor to one. Where σi is the unary operation on the 6862
SuperHyperVertices of the SuperHyperGraph to assign the determinacy, the indeterminacy and 6863
the neutrality, for i = 1, 2, 3, respectively. 6864
Corollary 32.0.3. Assume a Neutrosophic SuperHyperGraph on the same identical letter of the 6865
alphabet. Then the notion of Neutrosophic SuperHyperStrict Dimension Dominating and SuperHyperStrict 6866
Dimension Dominating coincide. 6867
Corollary 32.0.4. Assume a Neutrosophic SuperHyperGraph on the same identical letter of 6868
the alphabet. Then a consecutive sequence of the SuperHyperVertices is a Neutrosophic 6869
SuperHyperStrict Dimension Dominating if and only if it’s a SuperHyperStrict Dimension Dominating. 6870
Corollary 32.0.5. Assume a Neutrosophic SuperHyperGraph on the same identical letter of the 6871
alphabet. Then a consecutive sequence of the SuperHyperVertices is a strongest SuperHyperStrict 6872
Dimension Dominating if and only if it’s a longest SuperHyperStrict Dimension Dominating. 6873
Corollary 32.0.6. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph on the same 6874
identical letter of the alphabet. Then its Neutrosophic SuperHyperStrict Dimension Dominating is its 6875
339
Corollary 32.0.7. Assume a Neutrosophic SuperHyperPath(-/SuperHyperStrict Dimension Dominating, 6877

SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel) on the same 6878
identical letter of the alphabet. Then its Neutrosophic SuperHyperStrict Dimension Dominating is its 6879
Corollary 32.0.8. Assume a Neutrosophic SuperHyperGraph. Then its Neutrosophic SuperHy- 6881
perStrict Dimension Dominating isn’t well-defined if and only if its SuperHyperStrict Dimension Dominating 6882
isn’t well-defined. 6883
Corollary 32.0.9. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph. Then its 6884

Neutrosophic SuperHyperStrict Dimension Dominating isn’t well-defined if and only if its SuperHyperStrict 6885

Neutrosophic SuperHyperStrict Dimension Dominating isn’t well-defined if and only if its SuperHyperStrict 6889
Corollary 32.0.11. Assume a Neutrosophic SuperHyperGraph. Then its Neutrosophic Super- 6891
HyperStrict Dimension Dominating is well-defined if and only if its SuperHyperStrict Dimension Dominating is 6892
well-defined. 6893
Corollary 32.0.12. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph. Then its 6894
Neutrosophic SuperHyperStrict Dimension Dominating is well-defined if and only if its SuperHyperStrict 6895

Neutrosophic SuperHyperStrict Dimension Dominating is well-defined if and only if its SuperHyperStrict 6899
Proposition 32.0.14. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. Then V is 6901
(i) : the dual SuperHyperDefensive SuperHyperStrict Dimension Dominating; 6902
(ii) : the strong dual SuperHyperDefensive SuperHyperStrict Dimension Dominating; 6903
(iii) : the connected dual SuperHyperDefensive SuperHyperStrict Dimension Dominating; 6904
(iv) : the δ-dual SuperHyperDefensive SuperHyperStrict Dimension Dominating; 6905
(v) : the strong δ-dual SuperHyperDefensive SuperHyperStrict Dimension Dominating; 6906
(vi) : the connected δ-dual SuperHyperDefensive SuperHyperStrict Dimension Dominating. 6907
Proposition 32.0.15. Let N T G : (V, E, σ, µ) be a Neutrosophic SuperHyperGraph. Then ∅ is 6908
(iii) : the connected defensive SuperHyperDefensive SuperHyperStrict Dimension Dominating; 6911

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

independent SuperHyperSet is 6916
(iii) : the connected SuperHyperDefensive SuperHyperStrict Dimension Dominating; 6919
Proposition 32.0.17. Let ESHG : (V, E) be a Neutrosophic SuperHyperUniform SuperHyper- 6923

Graph which is a SuperHyperStrict Dimension Dominating/SuperHyperPath. Then V is a maximal 6924
(iv) : O(ESHG)-SuperHyperDefensive SuperHyperStrict Dimension Dominating; 6928
(v) : strong O(ESHG)-SuperHyperDefensive SuperHyperStrict Dimension Dominating; 6929
(vi) : connected O(ESHG)-SuperHyperDefensive SuperHyperStrict Dimension Dominating; 6930
Proposition 32.0.18. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is a 6932
SuperHyperUniform SuperHyperWheel. Then V is a maximal 6933
(iv) : O(ESHG)-dual SuperHyperDefensive SuperHyperStrict Dimension Dominating; 6937
(v) : strong O(ESHG)-dual SuperHyperDefensive SuperHyperStrict Dimension Dominating; 6938
(vi) : connected O(ESHG)-dual SuperHyperDefensive SuperHyperStrict Dimension Dominating; 6939
Graph which is a SuperHyperStrict Dimension Dominating/SuperHyperPath. Then the number of 6942

(i) : the SuperHyperStrict Dimension Dominating; 6943
(ii) : the SuperHyperStrict Dimension Dominating; 6944
(iii) : the connected SuperHyperStrict Dimension Dominating; 6945
(iv) : the O(ESHG)-SuperHyperStrict Dimension Dominating; 6946
(v) : the strong O(ESHG)-SuperHyperStrict Dimension Dominating; 6947
(vi) : the connected O(ESHG)-SuperHyperStrict Dimension Dominating. 6948
coincide. 6950

Graph which is a SuperHyperWheel. Then the number of 6952
(i) : the dual SuperHyperStrict Dimension Dominating; 6953
(ii) : the dual SuperHyperStrict Dimension Dominating; 6954
(iii) : the dual connected SuperHyperStrict Dimension Dominating; 6955
(iv) : the dual O(ESHG)-SuperHyperStrict Dimension Dominating; 6956
(v) : the strong dual O(ESHG)-SuperHyperStrict Dimension Dominating; 6957
(vi) : the connected dual O(ESHG)-SuperHyperStrict Dimension Dominating. 6958
coincide. 6960
Proposition 32.0.21. Let ESHG : (V, E) be a Neutrosophic SuperHyperUniform SuperHy- 6961

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


Graph which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperCom- 6973
plete SuperHyperMultipartite. Then a SuperHyperSet contains the half of multiplying r with 6974
the number of all the SuperHyperEdges plus one of all the SuperHyperVertices in the biggest 6975
SuperHyperPart is a 6976
(iv) : δ-SuperHyperDefensive SuperHyperStrict Dimension Dominating; 6980
(v) : strong δ-SuperHyperDefensive SuperHyperStrict Dimension Dominating; 6981
(vi) : connected δ-SuperHyperDefensive SuperHyperStrict Dimension Dominating. 6982
Graph which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperCom- 6984

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

Proposition 32.0.25. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. Then the 7003
number is at most O(ESHG) and the Neutrosophic number is at most On (ESHG). 7004
Proposition 32.0.26. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is 7005
SuperHyperComplete. The number is O(ESHG:(V,E)) 2 + 1 and the Neutrosophic number is 7006

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


Proposition 32.0.27. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is ∅. The 7014
number is 0 and the Neutrosophic number is 0, for an independent SuperHyperSet in the setting 7015
of dual 7016
(iv) : 0-SuperHyperDefensive SuperHyperStrict Dimension Dominating; 7020

SuperHyperComplete. Then there’s no independent SuperHyperSet. 7024

SuperHyperStrict Dimension Dominating/SuperHyperPath/SuperHyperWheel. The number is O(ESHG : 7026
(V, E)) and the Neutrosophic number is On (ESHG : (V, E)), in the setting of a dual 7027
(iv) : O(ESHG : (V, E))-SuperHyperDefensive SuperHyperStrict Dimension Dominating; 7031
(v) : strong O(ESHG : (V, E))-SuperHyperDefensive SuperHyperStrict Dimension Dominating; 7032
(vi) : connected O(ESHG : (V, E))-SuperHyperDefensive SuperHyperStrict Dimension Dominating. 7033


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


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

dual SuperHyperDefensive SuperHyperStrict Dimension Dominating, then ∀v ∈ V \ S, ∃x ∈ S such that 7049
(i) v ∈ Ns (x); 7050
(ii) vx ∈ E. 7051
Proposition 32.0.33. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph. If S is 7052

a dual SuperHyperDefensive SuperHyperStrict Dimension Dominating, then 7053
(i) S is SuperHyperStrict Dimension Dominating set; 7054
(ii) there’s S ⊆ S 0 such that |S 0 | is SuperHyperChromatic number. 7055
Proposition 32.0.34. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph. Then 7056
(i) Γ ≤ O; 7057
(ii) Γs ≤ On . 7058
Proposition 32.0.35. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph which is 7059
connected. Then 7060
(i) Γ ≤ O − 1; 7061
(ii) Γs ≤ On − Σ3i=1 σi (x). 7062
Proposition 32.0.36. Let ESHG : (V, E) be an odd SuperHyperPath. Then 7063

(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· ,vn−1 } Σ3i=1 σi (s)}; 7067
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn−1 } and S2 = {v1 , v3 , · · · , vn−1 } are only a dual 7068
Proposition 32.0.37. Let ESHG : (V, E) be an even SuperHyperPath. Then 7070
(i) the set S = {v2 , v4 , · · · .vn } is a dual SuperHyperDefensive SuperHyperStrict Dimension 7071
Dominating; 7072
(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · .vn } and {v1 , v3 , · · · .vn−1 }; 7073
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 7074
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 7075
Proposition 32.0.38. Let ESHG : (V, E) be an even SuperHyperStrict Dimension Dominating. Then 7077
(i) the SuperHyperSet S = {v2 , v4 , · · · , vn } is a dual SuperHyperDefensive SuperHyperStrict 7078
(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · , vn } and {v1 , v3 , · · · , vn−1 }; 7080
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } σ(s), Σs∈S={v1 ,v3 ,··· ,vn−1 } σ(s)}; 7081
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn } and S2 = {v1 , v3 , · · · , vn−1 } are only dual 7082
Proposition 32.0.39. Let ESHG : (V, E) be an odd SuperHyperStrict Dimension Dominating. Then 7084

(iii) Γs = min{Σs∈S={v2 ,v4 ,··· .vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 7088
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn−1 } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 7089
Proposition 32.0.40. Let ESHG : (V, E) be SuperHyperStar. Then 7091
(i) the SuperHyperSet S = {c} is a dual maximal SuperHyperStrict Dimension Dominating; 7092
(ii) Γ = 1; 7093
(iii) Γs = Σ3i=1 σi (c); 7094
(iv) the SuperHyperSets S = {c} and S ⊂ S 0 are only dual SuperHyperStrict Dimension Dominating. 7095
Proposition 32.0.41. Let ESHG : (V, E) be SuperHyperWheel. Then 7096

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

b n c+1 ; 7107
S={vi }i=1
b n c+1
(iv) the SuperHyperSet S = {vi }i=1
2
is only a dual SuperHyperDefensive SuperHyperStrict 7108
Proposition 32.0.43. Let ESHG : (V, E) be an even SuperHyperComplete. Then 7110
bnc
2
Dominating; 7112
(ii) Γ = b n2 c; 7113

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

perStars with common Neutrosophic SuperHyperVertex SuperHyperSet. Then 7118
(i) the SuperHyperSet S = {c1 , c2 , · · · , cm } is a dual SuperHyperDefensive SuperHyperStrict 7119

(ii) Γ = m for N SHF : (V, E); 7121
(iii) Γs = Σm 3
i=1 Σj=1 σj (ci ) for N SHF : (V, E); 7122
(iv) the SuperHyperSets S = {c1 , c2 , · · · , cm } and S ⊂ S 0 are only dual SuperHyperStrict Dimension 7123
Proposition 32.0.45. Let N SHF : (V, E) be an m-SuperHyperFamily of odd SuperHyperCom- 7125
plete SuperHyperGraphs with common Neutrosophic SuperHyperVertex SuperHyperSet. Then 7126

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

b n c+1 for N SHF : (V, E); 7130
S={vi }i=1
b n c+1
are only a dual maximal SuperHyperStrict Dimension 7131
Proposition 32.0.46. Let N SHF : (V, E) be a m-SuperHyperFamily of even SuperHyperCom- 7133

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

bnc for N SHF : (V, E); 7138
S={vi }i=1
bnc
2
are only dual maximal SuperHyperStrict Dimension Dominating 7139
for N SHF : (V, E). 7140
(i) if s ≥ t and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 7143

SuperHyperStrict Dimension Dominating, then S is an s-SuperHyperDefensive SuperHyperStrict 7144

SuperHyperStrict Dimension Dominating, then S is a dual s-SuperHyperDefensive SuperHyperStrict 7147
(i) if s ≥ t + 2 and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 7151
SuperHyperStrict Dimension Dominating, then S is an s-SuperHyperPowerful SuperHyperStrict 7152


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

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

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

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

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

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

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

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

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


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

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


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

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

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


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

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

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


CHAPTER 33 7217
Neutrosophic Applications in Cancer’s 7218
The cancer is the Neutrosophic disease but the Neutrosophic model is going to figure out what’s 7220
going on this Neutrosophic phenomenon. The special Neutrosophic case of this Neutrosophic 7221
disease is considered and as the consequences of the model, some parameters are used. The cells 7222
are under attack of this disease but the moves of the cancer in the special region are the matter 7223
of mind. The Neutrosophic recognition of the cancer could help to find some Neutrosophic 7224
treatments for this Neutrosophic disease. 7225
In the following, some Neutrosophic steps are Neutrosophic devised on this disease. 7226
Step 1. (Neutrosophic Definition) The Neutrosophic recognition of the cancer in the long- 7227
term Neutrosophic function. 7228
Step 2. (Neutrosophic Issue) The specific region has been assigned by the Neutrosophic 7229
model [it’s called Neutrosophic SuperHyperGraph] and the long Neutrosophic cycle of the 7230
move from the cancer is identified by this research. Sometimes the move of the cancer 7231
hasn’t be easily identified since there are some determinacy, indeterminacy and neutrality 7232
about the moves and the effects of the cancer on that region; this event leads us to 7233
choose another model [it’s said to be Neutrosophic SuperHyperGraph] to have convenient 7234
perception on what’s happened and what’s done. 7235
Step 3. (Neutrosophic Model) There are some specific Neutrosophic models, which are well- 7236
known and they’ve got the names, and some general Neutrosophic models. The moves 7237
and the Neutrosophic traces of the cancer on the complex tracks and between complicated 7238
groups of cells could be fantasized by a Neutrosophic SuperHyperPath(-/SuperHyperStrict 7239
Dimension Dominating, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, Su- 7240
perHyperWheel). The aim is to find either the Neutrosophic SuperHyperStrict Dimension 7241
Dominating or the Neutrosophic SuperHyperStrict Dimension Dominating in those Neutrosophic 7242
Neutrosophic SuperHyperModels. 7243
351
CHAPTER 34 7244
Case 1: The Initial Neutrosophic Steps 7245
Toward Neutrosophic 7246
SuperHyperBipartite as Neutrosophic 7247
SuperHyperModel 7248
Step 4. (Neutrosophic Solution) In the Neutrosophic Figure (34.1), the Neutrosophic Super- 7249
HyperBipartite is Neutrosophic highlighted and Neutrosophic featured. 7250
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- 7251
perBipartite is obtained. 7252
The obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous 7253
Neutrosophic result, of the Neutrosophic SuperHyperVertices of the connected Neut- 7254
rosophic SuperHyperBipartite ESHB : (V, E), in the Neutrosophic SuperHyperModel 7255
(34.1), is the Neutrosophic SuperHyperStrict Dimension Dominating. 7256

CHAPTER 35 7257
Case 2: The Increasing Neutrosophic 7258
Steps Toward Neutrosophic 7259
SuperHyperMultipartite as 7260
Neutrosophic SuperHyperModel 7261
Step 4. (Neutrosophic Solution) In the Neutrosophic Figure (35.1), the Neutrosophic Super- 7262
HyperMultipartite is Neutrosophic highlighted and Neutrosophic featured. 7263
By using the Neutrosophic Figure (35.1) and the Table (35.1), the Neutrosophic SuperHy- 7264
perMultipartite is obtained. 7265
The obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous 7266
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- 7267

perMultipartite ESHM : (V, E), in the Neutrosophic SuperHyperModel (35.1), is the 7268
Neutrosophic SuperHyperStrict Dimension Dominating. 7269

CHAPTER 36 7270
Wondering Open Problems But As The 7271
Directions To Forming The Motivations 7272
In what follows, some “problems” and some “questions” are proposed. 7273
The SuperHyperStrict Dimension Dominating and the Neutrosophic SuperHyperStrict Dimension Dominating 7274
are defined on a real-world application, titled “Cancer’s Recognitions”. 7275
Question 36.0.1. Which the else SuperHyperModels could be defined based on Cancer’s 7276
recognitions? 7277
Question 36.0.2. Are there some SuperHyperNotions related to SuperHyperStrict Dimension Dominating 7278
and the Neutrosophic SuperHyperStrict Dimension Dominating? 7279
Question 36.0.3. Are there some Algorithms to be defined on the SuperHyperModels to compute 7280
them? 7281
Question 36.0.4. Which the SuperHyperNotions are related to beyond the SuperHyperStrict 7282
and the Neutrosophic SuperHyperStrict Dimension Dominating?
Problem 36.0.5. The SuperHyperStrict Dimension Dominating and the Neutrosophic SuperHyperStrict 7284
do a SuperHyperModel for the Cancer’s recognitions and they’re based on
SuperHyperStrict Dimension Dominating, are there else? 7286
Problem 36.0.6. Which the fundamental SuperHyperNumbers are related to these SuperHyper- 7287
Numbers types-results? 7288
Problem 36.0.7. What’s the independent research based on Cancer’s recognitions concerning 7289
the multiple types of SuperHyperNotions? 7290
357
CHAPTER 37 7291
Conclusion and Closing Remarks 7292
In this section, concluding remarks and closing remarks are represented. The drawbacks of this 7293
research are illustrated. Some benefits and some advantages of this research are highlighted. 7294
This research uses some approaches to make Neutrosophic SuperHyperGraphs more understand- 7295
able. In this endeavor, two SuperHyperNotions are defined on the SuperHyperStrict Dimension 7296
Dominating. For that sake in the second definition, the main definition of the Neutrosophic 7297
SuperHyperGraph is redefined on the position of the alphabets. Based on the new definition for 7298
the Neutrosophic SuperHyperGraph, the new SuperHyperNotion, Neutrosophic SuperHyperStrict 7299
Dimension Dominating, finds the convenient background to implement some results based on that. 7300
Some SuperHyperClasses and some Neutrosophic SuperHyperClasses are the cases of this 7301
research on the modeling of the regions where are under the attacks of the cancer to recognize 7302
this disease as it’s mentioned on the title “Cancer’s Recognitions”. To formalize the instances 7303
on the SuperHyperNotion, SuperHyperStrict Dimension Dominating, the new SuperHyperClasses and 7304
SuperHyperClasses, are introduced. Some general results are gathered in the section on the 7305
SuperHyperStrict Dimension Dominating and the Neutrosophic SuperHyperStrict Dimension Dominating. The 7306
clarifications, instances and literature reviews have taken the whole way through. In this 7307
research, the literature reviews have fulfilled the lines containing the notions and the results. 7308
The SuperHyperGraph and Neutrosophic SuperHyperGraph are the SuperHyperModels on the 7309
and the architecture are formally called “ SuperHyperStrict Dimension Dominating” in the themes of 7314
jargons and buzzwords. The prefix “SuperHyper” refers to the theme of the embedded styles to 7315
figure out the background for the SuperHyperNotions. In the Table (37.1), benefits and avenues 7316
for this research are, figured out, pointed out and spoken out. 7317
359
Table 37.1: An Overlook On This Research And Beyond 136TBLTBL
Advantages Limitations
1. Redefining Neutrosophic SuperHyperGraph 1. General Results
2. SuperHyperStrict Dimension Dominating
3. Neutrosophic SuperHyperStrict Dimension Dominating 2. Other SuperHyperNumbers
4. Modeling of Cancer’s Recognitions
5. SuperHyperClasses 3. SuperHyperFamilies

CHAPTER 38 7318
Neutrosophic SuperHyperDuality But As 7319
Super Forms 7321
Definition 38.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperDuality). 7322

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

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

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

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

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

Neutrosophic re-SuperHyperDuality, Neutrosophic v-SuperHyperDuality, and Neutro- 7335
sophic rv-SuperHyperDuality. 7336
Definition 38.0.2. ((Neutrosophic) SuperHyperDuality). 7337

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

sophic rv-SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : 7342
(V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Ex- 7343
treme cardinality of the Extreme SuperHyperEdges in the consecutive Extreme sequence 7344
of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 7345
361
(ii) a Neutrosophic SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 7347

sophic rv-SuperHyperDuality and C(N SHG) for a Neutrosophic SuperHyperGraph 7349
N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic SuperHy- 7350
perEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive 7351
Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they 7352
form the Neutrosophic SuperHyperDuality; 7353
(iii) an Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of Neut- 7354
rosophic e-SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic v- 7355

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

SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for a Neut- 7365
rosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 7366
contains the Neutrosophic coefficients defined as the Neutrosophic number of the max- 7367
imum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic 7368
SuperHyperSet S of high Neutrosophic cardinality consecutive Neutrosophic SuperHy- 7369
perEdges and Neutrosophic SuperHyperVertices such that they form the Neutrosophic 7370
SuperHyperDuality; and the Neutrosophic power is corresponded to its Neutrosophic 7371
coefficient; 7372
(v) an Extreme R-SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 7373

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

SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic v-SuperHyperDuality,7381
and Neutrosophic rv-SuperHyperDuality and C(N SHG) for a Neutrosophic SuperHyper- 7382
Graph N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic 7383
SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 7384
consecutive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such 7385
that they form the Neutrosophic SuperHyperDuality; 7386
(vii) an Extreme R-SuperHyperDuality SuperHyperPolynomial if it’s either of 7387

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

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

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

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

imum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic 7401
SuperHyperDuality; and the Neutrosophic power is corresponded to its Neutrosophic 7404
coefficient. 7405
136EXM1 Example 38.0.3. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E) in 7406
the mentioned Neutrosophic Figures in every Neutrosophic items. 7407

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7409
E1 and E3 are some empty Extreme SuperHyperEdges but E2 is a loop Neutrosophic 7410
SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of 7411
Neutrosophic SuperHyperNeighbor, there’s only one Neutrosophic SuperHyperEdge, 7412
namely, E4 . The Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means 7413
that there’s no Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. 7414
Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in every given Neutrosophic 7415
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 7419
SuperHyperEdge. Thus in the terms of Neutrosophic SuperHyperNeighbor, there’s only 7420
one Neutrosophic SuperHyperEdge, namely, E4 . The Neutrosophic SuperHyperVertex, V3 7421
is Neutrosophic isolated means that there’s no Neutrosophic SuperHyperEdge has it as 7422
a Neutrosophic endpoint. Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in 7423

every given Neutrosophic SuperHyperDuality. 7424




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

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


the Neutrosophic SuperHyperDuality. 7495
Then 7497
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 7498
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL


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

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

(V, E). Then 7518

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


Then there’s at least one SuperHyperDuality. Thus the notion of quasi isn’t up and 7524
the SuperHyperNotions based on SuperHyperDuality could be applied. There are only z 0 7525
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. 7537
Proposition 38.0.14. Assume a connected Neutrosophic SuperHyperWheel ESHW : (V, E). 7538
Then, 7539
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 7540
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 7541


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

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

CHAPTER 39 7554
Neutrosophic SuperHyperJoin But As 7555
Super Forms 7557
Definition 39.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperJoin). 7558

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

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

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

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

Neutrosophic re-SuperHyperJoin, Neutrosophic v-SuperHyperJoin, and Neutrosophic 7573
rv-SuperHyperJoin. 7574
Definition 39.0.2. ((Neutrosophic) SuperHyperJoin). 7575

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

375

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

rv-SuperHyperJoin and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7587
Neutrosophic SuperHyperJoin; 7591
(iii) an Extreme SuperHyperJoin SuperHyperPolynomial if it’s either of Neutrosophic 7592

e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic v-SuperHyperJoin, 7593
and Neutrosophic rv-SuperHyperJoin and C(N SHG) for an Extreme SuperHyperGraph 7594
Extreme SuperHyperJoin; and the Extreme power is corresponded to its Extreme 7599
coefficient; 7600
(iv) a Neutrosophic SuperHyperJoin SuperHyperPolynomial if it’s either of 7601

Neutrosophic e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic v- 7602
SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for a Neutrosophic 7603
S of high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and 7607

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

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

rv-SuperHyperJoin and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7619
Neutrosophic SuperHyperJoin; 7623

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

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

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

SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for a Neutrosophic 7635

the Neutrosophic coefficients defined as the Neutrosophic number of the maximum 7637
Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic 7638
SuperHyperJoin; and the Neutrosophic power is corresponded to its Neutrosophic 7641
coefficient. 7642
SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7646

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

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




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


SuperHyperModel (31.1), is the SuperHyperJoin. 7712

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

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

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


the Neutrosophic SuperHyperJoin. 7732
Then 7734
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 7735
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 7741
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperJoin taken from a connected Neutrosophic SuperHyperBipartite 7743

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


(V, E). Then 7754

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

is a longest SuperHyperJoin taken from a connected Neutrosophic SuperHyperMultipartite 7756


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

Then, 7774

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

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


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

CHAPTER 40 7788
Neutrosophic SuperHyperPerfect But As 7789
Super Forms 7791
Definition 40.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperPerfect). 7792

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

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

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

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

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

Neutrosophic re-SuperHyperPerfect, Neutrosophic v-SuperHyperPerfect, and Neutrosophic 7805
rv-SuperHyperPerfect. 7806
Definition 40.0.2. ((Neutrosophic) SuperHyperPerfect). 7807

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

rv-SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 7812
389
(ii) a Neutrosophic SuperHyperPerfect if it’s either of Neutrosophic e-SuperHyperPerfect, 7817

rv-SuperHyperPerfect and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : 7819
(V, E) is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges 7820
of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive 7821
Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they 7822
form the Neutrosophic SuperHyperPerfect; 7823
(iii) an Extreme SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7824

rosophic e-SuperHyperPerfect, Neutrosophic re-SuperHyperPerfect, Neutrosophic v- 7825
SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for an Ex- 7826
ality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme 7829
(iv) a Neutrosophic SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7833

SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for a Neut- 7835
imum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic 7838
SuperHyperPerfect; and the Neutrosophic power is corresponded to its Neutrosophic 7841
coefficient; 7842
(v) an Extreme R-SuperHyperPerfect if it’s either of Neutrosophic e-SuperHyperPerfect, 7843

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

SuperHyperPerfect, Neutrosophic re-SuperHyperPerfect, Neutrosophic v-SuperHyperPerfect,7851
and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for a Neutrosophic SuperHyper- 7852
Graph N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic 7853
SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 7854
consecutive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such 7855
that they form the Neutrosophic SuperHyperPerfect; 7856
(vii) an Extreme R-SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7857

SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for an Ex- 7859

ality of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme 7862
(viii) a Neutrosophic SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7866

SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for a Neut- 7868
imum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic 7871

SuperHyperPerfect; and the Neutrosophic power is corresponded to its Neutrosophic 7874
coefficient. 7875

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7879

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





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

SuperHyperModel (31.1), is the SuperHyperPerfect. 7945
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 7947
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3

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

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



the Neutrosophic SuperHyperPerfect. 7965
Then 7967
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 7968
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 7972
there’s no at least one SuperHyperPerfect. Thus the notion of quasi may be up but the 7973
SuperHyperNotions based on SuperHyperPerfect could be applied. There are only two 7974
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperPerfect taken from a connected Neutrosophic SuperHyperBipartite 7977

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

(V, E). Then 7988

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



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

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

is a longest SuperHyperPerfect taken from a connected Neutrosophic SuperHyperWheel 8011


ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is straightforward. Then there’s 8014
at least one SuperHyperPerfect. Thus the notion of quasi isn’t up and the SuperHyperNotions 8015
based on SuperHyperPerfect could be applied. The unique embedded SuperHyperPerfect 8016
proposes some longest SuperHyperPerfect excerpt from some representatives. The latter is 8017
SuperHyperModel (31.6), is the Neutrosophic SuperHyperPerfect. 8023

CHAPTER 41 8024
Neutrosophic SuperHyperTotal But As 8025
Super Forms 8027
Definition 41.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperTotal). 8028

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

Va ∈ Ei , Ej ; 8033
(ii) Neutrosophic re-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that 8034

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

Vi , Vj ∈ Ea ; 8037
(iv) Neutrosophic rv-SuperHyperTotal if ∀Vi ∈ VESHG:(V,E) , ∃!Vj ∈ V 0 , such that 8038

Vi , Vj ∈ Ea ; and |Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; 8039
(v) Neutrosophic SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 8040

Neutrosophic re-SuperHyperTotal, Neutrosophic v-SuperHyperTotal, and Neutrosophic 8041
rv-SuperHyperTotal. 8042
Definition 41.0.2. ((Neutrosophic) SuperHyperTotal). 8043

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

rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 8048
Extreme SuperHyperTotal; 8052
403
(ii) a Neutrosophic SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 8053

rv-SuperHyperTotal and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 8055
Neutrosophic SuperHyperTotal; 8059
(iii) an Extreme SuperHyperTotal SuperHyperPolynomial if it’s either of Neutrosophic 8060
e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v-SuperHyperTotal, 8061

and Neutrosophic rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph 8062
Extreme SuperHyperTotal; and the Extreme power is corresponded to its Extreme 8067
coefficient; 8068
(iv) a Neutrosophic SuperHyperTotal SuperHyperPolynomial if it’s either of 8069
Neutrosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v- 8070

SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for a Neutro- 8071
sophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 8072
contains the Neutrosophic coefficients defined as the Neutrosophic number of the maximum 8073
Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHy- 8074
perSet S of high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and 8075
Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperTotal; 8076
and the Neutrosophic power is corresponded to its Neutrosophic coefficient; 8077
(v) an Extreme R-SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 8078

rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 8080
Extreme SuperHyperTotal; 8084
(vi) a Neutrosophic R-SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 8085

rv-SuperHyperTotal and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 8087
Neutrosophic SuperHyperTotal; 8091
(vii) an Extreme R-SuperHyperTotal SuperHyperPolynomial if it’s either of Neut- 8092

rosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v- 8093
SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for an Extreme 8094

that they form the Extreme SuperHyperTotal; and the Extreme power is corresponded to 8099
its Extreme coefficient; 8100
(viii) a Neutrosophic SuperHyperTotal SuperHyperPolynomial if it’s either of 8101
Neutrosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v- 8102

SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for a Neutro- 8103
sophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 8104
contains the Neutrosophic coefficients defined as the Neutrosophic number of the maximum 8105
Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic Supe- 8106
rHyperSet S of high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges 8107
and Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyper- 8108
Total; and the Neutrosophic power is corresponded to its Neutrosophic coefficient. 8109

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 8113

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




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

SuperHyperModel (31.1), is the SuperHyperTotal. 8179
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 8181
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. 8188
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 8190


the Neutrosophic SuperHyperTotal. 8199
Then 8201
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 8202
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

based on SuperHyperTotal could be applied. There are only two SuperHyperParts. Thus every 8208
P :

V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperTotal taken from a connected Neutrosophic SuperHyperBipartite 8210

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
(V, E). Then 8221

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

is a longest SuperHyperTotal taken from a connected Neutrosophic SuperHyperMultipartite 8223


based on SuperHyperTotal could be applied. There are only z 0 SuperHyperParts. Thus every 8228
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. 8239
Then, 8241
∗
C(N SHG)Neutrosophic SuperHyperTotal = {Ei , Ej ∈ EESHG:(V,E) }.
∗
= |i(i − 1) | Ei ∈ EESHG:(V,E)|Neutrosophic Cardinality
|z 2 .
C(N SHG)Neutrosophic R-SuperHyperTotal = {CEN T ER, Vj ∈ VESHG:(V,E) }.
C(N SHG)Neutrosophic R-SuperHyperTotal SuperHyperPolynomial =
(|VESHG:(V,E)|Neutrosophic Cardinality |) choose (|VESHG:(V,E)|Neutrosophic Cardinality | − 1)
z2.

Proof. Let 8242
P : ViEXT ERN AL , Ei∗ , CEN T ER, Ej .
is a longest SuperHyperTotal taken from a connected Neutrosophic SuperHyperWheel ESHW : 8243


at least one SuperHyperTotal. Thus the notion of quasi isn’t up and the SuperHyperNotions 8247
based on SuperHyperTotal could be applied. The unique embedded SuperHyperTotal 8248
proposes some longest SuperHyperTotal excerpt from some representatives. The latter is 8249
SuperHyperModel (31.6), is the Neutrosophic SuperHyperTotal. 8255

CHAPTER 42 8256
Neutrosophic SuperHyperConnected But 8257
As The Extensions Excerpt From Dense 8258
And Super Forms 8259
Definition 42.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperConnected). 8260

(i) Neutrosophic e-SuperHyperConnected if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such 8264
that Va ∈ Ei , Ej ; and ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; 8265
(ii) Neutrosophic re-SuperHyperConnected if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ 8266

E 0 , such that Va ∈ Ei , Ej ; ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; and 8267
|Ei |NEUTROSOPHIC CARDINALITY = |Ej |NEUTROSOPHIC CARDINALITY ; 8268
(iii) Neutrosophic v-SuperHyperConnected if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such 8269

that Vi , Vj 6∈ Ea ; and ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; 8270
(iv) Neutrosophic rv-SuperHyperConnected if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ 8271

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

8274
Neutrosophic re-SuperHyperConnected, Neutrosophic v-SuperHyperConnected, and Neut- 8275
rosophic rv-SuperHyperConnected. 8276
Definition 42.0.2. ((Neutrosophic) SuperHyperConnected). 8277

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

8280
Neutrosophic re-SuperHyperConnected, Neutrosophic v-SuperHyperConnected, and Neut- 8281
rosophic rv-SuperHyperConnected and C(N SHG) for an Extreme SuperHyperGraph 8282
N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of 8283
417
high Extreme cardinality of the Extreme SuperHyperEdges in the consecutive Extreme 8284
sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 8285
form the Extreme SuperHyperConnected; 8286
(ii) a Neutrosophic SuperHyperConnected if it’s either of Neutrosophic e- 8287

SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neutrosophic v- 8288
SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) 8289
for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic car- 8290
dinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of high 8291
Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and Neutrosophic 8292

SuperHyperVertices such that they form the Neutrosophic SuperHyperConnected; 8293
(iii) an Extreme SuperHyperConnected SuperHyperPolynomial if it’s either of Neut- 8294
rosophic e-SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neutrosophic 8295

v-SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) for 8296
an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial 8297
contains the Extreme coefficients defined as the Extreme number of the maximum Extreme 8298
(iv) a Neutrosophic SuperHyperConnected SuperHyperPolynomial if it’s either of 8303

Neutrosophic e-SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neut- 8304
rosophic v-SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and 8305
C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic 8306
SuperHyperPolynomial contains the Neutrosophic coefficients defined as the Neutrosophic 8307
number of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges 8308
of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive Neutro- 8309

sophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the 8310
Neutrosophic SuperHyperConnected; and the Neutrosophic power is corresponded to its 8311
Neutrosophic coefficient; 8312
(v) an Extreme R-SuperHyperConnected if it’s either of Neutrosophic e- 8313

SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) 8315
for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme cardinality 8316
of an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme SuperHyper- 8317
Vertices in the consecutive Extreme sequence of Extreme SuperHyperEdges and Extreme 8318
SuperHyperVertices such that they form the Extreme SuperHyperConnected; 8319
(vi) a Neutrosophic R-SuperHyperConnected if it’s either of Neutrosophic e- 8320

SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) for a 8322
Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic cardinality 8323
of the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S of high 8324
Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and Neutrosophic 8325
SuperHyperVertices such that they form the Neutrosophic SuperHyperConnected; 8326

(vii) an Extreme R-SuperHyperConnected SuperHyperPolynomial if it’s either of 8327

C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme Super- 8330
HyperPolynomial contains the Extreme coefficients defined as the Extreme number of 8331

and the Extreme power is corresponded to its Extreme coefficient; 8335
(viii) a Neutrosophic SuperHyperConnected SuperHyperPolynomial if it’s either of 8336

C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic 8339
SuperHyperPolynomial contains the Neutrosophic coefficients defined as the Neutrosophic 8340
number of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices 8341
of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive Neutro- 8342

sophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the 8343
Neutrosophic SuperHyperConnected; and the Neutrosophic power is corresponded to its 8344
Neutrosophic coefficient. 8345
• On the Figure (30.1), the Neutrosophic SuperHyperNotion, namely, Neutrosophic Super- 8348
HyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 8349
SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of Neutro- 8351
sophic SuperHyperNeighbor, there’s only one Neutrosophic SuperHyperEdge, namely, E4 . 8352

The Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means that there’s no 8353
Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. Thus the Neutrosophic 8354
SuperHyperVertex, V3 , is excluded in every given Neutrosophic SuperHyperConnected. 8355
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. 8363


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 8407
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. 8414
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 8416
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. 8423
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 8425



the Neutrosophic SuperHyperConnected. 8434
Then 8436
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 8437
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 8442
SuperHyperNotions based on SuperHyperConnected could be applied. There are only two 8443
P :

V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperConnected taken from a connected Neutrosophic SuperHyperBipartite 8446

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
(V, E). Then 8457
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 8458
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

is a longest SuperHyperConnected taken from a connected Neutrosophic SuperHyperMultipartite 8459


there’s no at least one SuperHyperConnected. Thus the notion of quasi may be up but 8463
the SuperHyperNotions based on SuperHyperConnected could be applied. There are only 8464
z 0 SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as the 8465
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. 8476
Then, 8478
∗
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 8479
P : V EXT ERN AL i , E ∗ i , CEN T ER, Ej .

is a longest SuperHyperConnected taken from a connected Neutrosophic SuperHyperWheel 8480


to ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is straightforward. 8483
Then there’s at least one SuperHyperConnected. Thus the notion of quasi isn’t up and 8484
the SuperHyperNotions based on SuperHyperConnected could be applied. The unique 8485
embedded SuperHyperConnected proposes some longest SuperHyperConnected excerpt from 8486
some representatives. The latter is straightforward. 8487
SuperHyperModel (31.6), is the Neutrosophic SuperHyperConnected. 8492

CHAPTER 43 8493
Background 8494
The seminal paper and groundbreaking article is titled “Super Hyper Dominating and Super 8524
Hyper Resolving on Neutrosophic Super Hyper Graphs and Their Directions in Game Theory and 8525
Neutrosophic Super Hyper Classes” in Ref. [HG44s] by Henry Garrett (2022). In this research 8526
article, a novel approach is implemented on SuperHyperGraph and neutrosophic SuperHyper- 8527
431
Graph based on fundamental SuperHyperNumber and using neutrosophic SuperHyperClasses 8528

of neutrosophic SuperHyperGraph. It’s published in prestigious and fancy journal is entitled 8529
“Journal of Mathematical Techniques and Computational Mathematics(JMTCM)” with ISO 8530
abbreviation “J Math Techniques Comput Math” in volume 1 and issue 3 with pages 242-263. 8531
The research article studies deeply with choosing directly neutrosophic SuperHyperGraph and 8532
SuperHyperGraph. It’s the breakthrough toward independent results based on initial background 8533
and fundamental SuperHyperNumbers. The seminal paper and groundbreaking article is titled 8534
“neutrosophic co-degree and neutrosophic degree alongside chromatic numbers in the setting of 8535
some classes related to neutrosophic hypergraphs” in Ref. [HG55s] by Henry Garrett (2023). 8536
In this research article, a novel approach is implemented on SuperHyperGraph and neutrosophic 8537
SuperHyperGraph based on general forms without using neutrosophic classes of neutrosophic 8538
SuperHyperGraph. It’s published in prestigious and fancy journal is entitled “Journal of Current 8539
Trends in Computer Science Research (JCTCSR)” with ISO abbreviation “J Curr Trends Comp 8540
Sci Res” in volume 2 and issue 1 with pages 16-24. The research article studies deeply with choos- 8541
ing neutrosophic hypergraphs instead of neutrosophic SuperHyperGraph. It’s the breakthrough 8542
toward independent results based on initial background. The research article studies deeply 8543
with choosing neutrosophic hypergraphs instead of neutrosophic SuperHyperGraph. It’s the 8544
breakthrough toward independent results based on initial background. In some articles are titled 8545
“0039 | Closing Numbers and Super-Closing Numbers as (Dual)Resolving and (Dual)Coloring 8546
alongside (Dual)Dominating in (Neutrosophic)n-SuperHyperGraph” in Ref. [HG4] by Henry 8547
Garrett (2022), “0049 | (Failed)1-Zero-Forcing Number in Neutrosophic Graphs” in Ref. [HG5] 8548
by Henry Garrett (2022), “Extreme SuperHyperClique as the Firm Scheme of Confrontation 8549
under Cancer’s Recognition as the Model in The Setting of (Neutrosophic) SuperHyperGraphs” in 8550
Ref. [HG6] by Henry Garrett (2022), “Uncertainty On The Act And Effect Of Cancer Alongside 8551
The Foggy Positions Of Cells Toward Neutrosophic Failed SuperHyperClique inside Neutrosophic 8552


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

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


SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints” in 8575
Ref. [HG12] by Henry Garrett (2022), “Basic Notions on (Neutrosophic) SuperHyperFor- 8576
cing And (Neutrosophic) SuperHyperModeling in Cancer’s Recognitions And (Neutrosophic) 8577
SuperHyperGraphs” in Ref. [HG17] by Henry Garrett (2022), “Neutrosophic Messy-Style 8578
SuperHyperGraphs To Form Neutrosophic SuperHyperStable To Act on Cancer’s Neutrosophic 8579
Recognitions In Special ViewPoints” in Ref. [HG18] by Henry Garrett (2022),“(Neutrosophic) 8580

SuperHyperModeling of Cancer’s Recognitions Featuring (Neutrosophic) SuperHyperDefensive 8581
SuperHyperAlliances” in Ref. [HG19] by Henry Garrett (2022), “(Neutrosophic) SuperHy- 8582
perAlliances With SuperHyperDefensive and SuperHyperOffensive Type-SuperHyperSet On 8583
(Neutrosophic) SuperHyperGraph With (Neutrosophic) SuperHyperModeling of Cancer’s Re- 8584
cognitions And Related (Neutrosophic) SuperHyperClasses” in Ref. [HG20] by Henry Garrett 8585
(2022), “SuperHyperGirth on SuperHyperGraph and Neutrosophic SuperHyperGraph With Supe- 8586

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

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

in Ref. [HG26] by Henry Garrett (2023), “Indeterminacy On The All Possible Connections 8599
of Cells In Front of Cancer’s Attacks In The Terms of Neutrosophic Failed SuperHyperClique 8600
on Cancer’s Recognition called Neutrosophic SuperHyperGraphs” in Ref. [HG27] by Henry 8601
Garrett (2023), “Perfect Directions Toward Idealism in Cancer’s Neutrosophic Recognition For- 8602
warding Neutrosophic SuperHyperClique on Neutrosophic SuperHyperGraphs” in Ref. [HG28] 8603
by Henry Garrett (2023), “Demonstrating Complete Connections in Every Embedded Regions 8604
and Sub-Regions in the Terms of Cancer’s Recognition and (Neutrosophic) SuperHyperGraphs 8605
With (Neutrosophic) SuperHyperClique” in Ref. [HG29] by Henry Garrett (2023), “Different 8606
Neutrosophic Types of Neutrosophic Regions titled neutrosophic Failed SuperHyperStable in 8607
Cancer’s Neutrosophic Recognition modeled in the Form of Neutrosophic SuperHyperGraphs” 8608
in Ref. [HG30] by Henry Garrett (2023), “Using the Tool As (Neutrosophic) Failed SuperHy- 8609
perStable To SuperHyperModel Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs” 8610
ViewPoints” in Ref. [HG32] by Henry Garrett (2023), “(Neutrosophic) SuperHyperStable 8613
on Cancer’s Recognition by Well-SuperHyperModelled (Neutrosophic) SuperHyperGraphs” in 8614
Ref. [HG33] by Henry Garrett (2023), “Neutrosophic 1-Failed SuperHyperForcing in the 8615
SuperHyperFunction To Use Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic Re- 8616
cognition And Beyond” in Ref. [HG34] by Henry Garrett (2022), “(Neutrosophic) 1-Failed 8617
SuperHyperForcing in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs” in Ref. 8618
[HG35] by Henry Garrett (2022), “Basic Notions on (Neutrosophic) SuperHyperForcing And 8619

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

Graphs” in Ref. [HG36] by Henry Garrett (2022), “Basic Neutrosophic Notions Concerning 8621
SuperHyperDominating and Neutrosophic SuperHyperResolving in SuperHyperGraph” in Ref. 8622
[HG37] by Henry Garrett (2022), “Initial Material of Neutrosophic Preliminaries to Study 8623
Some Neutrosophic Notions Based on Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic 8624
SuperHyperGraph (NSHG)” in Ref. [HG38] by Henry Garrett (2022), and [HG44s; HG55s; 8625
HG288; HG289; HG290; HG291], there are some endeavors to formalize the basic Super- 8647
HyperNotions about neutrosophic SuperHyperGraph and SuperHyperGraph alongside scientific 8648
research books at [HG60b; HG61b; HG62b; HG63b; HG64b; HG65b; HG66b; HG67b; 8649


HG179b; HG180b; HG181b; HG182b; HG183b; HG184b; HG185b]. Two popular 8663
scientific research books in Scribd in the terms of high readers, 4728 and 5721 respectively, on 8664
neutrosophic science is on [HG32b; HG44b]. 8665

See the seminal scientific researches [HG11s; HG22s; HG33s]. The formalization of the notions 8679
on the framework of notions in SuperHyperGraphs, Neutrosophic notions in SuperHyperGraphs 8680
theory, and (Neutrosophic) SuperHyperGraphs theory at [HG44s; HG55s; HG4; HG5; HG6; 8681
HG290; HG291] alongside scientific research books at [HG60b; HG61b; HG62b; HG63b; 8703


HG183b; HG184b; HG185b]. Two popular scientific research books in Scribd in the terms 8718
of high readers, 4728 and 5721 respectively, on neutrosophic science is on [HG32b; HG44b]. 8719

Bibliography 8720
10.33140/JMTCM.01.03.09) 8743
437



10.20944/preprints202301.0282.v1). 8759

10.20944/preprints202301.0267.v1). 8762

(doi: 10.20944/preprints202301.0265.v1). 8767
prints202301.0262.v1). 8771
2023010224, (doi: 10.20944/preprints202301.0224.v1). 8777

prints202301.0105.v1). 8780

Preprints 2023, 2023010044 8786
10.20944/preprints202301.0043.v1). 8789

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

(doi: 10.20944/preprints202212.0500.v1). 8805
10.5281/zenodo.8080100). 8814

10.5281/zenodo.8080068). 8817
(doi: 10.5281/zenodo.8078445). 8820
2023, (doi: 10.5281/zenodo.8078543). 8823
10.5281/zenodo.8076416). 8826

2023, (doi: 10.5281/zenodo.8076399). 8829
(doi: 10.5281/zenodo.8072171). 8832
2023, (doi: 10.5281/zenodo.8072267). 8835
10.5281/zenodo.8067384). 8838
2023, (doi: 10.5281/zenodo.8067409). 8841
10.5281/zenodo.8061927). 8844
10.5281/zenodo.8062016). 8847
10.5281/zenodo.8057696). 8850
2023, (doi: 10.5281/zenodo.8057753). 8853
10.5281/zenodo.8052893). 8856
2023, (doi: 10.5281/zenodo.8052925). 8859
10.5281/zenodo.8051346). 8862
10.5281/zenodo.8051360). 8865

10.5281/zenodo.8025707). 8868
10.5281/zenodo.8027275). 8871
odo.8017246). 8874
10.5281/zenodo.8020128). 8877
odo.7978571). 8880
10.5281/zenodo.7978857). 8883
10.5281/zenodo.7940830). 8886
10.5281/zenodo.7943578). 8889
odo.7916595). 8892
odo.7923632). 8895
(doi: 10.5281/zenodo.7904698). 8898
2023, (doi: 10.5281/zenodo.7904671). 8901

10.5281/zenodo.7871026). 8910
2023, (doi: 10.5281/zenodo.7874647). 8913
10.5281/zenodo.7857856). 8916
2023, (doi: 10.5281/zenodo.7857841). 8919
10.5281/zenodo.7853867). 8928
10.5281/zenodo.7853922). 8931
(doi: 10.5281/zenodo.7851519). 8934
(doi: 10.5281/zenodo.7851550). 8937

10.5281/zenodo.7834229). 8946
10.5281/zenodo.7834261). 8949
10.5281/zenodo.7824560). 8952
(doi: 10.5281/zenodo.7824623). 8955
2023, (doi: 10.5281/zenodo.7809365). 8966
2023, (doi: 10.5281/zenodo.7809358). 8969
10.5281/zenodo.7809219). 8972
10.5281/zenodo.7809328). 8975
2023, (doi: 10.5281/zenodo.7806767). 8978
2023, (doi: 10.5281/zenodo.7806838). 8981

10.5281/zenodo.7799902). 8990
(doi: 10.5281/zenodo.7804218). 8993
(doi: 10.5281/zenodo.7796334). 8996
10.5281/zenodo.7791952). 9002
10.5281/zenodo.7791982). 9005
10.5281/zenodo.7790026). 9008
10.5281/zenodo.7790052). 9011
2023, (doi: 10.5281/zenodo.7787066). 9014
10.5281/zenodo.7781476). 9020

10.5281/zenodo.7783082). 9023
10.5281/zenodo.7777857). 9026
10.5281/zenodo.7779286). 9029
(doi: 10.5281/zenodo.7771831). 9032
2023, (doi: 10.5281/zenodo.7772468). 9035
10.13140/RG.2.2.20913.25446). 9038
odo.7764916). 9041
10.13140/RG.2.2.11770.98247). 9044
10.13140/RG.2.2.12400.12808). 9047
2023, (doi: 10.13140/RG.2.2.22545.10089). 9050
10.13140/RG.2.2.11377.76644). 9056
10.13140/RG.2.2.23750.96329). 9059

10.13140/RG.2.2.31366.24641). 9062
10.13140/RG.2.2.34721.68960). 9065
2023, (doi: 10.13140/RG.2.2.30212.81289). 9068
10.13140/RG.2.2.24288.35842). 9074
10.13140/RG.2.2.32467.25124). 9077
10.13140/RG.2.2.31025.45925). 9080
10.13140/RG.2.2.17184.25602). 9083
10.13140/RG.2.2.23423.28327). 9086
10.13140/RG.2.2.28456.44805). 9089
10.13140/RG.2.2.23525.68320). 9092
10.13140/RG.2.2.20170.24000). 9095
10.13140/RG.2.2.36475.59683). 9098

10.13140/RG.2.2.29764.71046). 9101
2023, (doi: 10.13140/RG.2.2.18780.87683). 9104
10.13140/RG.2.2.26134.01603). 9110
10.13140/RG.2.2.27392.30721). 9113
10.13140/RG.2.2.33028.40321). 9116
10.13140/RG.2.2.21389.20966). 9119
10.13140/RG.2.2.16356.04489). 9122
10.13140/RG.2.2.21756.21129). 9125
10.13140/RG.2.2.30983.68009). 9128
10.13140/RG.2.2.28552.29445). 9131
(doi: 10.13140/RG.2.2.10936.21761). 9134
10.13140/RG.2.2.35105.89447). 9137

(doi: 10.13140/RG.2.2.30072.72960). 9140
10.13140/RG.2.2.31147.52003). 9143
10.13140/RG.2.2.32825.24163). 9146
10.13140/RG.2.2.13059.58401). 9149
10.13140/RG.2.2.11172.14720). 9152
2023, (doi: 10.13140/RG.2.2.22011.80165). 9155
ate 2023, (doi: 10.13140/RG.2.2.30819.84003). 9158
2023, (doi: 10.13140/RG.2.2.10493.84962). 9161
ate 2023, (doi: 10.13140/RG.2.2.13849.29280). 9164
2023, (doi: 10.13140/RG.2.2.19944.14086). 9167
ate 2023, (doi: 10.13140/RG.2.2.23299.58404). 9170
(doi: 10.13140/RG.2.2.33103.76968). 9173
(doi: 10.13140/RG.2.2.23037.44003). 9176

(doi: 10.13140/RG.2.2.35646.56641). 9179
10.13140/RG.2.2.18030.48967). 9182
(doi: 10.13140/RG.2.2.13973.81121). 9185
2023, (doi: 10.13140/RG.2.2.34106.47047). 9188
2023, (doi: 10.13140/RG.2.2.31956.88961). 9194
2023, (doi: 10.13140/RG.2.2.15179.67361). 9197
10.13140/RG.2.2.21510.45125). 9200
2023, (doi: 10.13140/RG.2.2.13121.84321). 9203
10.13140/RG.2.2.11758.69441). 9206
2023, (doi: 10.13140/RG.2.2.31891.35367). 9209
10.13140/RG.2.2.19360.87048). 9212
10.13140/RG.2.2.32363.21286). 9215

10.13140/RG.2.2.23266.81602). 9218
10.13140/RG.2.2.19911.37285). 9221
10.13140/RG.2.2.11050.90569). 9224
2023, (doi: 10.13140/RG.2.2.17761.79206). 9227
ate 2023, (doi: 10.13140/RG.2.2.33275.80161). 9233
(doi: 10.13140/RG.2.2.30182.50241). 9236

2023, (doi: 10.13140/RG.2.2.17252.24968). 9269
2023010396 (doi: 10.20944/preprints202301.0396.v1). 9278
2023, 2023010395 (doi: 10.20944/preprints202301.0395.v1). 9281



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

10.20944/preprints202301.0282.v1). 9302
10.20944/preprints202301.0267.v1).). 9305

(doi: 10.20944/preprints202301.0265.v1). 9310
prints202301.0262.v1). 9314

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

10.13140/RG.2.2.35061.65767). 9323
10.13140/RG.2.2.18494.15680). 9327
10.13140/RG.2.2.32530.73922). 9331

10.13140/RG.2.2.15897.70243). 9335
10.13140/RG.2.2.32530.73922). 9339
prints202301.0105.v1). 9342

10.13140/RG.2.2.23172.19849). 9349
10.13140/RG.2.2.17385.36968). 9359
Preprints 2023, 2023010044 9362
10.20944/preprints202301.0043.v1). 9365
2023, (doi: 10.13140/RG.2.2.28945.92007). 9368

10.13140/RG.2.2.35774.77123). 9374

10.13140/RG.2.2.29430.88642). 9380
(doi: 10.20944/preprints202212.0549.v1). 9386

10.13140/RG.2.2.19380.94084). 9389
(doi: 10.20944/preprints202212.0500.v1). 9400
10.13140/RG.2.2.20993.12640). 9403


10.13140/RG.2.2.29173.86244). 9418
2023 (doi: 10.5281/zenodo.8080167). 9423
2023 (doi: 10.5281/zenodo.8076449). 9427
2023 (doi: 10.5281/zenodo.8067469). 9431
(doi: 10.5281/zenodo.8062076). 9433
2023 (doi: 10.5281/zenodo.8052976). 9437
(doi: 10.5281/zenodo.8051368). 9439
(doi: 10.5281/zenodo.8027488). 9441
10.5281/zenodo.8020181). 9443
10.5281/zenodo.7978921). 9445

odo.7943878). 9447
10.5281/zenodo.7943871). 9449
10.5281/zenodo.7923786). 9451
2023 (doi: 10.5281/zenodo.7905287). 9453

2023 (doi: 10.5281/zenodo.7874677). 9457
(doi: 10.5281/zenodo.7857906). 9459
2023 (doi: 10.5281/zenodo.7856329). 9461
10.5281/zenodo.7854561). 9463
2023 (doi: 10.5281/zenodo.7851893). 9465

(doi: 10.5281/zenodo.7835063). 9469
(doi: 10.5281/zenodo.7826705). 9471
2023 (doi: 10.5281/zenodo.7820680). 9473
10.5281/zenodo.7812750). 9475


2023 (doi: 10.5281/zenodo.7807782). 9481

2023 (doi: 10.5281/zenodo.7804449). 9483

(doi: 10.5281/zenodo.7792307). 9487
(doi: 10.5281/zenodo.7790728). 9489
2023 (doi: 10.5281/zenodo.7787712). 9491
10.5281/zenodo.7783791). 9493
10.5281/zenodo.7780123). 9495
(doi: 10.5281/zenodo.7773119). 9497
odo.7637762). 9499
10.5281/zenodo.7766174). 9501
10.5281/zenodo.7762232). 9503
(doi: 10.5281/zenodo.7758601). 9505
10.5281/zenodo.7754661). 9507
10.5281/zenodo.7750995) . 9509
(doi: 10.5281/zenodo.7749875). 9511
10.5281/zenodo.7747236). 9513
10.5281/zenodo.7742587). 9515
(doi: 10.5281/zenodo.7738635). 9517

10.5281/zenodo.7734719). 9519
10.5281/zenodo.7730484). 9521
(doi: 10.5281/zenodo.7730469). 9523
10.5281/zenodo.7722865). 9525
odo.7713563). 9527
odo.7709116). 9529
10.5281/zenodo.7706415). 9531
10.5281/zenodo.7706063). 9533
10.5281/zenodo.7701906). 9535
odo.7700205). 9537
10.5281/zenodo.7694876). 9539
10.5281/zenodo.7679410). 9541
10.5281/zenodo.7675982). 9543
10.5281/zenodo.7672388). 9545
odo.7668648). 9547
10.5281/zenodo.7662810). 9549
10.5281/zenodo.7659162). 9551
odo.7653233). 9553

odo.7653204). 9555
odo.7653142). 9557
odo.7653117). 9559
odo.7651687). 9562
odo.7651619). 9564
odo.7651439). 9566
odo.7650729). 9568
odo.7647868). 9570
odo.7647017). 9572
odo.7644894). 9574
odo.7632923). 9577
odo.7623459). 9579
10.5281/zenodo.7606416). 9581
10.5281/zenodo.7606416). 9583
odo.7606404). 9585
10.5281/zenodo.7580018). 9587

odo.7580018). 9589
odo.7580018). 9591
odo.7579929). 9593
10.5281/zenodo.7563170). 9595
odo.7563164). 9597
odo.7563160). 9599
odo.7563160). 9601
10.5281/zenodo.7563160). 9603
10.5281/zenodo.7557063). 9605
10.5281/zenodo.7557009). 9607
10.5281/zenodo.7539484). 9609
10.5281/zenodo.7523390). 9611
10.5281/zenodo.7523390). 9613
10.5281/zenodo.7523390). 9615
odo.7574952). 9617
10.5281/zenodo.7574992). 9619
odo.7523357). 9621
10.5281/zenodo.7523357). 9623

10.5281/zenodo.7504782). 9625
10.5281/zenodo.7504782). 9627
10.5281/zenodo.7504782). 9629
10.5281/zenodo.7499395). 9631
odo.7499395). 9633
10.5281/zenodo.7499395). 9635
10.5281/zenodo.7497450). 9637
10.5281/zenodo.7497450). 9639
10.5281/zenodo.7494862). 9641
odo.7494862). 9643
10.5281/zenodo.7494862). 9645
10.5281/zenodo.7493845). 9647
odo.7493845). 9649
10.5281/zenodo.7493845). 9651
odo.7539484). 9653
odo.7523390). 9655
odo.7523357). 9657
odo.7504782). 9659

odo.7499395). 9661
odo.7497450). 9663
odo.7494862). 9665
odo.7493845). 9667
odo.7480110). 9669
odo.7378758). 9671
odo.6320305). 9673
odo.6677173). 9675

CHAPTER 44 9676
Books’ Contributions 9677
“Books’ Contributions”: | Featured Threads 9678

The following references are cited by chapters. 9679
9680
[Ref292] 9681
Henry Garrett, “New Ideas On Super Dimity By Hyper Dimple Of Strict Dimension Domin- 9682
ating In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 9683
10.5281/zenodo.8084420). 9684
9685
[Ref293] 9686
Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph 9687
10.5281/zenodo.8084436). 9689
9690
The links to the contributions of this scientific research book are listed below. 9691
[HG292] 9692
Henry Garrett, “New Ideas On Super Con By Hyper Conceit Of Strict Dimension Dominat- 9693
ing In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 9694
10.5281/zenodo.8080068). 9695
9696
[TITLE] “New Ideas On Super Con By Hyper Conceit Of Strict Dimension Dominating 9697
In Recognition of Cancer With (Neutrosophic) SuperHyperGraph” 9698

9699
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ResearchGate”] 9700
https://www.researchgate.net/publication/371869323 9701
9702
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “Scribd”:] 9703
https://www.scribd.com/document/655608508 9704
9705
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ZENODO_ORG”:] 9706
https://zenodo.org/record/8084420 9707
9708
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “academia”:] 9709
https://www.academia.edu/103915448 9710
463
Figure 44.1: [HG292] Henry Garrett, “New Ideas On Super Con By Hyper Conceit Of Strict
Dimension Dominating In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”,
Zenodo 2023, (doi: 10.5281/zenodo.8080068).
9711
[ADDRESSED CITATION] 9712
Henry Garrett, “New Ideas On Super Con By Hyper Conceit Of Strict Dimension Dominat- 9713
ing In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 9714
10.5281/zenodo.8080068). 9715
[ASSIGNED NUMBER] #292 Article 9716
[DATE] June 2023 9717

[DOI] 10.5281/zenodo.8080068 9718
[LICENSE] CC BY-NC-ND 4.0 9719
[PROJECT] Neutrosophic SuperHyperGraphs and SuperHyperGraphs 9720
[AVAILABLE AT TWITTER’S IDS] WordPress ResearchGate Scribd academia ZEN- 9721
ODO_ORG Twitter facebook LinkedIn Amazon googlebooks GooglePlay 9722
9723
[HG293] 9724
10.5281/zenodo.8084436). 9727
9728
[TITLE] “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph By 9729

Strict Dimension Dominating As Hyper Dimple On Super Dimity” 9730
9731
https://www.researchgate.net/publication/371869351 9733
9734
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “Scribd”:] 9735


Figure 44.4: [HG293] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic
SuperHyperGraph By Strict Dimension Dominating As Hyper Dimple On Super Dimity”,
https://www.scribd.com/document/655611260 9736
9737
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ZENODO_ORG”:] 9738
9740
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “academia”:] 9741
https://www.academia.edu/103915854 9742
9743
10.5281/zenodo.8084436). 9747
[ASSIGNED NUMBER] #293 Article 9748
[DATE] June 2023 9749
[DOI] 10.5281/zenodo.8084436 9750
[LICENSE] CC BY-NC-ND 4.0 9751

[PROJECT] Neutrosophic SuperHyperGraphs and SuperHyperGraphs 9752
[AVAILABLE AT TWITTER’S IDS] 9753
WordPress ResearchGate Scribd academia ZENODO_ORG Twitter facebook LinkedIn Amazon 9754
googlebooks GooglePlay 9755
9756
[ASSIGNED NUMBER] | Book #186 9757

HG186b
Henry Garrett, “Strict Dimension Dominating In SuperHyperGraphs”. Dr. Henry Garrett, 2023 9759
(doi: 10.5281/zenodo.8086310). 9760


[TITLE] Strict Dimension Dominating In SuperHyperGraphs 9761

#Latest_Updates 9762
#The_Links 9763
9767
9769
#The_Links 9770
9771
[ASSIGNED NUMBER] | Book #186 9772

9773
[TITLE] Strict Dimension Dominating In SuperHyperGraphs 9774
9775
9779
– 9780
9781
[PUBLISHER] 9782
(Paperback): https://www.amazon.com/dp/- 9783
(Hardcover): https://www.amazon.com/dp/- 9784

(Kindle Edition): https://www.amazon.com/dp/- 9785
9786
– 9787
9788
[ISBN] 9789
(Paperback): - 9790
(Hardcover): - 9791
(Kindle Edition): CC BY-NC-ND 4.0 9792
(EBook): CC BY-NC-ND 4.0 9793
9794
– 9795
9796
[PRINT LENGTH] 9797
(Paperback): - pages 9798
(Hardcover): - pages 9799
(Kindle Edition): - pages 9800
(E-Book): - pages 9801
9802
– 9803
9804
9806

#The_Links 9807
9808
https://www.researchgate.net/publication/- 9810
9811
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “WordPress”] 9812
https://drhenrygarrett.wordpress.com/2023/07/22/ 9813
Strict-Dimension-Dominating-In-SuperHyperGraphs/ 9814
9815
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “Scribd”] 9816
https://www.scribd.com/document/- 9817
9818
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “academia”] 9819
https://www.academia.edu/- 9820
9821
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ZENODO_ORG”] 9822
9824
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “googlebooks”] 9825
https://books.google.com/books/about?id=- 9826
9827
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “GooglePlay”] 9828
https://play.google.com/store/books/details?id=- 9829

[TITLE] Strict Dimension Dominating In SuperHyperGraphs (Published Version) 9830

9831
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “WordPress”] 9832
9833
https://drhenrygarrett.wordpress.com/2023/07/22/ 9834
Strict-Dimension-Dominating-In-SuperHyperGraphs/ 9835
9836
– 9837
9838
[POSTED BY] Dr. Henry Garrett 9839
9840
[DATE] June 027, 2023 9841

9842
[POSTED IN] 186 | Strict Dimension Dominating In SuperHyperGraphs 9843
9844
[TAGS] 9845
Applications, Applied Mathematics, Applied Research, Cancer, Cancer’s Recognitions, Combin- 9846
atorics, Edge, Edges, Graph Theory, Graphs, Latest Research, Literature Reviews, Modeling, 9847
Neutrosophic Graph, Neutrosophic Graph Theory, Neutrosophic Science, Neutrosophic Su- 9848
perHyperClasses, Neutrosophic SuperHyperGraph, Neutrosophic SuperHyperGraph Theory, 9849
neutrosophic SuperHyperGraphs, Neutrosophic Strict Dimension Dominating In SuperHyper- 9850
Graphs, Open Problems, Open Questions, Problems, Pure Math, Pure Mathematics, Questions, 9851
Real-World Applications, Recent Research, Recognitions, Research, scientific research Article, 9852
scientific research Articles, scientific research Book, scientific research Chapter, scientific 9853
research Chapters, Review, SuperHyperClasses, SuperHyperEdges, SuperHyperGraph, Super- 9854

HyperGraph Theory, SuperHyperGraphs, Strict Dimension Dominating In SuperHyperGraphs, 9855
SuperHyperModeling, SuperHyperVertices, Theoretical Research, Vertex, Vertices. 9856
In this scientific research book, there are some scientific research chapters on “Extreme Strict 9857
Dimension Dominating In SuperHyperGraphs” and “Neutrosophic Strict Dimension Dominating 9858
In SuperHyperGraphs” about some scientific research on Strict Dimension Dominating In 9859
SuperHyperGraphs by two (Extreme/Neutrosophic) notions, namely, Extreme Strict Dimension 9860

Dominating In SuperHyperGraphs and Neutrosophic Strict Dimension Dominating In SuperHy- 9861
perGraphs. With scientific research on the basic scientific research properties, the scientific 9862
research book starts to make Extreme Strict Dimension Dominating In SuperHyperGraphs 9863
theory and Neutrosophic Strict Dimension Dominating In SuperHyperGraphs theory more 9864
(Extremely/Neutrosophicly) understandable. 9865

HG186b1.png
Figure 44.7: [HG186b] Henry Garrett, “Strict Dimension Dominating In SuperHyperGraphs”.

Dr. Henry Garrett, 2023 (doi: 10.5281/zenodo.8086310).

HG1865b2.png


HG186b3.png


CHAPTER 45 9866
“SuperHyperGraph-Based Books”: | 9867
Featured Tweets 9868
“SuperHyperGraph-Based Books”: | Featured Tweets 9869
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 9870
CV 9871
503
9872
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
9873
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)
9874
Publications: Articles
2023 283 Manuscript
Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph

By Equal Dimension Dominating As Hyper Dimple On Super Dimity”, Zenodo 2023, (doi:
10.5281/zenodo.8067384).
@ResearchGate: https://www.researchgate.net/publication/371756020
@Scribd: https://www.scribd.com/document/654568722
@ZENODO_ORG: https://zenodo.org/record/8067384
@academia: https://www.academia.edu/103685293
PAGE @facebook: https://www.facebook.com/DrHenryGarrett/posts/
pfbid02PVuRN6wHWsY52awEgDL88yFLdCN6dJtUEezqWcu8ryHhuRZSqWmSUrxpCSshV5KXl
@LinkedIn: https://www.linkedin.com/feed/update/urn:li:ugcPost:7077411062093946880/
2023 282 Manuscript
Henry Garrett, “New Ideas On Super Dimity By Hyper Dimple Of Equal Dimension
Dominating In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023,
(doi: 10.5281/zenodo.8067409).
pfbid0Fk4y4Y5kzep1nfAECg7k6MKiMjgcUNZZhvNiAxPgRPEXYX8wNGjcyQoizDseD8pDl
@LinkedIn: https://www.linkedin.com/feed/update/urn:li:share:7077410014478368769/
2023 281 Manuscript

By Dimension Dominating As Hyper Dimple On Super Dimity”, Zenodo 2023, (doi:
10.5281/zenodo.8061927).
pfbid02AY6rhhhenA7z75Qjv8GEDSoaRcMAfDcKmtxpzm3dyxt1KsVBMoKqxYJ9PegscNKwl
@LinkedIn: https://www.linkedin.com/feed/update/urn:li:share:7077059574163238912/
2023 280 Manuscript
Henry Garrett, “New Ideas On Super Dimity By Hyper Dimple Of Dimension Dominating
In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi:
10.5281/zenodo.8062016).
pfbid0dcDVKSnXYKg63EH6PbqG9u1dLReL1haZ8ouxYdLaPpmYFPJK7HrMeGsNHoheTMGjl
2023 279 Manuscript

9875

By Reverse Connective Dominating As Hyper Conceit On Super Con”, Zenodo 2023, (doi:
10.5281/zenodo.8057696).
pfbid0kHUWk75MYJXth1QP7ieYJjdmUh8KcQovZaC6SeeqncD3Smc6ZFWSwVrGDg8QJgH5l
@LinkedIn: https://www.linkedin.com/posts/drhenrygarrett_279-
henry-garrett-new-ideas-in-recognition-activity-7076691352930930688-
sjGq?utm_source=share&utm_medium=member_desktop
2023 278 Manuscript
Henry Garrett, “New Ideas On Super Con By Hyper Conceit Of Reverse Connective
(doi: 10.5281/zenodo.8057753).
pfbid02JgSBu1Hp92uwoPnorUiVijLAnd2rP5LeronqPJAGVgK299cDGTQqJtr3nwqY2g1Rl
@LinkedIn: https://www.linkedin.com/feed/update/urn:li:activity:7076690695343755264/
2023 277 Manuscript

By Equal Connective Dominating As Hyper Conceit On Super Con”, Zenodo 2023, (doi:
10.5281/zenodo.8052893).
pfbid02StvDe1ZQn2U3yVANyR2Qj597ZzBbj6haYsxscFoW92jFFG2zw1VLQ27qwvisBepjl
2023 276 Manuscript
Henry Garrett, “New Ideas On Super Con By Hyper Conceit Of Equal Connective
(doi: 10.5281/zenodo.8052925).
pfbid031F9WncGQKv9GpFZT9kbWtWawNgvs7awguQ6QyGAyHAoBqiZYzkgUjXRniePoqdw6l
9876
2023 275 Manuscript

By Connective Dominating As Hyper Conceit On Super Con”, Zenodo 2023, (doi:
10.5281/zenodo.8051346).
pfbid028zmPpymc1oLLo41hh4h7eLMDaqhUtZnQSKgAxtJcZfgdfcoxpNQ6EZzyTFU9Wer5l
2023 274 Manuscript
Henry Garrett, “New Ideas On Super Con By Hyper Conceit Of Connective Dominating
10.5281/zenodo.8051360).
pfbid032eqV8CopkBw2jfKW5wKDwmEny91xXzFrmiNXAEoqu6DrdscS5zXndHyFcahXpABgl
2023 241 Manuscript

As Hyper Tool On Super Toot”, Curr Trends Mass Comm 2(1) (2023) 32-55.
(https://www.opastpublishers.com/open-access-articles/new-ideas-in-recognition-of-cancer-
and-neutrosophic-super-hypergraph-as-hyper-tool-on-super-toot.pdf)
PDF: https://www.opastpublishers.com/open-access-articles/new-ideas-in-recognition-of-
cancer-and-neutrosophic-super-hypergraph-as-hyper-tool-on-super-toot.pdf
Abstract:https://www.opastpublishers.com/peer-review/new-ideas-in-recognition-of-cancer-
and-neutrosophic-super-hypergraph-as-hyper-tool-on-super-toot-5648.html
Citation: https://www.opastpublishers.com/citation/new-ideas-in-recognition-of-cancer-and-
neutrosophic-super-hypergraph-as-hyper-tool-on-super-toot-5648.html
Volume:https://www.opastpublishers.com/journal/current-trends-in-mass-
communication/articles-in-press
pfbid024qjfw3bJE3zrFcxB114Ha3VNoqf5nh2itoKqufzyiYaVDQ1t6pH1KJ3SkivPUWQKl
2023 273 Manuscript

9877
By United Dominating As Hyper Ultra On Super Units”, Zenodo 2023, (doi:
10.5281/zenodo.8025707).
pfbid0R5XYMJk3w6At94ARQVBRPeiWXiv9f9FKfLdUj4pUZw5WiTxjpQMF9hr1KTkKGEZ6l
2023 272 Manuscript
Henry Garrett, “New Ideas On Super Units By Hyper Ultra Of United Dominating
10.5281/zenodo.8027275).
pfbid02gs2zNHRgs5n6gGayqoknBWAkoFutW5uaNvG85hSjDXnM5J5nuU8F2FDNAZNkrBtQl
2023 271 Manuscript

By Zero Forcing As Hyper ford On Super forceps”, Zenodo 2023, (doi: 10.5281/zenodo.8017246).
pfbid0vR23GhKEjdnNoiNT5hCsnhcMwg55b6CpT4q6AZ6MJc4kYjxSXgkJM51jioYLJwmDl
2023 270 Manuscript
Henry Garrett, “New Ideas On Super forceps By Hyper ford Of Zero Forcing In Recognition of
Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zenodo.8020128).
pfbid0bi1wyfJX4bdof4TG6R5GRPPKFxHGAiaWvuJZnXL6tKhdeC4PouPCo2BETDsT6m7sl
2023 269 Manuscript

9878
By Matrix-Based As Hyper mat On Super matte”, Zenodo 2023, (doi: 10.5281/zenodo.7978571).
PAGE @facebook : https://www.facebook.com/DrHenryGarrett/posts/
pfbid0EMgDPr8Qr64cgQYNYob7DFjAwa4yzDvtBd5Hwu8Bju6MT937XntZkeShiJL3wtYGl
@LinkedIn : https://www.linkedin.com/feed/update/urn:li:ugcPost:7068500820371091456/
2023 268 Manuscript
Henry Garrett, “New Ideas On Super mat By Hyper matte Of Matrix-Based

In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi:
10.5281/zenodo.7978857).
PAGE @facebook : https://www.facebook.com/DrHenryGarrett/posts/
pfbid0768FmYrMLfn7EnrUBPaPsZFoWzQw4aXR62EZWkhdXfHMUje7JBDCoQarigrzGiaFl
2023 267 Manuscript

By Dominating-Edges As Hyper Dome On Super Eddy”, Zenodo 2023, (doi:
10.5281/zenodo.7940830).
@facebook : https://www.facebook.com/permalink.php?story_fbid=pf
bid0DHRP72yTvULtizh241w9p2VhGMpXdXdH89rwUgnY7dqzJyqxgAjiSsaawZnY6Pzcl&id
=100090667441909
PAGE @facebook : https://www.facebook.com/permalink.php?story_fbid=pf
bid073cCSMu2PvsXjbnXE3PvkfsJW2oECsC9FhcraEnqky9jrNhHmCJ3khAfZy5VeMKal&id
=105165509175944
2023 266 Manuscript

9879
Henry Garrett, “New Ideas On Super Eddy By Hyper Dome Of Dominating-Edges
10.5281/zenodo.7943578).
bid02DM8fDU6YDVKLTCXVpPguYUVcfUkiZwFzjENTP5qiygR8uSGAFtMWjikiM5pMyTLxl&id
=100090667441909
bid05K2QshnbNBcMJPa3RZC19oPc4FV79qmkqHBmtL4Yz2wWdyK5uZwoEVYXCseWv1Sdl&id
=105165509175944
2023 265 Manuscript

By Edge-Gap As Hyper Gape On Super Gab”, Zenodo 2023, (doi: 10.5281/zenodo.7916595).
bid02ZtwTiY3Ldtd42QNGMwdjVCJaoALf6gyDQ4HL96mMmj6gWgfAWWr51WSZkG6iAWtCl&id
=100090667441909
bid02MyRNN1RJMoD27xHe1pz6WCiEu39rbv7r8GfwdnByEePJF6nAiRgYGtk2fkG3CFQSl&id
=105165509175944
2023 264 Manuscript
Henry Garrett, “New Ideas On Super Gab By Hyper Gape Of Edge-Gap

10.5281/zenodo.7923632).
bid032NKnZqrpam2B6YXb3rEpW8AXE9KbAQ15iALaCK7haHfiED3YpdiUT7giYGywZHkHl&id
=100090667441909
bid021XcoJg9VxpzxeRgHG848UdaRbNE7PnusfwFTbRNeLrg19LZtDRun7gYDvjPi8Bbkl&id
=105165509175944
2023 263 Manuscript

9880
By Eulerian-Type-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi:
10.5281/zenodo.7904698).
bid0q4qz8wvNRRUHPXHnouaJLhzaEiFR3sAPVVXAktBaqnBDrWQKgM8t7s5g6L5up1gCl&id
=100090667441909
bid0KMQDXt65fJngQfkfvQrnkuiSmKybzkUpbaz2vtbuDz5B7aeM4ZcUB1o2uawhswDCl&id
=105165509175944
2023 262 Manuscript
Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Type-Cycle-

Neighbor In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi:
10.5281/zenodo.7904671).
bid022MLnimgoywbh7Nm1t4YfNPsPfhx7T5pMDzA425NPf6SNwbvpJp7VZ9EueYAWUL16l&id
=100090667441909
bid02sGHvQEoCQ7ytHFh9JS5ravEkdDbdh1wRsheCw5g3SCoJAPBrgcRPKmPvkKGTTqA9l&id
=105165509175944
2023 261 Manuscript

By Eulerian-Type-Cycle-Decomposition As Hyper Decompress On Super Decompensation”,
bid02Auhe8fKPai12fQr4JzH9wbp1qLQCVtGUbq6J4FBmpjNs7sx69NGgAXmLEmX3mZDCl&id
=100090667441909
bid0muouzWdCK94uH1LTk4drVvuvPZ4bR9yq8vvwquEYZoSseHFw7VbaRKDZTERuE7QYl&id
=105165509175944
2023 260 Manuscript

9881
Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of Eulerian-
Type-Cycle-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”,
bid0Hfz856s7ZBz5zxPcWvbAgsLF2Hu6Ky6yUj6VgSkdhRm95xBUXDd2SqiywRYkJFztl&id
=100090667441909
bid0qMfT6A9fPc2Fw1C2UTYhRVXuvU1gXJtTqEDxCj169gNDyLKGuqDem1NzDVqFbb9al&id
=105165509175944
2023 259 Manuscript

By Eulerian-Type-Cycle-Cut As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi:
10.5281/zenodo.7871026).
bid0y6Hv8C1KYCz7GGfSSjw8W7oeD5P1CPmbMPPUZSPAvP4vftLCXs5CKAfBKcg1XVnSl&id
=100090667441909
bid02wNaiihPpfkg9DufyDVqM4fzFSe88Yp2xKWyreYrfD5hQETbU7UJzoxni9YVCmqBel&id
=105165509175944
2023 258 Manuscript
Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Type-Cycle-

Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi:
10.5281/zenodo.7874647).
bid0nNzjMDKU3XMaJ9Hr3oYruSs2259aa4BybrANdEivV7TmrDe64WgvM3mtGMk5BCdyl&id
=100090667441909
bid0G5v1QVPVWQDEUu6PqDJovggdpCprYk513VjqpfAoqQ4DsAuzgx2jf28Wea4qhnDRl&id
=105165509175944
2023 257 Manuscript

9882
By Eulerian-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi:
10.5281/zenodo.7857856).
bid02KNUykkJYt8Bc7BEXH865F5YETnRorocET2VHPC7hqELMrSru5pjX1V9Eh3MtECd8l&id
=100090667441909
bid0knpZ5z8BJZSsj7TnL2qDfJ2dLtwDFt1PnMnTPVhQFudLmHLkv771E94AXJprBL8Xl&id
=105165509175944
2023 256 Manuscript
Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Cycle-

Neighbor In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023,
(doi: 10.5281/zenodo.7857841).
bid08iMYYsQKk7fVdCjhScLTv2JTk6ERXXJ9SBtaKcsNXGqJ79H5UdJiGJAUg5kSSDCjl&id
=100090667441909
bid0T7zYr9h5V87m78eTsswzk7NUcPwHUaSUqErCN4FMcZN89ZkRFVnaPMn2cuzbFboHl&id
=105165509175944
2023 255 Manuscript

By Eulerian-Cycle-Decomposition As Hyper Decompress On Super Decompensation”, Zenodo
2023, (doi: 10.5281/zenodo.7855661).
bid031iRCrdyWTAQZxnppfp9iwnsHF4Vd15MyiiNkGjJrPhRXKL6nTGXWBRaYWVCA6A8gl&id
=100090667441909
bid0sC8jkawi5dU1zj1UuTYnNLwMAowhbmonN2F87pc1QAQxRwUY3KanJY2BZ6N2f7mbl&id
=105165509175944
@LinkedIn : https://www.linkedin.com/feed/update/urn:li:ugcPost:7055646779198820352
2023 254 Manuscript

9883
Cycle-Decomposition In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”,
bid02Pk4uksX2stX7AUx6jgCaLYWE1rCRNVszGyKUtBmT5F4genjUtrD8nRgwd45R3PJyl&id
=100090667441909
bid02yKq9WgrcBpuMDxqzhr9qMmT5T1byGrCxHBGugZ7oqHvgUeM61tKrqbq7Ewd4bwZjl&id
=105165509175944
2023 253 Manuscript

By Eulerian-Cycle-Cut As Hyper Eulogy On Super EULA”, Zenodo 2023, (doi:
10.5281/zenodo.7853867).
bid031iRCrdyWTAQZxnppfp9iwnsHF4Vd15MyiiNkGjJrPhRXKL6nTGXWBRaYWVCA6A8gl&id
=100090667441909
bid02ExpaJbYr3pVjorCGEuXW22QKCYBMDtWSobYdiucosq69upuF968AwgAQ7Zr1Lrh9l&id
=105165509175944
2023 252 Manuscript
Henry Garrett, “New Ideas On Super EULA By Hyper Eulogy Of Eulerian-Cycle-

10.5281/zenodo.7853922).
bid0F26gh8jMB6kwyjj8n2Gm1kdxFsC4mNw6S5Y2DqgRCxq63riJdUTuGNHBSq2KSv7Ul&id
=100090667441909
bid0oNL1Gy5SZVrdfxiAHsi1MYCLoQozKXAkkzZNfDvvSLMyoxZ93P7vQCyeSXzGRQsYl&id
=105165509175944
2023 251 Manuscript

9884
By Eulerian-Type-Path-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi:
10.5281/zenodo.7851519).
bid0HgJWLq8vMPMA8ktU5ZXQ3oTgmv2fhyk26qrPs3GMAvsVGSF7UKwAGCciNTEHV33Yl&id
=100090667441909
bid0nu8k62sMimbCiFvbeQ7jbbPXAtoHmEs4jYTago6hSZLYRNYXH9upiKxgsHDn21o6l&id
=105165509175944
2023 250 Manuscript
Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Type-Path-

(doi: 10.5281/zenodo.7851550).
bid07iFfA7KpVRvKbQruEVGzK3m2wQkxXvQwrAS2SPiVHjtCzAVRk2aJsGGmuQbVw2mxl&id
=100090667441909
bid025JFAw4ratfahU4VHcxfaf5G6dT9swBnBJDwp3Q5wNhhPSoercdtA535gPN48eGmLl&id
=105165509175944
2023 249 Manuscript

By Eulerian-Type-Path-Decomposition As Hyper Decompress On Super Decompensation”,
bid0t5u3Ti8Umd1TniGVRg78L8RtbropVif7mWFkKT3twSArxhx4qEJ6xH3DVTMVsapLl&id
=100090667441909
bid02JdLpwHLy92LqMiRQnJ1YwFFPAbwEmLS6SXwJFotGmA249dqwhR5g8836Pm3C18jUl&id
=105165509175944
2023 248 Manuscript

9885
Type-Path-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”,
bid0Cv7Ko3mnffB7xPfZsTTVRKGLVLfGnqzquEemtcEpp3Zr2EAKf3e1p6eJGDmQmvfxl&id
=100090667441909
bid0n73h7GjN7Dmwit5hyVfR5TSPVjFLajmkFmRkH636gJTLVzELHvszZFSWQNmJPC8rl&id
=105165509175944
2023 247 Manuscript

By Eulerian-Type-Path-Cut As Hyper Eulogy On Super EULA”, Zenodo 2023, (doi:
10.5281/zenodo.7834229).
2023 246 Manuscript
Henry Garrett, “New Ideas On Super EULA By Hyper Eulogy Of Eulerian-Type-Path-

Cut In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi:
10.5281/zenodo.7834261).
2023 245 Manuscript

By Eulerian-Path-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi:
10.5281/zenodo.7824560).
2023 244 Manuscript
Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Path-

Neighbor In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi:
10.5281/zenodo.7824623).
9886
2023 243 Manuscript

By Eulerian-Path-Decomposition As Hyper Decompress On Super Decompensation”, Zenodo
2023, (doi: 10.5281/zenodo.7819531).
2023 242 Manuscript

Path-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo
2023, (doi: 10.5281/zenodo.7819579).
2023 241 Manuscript

As Hyper Tool On Super Toot”, Zenodo 2023, (doi: 10.5281/zenodo.7812236).
2023 240 Manuscript

By initial Eulerian-Path-Cut As Hyper initial Eulogy On Super initial EULA”, Zenodo 2023,
(doi: 10.5281/zenodo.7809365).
2023 239 Manuscript

By Eulerian-Path-Cut As Hyper Eulogy-Path-Cut On Super EULA-Path-Cut”, Zenodo 2023,
(doi: 10.5281/zenodo.7809358).
2023 238 Manuscript

9887
By Eulerian-Path-Cut As Hyper Eulogy On Super EULA”, Zenodo 2023, (doi:
10.5281/zenodo.7809328).
2023 237 Manuscript
Henry Garrett, “New Ideas On Super EULA By Hyper Eulogy Of Eulerian-Path-

Cut In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi:
10.5281/zenodo.7809219).
2023 236 Manuscript

By Hamiltonian-Type-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023,
(doi: 10.5281/zenodo.7806767).
2023 235 Manuscript
Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Hamiltonian-Type-

Cycle-Neighbor In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo
2023, (doi: 10.5281/zenodo.7806838).
2023 234 Manuscript
Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic

SuperHyperGraph By Hamiltonian-Type-Cycle-Decomposition As Hyper Decompress
On Super Decompensation”, Zenodo 2023, (doi: 10.5281/zenodo.7804238).
2023 233 Manuscript

9888
Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress
Of Hamiltonian-Type-Cycle-Decomposition In Cancer’s Recognition With (Neutrosophic)
SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zenodo.7804228).
2023 232 Manuscript

By Hamiltonian-Type-Cycle-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi:
10.5281/zenodo.7799902).
2023 231 Manuscript
Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Type-

Cycle-Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023,
(doi: 10.5281/zenodo.7804218).
2023 230 Manuscript

By Hamiltonian-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi:
10.5281/zenodo.7796334).
2023 229 Manuscript
Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Hamiltonian-Cycle-

(doi: 10.5281/zenodo.7796354).
2023 228 Manuscript

9889
By Hamiltonian-Cycle-Decomposition As Hyper Decompress On Super Decompensation”,
2023 227 Manuscript

Of Hamiltonian-Cycle-Decomposition In Recognition of Cancer With (Neutrosophic)
2023 226 Manuscript

By Hamiltonian-Cycle-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi:
10.5281/zenodo.7791952).
2023 225 Manuscript
Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Cycle-

10.5281/zenodo.7791982).
2023 224 Manuscript

By Hamiltonian-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi:
10.5281/zenodo.7790026).
2023 223 Manuscript

9890
Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Hamiltonian-
(doi: 10.5281/zenodo.7790052).
2023 222 Manuscript

By Hamiltonian-Decomposition As Hyper Decompress On Super Decompensation”, Zenodo
2023, (doi: 10.5281/zenodo.7787066).
2023 221 Manuscript

Of Hamiltonian-Decomposition In Recognition of Cancer With (Neutrosophic)
2023 220 Manuscript

By Hamiltonian-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi:
10.5281/zenodo.7781476).
2023 219 Manuscript
Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-

10.5281/zenodo.7783082).
2023 218 Manuscript

9891
By Trace-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi:
10.5281/zenodo.7777857).
2023 217 Manuscript
Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Trace-Neighbor

10.5281/zenodo.7779286).
2023 216 Article
Henry Garrett, “A Research on Cancers Recognition and Neutrosophic Super

Hypergraph by Eulerian Super Hyper Cycles and Hamiltonian Sets as Hyper Covering
Versus Super separations”, J Math Techniques Comput Math 2(3) (2023) 136-148.
(https://www.opastpublishers.com/open-access-articles/a-research-on-cancers-recognition-
and-neutrosophic-super-hypergraph-by-eulerian-super-hyper-cycles-and-hamiltonian-sets-
.pdf)
The links to PDF, its abstract, its citation and the volume are as follows.
PDF: https://www.opastpublishers.com/open-access-articles/a-research-on-cancers-
recognition-and-neutrosophic-super-hypergraph-by-eulerian-super-hyper-cycles-and-
hamiltonian-sets-.pdf
Abstract:https://www.opastpublishers.com/peer-review/a-research-on-cancers-recognition-
and-neutrosophic-super-hypergraph-by-eulerian-super-hyper-cycles-and-hamiltonian-sets–
5309.html
Citation: https://www.opastpublishers.com/citation/a-research-on-cancers-recognition-
and-neutrosophic-super-hypergraph-by-eulerian-super-hyper-cycles-and-hamiltonian-sets–
5309.html
Volume:https://www.opastpublishers.com/journal/journal-of-mathematics-
techniques/articles-in-press
JMTCM: https://www.opastpublishers.com/open-access-articles/a-research-on-cancers-
recognition-and-neutrosophic-super-hypergraph-by-eulerian-super-hyper-cycles-and-
hamiltonian-sets-.pdf
@ZENODOO RG : https : //zenodo.org/record/7774581
2023 215 Manuscript
Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph By

Trace-Decomposition As Hyper Decompress On Super Decompensation”, Zenodo 2023, (doi:
10.5281/zenodo.7771831).
@Scribd: https://www.scribd.com/document/-
9892
2023 214 Manuscript
Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of Trace-

Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023,
(doi: 10.5281/zenodo.7772468).
2023 213 Manuscript
Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph

By Trace-Cut As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi:
10.13140/RG.2.2.20913.25446).
2023 212 Manuscript
Henry Garrett, “New Ideas On Super Tract By Hyper Track Of Trace-Cut

10.5281/zenodo.7764916).
2023 211 Manuscript

By Edge-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi:
10.13140/RG.2.2.11770.98247).
2023 210 Manuscript
Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Edge-Neighbor

In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi:
10.13140/RG.2.2.12400.12808).
2023 209 Manuscript

9893
Edge-Decomposition As Hyper Decompress On Super Decompensation”, ResearchGate 2023,
(doi: 10.13140/RG.2.2.22545.10089).
2023 208 Manuscript
Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of

Edge-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”,
ResearchGate 2023, (doi: 10.13140/RG.2.2.29544.34564).
2023 207 Manuscript

Edge-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”,
2023 207 Manuscript
Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic

SuperHyperGraph By Edge-Cut As Hyper Edify On Super Eddy”, ResearchGate 2023,
(doi: 10.13140/RG.2.2.11377.76644).
2023 206 Manuscript
Henry Garrett, “New Ideas On Super Eddy By Hyper Edify Of Edge-Cut In

Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi:
10.13140/RG.2.2.23750.96329).
2023 205 Manuscript

9894
By Vertex-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi:
10.13140/RG.2.2.31366.24641).
2023 204 Manuscript
Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Vertex-Neighbor

10.13140/RG.2.2.34721.68960).
2023 203 Manuscript

By Vertex-Decomposition As Hyper Decompress On Super Decompensation”, ResearchGate
2023, (doi: 10.13140/RG.2.2.30212.81289).
2023 202 Manuscript

Vertex-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”,
2023 201 Manuscript

By Vertex-Cut As Hyper Vertu On Super Vertigo”, ResearchGate 2023, (doi:
10.13140/RG.2.2.24288.35842).
2023 200 Manuscript

9895
Henry Garrett, “New Ideas On Super Vertigo By Hyper Vertu Of Vertex-Cut In
10.13140/RG.2.2.32467.25124).
2023 199 Manuscript

By Stable-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi:
10.13140/RG.2.2.31025.45925).
2023 198 Manuscript
Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of Stable-Neighbor

10.13140/RG.2.2.17184.25602).
2023 197 Manuscript

By Stable-Decompositions As Hyper Stain On Super Stagy”, ResearchGate 2023, (doi:
10.13140/RG.2.2.23423.28327).
2023 196 Manuscript
Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Decompositions

10.13140/RG.2.2.28456.44805).
2023 195 Manuscript

9896
By Stable-Cut As Hyper Stain On Super Stagy”, ResearchGate 2023, (doi:
10.13140/RG.2.2.23525.68320).
2023 194 Manuscript
Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Cut In

10.13140/RG.2.2.20170.24000).
2023 193 Manuscript

By Clique-Neighbors As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi:
10.13140/RG.2.2.36475.59683).
2023 192 Manuscript
Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of Clique-Neighbors

10.13140/RG.2.2.29764.71046).
2023 191 Manuscript

By Clique-Decompositions As Hyper Decompile On Super Decommission”, ResearchGate 2023,
(doi: 10.13140/RG.2.2.18780.87683).
2023 190 Manuscript

9897
Clique-Decompositions In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”,
2023 189 Manuscript

By Clique-Cut As Hyper Click On Super Cliche”, ResearchGate 2023, (doi:
10.13140/RG.2.2.26134.01603).
2023 188 Manuscript
Henry Garrett, “New Ideas On Super Cliff By Hyper Cling Of Clique-Cut In

10.13140/RG.2.2.27392.30721).
2023 187 Manuscript

SuperHyperGraph By Space As Hyper Spin On Super Spacy”, ResearchGate 2023, (doi:
10.13140/RG.2.2.33028.40321).
2023 186 Manuscript

By List-Coloring As Hyper List On Super Lisle”, ResearchGate 2023, (doi:
10.13140/RG.2.2.21389.20966).
2023 185 Manuscript

9898
Henry Garrett, “New Ideas On Super Lith By Hyper Lite Of List-Coloring In
10.13140/RG.2.2.16356.04489).
2023 184 Manuscript

SuperHyperGraph By Space As Hyper Sparse On Super Spark”, ResearchGate 2023,
(doi: 10.13140/RG.2.2.21756.21129).
2023 183 Manuscript
Henry Garrett, “New Ideas On Super Solidarity By Hyper Soul Of Space In

Cancer’s Recognition With (Extreme) SuperHyperGraph”, ResearchGate 2023, (doi:
10.13140/RG.2.2.30983.68009).
2023 182 Manuscript

By Edge-Connectivity As Hyper Disclosure On Super Closure”, ResearchGate 2023, (doi:
10.13140/RG.2.2.28552.29445).
2023 181 Manuscript
Henry Garrett, “New Ideas On Super Uniform By Hyper Deformation Of Edge-Connectivity

10.13140/RG.2.2.10936.21761).
2023 180 Manuscript

9899
By Vertex-Connectivity As Hyper Leak On Super Structure”, ResearchGate 2023, (doi:
10.13140/RG.2.2.35105.89447).
2023 179 Manuscript
Henry Garrett, “New Ideas On Super System By Hyper Explosions Of Vertex-Connectivity

10.13140/RG.2.2.30072.72960).
2023 178 Manuscript

By Tree-Decomposition As Hyper Forward On Super Returns”, ResearchGate 2023, (doi:
10.13140/RG.2.2.31147.52003).
2023 177 Manuscript
Henry Garrett, “New Ideas On Super Nodes By Hyper Moves Of Tree-Decomposition

10.13140/RG.2.2.32825.24163).
2023 176 Manuscript

By Chord As Hyper Excellence On Super Excess”, ResearchGate 2023, (doi:
10.13140/RG.2.2.13059.58401).
2023 175 Manuscript

9900
Henry Garrett, “New Ideas On Super Gap By Hyper Navigations Of Chord In
10.13140/RG.2.2.11172.14720).
2023 174 Manuscript

By SuperHyper(i,j)-Domination As Hyper Controller On Super Waves”, ResearchGate 2023,
(doi: 10.13140/RG.2.2.22011.80165).
2023 173 Manuscript
Henry Garrett, “New Ideas On Super Coincidence By Hyper Routes Of SuperHyper(i,j)-

Domination In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate
2023, (doi: 10.13140/RG.2.2.30819.84003).
2023 172 Manuscript

By SuperHyperEdge-Domination As Hyper Reversion On Super Indirection”, ResearchGate
2023, (doi: 10.13140/RG.2.2.10493.84962).
2023 171 Manuscript
Henry Garrett, “New Ideas On Super Obstacles By Hyper Model Of SuperHyperEdge-

2023, (doi: 10.13140/RG.2.2.13849.29280).
2023 170 Manuscript

9901
By SuperHyperK-Domination As Hyper k-Actions On Super Patterns”, ResearchGate 2023,
(doi: 10.13140/RG.2.2.19944.14086).
2023 169 Manuscript
Henry Garrett, “New Ideas On Super Harmony By Hyper k-Function Of SuperHyperK-

2023, (doi: 10.13140/RG.2.2.23299.58404).
2023 168 Manuscript

By SuperHyperK-Number As Hyper k-Partition On Super Layers”, ResearchGate 2023, (doi:
10.13140/RG.2.2.33103.76968).
2023 167 Manuscript
Henry Garrett, “New Ideas On Super Gradient By Hyper k-Class Of SuperHyperK-Number

10.13140/RG.2.2.23037.44003).
2023 166 Manuscript

SuperHyperOrder As Hyper Enumerations On Super Landmarks”, ResearchGate 2023, (doi:
10.13140/RG.2.2.35646.56641).
2023 165 Manuscript

9902
Henry Garrett, “New Ideas On Super Analogous By Hyper Visions Of SuperHyperOrder
10.13140/RG.2.2.18030.48967).
2023 164 Manuscript

By SuperHyperColoring As Hyper Categories On Super Neighbors”, ResearchGate 2023, (doi:
10.13140/RG.2.2.13973.81121).
2023 163 Manuscript
Henry Garrett, “New Ideas On Super Relations By Hyper Identifications Of

SuperHyperColoring In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”,
2023 162 Manuscript
Henry Garrett, “New Ideas On Super Contradiction By Hyper Detection

of SuperHyperDefensive In Cancer’s Neutrosophic Recognition and Neutrosophic
SuperHyperGraph”, ResearchGate 2023, (doi: 10.13140/RG.2.2.13397.09446).
2023 161 Manuscript

By SuperHyperDimension As Hyper Distinguishing On Super Distances”, ResearchGate 2023,
(doi: 10.13140/RG.2.2.31956.88961).
2023 160 Manuscript

9903
Henry Garrett, “New Ideas On Super Locations By Hyper Differing Of SuperHyperDimension
10.13140/RG.2.2.15179.67361).
2023 159 Manuscript

By SuperHyperDominating As Hyper Closing On Super Messy”, ResearchGate 2023, (doi:
10.13140/RG.2.2.21510.45125).
2023 158 Manuscript
Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDominating

10.13140/RG.2.2.13121.84321).
2023 157 Manuscript

By SuperHyperConnected As Hyper Group On Super Surge”, ResearchGate 2023, (doi:
10.13140/RG.2.2.11758.69441).
2023 156 Manuscript
Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of

SuperHyperConnected In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”,
2023 155 Manuscript

By SuperHyperTotal As Hyper Covering On Super Infections”, ResearchGate 2023, (doi:
10.13140/RG.2.2.19360.87048).
2023 154 Manuscript

9904
Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal

In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi:
10.13140/RG.2.2.32363.21286).
2023 153 Manuscript
Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect

In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi:
10.13140/RG.2.2.23266.81602).
2023 152 Manuscript

By SuperHyperPerfect As Hyper Idealism On Super Vacancy”, ResearchGate 2023, (doi:
10.13140/RG.2.2.19911.37285).
@Scribd: https://www.researchgate.net/publication/368537004
2023 151 Manuscript

By SuperHyperJoin As Hyper Separations On Super Sorts”, ResearchGate 2023, (doi:
10.13140/RG.2.2.11050.90569).
2023 150 Manuscript
Henry Garrett, “New Ideas On Super connections By Hyper disconnections

Of SuperHyperJoin In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”,
2023 149 Manuscript
Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions

Of SuperHyperDuality In Cancer’s Neutrosophic Recognition and Neutrosophic
2023 148 Manuscript

9905
Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph
By SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchGate
2023, (doi: 10.13140/RG.2.2.33275.80161).
2023 147 Manuscript
Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph

By Path SuperHyperColoring As Hyper Correction On Super Faults”, ResearchGate 2023, (doi:
10.13140/RG.2.2.30182.50241).
2023 146 Manuscript
Henry Garrett, “New Ideas On Super Reflections By Hyper Rotations Of

Path SuperHyperColoring In Cancer’s Neutrosophic Recognition and Neutrosophic
2023 145 Manuscript
Henry Garrett, “New Ideas As Hyper Deformations On Super Chains In Cancer’s

Neutrosophic Recognition and Neutrosophic SuperHyperGraph By SuperHyperDensity”,
2023 144 Manuscript
Henry Garrett, “New Ideas As Hyper Ignorance By SuperHyperDensity On Super Resistances

In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, ResearchGate
2023, (doi:10.13140/RG.2.2.16800.05123).
2023 143 Manuscript
Henry Garrett, “New Research On Cancer’s Recognition and Neutrosophic SuperHyperGraph

By Eulerian SuperHyperCycles and Hamiltonian Sets As Hyper Covering Versus Super
separations-VI”, ResearchGate 2023, (doi: 10.13140/RG.2.2.29913.80482).
@WordPress: -
2023 142 Manuscript

9906
separations-V”, ResearchGate 2023, (doi: 10.13140/RG.2.2.33269.24809).
@WordPress: -
@Scribd:https://www.scribd.com/document/624023778
2023 141 Manuscript

separations-IV”, ResearchGate 2023, (doi: 10.13140/RG.2.2.34946.96960).
@WordPress: -
2023 140 Manuscript
Henry Garrett, “A Research On Cancer’s Recognition and Neutrosophic SuperHyperGraph

separations-III”, ResearchGate 2023, (doi: 10.13140/RG.2.2.14814.31040).
@WordPress: -
2023 139 Manuscript

separations-II”, ResearchGate 2023, (doi: 10.13140/RG.2.2.15653.17125).
@WordPress: -
2023 138 Manuscript

separations-I”, ResearchGate 2023, (doi: 10.13140/RG.2.2.25719.50089).
@WordPress: -
2023 137 Manuscript
Henry Garrett, “New Ideas On Super Disruptions In Cancer’s Extreme Recognition

As Neutrosophic SuperHyperGraph By Hyper Plans Called SuperHyperConnectivities”,
@WordPress: -
2023 136 Manuscript

9907
Henry Garrett, “Cancer’s Neutrosophic Recognition As Neutrosophic SuperHyperGraph

By SuperHyperConnectivities As Hyper Diagnosis On Super Mechanism”, ResearchGate 2023,
(doi: 10.13140/RG.2.2.17252.24968).
@WordPress: -
2023 135 Manuscript
Henry Garrett,“Cancer’s Recognition and (Neutrosophic) SuperHyperGraph By the

Criteria of Eulerian and Hamiltonian Type-Sets As Hyper Modified Cycles On Super Mess”,
ResearchGate 2023,(doi: 10.13140/RG.2.2.16652.59525).
@WordPress: -
2023 134 Manuscript
Henry Garrett,“Eulerian and Hamiltonian In Cancer’s Neutrosophic Recognition and

Neutrosophic SuperHyperGraph On Super Interactions By Hyper Extensions of Cycles”,
ResearchGate 2023,(doi: 10.13140/RG.2.2.34583.24485).
@WordPress: -
2023 Article133 (JMTCM) Article
Henry Garrett, “Some Super Hyper Degrees and Co-Super Hyper Degrees on Neutrosophic
Super Hyper Graphs And Super Hyper Graphs Alongside Applications in Cancer’s
Treatments”, J Math Techniques Comput Math 2(1) (2023) 35-47.
(https://www.opastpublishers.com/open-access-articles/some-super-hyper-degrees-
and-cosuper-hyper-degrees-on-neutrosophic-super-hyper-graphs-and-super-hyper-graphs-
alongside-a.pdf)
The links to PDF, its abstract, its citation and the volume are as follows.
PDF:https://www.opastpublishers.com/open-access-articles/some-super-hyper-degrees-
and-cosuper-hyper-degrees-on-neutrosophic-super-hyper-graphs-and-super-hyper-graphs-
alongside-a.pdf
Abstract:https://www.opastpublishers.com/peer-review/some-super-hyper-degrees-and-
cosuper-hyper-degrees-on-neutrosophic-super-hyper-graphs-and-super-hyper-graphs-
alongside-a-5009.html
Citation:https://www.opastpublishers.com/citation/some-super-hyper-degrees-and-cosuper-
hyper-degrees-on-neutrosophic-super-hyper-graphs-and-super-hyper-graphs-alongside-a-
5009.html
Volume:https://www.opastpublishers.com/table-contents/jmtcm-volume-2-issue-1-year-2023
2023 132 Manuscript
Henry Garrett,“SuperHyperGirth Type-Results on extreme SuperHyperGirth theory and

(Neutrosophic) SuperHyperGraphs Toward Cancer’s extreme Recognition”, Preprints 2023,
2023010396 (doi: 10.20944/preprints202301.0396.v1).
@WordPress: -
@PrePrints_ORG: https://www.preprints.org/manuscript/202301.0396/v1
@ZENODO_ORG:https://zenodo.org/record/7559540
2023 131 Manuscript

9908
Henry Garrett,“Neutrosophic SuperHyperGraphs Warns Hyper Landmark of neutrosophic

SuperHyperGirth In Super Type-Versions of Cancer’s neutrosophic Recognition”, Preprints
2023, 2023010395 (doi: 10.20944/preprints202301.0395.v1).
@WordPress: -
@PrePrints_ORG: https://www.preprints.org/manuscript/202301.0395/v1
2023 130 Manuscript
Henry Garrett,“The Constructions of (Neutrosophic) SuperHyperGraphs on the Cancer’s

Recognition in The Confrontation With Super Attacks In Hyper Situations By Implementing
(Neutrosophic) 1-Failed SuperHyperForcing in The Technical Approaches to Neutralize
SuperHyperViews”, ResearchGate 2023, (doi: 10.13140/RG.2.2.26240.51204).
@WordPress: -
2023 129 Manuscript
Henry Garrett,“(Neutrosophic) 1-Failed SuperHyperForcing As the Entrepreneurs on

Cancer’s Recognitions To Fail Forcing Style As the Super Classes With Hyper Effects In The
Background of the Framework is So-Called (Neutrosophic) SuperHyperGraphs”, ResearchGate
2023, (doi: 10.13140/RG.2.2.12818.73925).
@WordPress: -
2023 128 Manuscript
Henry Garrett,“Super Actions On The Types of Hyper Levels In The Sensible

Neutrosophic SuperHyperGirth On Cancer’s Neutrosophic Recognition and Neutrosophic
SuperHyperGraph”, ResearchGate 2023,(doi: 10.13140/RG.2.2.26836.88960).
@WordPress: -
2023 127 Manuscript
Henry Garrett,“SuperHyperGirth Approaches on the Super Challenges on the Cancer’s

Recognition In the Hyper Model of (Neutrosophic) SuperHyperGraph”, ResearchGate
2023,(doi: 10.13140/RG.2.2.36745.93289).
@WordPress: -
@ResearchGate:https://www.researchgate.net/publication/367336398
2023 0126 | Extreme SuperHyperClique as the Firm Scheme of Confrontation under Cancer’s Recognition Manuscript
as the Model in The Setting of (Neutrosophic) SuperHyperGraphs
Henry Garrett,“Extreme SuperHyperClique as the Firm Scheme of Confrontation under
Cancer’s Recognition as the Model in The Setting of (Neutrosophic) SuperHyperGraphs”,
Preprints 2023, 2023010308 (doi: 10.20944/preprints202301.0308.v1).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn
9909
2023 0125 | Uncertainty On The Act And Effect Of Cancer Alongside The Foggy Positions Of Cells Manuscript
Toward Neutrosophic Failed SuperHyperClique inside Neutrosophic SuperHyperGraphs Titled Cancer’s
Recognition
Henry Garrett,“Uncertainty On The Act And Effect Of Cancer Alongside The Foggy
Positions Of Cells Toward Neutrosophic Failed SuperHyperClique inside Neutrosophic
SuperHyperGraphs Titled Cancer’s Recognition”, Preprints 2023, 2023010282 (doi:
10.20944/preprints202301.0282.v1).
2023 0124 | Neutrosophic Version Of Separates Groups Of Cells In Cancer’s Recognition On Neutrosophic Manuscript
SuperHyperGraphs
Henry Garrett,“Neutrosophic Version Of Separates Groups Of Cells In Cancer’s
Recognition On Neutrosophic SuperHyperGraphs”, Preprints 2023, 2023010267 (doi:
10.20944/preprints202301.0267.v1).).
2023 0123 | The Shift Paradigm To Classify Separately The Cells and Affected Cells Toward The Totality Manuscript
Under Cancer’s Recognition By New Multiple Definitions On the Sets Polynomials Alongside Numbers
In The (Neutrosophic) SuperHyperMatching Theory Based on SuperHyperGraph and Neutrosophic
SuperHyperGraph
Henry Garrett, “The Shift Paradigm To Classify Separately The Cells and Affected Cells
Toward The Totality Under Cancer’s Recognition By New Multiple Definitions On the Sets
Polynomials Alongside Numbers In The (Neutrosophic) SuperHyperMatching Theory Based
on SuperHyperGraph and Neutrosophic SuperHyperGraph”, Preprints 2023, 2023010265 (doi:
10.20944/preprints202301.0265.v1).
2023 0122 | Breaking the Continuity and Uniformity of Cancer In The Worst Case of Full Manuscript
Connections With Extreme Failed SuperHyperClique In Cancer’s Recognition Applied in (Neutrosophic)
SuperHyperGraphs
Henry Garrett,“Breaking the Continuity and Uniformity of Cancer In The
Worst Case of Full Connections With Extreme Failed SuperHyperClique In Cancer’s
Recognition Applied in (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010262,(doi:
10.20944/preprints202301.0262.v1).
2023 0121 | Neutrosophic Failed SuperHyperStable as the Survivors on the Cancer’s Neutrosophic Manuscript
Recognition Based on Uncertainty to All Modes in Neutrosophic SuperHyperGraphs
Henry Garrett, “Neutrosophic Failed SuperHyperStable as the Survivors on the
Cancer’s Neutrosophic Recognition Based on Uncertainty to All Modes in Neutrosophic
SuperHyperGraphs”, Preprints 2023, 2023010240 (doi: 10.20944/preprints202301.0240.v1).
2023 0120 | Extremism of the Attacked Body Under the Cancer’s Circumstances Where Cancer’s Manuscript
Recognition Titled (Neutrosophic) SuperHyperGraphs
Henry Garrett, “Extremism of the Attacked Body Under the Cancer’s Circumstances Where
Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010224,
(doi: 10.20944/preprints202301.0224.v1).
2023 0119 | SuperHyperMatching By (R-)Definitions And Polynomials To Monitor Cancer’s Recognition Manuscript
In Neutrosophic SuperHyperGraphs
Henry Garrett,“SuperHyperMatching By (R-)Definitions And Polynomials To Monitor
Cancer’s Recognition In Neutrosophic SuperHyperGraphs”, ResearchGate 2023,(doi:
10.13140/RG.2.2.35061.65767).
2023 0118 | The Focus on The Partitions Obtained By Parallel Moves In The Cancer’s Extreme Recognition Manuscript
With Different Types of Extreme SuperHyperMatching Set and Polynomial on (Neutrosophic)
SuperHyperGraphs
Henry Garrett,“The Focus on The Partitions Obtained By Parallel Moves In The
Cancer’s Extreme Recognition With Different Types of Extreme SuperHyperMatching
Set and Polynomial on (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023,(doi:
10.13140/RG.2.2.18494.15680).
9910
2023 0117 | Indeterminacy On The All Possible Connections of Cells In Front of Cancer’s Attacks In Manuscript
The Terms of Neutrosophic Failed SuperHyperClique on Cancer’s Recognition called Neutrosophic
SuperHyperGraphs
Henry Garrett,“Extreme Failed SuperHyperClique Decides the Failures on the Cancer’s
Recognition in the Perfect Connections of Cancer’s Attacks By SuperHyperModels Named
(Neutrosophic) SuperHyperGraphs”, ResearchGate 2023,(doi: 10.13140/RG.2.2.15897.70243).
2023 0116 | Extreme Failed SuperHyperClique Decides the Failures on the Cancer’s Recognition Manuscript
in the Perfect Connections of Cancer’s Attacks By SuperHyperModels Named (Neutrosophic)
SuperHyperGraphs
Henry Garrett,“Extreme Failed SuperHyperClique Decides the Failures on the Cancer’s
Recognition in the Perfect Connections of Cancer’s Attacks By SuperHyperModels Named
(Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 10.13140/RG.2.2.32530.73922).
2023 0115 | (Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Recognitions And (Neutrosophic) Manuscript
SuperHyperGraphs
Henry Garrett, “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s
Recognitions And (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010105 (doi:
10.20944/preprints202301.0105.v1).
2023 0114 | Perfect Directions Toward Idealism in Cancer’s Neutrosophic Recognition Forwarding Manuscript
Neutrosophic SuperHyperClique on Neutrosophic SuperHyperGraphs
Henry Garrett,“Perfect Directions Toward Idealism in Cancer’s Neutrosophic Recognition
Forwarding Neutrosophic SuperHyperClique on Neutrosophic SuperHyperGraphs”,
2023 0113 | Demonstrating Complete Connections in Every Embedded Regions and Sub-Regions in Manuscript
the Terms of Cancer’s Recognition and (Neutrosophic) SuperHyperGraphs With (Neutrosophic)
SuperHyperClique
Henry Garrett,“Demonstrating Complete Connections in Every Embedded Regions and Sub-
Regions in the Terms of Cancer’s Recognition and (Neutrosophic) SuperHyperGraphs With
(Neutrosophic) SuperHyperClique”, ResearchGate 2023, (doi: 10.13140/RG.2.2.23172.19849).
2023 0112 | Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic) SuperHyperModeling Manuscript
in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs
Henry Garrett, “Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic)
SuperHyperModeling in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs”,
2023 0111 | Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic SuperHyperStable To Manuscript

Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints
Henry Garrett, “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic
SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints”,
2023 0110 | Different Neutrosophic Types of Neutrosophic Regions titled neutrosophic Failed Manuscript
SuperHyperStable in Cancer’s Neutrosophic Recognition modeled in the Form of Neutrosophic
SuperHyperGraphs
Henry Garrett,“Different Neutrosophic Types of Neutrosophic Regions titled neutrosophic
Failed SuperHyperStable in Cancer’s Neutrosophic Recognition modeled in the Form of
Neutrosophic SuperHyperGraphs”, ResearchGate 2023, (doi: 10.13140/RG.2.2.17385.36968).
2022 0109 | 0039 | Closing Numbers and Super-Closing Numbers as (Dual)Resolving and (Dual)Coloring Manuscript
alongside (Dual)Dominating in (Neutrosophic)n-SuperHyperGraph
9911
Garrett, Henry. “0039 | Closing Numbers and Super-Closing Numbers as (Dual)Resolving and
(Dual)Coloring alongside (Dual)Dominating in (Neutrosophic)n-SuperHyperGraph.” CERN
European Organization for Nuclear Research - Zenodo, Nov. 2022. CERN European
Organization for Nuclear Research, https://doi.org/10.5281/zenodo.6319942.
https://oa.mg/work/10.5281/zenodo.6319942
2022 0108 | 0049 | (Failed)1-Zero-Forcing Number in Neutrosophic Graphs Manuscript
Garrett, Henry. “0049 | (Failed)1-Zero-Forcing Number in Neutrosophic Graphs.” CERN

European Organization for Nuclear Research - Zenodo, Feb. 2022. CERN European
Organization for Nuclear Research, https://doi.org/10.13140/rg.2.2.35241.26724.
https://oa.mg/work/10.13140/rg.2.2.35241.26724
2023 0107 | Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To Use Neutrosophic Manuscript
SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond
Henry Garrett, “Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To
Use Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond”,
Preprints 2023, 2023010044
2023 0106 | (Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well-SuperHyperModelled Manuscript

(Neutrosophic) SuperHyperGraphs
Henry Garrett, “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well-
SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010043 (doi:
10.20944/preprints202301.0043.v1).
2022 Article105 (JMTCM) Article
Henry Garrett, “Super Hyper Dominating and Super Hyper Resolving on Neutrosophic Super
Hyper Graphs and Their Directions in Game Theory and Neutrosophic Super Hyper Classes”,
J Math Techniques Comput Math 1(3) (2022) 242-263. (doi: 10.33140/JMTCM.01.03.09).
2023 0104 | Using the Tool As (Neutrosophic) Failed SuperHyperStable To SuperHyperModel Cancer’s Manuscript
Recognition Titled (Neutrosophic) SuperHyperGraphs
Henry Garrett,“Using the Tool As (Neutrosophic) Failed SuperHyperStable To
SuperHyperModel Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs”,
2023 0103 | Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic SuperHyperStable To Manuscript

Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints
Henry Garrett,“Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic
SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints”,
2023 0102 | (Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well-SuperHyperModelled Manuscript

(Neutrosophic) SuperHyperGraphs
Henry Garrett,“(Neutrosophic) SuperHyperStable on Cancer’s Recognition by
Well-SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi:
10.13140/RG.2.2.35774.77123).
2022 0101 | Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To Use Neutrosophic Manuscript
SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond
Henry Garrett,“Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To
Use Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond”,
9912
2022 0100 | (Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Recognitions And (Neutrosophic) Manuscript
SuperHyperGraphs
Henry Garrett,“(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Recognitions And
(Neutrosophic) SuperHyperGraphs”, ResearchGate 2022, (doi: 10.13140/RG.2.2.29430.88642).
2022 0099 | Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic) SuperHyperModeling Manuscript
in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs
Henry Garrett,“Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic)
SuperHyperModeling in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs”,
2022 0098 | (Neutrosophic) SuperHyperModeling of Cancer’s Recognitions Featuring (Neutrosophic) Manuscript

SuperHyperDefensive SuperHyperAlliances
Henry Garrett, “(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions Featuring
(Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, Preprints 2022, 2022120549 (doi:
10.20944/preprints202212.0549.v1).
2022 0098 | (Neutrosophic) SuperHyperModeling of Cancer’s Recognitions Featuring (Neutrosophic) Manuscript

SuperHyperDefensive SuperHyperAlliances
Henry Garrett, “(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions
Featuring (Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, ResearchGate 2022,
(doi: 10.13140/RG.2.2.19380.94084).
2022 0097 | (Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and SuperHyperOffensive Manuscript

Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With (Neutrosophic) SuperHyperModeling
of Cancer’s Recognitions And Related (Neutrosophic) SuperHyperClasses

Henry Garrett, “(Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and
SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With
(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions And Related (Neutrosophic)
SuperHyperClasses”, Preprints 2022, 2022120540 (doi: 10.20944/preprints202212.0540.v1).
2022 0097 | (Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and SuperHyperOffensive Manuscript

Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With (Neutrosophic) SuperHyperModeling
of Cancer’s Recognitions And Related (Neutrosophic) SuperHyperClasses

Henry Garrett, “(Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and
SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With
(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions And Related (Neutrosophic)
SuperHyperClasses”, ResearchGate 2022, (doi: 10.13140/RG.2.2.14426.41923).
2022 0096 | SuperHyperGirth on SuperHyperGraph and Neutrosophic SuperHyperGraph With Manuscript

SuperHyperModeling of Cancer’s Recognitions
Henry Garrett, “SuperHyperGirth on SuperHyperGraph and Neutrosophic
SuperHyperGraph With SuperHyperModeling of Cancer’s Recognitions”, Preprints 2022,
2022120500 (doi: 10.20944/preprints202212.0500.v1).
2022 0096 | SuperHyperGirth on SuperHyperGraph and Neutrosophic SuperHyperGraph With Manuscript

SuperHyperModeling of Cancer’s Recognitions
Henry Garrett, “SuperHyperGirth on SuperHyperGraph and Neutrosophic
SuperHyperGraph With SuperHyperModeling of Cancer’s Recognitions”, ResearchGate
2022 (doi: 10.13140/RG.2.2.20993.12640).
2022 0095 | Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic SuperHyperGraphs Manuscript

and SuperHyperGraphs Alongside Applications in Cancer’s Treatments
Henry Garrett,“Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic
SuperHyperGraphs and SuperHyperGraphs Alongside Applications in Cancer’s Treatments”,
9913
2022 0095 | Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic SuperHyperGraphs Manuscript
And SuperHyperGraphs Alongside Applications in Cancer’s Treatments
Henry Garrett, “Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic
SuperHyperGraphs And SuperHyperGraphs Alongside Applications in Cancer’s Treatments”,
ResearchGate 2022 (doi: 10.13140/RG.2.2.23123.04641).
2022 0094 | SuperHyperDominating and SuperHyperResolving on Neutrosophic SuperHyperGraphs And Manuscript

Their Directions in Game Theory and Neutrosophic SuperHyperClasses
Henry Garrett, “SuperHyperDominating and SuperHyperResolving on Neutrosophic
SuperHyperGraphs And Their Directions in Game Theory and Neutrosophic
SuperHyperClasses”, Preprints 2022, 2022110576 (doi: 10.20944/preprints202211.0576.v1).
2022 0094 | SuperHyperDominating and SuperHyperResolving on Neutrosophic SuperHyperGraphs And Manuscript

Their Directions in Game Theory and Neutrosophic SuperHyperClasses
Henry Garrett, “SuperHyperDominating and SuperHyperResolving on Neutrosophic
SuperHyperGraphs And Their Directions in Game Theory and Neutrosophic
SuperHyperClasses”, ResearchGate 2022 (doi: 10.13140/RG.2.2.23324.56966).
2022 0093 | Neutrosophic Co-degree and Neutrosophic Degree alongside Chromatic Numbers in the Setting Article
of Some Classes Related to Neutrosophic Hypergraphs
Henry Garrett, “Neutrosophic Co-degree and Neutrosophic Degree alongside Chromatic
Numbers in the Setting of Some Classes Related to Neutrosophic Hypergraphs”, J Curr Trends
Comp Sci Res 2(1) (2023) 16-24. (doi: 10.33140/JCTCSR.02.01.04).
PDF,Abstract,Issue.
2022 0092 | Recognition of the Pattern for Vertices to Make Dimension by Resolving in some Classes of Manuscript
Neutrosophic Graphs
Henry Garrett, “Recognition of the Pattern for Vertices to Make Dimension
by Resolving in some Classes of Neutrosophic Graphs”, ResearchGate 2022 (doi:
10.13140/RG.2.2.27281.51046).
2022 0091 | Regularity of Every Element to Function in the Type of Domination in Neutrosophic Graphs Manuscript
Henry Garrett, “Regularity of Every Element to Function in the Type of Domination in

Neutrosophic Graphs”, ResearchGate 2022 (doi: 10.13140/RG.2.2.22861.10727).
2022 0090 | Initial Material of Neutrosophic Preliminaries to Study Some Neutrosophic Notions Based on Manuscript
Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic SuperHyperGraph (NSHG)
Henry Garrett, “Initial Material of Neutrosophic Preliminaries to Study Some Neutrosophic
Notions Based on Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic SuperHyperGraph
(NSHG)”, ResearchGate 2022 (doi: 10.13140/RG.2.2.25385.88160).
2022 0089 | Basic Neutrosophic Notions Concerning Neutrosophic SuperHyperDominating and Manuscript
Neutrosophic SuperHyperResolving in Neutrosophic SuperHyperGraph
Henry Garrett, “Basic Neutrosophic Notions Concerning Neutrosophic
SuperHyperDominating and Neutrosophic SuperHyperResolving in Neutrosophic
SuperHyperGraph”, ResearchGate 2022 (doi: 10.13140/RG.2.2.29173.86244).
2022 0088 | Seeking Empty Subgraphs To Determine Different Measurements in Some Classes of Manuscript
Neutrosophic Graphs
Henry Garrett, “Seeking Empty Subgraphs To Determine Different Measurements in Some
Classes of Neutrosophic Graphs”, ResearchGate 2022 (doi: 10.13140/RG.2.2.30448.53766).
2022 0087 | Impacts of Isolated Vertices To Cover Other Vertices in Neutrosophic Graphs Manuscript
9914
Henry Garrett, “Impacts of Isolated Vertices To Cover Other Vertices in Neutrosophic

Graphs”, ResearchGate 2022 (doi: 10.13140/RG.2.2.16185.44647).
2022 0086 | Perfect Locating of All Vertices in Some Classes of Neutrosophic Graphs Manuscript
Henry Garrett, “Perfect Locating of All Vertices in Some Classes of Neutrosophic Graphs”,
2022 0085 | Complete Connections Between Vertices in Neutrosophic Graphs Manuscript
Henry Garrett, “Complete Connections Between Vertices in Neutrosophic Graphs”,

2022 0084 | Unique Distance Differentiation By Collection of Vertices in Neutrosophic Graphs Manuscript
Henry Garrett, “Unique Distance Differentiation By Collection of Vertices in Neutrosophic

2022 0083 | Single Connection Amid Vertices From Two Given Sets Partitioning Vertex Set in Some Classes Manuscript
of Neutrosophic Graphs
Henry Garrett, “Single Connection Amid Vertices From Two Given Sets Partitioning
Vertex Set in Some Classes of Neutrosophic Graphs”, ResearchGate 2022 (doi:
10.13140/RG.2.2.32189.33764).
2022 0082 | Separate Joint-Sets Representing Separate Numbers Where Classes of Neutrosophic Graphs Manuscript
and Applications are Cases of Study
Henry Garrett, “Separate Joint-Sets Representing Separate Numbers Where Classes
of Neutrosophic Graphs and Applications are Cases of Study”, ResearchGate 2022 (doi:
10.13140/RG.2.2.22666.95686).
2022 0081 | Repetitive Joint-Sets Featuring Multiple Numbers For Neutrosophic Graphs Manuscript
Henry Garrett, “Repetitive Joint-Sets Featuring Multiple Numbers For Neutrosophic

2022 0080 | Dual-Resolving Numbers Excerpt from Some Classes of Neutrosophic Graphs With Some Manuscript
Applications
Henry Garrett, “Dual-Resolving Numbers Excerpt from Some Classes of Neutrosophic
Graphs With Some Applications”, ResearchGate 2022 (doi: 10.13140/RG.2.2.14971.39200).
2022 0079 | Dual-Dominating Numbers in Neutrosophic Setting and Crisp Setting Obtained From Classes Manuscript
of Neutrosophic Graphs
Henry Garrett, “Dual-Dominating Numbers in Neutrosophic Setting and Crisp
Setting Obtained From Classes of Neutrosophic Graphs”, ResearchGate 2022 (doi:
10.13140/RG.2.2.19925.91361).
2022 0078 | Neutrosophic Path-Coloring Numbers BasedOn Endpoints In Neutrosophic Graphs Manuscript
Henry Garrett, “Neutrosophic Path-Coloring Numbers BasedOn Endpoints In Neutrosophic

2022 0077 | Neutrosophic Dominating Path-Coloring Numbers in New Visions of Classes of Neutrosophic Manuscript
Graphs
9915
Henry Garrett, “Neutrosophic Dominating Path-Coloring Numbers in New Visions of Classes

of Neutrosophic Graphs”, ResearchGate 2022 (doi: 10.13140/RG.2.2.32151.65445).
2022 0076 | Path Coloring Numbers of Neutrosophic Graphs Based on Shared Edges and Neutrosophic Manuscript
Cardinality of Edges With Some Applications from Real-World Problems
Henry Garrett, “Path Coloring Numbers of Neutrosophic Graphs Based on Shared Edges
and Neutrosophic Cardinality of Edges With Some Applications from Real-World Problems”,
2022 0075 | Neutrosophic Collapsed Numbers in the Viewpoint of Neutrosophic Graphs Manuscript
Henry Garrett, “Neutrosophic Collapsed Numbers in the Viewpoint of Neutrosophic Graphs”,

2022 0074 | Bulky Numbers of Classes of Neutrosophic Graphs Based on Neutrosophic Edges Manuscript
Henry Garrett, “Bulky Numbers of Classes of Neutrosophic Graphs Based on Neutrosophic

Edges”, ResearchGate 2022 (doi: 10.13140/RG.2.2.24204.18564).
2022 0073 | Dense Numbers and Minimal Dense Sets of Neutrosophic Graphs Manuscript
Henry Garrett, “Dense Numbers and Minimal Dense Sets of Neutrosophic Graphs”,
2022 0072 | Connectivities of Neutrosophic Graphs in the terms of Crisp Cycles Manuscript
Henry Garrett, “Connectivities of Neutrosophic Graphs in the terms of Crisp Cycles”,

2022 0071 | Strong Paths Defining Connectivities in Neutrosophic Graphs Manuscript
Henry Garrett, “Strong Paths Defining Connectivities in Neutrosophic Graphs”,

2022 0070 | Finding Longest Weakest Paths assigning numbers to some Classes of Neutrosophic Graphs Manuscript
Henry Garrett, “Finding Longest Weakest Paths assigning numbers to some Classes of
Neutrosophic Graphs”, ResearchGate 2022 (doi: 10.13140/RG.2.2.35579.59689).
2022 0068 | Relations and Notions amid Hamiltonicity and Eulerian Notions in Some Classes of Manuscript
Neutrosophic Graphs
Henry Garrett, “Relations and Notions amid Hamiltonicity and Eulerian Notions in Some
Classes of Neutrosophic Graphs”, ResearchGate 2022 (doi: 10.13140/RG.2.2.35579.59689).
2022 0067 | Eulerian Results In Neutrosophic Graphs With Applications Manuscript
Henry Garrett, “Eulerian Results In Neutrosophic Graphs With Applic- ations”,

2022 0066 | Finding Hamiltonian Neutrosophic Cycles in Classes of Neutrosophic Graphs Manuscript
9916
Henry Garrett, “Finding Hamiltonian Neutrosophic Cycles in Classes of Neutrosophic

2022 0065 | Extending Sets Type-Results in Neutrosophic Graphs Manuscript
Henry Garrett, “Extending Sets Type-Results in Neutrosophic Graphs”, ResearchGate 2022

(doi: 10.13140/RG.2.2.13317.01767).
2022 0064 | Some Polynomials Related to Numbers in Classes of (Strong) Neutrosophic Graphs Manuscript
Henry Garrett, “Some Polynomials Related to Numbers in Classes of (Strong) Neutrosophic

2022 0063 | Finding Shortest Sequences of Consecutive Vertices in Neutrosophic Graphs Manuscript
Henry Garrett, “Finding Shortest Sequences of Consecutive Vertices in Neutrosophic

2022 0062 | Neutrosophic Girth Based On Crisp Cycle in Neutrosophic Graphs Manuscript
Henry Garrett, “Neutrosophic Girth Based On Crisp Cycle in Neutrosophic Graphs”,

2022 0061 | e-Matching Number and e-Matching Polynomials in Neutrosophic Graphs Manuscript
Henry Garrett, “e-Matching Number and e-Matching Polynomials in Neutrosophic Graphs”,

2022 0060 | Matching Polynomials in Neutrosophic Graphs Manuscript
Henry Garrett, “Matching Polynomials in Neutrosophic Graphs”, ResearchGate 2022 (doi:

10.13140/RG.2.2.33630.72002).
2022 0059 | Some Results in Classes Of Neutrosophic Graphs Manuscript
Henry Garrett, “Some Results in Classes Of Neutrosophic Graphs”, Preprints 2022,

2022030248 (doi: 10.20944/preprints202203.0248.v1).
2022 0058 | Matching Number in Neutrosophic Graphs Manuscript
Henry Garrett, “Matching Number in Neutrosophic Graphs”, ResearchGate 2022 (doi:

10.13140/RG.2.2.18609.86882).
2022 0055 | (Failed) 1-clique Number in Neutrosophic Graphs Manuscript
Henry Garrett, “(Failed) 1-Clique Number in Neutrosophic Graphs”, ResearchGate 2022

(doi: 10.13140/RG.2.2.14241.89449).
2022 0054 | Failed Clique Number in Neutrosophic Graphs Manuscript
Henry Garrett, “Failed Clique Number in Neutrosophic Graphs”, ResearchGate 2022 (doi:
10.13140/RG.2.2.36039.16800).
9917
2022 0053 | Clique Number in Neutrosophic Graphs Manuscript
Henry Garrett, “Clique Number in Neutrosophic Graphs”, ResearchGate 2022 (doi:

10.13140/RG.2.2.28338.68800).
2022 0052 | (Failed) 1-independent Number in Neutrosophic Graphs Manuscript
Henry Garrett, “(Failed) 1-Independent Number in Neutrosophic Graphs”, ResearchGate

2022 (doi: 10.13140/RG.2.2.30593.12643).
2022 0051 | Failed Independent Number in Neutrosophic Graphs Manuscript
Henry Garrett, “Failed Independent Number in Neutrosophic Graphs”, Preprints 2022,

2022020334 (doi: 10.20944/preprints202202.0334.v2)
2022 0051 | Failed Independent Number in Neutrosophic Graphs Manuscript
Henry Garrett, “Failed Independent Number in Neutrosophic Graphs”, ResearchGate 2022

(doi: 10.13140/RG.2.2.31196.05768).
2022 0050 | Independent Set in Neutrosophic Graphs Manuscript
Henry Garrett, “Independent Set in Neutrosophic Graphs”, Preprints 2022, 2022020334 (doi:
10.20944/preprints202202.0334.v1).
2022 0050 | Independent Set in Neutrosophic Graphs Manuscript
Henry Garrett, “Independent Set in Neutrosophic Graphs”, ResearchGate 2022 (doi:

10.13140/RG.2.2.17472.81925).
2022 0049 | (Failed)1-Zero-Forcing Number in Neutrosophic Graphs Manuscript
Henry Garrett, “(Failed)1-Zero-Forcing Number in Neutrosophic Graphs”, ResearchGate

2022 (doi: 10.13140/RG.2.2.35241.26724).
2022 0048 | Failed Zero-Forcing Number in Neutrosophic Graphs Manuscript
Henry Garrett, “Failed Zero-Forcing Number in Neutrosophic Graphs”, Preprints 2022,

2022020343 (doi: 10.20944/preprints202202.0343.v1).
2022 0048 | Failed Zero-Forcing Number in Neutrosophic Graphs Manuscript
Henry Garrett, “Failed Zero-Forcing Number in Neutrosophic Graphs”, ResearchGate 2022

(doi: 10.13140/RG.2.2.24873.47209).
2022 0047 | Zero Forcing Number in Neutrosophic Graphs Manuscript
Henry Garrett, “Zero Forcing Number in Neutrosophic Graphs”, ResearchGate 2022 (doi:
10.13140/RG.2.2.32265.93286).
2022 0046 | Quasi-Number in Neutrosophic Graphs Manuscript
Henry Garrett, “Quasi-Number in Neutrosophic Graphs”, ResearchGate 2022 (doi:

10.13140/RG.2.2.18470.60488).
9918
2022 0045 | Quasi-Degree in Neutrosophic Graphs Manuscript
Henry Garrett, “Quasi-Degree in Neutrosophic Graphs”, Preprints 2022, 2022020100 (doi:

10.20944/preprints202202.0100.v1).
2022 0045 | Quasi-Degree in Neutrosophic Graphs Manuscript
Henry Garrett, “Quasi-Degree in ResearchGate 2022 (doi: 10.13140/RG.2.2.25460.01927).

2022 0044 | Co-Neighborhood in Neutrosophic Graphs Manuscript
Henry Garrett, “Co-Neighborhood in Neutrosophic Graphs”, ResearchGate 2022 (doi:

10.13140/RG.2.2.17687.44964).
2022 0043 | Global Powerful Alliance in Strong Neutrosophic Graphs Manuscript
Henry Garrett, “Global Powerful Alliance in Strong Neutrosophic Graphs”, Preprints 2022,
2022010429 (doi: 10.20944/preprints202201.0429.v1).
2022 0043 | Global Powerful Alliance in Strong Neutrosophic Graphs Manuscript
Henry Garrett, “Global Powerful Alliance in Strong Neutrosophic Graphs”, ResearchGate

2022 (doi: 10.13140/RG.2.2.31784.24322).
2022 0042 | Global Offensive Alliance in Strong Neutrosophic Graphs Manuscript
Henry Garrett, “Global Offensive Alliance in Strong Neutrosophic Graphs”, Preprints 2022,
2022010429 (doi: 10.20944/preprints202201.0429.v1).
2022 0042 | Global Offensive Alliance in Strong Neutrosophic Graphs Manuscript
Henry Garrett, “Global Offensive Alliance in Strong Neutrosophic Graphs”, ResearchGate

2022 (doi: 10.13140/RG.2.2.26541.20961).
2022 0041 | Three Types of Neutrosophic Alliances based on Connectedness and (Strong) Edges Manuscript
Henry Garrett, “Three Types of Neutrosophic Alliances based on Connectedness and (Strong)
Edges”, Preprints 2022, 2022010239 (doi: 10.20944/preprints202201.0239.v1).
2022 0041 | Three Types of Neutrosophic Alliances based on Connectedness and (Strong) Edges Manuscript
Henry Garrett, “Three Types of Neutrosophic Alliances based on Connectedness and (Strong)
Edges”, ResearchGate 2022 (doi: 10.13140/RG.2.2.18486.83521).
2022 0040 | Three types of neutrosophic alliances based of connectedness and (strong) edges (In-Progress) Manuscript
Henry Garrett, “Three types of neutrosophic alliances based of connectedness and (strong)
edges (In-Progress)”, ResearchGate 2022 (doi: 10.13140/RG.2.2.27570.12480).
2022 0039 | Closing Numbers and Super-Closing Numbers as (Dual)Resolving and (Dual)Coloring Manuscript
Henry Garrett, “Closing Numbers and Super-Closing Numbers as (Dual)Resolving and
(Dual)Coloring alongside (Dual)Dominating in (Neutrosophic)n-SuperHyperGraph”, Preprints
2022, 2022010145 (doi: 10.20944/preprints202201.0145.v1).
9919
2022 0039 | Closing Numbers and Super-Closing Numbers as (Dual)Resolving and (Dual)Coloring Manuscript
Henry Garrett, “Closing Numbers and Super-Closing Numbers as (Dual)Resolving
and (Dual)Coloring alongside (Dual)Dominating in (Neutrosophic)n-SuperHyperGraph”,
ResearchGate 2022 (doi: 10.13140/RG.2.2.18909.54244/1).
2022 0038 | Co-degree and Degree of classes of Neutrosophic Hypergraphs Manuscript
Henry Garrett, “Co-degree and Degree of classes of Neutrosophic Hypergraphs”, Preprints

2022, 2022010027 (doi: 10.20944/preprints202201.0027.v1).
2022 0038 | Co-degree and Degree of classes of Neutrosophic Hypergraphs Manuscript
Henry Garrett, “Co-degree and Degree of classes of Neutrosophic Hypergraphs”,

2021 0037 | Dimension and Coloring alongside Domination in Neutrosophic Hypergraphs Manuscript
Henry Garrett, “Dimension and Coloring alongside Domination in Neutrosophic

Hypergraphs”, Preprints 2021, 2021120448 (doi: 10.20944/preprints202112.0448.v1).
2021 0037 | Dimension and Coloring alongside Domination in Neutrosophic Hypergraphs Manuscript
Henry Garrett, “Dimension and Coloring alongside Domination in Neutrosophic

Hypergraphs”, ResearchGate 2021 (doi: 10.13140/RG.2.2.13070.28483).
2021 0036 | Different Types of Neutrosophic Chromatic Number Manuscript
Henry Garrett, “Different Types of Neutrosophic Chromatic Number”, Preprints 2021,

2021120335 (doi: 10.20944/preprints202112.0335.v1).
2021 0036 | Different Types of Neutrosophic Chromatic Number Manuscript
Henry Garrett, “Different Types of Neutrosophic Chromatic Number”, ResearchGate 2021

(doi: 10.13140/RG.2.2.19068.46723).
2021 0035 | Neutrosophic Chromatic Number Based on Connectedness Manuscript
Henry Garrett, “Neutrosophic Chromatic Number Based on Connectedness”, Preprints 2021,

2021120226 (doi: 10.20944/preprints202112.0226.v1).
2021 0035 | Neutrosophic Chromatic Number Based on Connectedness Manuscript
Henry Garrett, “Neutrosophic Chromatic Number Based on Connectedness”, ResearchGate

2021 (doi: 10.13140/RG.2.2.18563.84001).
2021 0034 | Chromatic Number and Neutrosophic Chromatic Number Manuscript
Henry Garrett, “Chromatic Number and Neutrosophic Chromatic Number”, Preprints 2021,
2021120177 (doi: 10.20944/preprints202112.0177.v1).
2021 0034 | Chromatic Number and Neutrosophic Chromatic Number Manuscript

9920
Henry Garrett, “Chromatic Number and Neutrosophic Chromatic Number”, ResearchGate

2021 (doi: 10.13140/RG.2.2.36035.73766).
2021 0033 | Metric Dimension in fuzzy(neutrosophic) Graphs #12 Manuscript
Henry Garrett, “Metric Dimension in fuzzy(neutrosophic) Graphs #12”, ResearchGate 2021

(doi: 10.13140/RG.2.2.20690.48322).

(doi: 10.13140/RG.2.2.29308.46725).

(doi: 10.13140/RG.2.2.21614.54085).

(doi: 10.13140/RG.2.2.34040.16648).

(doi: 10.13140/RG.2.2.19464.96007).
2021 0028 | Metric Dimension in fuzzy(neutrosophic) Graphs-VII Manuscript
Henry Garrett, “Metric Dimension in fuzzy(neutrosophic) Graphs-VII”, ResearchGate 2021

(doi: 10.13140/RG.2.2.14667.72481).
2021 0028 | Metric Dimension in fuzzy(neutrosophic) Graphs-VII Manuscript
Henry Garrett, “Metric Dimension in fuzzy(neutrosophic) Graphs-VII”, Preprints 2021,

2021110142 (doi: 10.20944/preprints202111.0142.v7).
2021 0027 | Metric Dimension in fuzzy(neutrosophic) Graphs-VI Manuscript
Henry Garrett, “Metric Dimension in fuzzy(neutrosophic) Graphs-VI”, Preprints 2021,

2021110142 (doi: 10.20944/preprints202111.0142.v6).
2021 0026 | Metric Dimension in fuzzy(neutrosophic) Graphs-V Manuscript
Henry Garrett, “Metric Dimension in fuzzy(neutrosophic) Graphs-V”, Preprints 2021,

2021110142 (doi: 10.20944/preprints202111.0142.v5).
2021 0025 | Metric Dimension in fuzzy(neutrosophic) Graphs-IV Manuscript
Henry Garrett, “Metric Dimension in fuzzy(neutrosophic) Graphs-IV”, Preprints 2021,

2021110142 (doi: 10.20944/preprints202111.0142.v4).
9921
2021 0024 | Metric Dimension in fuzzy(neutrosophic) Graphs-III Manuscript
Henry Garrett, “Metric Dimension in fuzzy(neutrosophic) Graphs-III”, Preprints 2021,

2021110142 (doi: 10.20944/preprints202111.0142.v3).
2021 0023 | Metric Dimension in fuzzy(neutrosophic) Graphs-II Manuscript
Henry Garrett, “Metric Dimension in fuzzy(neutrosophic) Graphs-II”, Preprints 2021,

2021110142 (doi: 10.20944/preprints202111.0142.v2).
2021 0022 | Metric Dimension in Fuzzy Graphs and Neutrosophic Graphs Manuscript
Henry Garrett, “Metric Dimension in Fuzzy Graphs and Neutrosophic Graphs”, Preprints
2021, 2021110142 (doi: 10.20944/preprints202111.0142.v1)
2021 0021 | Valued Number And Set Manuscript
Henry Garrett, “Valued Number And Set”, Preprints 2021, 2021080229 (doi:
10.20944/preprints202108.0229.v1).
2021 0020 | Notion of Valued Set Manuscript
Henry Garrett, “Notion of Valued Set”, Preprints 2021, 2021070410 (doi:

10.20944/preprints202107.0410.v1).
2021 0019 | Set And Its Operations Manuscript
Henry Garrett, “Set And Its Operations”, Preprints 2021, 2021060508 (doi:
10.20944/preprints202106.0508.v1).
2021 0018 | Metric Dimensions Of Graphs Manuscript
Henry Garrett, “Metric Dimensions Of Graphs”, Preprints 2021, 2021060392 (doi:

10.20944/preprints202106.0392.v1).
2021 0017 | New Graph Of Graph Manuscript
Henry Garrett, “New Graph Of Graph”, Preprints 2021, 2021060323 (doi:

10.20944/preprints202106.0323.v1).
2021 0016 | Numbers Based On Edges Manuscript
Henry Garrett, “Numbers Based On Edges”, Preprints 2021, 2021060315 (doi:

10.20944/preprints202106.0315.v1).
2021 0015 | Locating And Location Number Manuscript
Henry Garrett, “Locating And Location Number”, Preprints 2021, 2021060206 (doi:
10.20944/preprints202106.0206.v1).
2021 0014 | Big Sets Of Vertices Manuscript
Henry Garrett, “Big Sets Of Vertices”, Preprints 2021, 2021060189 (doi:

10.20944/preprints202106.0189.v1).
9922
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).
9923
Publications: Books
2023 165 | Eulerian-Cycle-Cut In SuperHyperGraphs Amazon
[ADDRESSED CITATION]
[HG165b] Henry Garrett, “Eulerian-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023
(doi: 10.5281/zenodo.7854561).
@googlebooks:https://books.google.com/books/about?id=sC 6EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=sC 6EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/07/22/Eulerian-Cycle-Cut-In-
SuperHyperGraphs/
@academia:https://www.academia.edu/100571830
@facebook : https://www.facebook.com/permalink.php?story_fbid
=pfbid029xYJouTtSjWQw4FwaCDMEgcSWh5WvnP3pfyiTkDS8TJpbDKKJTKHe5UiXRYUwxLGl&
id=100090667441909
PAGE @facebook : https://www.facebook.com/permalink.php?story_fbid=
pfbid0AN8aQ92UF62oKMQkXbjNk9uUGJbUPPr7KPeLbZno7NVb2dY37Bw6Js6VzuN7hd7Tl&
id=105165509175944
=pfbid02ac6oipwkoUNSh3BUPVYX8v1wVSpimkuBWfuRNobWzvrjRBa6Sf8z8Zj4SgwKVdxxl&
id=100090667441909
PAGE @facebook : https://www.facebook.com/permalink.php?story_fbid
=pfbid0TRuHKgYpDZa6x1fvUsnNM9d5G7geLfniMbQswpM9dw4cmDrSq3zTzwhz1grRGT3vl&
id=105165509175944
=pfbid02kYx18Z6SHgkwgrCMbBtWPFNWknwshRtbuVfEMaqmwjuZEDZvuScszfEW9VREQtGAl&
id=100090667441909
pfbid02jxz6Wm1dQeQSGQX3PqTyzUveZnDf74FpYLsQETAj9gtFRPQrtaoickwAHhnGW31Jl&
id=105165509175944
(Paperback): https://www.amazon.com/dp/B0C2SFNF5P
(Hardcover): https://www.amazon.com/dp/B0C2SD1ZP2
(Kindle Edition): https://www.amazon.com/dp/B0C38ZRRWP
ISBN
(Paperback): 9798392185535
(Hardcover): 9798392185559
(Kindle Edition): CC BY-NC-ND 4.0
Other Publishers: @googlebooks @GooglePlay @AmazonKindle
Available at @WordPress @ResearchGate @Scribd @academia @ZENODO_ORG @Twitter
@facebook @LinkedIn @Amazon @googlebooks @GooglePlay @AmazonKindle
2023 164 | Eulerian-Type-Path-Neighbor In SuperHyperGraphs Amazon

9924
[HG164b] Henry Garrett, “Eulerian-Type-Path-Neighbor In SuperHyperGraphs”. Dr. Henry
Garrett, 2023 (doi: 10.5281/zenodo.7851893).
@googlebooks:https://books.google.com/books/about?id=2si6EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=2si6EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/07/22/Eulerian-Type-Path-
Neighbor-In-SuperHyperGraphs/
=pfbid02oLuaPsj7DumHemiCyN4UGShNF55NsrLLxLb2CV71eswsmV2um5oNW4AMi3Hp5oWkl&
id=100090667441909
pfbid037CDfPAcaAZWwCgPXVzurLEJxrucoLB9i9x97TxuivuA2DVYbtuDxXAjZNhWFwsfal&
id=105165509175944
=pfbid02ac6oipwkoUNSh3BUPVYX8v1wVSpimkuBWfuRNobWzvrjRBa6Sf8z8Zj4SgwKVdxxl&
id=100090667441909
=pfbid0tW9HKAxeYoodoqdAY9H5HzvVJxxcd1rRij2BYBnSHcHMKiKMP8GaPjrkyF9AkZdTl&
id=105165509175944
=pfbid0Jx27AsDtqjGy5jJikBH7hLctakc6zhinzY2Ski83ugJjkdW66yLkaDe4aavuVWEfl&
id=100090667441909
pfbid0KnWV8rKq32uxKTyfLLvox9KyTKqLEnG2a6CAdNvy2RSohvwsWhcs8NnSBVevJwoFl&
id=105165509175944
(Paperback): https://www.amazon.com/dp/B0C2S47JSK
(Hardcover): https://www.amazon.com/dp/B0C2S6B4LC
(Kindle Edition): https://www.amazon.com/dp/B0C37PMVMG
ISBN
(Paperback): 9798392080557
(Hardcover): 9798392080595
2023 163 | Eulerian-Type-Path-Decomposition In SuperHyperGraphs Amazon

9925
[HG163b] Henry Garrett, “Eulerian-Type-Path-Decomposition In SuperHyperGraphs”. Dr.
Henry Garrett, 2023 (doi: 10.5281/zenodo.7848019).
@googlebooks:https://books.google.com/books/about?id=Wo-6EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=Wo-6EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/07/22/Eulerian-Type-Path-
Decomposition-In-SuperHyperGraphs/
=pfbid02dfEom5qzwQVmyHqwDg6ZFaSwZjcyDUUhP8HKi5ndxdZC3V57drPnL2aAR6s5N8xil&
id=100090667441909
pfbid02Pec8K2rzwUFqwXJs7QQKqVAXFdH1bsAWiKEaHY98jvroHYaTdk4kFtzhH7jzTJnTl&
id=105165509175944
=pfbid0hWnwqAgpjzRf4VjxGw1XMLYKfvrcrti7gou2BDYbMLLdrEBNVQdD3cNKduYxheBil&
id=100090667441909
=pfbid02AWRqicZsrFBzWJGb9PEucJHz3NTSSmQV7JmpUrBndvog8gwsPptxgAjFQzEAKmFml&
id=105165509175944
=pfbid0G3HjsGstqBG3aAWWHrkHYp1jqWLPB7VcoFvocW8tfE9uCH8mKk7szNSARKQ5SuJil&
id=100090667441909
pfbid0drhxRazVrHCzSsRowCtfUghXXqPTCtPgmu2qK2kZ4Hv26QNUcecA1FzKRpmGhyC1l&
id=105165509175944
(Paperback): https://www.amazon.com/dp/B0C2S3GFBC
(Hardcover): https://www.amazon.com/dp/B0C2RWP157
(Kindle Edition): https://www.amazon.com/dp/B0C33HB2F2
ISBN
(Paperback): 9798391955542
(Hardcover): 9798391955573
2023 162 | Eulerian-Type-Path-Cut In SuperHyperGraphs Amazon

9926
[HG162b] Henry Garrett, “Eulerian-Type-Path-Cut In SuperHyperGraphs”. Dr. Henry Garrett,
2023 (doi: 10.5281/zenodo.7835063).
@googlebooks:https://books.google.com/books/about?id=hNq5EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=hNq5EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/07/22/Eulerian-Type-Path-Cut-In-
SuperHyperGraphs/
=pfbid02QpCtXYV6EyMwdgWzZhwz7ucrMBUnrkNi8qY8GQAuAA7QVphvGRwc7VhgdmaPxXSSl&
id=100090667441909
pfbid02hWgTEoUV2V4fCjGJ9LXzz5qeMMWxrAkjCQtcYUH9eYapVsoR2LUu1E5qwa81kHZYl&
id=105165509175944
=pfbid0vyXwm6jEJHKZ4x74feiDHpNppxtF4CSK9Hv5G3gxsa3mpebkbnHmx37kfXuYjTD2l&
id=100090667441909
=pfbid02S2UberG9S2SDjRusSiyuhiN6EzxZgxoU8wBd1UXewdVhaPgFTb5ePAD3R7AiXG4l&
id=105165509175944
@LinkedIn : https://www.linkedin.com/posts/drhenrygarrett_link-isbn-activity
-7053710939254071297-e5rI?utm_source=share&utm_medium=member_desktop
=pfbid02w8pHq6yunC9qBnZhj7gyBVgDwgRZUaxMahmp7nE3cyDj9MgnP49Tm38RJYYX3wgYl&
id=100090667441909
pfbid02pJegzpHXtB51DZtURQKHmGoC2UN6kLGF2wtd3GmePX2bx3oetLvRwd34DXZbpFAl&
id=105165509175944
@LinkedIn : https://www.linkedin.com/posts/drhenrygarrett_hg162b-henry-garrett
-eulerian-type-path-cut-activity-7053711526511136768-dJZu?
utm_source=share
utm_medium=member_desktop
(Paperback): https://www.amazon.com/dp/B0C2PV14BR
(Hardcover): https://www.amazon.com/dp/B0C1J3B8ZL
(Kindle Edition): https://www.amazon.com/dp/B0C1J3HQ3X
ISBN
(Paperback): 9798391601487
(Hardcover): 9798391601456
2023 161 | Eulerian-Path-Neighbor In SuperHyperGraphs Amazon

9927
[HG161b] Henry Garrett, “Eulerian-Path-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett,
2023 (doi: 10.5281/zenodo.7826705).
@googlebooks:https://books.google.com/books/about?id=7165EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=7165EAAAQBAJ
@ResearchGate: https://www.researchgate.net/publication/7165EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Eulerian-Path-Neighbor-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0C1JGPMNW
(Hardcover): https://www.amazon.com/dp/B0C1JK3LLJ
(Kindle Edition): https://www.amazon.com/dp/B0C2FRDG48
ISBN
(Paperback): 9798391250159
(Hardcover): 9798391250234
2023 160 | Eulerian-Path-Decomposition In SuperHyperGraphs Amazon
[HG160b] Henry Garrett, “Eulerian-Path-Decomposition In SuperHyperGraphs”. Dr. Henry
@googlebooks:https://books.google.com/books/about?id=v624EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=v624EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Eulerian-Path-
(Paperback): https://www.amazon.com/dp/B0C1J2GSGV
(Hardcover): https://www.amazon.com/dp/B0C1J3J883
(Kindle Edition): https://www.amazon.com/dp/B0C285TBWX
ISBN
(Paperback): 9798391056140
(Hardcover): 9798391056164
2023 159 | Eulerian-Path-Cut In SuperHyperGraphs Amazon

9928
[HG159b] Henry Garrett, “Eulerian-Path-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023
(doi: 10.5281/zenodo.7812750).
@googlebooks:https://books.google.com/books/about?id=kju4EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=kju4EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Eulerian-Path-Cut-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0C1J1MWPX
(Hardcover): https://www.amazon.com/dp/B0C1J3D9N8
(Kindle Edition): https://www.amazon.com/dp/B0C24LRF5P
ISBN
(Paperback): 9798390777978
(Hardcover): 9798390778005
2023 158 | Hamiltonian-Type-Cycle-Neighbor In SuperHyperGraphs Amazon
[HG158b] Henry Garrett, “Hamiltonian-Type-Cycle-Neighbor In SuperHyperGraphs”. Dr.
@googlebooks:https://books.google.com/books/about?id=CDW4EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=CDW4EAAAQBAJ
@WordPress:https://drhenrygarrett.wordpress.com/2023/04/22/Hamiltonian-Type-Cycle-
(Paperback): https://www.amazon.com/dp/B0C1J1XL69
(Hardcover): https://www.amazon.com/dp/B0C1JCTBCM
(Kindle Edition): https://www.amazon.com/dp/B0C1XWFPFS
ISBN
(Paperback): 9798390730676
(Hardcover): 9798390730690
2023 157 | Hamiltonian-Type-Cycle-Decomposition In SuperHyperGraphs Amazon

9929
[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

9930
[HG155b] Henry Garrett, “Hamiltonian-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry
@googlebooks:https://books.google.com/books/about?id=u7u3EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=u7u3EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Hamiltonian-Cycle-
(Paperback): https://www.amazon.com/dp/B0C1JGKRC1
(Hardcover): https://www.amazon.com/dp/B0C1JK3J6K
(Kindle Edition): https://www.amazon.com/dp/B0C1SNGH8L
ISBN
(Paperback): 9798390457139
(Hardcover): 9798390460924
2023 154 | Hamiltonian-Cycle-Decomposition In SuperHyperGraphs Amazon
[HG154b] Henry Garrett, “Hamiltonian-Cycle-Decomposition In SuperHyperGraphs”. Dr.
@googlebooks:https://books.google.com/books/about?id=Xy23EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=Xy23EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Hamiltonian-Cycle-
(Paperback): https://www.amazon.com/dp/B0C123F3F3
(Hardcover): https://www.amazon.com/dp/B0C12773L1
(Kindle Edition): https://www.amazon.com/dp/B0C1BZYCGW
ISBN
(Paperback): 9798389932234
(Hardcover): 9798389932319

9931
[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

9932
[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

9933
[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

9934
[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

9935
[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

9936
[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

9937
[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

9938
[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

9939
[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

9940
[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

9941
[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

9942
[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

9943
[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

9944
[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

9945
[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

9946
[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

9947
[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

9948
[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

9949
[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

9950
[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

9951
[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

9952
[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

9953
[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
9954
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

9955
[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

9956
[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

9957
[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

9958
[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

9959
[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
9960
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

9961
“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

9962
[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
9963
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

9964
[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

9965
[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

9966
[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

9967
[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

9968
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

9969
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
9970
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
9971
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

9972
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

9973
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
-
9974
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

9975
Анализ моделей и руководство за пределами Подход и проблемы в двух моде-

лях 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

9976
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
9977
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
9978
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

9979
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
9980
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
...
9981
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/
9982
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
9983
9984
9985
Henry Garrett
01/23/2022
9986
9987
9988
9989
9990
9991
9992
9993
9994
9995
9996
9997
9998
9999
10000
10001
10002
10003
10004
10005
10006
10007
10008
10009
10010
10011
10012
10013
10014
10015
10016
10017
10018
10019
10020
10021
10022
10023
10024
10025
10026
10027
10028
10029
10030
10031
10032
10033
10034
10035
10036
10037
10038
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
10039

Strict Dimension Dominating in SuperHyperGraphs

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Strict Dimension Dominating in SuperHyperGraphs

Uploaded by

Copyright:

Available Formats

Strict Dimension

Dr. Henry Garrett

4 Cancer In Extreme SuperHyperGraph 47

5 Extreme Strict Dimension Dominating 51

6 New Ideas On Super Dimity By Hyper Dimple Of Strict Dimension Dom-

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

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 [HG186b] Henry Garrett, “Strict Dimension Dominating In SuperHyperGraphs”.

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

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

14.1 The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges

15.1 The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges

17.1 An Overlook On This Research And Beyond . . . . . . . . . . . . . . . . . . . . . 150