Unequal Connective Dominating in SuperHyperGraphs

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

DOI: 10.5281/zenodo.8078574
CITATIONS
1 author:
Henry Garrett
510 PUBLICATIONS 22,802 CITATIONS
SEE PROFILE
Some of the authors of this publication are also working on these related projects:
Neutrosophic Graphs View project
Number Graphs And Numbers View project
All content following this page was uploaded by Henry Garrett on 25 June 2023.
The user has requested enhancement of the downloaded file.

Unequal Connective
Dominating In
SuperHyperGraphs
Ideas | Approaches | Accessibility | Availability
Dr. Henry Garrett

Report | Exposition | References | Research #22 2023
Contents
Contents iii
List of Figures iv
List of Tables v
1 ABSTRACT 1
2 Background 13
Bibliography 19
3 Acknowledgements 45
4 Cancer In Extreme SuperHyperGraph 47
5 Extreme Unequal Connective Dominating 51
6 New Ideas On Super Con By Hyper Conceit Of Unequal Connective

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

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

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

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

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

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

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

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

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

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

21 Extreme SuperHyperTotal But As The Extensions Excerpt From Dense

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

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

Graph By Unequal Connective Dominating As Hyper Conceit On Super
Con 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 SuperHyperUnequal Connective Dominating But As The Exten-

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

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

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

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

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

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

39 Neutrosophic SuperHyperJoin But As The Extensions Excerpt From

40 Neutrosophic SuperHyperPerfect But As The Extensions Excerpt From

41 Neutrosophic SuperHyperTotal But As The Extensions Excerpt From

42 Neutrosophic SuperHyperConnected But As The Extensions Excerpt

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

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

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

11.1 an Extreme SuperHyperPath Associated to the Notions of Extreme SuperHy-

perUnequal Connective Dominating in the Example (42.0.5) . . . . . . . . . . . . . . . . . 120
11.2 an Extreme SuperHyperCycle Associated to the Extreme Notions of Extreme
11.3 an Extreme SuperHyperStar Associated to the Extreme Notions of Extreme
11.4 Extreme SuperHyperBipartite Extreme Associated to the Extreme Notions of
Extreme SuperHyperUnequal Connective Dominating in the Example (42.0.11) . . . . . . . 125
11.5 an Extreme SuperHyperMultipartite Associated to the Notions of Extreme
SuperHyperUnequal Connective Dominating in the Example (42.0.13) . . . . . . . . . . . . 127
11.6 an Extreme SuperHyperWheel Extreme Associated to the Extreme Notions of
Extreme SuperHyperUnequal Connective Dominating in the Extreme Example (42.0.15) . . 128
14.1 an Extreme SuperHyperBipartite Associated to the Notions of Extreme SuperHy-

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

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

Neutrosophic SuperHyperUnequal Connective 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 of
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 297
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 297
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 298
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 299
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 300
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 301
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 302
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 303
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 303
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 304
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 305


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

SuperHyperUnequal Connective Dominating in the Example (42.0.5) . . . . . . . . . . . . . 328
31.2 a Neutrosophic SuperHyperCycle Associated to the Neutrosophic Notions of
(42.0.7) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 330
31.3 a Neutrosophic SuperHyperStar Associated to the Neutrosophic Notions of
(42.0.9) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 331
31.4 Neutrosophic SuperHyperBipartite Neutrosophic Associated to the Neutrosophic
Notions of Neutrosophic SuperHyperUnequal Connective Dominating in the Example (42.0.11) 333
31.5 a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic
SuperHyperUnequal Connective Dominating in the Example (42.0.13) . . . . . . . . . . . . 335
31.6 a Neutrosophic SuperHyperWheel Neutrosophic Associated to the Neutrosophic
Notions of Neutrosophic SuperHyperUnequal Connective 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 [HG288] Henry Garrett, “New Ideas On Super Con By Hyper Conceit Of
Unequal Connective Dominating In Recognition of Cancer With (Neutrosophic)
SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zenodo.8078543). . . . . . . . . . 464
44.4 [HG289] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic
SuperHyperGraph By Unequal Connective Dominating As Hyper Conceit On Super
Con”, Zenodo 2023, (doi: 10.5281/zenodo.8078445). . . . . . . . . . . . . . . . . . 466

44.7 [HG184b] Henry Garrett, “Unequal Connective Dominating In SuperHyperGraphs”.

Dr. Henry Garrett, 2023 (doi: 10.5281/zenodo.8078574). . . . . . . . . . . . . . . . 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 Un- 1
equal Connective Dominating In SuperHyperGraphs” and “Neutrosophic Unequal Connective 2
Dominating In SuperHyperGraphs” about some scientific research on Unequal Connective 3

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

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

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

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

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

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

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

SuperHyperGraphs, SuperHyperStar, SuperHyperBipartite, SuperHyperMultiPartite, and 80

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

those Neutrosophic SuperHyperModels. For the longest Unequal Connective Dominating In 122
SuperHyperGraphs, called Unequal Connective Dominating In SuperHyperGraphs, and the 123
strongest Unequal Connective Dominating In SuperHyperGraphs, called Neutrosophic Unequal 124
Connective Dominating In SuperHyperGraphs, some general results are introduced. Beyond 125

that in SuperHyperStar, all possible SuperHyperPaths have only two SuperHyperEdges but 126
it’s not enough since it’s essential to have at least three SuperHyperEdges to form any style of 127
a Unequal Connective Dominating In SuperHyperGraphs. There isn’t any formation of any 128
Unequal Connective Dominating In SuperHyperGraphs but literarily, it’s the deformation of any 129
Unequal Connective Dominating In SuperHyperGraphs. It, literarily, deforms and it doesn’t 130
form. A basic familiarity with SuperHyperGraph theory and Neutrosophic SuperHyperGraph 131
theory are proposed. 132

Keywords: SuperHyperGraph, (Neutrosophic) Unequal Connective Dominating In SuperHy- 133
perGraphs, Cancer’s Recognition 134

AMS Subject Classification: 05C17, 05C22, 05E45 135
136
In the some chapters, in some researches, new setting is introduced for new SuperHyper- 137
Notion, namely, Neutrosophic Unequal Connective Dominating In SuperHyperGraphs . Two 138
different types of SuperHyperDefinitions are debut for them but the scientific research goes 139
further and the SuperHyperNotion, SuperHyperUniform, and SuperHyperClass based on that 140
are well-defined and well-reviewed. The literature review is implemented in the whole of this 141
research. For shining the elegancy and the significancy of this research, the comparison between 142
this SuperHyperNotion with other SuperHyperNotions and fundamental SuperHyperNum- 143
bers are featured. The definitions are followed by the examples and the instances thus the 144
clarifications are driven with different tools. The applications are figured out to make sense 145
about the theoretical aspect of this ongoing research. The “Cancer’s Neutrosophic Recognition” 146
are the under scientific research to figure out the challenges make sense about ongoing and 147
upcoming research. The special case is up. The cells are viewed in the deemed ways. There are 148
different types of them. Some of them are individuals and some of them are well-modeled by 149
the group of cells. These types are all officially called “SuperHyperVertex” but the relations 150
amid them all officially called “SuperHyperEdge”. The frameworks “SuperHyperGraph” and 151
“Neutrosophic SuperHyperGraph” are chosen and elected to scientific research about “Cancer’s 152
Neutrosophic Recognition”. Thus these complex and dense SuperHyperModels open up some 153
avenues to scientific research on theoretical segments and “Cancer’s Neutrosophic Recognition”. 154
Some avenues are posed to pursue this research. It’s also officially collected in the form of 155
some questions and some problems. Assume a SuperHyperGraph. Then an “δ−Unequal 156
Connective Dominating In SuperHyperGraphs” is a maximal Unequal Connective Dominating 157
In SuperHyperGraphs of SuperHyperVertices with maximum cardinality such that either of 158

the following expressions hold for the (Neutrosophic) cardinalities of SuperHyperNeighbors 159
of s ∈ S : |S ∩ N (s)| > |S ∩ (V \ N (s))| + δ, |S ∩ N (s)| < |S ∩ (V \ N (s))| + δ. The first 160
Expression, holds if S is an “δ−SuperHyperOffensive”. And the second Expression, holds if 161
S is an “δ−SuperHyperDefensive”; a“Neutrosophic δ−Unequal Connective Dominating In 162
SuperHyperGraphs” is a maximal Neutrosophic Unequal Connective Dominating In SuperHy- 163
perGraphs of SuperHyperVertices with maximum Neutrosophic cardinality such that either 164
of the following expressions hold for the Neutrosophic cardinalities of SuperHyperNeighbors 165
of s ∈ S : |S ∩ N (s)|N eutrosophic > |S ∩ (V \ N (s))|N eutrosophic + δ, |S ∩ N (s)|N eutrosophic < 166
|S ∩ (V \ N (s))|N eutrosophic + δ. The first Expression, holds if S is a “Neutrosophic 167
δ−SuperHyperOffensive”. And the second Expression, holds if S is a “Neutrosophic 168
δ−SuperHyperDefensive”. It’s useful to define “Neutrosophic” version of Unequal Con- 169
nective Dominating In SuperHyperGraphs . Since there’s more ways to get type-results to 170

make Unequal Connective Dominating In SuperHyperGraphs more understandable. For the 171
sake of having Neutrosophic Unequal Connective Dominating In SuperHyperGraphs, there’s a 172
need to “redefine” the notion of “Unequal Connective Dominating In SuperHyperGraphs ”. The 173
Assume a Unequal Connective Dominating In SuperHyperGraphs . It’s redefined Neutrosophic 176
Unequal Connective Dominating In SuperHyperGraphs if the mentioned Table holds, concerning, 177
“The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges Belong 178
to The Neutrosophic SuperHyperGraph” with the key points, “The Values of The Vertices 179
& The Number of Position in Alphabet”, “The Values of The SuperVertices&The maximum 180
Values of Its Vertices”, “The Values of The Edges&The maximum Values of Its Vertices”, 181
“The Values of The HyperEdges&The maximum Values of Its Vertices”, “The Values of The 182
SuperHyperEdges&The maximum Values of Its Endpoints”. To get structural examples and 183
instances, I’m going to introduce the next SuperHyperClass of SuperHyperGraph based on 184
Unequal Connective Dominating In SuperHyperGraphs . It’s the main. It’ll be disciplinary 185
to have the foundation of previous definition in the kind of SuperHyperClass. If there’s a 186
need to have all Unequal Connective Dominating In SuperHyperGraphs until the Unequal 187
Connective Dominating In SuperHyperGraphs, then it’s officially called “Unequal Connective 188
Dominating In SuperHyperGraphs” but otherwise, it isn’t Unequal Connective Dominating In 189

SuperHyperGraphs . There are some instances about the clarifications for the main definition 190
titled “Unequal Connective Dominating In SuperHyperGraphs ”. These two examples get 191
more scrutiny and discernment since there are characterized in the disciplinary ways of the 192
SuperHyperClass based on Unequal Connective Dominating In SuperHyperGraphs . For the 193
sake of having Neutrosophic Unequal Connective Dominating In SuperHyperGraphs, there’s a 194
need to “redefine” the notion of “Neutrosophic Unequal Connective Dominating In SuperHy- 195
perGraphs” and “Neutrosophic Unequal Connective Dominating In SuperHyperGraphs ”. The 196
Assume a Neutrosophic SuperHyperGraph. It’s redefined “Neutrosophic SuperHyperGraph” 199
if the intended Table holds. And Unequal Connective Dominating In SuperHyperGraphs 200
are redefined “Neutrosophic Unequal Connective Dominating In SuperHyperGraphs” if the 201

intended Table holds. It’s useful to define “Neutrosophic” version of SuperHyperClasses. Since 202
there’s more ways to get Neutrosophic type-results to make Neutrosophic Unequal Connective 203
Dominating In SuperHyperGraphs more understandable. Assume a Neutrosophic SuperHyper- 204
Graph. There are some Neutrosophic SuperHyperClasses if the intended Table holds. Thus 205
SuperHyperPath, Unequal Connective Dominating In SuperHyperGraphs, SuperHyperStar, 206

SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, are “Neutrosophic 207
SuperHyperPath”, “Neutrosophic Unequal Connective Dominating In SuperHyperGraphs”, 208
“Neutrosophic SuperHyperStar”, “Neutrosophic SuperHyperBipartite”, “Neutrosophic Supe- 209
rHyperMultiPartite”, and “Neutrosophic SuperHyperWheel” if the intended Table holds. A 210
SuperHyperGraph has “Neutrosophic Unequal Connective Dominating In SuperHyperGraphs” 211
where it’s the strongest [the maximum Neutrosophic value from all Unequal Connective 212
Dominating In SuperHyperGraphs amid the maximum value amid all SuperHyperVertices from 213
a Unequal Connective Dominating In SuperHyperGraphs .] Unequal Connective Dominating In 214
SuperHyperGraphs . A graph is SuperHyperUniform if it’s SuperHyperGraph and the number 215
of elements of SuperHyperEdges are the same. Assume a Neutrosophic SuperHyperGraph. 216

There are some SuperHyperClasses as follows. It’s SuperHyperPath if it’s only one Super- 217
Vertex as intersection amid two given SuperHyperEdges with two exceptions; it’s Unequal 218
Connective Dominating In SuperHyperGraphs if it’s only one SuperVertex as intersection amid 219
two given SuperHyperEdges; it’s SuperHyperStar it’s only one SuperVertex as intersection 220
amid all SuperHyperEdges; it’s SuperHyperBipartite it’s only one SuperVertex as intersection 221
amid two given SuperHyperEdges and these SuperVertices, forming two separate sets, has 222
no SuperHyperEdge in common; it’s SuperHyperMultiPartite it’s only one SuperVertex as 223

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


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

scrutiny on the complement of the intended set and the intended set, simultaneously. It’s smart 286
to consider a set but acting on its complement that what’s done in this research book which is 287
popular in the terms of high readers in Scribd. 288
[Ref] Henry Garrett, (2022). “Neutrosophic Duality”, Florida: GLOBAL KNOWLEDGE 289
- Publishing House 848 Brickell Ave Ste 950 Miami, Florida 33131 United States. ISBN: 290
978-1-59973-743-0 (http://fs.unm.edu/NeutrosophicDuality.pdf). 291
[Ref] Henry Garrett, (2022). “Neutrosophic Duality”, Florida: GLOBAL KNOWLEDGE 292
- Publishing House 848 Brickell Ave Ste 950 Miami, Florida 33131 United States. ISBN: 293
978-1-59973-743-0 (http://fs.unm.edu/NeutrosophicDuality.pdf). 294




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

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

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

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

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

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

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

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

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

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

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

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


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

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



HG177b; HG178b; HG179b; HG180b; HG181b; HG182b; HG183b; HG184b]. Two 518
popular scientific research books in Scribd in the terms of high readers, 4728 and 5721 respect- 519
ively, on neutrosophic science is on [HG32b; HG44b]. 520

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

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

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

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

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

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

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

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

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

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

2023, (doi: 10.5281/zenodo.8078543). 618
By Strict Connective Dominating As Hyper Conceit On Super Con”, Zenodo 2023, (doi: 620
10.5281/zenodo.8076416). 621
HG286 [29] Henry Garrett, “New Ideas On Super Con By Hyper Conceit Of Strict Connective 622
2023, (doi: 10.5281/zenodo.8076399). 624
By Reverse Dimension Dominating As Hyper Dimple On Super Dimity”, Zenodo 2023, 626
(doi: 10.5281/zenodo.8072171). 627

HG284 [31] Henry Garrett, “New Ideas On Super Dimity By Hyper Dimple Of Reverse Dimension 628
2023, (doi: 10.5281/zenodo.8072267). 630
By Equal Dimension Dominating As Hyper Dimple On Super Dimity”, Zenodo 2023, (doi: 632
10.5281/zenodo.8067384). 633
HG282 [33] Henry Garrett, “New Ideas On Super Dimity By Hyper Dimple Of Equal Dimension 634
2023, (doi: 10.5281/zenodo.8067409). 636
By Dimension Dominating As Hyper Dimple On Super Dimity”, Zenodo 2023, (doi: 638
10.5281/zenodo.8061927). 639
HG280 [35] Henry Garrett, “New Ideas On Super Dimity By Hyper Dimple Of Dimension Dominating 640
In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 641
10.5281/zenodo.8062016). 642
By Reverse Connective Dominating As Hyper Conceit On Super Con”, Zenodo 2023, (doi: 644
10.5281/zenodo.8057696). 645
HG278 [37] Henry Garrett, “New Ideas On Super Con By Hyper Conceit Of Reverse Connective 646
2023, (doi: 10.5281/zenodo.8057753). 648
By Equal Connective Dominating As Hyper Conceit On Super Con”, Zenodo 2023, (doi: 650
10.5281/zenodo.8052893). 651
HG276 [39] Henry Garrett, “New Ideas On Super Con By Hyper Conceit Of Equal Connective 652
2023, (doi: 10.5281/zenodo.8052925). 654
By Connective Dominating As Hyper Conceit On Super Con”, Zenodo 2023, (doi: 656
10.5281/zenodo.8051346). 657
HG274 [41] Henry Garrett, “New Ideas On Super Con By Hyper Conceit Of Connective Dominating 658
10.5281/zenodo.8051360). 660
HG273 [42] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyper- 661
Graph By United Dominating As Hyper Ultra On Super Units”, Zenodo 2023, (doi: 662
10.5281/zenodo.8025707). 663
HG272 [43] Henry Garrett, “New Ideas On Super Units By Hyper Ultra Of United Dominating 664
10.5281/zenodo.8027275). 666

By Zero Forcing As Hyper ford On Super forceps”, Zenodo 2023, (doi: 10.5281/zen- 668
odo.8017246). 669
HG270 [45] Henry Garrett, “New Ideas On Super forceps By Hyper ford Of Zero Forcing In 670
Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 671
10.5281/zenodo.8020128). 672
By Matrix-Based As Hyper mat On Super matte”, Zenodo 2023, (doi: 10.5281/zen- 674
odo.7978571). 675
HG268 [47] Henry Garrett, “New Ideas On Super mat By Hyper matte Of Matrix-Based In 676
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 677
10.5281/zenodo.7978857). 678
Graph By Dominating-Edges As Hyper Dome On Super Eddy”, Zenodo 2023, (doi: 680
10.5281/zenodo.7940830). 681
HG266 [49] Henry Garrett, “New Ideas On Super Eddy By Hyper Dome Of Dominating-Edges 682
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 683
10.5281/zenodo.7943578). 684
Graph By Edge-Gap As Hyper Gape On Super Gab”, Zenodo 2023, (doi: 10.5281/zen- 686
odo.7916595). 687
HG264 [51] Henry Garrett, “New Ideas On Super Gab By Hyper Gape Of Edge-Gap In Cancer’s 688
Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zen- 689
odo.7923632). 690
By Eulerian-Type-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, 692
(doi: 10.5281/zenodo.7904698). 693
HG262 [53] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Type- 694
Cycle-Neighbor In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 695
2023, (doi: 10.5281/zenodo.7904671). 696
By Eulerian-Type-Cycle-Decomposition As Hyper Decompress On Super Decompensation”, 698
Zenodo 2023, (doi: 10.5281/zenodo.7904529). 699
HG260 [55] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of Eulerian- 700
Type-Cycle-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyper- 701
Graph”, Zenodo 2023, (doi: 10.5281/zenodo.7904401). 702
By Eulerian-Type-Cycle-Cut As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 704
10.5281/zenodo.7871026). 705

Cycle-Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 707
2023, (doi: 10.5281/zenodo.7874647). 708
By Eulerian-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 710
10.5281/zenodo.7857856). 711
HG256 [59] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Cycle- 712
Neighbor In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 713
2023, (doi: 10.5281/zenodo.7857841). 714
By Eulerian-Cycle-Decomposition As Hyper Decompress On Super Decompensation”, 716
Cycle-Decomposition In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, 719
Graph By Eulerian-Cycle-Cut As Hyper Eulogy On Super EULA”, Zenodo 2023, (doi: 722
10.5281/zenodo.7853867). 723
HG252 [63] Henry Garrett, “New Ideas On Super EULA By Hyper Eulogy Of Eulerian-Cycle-Cut 724
10.5281/zenodo.7853922). 726
By Eulerian-Type-Path-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, 728
(doi: 10.5281/zenodo.7851519). 729
HG250 [65] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Type-Path- 730
Neighbor In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, 731
(doi: 10.5281/zenodo.7851550). 732
By Eulerian-Type-Path-Decomposition As Hyper Decompress On Super Decompensation”, 734
Type-Path-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 737
By Eulerian-Type-Path-Cut As Hyper Eulogy On Super EULA”, Zenodo 2023, (doi: 740
10.5281/zenodo.7834229). 741
HG246 [69] Henry Garrett, “New Ideas On Super EULA By Hyper Eulogy Of Eulerian-Type-Path-Cut 742
10.5281/zenodo.7834261). 744

By Eulerian-Path-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 746
10.5281/zenodo.7824560). 747
HG244 [71] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Path- 748
(doi: 10.5281/zenodo.7824623). 750
By Eulerian-Path-Decomposition As Hyper Decompress On Super Decompensation”, 752
Path-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 755
As Hyper Tool On Super Toot”, Zenodo 2023, (doi: 10.5281/zenodo.7812236). 758
By initial Eulerian-Path-Cut As Hyper initial Eulogy On Super initial EULA”, Zenodo 760
2023, (doi: 10.5281/zenodo.7809365). 761
By Eulerian-Path-Cut As Hyper Eulogy-Path-Cut On Super EULA-Path-Cut”, Zenodo 763

2023, (doi: 10.5281/zenodo.7809358). 764
HG238 [77] Henry Garrett, “New Ideas On Super EULA By Hyper Eulogy Of Eulerian-Path-Cut 765
10.5281/zenodo.7809219). 767
Graph By Eulerian-Path-Cut As Hyper Eulogy On Super EULA”, Zenodo 2023, (doi: 769
10.5281/zenodo.7809328). 770
By Hamiltonian-Type-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 772
2023, (doi: 10.5281/zenodo.7806767). 773
HG235 [80] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Hamiltonian-Type- 774
2023, (doi: 10.5281/zenodo.7806838). 776
By Hamiltonian-Type-Cycle-Decomposition As Hyper Decompress On Super Decompensa- 778
tion”, Zenodo 2023, (doi: 10.5281/zenodo.7804238). 779
HG233 [82] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of 780
Hamiltonian-Type-Cycle-Decomposition In Cancer’s Recognition With (Neutrosophic) 781
SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zenodo.7804228). 782

By Hamiltonian-Type-Cycle-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi: 784
10.5281/zenodo.7799902). 785
HG231 [84] Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Type- 786
Cycle-Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, 787
(doi: 10.5281/zenodo.7804218). 788
By Hamiltonian-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, 790
(doi: 10.5281/zenodo.7796334). 791
By Hamiltonian-Cycle-Decomposition As Hyper Decompress On Super Decompensation”, 793
By Hamiltonian-Cycle-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi: 796
10.5281/zenodo.7791952). 797
HG225 [88] Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Cycle- 798
Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 799
10.5281/zenodo.7791982). 800
By Hamiltonian-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 802
10.5281/zenodo.7790026). 803
HG223 [90] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Hamiltonian-Neighbor 804
10.5281/zenodo.7790052). 806
By Hamiltonian-Decomposition As Hyper Decompress On Super Decompensation”, Zenodo 808
2023, (doi: 10.5281/zenodo.7787066). 809
Hamiltonian-Decomposition In Recognition of Cancer With (Neutrosophic) SuperHy- 811
perGraph”, Zenodo 2023, (doi: 10.5281/zenodo.7787094). 812
By Hamiltonian-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi: 814
10.5281/zenodo.7781476). 815
HG219 [94] Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Cut 816
10.5281/zenodo.7783082). 818
Graph By Trace-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 820
10.5281/zenodo.7777857). 821

HG217 [96] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Trace-Neighbor 822
10.5281/zenodo.7779286). 824
HG215 [97] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 825
By Trace-Decomposition As Hyper Decompress On Super Decompensation”, Zenodo 2023, 826
(doi: 10.5281/zenodo.7771831). 827
HG214 [98] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of Trace- 828
Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 829
2023, (doi: 10.5281/zenodo.7772468). 830
By Trace-Cut As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 832
10.13140/RG.2.2.20913.25446). 833
HG212 [100] Henry Garrett, “New Ideas On Super Tract By Hyper Track Of Trace-Cut In Cancer’s 834
odo.7764916). 836
By Edge-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 838
10.13140/RG.2.2.11770.98247). 839
HG210 [102] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Edge-Neighbor In 840
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 841
10.13140/RG.2.2.12400.12808). 842
By Edge-Decomposition As Hyper Decompress On Super Decompensation”, ResearchGate 844
2023, (doi: 10.13140/RG.2.2.22545.10089). 845
Edge-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 847
ResearchGate 2023, (doi: 10.13140/RG.2.2.29544.34564). 848
HG207 [105] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyper- 849
Graph By Edge-Cut As Hyper Edify On Super Eddy”, ResearchGate 2023, (doi: 850
10.13140/RG.2.2.11377.76644). 851
HG206 [106] Henry Garrett, “New Ideas On Super Eddy By Hyper Edify Of Edge-Cut In Can- 852
cer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 853
10.13140/RG.2.2.23750.96329). 854
By Vertex-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 856
10.13140/RG.2.2.31366.24641). 857
HG204 [108] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Vertex-Neighbor In 858
10.13140/RG.2.2.34721.68960). 860

By Vertex-Decomposition As Hyper Decompress On Super Decompensation”, ResearchGate 862
2023, (doi: 10.13140/RG.2.2.30212.81289). 863
Vertex-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 865
Graph By Vertex-Cut As Hyper Vertu On Super Vertigo”, ResearchGate 2023, (doi: 868
10.13140/RG.2.2.24288.35842). 869
HG200 [112] Henry Garrett, “New Ideas On Super Vertigo By Hyper Vertu Of Vertex-Cut In 870
10.13140/RG.2.2.32467.25124). 872
By Stable-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 874
10.13140/RG.2.2.31025.45925). 875
HG198 [114] Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of Stable-Neighbor In 876
10.13140/RG.2.2.17184.25602). 878
By Stable-Decompositions As Hyper Stain On Super Stagy”, ResearchGate 2023, (doi: 880
10.13140/RG.2.2.23423.28327). 881
HG196 [116] Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Decompositions In 882
10.13140/RG.2.2.28456.44805). 884
Graph By Stable-Cut As Hyper Stain On Super Stagy”, ResearchGate 2023, (doi: 886
10.13140/RG.2.2.23525.68320). 887
HG194 [118] Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Cut In Can- 888
10.13140/RG.2.2.20170.24000). 890
By Clique-Neighbors As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 892
10.13140/RG.2.2.36475.59683). 893
HG192 [120] Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of Clique-Neighbors In 894
10.13140/RG.2.2.29764.71046). 896
By Clique-Decompositions As Hyper Decompile On Super Decommission”, ResearchGate 898
2023, (doi: 10.13140/RG.2.2.18780.87683). 899

Clique- Decompositions In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 901
Graph By Clique-Cut As Hyper Click On Super Cliche”, ResearchGate 2023, (doi: 904
10.13140/RG.2.2.26134.01603). 905
HG188 [124] Henry Garrett, “New Ideas On Super Cliff By Hyper Cling Of Clique-Cut In Can- 906
10.13140/RG.2.2.27392.30721). 908
HG187 [125] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHy- 909
perGraph By Space As Hyper Spin On Super Spacy”, ResearchGate 2023, (doi: 910
10.13140/RG.2.2.33028.40321). 911
Graph By List- Coloring As Hyper List On Super Lisle”, ResearchGate 2023, (doi: 913
10.13140/RG.2.2.21389.20966). 914
HG185 [127] Henry Garrett, “New Ideas On Super Lith By Hyper Lite Of List-Coloring In 915
10.13140/RG.2.2.16356.04489). 917
perGraph By Space As Hyper Sparse On Super Spark”, ResearchGate 2023, (doi: 919
10.13140/RG.2.2.21756.21129). 920
HG183 [129] Henry Garrett, “New Ideas On Super Solidarity By Hyper Soul Of Space In 921
Cancer’s Recognition With (Extreme) SuperHyperGraph”, ResearchGate 2023, (doi: 922
10.13140/RG.2.2.30983.68009). 923
By Edge-Connectivity As Hyper Disclosure On Super Closure”, ResearchGate 2023, (doi: 925
10.13140/RG.2.2.28552.29445). 926
HG181 [131] Henry Garrett, “New Ideas On Super Uniform By Hyper Deformation Of Edge-Connectivity 927
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, 928
(doi: 10.13140/RG.2.2.10936.21761). 929
By Vertex-Connectivity As Hyper Leak On Super Structure”, ResearchGate 2023, (doi: 931
10.13140/RG.2.2.35105.89447). 932
HG179 [133] Henry Garrett, “New Ideas On Super System By Hyper Explosions Of Vertex-Connectivity 933
(doi: 10.13140/RG.2.2.30072.72960). 935
By Tree-Decomposition As Hyper Forward On Super Returns”, ResearchGate 2023, (doi: 937
10.13140/RG.2.2.31147.52003). 938

HG177 [135] Henry Garrett, “New Ideas On Super Nodes By Hyper Moves Of Tree-Decomposition In 939
10.13140/RG.2.2.32825.24163). 941
Graph By Chord As Hyper Excellence On Super Excess”, ResearchGate 2023, (doi: 943
10.13140/RG.2.2.13059.58401). 944
HG175 [137] Henry Garrett, “New Ideas On Super Gap By Hyper Navigations Of Chord In 945
10.13140/RG.2.2.11172.14720). 947
By SuperHyper(i,j)-Domination As Hyper Controller On Super Waves”, ResearchGate 949
2023, (doi: 10.13140/RG.2.2.22011.80165). 950
HG173 [139] Henry Garrett, “New Ideas On Super Coincidence By Hyper Routes Of SuperHyper(i,j)- 951
Domination In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchG- 952
ate 2023, (doi: 10.13140/RG.2.2.30819.84003). 953
By SuperHyperEdge-Domination As Hyper Reversion On Super Indirection”, ResearchGate 955
2023, (doi: 10.13140/RG.2.2.10493.84962). 956
HG171 [141] Henry Garrett, “New Ideas On Super Obstacles By Hyper Model Of SuperHyperEdge- 957
ate 2023, (doi: 10.13140/RG.2.2.13849.29280). 959
By SuperHyperK-Domination As Hyper k-Actions On Super Patterns”, ResearchGate 961
2023, (doi: 10.13140/RG.2.2.19944.14086). 962
HG169 [143] Henry Garrett, “New Ideas On Super Harmony By Hyper k-Function Of SuperHyperK- 963
ate 2023, (doi: 10.13140/RG.2.2.23299.58404). 965
By SuperHyperK-Number As Hyper k-Partition On Super Layers”, ResearchGate 2023, 967
(doi: 10.13140/RG.2.2.33103.76968). 968
HG167 [145] Henry Garrett, “New Ideas On Super Gradient By Hyper k-Class Of SuperHyperK-Number 969
(doi: 10.13140/RG.2.2.23037.44003). 971
By SuperHyperOrder As Hyper Enumerations On Super Landmarks”, ResearchGate 2023, 973
(doi: 10.13140/RG.2.2.35646.56641). 974
HG165 [147] Henry Garrett, “New Ideas On Super Analogous By Hyper Visions Of SuperHyperOrder In 975
10.13140/RG.2.2.18030.48967). 977

By SuperHyperColoring As Hyper Categories On Super Neighbors”, ResearchGate 2023, 979
(doi: 10.13140/RG.2.2.13973.81121). 980
HG163 [149] Henry Garrett, “New Ideas On Super Relations By Hyper Identifications Of SuperHyper- 981
Coloring In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 982
2023, (doi: 10.13140/RG.2.2.34106.47047). 983
HG162 [150] Henry Garrett, “New Ideas On Super Contradiction By Hyper Detection of SuperHyper- 984
Defensive In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 985
By SuperHyperDimension As Hyper Distinguishing On Super Distances”, ResearchGate 988
2023, (doi: 10.13140/RG.2.2.31956.88961). 989
HG160 [152] Henry Garrett, “New Ideas On Super Locations By Hyper Differing Of SuperHyperDi- 990
mension In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 991
2023, (doi: 10.13140/RG.2.2.15179.67361). 992
By SuperHyperDominating As Hyper Closing On Super Messy”, ResearchGate 2023, (doi: 994
10.13140/RG.2.2.21510.45125). 995
HG158 [154] Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDom- 996
inating In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 997
2023, (doi: 10.13140/RG.2.2.13121.84321). 998
By SuperHyperConnected As Hyper Group On Super Surge”, ResearchGate 2023, (doi: 1000
10.13140/RG.2.2.11758.69441). 1001
HG156 [156] Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of SuperHyperCon- 1002
nected In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 1003
2023, (doi: 10.13140/RG.2.2.31891.35367). 1004
By SuperHyperTotal As Hyper Covering On Super Infections”, ResearchGate 2023, (doi: 1006
10.13140/RG.2.2.19360.87048). 1007
HG154 [158] Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal 1008
In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 1009
10.13140/RG.2.2.32363.21286). 1010
HG153 [159] Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect 1011
10.13140/RG.2.2.23266.81602). 1013
By SuperHyperPerfect As Hyper Idealism On Super Vacancy”, ResearchGate 2023, (doi: 1015
10.13140/RG.2.2.19911.37285). 1016

By SuperHyperJoin As Hyper Separations On Super Sorts”, ResearchGate 2023, (doi: 1018
10.13140/RG.2.2.11050.90569). 1019
HG150 [162] Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of SuperHy- 1020
perJoin In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 1021
2023, (doi: 10.13140/RG.2.2.17761.79206). 1022
HG149 [163] Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of Super- 1023
HyperDuality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 1024
HG148 [164] Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph 1026
By SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchG- 1027
ate 2023, (doi: 10.13140/RG.2.2.33275.80161). 1028
By Path SuperHyperColoring As Hyper Correction On Super Faults”, ResearchGate 2023, 1030
(doi: 10.13140/RG.2.2.30182.50241). 1031
HG146 [166] Henry Garrett, “New Ideas On Super Reflections By Hyper Rotations Of Path SuperHy- 1032
perColoring In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 1033
HG145 [167] Henry Garrett, “New Ideas As Hyper Deformations On Super Chains In Cancer’s 1035
Neutrosophic Recognition and Neutrosophic SuperHyperGraph By SuperHyperDensity”, 1036
HG144 [168] Henry Garrett, “New Ideas As Hyper Ignorance By SuperHyperDensity On Super 1038
Resistances In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 1039
ResearchGate 2023, (doi:10.13140/RG.2.2.16800.05123). 1040
HG143 [169] Henry Garrett, “New Research On Cancer’s Recognition and Neutrosophic SuperHyper- 1041
Graph By Eulerian SuperHyperCycles and Hamiltonian Sets As Hyper Covering Versus 1042
Super separations-VI ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.29913.80482). 1043
Super separations-V ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.33269.24809). 1046
Super separations-IV ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.34946.96960). 1049
HG140 [172] Henry Garrett, “A Research On Cancer’s Recognition and Neutrosophic SuperHyperGraph 1050
By Eulerian SuperHyperCycles and Hamiltonian Sets As Hyper Covering Versus Super 1051
separations-III ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.14814.31040). 1052
separations-II ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.15653.17125). 1055

separations-I ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.25719.50089). 1058
HG137 [175] Henry Garrett, “New Ideas On Super Disruptions In Cancer’s Extreme Recognition 1059
As Neutrosophic SuperHyperGraph By Hyper Plans Called SuperHyperConnectivities”, 1060

HG136 [176] Henry Garrett, “Cancer’s Neutrosophic Recognition As Neutrosophic SuperHyperGraph 1062
By SuperHyperConnectivities As Hyper Diagnosis On Super Mechanism”, ResearchGate 1063
2023, (doi: 10.13140/RG.2.2.17252.24968). 1064
HG135 [177] Henry Garrett,“Cancer’s Recognition and (Neutrosophic) SuperHyperGraph By the Criteria 1065
of Eulerian and Hamiltonian Type-Sets As Hyper Modified Cycles On Super Mess”, 1066
ResearchGate 2023,(doi: 10.13140/RG.2.2.16652.59525). 1067
HG134 [178] Henry Garrett,“Eulerian and Hamiltonian In Cancer’s Neutrosophic Recognition and 1068
Neutrosophic SuperHyperGraph On Super Interactions By Hyper Extensions of Cycles”, 1069
HG132 [179] Henry Garrett,“SuperHyperGirth Type-Results on extreme SuperHyperGirth theory and 1071
(Neutrosophic) SuperHyperGraphs Toward Cancer’s extreme Recognition”, Preprints 2023, 1072

2023010396 (doi: 10.20944/preprints202301.0396.v1). 1073
HG131 [180] Henry Garrett,“Neutrosophic SuperHyperGraphs Warns Hyper Landmark of neutrosophic 1074
SuperHyperGirth In Super Type-Versions of Cancer’s neutrosophic Recognition”, Preprints 1075
2023, 2023010395 (doi: 10.20944/preprints202301.0395.v1). 1076
HG130 [181] Henry Garrett,“The Constructions of (Neutrosophic) SuperHyperGraphs on the Cancer’s 1077
Recognition in The Confrontation With Super Attacks In Hyper Situations By Implementing 1078
(Neutrosophic) 1-Failed SuperHyperForcing in The Technical Approaches to Neutralize 1079
SuperHyperViews”, ResearchGate 2023, (doi: 10.13140/RG.2.2.26240.51204). 1080
HG129 [182] Henry Garrett,“(Neutrosophic) 1-Failed SuperHyperForcing As the Entrepreneurs on 1081

Cancer’s Recognitions To Fail Forcing Style As the Super Classes With Hyper Effects 1082
In The Background of the Framework is So-Called (Neutrosophic) SuperHyperGraphs”, 1083
HG128 [183] Henry Garrett,“Super Actions On The Types of Hyper Levels In The Sensible Neutrosophic 1085
SuperHyperGirth On Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyper- 1086
Graph”, ResearchGate 2023,(doi: 10.13140/RG.2.2.26836.88960). 1087
HG127 [184] Henry Garrett,“SuperHyperGirth Approaches on the Super Challenges on the Cancer’s 1088
Recognition In the Hyper Model of (Neutrosophic) SuperHyperGraph”, ResearchGate 1089

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

HG125 [186] Henry Garrett,“Uncertainty On The Act And Effect Of Cancer Alongside The Foggy 1094
10.20944/preprints202301.0282.v1). 1097
HG124 [187] Henry Garrett,“Neutrosophic Version Of Separates Groups Of Cells In Cancer’s 1098
10.20944/preprints202301.0267.v1).). 1100
(doi: 10.20944/preprints202301.0265.v1). 1105
HG122 [189] Henry Garrett,“Breaking the Continuity and Uniformity of Cancer In The Worst Case of 1106
prints202301.0262.v1). 1109
2023010224, (doi: 10.20944/preprints202301.0224.v1). 1115
HG24 [192] Henry Garrett,“SuperHyperMatching By (R-)Definitions And Polynomials To Monitor 1116

Cancer’s Recognition In Neutrosophic SuperHyperGraphs”, ResearchGate 2023,(doi: 1117
10.13140/RG.2.2.35061.65767). 1118
HG25 [193] Henry Garrett,“The Focus on The Partitions Obtained By Parallel Moves In The 1119
Cancer’s Extreme Recognition With Different Types of Extreme SuperHyperMatching 1120
Set and Polynomial on (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 1121
10.13140/RG.2.2.18494.15680). 1122
HG26 [194] Henry Garrett,“Extreme Failed SuperHyperClique Decides the Failures on the Can- 1123
cer’s Recognition in the Perfect Connections of Cancer’s Attacks By SuperHy- 1124
perModels Named (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 1125
10.13140/RG.2.2.32530.73922). 1126
HG27 [195] Henry Garrett,“Indeterminacy On The All Possible Connections of Cells In Front 1127
of Cancer’s Attacks In The Terms of Neutrosophic Failed SuperHyperClique on Can- 1128
cer’s Recognition called Neutrosophic SuperHyperGraphs”, ResearchGate 2023, (doi: 1129
10.13140/RG.2.2.15897.70243). 1130
10.13140/RG.2.2.32530.73922). 1134

prints202301.0105.v1). 1137
HG28 [198] Henry Garrett,“Perfect Directions Toward Idealism in Cancer’s Neutrosophic Recogni- 1138
tion Forwarding Neutrosophic SuperHyperClique on Neutrosophic SuperHyperGraphs”, 1139

HG29 [199] Henry Garrett,“Demonstrating Complete Connections in Every Embedded Regions 1141
and Sub-Regions in the Terms of Cancer’s Recognition and (Neutrosophic) Su- 1142
perHyperGraphs With (Neutrosophic) SuperHyperClique”, ResearchGate 2023, (doi: 1143
10.13140/RG.2.2.23172.19849). 1144
HG30 [202] Henry Garrett,“Different Neutrosophic Types of Neutrosophic Regions titled neut- 1151
rosophic Failed SuperHyperStable in Cancer’s Neutrosophic Recognition modeled 1152
in the Form of Neutrosophic SuperHyperGraphs”, ResearchGate 2023, (doi: 1153
10.13140/RG.2.2.17385.36968). 1154

Preprints 2023, 2023010044 1157
10.20944/preprints202301.0043.v1). 1160
HG31 [205] Henry Garrett, “Using the Tool As (Neutrosophic) Failed SuperHyperStable To SuperHy- 1161
perModel Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs”, ResearchGate 1162
2023, (doi: 10.13140/RG.2.2.28945.92007). 1163
SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 1168

10.13140/RG.2.2.35774.77123). 1169

HG35 [209] Henry Garrett, “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Re- 1173
cognitions And (Neutrosophic) SuperHyperGraphs”, ResearchGate 2022, (doi: 1174
10.13140/RG.2.2.29430.88642). 1175

(doi: 10.20944/preprints202212.0549.v1). 1181
(Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, ResearchGate 2022, (doi: 1183
10.13140/RG.2.2.19380.94084). 1184
SuperHyperClasses”, ResearchGate 2022, (doi: 10.13140/RG.2.2.14426.41923). 1192

(doi: 10.20944/preprints202212.0500.v1). 1195
Graph With SuperHyperModeling of Cancer’s Recognitions”, ResearchGate 2022 (doi: 1197
10.13140/RG.2.2.20993.12640). 1198
HG952 [217] Henry Garrett,“Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic 1199

HG95 [218] Henry Garrett, “Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic Su- 1202
perHyperGraphs And SuperHyperGraphs Alongside Applications in Cancer’s Treatments”, 1203
ResearchGate 2022 (doi: 10.13140/RG.2.2.23123.04641). 1204

HG37 [221] Henry Garrett, “Basic Neutrosophic Notions Concerning SuperHyperDominating and 1211
Neutrosophic SuperHyperResolving in SuperHyperGraph”, ResearchGate 2022 (doi: 1212
10.13140/RG.2.2.29173.86244). 1213
HG38 [222] Henry Garrett, “Initial Material of Neutrosophic Preliminaries to Study Some Neutrosophic 1214
Notions Based on Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic SuperHyper- 1215

Graph (NSHG)”, ResearchGate 2022 (doi: 10.13140/RG.2.2.25385.88160). 1216
HG184b [223] Henry Garrett, “Unequal Connective Dominating In SuperHyperGraphs”. Dr. Henry 1217
Garrett, 2023 (doi: 10.5281/zenodo.8078574). 1218
HG183b [224] Henry Garrett, “Strict Connective Dominating In SuperHyperGraphs”. Dr. Henry Garrett, 1219
2023 (doi: 10.5281/zenodo.8076449). 1220
HG182b [225] Henry Garrett, “Reverse Dimension Dominating In SuperHyperGraphs”. Dr. Henry 1221
HG181b [226] Henry Garrett, “Equal Dimension Dominating In SuperHyperGraphs”. Dr. Henry Garrett, 1223
2023 (doi: 10.5281/zenodo.8067469). 1224
HG180b [227] Henry Garrett, “Dimension Dominating In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1225
(doi: 10.5281/zenodo.8062076). 1226
HG179b [228] Henry Garrett, “Reverse Connective Dominating In SuperHyperGraphs”. Dr. Henry 1227
HG178b [229] Henry Garrett, “Equal Connective Dominating In SuperHyperGraphs”. Dr. Henry Garrett, 1229
2023 (doi: 10.5281/zenodo.8052976). 1230
HG177b [230] Henry Garrett, “Connective Dominating In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1231
(doi: 10.5281/zenodo.8051368). 1232
HG176b [231] Henry Garrett, “United Dominating In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1233
(doi: 10.5281/zenodo.8027488). 1234
HG175b [232] Henry Garrett, “Zero Forcing In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1235
10.5281/zenodo.8020181). 1236
HG174b [233] Henry Garrett, “Matrix-Based In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1237
10.5281/zenodo.7978921). 1238
HG173b [234] Henry Garrett, “Collections of Math II”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1239
odo.7943878). 1240
HG172b [235] Henry Garrett, “Dominating-Edges In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1241
10.5281/zenodo.7943871). 1242
HG171b [236] Henry Garrett, “Edge-Gap In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1243
10.5281/zenodo.7923786). 1244
HG170b [237] Henry Garrett, “Eulerian-Type-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 1245
2023 (doi: 10.5281/zenodo.7905287). 1246

HG169b [238] Henry Garrett, “Eulerian-Type-Cycle-Decomposition In SuperHyperGraphs”. Dr. Henry 1247

HG168b [239] Henry Garrett, “Eulerian-Type-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 1249
2023 (doi: 10.5281/zenodo.7874677). 1250
HG167b [240] Henry Garrett, “Eulerian-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1251
(doi: 10.5281/zenodo.7857906). 1252
HG166b [241] Henry Garrett, “Eulerian-Cycle-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 1253
2023 (doi: 10.5281/zenodo.7856329). 1254
HG165b [242] Henry Garrett, “Eulerian-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1255
10.5281/zenodo.7854561). 1256
HG164b [243] Henry Garrett, “Eulerian-Type-Path-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 1257
2023 (doi: 10.5281/zenodo.7851893). 1258
HG163b [244] Henry Garrett, “Eulerian-Type-Path-Decomposition In SuperHyperGraphs”. Dr. Henry 1259

HG162b [245] Henry Garrett, “Eulerian-Type-Path-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1261
(doi: 10.5281/zenodo.7835063). 1262
HG161b [246] Henry Garrett, “Eulerian-Path-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1263
(doi: 10.5281/zenodo.7826705). 1264
HG160b [247] Henry Garrett, “Eulerian-Path-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 1265
2023 (doi: 10.5281/zenodo.7820680). 1266
HG159b [248] Henry Garrett, “Eulerian-Path-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1267
10.5281/zenodo.7812750). 1268
HG158b [249] Henry Garrett, “Hamiltonian-Type-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry 1269
HG157b [250] Henry Garrett, “Hamiltonian-Type-Cycle-Decomposition In SuperHyperGraphs”. Dr. Henry 1271

HG156b [251] Henry Garrett, “Hamiltonian-Type-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 1273
2023 (doi: 10.5281/zenodo.7807782). 1274
HG155b [252] Henry Garrett, “Hamiltonian-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 1275
2023 (doi: 10.5281/zenodo.7804449). 1276
HG154b [253] Henry Garrett, “Hamiltonian-Cycle-Decomposition In SuperHyperGraphs”. Dr. Henry 1277

HG153b [254] Henry Garrett, “Hamiltonian-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1279
(doi: 10.5281/zenodo.7792307). 1280
HG152b [255] Henry Garrett, “Hamiltonian-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1281
(doi: 10.5281/zenodo.7790728). 1282

HG151b [256] Henry Garrett, “Hamiltonian-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 1283
2023 (doi: 10.5281/zenodo.7787712). 1284
HG150b [257] Henry Garrett, “Hamiltonian-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1285
10.5281/zenodo.7783791). 1286
HG149b [258] Henry Garrett, “Trace-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1287
10.5281/zenodo.7780123). 1288
HG148b [259] Henry Garrett, “Trace-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1289
(doi: 10.5281/zenodo.7773119). 1290
HG147b [260] Henry Garrett, “SuperHyperDuality”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1291
odo.7637762). 1292
HG146b [261] Henry Garrett, “Trace-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1293
10.5281/zenodo.7766174). 1294
HG145b [262] Henry Garrett, “Edge-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1295
10.5281/zenodo.7762232). 1296
HG144b [263] Henry Garrett, “Edge-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1297
(doi: 10.5281/zenodo.7758601). 1298
HG143b [264] Henry Garrett, “Edge-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1299
10.5281/zenodo.7754661). 1300
HG142b [265] Henry Garrett, “Vertex-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1301
10.5281/zenodo.7750995) . 1302
HG141b [266] Henry Garrett, “Vertex-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1303
(doi: 10.5281/zenodo.7749875). 1304
HG140b [267] Henry Garrett, “Vertex-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1305
10.5281/zenodo.7747236). 1306
HG139b [268] Henry Garrett, “Stable-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1307
10.5281/zenodo.7742587). 1308
HG138b [269] Henry Garrett, “Stable-Decompositions In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1309
(doi: 10.5281/zenodo.7738635). 1310
HG137b [270] Henry Garrett, “Stable-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1311
10.5281/zenodo.7734719). 1312
HG136b [271] Henry Garrett, “Clique-Neighbors In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1313
10.5281/zenodo.7730484). 1314
HG135b [272] Henry Garrett, “Clique-Decompositions In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1315
(doi: 10.5281/zenodo.7730469). 1316
HG134b [273] Henry Garrett, “Clique-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1317
10.5281/zenodo.7722865). 1318

HG133b [274] Henry Garrett, “Space In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1319
odo.7713563). 1320
odo.7709116). 1322
HG131b [276] Henry Garrett, “Edge-Connectivity In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1323
10.5281/zenodo.7706415). 1324
HG130b [277] Henry Garrett, “Vertex-Connectivity In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1325
10.5281/zenodo.7706063). 1326
HG129b [278] Henry Garrett, “Tree-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1327
10.5281/zenodo.7701906). 1328
HG128b [279] Henry Garrett, “Chord In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1329
odo.7700205). 1330
HG127b [280] Henry Garrett, “(i,j)-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1331
10.5281/zenodo.7694876). 1332
HG126b [281] Henry Garrett, “Edge-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1333
10.5281/zenodo.7679410). 1334
HG125b [282] Henry Garrett, “K-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1335
10.5281/zenodo.7675982). 1336
HG124b [283] Henry Garrett, “K-Number In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1337
10.5281/zenodo.7672388). 1338
HG123b [284] Henry Garrett, “Order In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1339
odo.7668648). 1340
HG122b [285] Henry Garrett, “Coloring In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1341
10.5281/zenodo.7662810). 1342
HG121b [286] Henry Garrett, “Dimension In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1343
10.5281/zenodo.7659162). 1344
HG120b [287] Henry Garrett, “Cancer In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1345
odo.7653233). 1346
HG119b [288] Henry Garrett, “SuperHyperWheel”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1347
odo.7653204). 1348
HG118b [289] Henry Garrett, “SuperHyperMultipartite”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1349
odo.7653142). 1350
HG117b [290] Henry Garrett, “SuperHyperBipartite”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1351
odo.7653117). 1352
HG116b [291] Henry Garrett, “SuperHyperStar”. Dr. Henry Garrett, 2023 (doi: 10.5281/zenodo.7653089). 1353

HG115b [292] Henry Garrett, “SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1354
odo.7651687). 1355
HG114b [293] Henry Garrett, “SuperHyperPath”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1356
odo.7651619). 1357
HG113b [294] Henry Garrett, “SuperHyperDomination”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1358
odo.7651439). 1359
HG112b [295] Henry Garrett, “SuperHyperDominating”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1360
odo.7650729). 1361
HG111b [296] Henry Garrett, “SuperHyperConnected”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1362
odo.7647868). 1363
HG110b [297] Henry Garrett, “SuperHyperTotal”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1364
odo.7647017). 1365
HG109b [298] Henry Garrett, “SuperHyperPerfect”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1366
odo.7644894). 1367
HG108b [299] Henry Garrett, “SuperHyperJoin”. Dr. Henry Garrett, 2023 (doi: 10.5281/zenodo.7641880). 1368
HG107b [300] Henry Garrett, “Path SuperHyperColoring”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1369
odo.7632923). 1370
HG106b [301] Henry Garrett, “SuperHyperDensity”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1371
odo.7623459). 1372
HG105b [302] Henry Garrett, “Neutrosophic SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 1373
10.5281/zenodo.7606416). 1374
HG104b [303] Henry Garrett, “Extreme SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 1375
10.5281/zenodo.7606416). 1376
HG103b [304] Henry Garrett, “SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1377
odo.7606404). 1378
HG102b [305] Henry Garrett, “Neutrosophic SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 1379
10.5281/zenodo.7580018). 1380
HG101b [306] Henry Garrett, “Extreme SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1381
odo.7580018). 1382
odo.7580018). 1384
odo.7579929). 1386
HG98b [309] Henry Garrett, “Neutrosophic SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 1387
10.5281/zenodo.7563170). 1388

HG97b [310] Henry Garrett, “Extreme SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1389
odo.7563164). 1390
HG96b [311] Henry Garrett, “SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1391
odo.7563160). 1392
odo.7563160). 1394
HG94b [313] Henry Garrett, “Overlook On SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 1395
10.5281/zenodo.7563160). 1396
HG93b [314] Henry Garrett, “Neutrosophic SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 1397
10.5281/zenodo.7557063). 1398
HG92b [315] Henry Garrett, “Extreme SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 1399
10.5281/zenodo.7557009). 1400
HG91b [316] Henry Garrett, “Overlook On SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 1401
10.5281/zenodo.7539484). 1402
HG90b [317] Henry Garrett, “Neutrosophic Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1403
10.5281/zenodo.7523390). 1404
HG89b [318] Henry Garrett, “Extreme Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1405
10.5281/zenodo.7523390). 1406
HG88b [319] Henry Garrett, “Overlook On Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1407
10.5281/zenodo.7523390). 1408
HG87b [320] Henry Garrett, “Extreme SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1409
odo.7574952). 1410
HG86b [321] Henry Garrett, “Neutrosophic SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1411
10.5281/zenodo.7574992). 1412
odo.7523357). 1414
HG84b [323] Henry Garrett, “Overlook On SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1415
10.5281/zenodo.7523357). 1416
HG83b [324] Henry Garrett, “Neutrosophic Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1417
10.5281/zenodo.7504782). 1418
HG82b [325] Henry Garrett, “Extreme Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1419
10.5281/zenodo.7504782). 1420
HG81b [326] Henry Garrett, “Overlook On Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1421
10.5281/zenodo.7504782). 1422
HG80b [327] Henry Garrett, “Neutrosophic SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1423
10.5281/zenodo.7499395). 1424

HG79b [328] Henry Garrett, “Extreme SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1425
odo.7499395). 1426
HG78b [329] Henry Garrett, “Overlook On SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1427
10.5281/zenodo.7499395). 1428
HG77b [330] Henry Garrett, “Neutrosophic Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1429
10.5281/zenodo.7497450). 1430
HG76b [331] Henry Garrett, “Extreme Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1431
10.5281/zenodo.7497450). 1432
HG75b [332] Henry Garrett, “Neutrosophic SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1433
10.5281/zenodo.7494862). 1434
HG74b [333] Henry Garrett, “Extreme SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1435
odo.7494862). 1436
HG73b [334] Henry Garrett, “Overlook On SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1437
10.5281/zenodo.7494862). 1438
HG72b [335] Henry Garrett, “Neutrosophic SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 1439
10.5281/zenodo.7493845). 1440
HG71b [336] Henry Garrett, “Extreme SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1441
odo.7493845). 1442
HG70b [337] Henry Garrett, “Overlook On SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 1443
10.5281/zenodo.7493845). 1444
HG69b [338] Henry Garrett, “SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1445
odo.7539484). 1446
HG68b [339] Henry Garrett, “Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1447
odo.7523390). 1448
HG67b [340] Henry Garrett, “SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1449
odo.7523357). 1450
HG66b [341] Henry Garrett, “Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1451
odo.7504782). 1452
HG65b [342] Henry Garrett, “SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1453
odo.7499395). 1454
HG64b [343] Henry Garrett, “Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1455
odo.7497450). 1456
HG63b [344] Henry Garrett, “SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1457
odo.7494862). 1458
HG62b [345] Henry Garrett, “SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1459
odo.7493845). 1460

HG61b [346] Henry Garrett, “SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1461
odo.7480110). 1462
HG60b [347] Henry Garrett, “Neut. SuperHyperEdges”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1463
odo.7378758). 1464
HG32b [348] Henry Garrett, “Beyond Neutrosophic Graphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1465
odo.6320305). 1466
HG44b [349] Henry Garrett, “Neutrosophic Duality”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1467
odo.6677173). 1468

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

but it’s officially called “Extreme SuperHyperGraphs”. The cancer is the disease but the model 1518
is going to figure out what’s going on this phenomenon. The special case of this disease is 1519
considered and as the consequences of the model, some parameters are used. The cells are 1520
under attack of this disease but the moves of the cancer in the special region are the matter of 1521
mind. The recognition of the cancer could help to find some treatments for this disease. The 1522
SuperHyperGraph and Extreme SuperHyperGraph are the SuperHyperModels on the “Cancer’s 1523
Recognition” and both bases are the background of this research. Sometimes the cancer has 1524
been happened on the region, full of cells, groups of cells and embedded styles. In this segment, 1525
the SuperHyperModel proposes some SuperHyperNotions based on the connectivities of the 1526
moves of the cancer in the forms of alliances’ styles with the formation of the design and the 1527
architecture are formally called “ SuperHyperK-Domination” in the themes of jargons and 1528
buzzwords. The prefix “SuperHyper” refers to the theme of the embedded styles to figure out 1529
the background for the SuperHyperNotions. The recognition of the cancer in the long-term 1530
function. The specific region has been assigned by the model [it’s called SuperHyperGraph] 1531
and the long cycle of the move from the cancer is identified by this research. Sometimes the 1532
move of the cancer hasn’t be easily identified since there are some determinacy, indeterminacy 1533
and neutrality about the moves and the effects of the cancer on that region; this event leads 1534
us to choose another model [it’s said to be Extreme SuperHyperGraph] to have convenient 1535
perception on what’s happened and what’s done. There are some specific models, which 1536
are well-known and they’ve got the names, and some general models. The moves and the 1537
traces of the cancer on the complex tracks and between complicated groups of cells could 1538
be fantasized by an Extreme SuperHyperPath (-/SuperHyperK-Domination, SuperHyperStar, 1539
SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find either the 1540
optimal SuperHyperK-Domination or the Extreme SuperHyperK-Domination in those Extreme 1541

SuperHyperModels. Some general results are introduced. Beyond that in SuperHyperStar, 1542
all possible Extreme SuperHyperPath s have only two SuperHyperEdges but it’s not enough 1543
since it’s essential to have at least three SuperHyperEdges to form any style of a SuperHyperK- 1544
Domination. There isn’t any formation of any SuperHyperK-Domination but literarily, it’s the 1545
deformation of any SuperHyperK-Domination. It, literarily, deforms and it doesn’t form. 1546
Question 4.0.1. How to define the SuperHyperNotions and to do research on them to find the “ 1547
amount of SuperHyperK-Domination” of either individual of cells or the groups of cells based on 1548
the fixed cell or the fixed group of cells, extensively, the “amount of SuperHyperK-Domination” 1549
based on the fixed groups of cells or the fixed groups of group of cells? 1550
Question 4.0.2. What are the best descriptions for the “Cancer’s Recognition” in terms of these 1551
messy and dense SuperHyperModels where embedded notions are illustrated? 1552
It’s motivation to find notions to use in this dense model is titled “SuperHyperGraphs”. 1553
Thus it motivates us to define different types of “ SuperHyperK-Domination” and “Extreme 1554
SuperHyperK-Domination” on “SuperHyperGraph” and “Extreme SuperHyperGraph”. Then the 1555

research has taken more motivations to define SuperHyperClasses and to find some connections 1556
amid this SuperHyperNotion with other SuperHyperNotions. It motivates us to get some 1557
instances and examples to make clarifications about the framework of this research. The general 1558
results and some results about some connections are some avenues to make key point of this 1559
research, “Cancer’s Recognition”, more understandable and more clear. 1560
Some SuperHyperClasses and some Extreme SuperHyperClasses are the cases of this research 1561
on the modeling of the regions where are under the attacks of the cancer to recognize 1562
this disease as it’s mentioned on the title “Cancer’s Recognitions”. To formalize the 1563
instances on the SuperHyperNotion, SuperHyperK-Domination, the new SuperHyperClasses 1564
and SuperHyperClasses, are introduced. Some general results are gathered in the section on 1565
the SuperHyperK-Domination and the Extreme SuperHyperK-Domination. The clarifications, 1566
instances and literature reviews have taken the whole way through. In this scientific research, 1567
the literature reviews have fulfilled the lines containing the notions and the results. The 1568
Recognitions” and both bases are the background of this research. Sometimes the cancer has 1570
been happened on the region, full of cells, groups of cells and embedded styles. In this scientific 1571
segment, the SuperHyperModel proposes some SuperHyperNotions based on the connectivities 1572
of the moves of the cancer in the longest and strongest styles with the formation of the design 1573
and the architecture are formally called “ SuperHyperK-Domination” in the themes of jargons 1574
and buzzwords. The prefix “SuperHyper” refers to the theme of the embedded styles to figure 1575
out the background for the SuperHyperNotions. 1576

CHAPTER 5 1577
Extreme Unequal Connective Dominating 1578
Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of SuperHyperDu- 1579
ality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, ResearchGate 1580
2023, (doi: 10.13140/RG.2.2.34953.52320). 1581

Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph By 1582
SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchGate 2023, 1583
(doi: 10.13140/RG.2.2.33275.80161). 1584
Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 1585
10.13140/RG.2.2.11050.90569). 1587
Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of SuperHyperJoin 1588
10.13140/RG.2.2.17761.79206). 1590
10.13140/RG.2.2.19911.37285). 1593
Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect 1594
10.13140/RG.2.2.23266.81602). 1596
10.13140/RG.2.2.19360.87048). 1599
Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal 1600
10.13140/RG.2.2.32363.21286). 1602
10.13140/RG.2.2.11758.69441). 1605
Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of SuperHyperConnected 1606
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 1607
10.13140/RG.2.2.31891.35367). 1608
10.13140/RG.2.2.21510.45125). 1611
51
Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDominating 1612
10.13140/RG.2.2.13121.84321). 1614

CHAPTER 6 1615
New Ideas On Super Con By Hyper 1616
Conceit Of Unequal Connective 1617
Dominating In Recognition of Cancer 1618
With (Neutrosophic) SuperHyperGraph 1619
53
CHAPTER 7 1620
ABSTRACT 1621
In this scientific research, (Different Neutrosophic Types of Neutrosophic SuperHyperUnequal 1622

Connective Dominating). Assume a Neutrosophic SuperHyperGraph (NSHG) S is a Unequal Connective 1623
0
Dominating pair S = (V, E). Consider a Neutrosophic SuperHyperSet V = {V1 , V2 , . . . , Vs } and 1624
0 0 0
E = {E1 , E2 , . . . , Ez }. Then either V or E is called Neutrosophic e-SuperHyperUnequal Connective 1625
Dominating if the following expression is called Neutrosophic e-SuperHyperUnequal Connective Dominating 1626
criteria holds 1627
∀Ea ∈ EN SHG , ∃Eb ∈ E 0 : ∃Vc ∈ VN SHG , Vc ∈ Ea , Eb

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

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

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

55
Neutrosophic rv-SuperHyperUnequal Connective Dominating if the following expression is called 1633

Neutrosophic v-SuperHyperUnequal Connective Dominating criteria holds 1634

And ∀Ea ∈ EN SHG : (T (E), I(E), F (E) 6=
and |Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; Neutrosophic Super- 1635
HyperUnequal Connective Dominating if it’s either of Neutrosophic e-SuperHyperUnequal Connective Domin- 1636
ating, Neutrosophic re-SuperHyperUnequal Connective Dominating, Neutrosophic v-SuperHyperUnequal 1637
Connective Dominating, and Neutrosophic rv-SuperHyperUnequal Connective Dominating. ((Neutrosophic) 1638
SuperHyperUnequal Connective Dominating). Assume a Neutrosophic SuperHyperGraph (NSHG) S 1639
is a pair S = (V, E). Consider a Neutrosophic SuperHyperEdge (NSHE) E = {V1 , V2 , . . . , Vs }. 1640
Then E is called an Extreme SuperHyperUnequal Connective Dominating if it’s either of Neutrosophic 1641
e-SuperHyperUnequal Connective Dominating, Neutrosophic re-SuperHyperUnequal Connective Dominating, 1642
Neutrosophic v-SuperHyperUnequal Connective Dominating, and Neutrosophic rv-SuperHyperUnequal 1643
Connective Dominating and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the max- 1644
imum Extreme cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of the 1645
Extreme SuperHyperEdges in the consecutive Extreme sequence of Extreme SuperHyperEdges 1646
and Extreme SuperHyperVertices such that they form the Extreme SuperHyperUnequal Connective 1647
Dominating; a Neutrosophic SuperHyperUnequal Connective Dominating if it’s either of Neutrosophic 1648
Connective Dominating and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is 1651
the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutro- 1652
sophic SuperHyperSet S of high Neutrosophic cardinality consecutive Neutrosophic Super- 1653

HyperEdges and Neutrosophic SuperHyperVertices such that they form the Neutrosophic 1654
SuperHyperUnequal Connective Dominating; an Extreme SuperHyperUnequal Connective Dominating SuperHy- 1655
perPolynomial if it’s either of Neutrosophic e-SuperHyperUnequal Connective Dominating, Neutrosophic 1656
re-SuperHyperUnequal Connective Dominating, Neutrosophic v-SuperHyperUnequal Connective Dominating, 1657
and Neutrosophic rv-SuperHyperUnequal Connective Dominating and C(N SHG) for an Extreme Su- 1658
perHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme 1659
coefficients defined as the Extreme number of the maximum Extreme cardinality of the Extreme 1660
SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme cardinality consecutive 1661
Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the Extreme 1662
SuperHyperUnequal Connective Dominating; and the Extreme power is corresponded to its Extreme 1663
coefficient; a Neutrosophic SuperHyperUnequal Connective Dominating SuperHyperPolynomial if it’s 1664
either of Neutrosophic e-SuperHyperUnequal Connective Dominating, Neutrosophic re-SuperHyperUnequal 1665

Connective Dominating, Neutrosophic v-SuperHyperUnequal Connective Dominating, and Neutrosophic rv- 1666
SuperHyperUnequal Connective Dominating and C(N SHG) for a Neutrosophic SuperHyperGraph 1667
N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains the Neutrosophic coeffi- 1668
cients defined as the Neutrosophic number of the maximum Neutrosophic cardinality of the 1669
Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic car- 1670
dinality consecutive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such 1671

that they form the Neutrosophic SuperHyperUnequal Connective Dominating; and the Neutrosophic 1672
power is corresponded to its Neutrosophic coefficient; an Extreme V-SuperHyperUnequal Connective 1673
Dominating if it’s either of Neutrosophic e-SuperHyperUnequal Connective Dominating, Neutrosophic re- 1674
SuperHyperUnequal Connective Dominating, Neutrosophic v-SuperHyperUnequal Connective Dominating, and 1675
Neutrosophic rv-SuperHyperUnequal Connective Dominating and C(N SHG) for an Extreme SuperHy- 1676
perGraph N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet 1677
S of high Extreme cardinality of the Extreme SuperHyperVertices in the consecutive Extreme 1678
sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form 1679
the Extreme SuperHyperUnequal Connective Dominating; a Neutrosophic V-SuperHyperUnequal Connective 1680
Neutrosophic rv-SuperHyperUnequal Connective Dominating and C(N SHG) for a Neutrosophic Supe- 1683
rHyperGraph N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic 1684
SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consec- 1685
utive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form 1686
the Neutrosophic SuperHyperUnequal Connective Dominating; an Extreme V-SuperHyperUnequal Connective 1687
Dominating SuperHyperPolynomial if it’s either of Neutrosophic e-SuperHyperUnequal Connective Dom- 1688
inating, Neutrosophic re-SuperHyperUnequal Connective Dominating, Neutrosophic v-SuperHyperUnequal 1689
Connective Dominating, and Neutrosophic rv-SuperHyperUnequal Connective Dominating and C(N SHG) for 1690
an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains 1691
the Extreme coefficients defined as the Extreme number of the maximum Extreme cardinality of 1692
the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality 1693
consecutive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form 1694
the Extreme SuperHyperUnequal Connective Dominating; and the Extreme power is corresponded 1695
to its Extreme coefficient; a Neutrosophic SuperHyperUnequal Connective Dominating SuperHyper- 1696

Polynomial if it’s either of Neutrosophic e-SuperHyperUnequal Connective Dominating, Neutrosophic 1697
and Neutrosophic rv-SuperHyperUnequal Connective Dominating and C(N SHG) for a Neutrosophic 1699
SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains the 1700
Neutrosophic coefficients defined as the Neutrosophic number of the maximum Neutrosophic 1701
cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S of high 1702

Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and Neutrosophic Super- 1703
HyperVertices such that they form the Neutrosophic SuperHyperUnequal Connective Dominating; and 1704
the Neutrosophic power is corresponded to its Neutrosophic coefficient. In this scientific research, 1705
new setting is introduced for new SuperHyperNotions, namely, a SuperHyperUnequal Connective 1706
Dominating and Neutrosophic SuperHyperUnequal Connective Dominating. Two different types of Super- 1707
HyperDefinitions are debut for them but the research goes further and the SuperHyperNotion, 1708
The literature review is implemented in the whole of this research. For shining the elegancy and 1710
the significancy of this research, the comparison between this SuperHyperNotion with other 1711
SuperHyperNotions and fundamental SuperHyperNumbers are featured. The definitions are 1712
followed by the examples and the instances thus the clarifications are driven with different tools. 1713
The applications are figured out to make sense about the theoretical aspect of this ongoing 1714
research. The “Cancer’s Recognition” are the under research to figure out the challenges make 1715
sense about ongoing and upcoming research. The special case is up. The cells are viewed in the 1716
deemed ways. There are different types of them. Some of them are individuals and some of them 1717

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

Dominating is a maximal of SuperHyperVertices with a maximum cardinality such that either of 1725
the following expressions hold for the (Neutrosophic) cardinalities of SuperHyperNeighbors of 1726
s ∈ S : there are |S ∩ N (s)| > |S ∩ (V \ N (s))| + δ; and |S ∩ N (s)| < |S ∩ (V \ N (s))| + δ. The 1727
first Expression, holds if S is an δ−SuperHyperOffensive. And the second Expression, holds 1728
if S is an δ−SuperHyperDefensive; a Neutrosophic δ−SuperHyperUnequal Connective Dominating is 1729
a maximal Neutrosophic of SuperHyperVertices with maximum Neutrosophic cardinality 1730

such that either of the following expressions hold for the Neutrosophic cardinalities of Super- 1731
HyperNeighbors of s ∈ S there are: |S ∩ N (s)|N eutrosophic > |S ∩ (V \ N (s))|N eutrosophic + δ; 1732
and |S ∩ N (s)|N eutrosophic < |S ∩ (V \ N (s))|N eutrosophic + δ. The first Expression, holds 1733
if S is a Neutrosophic δ−SuperHyperOffensive. And the second Expression, holds if S is a 1734
Neutrosophic δ−SuperHyperDefensive It’s useful to define a “Neutrosophic” version of a 1735
SuperHyperUnequal Connective Dominating . Since there’s more ways to get type-results to make a 1736
SuperHyperUnequal Connective Dominating more understandable. For the sake of having Neutrosophic 1737
SuperHyperUnequal Connective Dominating, there’s a need to “redefine” the notion of a “SuperHy- 1738
perUnequal Connective Dominating ”. The SuperHyperVertices and the SuperHyperEdges are assigned 1739
by the labels from the letters of the alphabets. In this procedure, there’s the usage of the 1740
position of labels to assign to the values. Assume a SuperHyperUnequal Connective Dominating . It’s 1741
redefined a Neutrosophic SuperHyperUnequal Connective Dominating if the mentioned Table holds, 1742
concerning, “The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges 1743
Belong to The Neutrosophic SuperHyperGraph” with the key points, “The Values of The 1744
Vertices & The Number of Position in Alphabet”, “The Values of The SuperVertices&The 1745
maximum Values of Its Vertices”, “The Values of The Edges&The maximum Values of Its 1746
Vertices”, “The Values of The HyperEdges&The maximum Values of Its Vertices”, “The Values 1747
of The SuperHyperEdges&The maximum Values of Its Endpoints”. To get structural examples 1748
and instances, I’m going to introduce the next SuperHyperClass of SuperHyperGraph based 1749
on a SuperHyperUnequal Connective Dominating . It’s the main. It’ll be disciplinary to have the 1750
foundation of previous definition in the kind of SuperHyperClass. If there’s a need to have all 1751
SuperHyperUnequal Connective Dominating until the SuperHyperUnequal Connective Dominating, then it’s offi- 1752
cially called a “SuperHyperUnequal Connective Dominating” but otherwise, it isn’t a SuperHyperUnequal 1753
Connective Dominating . There are some instances about the clarifications for the main definition 1754
titled a “SuperHyperUnequal Connective Dominating ”. These two examples get more scrutiny and 1755
discernment since there are characterized in the disciplinary ways of the SuperHyperClass 1756
based on a SuperHyperUnequal Connective Dominating . For the sake of having a Neutrosophic Su- 1757
perHyperUnequal Connective Dominating, there’s a need to “redefine” the notion of a “Neutrosophic 1758
SuperHyperUnequal Connective Dominating” and a “Neutrosophic SuperHyperUnequal Connective Dominating 1759

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

redefined to a “Neutrosophic SuperHyperUnequal Connective Dominating” if the intended Table holds. 1764
It’s useful to define “Neutrosophic” version of SuperHyperClasses. Since there’s more ways 1765
to get Neutrosophic type-results to make a Neutrosophic SuperHyperUnequal Connective Dominating 1766
more understandable. Assume a Neutrosophic SuperHyperGraph. There are some Neutrosophic 1767
SuperHyperClasses if the intended Table holds. Thus SuperHyperPath, SuperHyperUnequal 1768
Connective Dominating, SuperHyperStar, SuperHyperBipartite, SuperHyperMultiPartite, and Supe- 1769
rHyperWheel, are “Neutrosophic SuperHyperPath”, “Neutrosophic SuperHyperUnequal Connective 1770

Dominating”, “Neutrosophic SuperHyperStar”, “Neutrosophic SuperHyperBipartite”, “Neutro- 1771
sophic SuperHyperMultiPartite”, and “Neutrosophic SuperHyperWheel” if the intended Table 1772
holds. A SuperHyperGraph has a “Neutrosophic SuperHyperUnequal Connective Dominating” where 1773
it’s the strongest [the maximum Neutrosophic value from all the SuperHyperUnequal Connective 1774
Dominating amid the maximum value amid all SuperHyperVertices from a SuperHyperUnequal 1775
Connective Dominating .] SuperHyperUnequal Connective Dominating . A graph is a SuperHyperUniform 1776

with two exceptions; it’s SuperHyperUnequal Connective Dominating if it’s only one SuperVertex as 1780
intersection amid two given SuperHyperEdges; it’s SuperHyperStar it’s only one SuperVertex 1781
as intersection amid all SuperHyperEdges; it’s SuperHyperBipartite it’s only one SuperVer- 1782
tex as intersection amid two given SuperHyperEdges and these SuperVertices, forming two 1783
separate sets, has no SuperHyperEdge in common; it’s SuperHyperMultiPartite it’s only 1784
and the common and intended properties between “specific” cells and “specific group” of cells 1792
are SuperHyperModeled as “SuperHyperEdges”. Sometimes, it’s useful to have some degrees of 1793
determinacy, indeterminacy, and neutrality to have more precise SuperHyperModel which in this 1794
case the SuperHyperModel is called “Neutrosophic”. In the future research, the foundation will 1795
be based on the “Cancer’s Recognition” and the results and the definitions will be introduced 1796
in redeemed ways. The recognition of the cancer in the long-term function. The specific region 1797
has been assigned by the model [it’s called SuperHyperGraph] and the long cycle of the move 1798
from the cancer is identified by this research. Sometimes the move of the cancer hasn’t be easily 1799
identified since there are some determinacy, indeterminacy and neutrality about the moves 1800
and the effects of the cancer on that region; this event leads us to choose another model [it’s 1801
said to be Neutrosophic SuperHyperGraph] to have convenient perception on what’s happened 1802
and what’s done. There are some specific models, which are well-known and they’ve got the 1803
names, and some SuperHyperGeneral SuperHyperModels. The moves and the traces of the 1804
cancer on the complex tracks and between complicated groups of cells could be fantasized 1805
by a Neutrosophic SuperHyperPath(-/SuperHyperUnequal Connective Dominating, SuperHyperStar, 1806
SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find either 1807
the longest SuperHyperUnequal Connective Dominating or the strongest SuperHyperUnequal Connective 1808
Dominating in those Neutrosophic SuperHyperModels. For the longest SuperHyperUnequal Connective 1809

Dominating , called SuperHyperUnequal Connective Dominating, and the strongest SuperHyperUnequal Con- 1810
nective Dominating, called Neutrosophic SuperHyperUnequal Connective Dominating, some general results 1811
are introduced. Beyond that in SuperHyperStar, all possible SuperHyperPaths have only two 1812
SuperHyperEdges but it’s not enough since it’s essential to have at least three SuperHyperEdges 1813
to form any style of a SuperHyperUnequal Connective Dominating. There isn’t any formation of any 1814
SuperHyperUnequal Connective Dominating but literarily, it’s the deformation of any SuperHyperUnequal 1815
Connective Dominating. It, literarily, deforms and it doesn’t form. A basic familiarity with Neut- 1816
rosophic SuperHyperUnequal Connective Dominating theory, SuperHyperGraphs, and Neutrosophic 1817
SuperHyperGraphs theory are proposed. 1818
Keywords: Extreme SuperHyperGraph, SuperHyperUnequal Connective Dominating, Cancer’s Ex- 1819
treme Recognition 1820


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

Then the research has taken more motivations to define SuperHyperClasses and to find some 1882
connections amid this SuperHyperNotion with other SuperHyperNotions. It motivates us to get 1883
some instances and examples to make clarifications about the framework of this research. The 1884
general results and some results about some connections are some avenues to make key point of 1885
this research, “Cancer’s Recognition”, more understandable and more clear. 1886
The framework of this research is as follows. In the beginning, I introduce basic definitions 1887
to clarify about preliminaries. In the subsection “Preliminaries”, initial definitions about 1888
SuperHyperGraphs and Extreme SuperHyperGraph are deeply-introduced and in-depth- 1889
discussed. The elementary concepts are clarified and illustrated completely and sometimes 1890
review literature are applied to make sense about what’s going to figure out about the 1891
upcoming sections. The main definitions and their clarifications alongside some results about 1892
new notions, SuperHyperUnequal Connective Dominating and Extreme SuperHyperUnequal Connective 1893
Dominating, are figured out in sections “ SuperHyperUnequal Connective Dominating” and “Extreme 1894
SuperHyperUnequal Connective Dominating”. In the sense of tackling on getting results and in Unequal 1895
Connective Dominating to make sense about continuing the research, the ideas of SuperHyperUniform 1896
and Extreme SuperHyperUniform are introduced and as their consequences, corresponded 1897
SuperHyperClasses are figured out to debut what’s done in this section, titled “Results on 1898
SuperHyperClasses” and “Results on Extreme SuperHyperClasses”. As going back to origin of 1899

the notions, there are some smart steps toward the common notions to extend the new notions 1900
in new frameworks, SuperHyperGraph and Extreme SuperHyperGraph, in the sections “Results 1901
on SuperHyperClasses” and “Results on Extreme SuperHyperClasses”. The starter research 1902
about the general SuperHyperRelations and as concluding and closing section of theoretical 1903
research are contained in the section “General Results”. Some general SuperHyperRelations 1904
are fundamental and they are well-known as fundamental SuperHyperNotions as elicited 1905
and discussed in the sections, “General Results”, “ SuperHyperUnequal Connective Dominating”, 1906
“Extreme SuperHyperUnequal Connective Dominating”, “Results on SuperHyperClasses” and “Results 1907
on Extreme SuperHyperClasses”. There are curious questions about what’s done about the 1908
SuperHyperNotions to make sense about excellency of this research and going to figure out 1909
the word “best” as the description and adjective for this research as presented in section, 1910
“ SuperHyperUnequal Connective Dominating”. The keyword of this research debut in the section 1911
“Applications in Cancer’s Recognition” with two cases and subsections “Case 1: The Initial 1912
Steps Toward SuperHyperBipartite as SuperHyperModel” and “Case 2: The Increasing Steps 1913
Toward SuperHyperMultipartite as SuperHyperModel”. In the section, “Open Problems”, there 1914
are some scrutiny and discernment on what’s done and what’s happened in this research in 1915
the terms of “questions” and “problems” to make sense to figure out this research in featured 1916
style. The advantages and the limitations of this research alongside about what’s done in this 1917
research to make sense and to get sense about what’s figured out are included in the section, 1918
“Conclusion and Closing Remarks”. 1919

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

terization of the Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG11s],Definition 2.7,p.3), 1926
[t-norm](Ref.[HG11s], Definition 2.7, p.3), and [Characterization of the Neutrosophic Super- 1927
HyperGraph (NSHG)](Ref.[HG11s],Definition 2.7,p.3), [Neutrosophic Strength of the Neutro- 1928
sophic SuperHyperPaths] (Ref.[HG11s],Definition 5.3,p.7), and [Different Neutrosophic Types 1929
of Neutrosophic SuperHyperEdges (NSHE)] (Ref.[HG11s],Definition 5.4,p.7). Also, the new 1930
ideas and their clarifications are addressed to Ref.[HG38]. 1931

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

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

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

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

falsity-membership of the subset X ⊂ A of the single valued Neutrosophic set A = {< x :
TA (x), IA (x), FA (x) >, x ∈ X}:
TA (X) = min[TA (vi ), TA (vj )]vi ,vj ∈X ,
IA (X) = min[IA (vi ), IA (vj )]vi ,vj ∈X ,
and FA (X) = min[FA (vi ), FA (vj )]vi ,vj ∈X .
Definition 9.0.4. The support of X ⊂ A of the single valued Neutrosophic set A = {< x :
TA (x), IA (x), FA (x) >, x ∈ X}:
supp(X) = {x ∈ X : TA (x), IA (x), FA (x) > 0}.
Definition 9.0.5 (Neutrosophic SuperHyperGraph (NSHG)). (Ref.[HG11s],Definition 2.5,p.2). 1935
Assume V 0 is a given set. a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E), 1936
where 1937
0
(i) V = {V1 , V2 , . . . , Vn } a finite set of finite single valued Neutrosophic subsets of V ; 1938
(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); 1939
(iii) E = {E1 , E2 , . . . , En0 } a finite set of finite single valued Neutrosophic subsets of V ; 1940
(iv) E = {(Ei0 , TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 )) : TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 ) ≥ 0}, (i 0
= 1941
0
1, 2, . . . , n ); 1942
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 1943
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 1944

P
(vii) i supp(Vi ) = V, (i = 1, 2, . . . , n); 1945
0 0
P
(viii) i0 supp(Ei ) = V, (i = 1, 2, . . . , n ); 1946
0
(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 . 1947
Here the Neutrosophic SuperHyperEdges (NSHE) Ej 0 and the Neutrosophic SuperHyperVertices 1948
(NSHV) Vj are single valued Neutrosophic sets. TV 0 (Vi ), IV 0 (Vi ), and FV 0 (Vi ) denote the 1949
degree of truth-membership, the degree of indeterminacy-membership and the degree of 1950
falsity-membership the Neutrosophic SuperHyperVertex (NSHV) Vi to the Neutrosophic 1951

SuperHyperVertex (NSHV) V. TV0 (Ei0 ), TV0 (Ei0 ), and TV0 (Ei0 ) denote the degree of truth- 1952
membership, the degree of indeterminacy-membership and the degree of falsity-membership of 1953
the Neutrosophic SuperHyperEdge (NSHE) Ei0 to the Neutrosophic SuperHyperEdge (NSHE) 1954
E. Thus, the ii0 th element of the Unequal Connective Dominating of Neutrosophic 1955
SuperHyperGraph (NSHG) are of the form (Vi , TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 )), the sets V and 1956
E are crisp sets. 1957

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

(Ref.[HG11s],Definition 2.7,p.3). 1959
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). The Neutro- 1960
sophic SuperHyperEdges (NSHE) Ei0 and the Neutrosophic SuperHyperVertices (NSHV) Vi of 1961
Neutrosophic SuperHyperGraph (NSHG) S = (V, E) could be characterized as follow-up items. 1962
(i) If |Vi | = 1, then Vi is called vertex; 1963
(ii) if |Vi | ≥ 1, then Vi is called SuperVertex; 1964
(iii) if for all Vi s are incident in Ei0 , |Vi | = 1, and |Ei0 | = 2, then Ei0 is called edge; 1965
(iv) if for all Vi s are incident in Ei0 , |Vi | = 1, and |Ei0 | ≥ 2, then Ei0 is called HyperEdge; 1966
(v) if there’s a Vi is incident in Ei0 such that |Vi | ≥ 1, and |Ei0 | = 2, then Ei0 is called 1967
SuperEdge; 1968
(vi) if there’s a Vi is incident in Ei0 such that |Vi | ≥ 1, and |Ei0 | ≥ 2, then Ei0 is called 1969
SuperHyperEdge. 1970
If we choose different types of binary operations, then we could get hugely diverse types of 1971
general forms of Neutrosophic SuperHyperGraph (NSHG). 1972
Definition 9.0.7 (t-norm). (Ref.[HG11s], Definition 2.7, p.3). 1973

A binary operation ⊗ : [0, 1] × [0, 1] → [0, 1] is a t-norm if it satisfies the following for 1974
x, y, z, w ∈ [0, 1]: 1975
(i) 1 ⊗ x = x; 1976
(ii) x ⊗ y = y ⊗ x; 1977
(iii) x ⊗ (y ⊗ z) = (x ⊗ y) ⊗ z; 1978
(iv) If w ≤ x and y ≤ z then w ⊗ y ≤ x ⊗ z. 1979

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

where 1982

(i) V = {V1 , V2 , . . . , Vn } a finite set of finite single valued Neutrosophic subsets of V 0 ; 1983
(iv) E = {(Ei0 , TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 )) : TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 ) ≥ 0}, (i0 = 1986
1, 2, . . . , n0 ); 1987
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 1988
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 1989
P
(vii) i supp(Vi ) = V, (i = 1, 2, . . . , n); 1990
0 0
P
(viii) i0 supp(Ei ) = V, (i = 1, 2, . . . , n ). 1991
0

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

Definition 9.0.12. A graph is SuperHyperUniform if it’s SuperHyperGraph and the number 2018
of elements of SuperHyperEdges are the same. 2019
To get more visions on SuperHyperUniform, the some SuperHyperClasses are introduced. It 2020
makes to have SuperHyperUniform more understandable. 2021
Definition 9.0.13. Assume a Neutrosophic SuperHyperGraph. There are some SuperHyper- 2022
Classes as follows. 2023
(i). It’s Neutrosophic SuperHyperPath if it’s only one SuperVertex as intersection amid 2024
two given SuperHyperEdges with two exceptions; 2025
(ii). it’s SuperHyperCycle if it’s only one SuperVertex as intersection amid two given 2026
SuperHyperEdges; 2027
(iii). it’s SuperHyperStar it’s only one SuperVertex as intersection amid all SuperHyperEdges; 2028
(iv). it’s SuperHyperBipartite it’s only one SuperVertex as intersection amid two given Supe- 2029
rHyperEdges and these SuperVertices, forming two separate sets, has no SuperHyperEdge 2030
in common; 2031
(v). it’s SuperHyperMultiPartite it’s only one SuperVertex as intersection amid two 2032
given SuperHyperEdges and these SuperVertices, forming multi separate sets, has no 2033
SuperHyperEdge in common; 2034
(vi). it’s SuperHyperWheel if it’s only one SuperVertex as intersection amid two given 2035
SuperHyperEdges and one SuperVertex has one SuperHyperEdge with any common 2036
SuperVertex. 2037
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 2038
(NSHV) V1 to Neutrosophic SuperHyperVertex (NSHV) Vs if either of following conditions hold: 2039
(i) Vi , Vi+1 ∈ Ei0 ; 2040
(ii) there’s a vertex vi ∈ Vi such that vi , Vi+1 ∈ Ei0 ; 2041
(iii) there’s a SuperVertex Vi0 ∈ Vi such that Vi0 , Vi+1 ∈ Ei0 ; 2042
(iv) there’s a vertex vi+1 ∈ Vi+1 such that Vi , vi+1 ∈ Ei0 ; 2043
0 0
(v) there’s a SuperVertex Vi+1 ∈ Vi+1 such that Vi , Vi+1 ∈ E i0 ; 2044
(vi) there are a vertex vi ∈ Vi and a vertex vi+1 ∈ Vi+1 such that vi , vi+1 ∈ Ei0 ; 2045
0 0
(vii) there are a vertex vi ∈ Vi and a SuperVertex Vi+1 ∈ Vi+1 such that vi , Vi+1 ∈ Ei0 ; 2046
(viii) there are a SuperVertex Vi0 ∈ Vi and a vertex vi+1 ∈ Vi+1 such that Vi0 , vi+1 ∈ Ei0 ; 2047
(ix) there are a SuperVertex Vi0 ∈ Vi and a SuperVertex Vi+1

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

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. 2049
(i) If for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | = 2, then NSHP is called path; 2050
(ii) if for all Ej 0 , |Ej 0 | = 2, and there’s Vi , |Vi | ≥ 1, then NSHP is called SuperPath; 2051
(iii) if for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | ≥ 2, then NSHP is called HyperPath; 2052
(iv) if there are Vi , Ej 0 , |Vi | ≥ 1, |Ej 0 | ≥ 2, then NSHP is called Neutrosophic SuperHy- 2053
perPath . 2054
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 2055
(i) Neutrosophic t-strength (min{T (Vi )}, m, n)si=1 ; 2056
(ii) Neutrosophic i-strength (m, min{I(Vi )}, n)si=1 ; 2057
(iii) Neutrosophic f-strength (m, n, min{F (Vi )})si=1 ; 2058
(iv) Neutrosophic strength (min{T (Vi )}, min{I(Vi )}, min{F (Vi )})si=1 . 2059
Definition 9.0.17 (Different Neutrosophic Types of Neutrosophic SuperHyperEdges (NSHE)). 2060

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

of SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex (NSHV) Vi to 2065
Neutrosophic SuperHyperVertex (NSHV) Vj where 1 ≤ i, j ≤ s; 2066
(x) Neutrosophic i-connective if I(E) ≥ maximum number of Neutrosophic i-strength 2067


(xi) Neutrosophic f-connective if F (E) ≥ maximum number of Neutrosophic f-strength 2070

(xii) Neutrosophic connective if (T (E), I(E), F (E)) ≥ maximum number of Neutrosophic 2073
strength of SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex (NSHV) Vi 2074
to Neutrosophic SuperHyperVertex (NSHV) Vj where 1 ≤ i, j ≤ s. 2075
Definition 9.0.18. (Different Neutrosophic Types of Neutrosophic SuperHyperUnequal Connective 2076

Dominating). 2077
Neutrosophic SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and E 0 = {E1 , E2 , . . . , Ez }. Then either V 0 2079
or E 0 is called 2080
(i) Neutrosophic e-SuperHyperUnequal Connective Dominating if the following expression is 2081

called Neutrosophic e-SuperHyperUnequal Connective Dominating criteria holds 2082

(ii) Neutrosophic re-SuperHyperUnequal Connective Dominating if the following expression 2083

is called Neutrosophic re-SuperHyperUnequal Connective Dominating criteria holds 2084

and |Ei |NEUTROSOPHIC CARDINALITY = |Ej |NEUTROSOPHIC CARDINALITY ; 2085
(iii) Neutrosophic v-SuperHyperUnequal Connective Dominating if the following expression is 2086
called Neutrosophic v-SuperHyperUnequal Connective Dominating criteria holds 2087


(iv) Neutrosophic rv-SuperHyperUnequal Connective Dominating if the following expression 2088

is called Neutrosophic v-SuperHyperUnequal Connective Dominating criteria holds 2089

and |Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; 2090
(v) Neutrosophic SuperHyperUnequal Connective Dominating if it’s either of Neutro- 2091

sophic e-SuperHyperUnequal Connective Dominating, Neutrosophic re-SuperHyperUnequal Connect- 2092
ive Dominating, Neutrosophic v-SuperHyperUnequal Connective Dominating, and Neutrosophic rv- 2093
SuperHyperUnequal Connective Dominating. 2094
Definition 9.0.19. ((Neutrosophic) SuperHyperUnequal Connective Dominating). 2095

(i) an Extreme SuperHyperUnequal Connective Dominating if it’s either of Neutrosophic 2098

e-SuperHyperUnequal Connective Dominating, Neutrosophic re-SuperHyperUnequal Connective Dom- 2099
inating, Neutrosophic v-SuperHyperUnequal Connective Dominating, and Neutrosophic rv- 2100
SuperHyperUnequal Connective Dominating and C(N SHG) for an Extreme SuperHyperGraph 2101
N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of 2102
high Extreme cardinality of the Extreme SuperHyperEdges in the consecutive Extreme 2103
sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 2104
form the Extreme SuperHyperUnequal Connective Dominating; 2105
(ii) a Neutrosophic SuperHyperUnequal Connective Dominating if it’s either of Neutro- 2106

N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic SuperHy- 2110
perEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive 2111
Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they 2112
form the Neutrosophic SuperHyperUnequal Connective Dominating; 2113
(iii) an Extreme SuperHyperUnequal Connective Dominating SuperHyperPolynomial if 2114

it’s either of Neutrosophic e-SuperHyperUnequal Connective Dominating, Neutrosophic re- 2115
SuperHyperUnequal Connective Dominating, Neutrosophic v-SuperHyperUnequal Connective Dominating, 2116
and Neutrosophic rv-SuperHyperUnequal Connective Dominating and C(N SHG) for an Extreme 2117
SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the 2118
Extreme coefficients defined as the Extreme number of the maximum Extreme cardinality 2119
of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme 2120
cardinality consecutive Extreme SuperHyperEdges and Extreme SuperHyperVertices such 2121
that they form the Extreme SuperHyperUnequal Connective Dominating; and the Extreme power 2122
is corresponded to its Extreme coefficient; 2123

(iv) a Neutrosophic SuperHyperUnequal Connective Dominating SuperHyperPolynomial 2124

if it’s either of Neutrosophic e-SuperHyperUnequal Connective Dominating, Neutrosophic re- 2125
and Neutrosophic rv-SuperHyperUnequal Connective Dominating and C(N SHG) for a Neutro- 2127
sophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 2128
contains the Neutrosophic coefficients defined as the Neutrosophic number of the max- 2129
imum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic 2130

SuperHyperSet S of high Neutrosophic cardinality consecutive Neutrosophic SuperHy- 2131
perEdges and Neutrosophic SuperHyperVertices such that they form the Neutrosophic 2132
SuperHyperUnequal Connective Dominating; and the Neutrosophic power is corresponded to its 2133
Neutrosophic coefficient; 2134
(v) an Extreme V-SuperHyperUnequal Connective Dominating if it’s either of Neutro- 2135

high Extreme cardinality of the Extreme SuperHyperVertices in the consecutive Extreme 2140
(vi) a Neutrosophic V-SuperHyperUnequal Connective Dominating if it’s either of Neutro- 2143

N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic Supe- 2147
rHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 2148
consecutive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such 2149
that they form the Neutrosophic SuperHyperUnequal Connective Dominating; 2150
(vii) an Extreme V-SuperHyperUnequal Connective Dominating SuperHyperPolynomial 2151


of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme 2157
(viii) a Neutrosophic SuperHyperUnequal Connective Dominating SuperHyperPolynomial 2161

imum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic 2167

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

The Values of The SuperVertices The maximum Values of Its Vertices
The Values of The Edges The maximum Values of Its Vertices
The Values of The HyperEdges The maximum Values of Its Vertices
136TBL3
The Values of The SuperHyperEdges The maximum Values of Its Endpoints

Neutrosophic coefficient. 2171
Definition 9.0.20. ((Extreme/Neutrosophic)δ−SuperHyperUnequal Connective Dominating). 2172
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Then 2173
(i) an δ−SuperHyperUnequal Connective Dominating is a Neutrosophic kind of Neutrosophic 2174
SuperHyperUnequal Connective Dominating such that either of the following expressions hold for 2175
the Neutrosophic cardinalities of SuperHyperNeighbors of s ∈ S : 2176
|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 2177

(29.1), holds if S is an δ−SuperHyperDefensive; 2178
(ii) a Neutrosophic δ−SuperHyperUnequal Connective Dominating is a Neutrosophic kind 2179

of Neutrosophic SuperHyperUnequal Connective Dominating such that either of the following 2180
Neutrosophic expressions hold for the Neutrosophic cardinalities of SuperHyperNeighbors 2181

of s ∈ S : 2182
|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 2183

the Expression (29.1), holds if S is a Neutrosophic δ−SuperHyperDefensive. 2184
For the sake of having a Neutrosophic SuperHyperUnequal Connective Dominating, there’s a need to 2185
“redefine” the notion of “Neutrosophic SuperHyperGraph”. The SuperHyperVertices and the 2186
SuperHyperEdges are assigned by the labels from the letters of the alphabets. In this procedure, 2187
there’s the usage of the position of labels to assign to the values. 2188
136DEF1 Definition 9.0.21. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 2189
It’s redefined Neutrosophic SuperHyperGraph if the Table (29.1) holds. 2190
It’s useful to define a “Neutrosophic” version of SuperHyperClasses. Since there’s more ways 2191
to get Neutrosophic type-results to make a Neutrosophic more understandable. 2192

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

136TBL4

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

(V, E). There are some Neutrosophic SuperHyperClasses if the Table (29.2) holds. 2194
Thus Neutrosophic SuperHyperPath , SuperHyperUnequal Connective Dominating, SuperHyperStar, 2195
SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, are Neutrosophic 2196
SuperHyperPath, Neutrosophic SuperHyperCycle, Neutrosophic SuperHyperStar, 2197

Neutrosophic SuperHyperBipartite, Neutrosophic SuperHyperMultiPartite, and 2198
Neutrosophic SuperHyperWheel if the Table (29.2) holds. 2199
It’s useful to define a “Neutrosophic” version of a Neutrosophic SuperHyperUnequal Connective 2200

Dominating . Since there’s more ways to get type-results to make a Neutrosophic SuperHyperUnequal 2201
Connective Dominating more Neutrosophicly understandable. 2202
“redefine” the Neutrosophic notion of “Neutrosophic SuperHyperUnequal Connective Dominating”. The 2204
2207
136DEF1 Definition 9.0.23. Assume a SuperHyperUnequal Connective Dominating. It’s redefined a Neutro- 2208
sophic SuperHyperUnequal Connective Dominating if the Table (29.3) holds. 2209

CHAPTER 10 2210
Extreme SuperHyper But As Unequal Connective Dominating 2211
The Extensions Excerpt From Dense And 2212
Super Forms 2213
Definition 10.0.1. (Extreme event). 2214
Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) 2215
is a probability Unequal Connective Dominating. Any Extreme k-subset of A of V is called Extreme 2216
k-event and if k = 2, then Extreme subset of A of V is called Extreme event. The following 2217
expression is called Extreme probability of A. 2218
X
E(A) = E(a). (10.1)
a∈A
Definition 10.0.2. (Extreme Independent). 2219

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

s-independent if the following expression is called Extreme s-independent criteria 2222
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 2223
following expression is called Extreme independent criteria 2224
E(A ∩ B) = P (A)P (B). (10.2)
Definition 10.0.3. (Extreme Variable). 2225

Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) is 2226
a probability Unequal Connective Dominating. Any k-function Unequal Connective Dominating like E is called 2227
Extreme k-Variable. If k = 2, then any 2-function Unequal Connective Dominating like E is called 2228
Extreme Variable. 2229
The notion of independent on Extreme Variable is likewise. 2230
Definition 10.0.4. (Extreme Expectation). 2231
Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) is a 2232
77
probability Unequal Connective Dominating. an Extreme k-Variable E has a number is called Extreme 2233
Expectation if the following expression is called Extreme Expectation criteria 2234
X
Ex(E) = E(α)P (α).
α∈V
Definition 10.0.5. (Extreme Crossing). 2235

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

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

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

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

as to obtain a simple Extreme SuperHyperGraph G with e(G) ≥ k − n. Now cr(G) ≤ n(n − 1) 2267
because G is formed from at most n SuperHyperCircles, and any two SuperHyperCircles cross 2268
at most twice. Thus either e(G) < 4n, in which case k < 5n < 5n4/3 , or n2 > n(n − 1) ≥ 2269
3
cr(G) ≥ (k − n) /64n2 by the Extreme Crossing Lemma, and k < 4n4/3 + n < 5n4/3 . 2270
Proposition 10.0.9. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). 2271
Consider S = (V, E) is a probability Unequal Connective Dominating. Let X be a nonnegative Extreme 2272
Variable and t a positive real number. Then 2273
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. 2274
Corollary 10.0.10. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). 2275
Consider S = (V, E) is a probability Unequal Connective Dominating. Let Xn be a nonnegative integer- 2276
valued variable in a probability Unequal Connective Dominating (Vn , En ), n ≥ 1. If E(Xn ) → 0 as 2277
n → ∞, then P (Xn = 0) → 1 as n → ∞. 2278
Proof. 2279
Consider S = (V, E) is a probability Unequal Connective Dominating. A special SuperHyperGraph in 2281
Gn,p almost surely has stability number at most d2p−1 log ne. 2282

S = (V, E) is a probability Unequal Connective Dominating. A special SuperHyperGraph in Gn,p is 2284
up. Let G ∈ Gn,p and let S be a given SuperHyperSet of k + 1 SuperHyperVertices of G, 2285
where k ∈ N. The probability that S is a stable SuperHyperSet of G is (1 − p)(k+1)choose2 , this 2286
being the probability that none of the (k + 1)choose2 pairs of SuperHyperVertices of S is a 2287
SuperHyperEdge of the Extreme SuperHyperGraph G. 2288
Let AS denote the event that S is a stable SuperHyperSet of G, and let XS denote the indicator 2289
Extreme Variable for this Extreme Event. By equation, we have 2290
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 2291
X
X= {XS : S ⊆ V, |S| = k + 1}
and so, by those, 2292
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: 2293
nk+1
(n choose k+1) ≤ and1 − p ≤ e−p .
(k + 1)!
This yields the following upper bound on E(X). 2294
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 2295
least as fast as the logarithm of n, implies that E(X) → 0 as n → ∞. Because X is integer-valued 2296
and nonnegative, we deduce from Corollary that P (X = 0) → 1 as n → ∞. Consequently, an 2297
Extreme SuperHyperGraph in Gn,p almost surely has stability number at most k. 2298
Definition 10.0.12. (Extreme Variance). 2299

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

S = (V, E) is a probability Unequal Connective Dominating. Let X be an Extreme Variable and let t 2307
be a positive real number. Then 2308
2
2 Ex((X − Ex(X)) ) V (X)
E(|X − Ex(X)| ≥ t) = E((X − Ex(X)) ≥ t2 ) ≤ 2
= .
t t2
2309
Consider S = (V, E) is a probability Unequal Connective Dominating. Let Xn be an Extreme Variable in 2311
a probability Unequal Connective Dominating (Vn , En ), n ≥ 1. If Ex(Xn ) 6= 0 and V (Xn ) << E 2 (Xn ), 2312
then 2313
E(Xn = 0) → 0 as n → ∞
S = (V, E) is a probability Unequal Connective Dominating. Set X := Xn and t := |Ex(Xn )| in 2315
Chebyshev’s Inequality, and observe that E(Xn = 0) ≤ E(|Xn − Ex(Xn )| ≥ |Ex(Xn )|) because 2316
|Xn − Ex(Xn )| = |Ex(Xn )| when Xn = 0. 2317
Consider S = (V, E) is a probability Unequal Connective Dominating. Let G ∈ Gn,1/2 . For 0 ≤ k ≤ n, set 2319
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 2320
one. Then almost surely α(G) takes one of the three values k ∗ − 2, k ∗ − 1, k ∗ . 2321
S = (V, E) is a probability Unequal Connective Dominating. As in the proof of related Theorem, the 2323
result is straightforward. 2324
Consider S = (V, E) is a probability Unequal Connective Dominating. Let G ∈ Gn,1/2 and let f and k ∗ 2326
be as defined in previous Theorem. Then either: 2327
(i). f (k ∗ ) << 1, in which case almost surely α(G) is equal to either k ∗ − 2 or k ∗ − 1, or 2328
(ii). f (k ∗ − 1) >> 1, in which case almost surely α(G) is equal to either k ∗ − 1 or k ∗ . 2329
S = (V, E) is a probability Unequal Connective Dominating. The latter is straightforward. 2331
Definition 10.0.17. (Extreme Threshold). 2332

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

Definition 10.0.18. (Extreme Balanced). 2339

probability Unequal Connective Dominating. Let F be a fixed Extreme SuperHyperGraph. Then 2341
there is a threshold function for the property of containing a copy of F as an Extreme 2342
SubSuperHyperGraph is called Extreme Balanced. 2343
Consider S = (V, E) is a probability Unequal Connective Dominating. Let F be a nonempty balanced 2345
Extreme SubSuperHyperGraph with k SuperHyperVertices and l SuperHyperEdges. Then n−k/l 2346

is a threshold function for the property of containing F as an Extreme SubSuperHyperGraph. 2347
136EXM1 Example 10.0.20. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E) in 2350
the mentioned Extreme Figures in every Extreme items. 2351
• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperUnequal 2352
Connective Dominating, is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 2353
are some empty Extreme SuperHyperEdges but E2 is a loop Extreme SuperHyperEdge and 2354
E4 is an Extreme SuperHyperEdge. Thus in the terms of Extreme SuperHyperNeighbor, 2355
there’s only one Extreme SuperHyperEdge, namely, E4 . The Extreme SuperHyperVertex, 2356
V3 is Extreme isolated means that there’s no Extreme SuperHyperEdge has it as an 2357
Extreme endpoint. Thus the Extreme SuperHyperVertex, V3 , is excluded in every given 2358
Extreme SuperHyperUnequal Connective Dominating. 2359
C(N SHG)Extreme Unequal Connective Dominating =

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

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

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

{}.
= 0z 0 .
{}.
= 0z 0 .
2372



{}.
= 0z 0 .
{}.
= 0z 0 .
2375

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

= z 7−c .
2378

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

{E15 , E16 , E17 }.

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

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

= z 3−a .
2387

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

{E1 , E2 , E3 }.



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

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


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

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


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

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


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

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


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

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


{V2 , V17 , V7 , V27 }.

= z 2−a .
2414

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


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

{E6 }.
= z 4−a .


{V1 }.
= z 6−a .
2423

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


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

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

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

(V, E). There’s only one Extreme SuperHyperEdge E ∈ EESHG:(V,E) has only the maximum 2436
possibilities of the distinct interior Extreme SuperHyperVertices inside of any given Extreme 2437
quasi-R-Unequal Connective Dominating minus all Extreme SuperHypeNeighbor to some of them but not 2438
all of them. In other words, there’s only an unique Extreme SuperHyperEdge E ∈ EESHG:(V,E) 2439
has only two distinct Extreme SuperHyperVertices in an Extreme quasi-R-Unequal Connective Dominating, 2440
minus all Extreme SuperHypeNeighbor to some of them but not all of them. 2441
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-Unequal Connective Dominating is at least
V \ (V \ {aE , bE , cE , . . . , zE }).
It’s straightforward that the Extreme cardinality of the Extreme R-Unequal Connective Dominating 2442
is at least the maximum Extreme number of Extreme SuperHyperVertices of the Extreme 2443
SuperHyperEdges with the maximum number of the Extreme SuperHyperEdges. In other words, 2444

SuperHyperUnequal Connective Dominating in the Extreme Example (42.0.3) 95NHG2
the maximum number of the Extreme SuperHyperEdges contains the maximum Extreme number 2445
of Extreme SuperHyperVertices are renamed to Extreme Unequal Connective Dominating in some cases 2446
but the maximum number of the Extreme SuperHyperEdge with the maximum Extreme number of 2447
Extreme SuperHyperVertices, has the Extreme SuperHyperVertices are contained in an Extreme 2448
R-Unequal Connective Dominating. 2449
Proposition 10.0.24. Assume a simple Extreme SuperHyperGraph ESHG : (V, E). Then the
Extreme number of type-result-R-Unequal Connective Dominating has, the least Extreme cardinality, the
lower sharp Extreme bound for Extreme cardinality, is the Extreme cardinality of
V \ V \ {aE , bE 0 , cE 00 , cE 000 }E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .
If there’s an Extreme type-result-R-Unequal Connective Dominating with the least Extreme cardinality, 2450
the lower sharp Extreme bound for cardinality. 2451
Proposition 10.0.25. Assume a connected loopless Extreme SuperHyperGraph ESHG : (V, E). 2452
Then in the worst case, literally, 2453
C(N SHG)ExtremeQuasi−U nequalConnectiveDominating

= {V1 , E1 , V2 , E2 , V3 , E3 , V4 , E4 , V1 }.
C(N SHG)ExtremeQuasi−U nequalConnectiveDominatingSuperHyperP olynomial = z 4 .
C(N SHG)ExtremeQuasi−U nequalConnectiveDominating = {V1 , V2 , V3 , V4 , V1 }.
C(N SHG)ExtremeR−Quasi−U nequalConnectiveDominatingSuperHyperP olynomial = z 5 .

Is an Extreme type-result-Unequal Connective Dominating. In other words, the least cardinality, the 2454
lower sharp bound for the cardinality, of an Extreme type-result-Unequal Connective Dominating is the 2455
cardinality of 2456

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

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

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

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

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

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

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

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

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

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

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

2458
Extreme R-Unequal Connective Dominating =

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

is fixed that means Ex = E ∈ EESHG:(V,E) . for all Extreme intended SuperHyperVertices but
in an Extreme Unequal Connective Dominating, Ex = E ∈ EESHG:(V,E) could be different and it’s
not unique. To sum them up, in a connected Extreme SuperHyperGraph ESHG : (V, E). If
an Extreme SuperHyperEdge E ∈ EESHG:(V,E) has z Extreme SuperHyperVertices, then the
Extreme cardinality of the Extreme R-Unequal Connective Dominating is at least
V \ (V \ {aE , bE , cE , . . . , zE }).
It’s straightforward that the Extreme cardinality of the Extreme R-Unequal Connective Dominating 2459
is at least the maximum Extreme number of Extreme SuperHyperVertices of the Extreme 2460
SuperHyperEdges with the maximum number of the Extreme SuperHyperEdges. In other 2461
words, the maximum number of the Extreme SuperHyperEdges contains the maximum Extreme 2462
number of Extreme SuperHyperVertices are renamed to Extreme Unequal Connective Dominating in 2463
some cases but the maximum number of the Extreme SuperHyperEdge with the maximum 2464
Extreme number of Extreme SuperHyperVertices, has the Extreme SuperHyperVertices are 2465
contained in an Extreme R-Unequal Connective Dominating. 2466
The obvious SuperHyperGraph has no Extreme SuperHyperEdges. But the non-obvious Extreme 2467
SuperHyperModel is up. The quasi-SuperHyperModel addresses some issues about the Extreme 2468
optimal SuperHyperObject. It specially delivers some remarks on the Extreme SuperHyperSet of 2469
the Extreme SuperHyperVertices such that there’s distinct amount of Extreme SuperHyperEdges 2470
for distinct amount of Extreme SuperHyperVertices up to all taken from that Extreme Super- 2471
HyperSet of the Extreme SuperHyperVertices but this Extreme SuperHyperSet of the Extreme 2472
SuperHyperVertices is either has the maximum Extreme SuperHyperCardinality or it doesn’t 2473

have maximum Extreme SuperHyperCardinality. In a non-obvious SuperHyperModel, there’s at 2474
least one Extreme SuperHyperEdge containing at least all Extreme SuperHyperVertices. Thus 2475
it forms an Extreme quasi-R-Unequal Connective Dominating where the Extreme completion of the 2476
Extreme incidence is up in that. Thus it’s, literarily, an Extreme embedded R-Unequal Connective 2477
Dominating. The SuperHyperNotions of embedded SuperHyperSet and quasi-SuperHyperSet coin- 2478
cide. In the original setting, these types of SuperHyperSets only don’t satisfy on the maximum 2479
SuperHyperCardinality. Thus the embedded setting is elected such that those SuperHyperSets 2480
have the maximum Extreme SuperHyperCardinality and they’re Extreme SuperHyperOptimal. 2481
The less than two distinct types of Extreme SuperHyperVertices are included in the minimum 2482
Extreme style of the embedded Extreme R-Unequal Connective Dominating. The interior types of the 2483
Extreme SuperHyperVertices are deciders. Since the Extreme number of SuperHyperNeighbors 2484
are only affected by the interior Extreme SuperHyperVertices. The common connections, more 2485
precise and more formal, the perfect unique connections inside the Extreme SuperHyperSet for 2486
any distinct types of Extreme SuperHyperVertices pose the Extreme R-Unequal Connective Dominating. 2487
Thus Extreme exterior SuperHyperVertices could be used only in one Extreme SuperHyperEdge 2488
and in Extreme SuperHyperRelation with the interior Extreme SuperHyperVertices in that 2489
Extreme SuperHyperEdge. In the embedded Extreme Unequal Connective Dominating, there’s the 2490
usage of exterior Extreme SuperHyperVertices since they’ve more connections inside more 2491

than outside. Thus the title “exterior” is more relevant than the title “interior”. One Extreme 2492
SuperHyperVertex has no connection, inside. Thus, the Extreme SuperHyperSet of the Extreme 2493
SuperHyperVertices with one SuperHyperElement has been ignored in the exploring to lead 2494
on the optimal case implying the Extreme R-Unequal Connective Dominating. The Extreme R-Unequal 2495
Connective Dominating with the exclusion of the exclusion of all Extreme SuperHyperVertices in one 2496
Extreme SuperHyperEdge and with other terms, the Extreme R-Unequal Connective Dominating with 2497
the inclusion of all Extreme SuperHyperVertices in one Extreme SuperHyperEdge, is an Extreme 2498
quasi-R-Unequal Connective Dominating. To sum them up, in a connected non-obvious Extreme Super- 2499
HyperGraph ESHG : (V, E). There’s only one Extreme SuperHyperEdge E ∈ EESHG:(V,E) has 2500
only the maximum possibilities of the distinct interior Extreme SuperHyperVertices inside of 2501
any given Extreme quasi-R-Unequal Connective Dominating minus all Extreme SuperHypeNeighbor to 2502
some of them but not all of them. In other words, there’s only an unique Extreme SuperHy- 2503
perEdge E ∈ EESHG:(V,E) has only two distinct Extreme SuperHyperVertices in an Extreme 2504
quasi-R-Unequal Connective Dominating, minus all Extreme SuperHypeNeighbor to some of them but 2505
not all of them. 2506
The main definition of the Extreme R-Unequal Connective Dominating has two titles. an Ex- 2507
treme quasi-R-Unequal Connective Dominating and its corresponded quasi-maximum Extreme R- 2508
SuperHyperCardinality are two titles in the terms of quasi-R-styles. For any Extreme number, 2509
there’s an Extreme quasi-R-Unequal Connective Dominating with that quasi-maximum Extreme Su- 2510
perHyperCardinality in the terms of the embedded Extreme SuperHyperGraph. If there’s an 2511
embedded Extreme SuperHyperGraph, then the Extreme quasi-SuperHyperNotions lead us to 2512
take the collection of all the Extreme quasi-R-Unequal Connective Dominatings for all Extreme numbers 2513
less than its Extreme corresponded maximum number. The essence of the Extreme Unequal 2514
Connective Dominating ends up but this essence starts up in the terms of the Extreme quasi-R-Unequal 2515
Connective Dominating, again and more in the operations of collecting all the Extreme quasi-R-Unequal 2516
Connective Dominatings acted on the all possible used formations of the Extreme SuperHyperGraph 2517
to achieve one Extreme number. This Extreme number is 2518
considered as the equivalence class for all corresponded quasi-R-Unequal Connective Dominatings. 2519
Let zExtreme Number , SExtreme SuperHyperSet and GExtreme Unequal Connective Dominating be an Extreme 2520
number, an Extreme SuperHyperSet and an Extreme Unequal Connective Dominating. Then 2521
[zExtreme Number ]Extreme Class = {SExtreme SuperHyperSet |

SExtreme SuperHyperSet = GExtreme Unequal Connective Dominating ,
|SExtreme SuperHyperSet |Extreme Cardinality
= zExtreme Number }.
As its consequences, the formal definition of the Extreme Unequal Connective Dominating is re-formalized 2522
and redefined as follows. 2523
GExtreme Unequal Connective Dominating ∈ ∪zExtreme Number

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

To get more precise perceptions, the follow-up expressions propose another formal technical 2524
definition for the Extreme Unequal Connective Dominating. 2525
GExtreme Unequal Connective Dominating =

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

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

= max zExtreme Number

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


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


2531

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

2532


2533


Now, the extension of these types of approaches is up. Since the new term, “Extreme Super- 2534
HyperNeighborhood”, could be redefined as the collection of the Extreme SuperHyperVertices 2535
such that any amount of its Extreme SuperHyperVertices are incident to an Extreme Supe- 2536
rHyperEdge. It’s, literarily, another name for “Extreme Quasi-Unequal Connective Dominating” but, 2537
precisely, it’s the generalization of “Extreme Quasi-Unequal Connective Dominating” since “Extreme 2538
Quasi-Unequal Connective Dominating” happens “Extreme Unequal Connective Dominating” in an Extreme 2539
SuperHyperGraph as initial framework and background but “Extreme SuperHyperNeighbor- 2540
hood” may not happens “Extreme Unequal Connective Dominating” in an Extreme SuperHyperGraph 2541
as initial framework and preliminarily background since there are some ambiguities about the 2542
Extreme SuperHyperCardinality arise from it. To get orderly keywords, the terms, “Extreme 2543
SuperHyperNeighborhood”, “Extreme Quasi-Unequal Connective Dominating”, and “Extreme Unequal 2544
Connective Dominating” are up. 2545

Thus, let 2546
zExtreme Number , NExtreme SuperHyperNeighborhood and 2547
GExtreme Unequal Connective Dominating be an Extreme number, an Extreme SuperHyperNeighbor- 2548
hood and an Extreme Unequal Connective Dominating and the new terms are up. 2549
GExtreme Unequal Connective Dominating ∈ ∪zExtreme Number

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

|NExtreme SuperHyperNeighborhood |Extreme Cardinality

2550

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

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

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

2554

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


2555


2556


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

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

perHyperVertices such that there’s no an Extreme SuperHyperEdge amid some Extreme
SuperHyperVertices instead of all given by

Extreme Unequal Connective Dominating is related to the Extreme SuperHyperSet of the Extreme
SuperHyperVertices,
There’s not only one Extreme SuperHyperVertex inside the intended Extreme SuperHyperSet.
Thus the non-obvious Extreme Unequal Connective Dominating is up. The obvious simple Extreme
type-SuperHyperSet called the Extreme Unequal Connective Dominating is an Extreme SuperHyperSet
includes only one Extreme SuperHyperVertex. But the Extreme SuperHyperSet of Extreme
SuperHyperVertices,
doesn’t have less than two SuperHyperVertices inside the intended Extreme SuperHyperSet
since they’ve come from at least so far an SuperHyperEdge. Thus the non-obvious simple
Extreme type-SuperHyperSet of the Extreme R-Unequal Connective Dominating is up. To sum them
up, the Extreme SuperHyperSet of Extreme SuperHyperVertices,
Is the non-obvious simple Extreme type-SuperHyperSet of the Extreme R-Unequal Connective

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

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

Is the Extreme SuperHyperSet, not:
does includes only less than two SuperHyperVertices in a connected Extreme SuperHyperGraph 2557
ESHG : (V, E) but it’s impossible in the case, they’ve corresponded to an SuperHyperEdge. 2558
It’s interesting to mention that the only non-obvious simple Extreme type-SuperHyperSet called 2559
the 2560
“Extreme R-Unequal Connective Dominating” 2561
amid those obvious[non-obvious] simple Extreme type-SuperHyperSets called the 2562
Extreme R-Unequal Connective Dominating, 2563
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-Unequal Connective Dominating amid those obvious simple Extreme type-SuperHyperSets
of the Extreme Unequal Connective Dominating, are
In a connected Extreme SuperHyperGraph ESHG : (V, E).

To sum them up, assume a connected loopless Extreme SuperHyperGraph ESHG : (V, E).
Then in the worst case, literally,
is an Extreme R-Unequal Connective Dominating. In other words, the least cardinality, the lower sharp
bound for the cardinality, of an Extreme R-Unequal Connective Dominating is the cardinality of
2564
To sum them up, in a connected Extreme SuperHyperGraph ESHG : (V, E). The all interior 2565
Extreme SuperHyperVertices belong to any Extreme quasi-R-Unequal Connective Dominating if for any 2566
of them, and any of other corresponded Extreme SuperHyperVertex, some interior Extreme 2567
SuperHyperVertices are mutually Extreme SuperHyperNeighbors with no Extreme exception at 2568
all minus all Extreme SuperHypeNeighbors to any amount of them. 2569
Assume a connected Extreme SuperHyperGraph ESHG : (V, E). Let an Extreme SuperHy- 2570
perEdge ESHE : E ∈ EESHG:(V,E) has some Extreme SuperHyperVertices r. Consider all 2571
Extreme numbers of those Extreme SuperHyperVertices from that Extreme SuperHyperEdge 2572
excluding excluding more than r distinct Extreme SuperHyperVertices, exclude to any given 2573

Extreme SuperHyperSet of the Extreme SuperHyperVertices. Consider there’s an Extreme R- 2574

with the least cardinality, the lower sharp Extreme bound for Extreme
Unequal Connective Dominating 2575
cardinality. Assume a connected Extreme SuperHyperGraph ESHG : (V, E). The Extreme 2576
SuperHyperSet of the Extreme SuperHyperVertices VESHE \ {z} is an Extreme SuperHyperSet 2577
S of the Extreme SuperHyperVertices such that there’s an Extreme SuperHyperEdge to have 2578
some Extreme SuperHyperVertices uniquely but it isn’t an Extreme R-Unequal Connective Dominating. 2579
Since it doesn’t have 2580

2581
the maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme SuperHy- 2582
perVertices such that there’s an Extreme SuperHyperEdge to have some SuperHyperVertices 2583
uniquely. The Extreme SuperHyperSet of the Extreme SuperHyperVertices VESHE ∪ {z} 2584
is the maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme Supe- 2585
rHyperVertices but it isn’t an Extreme R-Unequal Connective Dominating. Since it doesn’t do 2586
the Extreme procedure such that such that there’s an Extreme SuperHyperEdge to have 2587
some Extreme SuperHyperVertices uniquely [there are at least one Extreme SuperHyper- 2588
Vertex outside implying there’s, sometimes in the connected Extreme SuperHyperGraph 2589
ESHG : (V, E), an Extreme SuperHyperVertex, titled its Extreme SuperHyperNeighbor, to 2590
that Extreme SuperHyperVertex in the Extreme SuperHyperSet S so as S doesn’t do “the 2591
Extreme procedure”.]. There’s only one Extreme SuperHyperVertex outside the intended 2592
Extreme SuperHyperSet, VESHE ∪ {z}, in the terms of Extreme SuperHyperNeighborhood. 2593
Thus the obvious Extreme R-Unequal Connective Dominating, VESHE is up. The obvious simple Ex- 2594
treme type-SuperHyperSet of the Extreme R-Unequal Connective Dominating, VESHE , is an Extreme 2595
SuperHyperSet, VESHE , includes only all Extreme SuperHyperVertices does forms any kind of 2596
Extreme pairs are titled Extreme SuperHyperNeighbors in a connected Extreme SuperHyper- 2597
Graph ESHG : (V, E). Since the Extreme SuperHyperSet of the Extreme SuperHyperVertices 2598
VESHE , is the maximum Extreme SuperHyperCardinality of an Extreme SuperHyperSet 2599
S of Extreme SuperHyperVertices such that there’s an Extreme SuperHyperEdge to have 2600
some Extreme SuperHyperVertices uniquely. Thus, in a connected Extreme SuperHyperGraph 2601
ESHG : (V, E). Any Extreme R-Unequal Connective Dominating only contains all interior Extreme 2602
SuperHyperVertices and all exterior Extreme SuperHyperVertices from the unique Extreme 2603
SuperHyperEdge where there’s any of them has all possible Extreme SuperHyperNeighbors in 2604
and there’s all Extreme SuperHyperNeighborhoods in with no exception minus all Extreme 2605
SuperHypeNeighbors to some of them not all of them but everything is possible about Extreme 2606
SuperHyperNeighborhoods and Extreme SuperHyperNeighbors out. 2607
The SuperHyperNotion, namely, Unequal Connective Dominating, is up. There’s neither empty 2608
SuperHyperEdge nor loop SuperHyperEdge. The following Extreme SuperHyperSet of Ex- 2609
treme SuperHyperEdges[SuperHyperVertices] is the simple Extreme type-SuperHyperSet of 2610
the Extreme Unequal Connective Dominating. The Extreme SuperHyperSet of Extreme SuperHy- 2611
perEdges[SuperHyperVertices], 2612

|EESHG:(V,E) |Extreme Cardinality
b c
= {E2i−1 }i=1 2
.
C(N SHG)ExtremeQuasi−U nequalConnectiveDominatingSuperHyperP olynomial
= 2z b 2 c
.
C(N SHG)ExtremeR−Quasi−U nequalConnectiveDominating = {Vi }si=1 , {Vj }tj=1 .

C(N SHG)ExtremeR−Quasi−U nequalConnectiveDominatingSuperHyperP olynomial

= az s + bz t .
is the simple Extreme type-SuperHyperSet of the Extreme Unequal Connective Dominating. The 2613
Extreme SuperHyperSet of the Extreme SuperHyperEdges[SuperHyperVertices], 2614

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

ESHG : (V, E) is an Extreme type-SuperHyperSet with 2616
2617
the maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme Su- 2618
perHyperEdges[SuperHyperVertices] such that there’s no Extreme SuperHyperVertex of an 2619

Extreme SuperHyperEdge is common and there’s an Extreme SuperHyperEdge for all Extreme 2620
SuperHyperVertices. There are not only two Extreme SuperHyperVertices inside the intended 2621
Extreme SuperHyperSet. Thus the non-obvious Extreme Unequal Connective Dominating is up. The 2622
obvious simple Extreme type-SuperHyperSet called the Extreme Unequal Connective Dominating is an 2623
Extreme SuperHyperSet includes only two Extreme SuperHyperVertices. But the Extreme 2624
SuperHyperSet of the Extreme SuperHyperEdges[SuperHyperVertices], 2625

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Doesn’t have less than three SuperHyperVertices inside the intended Extreme SuperHyperSet. 2626
Thus the non-obvious simple Extreme type-SuperHyperSet of the Extreme Unequal Connective 2627
Dominating is up. To sum them up, the Extreme SuperHyperSet of the Extreme SuperHy- 2628

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 Unequal Connective Dominating. 2630
Since the Extreme SuperHyperSet of the Extreme SuperHyperEdges[SuperHyperVertices], 2631

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Is an Extreme Unequal Connective Dominating C(ESHG) for an Extreme SuperHyperGraph 2632
ESHG : (V, E) is the Extreme SuperHyperSet S of Extreme SuperHyperVertices such 2633

that there’s no an Extreme SuperHyperEdge for some Extreme SuperHyperVertices given by 2634
that Extreme type-SuperHyperSet called the Extreme Unequal Connective Dominating and it’s an 2635
Extreme Unequal Connective Dominating. Since it’s 2636
2637
the maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme Su- 2638
perHyperEdges[SuperHyperVertices] such that there’s no Extreme SuperHyperVertex of an 2639

Extreme SuperHyperEdge is common and there’s an Extreme SuperHyperEdge for all Extreme 2640
SuperHyperVertices. There aren’t only less than three Extreme SuperHyperVertices inside the 2641
intended Extreme SuperHyperSet, 2642

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Thus the non-obvious Extreme Unequal Connective Dominating , 2643

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 Unequal Connective Dominating, 2644
not: 2645

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

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 2647
ESHG : (V, E). It’s interesting to mention that the only non-obvious simple Extreme type- 2648
SuperHyperSet called the 2649
“Extreme Unequal Connective Dominating ” 2650
amid those obvious[non-obvious] simple Extreme type-SuperHyperSets called the 2651
Extreme ,
Unequal Connective Dominating 2652

is only and only 2653

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

CHAPTER 11 2655
The Extreme Departures on The 2656
Theoretical Results Toward Theoretical 2657
Motivations 2658
The previous Extreme approach apply on the upcoming Extreme results on Extreme 2659
SuperHyperClasses. 2660
Proposition 11.0.1. Assume a connected Extreme SuperHyperPath ESHP : (V, E). Then 2661

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

perUnequal Connective Dominating in the Example (42.0.5) 136NSHG18a
...,
EXT ERN AL
E |EN SHG | , V |EN SHG |
3 3
be a longest path taken from a connected Extreme SuperHyperPath ESHP : (V, E). There’s a 2664
new way to redefine as 2665
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 2666
to ViEXT ERN AL in the literatures of SuperHyperUnequal Connective Dominating. The latter is 2667
straightforward. 2668
136EXM18a Example 11.0.2. In the Figure (31.1), the connected Extreme SuperHyperPath ESHP : (V, E), 2669
is highlighted and featured. The Extreme SuperHyperSet, in the Extreme SuperHyperModel 2670
(31.1), is the SuperHyperUnequal Connective Dominating. 2671
Proposition 11.0.3. Assume a connected Extreme SuperHyperCycle ESHC : (V, E). Then 2672

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

136EXM19a Example 11.0.4. In the Figure (31.2), the connected Extreme SuperHyperCycle N SHC : 2680
(V, E), is highlighted and featured. The obtained Extreme SuperHyperSet, in the Extreme 2681
SuperHyperModel (31.2), is the Extreme SuperHyperUnequal Connective Dominating. 2682

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

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

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

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

SuperHyperUnequal Connective Dominating in the Extreme Example (42.0.9) 136NSHG20a
be a longest path taken a connected Extreme SuperHyperStar ESHS : (V, E). There’s a new 2686
way to redefine as 2687

136EXM20a Example 11.0.6. In the Figure (31.3), the connected Extreme SuperHyperStar ESHS : (V, E), 2691
is highlighted and featured. The obtained Extreme SuperHyperSet, by the Algorithm in previous 2692
Extreme result, of the Extreme SuperHyperVertices of the connected Extreme SuperHyperStar 2693
ESHS : (V, E), in the Extreme SuperHyperModel (31.3), is the Extreme SuperHyperUnequal 2694
Connective Dominating. 2695
Proposition 11.0.7. Assume a connected Extreme SuperHyperBipartite ESHB : (V, E). Then 2696

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


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

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

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

Extreme SuperHyperUnequal Connective Dominating in the Example (42.0.11) 136NSHG21a
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
The latter is straightforward. 2710
136EXM21a Example 11.0.8. In the Extreme Figure (31.4), the connected Extreme SuperHyperBipartite 2711
ESHB : (V, E), is Extreme highlighted and Extreme featured. The obtained Extreme 2712
SuperHyperSet, by the Extreme Algorithm in previous Extreme result, of the Extreme 2713
SuperHyperVertices of the connected Extreme SuperHyperBipartite ESHB : (V, E), in the 2714
Extreme SuperHyperModel (31.4), is the Extreme SuperHyperUnequal Connective Dominating. 2715
Proposition 11.0.9. Assume a connected Extreme SuperHyperMultipartite ESHM : (V, E). 2716
Then 2717

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

=z 2i+2 i=0 .
Proof. Let 2718
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
j N SHG
2719
P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
...,
EXT ERN AL
j N SHG
Multipartite ESHM : (V, E). There’s a new way to redefine as 2721

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

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

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

SuperHyperUnequal Connective Dominating in the Example (42.0.13) 136NSHG22a
136EXM22a Example 11.0.10. In the Figure (31.5), the connected Extreme SuperHyperMultipartite 2733
ESHM : (V, E), is highlighted and Extreme featured. The obtained Extreme SuperHyperSet, by 2734
the Algorithm in previous Extreme result, of the Extreme SuperHyperVertices of the connected 2735
Extreme SuperHyperMultipartite ESHM : (V, E), in the Extreme SuperHyperModel (31.5), is 2736
the Extreme SuperHyperUnequal Connective Dominating. 2737
Proposition 11.0.11. Assume a connected Extreme SuperHyperWheel ESHW : (V, E ∪ E ∗ ). 2738

Then, 2739

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

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

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

straightforward. Then there’s at least one SuperHyperUnequal Connective Dominating. Thus the 2746
notion of quasi isn’t up and the SuperHyperNotions based on SuperHyperUnequal Connective 2747
Dominating could be applied. The unique embedded SuperHyperUnequal Connective Dominating proposes 2748
some longest SuperHyperUnequal Connective Dominating excerpt from some representatives. The latter 2749
is straightforward. 2750
136EXM23a Example 11.0.12. In the Extreme Figure (31.6), the connected Extreme SuperHyperWheel 2751
N SHW : (V, E), is Extreme highlighted and featured. The obtained Extreme SuperHyperSet, 2752
by the Algorithm in previous result, of the Extreme SuperHyperVertices of the connected 2753
Extreme SuperHyperWheel ESHW : (V, E), in the Extreme SuperHyperModel (31.6), is the 2754
Extreme SuperHyperUnequal Connective Dominating. 2755

CHAPTER 12 2756
The Surveys of Mathematical Sets On 2757
The Results But As The Initial Motivation 2758
For the SuperHyperUnequal Connective Dominating, Extreme SuperHyperUnequal Connective Dominating, and 2759
the Extreme SuperHyperUnequal Connective Dominating, some general results are introduced. 2760
Remark 12.0.1. Let remind that the Extreme SuperHyperUnequal Connective Dominating is “redefined” 2761
on the positions of the alphabets. 2762
Corollary 12.0.2. Assume Extreme SuperHyperUnequal Connective Dominating. Then 2763
Extreme SuperHyperU nequalConnectiveDominating =

{theSuperHyperU nequalConnectiveDominatingof theSuperHyperV ertices |
max |SuperHyperOf f ensive
SuperHyperU nequalConnectiveDominating
|ExtremecardinalityamidthoseSuperHyperU nequalConnectiveDominating. }
plus one Extreme SuperHypeNeighbor to one. Where σi is the unary operation on the 2764
SuperHyperVertices of the SuperHyperGraph to assign the determinacy, the indeterminacy 2765
and the neutrality, for i = 1, 2, 3, respectively. 2766
Corollary 12.0.3. Assume an Extreme SuperHyperGraph on the same identical letter of the 2767
alphabet. Then the notion of Extreme SuperHyperUnequal Connective Dominating and SuperHyperUnequal 2768
Connective Dominating coincide. 2769
alphabet. Then a consecutive sequence of the SuperHyperVertices is an Extreme SuperHyperUnequal 2771
Connective Dominating if and only if it’s a SuperHyperUnequal Connective Dominating. 2772
alphabet. Then a consecutive sequence of the SuperHyperVertices is a strongest SuperHyperUnequal 2774
Connective Dominating if and only if it’s a longest SuperHyperUnequal Connective Dominating. 2775
Corollary 12.0.6. Assume SuperHyperClasses of an Extreme SuperHyperGraph on the same 2776
identical letter of the alphabet. Then its Extreme SuperHyperUnequal Connective Dominating is its 2777
SuperHyperUnequal Connective Dominating and reversely. 2778
129
Corollary 12.0.7. Assume an Extreme SuperHyperPath(-/SuperHyperUnequal Connective Dominating, 2779

SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel) on the same 2780
identical letter of the alphabet. Then its Extreme SuperHyperUnequal Connective Dominating is its 2781
Corollary 12.0.8. Assume an Extreme SuperHyperGraph. Then its Extreme SuperHyperUnequal 2783
isn’t well-defined if and only if its SuperHyperUnequal Connective Dominating isn’t
well-defined. 2785
Corollary 12.0.9. Assume SuperHyperClasses of an Extreme SuperHyperGraph. Then its 2786

Extreme SuperHyperUnequal Connective Dominating isn’t well-defined if and only if its SuperHyperUnequal 2787
Connective Dominating isn’t well-defined. 2788

SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). Then its 2790
Extreme SuperHyperUnequal Connective Dominating isn’t well-defined if and only if its SuperHyperUnequal 2791
Connective Dominating isn’t well-defined. 2792
Corollary 12.0.11. Assume an Extreme SuperHyperGraph. Then its Extreme SuperHyperUnequal 2793
is well-defined if and only if its SuperHyperUnequal Connective Dominating is well-
defined. 2795
Corollary 12.0.12. Assume SuperHyperClasses of an Extreme SuperHyperGraph. Then its 2796
Extreme SuperHyperUnequal Connective Dominating is well-defined if and only if its SuperHyperUnequal 2797
Connective Dominating is well-defined. 2798
SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). Then its 2800

Extreme SuperHyperUnequal Connective Dominating is well-defined if and only if its SuperHyperUnequal 2801
Connective Dominating is well-defined. 2802
Proposition 12.0.14. Let ESHG : (V, E) be an Extreme SuperHyperGraph. Then V is 2803
(i) : the dual SuperHyperDefensive SuperHyperUnequal Connective Dominating; 2804
(ii) : the strong dual SuperHyperDefensive SuperHyperUnequal Connective Dominating; 2805
(iii) : the connected dual SuperHyperDefensive SuperHyperUnequal Connective Dominating; 2806
(iv) : the δ-dual SuperHyperDefensive SuperHyperUnequal Connective Dominating; 2807
(v) : the strong δ-dual SuperHyperDefensive SuperHyperUnequal Connective Dominating; 2808
(vi) : the connected δ-dual SuperHyperDefensive SuperHyperUnequal Connective Dominating. 2809
Proposition 12.0.15. Let N T G : (V, E, σ, µ) be an Extreme SuperHyperGraph. Then ∅ is 2810
(i) : the SuperHyperDefensive SuperHyperUnequal Connective Dominating; 2811
(ii) : the strong SuperHyperDefensive SuperHyperUnequal Connective Dominating; 2812
(iii) : the connected defensive SuperHyperDefensive SuperHyperUnequal Connective Dominating; 2813
(iv) : the δ-SuperHyperDefensive SuperHyperUnequal Connective Dominating; 2814

(v) : the strong δ-SuperHyperDefensive SuperHyperUnequal Connective Dominating; 2815
(vi) : the connected δ-SuperHyperDefensive SuperHyperUnequal Connective Dominating. 2816
Proposition 12.0.16. Let ESHG : (V, E) be an Extreme SuperHyperGraph. Then an 2817

independent SuperHyperSet is 2818
(iii) : the connected SuperHyperDefensive SuperHyperUnequal Connective Dominating; 2821
Proposition 12.0.17. Let ESHG : (V, E) be an Extreme SuperHyperUniform SuperHyperGraph 2825

which is a SuperHyperUnequal Connective Dominating/SuperHyperPath. Then V is a maximal 2826
(i) : SuperHyperDefensive SuperHyperUnequal Connective Dominating; 2827
(ii) : strong SuperHyperDefensive SuperHyperUnequal Connective Dominating; 2828
(iii) : connected SuperHyperDefensive SuperHyperUnequal Connective Dominating; 2829
(iv) : O(ESHG)-SuperHyperDefensive SuperHyperUnequal Connective Dominating; 2830
(v) : strong O(ESHG)-SuperHyperDefensive SuperHyperUnequal Connective Dominating; 2831
(vi) : connected O(ESHG)-SuperHyperDefensive SuperHyperUnequal Connective Dominating; 2832
Where the exterior SuperHyperVertices and the interior SuperHyperVertices coincide. 2833
Proposition 12.0.18. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is a 2834
SuperHyperUniform SuperHyperWheel. Then V is a maximal 2835
(i) : dual SuperHyperDefensive SuperHyperUnequal Connective Dominating; 2836
(ii) : strong dual SuperHyperDefensive SuperHyperUnequal Connective Dominating; 2837
(iii) : connected dual SuperHyperDefensive SuperHyperUnequal Connective Dominating; 2838
(iv) : O(ESHG)-dual SuperHyperDefensive SuperHyperUnequal Connective Dominating; 2839
(v) : strong O(ESHG)-dual SuperHyperDefensive SuperHyperUnequal Connective Dominating; 2840
(vi) : connected O(ESHG)-dual SuperHyperDefensive SuperHyperUnequal Connective Dominating; 2841
which is a SuperHyperUnequal Connective Dominating/SuperHyperPath. Then the number of 2844

(i) : the SuperHyperUnequal Connective Dominating; 2845
(ii) : the SuperHyperUnequal Connective Dominating; 2846
(iii) : the connected SuperHyperUnequal Connective Dominating; 2847
(iv) : the O(ESHG)-SuperHyperUnequal Connective Dominating; 2848
(v) : the strong O(ESHG)-SuperHyperUnequal Connective Dominating; 2849
(vi) : the connected O(ESHG)-SuperHyperUnequal Connective Dominating. 2850
is one and it’s only V. Where the exterior SuperHyperVertices and the interior SuperHyperVertices 2851
coincide. 2852

which is a SuperHyperWheel. Then the number of 2854
(i) : the dual SuperHyperUnequal Connective Dominating; 2855
(ii) : the dual SuperHyperUnequal Connective Dominating; 2856
(iii) : the dual connected SuperHyperUnequal Connective Dominating; 2857
(iv) : the dual O(ESHG)-SuperHyperUnequal Connective Dominating; 2858
(v) : the strong dual O(ESHG)-SuperHyperUnequal Connective Dominating; 2859
(vi) : the connected dual O(ESHG)-SuperHyperUnequal Connective Dominating. 2860
coincide. 2862

which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperComplete 2864
SuperHyperMultipartite. Then a SuperHyperSet contains [the SuperHyperCenter and] the half of 2865
multiplying r with the number of all the SuperHyperEdges plus one of all the SuperHyperVertices 2866
is a 2867
O(ESHG)
(iv) : 2 + 1-dual SuperHyperDefensive SuperHyperUnequal Connective Dominating; 2871
O(ESHG)
(v) : strong 2 + 1-dual SuperHyperDefensive SuperHyperUnequal Connective Dominating; 2872
O(ESHG)
(vi) : connected 2 + 1-dual SuperHyperDefensive SuperHyperUnequal Connective Dominating. 2873


SuperHyperMultipartite. Then a SuperHyperSet contains the half of multiplying r with the 2876
number of all the SuperHyperEdges plus one of all the SuperHyperVertices in the biggest 2877
SuperHyperPart is a 2878
(iv) : δ-SuperHyperDefensive SuperHyperUnequal Connective Dominating; 2882
(v) : strong δ-SuperHyperDefensive SuperHyperUnequal Connective Dominating; 2883
(vi) : connected δ-SuperHyperDefensive SuperHyperUnequal Connective Dominating. 2884

SuperHyperMultipartite. Then Then the number of 2887
O(ESHG)
O(ESHG)
O(ESHG)
is one and it’s only S, a SuperHyperSet contains [the SuperHyperCenter and] the half of 2894
multiplying r with the number of all the SuperHyperEdges plus one of all the SuperHyperVertices. 2895
Proposition 12.0.24. Let ESHG : (V, E) be an Extreme SuperHyperGraph. The number of 2897
connected component is |V − S| if there’s a SuperHyperSet which is a dual 2898
(iv) : SuperHyperUnequal Connective Dominating; 2902
(v) : strong 1-SuperHyperDefensive SuperHyperUnequal Connective Dominating; 2903
(vi) : connected 1-SuperHyperDefensive SuperHyperUnequal Connective Dominating. 2904

Proposition 12.0.25. Let ESHG : (V, E) be an Extreme SuperHyperGraph. Then the number 2905
is at most O(ESHG) and the Extreme number is at most On (ESHG). 2906
Proposition 12.0.26. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is 2907
SuperHyperComplete. The number is O(ESHG:(V,E)) 2 + 1 and the Extreme number is 2908

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

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

2 + 1)-SuperHyperDefensive SuperHyperUnequal Connective Dominating. 2915
Proposition 12.0.27. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is ∅. The 2916
number is 0 and the Extreme number is 0, for an independent SuperHyperSet in the setting of 2917
dual 2918
(iv) : 0-SuperHyperDefensive SuperHyperUnequal Connective Dominating; 2922
Proposition 12.0.28. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is SuperHy- 2925
perComplete. Then there’s no independent SuperHyperSet. 2926
Proposition 12.0.29. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is Super- 2927
HyperUnequal Connective Dominating/SuperHyperPath/SuperHyperWheel. The number is O(ESHG : 2928
(V, E)) and the Extreme number is On (ESHG : (V, E)), in the setting of a dual 2929
(iv) : O(ESHG : (V, E))-SuperHyperDefensive SuperHyperUnequal Connective Dominating; 2933
(v) : strong O(ESHG : (V, E))-SuperHyperDefensive SuperHyperUnequal Connective Dominating; 2934
(vi) : connected O(ESHG : (V, E))-SuperHyperDefensive SuperHyperUnequal Connective Dominating. 2935

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


Proposition 12.0.31. Let N SHF : (V, E) be a SuperHyperFamily of the ESHGs : (V, E) 2946
Extreme SuperHyperGraphs which are from one-type SuperHyperClass which the result is obtained 2947
for the individuals. Then the results also hold for the SuperHyperFamily N SHF : (V, E) of 2948
these specific SuperHyperClasses of the Extreme SuperHyperGraphs. 2949
Proposition 12.0.32. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph. If S is a dual 2950
SuperHyperDefensive SuperHyperUnequal Connective Dominating, then ∀v ∈ V \ S, ∃x ∈ S such that 2951
(i) v ∈ Ns (x); 2952
(ii) vx ∈ E. 2953
Proposition 12.0.33. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph. If S is a dual 2954
SuperHyperDefensive SuperHyperUnequal Connective Dominating, then 2955
(i) S is SuperHyperUnequal Connective Dominating set; 2956
(ii) there’s S ⊆ S 0 such that |S 0 | is SuperHyperChromatic number. 2957
Proposition 12.0.34. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph. Then 2958
(i) Γ ≤ O; 2959
(ii) Γs ≤ On . 2960
Proposition 12.0.35. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph which is 2961
connected. Then 2962
(i) Γ ≤ O − 1; 2963
(ii) Γs ≤ On − Σ3i=1 σi (x). 2964
Proposition 12.0.36. Let ESHG : (V, E) be an odd SuperHyperPath. Then 2965
(i) the SuperHyperSet S = {v2 , v4 , · · · , vn−1 } is a dual SuperHyperDefensive SuperHyperUnequal 2966
Connective Dominating; 2967

(ii) Γ = b n2 c + 1 and corresponded SuperHyperSet is S = {v2 , v4 , · · · , vn−1 }; 2968
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· ,vn−1 } Σ3i=1 σi (s)}; 2969
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn−1 } and S2 = {v1 , v3 , · · · , vn−1 } are only a dual 2970
Proposition 12.0.37. Let ESHG : (V, E) be an even SuperHyperPath. Then 2972
(i) the set S = {v2 , v4 , · · · .vn } is a dual SuperHyperDefensive SuperHyperUnequal Connective 2973
Dominating; 2974
(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · .vn } and {v1 , v3 , · · · .vn−1 }; 2975
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 2976
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 2977
Proposition 12.0.38. Let ESHG : (V, E) be an even SuperHyperUnequal Connective Dominating. Then 2979
(i) the SuperHyperSet S = {v2 , v4 , · · · , vn } is a dual SuperHyperDefensive SuperHyperUnequal 2980
(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · , vn } and {v1 , v3 , · · · , vn−1 }; 2982
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } σ(s), Σs∈S={v1 ,v3 ,··· ,vn−1 } σ(s)}; 2983
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn } and S2 = {v1 , v3 , · · · , vn−1 } are only dual 2984
Proposition 12.0.39. Let ESHG : (V, E) be an odd SuperHyperUnequal Connective Dominating. Then 2986

(iii) Γs = min{Σs∈S={v2 ,v4 ,··· .vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 2990
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn−1 } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 2991
Proposition 12.0.40. Let ESHG : (V, E) be SuperHyperStar. Then 2993
(i) the SuperHyperSet S = {c} is a dual maximal SuperHyperUnequal Connective Dominating; 2994
(ii) Γ = 1; 2995
(iii) Γs = Σ3i=1 σi (c); 2996
(iv) the SuperHyperSets S = {c} and S ⊂ S 0 are only dual SuperHyperUnequal Connective Dominating. 2997
Proposition 12.0.41. Let ESHG : (V, E) be SuperHyperWheel. Then 2998

6+3(i−1)≤n
(i) the SuperHyperSet S = {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is a dual maximal 2999
SuperHyperDefensive SuperHyperUnequal Connective Dominating; 3000
6+3(i−1)≤n
(ii) Γ = |{v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 |; 3001
(iii) Γs = Σ{v1 ,v3 }∪{v6 ,v9 ··· ,vi+6 ,··· ,vn }6+3(i−1)≤n Σ3i=1 σi (s); 3002
i=1
6+3(i−1)≤n
(iv) the SuperHyperSet {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is only a dual maximal 3003
SuperHyperDefensive SuperHyperUnequal Connective Dominating. 3004
Proposition 12.0.42. Let ESHG : (V, E) be an odd SuperHyperComplete. Then 3005
b n c+1
(i) the SuperHyperSet S = {vi }i=1
2
is a dual SuperHyperDefensive SuperHyperUnequal Connective 3006
Dominating; 3007
(ii) Γ = b n2 c + 1; 3008
(iii) Γs = min{Σs∈S Σ3i=1 σi (s)} 2

b n c+1 ; 3009
S={vi }i=1
b n c+1
(iv) the SuperHyperSet S = {vi }i=1
2
is only a dual SuperHyperDefensive SuperHyperUnequal 3010
Proposition 12.0.43. Let ESHG : (V, E) be an even SuperHyperComplete. Then 3012
bnc
2
Dominating; 3014
(ii) Γ = b n2 c; 3015

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

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

Connective Dominating for N SHF; 3022
(ii) Γ = m for N SHF : (V, E); 3023
(iii) Γs = Σm 3
i=1 Σj=1 σj (ci ) for N SHF : (V, E); 3024
(iv) the SuperHyperSets S = {c1 , c2 , · · · , cm } and S ⊂ S 0 are only dual SuperHyperUnequal 3025
Connective Dominating for N SHF : (V, E). 3026
Proposition 12.0.45. Let N SHF : (V, E) be an m-SuperHyperFamily of odd SuperHyperCom- 3027
plete SuperHyperGraphs with common Extreme SuperHyperVertex SuperHyperSet. Then 3028

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

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

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

2
for N SHF : (V, E); 3040
S={vi }i=1
bnc
2
are only dual maximal SuperHyperUnequal Connective Dominating 3041
for N SHF : (V, E). 3042
following statements hold; 3044
(i) if s ≥ t and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 3045

SuperHyperUnequal Connective Dominating, then S is an s-SuperHyperDefensive SuperHyperUnequal 3046
(ii) if s ≤ t and a SuperHyperSet S of SuperHyperVertices is a dual t-SuperHyperDefensive Su- 3048

perHyperUnequal Connective Dominating, then S is a dual s-SuperHyperDefensive SuperHyperUnequal 3049
(i) if s ≥ t + 2 and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 3053
SuperHyperUnequal Connective Dominating, then S is an s-SuperHyperPowerful SuperHyperUnequal 3054


perHyperUnequal Connective Dominating, then S is a dual s-SuperHyperPowerful SuperHyperUnequal 3057
Proposition 12.0.49. Let ESHG : (V, E) be a[an] [V-]SuperHyperUniform-strong-Extreme 3059

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

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

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

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

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

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

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

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


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

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


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

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

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


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

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

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


CHAPTER 13 3119
Extreme Applications in Cancer’s 3120
Extreme Recognition 3121
The cancer is the Extreme disease but the Extreme model is going to figure out what’s going on 3122
this Extreme phenomenon. The special Extreme case of this Extreme disease is considered and 3123
as the consequences of the model, some parameters are used. The cells are under attack of this 3124
disease but the moves of the cancer in the special region are the matter of mind. The Extreme 3125
recognition of the cancer could help to find some Extreme treatments for this Extreme disease. 3126
In the following, some Extreme steps are Extreme devised on this disease. 3127
Step 1. (Extreme Definition) The Extreme recognition of the cancer in the long-term Extreme 3128
function. 3129
Step 2. (Extreme Issue) The specific region has been assigned by the Extreme model [it’s 3130
called Extreme SuperHyperGraph] and the long Extreme cycle of the move from the cancer 3131
is identified by this research. Sometimes the move of the cancer hasn’t be easily identified 3132
since there are some determinacy, indeterminacy and neutrality about the moves and the 3133
effects of the cancer on that region; this event leads us to choose another model [it’s said 3134
to be Extreme SuperHyperGraph] to have convenient perception on what’s happened and 3135
what’s done. 3136
Step 3. (Extreme Model) There are some specific Extreme models, which are well-known and 3137
they’ve got the names, and some general Extreme models. The moves and the Extreme 3138
traces of the cancer on the complex tracks and between complicated groups of cells could 3139
be fantasized by an Extreme SuperHyperPath(-/SuperHyperUnequal Connective Dominating, 3140
SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The 3141
aim is to find either the Extreme SuperHyperUnequal Connective Dominating or the Extreme 3142
SuperHyperUnequal Connective Dominating in those Extreme Extreme SuperHyperModels. 3143
141
CHAPTER 14 3144
Case 1: The Initial Extreme Steps 3145
Toward Extreme SuperHyperBipartite 3146
as Extreme SuperHyperModel 3147
Step 4. (Extreme Solution) In the Extreme Figure (34.1), the Extreme SuperHyperBipartite 3148
is Extreme highlighted and Extreme featured. 3149
By using the Extreme Figure (34.1) and the Table (34.1), the Extreme SuperHyperBi- 3150
partite is obtained. 3151
The obtained Extreme SuperHyperSet, by the Extreme Algorithm in previous Extreme 3152
Figure 14.1: an Extreme SuperHyperBipartite Associated to the Notions of Extreme

SuperHyperUnequal Connective Dominating 136NSHGaa21aa
143
Belong to The Extreme SuperHyperBipartite

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

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

CHAPTER 15 3156
Case 2: The Increasing Extreme Steps 3157
Toward Extreme 3158
SuperHyperMultipartite as Extreme 3159
SuperHyperModel 3160
Step 4. (Extreme Solution) In the Extreme Figure (35.1), the Extreme SuperHyperMultipart- 3161
ite is Extreme highlighted and Extreme featured. 3162
By using the Extreme Figure (35.1) and the Table (35.1), the Extreme SuperHyperMulti- 3163
partite is obtained. 3164
The obtained Extreme SuperHyperSet, by the Extreme Algorithm in previous result, 3165
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 3166

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

CHAPTER 16 3169
Wondering Open Problems But As The 3170
Directions To Forming The Motivations 3171
In what follows, some “problems” and some “questions” are proposed. 3172
The SuperHyperUnequal Connective Dominating and the Extreme SuperHyperUnequal Connective Dominating 3173
are defined on a real-world application, titled “Cancer’s Recognitions”. 3174
Question 16.0.1. Which the else SuperHyperModels could be defined based on Cancer’s 3175
recognitions? 3176
Question 16.0.2. Are there some SuperHyperNotions related to SuperHyperUnequal Connective 3177
and the Extreme SuperHyperUnequal Connective Dominating?
Dominating 3178
Question 16.0.3. Are there some Algorithms to be defined on the SuperHyperModels to compute 3179
them? 3180
Question 16.0.4. Which the SuperHyperNotions are related to beyond the SuperHyperUnequal 3181
and the Extreme SuperHyperUnequal Connective Dominating?
Problem 16.0.5. The SuperHyperUnequal Connective Dominating and the Extreme SuperHyperUnequal 3183
do a SuperHyperModel for the Cancer’s recognitions and they’re based on
SuperHyperUnequal Connective Dominating, are there else? 3185
Problem 16.0.6. Which the fundamental SuperHyperNumbers are related to these SuperHyper- 3186
Numbers types-results? 3187
Problem 16.0.7. What’s the independent research based on Cancer’s recognitions concerning 3188
the multiple types of SuperHyperNotions? 3189
147
CHAPTER 17 3190
Conclusion and Closing Remarks 3191
In this section, concluding remarks and closing remarks are represented. The drawbacks of this 3192
research are illustrated. Some benefits and some advantages of this research are highlighted. 3193
This research uses some approaches to make Extreme SuperHyperGraphs more understandable. 3194
In this endeavor, two SuperHyperNotions are defined on the SuperHyperUnequal Connective 3195
Dominating. For that sake in the second definition, the main definition of the Extreme 3196
SuperHyperGraph is redefined on the position of the alphabets. Based on the new definition 3197
for the Extreme SuperHyperGraph, the new SuperHyperNotion, Extreme SuperHyperUnequal 3198
Connective Dominating, finds the convenient background to implement some results based on that. 3199
Some SuperHyperClasses and some Extreme SuperHyperClasses are the cases of this research 3200
on the modeling of the regions where are under the attacks of the cancer to recognize this 3201
disease as it’s mentioned on the title “Cancer’s Recognitions”. To formalize the instances 3202
on the SuperHyperNotion, SuperHyperUnequal Connective Dominating, the new SuperHyperClasses 3203
and SuperHyperClasses, are introduced. Some general results are gathered in the section on 3204
the SuperHyperUnequal Connective Dominating and the Extreme SuperHyperUnequal Connective Dominating. 3205
The clarifications, instances and literature reviews have taken the whole way through. In this 3206
research, the literature reviews have fulfilled the lines containing the notions and the results. The 3207
Recognitions” and both bases are the background of this research. Sometimes the cancer has 3209
been happened on the region, full of cells, groups of cells and embedded styles. In this segment, 3210
the SuperHyperModel proposes some SuperHyperNotions based on the connectivities of the 3211
moves of the cancer in the longest and strongest styles with the formation of the design and the 3212
architecture are formally called “ SuperHyperUnequal Connective Dominating” in the themes of jargons 3213
out the background for the SuperHyperNotions. In the Table (37.1), benefits and avenues for 3215
this research are, figured out, pointed out and spoken out. 3216
149
Table 17.1: An Overlook On This Research And Beyond 136TBLTBL
Advantages Limitations
1. Redefining Extreme SuperHyperGraph 1. General Results
2. SuperHyperUnequal Connective Dominating
3. Extreme SuperHyperUnequal Connective Dominating 2. Other SuperHyperNumbers
4. Modeling of Cancer’s Recognitions
5. SuperHyperClasses 3. SuperHyperFamilies

CHAPTER 18 3217
Extreme SuperHyperDuality But As The 3218
Extensions Excerpt From Dense And 3219
Super Forms 3220
Definition 18.0.1. (Different Extreme Types of Extreme SuperHyperDuality). 3221

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

Va ∈ Ei , Ej ; 3225
(ii) Extreme re-SuperHyperDuality if ∀Ei ∈ E 0 , ∃Ej ∈ EESHG:(V,E) \ E 0 such that 3226
Va ∈ Ei , Ej and |Ei |Extreme CARDINALITY = |Ej |Extreme CARDINALITY ; 3227
(iii) Extreme v-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 3228
Vi , Vj ∈ Ea ; 3229
(iv) Extreme rv-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 3230
Vi , Vj ∈ Ea and |Vi |Extreme CARDINALITY = |Vj |Extreme CARDINALITY ; 3231
(v) Extreme SuperHyperDuality if it’s either of Extreme e-SuperHyperDuality, 3232
Extreme re-SuperHyperDuality, Extreme v-SuperHyperDuality, and Extreme rv- 3233

SuperHyperDuality. 3234
Definition 18.0.2. ((Extreme) SuperHyperDuality). 3235

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

SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3240
is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Extreme 3241
cardinality of the Extreme SuperHyperEdges in the consecutive Extreme sequence of 3242
Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 3243
Extreme SuperHyperDuality; 3244
151
(ii) a Extreme SuperHyperDuality if it’s either of Extreme e-SuperHyperDuality, Extreme 3245

re-SuperHyperDuality, Extreme v-SuperHyperDuality, and Extreme rv-SuperHyperDuality 3246
and C(N SHG) for a Extreme SuperHyperGraph N SHG : (V, E) is the maximum 3247
Extreme cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet 3248
S of high Extreme cardinality consecutive Extreme SuperHyperEdges and Extreme 3249
SuperHyperVertices such that they form the Extreme SuperHyperDuality; 3250
(iii) an Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of Extreme 3251

e-SuperHyperDuality, Extreme re-SuperHyperDuality, Extreme v-SuperHyperDuality, 3252
and Extreme rv-SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph 3253
N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients 3254
defined as the Extreme number of the maximum Extreme cardinality of the Extreme 3255
Extreme SuperHyperDuality; and the Extreme power is corresponded to its Extreme 3258
coefficient; 3259
(iv) a Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of Extreme 3260

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

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

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

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

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


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

SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality 3296
consecutive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 3297
form the Extreme SuperHyperDuality; and the Extreme power is corresponded to its 3298
Extreme coefficient. 3299
136EXM1 Example 18.0.3. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E) in the 3300
mentioned Extreme Figures in every Extreme items. 3301
• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperDu- 3302
ality, is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are some 3303
empty Extreme SuperHyperEdges but E2 is a loop Extreme SuperHyperEdge and E4 is 3304
an Extreme SuperHyperEdge. Thus in the terms of Extreme SuperHyperNeighbor, there’s 3305
only one Extreme SuperHyperEdge, namely, E4 . The Extreme SuperHyperVertex, V3 is 3306
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- 3310
Duality, is up. The Extreme Algorithm is Extremely straightforward. E1 , E2 and E3 3311
are some empty Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. 3312
Thus in the terms of Extreme SuperHyperNeighbor, there’s only one Extreme SuperHy- 3313
perEdge, namely, E4 . The Extreme SuperHyperVertex, V3 is Extreme isolated means that 3314
there’s no Extreme SuperHyperEdge has it as an Extreme endpoint. Thus the Extreme 3315
SuperHyperVertex, V3 , is excluded in every given Extreme SuperHyperDuality. 3316


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

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 3360
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 3363
ViEXT ERN AL in the literatures of SuperHyperDuality. The latter is straightforward. 3364
(31.1), is the SuperHyperDuality. 3367
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 3369
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3

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



ESHS : (V, E), in the Extreme SuperHyperModel (31.3), is the Extreme SuperHyperDuality. 3386
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 3388
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. 3392
Then there’s at least one SuperHyperDuality. Thus the notion of quasi isn’t up and the 3393
SuperHyperNotions based on SuperHyperDuality could be applied. There are only two 3394
SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as the 3395
representative in the 3396
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 : 3397

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

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

is a longest SuperHyperDuality taken from a connected Extreme SuperHyperMultipartite 3409

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

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

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

∃!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 3434
SuperHyperDuality proposes some longest SuperHyperDuality excerpt from some representatives. 3435
Extreme SuperHyperDuality. 3441

CHAPTER 19 3442
Extreme SuperHyperJoin But As The 3443
Super Forms 3445
Definition 19.0.1. (Different Extreme Types of Extreme SuperHyperJoin). 3446

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

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

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

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

Vi , Vj ∈ Ea ; ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; and |Vi |Extreme CARDINALITY = 3457
|Vj |Extreme CARDINALITY ; 3458
(v) Extreme SuperHyperJoin if it’s either of Extreme e-SuperHyperJoin, Extreme re- 3459
SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme rv-SuperHyperJoin. 3460
Definition 19.0.2. ((Extreme) SuperHyperJoin). 3461

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

re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme rv-SuperHyperJoin and 3465
C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme 3466
cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme 3467
SuperHyperEdges in the consecutive Extreme sequence of Extreme SuperHyperEdges and 3468
Extreme SuperHyperVertices such that they form the Extreme SuperHyperJoin; 3469
165
(ii) a Extreme SuperHyperJoin if it’s either of Extreme e-SuperHyperJoin, Extreme 3470

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

SuperHyperJoin, Extreme re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme 3477
rv-SuperHyperJoin and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3478
is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined as the 3479
Extreme number of the maximum Extreme cardinality of the Extreme SuperHyperEdges 3480
of an Extreme SuperHyperSet S of high Extreme cardinality consecutive Extreme 3481
SuperHyperEdges and Extreme SuperHyperVertices such that they form the Extreme 3482
SuperHyperJoin; and the Extreme power is corresponded to its Extreme coefficient; 3483
(iv) a Extreme SuperHyperJoin SuperHyperPolynomial if it’s either of Extreme e- 3484

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


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

C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum 3500
Extreme cardinality of the Extreme SuperHyperVertices of an Extreme SuperHyperSet 3501
SuperHyperVertices such that they form the Extreme SuperHyperJoin; 3503
(vii) an Extreme R-SuperHyperJoin SuperHyperPolynomial if it’s either of Extreme 3504
e-SuperHyperJoin, Extreme re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme 3505

Extreme number of the maximum Extreme cardinality of the Extreme SuperHyperVertices 3508

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

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

SuperHyperJoin. 3529
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 3531
Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. Thus in the terms of 3532
Extreme SuperHyperNeighbor, there’s only one Extreme SuperHyperEdge, namely, E4 . 3533
The Extreme SuperHyperVertex, V3 is Extreme isolated means that there’s no Extreme 3534
SuperHyperEdge has it as an Extreme endpoint. Thus the Extreme SuperHyperVertex, 3535
V3 , is excluded in every given Extreme SuperHyperJoin. 3536

is up. The Extreme Algorithm is Extremely straightforward. 3538


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

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

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


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

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



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

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

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


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

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

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

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

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

CHAPTER 20 3659
Extreme SuperHyperPerfect But As The 3660
Super Forms 3662
Definition 20.0.1. (Different Extreme Types of Extreme SuperHyperPerfect). 3663

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

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

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

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

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

re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, and Extreme rv-SuperHyperPerfect. 3675
Definition 20.0.2. ((Extreme) SuperHyperPerfect). 3676

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

Extreme re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, and Extreme rv- 3680
SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3681
Extreme SuperHyperPerfect; 3685
179
(ii) a Extreme SuperHyperPerfect if it’s either of Extreme e-SuperHyperPerfect, Extreme 3686

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

e-SuperHyperPerfect, Extreme re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, 3693
and Extreme rv-SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph 3694
Extreme SuperHyperPerfect; and the Extreme power is corresponded to its Extreme 3699
coefficient; 3700
(iv) a Extreme SuperHyperPerfect SuperHyperPolynomial if it’s either of Extreme 3701

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

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

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

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

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


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

SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality 3737
consecutive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 3738
form the Extreme SuperHyperPerfect; and the Extreme power is corresponded to its 3739
Extreme coefficient. 3740
• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperPer- 3743
fect, is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are some 3744
SuperHyperPerfect. 3750
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 3752
are some empty Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. 3753
SuperHyperVertex, V3 , is excluded in every given Extreme SuperHyperPerfect. 3757


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

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

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

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

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



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

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

Then 3848

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



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

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

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


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

CHAPTER 21 3883
Extreme SuperHyperTotal But As The 3884
Super Forms 3886
Definition 21.0.1. (Different Extreme Types of Extreme SuperHyperTotal). 3887
(i) Extreme e-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that Va ∈ Ei , Ej ; 3890
(ii) Extreme re-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that Va ∈ 3891

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

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

re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Extreme rv-SuperHyperTotal. 3897
Definition 21.0.2. ((Extreme) SuperHyperTotal). 3898

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

re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Extreme rv-SuperHyperTotal and 3902
SuperHyperEdges in the consecutive Extreme sequence of Extreme SuperHyperEdges and 3905
Extreme SuperHyperVertices such that they form the Extreme SuperHyperTotal; 3906
(ii) a Extreme SuperHyperTotal if it’s either of Extreme e-SuperHyperTotal, Extreme 3907

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

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

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

SuperHyperTotal, Extreme re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Ex- 3922
(V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined 3924
as the Extreme number of the maximum Extreme cardinality of the Extreme SuperHy- 3925
perEdges of an Extreme SuperHyperSet S of high Extreme cardinality consecutive Extreme 3926
SuperHyperTotal; and the Extreme power is corresponded to its Extreme coefficient; 3928
(v) an Extreme R-SuperHyperTotal if it’s either of Extreme e-SuperHyperTotal, Extreme 3929

re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Extreme rv-SuperHyperTotal and 3930
SuperHyperVertices in the consecutive Extreme sequence of Extreme SuperHyperEdges 3933
and Extreme SuperHyperVertices such that they form the Extreme SuperHyperTotal; 3934
(vi) a Extreme R-SuperHyperTotal if it’s either of Extreme e-SuperHyperTotal, Extreme 3935

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

treme e-SuperHyperTotal, Extreme re-SuperHyperTotal, Extreme v-SuperHyperTotal, 3942
and Extreme rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph 3943
SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality consec- 3946
utive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form 3947
the Extreme SuperHyperTotal; and the Extreme power is corresponded to its Extreme 3948
coefficient; 3949
(viii) a Extreme SuperHyperTotal SuperHyperPolynomial if it’s either of Extreme e- 3950

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

(V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined as 3953
the Extreme number of the maximum Extreme cardinality of the Extreme SuperHyper- 3954
Vertices of an Extreme SuperHyperSet S of high Extreme cardinality consecutive Extreme 3955
SuperHyperTotal; and the Extreme power is corresponded to its Extreme coefficient. 3957
• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperTotal, 3960
is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are some empty 3961
Extreme SuperHyperEdges but E2 is a loop Extreme SuperHyperEdge and E4 is an 3962
Extreme SuperHyperEdge. Thus in the terms of Extreme SuperHyperNeighbor, there’s 3963
SuperHyperTotal. 3967
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 3969
Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. Thus in the terms of 3970
Extreme SuperHyperNeighbor, there’s only one Extreme SuperHyperEdge, namely, E4 . 3971
The Extreme SuperHyperVertex, V3 is Extreme isolated means that there’s no Extreme 3972
SuperHyperEdge has it as an Extreme endpoint. Thus the Extreme SuperHyperVertex, 3973
V3 , is excluded in every given Extreme SuperHyperTotal. 3974



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

ViEXT ERN AL in the literatures of SuperHyperTotal. The latter is straightforward. 4022
(31.1), is the SuperHyperTotal. 4025
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 4027
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. 4034
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 4036
P : ViEXT ERN AL , Ei , CEN T ER, Ej .

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

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

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

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

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



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

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



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

CHAPTER 22 4098
Extreme SuperHyperConnected But As 4099
Super Forms 4101
Definition 22.0.1. (Different Extreme Types of Extreme SuperHyperConnected). 4102

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

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

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

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

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

Extreme re-SuperHyperConnected, Extreme v-SuperHyperConnected, and Extreme rv- 4116
SuperHyperConnected. 4117
Definition 22.0.2. ((Extreme) SuperHyperConnected). 4118
(i) an Extreme SuperHyperConnected if it’s either of Extreme e-SuperHyperConnected, 4121

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

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

Extreme e-SuperHyperConnected, Extreme re-SuperHyperConnected, Extreme v- 4135
SuperHyperConnected, and Extreme rv-SuperHyperConnected and C(N SHG) for an 4136
Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial con- 4137
tains the Extreme coefficients defined as the Extreme number of the maximum Extreme 4138
cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high 4139
Extreme cardinality consecutive Extreme SuperHyperEdges and Extreme SuperHyperVer- 4140
tices such that they form the Extreme SuperHyperConnected; and the Extreme power is 4141
corresponded to its Extreme coefficient; 4142
(iv) a Extreme SuperHyperConnected SuperHyperPolynomial if it’s either of 4143


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

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

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

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

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

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

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

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

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


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

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

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 4243
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. 4247
(31.1), is the SuperHyperConnected. 4250
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 4252
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. 4259
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 4261



ESHS : (V, E), in the Extreme SuperHyperModel (31.3), is the Extreme SuperHyperConnected. 4269
C(N SHG)Extreme Quasi-SuperHyperConnected

i
ESHG:(V,E)
∈P ESHG:(V,E) |
= z min |Pi
i
C(N SHG)Extreme V-SuperHyperConnected
i
ERN AL
ESHG:(V,E) , Vb
EXT ERN AL
∈ VPEXT
i
ERN AL
ESHG:(V,E) , i 6= j}.
C(N SHG)Extreme V-SuperHyperConnected SuperHyperPolynomial

X X
EXT ERN AL |
Extreme Cardinality
Proof. Let 4271
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

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

is a longest SuperHyperConnected taken from a connected Extreme SuperHyperBipartite 4280

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


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

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

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


to ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is straightforward. 4315
Then there’s at least one SuperHyperConnected. Thus the notion of quasi isn’t up and 4316
the SuperHyperNotions based on SuperHyperConnected could be applied. The unique 4317
embedded SuperHyperConnected proposes some longest SuperHyperConnected excerpt from 4318
some representatives. The latter is straightforward. 4319
Extreme SuperHyperConnected. 4324

CHAPTER 23 4325
Background 4326
221






SuperHyperClasses” in Ref. [HG20] by Henry Garrett (2022), “SuperHyperGirth on Su- 4417
perHyperGraph and Neutrosophic SuperHyperGraph With SuperHyperModeling of Cancer’s 4418

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

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

Henry Garrett (2023), “Indeterminacy On The All Possible Connections of Cells In Front of 4431
Cancer’s Attacks In The Terms of Neutrosophic Failed SuperHyperClique on Cancer’s Recogni- 4432
tion called Neutrosophic SuperHyperGraphs” in Ref. [HG27] by Henry Garrett (2023), “Perfect 4433
Directions Toward Idealism in Cancer’s Neutrosophic Recognition Forwarding Neutrosophic 4434
SuperHyperClique on Neutrosophic SuperHyperGraphs” in Ref. [HG28] by Henry Garrett 4435
(2023), “Demonstrating Complete Connections in Every Embedded Regions and Sub-Regions in 4436
the Terms of Cancer’s Recognition and (Neutrosophic) SuperHyperGraphs With (Neutrosophic) 4437
SuperHyperClique” in Ref. [HG29] by Henry Garrett (2023), “Different Neutrosophic Types 4438
of Neutrosophic Regions titled neutrosophic Failed SuperHyperStable in Cancer’s Neutrosophic 4439
Recognition modeled in the Form of Neutrosophic SuperHyperGraphs” in Ref. [HG30] by 4440
Henry Garrett (2023), “Using the Tool As (Neutrosophic) Failed SuperHyperStable To SuperHy- 4441
perModel Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs” in Ref. [HG31] by 4442
Henry Garrett (2023), “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic 4443
SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints” in Ref. 4444
[HG32] by Henry Garrett (2023), “(Neutrosophic) SuperHyperStable on Cancer’s Recognition 4445
by Well-SuperHyperModelled (Neutrosophic) SuperHyperGraphs” in Ref. [HG33] by Henry 4446
Garrett (2023), “Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To Use 4447

Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond” in Ref. 4448
[HG34] by Henry Garrett (2022), “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s 4449
Recognitions And (Neutrosophic) SuperHyperGraphs” in Ref. [HG35] by Henry Garrett (2022), 4450
“Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic) SuperHyperModeling 4451

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

Garrett (2022), “Basic Neutrosophic Notions Concerning SuperHyperDominating and Neutro- 4453
sophic SuperHyperResolving in SuperHyperGraph” in Ref. [HG37] by Henry Garrett (2022), 4454
“Initial Material of Neutrosophic Preliminaries to Study Some Neutrosophic Notions Based on 4455
Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic SuperHyperGraph (NSHG)” in Ref. 4456
[HG38] by Henry Garrett (2022), and [HG44s; HG55s; HG4; HG5; HG6; HG7; HG8; 4457
HG282; HG283; HG284; HG285; HG286; HG287], there are some endeavors to formalize 4478
the basic SuperHyperNotions about neutrosophic SuperHyperGraph and SuperHyperGraph 4479



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




Bibliography 4551
10.33140/JMTCM.01.03.09) 4574
227



10.20944/preprints202301.0282.v1). 4590

10.20944/preprints202301.0267.v1). 4593

(doi: 10.20944/preprints202301.0265.v1). 4598
prints202301.0262.v1). 4602
2023010224, (doi: 10.20944/preprints202301.0224.v1). 4608

prints202301.0105.v1). 4611

Preprints 2023, 2023010044 4617
10.20944/preprints202301.0043.v1). 4620

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

(doi: 10.20944/preprints202212.0500.v1). 4636
10.5281/zenodo.8076416). 4645

2023, (doi: 10.5281/zenodo.8076399). 4648
(doi: 10.5281/zenodo.8072171). 4651
2023, (doi: 10.5281/zenodo.8072267). 4654
10.5281/zenodo.8067384). 4657

2023, (doi: 10.5281/zenodo.8067409). 4660
10.5281/zenodo.8061927). 4663
10.5281/zenodo.8062016). 4666
10.5281/zenodo.8057696). 4669
2023, (doi: 10.5281/zenodo.8057753). 4672
10.5281/zenodo.8052893). 4675
2023, (doi: 10.5281/zenodo.8052925). 4678
10.5281/zenodo.8051346). 4681
10.5281/zenodo.8051360). 4684
10.5281/zenodo.8025707). 4687
10.5281/zenodo.8027275). 4690
odo.8017246). 4693
10.5281/zenodo.8020128). 4696

odo.7978571). 4699
10.5281/zenodo.7978857). 4702
10.5281/zenodo.7940830). 4705
10.5281/zenodo.7943578). 4708
odo.7916595). 4711
odo.7923632). 4714
(doi: 10.5281/zenodo.7904698). 4717
2023, (doi: 10.5281/zenodo.7904671). 4720
10.5281/zenodo.7871026). 4729
2023, (doi: 10.5281/zenodo.7874647). 4732
10.5281/zenodo.7857856). 4735

2023, (doi: 10.5281/zenodo.7857841). 4738
10.5281/zenodo.7853867). 4747
10.5281/zenodo.7853922). 4750
(doi: 10.5281/zenodo.7851519). 4753
(doi: 10.5281/zenodo.7851550). 4756
10.5281/zenodo.7834229). 4765
10.5281/zenodo.7834261). 4768
10.5281/zenodo.7824560). 4771
(doi: 10.5281/zenodo.7824623). 4774

2023, (doi: 10.5281/zenodo.7809365). 4785
2023, (doi: 10.5281/zenodo.7809358). 4788
10.5281/zenodo.7809219). 4791
10.5281/zenodo.7809328). 4794
2023, (doi: 10.5281/zenodo.7806767). 4797
2023, (doi: 10.5281/zenodo.7806838). 4800
10.5281/zenodo.7799902). 4809
(doi: 10.5281/zenodo.7804218). 4812

(doi: 10.5281/zenodo.7796334). 4815
10.5281/zenodo.7791952). 4821
10.5281/zenodo.7791982). 4824
10.5281/zenodo.7790026). 4827
10.5281/zenodo.7790052). 4830
2023, (doi: 10.5281/zenodo.7787066). 4833
10.5281/zenodo.7781476). 4839
10.5281/zenodo.7783082). 4842
10.5281/zenodo.7777857). 4845
10.5281/zenodo.7779286). 4848
(doi: 10.5281/zenodo.7771831). 4851

2023, (doi: 10.5281/zenodo.7772468). 4854
10.13140/RG.2.2.20913.25446). 4857
odo.7764916). 4860
10.13140/RG.2.2.11770.98247). 4863
10.13140/RG.2.2.12400.12808). 4866
2023, (doi: 10.13140/RG.2.2.22545.10089). 4869
10.13140/RG.2.2.11377.76644). 4875
10.13140/RG.2.2.23750.96329). 4878
10.13140/RG.2.2.31366.24641). 4881
10.13140/RG.2.2.34721.68960). 4884
2023, (doi: 10.13140/RG.2.2.30212.81289). 4887

10.13140/RG.2.2.24288.35842). 4893
10.13140/RG.2.2.32467.25124). 4896
10.13140/RG.2.2.31025.45925). 4899
10.13140/RG.2.2.17184.25602). 4902
10.13140/RG.2.2.23423.28327). 4905
10.13140/RG.2.2.28456.44805). 4908
10.13140/RG.2.2.23525.68320). 4911
10.13140/RG.2.2.20170.24000). 4914
10.13140/RG.2.2.36475.59683). 4917
10.13140/RG.2.2.29764.71046). 4920
2023, (doi: 10.13140/RG.2.2.18780.87683). 4923
10.13140/RG.2.2.26134.01603). 4929

10.13140/RG.2.2.27392.30721). 4932
10.13140/RG.2.2.33028.40321). 4935
10.13140/RG.2.2.21389.20966). 4938
10.13140/RG.2.2.16356.04489). 4941
10.13140/RG.2.2.21756.21129). 4944
10.13140/RG.2.2.30983.68009). 4947
10.13140/RG.2.2.28552.29445). 4950
(doi: 10.13140/RG.2.2.10936.21761). 4953
10.13140/RG.2.2.35105.89447). 4956
(doi: 10.13140/RG.2.2.30072.72960). 4959
10.13140/RG.2.2.31147.52003). 4962
10.13140/RG.2.2.32825.24163). 4965
10.13140/RG.2.2.13059.58401). 4968

10.13140/RG.2.2.11172.14720). 4971
2023, (doi: 10.13140/RG.2.2.22011.80165). 4974
ate 2023, (doi: 10.13140/RG.2.2.30819.84003). 4977
2023, (doi: 10.13140/RG.2.2.10493.84962). 4980
ate 2023, (doi: 10.13140/RG.2.2.13849.29280). 4983
2023, (doi: 10.13140/RG.2.2.19944.14086). 4986
ate 2023, (doi: 10.13140/RG.2.2.23299.58404). 4989
(doi: 10.13140/RG.2.2.33103.76968). 4992
(doi: 10.13140/RG.2.2.23037.44003). 4995
(doi: 10.13140/RG.2.2.35646.56641). 4998
10.13140/RG.2.2.18030.48967). 5001
(doi: 10.13140/RG.2.2.13973.81121). 5004
2023, (doi: 10.13140/RG.2.2.34106.47047). 5007

2023, (doi: 10.13140/RG.2.2.31956.88961). 5013
2023, (doi: 10.13140/RG.2.2.15179.67361). 5016
10.13140/RG.2.2.21510.45125). 5019
2023, (doi: 10.13140/RG.2.2.13121.84321). 5022
10.13140/RG.2.2.11758.69441). 5025
2023, (doi: 10.13140/RG.2.2.31891.35367). 5028
10.13140/RG.2.2.19360.87048). 5031
10.13140/RG.2.2.32363.21286). 5034
10.13140/RG.2.2.23266.81602). 5037
10.13140/RG.2.2.19911.37285). 5040
10.13140/RG.2.2.11050.90569). 5043
2023, (doi: 10.13140/RG.2.2.17761.79206). 5046

ate 2023, (doi: 10.13140/RG.2.2.33275.80161). 5052
(doi: 10.13140/RG.2.2.30182.50241). 5055

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


2023010396 (doi: 10.20944/preprints202301.0396.v1). 5097
2023, 2023010395 (doi: 10.20944/preprints202301.0395.v1). 5100




2023,(doi: 10.13140/RG.2.2.36745.93289). 5114
10.20944/preprints202301.0282.v1). 5121
10.20944/preprints202301.0267.v1).). 5124

(doi: 10.20944/preprints202301.0265.v1). 5129
prints202301.0262.v1). 5133
2023010224, (doi: 10.20944/preprints202301.0224.v1). 5139

10.13140/RG.2.2.35061.65767). 5142

10.13140/RG.2.2.18494.15680). 5146

10.13140/RG.2.2.32530.73922). 5150

10.13140/RG.2.2.15897.70243). 5154

10.13140/RG.2.2.32530.73922). 5158

prints202301.0105.v1). 5161

10.13140/RG.2.2.23172.19849). 5168
10.13140/RG.2.2.17385.36968). 5178
Preprints 2023, 2023010044 5181
10.20944/preprints202301.0043.v1). 5184

2023, (doi: 10.13140/RG.2.2.28945.92007). 5187
10.13140/RG.2.2.35774.77123). 5193

10.13140/RG.2.2.29430.88642). 5199

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

10.13140/RG.2.2.19380.94084). 5208
(doi: 10.20944/preprints202212.0500.v1). 5219
10.13140/RG.2.2.20993.12640). 5222


10.13140/RG.2.2.29173.86244). 5237

2023 (doi: 10.5281/zenodo.8076449). 5242
2023 (doi: 10.5281/zenodo.8067469). 5246
(doi: 10.5281/zenodo.8062076). 5248
2023 (doi: 10.5281/zenodo.8052976). 5252
(doi: 10.5281/zenodo.8051368). 5254
(doi: 10.5281/zenodo.8027488). 5256
10.5281/zenodo.8020181). 5258
10.5281/zenodo.7978921). 5260
odo.7943878). 5262
10.5281/zenodo.7943871). 5264
10.5281/zenodo.7923786). 5266
2023 (doi: 10.5281/zenodo.7905287). 5268
2023 (doi: 10.5281/zenodo.7874677). 5272
(doi: 10.5281/zenodo.7857906). 5274
2023 (doi: 10.5281/zenodo.7856329). 5276

10.5281/zenodo.7854561). 5278
2023 (doi: 10.5281/zenodo.7851893). 5280

(doi: 10.5281/zenodo.7835063). 5284
(doi: 10.5281/zenodo.7826705). 5286
2023 (doi: 10.5281/zenodo.7820680). 5288
10.5281/zenodo.7812750). 5290

2023 (doi: 10.5281/zenodo.7807782). 5296
2023 (doi: 10.5281/zenodo.7804449). 5298
(doi: 10.5281/zenodo.7792307). 5302
(doi: 10.5281/zenodo.7790728). 5304
2023 (doi: 10.5281/zenodo.7787712). 5306
10.5281/zenodo.7783791). 5308
10.5281/zenodo.7780123). 5310
(doi: 10.5281/zenodo.7773119). 5312

odo.7637762). 5314
10.5281/zenodo.7766174). 5316
10.5281/zenodo.7762232). 5318
(doi: 10.5281/zenodo.7758601). 5320
10.5281/zenodo.7754661). 5322
10.5281/zenodo.7750995) . 5324
(doi: 10.5281/zenodo.7749875). 5326
10.5281/zenodo.7747236). 5328
10.5281/zenodo.7742587). 5330
(doi: 10.5281/zenodo.7738635). 5332
10.5281/zenodo.7734719). 5334
10.5281/zenodo.7730484). 5336
(doi: 10.5281/zenodo.7730469). 5338
10.5281/zenodo.7722865). 5340
odo.7713563). 5342
odo.7709116). 5344
10.5281/zenodo.7706415). 5346
10.5281/zenodo.7706063). 5348

10.5281/zenodo.7701906). 5350
odo.7700205). 5352
10.5281/zenodo.7694876). 5354
10.5281/zenodo.7679410). 5356
10.5281/zenodo.7675982). 5358
10.5281/zenodo.7672388). 5360
odo.7668648). 5362
10.5281/zenodo.7662810). 5364
10.5281/zenodo.7659162). 5366
odo.7653233). 5368
odo.7653204). 5370
odo.7653142). 5372
odo.7653117). 5374
odo.7651687). 5377
odo.7651619). 5379
odo.7651439). 5381
odo.7650729). 5383

odo.7647868). 5385
odo.7647017). 5387
odo.7644894). 5389
odo.7632923). 5392
odo.7623459). 5394
10.5281/zenodo.7606416). 5396
10.5281/zenodo.7606416). 5398
odo.7606404). 5400
10.5281/zenodo.7580018). 5402
odo.7580018). 5404
odo.7580018). 5406
odo.7579929). 5408
10.5281/zenodo.7563170). 5410
odo.7563164). 5412
odo.7563160). 5414
odo.7563160). 5416
10.5281/zenodo.7563160). 5418

10.5281/zenodo.7557063). 5420
10.5281/zenodo.7557009). 5422
10.5281/zenodo.7539484). 5424
10.5281/zenodo.7523390). 5426
10.5281/zenodo.7523390). 5428
10.5281/zenodo.7523390). 5430
odo.7574952). 5432
10.5281/zenodo.7574992). 5434
odo.7523357). 5436
10.5281/zenodo.7523357). 5438
10.5281/zenodo.7504782). 5440
10.5281/zenodo.7504782). 5442
10.5281/zenodo.7504782). 5444
10.5281/zenodo.7499395). 5446
odo.7499395). 5448
10.5281/zenodo.7499395). 5450
10.5281/zenodo.7497450). 5452
10.5281/zenodo.7497450). 5454

10.5281/zenodo.7494862). 5456
odo.7494862). 5458
10.5281/zenodo.7494862). 5460
10.5281/zenodo.7493845). 5462
odo.7493845). 5464
10.5281/zenodo.7493845). 5466
odo.7539484). 5468
odo.7523390). 5470
odo.7523357). 5472
odo.7504782). 5474
odo.7499395). 5476
odo.7497450). 5478
odo.7494862). 5480
odo.7493845). 5482
odo.7480110). 5484
odo.7378758). 5486
odo.6320305). 5488
odo.6677173). 5490

CHAPTER 24 5491
Cancer In Neutrosophic 5492
SuperHyperGraph 5493
The cancer is the Neutrosophic disease but the Neutrosophic model is going to figure out what’s 5494
going on this Neutrosophic phenomenon. The special Neutrosophic case of this Neutrosophic 5495
disease is considered and as the consequences of the model, some parameters are used. The cells 5496
are under attack of this disease but the moves of the cancer in the special region are the matter 5497
of mind. The Neutrosophic recognition of the cancer could help to find some Neutrosophic 5498
treatments for this Neutrosophic disease. 5499
In the following, some Neutrosophic steps are Neutrosophic devised on this disease. 5500
Step 1. (Neutrosophic Definition) The Neutrosophic recognition of the cancer in the long- 5501
term Neutrosophic function. 5502
Step 2. (Neutrosophic Issue) The specific region has been assigned by the Neutrosophic 5503
model [it’s called Neutrosophic SuperHyperGraph] and the long Neutrosophic cycle of the 5504
move from the cancer is identified by this research. Sometimes the move of the cancer 5505
about the moves and the effects of the cancer on that region; this event leads us to 5507
choose another model [it’s said to be Neutrosophic SuperHyperGraph] to have convenient 5508
perception on what’s happened and what’s done. 5509
Step 3. (Neutrosophic Model) There are some specific Neutrosophic models, which are well- 5510
known and they’ve got the names, and some general Neutrosophic models. The moves 5511
and the Neutrosophic traces of the cancer on the complex tracks and between complicated 5512
groups of cells could be fantasized by a Neutrosophic SuperHyperPath(-/SuperHyperK- 5513
Domination, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHy- 5514
perWheel). The aim is to find either the Neutrosophic SuperHyperK-Domination or the 5515
Neutrosophic SuperHyperK-Domination in those Neutrosophic Neutrosophic SuperHyper- 5516
Models. 5517
Some cells have been faced with some attacks from the situation which is caused by the 5518
cancer’s attacks. In this case, there are some embedded analysis on the ongoing situations 5519
which in that, the cells could be labelled as some groups and some groups or individuals have 5520
excessive labels which all are raised from the behaviors to overcome the cancer’s attacks. In 5521
the embedded situations, the individuals of cells and the groups of cells could be considered 5522
253
as “new groups”. Thus it motivates us to find the proper SuperHyperModels for getting more 5523
proper analysis on this messy story. I’ve found the SuperHyperModels which are officially called 5524
“SuperHyperGraphs” and “Neutrosophic SuperHyperGraphs”. In this SuperHyperModel, the 5525
cells and the groups of cells are defined as “SuperHyperVertices” and the relations between the 5526
individuals of cells and the groups of cells are defined as “SuperHyperEdges”. Thus it’s another 5527
motivation for us to do research on this SuperHyperModel based on the “Cancer’s Recognition”. 5528
Sometimes, the situations get worst. The situation is passed from the certainty and precise style. 5529
Thus it’s the beyond them. There are three descriptions, namely, the degrees of determinacy, 5530
indeterminacy and neutrality, for any object based on vague forms, namely, incomplete data, 5531
imprecise data, and uncertain analysis. The latter model could be considered on the previous 5532
SuperHyperModel. It’s SuperHyperModel. It’s SuperHyperGraph but it’s officially called 5533
“Neutrosophic SuperHyperGraphs”. The cancer is the disease but the model is going to figure 5534
out what’s going on this phenomenon. The special case of this disease is considered and as the 5535
consequences of the model, some parameters are used. The cells are under attack of this disease 5536
but the moves of the cancer in the special region are the matter of mind. The recognition of 5537
the cancer could help to find some treatments for this disease. The SuperHyperGraph and 5538
Neutrosophic SuperHyperGraph are the SuperHyperModels on the “Cancer’s Recognition” and 5539
both bases are the background of this research. Sometimes the cancer has been happened on the 5540
region, full of cells, groups of cells and embedded styles. In this segment, the SuperHyperModel 5541
proposes some SuperHyperNotions based on the connectivities of the moves of the cancer 5542
in the forms of alliances’ styles with the formation of the design and the architecture are 5543
formally called “ SuperHyperK-Domination” in the themes of jargons and buzzwords. The 5544
prefix “SuperHyper” refers to the theme of the embedded styles to figure out the background for 5545
the SuperHyperNotions. The recognition of the cancer in the long-term function. The specific 5546
region has been assigned by the model [it’s called SuperHyperGraph] and the long cycle of the 5547
move from the cancer is identified by this research. Sometimes the move of the cancer hasn’t be 5548
easily identified since there are some determinacy, indeterminacy and neutrality about the moves 5549
names, and some general models. The moves and the traces of the cancer on the complex tracks 5553
and between complicated groups of cells could be fantasized by a Neutrosophic SuperHyperPath 5554
(-/SuperHyperK-Domination, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, 5555
SuperHyperWheel). The aim is to find either the optimal SuperHyperK-Domination or the 5556
Neutrosophic SuperHyperK-Domination in those Neutrosophic SuperHyperModels. Some 5557
general results are introduced. Beyond that in SuperHyperStar, all possible Neutrosophic 5558
SuperHyperPath s have only two SuperHyperEdges but it’s not enough since it’s essential to 5559
have at least three SuperHyperEdges to form any style of a SuperHyperK-Domination. There 5560
isn’t any formation of any SuperHyperK-Domination but literarily, it’s the deformation of any 5561
SuperHyperK-Domination. It, literarily, deforms and it doesn’t form. 5562
amount of SuperHyperK-Domination” of either individual of cells or the groups of cells based on 5564
the fixed cell or the fixed group of cells, extensively, the “amount of SuperHyperK-Domination” 5565
based on the fixed groups of cells or the fixed groups of group of cells? 5566
Question 24.0.2. What are the best descriptions for the “Cancer’s Recognition” in terms of 5567

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

SuperHyperK-Domination” on “SuperHyperGraph” and “Neutrosophic SuperHyperGraph”. 5571
Then the research has taken more motivations to define SuperHyperClasses and to find some 5572
connections amid this SuperHyperNotion with other SuperHyperNotions. It motivates us to get 5573
some instances and examples to make clarifications about the framework of this research. The 5574
general results and some results about some connections are some avenues to make key point of 5575
this research, “Cancer’s Recognition”, more understandable and more clear. 5576
Some SuperHyperClasses and some Neutrosophic SuperHyperClasses are the cases of this 5577
research on the modeling of the regions where are under the attacks of the cancer to 5578
recognize this disease as it’s mentioned on the title “Cancer’s Recognitions”. To formalize 5579
the instances on the SuperHyperNotion, SuperHyperK-Domination, the new SuperHyperClasses 5580
and SuperHyperClasses, are introduced. Some general results are gathered in the section on the 5581
SuperHyperK-Domination and the Neutrosophic SuperHyperK-Domination. The clarifications, 5582

instances and literature reviews have taken the whole way through. In this scientific research, 5583
the literature reviews have fulfilled the lines containing the notions and the results. The 5584
SuperHyperGraph and Neutrosophic SuperHyperGraph are the SuperHyperModels on the 5585
“Cancer’s Recognitions” and both bases are the background of this research. Sometimes the 5586
cancer has been happened on the region, full of cells, groups of cells and embedded styles. In 5587
this scientific segment, the SuperHyperModel proposes some SuperHyperNotions based on the 5588
connectivities of the moves of the cancer in the longest and strongest styles with the formation of 5589
the design and the architecture are formally called “ SuperHyperK-Domination” in the themes 5590
of jargons and buzzwords. The prefix “SuperHyper” refers to the theme of the embedded styles 5591
to figure out the background for the SuperHyperNotions. 5592

CHAPTER 25 5593
Neutrosophic Unequal Connective 5594
Dominating 5595
Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of SuperHyperDu- 5596
ality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, ResearchGate 5597
2023, (doi: 10.13140/RG.2.2.34953.52320). 5598
Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph By 5599
SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchGate 2023, 5600
(doi: 10.13140/RG.2.2.33275.80161). 5601
10.13140/RG.2.2.11050.90569). 5604
Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of SuperHyperJoin 5605
10.13140/RG.2.2.17761.79206). 5607
10.13140/RG.2.2.19911.37285). 5610
Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect 5611
10.13140/RG.2.2.23266.81602). 5613
10.13140/RG.2.2.19360.87048). 5616
Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal 5617
10.13140/RG.2.2.32363.21286). 5619
10.13140/RG.2.2.11758.69441). 5622
Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of SuperHyperConnected 5623
10.13140/RG.2.2.31891.35367). 5625
257

10.13140/RG.2.2.21510.45125). 5628
Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDominating 5629
10.13140/RG.2.2.13121.84321). 5631

CHAPTER 26 5632
New Ideas In Recognition of Cancer And 5633
Neutrosophic SuperHyperGraph By 5634
Unequal Connective Dominating As 5635
Hyper Conceit On Super Con 5636
259
CHAPTER 27 5637
ABSTRACT 5638
In this scientific research, (Different Neutrosophic Types of Neutrosophic SuperHyperUnequal 5639

Connective Dominating). Assume a Neutrosophic SuperHyperGraph (NSHG) S is a Unequal Connective 5640
0
Dominating pair S = (V, E). Consider a Neutrosophic SuperHyperSet V = {V1 , V2 , . . . , Vs } and 5641
0 0 0
E = {E1 , E2 , . . . , Ez }. Then either V or E is called Neutrosophic e-SuperHyperUnequal Connective 5642
Dominating if the following expression is called Neutrosophic e-SuperHyperUnequal Connective Dominating 5643
criteria holds 5644

Neutrosophic re-SuperHyperUnequal Connective Dominating if the following expression is called 5645
Neutrosophic e-SuperHyperUnequal Connective Dominating criteria holds 5646

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

SuperHyperUnequal Connective Dominating if the following expression is called Neutrosophic v- 5648
SuperHyperUnequal Connective Dominating criteria holds 5649

261
Neutrosophic rv-SuperHyperUnequal Connective Dominating if the following expression is called 5650

Neutrosophic v-SuperHyperUnequal Connective Dominating criteria holds 5651

and |Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; Neutrosophic Super- 5652
HyperUnequal Connective Dominating if it’s either of Neutrosophic e-SuperHyperUnequal Connective Domin- 5653
ating, Neutrosophic re-SuperHyperUnequal Connective Dominating, Neutrosophic v-SuperHyperUnequal 5654
Connective Dominating, and Neutrosophic rv-SuperHyperUnequal Connective Dominating. ((Neutrosophic) 5655
SuperHyperUnequal Connective Dominating). Assume a Neutrosophic SuperHyperGraph (NSHG) S 5656
is a pair S = (V, E). Consider a Neutrosophic SuperHyperEdge (NSHE) E = {V1 , V2 , . . . , Vs }. 5657
Then E is called an Extreme SuperHyperUnequal Connective Dominating if it’s either of Neutrosophic 5658
Connective Dominating and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the max- 5661
imum Extreme cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of the 5662
Extreme SuperHyperEdges in the consecutive Extreme sequence of Extreme SuperHyperEdges 5663
and Extreme SuperHyperVertices such that they form the Extreme SuperHyperUnequal Connective 5664
Dominating; a Neutrosophic SuperHyperUnequal Connective Dominating if it’s either of Neutrosophic 5665
Connective Dominating and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is 5668
the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutro- 5669
sophic SuperHyperSet S of high Neutrosophic cardinality consecutive Neutrosophic Super- 5670

HyperEdges and Neutrosophic SuperHyperVertices such that they form the Neutrosophic 5671
SuperHyperUnequal Connective Dominating; an Extreme SuperHyperUnequal Connective Dominating SuperHy- 5672
perPolynomial if it’s either of Neutrosophic e-SuperHyperUnequal Connective Dominating, Neutrosophic 5673
and Neutrosophic rv-SuperHyperUnequal Connective Dominating and C(N SHG) for an Extreme Su- 5675
perHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme 5676
coefficients defined as the Extreme number of the maximum Extreme cardinality of the Extreme 5677
Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the Extreme 5679
SuperHyperUnequal Connective Dominating; and the Extreme power is corresponded to its Extreme 5680
coefficient; a Neutrosophic SuperHyperUnequal Connective Dominating SuperHyperPolynomial if it’s 5681
either of Neutrosophic e-SuperHyperUnequal Connective Dominating, Neutrosophic re-SuperHyperUnequal 5682

Connective Dominating, Neutrosophic v-SuperHyperUnequal Connective Dominating, and Neutrosophic rv- 5683
N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains the Neutrosophic coeffi- 5685
cients defined as the Neutrosophic number of the maximum Neutrosophic cardinality of the 5686
Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic car- 5687
dinality consecutive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such 5688

that they form the Neutrosophic SuperHyperUnequal Connective Dominating; and the Neutrosophic 5689
power is corresponded to its Neutrosophic coefficient; an Extreme V-SuperHyperUnequal Connective 5690
Neutrosophic rv-SuperHyperUnequal Connective Dominating and C(N SHG) for an Extreme SuperHy- 5693
perGraph N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet 5694
S of high Extreme cardinality of the Extreme SuperHyperVertices in the consecutive Extreme 5695
sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form 5696
the Extreme SuperHyperUnequal Connective Dominating; a Neutrosophic V-SuperHyperUnequal Connective 5697
Neutrosophic rv-SuperHyperUnequal Connective Dominating and C(N SHG) for a Neutrosophic Supe- 5700
rHyperGraph N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic 5701
SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consec- 5702
utive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form 5703
the Neutrosophic SuperHyperUnequal Connective Dominating; an Extreme V-SuperHyperUnequal Connective 5704
Dominating SuperHyperPolynomial if it’s either of Neutrosophic e-SuperHyperUnequal Connective Dom- 5705
inating, Neutrosophic re-SuperHyperUnequal Connective Dominating, Neutrosophic v-SuperHyperUnequal 5706
Connective Dominating, and Neutrosophic rv-SuperHyperUnequal Connective Dominating and C(N SHG) for 5707
an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains 5708
the Extreme coefficients defined as the Extreme number of the maximum Extreme cardinality of 5709
the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality 5710
consecutive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form 5711
the Extreme SuperHyperUnequal Connective Dominating; and the Extreme power is corresponded 5712
to its Extreme coefficient; a Neutrosophic SuperHyperUnequal Connective Dominating SuperHyper- 5713

Polynomial if it’s either of Neutrosophic e-SuperHyperUnequal Connective Dominating, Neutrosophic 5714
and Neutrosophic rv-SuperHyperUnequal Connective Dominating and C(N SHG) for a Neutrosophic 5716
SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains the 5717
Neutrosophic coefficients defined as the Neutrosophic number of the maximum Neutrosophic 5718
cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S of high 5719

Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and Neutrosophic Super- 5720
HyperVertices such that they form the Neutrosophic SuperHyperUnequal Connective Dominating; and 5721
the Neutrosophic power is corresponded to its Neutrosophic coefficient. In this scientific research, 5722
new setting is introduced for new SuperHyperNotions, namely, a SuperHyperUnequal Connective 5723
Dominating and Neutrosophic SuperHyperUnequal Connective Dominating. Two different types of Super- 5724
HyperDefinitions are debut for them but the research goes further and the SuperHyperNotion, 5725
The literature review is implemented in the whole of this research. For shining the elegancy and 5727
the significancy of this research, the comparison between this SuperHyperNotion with other 5728
SuperHyperNotions and fundamental SuperHyperNumbers are featured. The definitions are 5729
followed by the examples and the instances thus the clarifications are driven with different tools. 5730
The applications are figured out to make sense about the theoretical aspect of this ongoing 5731
research. The “Cancer’s Recognition” are the under research to figure out the challenges make 5732
sense about ongoing and upcoming research. The special case is up. The cells are viewed in the 5733
deemed ways. There are different types of them. Some of them are individuals and some of them 5734

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

Dominating is a maximal of SuperHyperVertices with a maximum cardinality such that either of 5742
the following expressions hold for the (Neutrosophic) cardinalities of SuperHyperNeighbors of 5743
s ∈ S : there are |S ∩ N (s)| > |S ∩ (V \ N (s))| + δ; and |S ∩ N (s)| < |S ∩ (V \ N (s))| + δ. The 5744
first Expression, holds if S is an δ−SuperHyperOffensive. And the second Expression, holds 5745
if S is an δ−SuperHyperDefensive; a Neutrosophic δ−SuperHyperUnequal Connective Dominating is 5746
a maximal Neutrosophic of SuperHyperVertices with maximum Neutrosophic cardinality 5747

such that either of the following expressions hold for the Neutrosophic cardinalities of Super- 5748
HyperNeighbors of s ∈ S there are: |S ∩ N (s)|N eutrosophic > |S ∩ (V \ N (s))|N eutrosophic + δ; 5749
and |S ∩ N (s)|N eutrosophic < |S ∩ (V \ N (s))|N eutrosophic + δ. The first Expression, holds 5750
if S is a Neutrosophic δ−SuperHyperOffensive. And the second Expression, holds if S is a 5751
Neutrosophic δ−SuperHyperDefensive It’s useful to define a “Neutrosophic” version of a 5752
SuperHyperUnequal Connective Dominating . Since there’s more ways to get type-results to make a 5753
SuperHyperUnequal Connective Dominating more understandable. For the sake of having Neutrosophic 5754
SuperHyperUnequal Connective Dominating, there’s a need to “redefine” the notion of a “SuperHy- 5755
perUnequal Connective Dominating ”. The SuperHyperVertices and the SuperHyperEdges are assigned 5756
by the labels from the letters of the alphabets. In this procedure, there’s the usage of the 5757
position of labels to assign to the values. Assume a SuperHyperUnequal Connective Dominating . It’s 5758
redefined a Neutrosophic SuperHyperUnequal Connective Dominating if the mentioned Table holds, 5759
concerning, “The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges 5760
Belong to The Neutrosophic SuperHyperGraph” with the key points, “The Values of The 5761
Vertices & The Number of Position in Alphabet”, “The Values of The SuperVertices&The 5762
maximum Values of Its Vertices”, “The Values of The Edges&The maximum Values of Its 5763
Vertices”, “The Values of The HyperEdges&The maximum Values of Its Vertices”, “The Values 5764
of The SuperHyperEdges&The maximum Values of Its Endpoints”. To get structural examples 5765
and instances, I’m going to introduce the next SuperHyperClass of SuperHyperGraph based 5766
on a SuperHyperUnequal Connective Dominating . It’s the main. It’ll be disciplinary to have the 5767
foundation of previous definition in the kind of SuperHyperClass. If there’s a need to have all 5768
SuperHyperUnequal Connective Dominating until the SuperHyperUnequal Connective Dominating, then it’s offi- 5769
cially called a “SuperHyperUnequal Connective Dominating” but otherwise, it isn’t a SuperHyperUnequal 5770
Connective Dominating . There are some instances about the clarifications for the main definition 5771
titled a “SuperHyperUnequal Connective Dominating ”. These two examples get more scrutiny and 5772
discernment since there are characterized in the disciplinary ways of the SuperHyperClass 5773
based on a SuperHyperUnequal Connective Dominating . For the sake of having a Neutrosophic Su- 5774
perHyperUnequal Connective Dominating, there’s a need to “redefine” the notion of a “Neutrosophic 5775
SuperHyperUnequal Connective Dominating” and a “Neutrosophic SuperHyperUnequal Connective Dominating 5776

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

redefined to a “Neutrosophic SuperHyperUnequal Connective Dominating” if the intended Table holds. 5781
It’s useful to define “Neutrosophic” version of SuperHyperClasses. Since there’s more ways 5782
to get Neutrosophic type-results to make a Neutrosophic SuperHyperUnequal Connective Dominating 5783
more understandable. Assume a Neutrosophic SuperHyperGraph. There are some Neutrosophic 5784
SuperHyperClasses if the intended Table holds. Thus SuperHyperPath, SuperHyperUnequal 5785
Connective Dominating, SuperHyperStar, SuperHyperBipartite, SuperHyperMultiPartite, and Supe- 5786
rHyperWheel, are “Neutrosophic SuperHyperPath”, “Neutrosophic SuperHyperUnequal Connective 5787

Dominating”, “Neutrosophic SuperHyperStar”, “Neutrosophic SuperHyperBipartite”, “Neutro- 5788
sophic SuperHyperMultiPartite”, and “Neutrosophic SuperHyperWheel” if the intended Table 5789
holds. A SuperHyperGraph has a “Neutrosophic SuperHyperUnequal Connective Dominating” where 5790
it’s the strongest [the maximum Neutrosophic value from all the SuperHyperUnequal Connective 5791
Dominating amid the maximum value amid all SuperHyperVertices from a SuperHyperUnequal 5792
Connective Dominating .] SuperHyperUnequal Connective Dominating . A graph is a SuperHyperUniform 5793

with two exceptions; it’s SuperHyperUnequal Connective Dominating if it’s only one SuperVertex as 5797
intersection amid two given SuperHyperEdges; it’s SuperHyperStar it’s only one SuperVertex 5798
as intersection amid all SuperHyperEdges; it’s SuperHyperBipartite it’s only one SuperVer- 5799
tex as intersection amid two given SuperHyperEdges and these SuperVertices, forming two 5800
separate sets, has no SuperHyperEdge in common; it’s SuperHyperMultiPartite it’s only 5801
and the common and intended properties between “specific” cells and “specific group” of cells 5809
are SuperHyperModeled as “SuperHyperEdges”. Sometimes, it’s useful to have some degrees of 5810
determinacy, indeterminacy, and neutrality to have more precise SuperHyperModel which in this 5811
case the SuperHyperModel is called “Neutrosophic”. In the future research, the foundation will 5812
be based on the “Cancer’s Recognition” and the results and the definitions will be introduced 5813
in redeemed ways. The recognition of the cancer in the long-term function. The specific region 5814
has been assigned by the model [it’s called SuperHyperGraph] and the long cycle of the move 5815
from the cancer is identified by this research. Sometimes the move of the cancer hasn’t be easily 5816
identified since there are some determinacy, indeterminacy and neutrality about the moves 5817
names, and some SuperHyperGeneral SuperHyperModels. The moves and the traces of the 5821
cancer on the complex tracks and between complicated groups of cells could be fantasized 5822
by a Neutrosophic SuperHyperPath(-/SuperHyperUnequal Connective Dominating, SuperHyperStar, 5823
SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find either 5824
the longest SuperHyperUnequal Connective Dominating or the strongest SuperHyperUnequal Connective 5825
Dominating in those Neutrosophic SuperHyperModels. For the longest SuperHyperUnequal Connective 5826

Dominating , called SuperHyperUnequal Connective Dominating, and the strongest SuperHyperUnequal Con- 5827
nective Dominating, called Neutrosophic SuperHyperUnequal Connective Dominating, some general results 5828
are introduced. Beyond that in SuperHyperStar, all possible SuperHyperPaths have only two 5829
Connective Dominating. It, literarily, deforms and it doesn’t form. A basic familiarity with Neut- 5833
rosophic SuperHyperUnequal Connective Dominating theory, SuperHyperGraphs, and Neutrosophic 5834
SuperHyperGraphs theory are proposed. 5835
Keywords: Neutrosophic SuperHyperGraph, SuperHyperUnequal Connective Dominating, Cancer’s 5836
Neutrosophic Recognition 5837


CHAPTER 28 5839
Applied Notions Under The Scrutiny Of 5840
The Motivation Of This Scientific 5841
Research 5842
In this scientific research, there are some ideas in the featured frameworks of motivations. I 5843
try to bring the motivations in the narrative ways. Some cells have been faced with some 5844
attacks from the situation which is caused by the cancer’s attacks. In this case, there are 5845
some embedded analysis on the ongoing situations which in that, the cells could be labelled 5846
as some groups and some groups or individuals have excessive labels which all are raised from 5847
the behaviors to overcome the cancer’s attacks. In the embedded situations, the individuals 5848
of cells and the groups of cells could be considered as “new groups”. Thus it motivates us to 5849
find the proper SuperHyperModels for getting more proper analysis on this messy story. I’ve 5850
found the SuperHyperModels which are officially called “SuperHyperGraphs” and “Neutrosophic 5851
SuperHyperGraphs”. In this SuperHyperModel, the cells and the groups of cells are defined as 5852
“SuperHyperVertices” and the relations between the individuals of cells and the groups of cells 5853
are defined as “SuperHyperEdges”. Thus it’s another motivation for us to do research on this 5854
SuperHyperModel based on the “Cancer’s Recognition”. Sometimes, the situations get worst. 5855
The situation is passed from the certainty and precise style. Thus it’s the beyond them. There 5856
are three descriptions, namely, the degrees of determinacy, indeterminacy and neutrality, for any 5857
object based on vague forms, namely, incomplete data, imprecise data, and uncertain analysis. 5858
The latter model could be considered on the previous SuperHyperModel. It’s SuperHyperModel. 5859
It’s SuperHyperGraph but it’s officially called “Neutrosophic SuperHyperGraphs”. The cancer 5860
is the disease but the model is going to figure out what’s going on this phenomenon. The special 5861
case of this disease is considered and as the consequences of the model, some parameters are used. 5862
The cells are under attack of this disease but the moves of the cancer in the special region are the 5863
matter of mind. The recognition of the cancer could help to find some treatments for this disease. 5864
The SuperHyperGraph and Neutrosophic SuperHyperGraph are the SuperHyperModels on the 5865
“Cancer’s Recognition” and both bases are the background of this research. Sometimes the 5866
segment, the SuperHyperModel proposes some SuperHyperNotions based on the connectivities of 5868
the moves of the cancer in the forms of alliances’ styles with the formation of the design and the 5869
architecture are formally called “ SuperHyperUnequal Connective Dominating” in the themes of jargons 5870
267
out the background for the SuperHyperNotions. The recognition of the cancer in the long-term 5872
function. The specific region has been assigned by the model [it’s called SuperHyperGraph] 5873
and the long cycle of the move from the cancer is identified by this research. Sometimes the 5874
move of the cancer hasn’t be easily identified since there are some determinacy, indeterminacy 5875
and neutrality about the moves and the effects of the cancer on that region; this event leads us 5876
to choose another model [it’s said to be Neutrosophic SuperHyperGraph] to have convenient 5877
perception on what’s happened and what’s done. There are some specific models, which are 5878
well-known and they’ve got the names, and some general models. The moves and the traces of 5879
the cancer on the complex tracks and between complicated groups of cells could be fantasized 5880
by a Neutrosophic SuperHyperPath (-/SuperHyperUnequal Connective Dominating, SuperHyperStar, 5881
SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find either the 5882
optimal SuperHyperUnequal Connective Dominating or the Neutrosophic SuperHyperUnequal Connective 5883
Dominating in those Neutrosophic SuperHyperModels. Some general results are introduced. 5884
Beyond that in SuperHyperStar, all possible Neutrosophic SuperHyperPath s have only two 5885
Connective Dominating. It, literarily, deforms and it doesn’t form. 5889
amount of SuperHyperUnequal Connective Dominating” of either individual of cells or the groups of cells 5891
based on the fixed cell or the fixed group of cells, extensively, the “amount of SuperHyperUnequal 5892
Connective Dominating” based on the fixed groups of cells or the fixed groups of group of cells? 5893
Question 28.0.2. What are the best descriptions for the “Cancer’s Recognition” in terms of 5894
these messy and dense SuperHyperModels where embedded notions are illustrated? 5895
Thus it motivates us to define different types of “ SuperHyperUnequal Connective Dominating” and 5897
“Neutrosophic SuperHyperUnequal Connective Dominating” on “SuperHyperGraph” and “Neutrosophic 5898

SuperHyperGraph”. Then the research has taken more motivations to define SuperHyperClasses 5899
and to find some connections amid this SuperHyperNotion with other SuperHyperNotions. It 5900
motivates us to get some instances and examples to make clarifications about the framework of 5901
this research. The general results and some results about some connections are some avenues to 5902
make key point of this research, “Cancer’s Recognition”, more understandable and more clear. 5903
The framework of this research is as follows. In the beginning, I introduce basic definitions 5904
to clarify about preliminaries. In the subsection “Preliminaries”, initial definitions about 5905
SuperHyperGraphs and Neutrosophic SuperHyperGraph are deeply-introduced and in-depth- 5906
discussed. The elementary concepts are clarified and illustrated completely and sometimes 5907
review literature are applied to make sense about what’s going to figure out about the 5908
upcoming sections. The main definitions and their clarifications alongside some results 5909
about new notions, SuperHyperUnequal Connective Dominating and Neutrosophic SuperHyperUnequal 5910
Connective Dominating, are figured out in sections “ SuperHyperUnequal Connective Dominating” and 5911
“Neutrosophic SuperHyperUnequal Connective Dominating”. In the sense of tackling on getting 5912
results and in Unequal Connective Dominating to make sense about continuing the research, the 5913
ideas of SuperHyperUniform and Neutrosophic SuperHyperUniform are introduced and 5914
as their consequences, corresponded SuperHyperClasses are figured out to debut what’s 5915
done in this section, titled “Results on SuperHyperClasses” and “Results on Neutrosophic 5916

SuperHyperClasses”. As going back to origin of the notions, there are some smart steps toward 5917
the common notions to extend the new notions in new frameworks, SuperHyperGraph and 5918
Neutrosophic SuperHyperGraph, in the sections “Results on SuperHyperClasses” and “Results on 5919
Neutrosophic SuperHyperClasses”. The starter research about the general SuperHyperRelations 5920
and as concluding and closing section of theoretical research are contained in the section “General 5921
Results”. Some general SuperHyperRelations are fundamental and they are well-known as 5922
fundamental SuperHyperNotions as elicited and discussed in the sections, “General Results”, 5923
“ SuperHyperUnequal Connective Dominating”, “Neutrosophic SuperHyperUnequal Connective Dominating”, 5924
“Results on SuperHyperClasses” and “Results on Neutrosophic SuperHyperClasses”. There 5925
are curious questions about what’s done about the SuperHyperNotions to make sense about 5926
excellency of this research and going to figure out the word “best” as the description and adjective 5927
for this research as presented in section, “ SuperHyperUnequal Connective Dominating”. The keyword 5928
of this research debut in the section “Applications in Cancer’s Recognition” with two cases and 5929
subsections “Case 1: The Initial Steps Toward SuperHyperBipartite as SuperHyperModel” and 5930
“Case 2: The Increasing Steps Toward SuperHyperMultipartite as SuperHyperModel”. In the 5931
section, “Open Problems”, there are some scrutiny and discernment on what’s done and what’s 5932
happened in this research in the terms of “questions” and “problems” to make sense to figure 5933
out this research in featured style. The advantages and the limitations of this research alongside 5934
about what’s done in this research to make sense and to get sense about what’s figured out are 5935
included in the section, “Conclusion and Closing Remarks”. 5936

CHAPTER 29 5937
Neutrosophic Preliminaries Of This 5938
Scientific Research On the Redeemed 5939
Ways 5940
In this section, the basic material in this scientific research, is referred to [Single Valued Neut- 5941
rosophic Set](Ref.[HG11s],Definition 2.2,p.2), [Neutrosophic Set](Ref.[HG11s],Definition 5942

2.1,p.1), [Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG11s],Definition 2.5,p.2), [Charac- 5943
terization of the Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG11s],Definition 2.7,p.3), 5944
[t-norm](Ref.[HG11s], Definition 2.7, p.3), and [Characterization of the Neutrosophic Super- 5945
HyperGraph (NSHG)](Ref.[HG11s],Definition 2.7,p.3), [Neutrosophic Strength of the Neutro- 5946
sophic SuperHyperPaths] (Ref.[HG11s],Definition 5.3,p.7), and [Different Neutrosophic Types 5947
of Neutrosophic SuperHyperEdges (NSHE)] (Ref.[HG11s],Definition 5.4,p.7). Also, the new 5948

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

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

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

TA (x), IA (x), FA (x) >, x ∈ X}:
TA (X) = min[TA (vi ), TA (vj )]vi ,vj ∈X ,
IA (X) = min[IA (vi ), IA (vj )]vi ,vj ∈X ,
and FA (X) = min[FA (vi ), FA (vj )]vi ,vj ∈X .
TA (x), IA (x), FA (x) >, x ∈ X}:
Definition 29.0.5 (Neutrosophic SuperHyperGraph (NSHG)). (Ref.[HG11s],Definition 5953
2.5,p.2). 5954
Assume V 0 is a given set. a Neutrosophic SuperHyperGraph (NSHG) S is a pair 5955
S = (V, E), where 5956
1, 2, . . . , n0 ); 5961
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 5962
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 5963

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



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

A binary operation ⊗ : [0, 1] × [0, 1] → [0, 1] is a t-norm if it satisfies the following for 5993
x, y, z, w ∈ [0, 1]: 5994
(i) 1 ⊗ x = x; 5995
(ii) x ⊗ y = y ⊗ x; 5996
(iii) x ⊗ (y ⊗ z) = (x ⊗ y) ⊗ z; 5997
(iv) If w ≤ x and y ≤ z then w ⊗ y ≤ x ⊗ z. 5998

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

where 6001

1, 2, . . . , n0 ); 6006
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 6007
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 6008
P
(vii) i supp(Vi ) = V, (i = 1, 2, . . . , n); 6009
0 0
P
(viii) i0 supp(Ei ) = V, (i = 1, 2, . . . , n ). 6010
0

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

Definition 29.0.12. A graph is SuperHyperUniform if it’s SuperHyperGraph and the number 6037
of elements of SuperHyperEdges are the same. 6038
To get more visions on SuperHyperUniform, the some SuperHyperClasses are introduced. It 6039
makes to have SuperHyperUniform more understandable. 6040
Definition 29.0.13. Assume a Neutrosophic SuperHyperGraph. There are some SuperHyper- 6041
Classes as follows. 6042
(i). It’s Neutrosophic SuperHyperPath if it’s only one SuperVertex as intersection amid 6043
two given SuperHyperEdges with two exceptions; 6044
(ii). it’s SuperHyperCycle if it’s only one SuperVertex as intersection amid two given 6045
SuperHyperEdges; 6046
(iii). it’s SuperHyperStar it’s only one SuperVertex as intersection amid all SuperHyperEdges; 6047
(iv). it’s SuperHyperBipartite it’s only one SuperVertex as intersection amid two given Supe- 6048
rHyperEdges and these SuperVertices, forming two separate sets, has no SuperHyperEdge 6049
in common; 6050
(v). it’s SuperHyperMultiPartite it’s only one SuperVertex as intersection amid two 6051
given SuperHyperEdges and these SuperVertices, forming multi separate sets, has no 6052
SuperHyperEdge in common; 6053
(vi). it’s SuperHyperWheel if it’s only one SuperVertex as intersection amid two given 6054
SuperHyperEdges and one SuperVertex has one SuperHyperEdge with any common 6055
SuperVertex. 6056
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 6057
(NSHV) V1 to Neutrosophic SuperHyperVertex (NSHV) Vs if either of following conditions hold: 6058
(i) Vi , Vi+1 ∈ Ei0 ; 6059
(ii) there’s a vertex vi ∈ Vi such that vi , Vi+1 ∈ Ei0 ; 6060
(iii) there’s a SuperVertex Vi0 ∈ Vi such that Vi0 , Vi+1 ∈ Ei0 ; 6061
(iv) there’s a vertex vi+1 ∈ Vi+1 such that Vi , vi+1 ∈ Ei0 ; 6062
0 0
(v) there’s a SuperVertex Vi+1 ∈ Vi+1 such that Vi , Vi+1 ∈ E i0 ; 6063
(vi) there are a vertex vi ∈ Vi and a vertex vi+1 ∈ Vi+1 such that vi , vi+1 ∈ Ei0 ; 6064
0 0
(vii) there are a vertex vi ∈ Vi and a SuperVertex Vi+1 ∈ Vi+1 such that vi , Vi+1 ∈ Ei0 ; 6065
(viii) there are a SuperVertex Vi0 ∈ Vi and a vertex vi+1 ∈ Vi+1 such that Vi0 , vi+1 ∈ Ei0 ; 6066
(ix) there are a SuperVertex Vi0 ∈ Vi and a SuperVertex Vi+1

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

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. 6068
(i) If for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | = 2, then NSHP is called path; 6069
(ii) if for all Ej 0 , |Ej 0 | = 2, and there’s Vi , |Vi | ≥ 1, then NSHP is called SuperPath; 6070
(iii) if for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | ≥ 2, then NSHP is called HyperPath; 6071
(iv) if there are Vi , Ej 0 , |Vi | ≥ 1, |Ej 0 | ≥ 2, then NSHP is called Neutrosophic SuperHy- 6072
perPath . 6073
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 6074
(i) Neutrosophic t-strength (min{T (Vi )}, m, n)si=1 ; 6075
(ii) Neutrosophic i-strength (m, min{I(Vi )}, n)si=1 ; 6076
(iii) Neutrosophic f-strength (m, n, min{F (Vi )})si=1 ; 6077
(iv) Neutrosophic strength (min{T (Vi )}, min{I(Vi )}, min{F (Vi )})si=1 . 6078
Definition 29.0.17 (Different Neutrosophic Types of Neutrosophic SuperHyperEdges (NSHE)). 6079

(ix) Neutrosophic t-connective if T (E) ≥ maximum number of Neutrosophic t-strength 6083

(x) Neutrosophic i-connective if I(E) ≥ maximum number of Neutrosophic i-strength 6086


(xi) Neutrosophic f-connective if F (E) ≥ maximum number of Neutrosophic f-strength 6089

(xii) Neutrosophic connective if (T (E), I(E), F (E)) ≥ maximum number of Neutrosophic 6092
strength of SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex (NSHV) Vi 6093
to Neutrosophic SuperHyperVertex (NSHV) Vj where 1 ≤ i, j ≤ s. 6094
Definition 29.0.18. (Different Neutrosophic Types of Neutrosophic SuperHyperUnequal Connective 6095

Dominating). 6096
(i) Neutrosophic e-SuperHyperUnequal Connective Dominating if the following expression is 6100

called Neutrosophic e-SuperHyperUnequal Connective Dominating criteria holds 6101

(ii) Neutrosophic re-SuperHyperUnequal Connective Dominating if the following expression 6102

is called Neutrosophic re-SuperHyperUnequal Connective Dominating criteria holds 6103

and |Ei |NEUTROSOPHIC CARDINALITY = |Ej |NEUTROSOPHIC CARDINALITY ; 6104
(iii) Neutrosophic v-SuperHyperUnequal Connective Dominating if the following expression is 6105
called Neutrosophic v-SuperHyperUnequal Connective Dominating criteria holds 6106


(iv) Neutrosophic rv-SuperHyperUnequal Connective Dominating if the following expression 6107

is called Neutrosophic v-SuperHyperUnequal Connective Dominating criteria holds 6108

and |Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; 6109
(v) Neutrosophic SuperHyperUnequal Connective Dominating if it’s either of Neutro- 6110

Definition 29.0.19. ((Neutrosophic) SuperHyperUnequal Connective Dominating). 6114

(i) an Extreme SuperHyperUnequal Connective Dominating if it’s either of Neutrosophic 6117

e-SuperHyperUnequal Connective Dominating, Neutrosophic re-SuperHyperUnequal Connective Dom- 6118
inating, Neutrosophic v-SuperHyperUnequal Connective Dominating, and Neutrosophic rv- 6119
(ii) a Neutrosophic SuperHyperUnequal Connective Dominating if it’s either of Neutro- 6125

form the Neutrosophic SuperHyperUnequal Connective Dominating; 6132
(iii) an Extreme SuperHyperUnequal Connective Dominating SuperHyperPolynomial if 6133

it’s either of Neutrosophic e-SuperHyperUnequal Connective Dominating, Neutrosophic re- 6134
of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme 6139

(iv) a Neutrosophic SuperHyperUnequal Connective Dominating SuperHyperPolynomial 6143


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

high Extreme cardinality of the Extreme SuperHyperVertices in the consecutive Extreme 6159
(vi) a Neutrosophic V-SuperHyperUnequal Connective Dominating if it’s either of Neutro- 6162

N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic Supe- 6166
rHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 6167
that they form the Neutrosophic SuperHyperUnequal Connective Dominating; 6169
(vii) an Extreme V-SuperHyperUnequal Connective Dominating SuperHyperPolynomial 6170


(viii) a Neutrosophic SuperHyperUnequal Connective Dominating SuperHyperPolynomial 6180



136TBL3

Definition 29.0.20. ((Extreme/Neutrosophic)δ−SuperHyperUnequal Connective Dominating). 6191
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Then 6192
(i) an δ−SuperHyperUnequal Connective Dominating is a Neutrosophic kind of Neutrosophic 6193
SuperHyperUnequal Connective Dominating such that either of the following expressions hold for 6194
the Neutrosophic cardinalities of SuperHyperNeighbors of s ∈ S : 6195
|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 6196

(29.1), holds if S is an δ−SuperHyperDefensive; 6197
(ii) a Neutrosophic δ−SuperHyperUnequal Connective Dominating is a Neutrosophic kind 6198

of Neutrosophic SuperHyperUnequal Connective Dominating such that either of the following 6199
Neutrosophic expressions hold for the Neutrosophic cardinalities of SuperHyperNeighbors 6200

of s ∈ S : 6201
|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 6202

the Expression (29.1), holds if S is a Neutrosophic δ−SuperHyperDefensive. 6203
“redefine” the notion of “Neutrosophic SuperHyperGraph”. The SuperHyperVertices and the 6205
SuperHyperEdges are assigned by the labels from the letters of the alphabets. In this procedure, 6206
there’s the usage of the position of labels to assign to the values. 6207
136DEF1 Definition 29.0.21. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 6208
It’s redefined Neutrosophic SuperHyperGraph if the Table (29.1) holds. 6209
It’s useful to define a “Neutrosophic” version of SuperHyperClasses. Since there’s more ways 6210
to get Neutrosophic type-results to make a Neutrosophic more understandable. 6211

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

136TBL4

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

(V, E). There are some Neutrosophic SuperHyperClasses if the Table (29.2) holds. 6213
Thus Neutrosophic SuperHyperPath , SuperHyperUnequal Connective Dominating, SuperHyperStar, 6214
SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, are Neutrosophic 6215
SuperHyperPath, Neutrosophic SuperHyperCycle, Neutrosophic SuperHyperStar, 6216

Neutrosophic SuperHyperBipartite, Neutrosophic SuperHyperMultiPartite, and 6217
Neutrosophic SuperHyperWheel if the Table (29.2) holds. 6218
It’s useful to define a “Neutrosophic” version of a Neutrosophic SuperHyperUnequal Connective 6219

Dominating . Since there’s more ways to get type-results to make a Neutrosophic SuperHyperUnequal 6220
Connective Dominating more Neutrosophicly understandable. 6221
“redefine” the Neutrosophic notion of “Neutrosophic SuperHyperUnequal Connective Dominating”. The 6223
6226
136DEF1 Definition 29.0.23. Assume a SuperHyperUnequal Connective Dominating. It’s redefined a Neutro- 6227
sophic SuperHyperUnequal Connective Dominating if the Table (29.3) holds. 6228

CHAPTER 30 6229
Neutrosophic SuperHyper But Unequal Connective Dominating 6230
As The Extensions Excerpt From Dense 6231
And Super Forms 6232
Definition 30.0.1. (Neutrosophic event). 6233
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) 6234
is a probability Unequal Connective Dominating. Any Neutrosophic k-subset of A of V is called 6235
Neutrosophic k-event and if k = 2, then Neutrosophic subset of A of V is called 6236
Neutrosophic event. The following expression is called Neutrosophic probability of 6237
A. 6238
X
E(A) = E(a). (30.1)
a∈A
Definition 30.0.2. (Neutrosophic Independent). 6239

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 6240
S = (V, E) is a probability Unequal Connective Dominating. s Neutrosophic k-events Ai , i ∈ I is 6241
called Neutrosophic s-independent if the following expression is called Neutrosophic 6242
s-independent criteria 6243
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. 6244

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

is a probability Unequal Connective Dominating. Any k-function Unequal Connective Dominating like E is 6248
called Neutrosophic k-Variable. If k = 2, then any 2-function Unequal Connective Dominating like 6249
E is called Neutrosophic Variable. 6250
The notion of independent on Neutrosophic Variable is likewise. 6251
283
Definition 30.0.4. (Neutrosophic Expectation). 6252

is a probability Unequal Connective Dominating. A Neutrosophic k-Variable E has a number is called 6254
Neutrosophic Expectation if the following expression is called Neutrosophic Expectation 6255
criteria 6256
X
Ex(E) = E(α)P (α).
α∈V
Definition 30.0.5. (Neutrosophic Crossing). 6257

is a probability Unequal Connective Dominating. A Neutrosophic number is called Neutrosophic 6259

Crossing if the following expression is called Neutrosophic Crossing criteria 6260
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). 6261
Consider S = (V, E) is a probability Unequal Connective Dominating. Let m and n propose special Unequal 6262
Connective Dominating. Then with m ≥ 4n, 6263
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 Unequal Connective Dominating p := 4n/m, and set H := G[S] and
H := G[S].
Define random variables X, Y, Z on V as follows: X is the Neutrosophic number of
SuperHyperVertices, Y the Neutrosophic number of SuperHyperEdges, and Z the Neutrosophic
number of crossings of H. The trivial bound noted above, when applied to H, yields the
inequality Z ≥ cr(H) ≥ Y − 3X. By linearity of Neutrosophic Expectation,
E(Z) ≥ E(Y ) − 3E(X).
Now E(X) = pn, E(Y ) = p2 m (each SuperHyperEdge having some SuperHyperEnds) and
E(Z) = p4 cr(G) (each crossing being defined by some SuperHyperVertices). Hence
p4 cr(G) ≥ p2 m − 3pn.
Dividing both sides by p4 , we have: 6264
pm − 3n n 1 3 2
cr(G) ≥ 3
= 3 = m n .
p (4n/m) 64
6265
Theorem 30.0.7. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 6266
points in the plane, and let l be the Neutrosophic number of√SuperHyperLines in the plane 6268
passing through at least k + 1 of these points, where 1 ≤ k ≤ 2 2n. Then l < 32n2 /k 3 . 6269

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

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

points in the plane, and let k be the number of pairs of points of P at unit SuperHyperDistance. 6278
Then k < 5n4/3 . 6279
Proof. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 6280
S = (V, E) is a probability Unequal Connective Dominating. Draw a SuperHyperUnit SuperHyperCircle 6281
around each SuperHyperPoint of P. Let ni be the P Neutrosophic number of these P SuperHyper- 6282
Circles passing through exactly i points of P. Then i = 0n−1 ni = n and k = 12 i = 0n−1 ini . 6283
Now form a Neutrosophic SuperHyperGraph H with SuperHyperVertex SuperHyperSet P 6284
whose SuperHyperEdges are the SuperHyperArcs between consecutive SuperHyperPoints on 6285
the SuperHyperCircles that pass through at least three SuperHyperPoints of P. Then 6286
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 6287
SuperHyperEdges. Delete from H one of each SuperHyperPair of parallel SuperHyperEdges, 6288

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

Corollary 30.0.10. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 6298
Consider S = (V, E) is a probability Unequal Connective Dominating. Let Xn be a nonnegative integer- 6299
valued variable in a probability Unequal Connective Dominating (Vn , En ), n ≥ 1. If E(Xn ) → 0 as 6300
n → ∞, then P (Xn = 0) → 1 as n → ∞. 6301
Proof. 6302
Consider S = (V, E) is a probability Unequal Connective Dominating. A special SuperHyperGraph in 6304
Gn,p almost surely has stability number at most d2p−1 log ne. 6305
S = (V, E) is a probability Unequal Connective Dominating. A special SuperHyperGraph in Gn,p is 6307
up. Let G ∈ Gn,p and let S be a given SuperHyperSet of k + 1 SuperHyperVertices of G, 6308
where k ∈ N. The probability that S is a stable SuperHyperSet of G is (1 − p)(k+1)choose2 , this 6309
being the probability that none of the (k + 1)choose2 pairs of SuperHyperVertices of S is a 6310
SuperHyperEdge of the Neutrosophic SuperHyperGraph G. 6311
Let AS denote the event that S is a stable SuperHyperSet of G, and let XS denote the indicator 6312
Neutrosophic Variable for this Neutrosophic Event. By equation, we have 6313
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 6314
X
X= {XS : S ⊆ V, |S| = k + 1}
and so, by those, 6315

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: 6316
nk+1
(n choose k+1) ≤ and1 − p ≤ e−p .
(k + 1)!
This yields the following upper bound on E(X). 6317
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 6318
least as fast as the logarithm of n, implies that E(X) → 0 as n → ∞. Because X is integer-valued 6319
and nonnegative, we deduce from Corollary that P (X = 0) → 1 as n → ∞. Consequently, a 6320
Neutrosophic SuperHyperGraph in Gn,p almost surely has stability number at most k. 6321
Definition 30.0.12. (Neutrosophic Variance). 6322
is a probability Unequal Connective Dominating. A Neutrosophic k-Variable E has a number is 6324
called Neutrosophic Variance if the following expression is called Neutrosophic Variance 6325
criteria 6326
2
V x(E) = Ex((X − Ex(X)) ).

Consider S = (V, E) is a probability Unequal Connective Dominating. Let X be a Neutrosophic Variable 6328
and let t be a positive real number. Then 6329
V (X)
E(|X − Ex(X)| ≥ t) ≤ .
t2
S = (V, E) is a probability Unequal Connective Dominating. Let X be a Neutrosophic Variable and let 6331
t be a positive real number. Then 6332
2
2 Ex((X − Ex(X)) ) V (X)
E(|X − Ex(X)| ≥ t) = E((X − Ex(X)) ≥ t2 ) ≤ 2
= .
t t2
6333
Consider S = (V, E) is a probability Unequal Connective Dominating. Let Xn be a Neutrosophic Variable 6335
in a probability Unequal Connective Dominating (Vn , En ), n ≥ 1. If Ex(Xn ) 6= 0 and V (Xn ) << E 2 (Xn ), 6336
then 6337
E(Xn = 0) → 0 as n → ∞
S = (V, E) is a probability Unequal Connective Dominating. Set X := Xn and t := |Ex(Xn )| in 6339
Chebyshev’s Inequality, and observe that E(Xn = 0) ≤ E(|Xn − Ex(Xn )| ≥ |Ex(Xn )|) because 6340
|Xn − Ex(Xn )| = |Ex(Xn )| when Xn = 0. 6341
Consider S = (V, E) is a probability Unequal Connective Dominating. Let G ∈ Gn,1/2 . For 0 ≤ k ≤ n, set 6343
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 6344
one. Then almost surely α(G) takes one of the three values k ∗ − 2, k ∗ − 1, k ∗ . 6345
S = (V, E) is a probability Unequal Connective Dominating. As in the proof of related Theorem, the 6347
result is straightforward. 6348
Consider S = (V, E) is a probability Unequal Connective Dominating. Let G ∈ Gn,1/2 and let f and k ∗ 6350
be as defined in previous Theorem. Then either: 6351
(i). f (k ∗ ) << 1, in which case almost surely α(G) is equal to either k ∗ − 2 or k ∗ − 1, or 6352
(ii). f (k ∗ − 1) >> 1, in which case almost surely α(G) is equal to either k ∗ − 1 or k ∗ . 6353

Definition 30.0.17. (Neutrosophic Threshold). 6356

is a probability Unequal Connective Dominating. Let P be a monotone property of SuperHyperGraphs 6358
(one which is preserved when SuperHyperEdges are added). Then a Neutrosophic Threshold 6359
for P is a function f (n) such that: 6360
(i). if p << f (n), then G ∈ Gn,p almost surely does not have P, 6361
(ii). if p >> f (n), then G ∈ Gn,p almost surely has P. 6362
Definition 30.0.18. (Neutrosophic Balanced). 6363
is a probability Unequal Connective Dominating. Let F be a fixed Neutrosophic SuperHyperGraph. 6365
Then there is a threshold function for the property of containing a copy of F as a Neutrosophic 6366
SubSuperHyperGraph is called Neutrosophic Balanced. 6367
Theorem 30.0.19. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = 6368

(V, E). Consider S = (V, E) is a probability Unequal Connective Dominating. Let F be a nonempty 6369
balanced Neutrosophic SubSuperHyperGraph with k SuperHyperVertices and l SuperHyperEdges. 6370
Then n−k/l is a threshold function for the property of containing F as a Neutrosophic 6371
SubSuperHyperGraph. 6372
136EXM1 Example 30.0.20. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E) 6375
in the mentioned Neutrosophic Figures in every Neutrosophic items. 6376
• On the Figure (30.1), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 6377
SuperHyperUnequal Connective Dominating, is up. The Neutrosophic Algorithm is Neutrosophicly 6378

straightforward. E1 and E3 are some empty Neutrosophic SuperHyperEdges but E2 6379
is a loop Neutrosophic SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. 6380
Thus in the terms of Neutrosophic SuperHyperNeighbor, there’s only one Neutrosophic 6381
SuperHyperEdge, namely, E4 . The Neutrosophic SuperHyperVertex, V3 is Neutrosophic 6382
isolated means that there’s no Neutrosophic SuperHyperEdge has it as a Neutrosophic 6383
endpoint. Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in every given 6384

Neutrosophic SuperHyperUnequal Connective Dominating. 6385
C(N SHG)Neutrosophic Unequal Connective Dominating =

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

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

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

straightforward. E1 , E2 and E3 are some empty Neutrosophic SuperHyperEdges 6389
but E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of Neutrosophic 6390
SuperHyperNeighbor, there’s only one Neutrosophic SuperHyperEdge, namely, E4 . The 6391
Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means that there’s no 6392
Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. Thus the Neutrosophic 6393
SuperHyperVertex, V3 , is excluded in every given Neutrosophic SuperHyperUnequal Connective 6394

Dominating. 6395

{}.
= 0z 0 .
{}.
= 0z 0 .
6396



{}.
= 0z 0 .
{}.
= 0z 0 .
6400


{}.
= 0z 0 .




{}.
= 0z 0 .
6404




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


{Ei }22
i=12 .



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


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


= z 3−a .
6416


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



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

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


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


= z 3−a .
6428


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






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


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



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


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




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




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


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



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


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






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


{E6 }.
= z 4−a .



{V1 }.
= z 6−a .
6468


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


Neutrosophic SuperHyperUnequal Connective Dominating in the Neutrosophic Example (42.0.3) 95NHG1
6472


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


Neutrosophic SuperHyperUnequal Connective Dominating in the Neutrosophic Example (42.0.3) 95NHG2
6476
Proposition 30.0.21. Assume a connected Neutrosophic SuperHyperGraph ESHG : (V, E). The 6477
all interior Neutrosophic SuperHyperVertices belong to any Neutrosophic quasi-R-Unequal Connective 6478
Dominating if for any of them, and any of other corresponded Neutrosophic SuperHyperVertex, 6479
some interior Neutrosophic SuperHyperVertices are mutually Neutrosophic SuperHyperNeighbors 6480
with no Neutrosophic exception at all minus all Neutrosophic SuperHypeNeighbors to any amount 6481
of them. 6482
Proposition 30.0.22. Assume a connected non-obvious Neutrosophic SuperHyperGraph ESHG : 6483

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

It’s straightforward that the Neutrosophic cardinality of the Neutrosophic R-Unequal Connective 6491
Dominating is at least the maximum Neutrosophic number of Neutrosophic SuperHyperVertices 6492
of the Neutrosophic SuperHyperEdges with the maximum number of the Neutrosophic 6493
SuperHyperEdges. In other words, the maximum number of the Neutrosophic SuperHyperEdges 6494
contains the maximum Neutrosophic number of Neutrosophic SuperHyperVertices are renamed to 6495
Neutrosophic Unequal Connective Dominating in some cases but the maximum number of the Neutrosophic 6496
SuperHyperEdge with the maximum Neutrosophic number of Neutrosophic SuperHyperVertices, 6497

has the Neutrosophic SuperHyperVertices are contained in a Neutrosophic R-Unequal Connective 6498
Dominating. 6499
Proposition 30.0.24. Assume a simple Neutrosophic SuperHyperGraph ESHG : (V, E). Then
the Neutrosophic number of type-result-R-Unequal Connective Dominating has, the least Neutrosophic
cardinality, the lower sharp Neutrosophic bound for Neutrosophic cardinality, is the Neutrosophic
cardinality of
V \ V \ {aE , bE 0 , cE 00 , cE 000 }E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .
If there’s a Neutrosophic type-result-R-Unequal Connective Dominating with the least Neutrosophic 6500
cardinality, the lower sharp Neutrosophic bound for cardinality. 6501
Proposition 30.0.25. Assume a connected loopless Neutrosophic SuperHyperGraph ESHG : 6502
(V, E). Then in the worst case, literally, 6503
C(N SHG)N eutrosophicQuasi−U nequalConnectiveDominating

= {V1 , E1 , V2 , E2 , V3 , E3 , V4 , E4 , V1 }.
C(N SHG)N eutrosophicQuasi−U nequalConnectiveDominatingSuperHyperP olynomial = z 4 .
C(N SHG)N eutrosophicQuasi−U nequalConnectiveDominating = {V1 , V2 , V3 , V4 , V1 }.
C(N SHG)N eutrosophicR−Quasi−U nequalConnectiveDominatingSuperHyperP olynomial = z 5 .
Is a Neutrosophic type-result-Unequal Connective Dominating. In other words, the least cardinality, the 6504
lower sharp bound for the cardinality, of a Neutrosophic type-result-Unequal Connective Dominating is 6505
the cardinality of 6506

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

This Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices has the eligibilities

to propose property such that there’s no Neutrosophic SuperHyperVertex of a Neutrosophic
SuperHyperEdge is common and there’s an Neutrosophic SuperHyperEdge for all Neutrosophic
SuperHyperVertices but the maximum Neutrosophic cardinality indicates that these Neutro-
sophic type-SuperHyperSets couldn’t give us the Neutrosophic lower bound in the term of
Neutrosophic sharpness. In other words, the Neutrosophic SuperHyperSet
of the Neutrosophic SuperHyperVertices implies at least on-quasi-triangle style is up but

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

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

the maximum Neutrosophic cardinality in the terms of Neutrosophic SuperHyperVertices

are spotlight. The lower Neutrosophic bound is to have the maximum Neutrosophic
groups of Neutrosophic SuperHyperVertices have perfect Neutrosophic connections inside
each of SuperHyperEdges and the outside of this Neutrosophic SuperHyperSet doesn’t
matter but regarding the connectedness of the used Neutrosophic SuperHyperGraph arising
from its Neutrosophic properties taken from the fact that it’s simple. If there’s no more
than one Neutrosophic SuperHyperVertex in the targeted Neutrosophic SuperHyperSet,
then there’s no Neutrosophic connection. Furthermore, the Neutrosophic existence of one
Neutrosophic SuperHyperVertex has no Neutrosophic effect to talk about the Neutrosophic
R-Unequal Connective Dominating. Since at least two Neutrosophic SuperHyperVertices involve
to make a title in the Neutrosophic background of the Neutrosophic SuperHyperGraph.
The Neutrosophic SuperHyperGraph is obvious if it has no Neutrosophic SuperHyperEdge
but at least two Neutrosophic SuperHyperVertices make the Neutrosophic version of
Neutrosophic SuperHyperEdge. Thus in the Neutrosophic setting of non-obvious Neutrosophic
SuperHyperGraph, there are at least one Neutrosophic SuperHyperEdge. It’s necessary to
mention that the word “Simple” is used as Neutrosophic adjective for the initial Neutrosophic
SuperHyperGraph, induces there’s no Neutrosophic appearance of the loop Neutrosophic version
of the Neutrosophic SuperHyperEdge and this Neutrosophic SuperHyperGraph is said to be
loopless. The Neutrosophic adjective “loop” on the basic Neutrosophic framework engages one
Neutrosophic SuperHyperVertex but it never happens in this Neutrosophic setting. With these
Neutrosophic bases, on a Neutrosophic SuperHyperGraph, there’s at least one Neutrosophic
SuperHyperEdge thus there’s at least a Neutrosophic R-Unequal Connective Dominating has the
Neutrosophic cardinality of a Neutrosophic SuperHyperEdge. Thus, a Neutrosophic R-Unequal
Connective Dominating has the Neutrosophic cardinality at least a Neutrosophic SuperHyperEdge.
Assume a Neutrosophic SuperHyperSet V \ V \ {z}. This Neutrosophic SuperHyperSet isn’t a

Neutrosophic R-Unequal Connective Dominating since either the Neutrosophic SuperHyperGraph is an
obvious Neutrosophic SuperHyperModel thus it never happens since there’s no Neutrosophic
usage of this Neutrosophic framework and even more there’s no Neutrosophic connection
inside or the Neutrosophic SuperHyperGraph isn’t obvious and as its consequences, there’s a
Neutrosophic contradiction with the term “Neutrosophic R-Unequal Connective Dominating” since the
maximum Neutrosophic cardinality never happens for this Neutrosophic style of the Neutrosophic
SuperHyperSet and beyond that there’s no Neutrosophic connection inside as mentioned in first
Neutrosophic case in the forms of drawback for this selected Neutrosophic SuperHyperSet. Let
Comes up. This Neutrosophic case implies having the Neutrosophic style of on-quasi-triangle
Neutrosophic style on the every Neutrosophic elements of this Neutrosophic SuperHyperSet.
Precisely, the Neutrosophic R-Unequal Connective Dominating is the Neutrosophic SuperHyperSet of
the Neutrosophic SuperHyperVertices such that some Neutrosophic amount of the Neutrosophic
SuperHyperVertices are on-quasi-triangle Neutrosophic style. The Neutrosophic cardinality of
the v SuperHypeSet
Is the maximum in comparison to the Neutrosophic SuperHyperSet


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

Contains some Neutrosophic SuperHyperVertices such that there’s distinct-covers-order-amount

Neutrosophic SuperHyperEdges for amount of Neutrosophic SuperHyperVertices taken from
the Neutrosophic SuperHyperSet
It means that the Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices

Is a Neutrosophic R-Unequal Connective Dominating for the Neutrosophic SuperHyperGraph as used

Neutrosophic background in the Neutrosophic terms of worst Neutrosophic case and the common
theme of the lower Neutrosophic bound occurred in the specific Neutrosophic SuperHyperClasses
of the Neutrosophic SuperHyperGraphs which are Neutrosophic free-quasi-triangle.
Assume a Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) has z Neutrosophic number of
the Neutrosophic SuperHyperVertices. Then every Neutrosophic SuperHyperVertex has at
least no Neutrosophic SuperHyperEdge with others in common. Thus those Neutrosophic
SuperHyperVertices have the eligibles to be contained in a Neutrosophic R-Unequal Connective
Dominating. Those Neutrosophic SuperHyperVertices are potentially included in a Neutrosophic
style-R-Unequal Connective Dominating. Formally, consider
V \ (V \ {aE , bE , cE , . . . , zE }).
Are the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) .
Thus
Zi ∼ Zj , i 6= j, i, j = 1, 2, . . . , z.
where the ∼ isn’t an equivalence relation but only the symmetric relation on the Neutrosophic
SuperHyperVertices of the Neutrosophic SuperHyperGraph. The formal definition is as follows.
Zi ∼ Zj , i 6= j, i, j = 1, 2, . . . , z

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

z
and
is formalized with mathematical literatures on the Neutrosophic R-Unequal Connective Dominating.

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

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

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

EESHG:(V,E) is fixed that means Ex = E ∈ EESHG:(V,E) . for all Neutrosophic intended
SuperHyperVertices but in a Neutrosophic Unequal Connective Dominating, Ex = E ∈ EESHG:(V,E)
could be different and it’s not unique. To sum them up, in a connected Neutrosophic
SuperHyperGraph ESHG : (V, E). If a Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E)
has z Neutrosophic SuperHyperVertices, then the Neutrosophic cardinality of the Neutrosophic
R-Unequal Connective Dominating is at least
V \ (V \ {aE , bE , cE , . . . , zE }).
It’s straightforward that the Neutrosophic cardinality of the Neutrosophic R-Unequal Connective 6509
Dominating is at least the maximum Neutrosophic number of Neutrosophic SuperHyperVertices of 6510

the Neutrosophic SuperHyperEdges with the maximum number of the Neutrosophic SuperHy- 6511
perEdges. In other words, the maximum number of the Neutrosophic SuperHyperEdges contains 6512
the maximum Neutrosophic number of Neutrosophic SuperHyperVertices are renamed to Neut- 6513
rosophic Unequal Connective Dominating in some cases but the maximum number of the Neutrosophic 6514
SuperHyperEdge with the maximum Neutrosophic number of Neutrosophic SuperHyperVertices, 6515
has the Neutrosophic SuperHyperVertices are contained in a Neutrosophic R-Unequal Connective 6516
Dominating. 6517
The obvious SuperHyperGraph has no Neutrosophic SuperHyperEdges. But the non-obvious 6518
Neutrosophic SuperHyperModel is up. The quasi-SuperHyperModel addresses some issues about 6519
the Neutrosophic optimal SuperHyperObject. It specially delivers some remarks on the Neutro- 6520
sophic SuperHyperSet of the Neutrosophic SuperHyperVertices such that there’s distinct amount 6521
of Neutrosophic SuperHyperEdges for distinct amount of Neutrosophic SuperHyperVertices up 6522
to all taken from that Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices 6523
but this Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices is either has 6524
the maximum Neutrosophic SuperHyperCardinality or it doesn’t have maximum Neutrosophic 6525
SuperHyperCardinality. In a non-obvious SuperHyperModel, there’s at least one Neutrosophic 6526
SuperHyperEdge containing at least all Neutrosophic SuperHyperVertices. Thus it forms a 6527
Neutrosophic quasi-R-Unequal Connective Dominating where the Neutrosophic completion of the Neut- 6528
rosophic incidence is up in that. Thus it’s, literarily, a Neutrosophic embedded R-Unequal Connective 6529
Dominating. The SuperHyperNotions of embedded SuperHyperSet and quasi-SuperHyperSet 6530
coincide. In the original setting, these types of SuperHyperSets only don’t satisfy on the 6531
maximum SuperHyperCardinality. Thus the embedded setting is elected such that those Super- 6532
HyperSets have the maximum Neutrosophic SuperHyperCardinality and they’re Neutrosophic 6533
SuperHyperOptimal. The less than two distinct types of Neutrosophic SuperHyperVertices are 6534
included in the minimum Neutrosophic style of the embedded Neutrosophic R-Unequal Connective 6535
Dominating. The interior types of the Neutrosophic SuperHyperVertices are deciders. Since the 6536
Neutrosophic number of SuperHyperNeighbors are only affected by the interior Neutrosophic Su- 6537
perHyperVertices. The common connections, more precise and more formal, the perfect unique 6538
connections inside the Neutrosophic SuperHyperSet for any distinct types of Neutrosophic 6539
SuperHyperVertices pose the Neutrosophic R-Unequal Connective Dominating. Thus Neutrosophic 6540
exterior SuperHyperVertices could be used only in one Neutrosophic SuperHyperEdge and in 6541
Neutrosophic SuperHyperRelation with the interior Neutrosophic SuperHyperVertices in that 6542
Neutrosophic SuperHyperEdge. In the embedded Neutrosophic Unequal Connective Dominating, there’s 6543
the usage of exterior Neutrosophic SuperHyperVertices since they’ve more connections inside 6544
more than outside. Thus the title “exterior” is more relevant than the title “interior”. One Neut- 6545
rosophic SuperHyperVertex has no connection, inside. Thus, the Neutrosophic SuperHyperSet 6546
of the Neutrosophic SuperHyperVertices with one SuperHyperElement has been ignored in the 6547
exploring to lead on the optimal case implying the Neutrosophic R-Unequal Connective Dominating. The 6548
Neutrosophic R-Unequal Connective Dominating with the exclusion of the exclusion of all Neutrosophic 6549
SuperHyperVertices in one Neutrosophic SuperHyperEdge and with other terms, the Neutro- 6550
sophic R-Unequal Connective Dominating with the inclusion of all Neutrosophic SuperHyperVertices in 6551
one Neutrosophic SuperHyperEdge, is a Neutrosophic quasi-R-Unequal Connective Dominating. To sum 6552

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

but not all of them. In other words, there’s only an unique Neutrosophic SuperHyperEdge 6557
E ∈ EESHG:(V,E) has only two distinct Neutrosophic SuperHyperVertices in an Neutrosophic 6558
quasi-R-Unequal Connective Dominating, minus all Neutrosophic SuperHypeNeighbor to some of them 6559
but not all of them. 6560
The main definition of the Neutrosophic R-Unequal Connective Dominating has two titles. a Neut- 6561
rosophic quasi-R-Unequal Connective Dominating and its corresponded quasi-maximum Neutrosophic 6562
R-SuperHyperCardinality are two titles in the terms of quasi-R-styles. For any Neutrosophic 6563
number, there’s a Neutrosophic quasi-R-Unequal Connective Dominating with that quasi-maximum 6564
Neutrosophic SuperHyperCardinality in the terms of the embedded Neutrosophic SuperHy- 6565
perGraph. If there’s an embedded Neutrosophic SuperHyperGraph, then the Neutrosophic 6566
quasi-SuperHyperNotions lead us to take the collection of all the Neutrosophic quasi-R-Unequal 6567
Connective Dominatings for all Neutrosophic numbers less than its Neutrosophic corresponded max- 6568
imum number. The essence of the Neutrosophic Unequal Connective Dominating ends up but this 6569
essence starts up in the terms of the Neutrosophic quasi-R-Unequal Connective Dominating, again and 6570
more in the operations of collecting all the Neutrosophic quasi-R-Unequal Connective Dominatings 6571
acted on the all possible used formations of the Neutrosophic SuperHyperGraph to achieve one 6572
Neutrosophic number. This Neutrosophic number is 6573
considered as the equivalence class for all corresponded quasi-R-Unequal Connective Dominatings. 6574
Let zNeutrosophic Number , SNeutrosophic SuperHyperSet and GNeutrosophic Unequal Connective Dominating be 6575
a Neutrosophic number, a Neutrosophic SuperHyperSet and a Neutrosophic Unequal Connective 6576
Dominating. Then 6577
[zNeutrosophic Number ]Neutrosophic Class = {SNeutrosophic SuperHyperSet |

SNeutrosophic SuperHyperSet = GNeutrosophic Unequal Connective Dominating ,
|SNeutrosophic SuperHyperSet |Neutrosophic Cardinality
= zNeutrosophic Number }.
As its consequences, the formal definition of the Neutrosophic Unequal Connective Dominating is 6578
re-formalized and redefined as follows. 6579
GNeutrosophic Unequal Connective Dominating ∈ ∪zNeutrosophic Number

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

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


= zNeutrosophic Number |
= max zNeutrosophic Number }.
[zNeutrosophic Number ]Neutrosophic Class
In more concise and more convenient ways, the modified definition for the Neutrosophic Unequal 6582
poses the upcoming expressions.

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

= max zNeutrosophic Number

And then, 6585


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

6587

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


6588

[zNeutrosophic
Number ]Neutrosophic Class

6589


Now, the extension of these types of approaches is up. Since the new term, “Neutrosophic 6590
SuperHyperNeighborhood”, could be redefined as the collection of the Neutrosophic SuperHy- 6591
perVertices such that any amount of its Neutrosophic SuperHyperVertices are incident to a 6592
Neutrosophic SuperHyperEdge. It’s, literarily, another name for “Neutrosophic Quasi-Unequal 6593
Connective Dominating” but, precisely, it’s the generalization of “Neutrosophic Quasi-Unequal Connective 6594
Dominating” since “Neutrosophic Quasi-Unequal Connective Dominating” happens “Neutrosophic Unequal 6595
Connective Dominating” in a Neutrosophic SuperHyperGraph as initial framework and background 6596

but “Neutrosophic SuperHyperNeighborhood” may not happens “Neutrosophic Unequal Connective 6597
Dominating” in a Neutrosophic SuperHyperGraph as initial framework and preliminarily back- 6598
ground since there are some ambiguities about the Neutrosophic SuperHyperCardinality arise 6599
from it. To get orderly keywords, the terms, “Neutrosophic SuperHyperNeighborhood”, “Neut- 6600
rosophic Quasi-Unequal Connective Dominating”, and “Neutrosophic Unequal Connective Dominating” are up. 6601
Thus, let 6602

zNeutrosophic Number , NNeutrosophic SuperHyperNeighborhood and 6603
GNeutrosophic Unequal Connective Dominating be a Neutrosophic number, a Neutrosophic SuperHyper- 6604
Neighborhood and a Neutrosophic Unequal Connective Dominating and the new terms are up. 6605
GNeutrosophic Unequal Connective Dominating ∈ ∪zNeutrosophic Number

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

{NNeutrosophic SuperHyperNeighborhood

∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class =

|NNeutrosophic SuperHyperSet |Neutrosophic Cardinality
6607

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

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

6610

∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class =


6611


6612


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

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

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

rosophic SuperHyperVertices such that there’s no a Neutrosophic SuperHyperEdge amid some
Neutrosophic SuperHyperVertices instead of all given by

Neutrosophic Unequal Connective Dominating is related to the Neutrosophic SuperHyperSet of

the Neutrosophic SuperHyperVertices,
There’s not only one Neutrosophic SuperHyperVertex inside the intended Neutrosophic
SuperHyperSet. Thus the non-obvious Neutrosophic Unequal Connective Dominating is up. The obvious
simple Neutrosophic type-SuperHyperSet called the Neutrosophic Unequal Connective Dominating is
a Neutrosophic SuperHyperSet includes only one Neutrosophic SuperHyperVertex. But the
Neutrosophic SuperHyperSet of Neutrosophic SuperHyperVertices,
doesn’t have less than two SuperHyperVertices inside the intended Neutrosophic SuperHyperSet
since they’ve come from at least so far an SuperHyperEdge. Thus the non-obvious simple
Neutrosophic type-SuperHyperSet of the Neutrosophic R-Unequal Connective Dominating is up. To
sum them up, the Neutrosophic SuperHyperSet of Neutrosophic SuperHyperVertices,
Is the non-obvious simple Neutrosophic type-SuperHyperSet of the Neutrosophic R-Unequal Con-

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

rosophic SuperHyperVertices such that there’s no a Neutrosophic SuperHyperEdge for some
amount Neutrosophic SuperHyperVertices instead of all given by that Neutrosophic type-
SuperHyperSet called the Neutrosophic Unequal Connective Dominating. There isn’t only less than two
Neutrosophic SuperHyperVertices inside the intended Neutrosophic SuperHyperSet,
Thus the non-obvious Neutrosophic R-Unequal Connective Dominating,
is up. The non-obvious simple Neutrosophic type-SuperHyperSet of the Neutrosophic Unequal

, not:
Connective Dominating

Is the Neutrosophic SuperHyperSet, not:
does includes only less than two SuperHyperVertices in a connected Neutrosophic Super- 6613
HyperGraph ESHG : (V, E) but it’s impossible in the case, they’ve corresponded to an 6614
SuperHyperEdge. It’s interesting to mention that the only non-obvious simple Neutrosophic 6615
type-SuperHyperSet called the 6616
“Neutrosophic R-Unequal Connective Dominating” 6617
amid those obvious[non-obvious] simple Neutrosophic type-SuperHyperSets called the 6618
Neutrosophic R-Unequal Connective Dominating, 6619
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-Unequal Connective Dominating amid those obvious simple Neutrosophic type-
SuperHyperSets of the Neutrosophic Unequal Connective Dominating, are
In a connected Neutrosophic SuperHyperGraph ESHG : (V, E).

To sum them up, assume a connected loopless Neutrosophic SuperHyperGraph ESHG : (V, E).
Then in the worst case, literally,
is a Neutrosophic R-Unequal Connective Dominating. In other words, the least cardinality, the lower
sharp bound for the cardinality, of a Neutrosophic R-Unequal Connective Dominating is the cardinality
of
6620
To sum them up, in a connected Neutrosophic SuperHyperGraph ESHG : (V, E). The all 6621
interior Neutrosophic SuperHyperVertices belong to any Neutrosophic quasi-R-Unequal Connective 6622
Dominating if for any of them, and any of other corresponded Neutrosophic SuperHyperVertex, 6623
some interior Neutrosophic SuperHyperVertices are mutually Neutrosophic SuperHyperNeigh- 6624
bors with no Neutrosophic exception at all minus all Neutrosophic SuperHypeNeighbors to any 6625
amount of them. 6626
Assume a connected Neutrosophic SuperHyperGraph ESHG : (V, E). Let a Neutrosophic 6627
SuperHyperEdge ESHE : E ∈ EESHG:(V,E) has some Neutrosophic SuperHyperVertices 6628
r. Consider all Neutrosophic numbers of those Neutrosophic SuperHyperVertices from that 6629

Neutrosophic SuperHyperEdge excluding excluding more than r distinct Neutrosophic Su- 6630
perHyperVertices, exclude to any given Neutrosophic SuperHyperSet of the Neutrosophic 6631
SuperHyperVertices. Consider there’s a Neutrosophic R-Unequal Connective Dominating with the 6632
least cardinality, the lower sharp Neutrosophic bound for Neutrosophic cardinality. Assume a 6633
connected Neutrosophic SuperHyperGraph ESHG : (V, E). The Neutrosophic SuperHyperSet 6634
of the Neutrosophic SuperHyperVertices VESHE \ {z} is a Neutrosophic SuperHyperSet S of 6635
the Neutrosophic SuperHyperVertices such that there’s a Neutrosophic SuperHyperEdge to 6636

have some Neutrosophic SuperHyperVertices uniquely but it isn’t a Neutrosophic R-Unequal 6637
Connective Dominating. Since it doesn’t have 6638
6639
the maximum Neutrosophic cardinality of a Neutrosophic SuperHyperSet S of Neut- 6640
rosophic SuperHyperVertices such that there’s a Neutrosophic SuperHyperEdge to have some 6641
SuperHyperVertices uniquely. The Neutrosophic SuperHyperSet of the Neutrosophic Supe- 6642

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

titled its Neutrosophic SuperHyperNeighbor, to that Neutrosophic SuperHyperVertex in the 6649
Neutrosophic SuperHyperSet S so as S doesn’t do “the Neutrosophic procedure”.]. There’s 6650
only one Neutrosophic SuperHyperVertex outside the intended Neutrosophic SuperHyperSet, 6651
VESHE ∪ {z}, in the terms of Neutrosophic SuperHyperNeighborhood. Thus the obvious 6652
Neutrosophic R-Unequal Connective Dominating, VESHE is up. The obvious simple Neutrosophic type- 6653
SuperHyperSet of the Neutrosophic R-Unequal Connective Dominating, VESHE , is a Neutrosophic Supe- 6654
rHyperSet, VESHE , includes only all Neutrosophic SuperHyperVertices does forms any kind of 6655
Neutrosophic pairs are titled Neutrosophic SuperHyperNeighbors in a connected Neutrosophic 6656
SuperHyperGraph ESHG : (V, E). Since the Neutrosophic SuperHyperSet of the Neutrosophic 6657
SuperHyperVertices VESHE , is the maximum Neutrosophic SuperHyperCardinality of 6658
a Neutrosophic SuperHyperSet S of Neutrosophic SuperHyperVertices such that there’s a 6659
Neutrosophic SuperHyperEdge to have some Neutrosophic SuperHyperVertices uniquely. Thus, 6660

in a connected Neutrosophic SuperHyperGraph ESHG : (V, E). Any Neutrosophic R-Unequal 6661
Connective Dominating only contains all interior Neutrosophic SuperHyperVertices and all exterior 6662
Neutrosophic SuperHyperVertices from the unique Neutrosophic SuperHyperEdge where there’s 6663
any of them has all possible Neutrosophic SuperHyperNeighbors in and there’s all Neutrosophic 6664
SuperHyperNeighborhoods in with no exception minus all Neutrosophic SuperHypeNeighbors 6665

to some of them not all of them but everything is possible about Neutrosophic SuperHyper- 6666
Neighborhoods and Neutrosophic SuperHyperNeighbors out. 6667
The SuperHyperNotion, namely, Unequal Connective Dominating, is up. There’s neither empty SuperHy- 6668
perEdge nor loop SuperHyperEdge. The following Neutrosophic SuperHyperSet of Neutrosophic 6669
SuperHyperEdges[SuperHyperVertices] is the simple Neutrosophic type-SuperHyperSet of the 6670
Neutrosophic Unequal Connective Dominating. The Neutrosophic SuperHyperSet of Neutrosophic 6671

SuperHyperEdges[SuperHyperVertices], 6672

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

C(N SHG)N eutrosophicQuasi−U nequalConnectiveDominatingSuperHyperP olynomial

= 2z b 2 c
.
C(N SHG)N eutrosophicR−Quasi−U nequalConnectiveDominating = {Vi }si=1 , {Vj }tj=1 .
C(N SHG)N eutrosophicR−Quasi−U nequalConnectiveDominatingSuperHyperP olynomial
= az s + bz t .
is the simple Neutrosophic type-SuperHyperSet of the Neutrosophic Unequal Connective Dominating. 6673
The Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperEdges[SuperHyperVertices], 6674

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

Graph ESHG : (V, E) is a Neutrosophic type-SuperHyperSet with 6676
6677
rosophic SuperHyperEdges[SuperHyperVertices] such that there’s no Neutrosophic Super- 6679
HyperVertex of a Neutrosophic SuperHyperEdge is common and there’s an Neutrosophic 6680
SuperHyperEdge for all Neutrosophic SuperHyperVertices. There are not only two Neut- 6681
rosophic SuperHyperVertices inside the intended Neutrosophic SuperHyperSet. Thus the 6682
non-obvious Neutrosophic Unequal Connective Dominating is up. The obvious simple Neutrosophic 6683
type-SuperHyperSet called the Neutrosophic Unequal Connective Dominating is a Neutrosophic Su- 6684
perHyperSet includes only two Neutrosophic SuperHyperVertices. But the Neutrosophic 6685
SuperHyperSet of the Neutrosophic SuperHyperEdges[SuperHyperVertices], 6686

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- 6687
Set. Thus the non-obvious simple Neutrosophic type-SuperHyperSet of the Neutrosophic Unequal 6688
Connective Dominating is up. To sum them up, the Neutrosophic SuperHyperSet of the Neutrosophic 6689

SuperHyperEdges[SuperHyperVertices], 6690

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

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

given by that Neutrosophic type-SuperHyperSet called the Neutrosophic Unequal Connective Dominat- 6697
ing and it’s an Neutrosophic Unequal Connective Dominating. Since it’s 6698
6699
rosophic SuperHyperEdges[SuperHyperVertices] such that there’s no Neutrosophic Super- 6701
HyperVertex of a Neutrosophic SuperHyperEdge is common and there’s an Neutrosophic 6702

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

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

Thus the non-obvious Neutrosophic Unequal Connective Dominating , 6705

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 Unequal Connective 6706
, not:
Dominating 6707

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

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- 6709
HyperGraph ESHG : (V, E). It’s interesting to mention that the only non-obvious simple 6710
Neutrosophic type-SuperHyperSet called the 6711
“Neutrosophic Unequal Connective Dominating ” 6712
amid those obvious[non-obvious] simple Neutrosophic type-SuperHyperSets called the 6713
Neutrosophic Unequal Connective Dominating , 6714

is only and only 6715

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

CHAPTER 31 6717
The Neutrosophic Departures on The 6718
Theoretical Results Toward Theoretical 6719
Motivations 6720
The previous Neutrosophic approach apply on the upcoming Neutrosophic results on 6721
Neutrosophic SuperHyperClasses. 6722
Proposition 31.0.1. Assume a connected Neutrosophic SuperHyperPath ESHP : (V, E). Then 6723

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

136EXM18a Example 31.0.2. In the Figure (31.1), the connected Neutrosophic SuperHyperPath ESHP : 6731
(V, E), is highlighted and featured. The Neutrosophic SuperHyperSet, in the Neutrosophic 6732
SuperHyperModel (31.1), is the SuperHyperUnequal Connective Dominating. 6733
Proposition 31.0.3. Assume a connected Neutrosophic SuperHyperCycle ESHC : (V, E). Then 6734

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

136EXM19a Example 31.0.4. In the Figure (31.2), the connected Neutrosophic SuperHyperCycle N SHC : 6742
(V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, in the 6743
Neutrosophic SuperHyperModel (31.2), is the Neutrosophic SuperHyperUnequal Connective Dominating. 6744
6745

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

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

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

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

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

136EXM20a Example 31.0.6. In the Figure (31.3), the connected Neutrosophic SuperHyperStar ESHS : 6754
(V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, by the Algorithm 6755
in previous Neutrosophic result, of the Neutrosophic SuperHyperVertices of the connected 6756
Neutrosophic SuperHyperStar ESHS : (V, E), in the Neutrosophic SuperHyperModel (31.3), is 6757
the Neutrosophic SuperHyperUnequal Connective Dominating. 6758
Proposition 31.0.7. Assume a connected Neutrosophic SuperHyperBipartite ESHB : (V, E). 6759

Then 6760

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

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

Figure 31.4: Neutrosophic SuperHyperBipartite Neutrosophic Associated to the Neutrosophic

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

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

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

Then 6782

|P min |
{E3i+2 }i=0
ESHP
.
| min |E | |Ei |
{P min } ESHP
=z 3i+2 i=0 .
EXT ERN AL |P min |
{V2i+2 }i=0
ESHP
.
=z 2i+2 i=0 .
Proof. Let 6783
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
j N SHG
6784
P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
...,
EXT ERN AL
j N SHG
SuperHyperMultipartite ESHM : (V, E). There’s a new way to redefine as 6786

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

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

V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest path taken from a connected Neutrosophic SuperHyperMultipartite ESHM : (V, E). 6793
Thus only some SuperHyperVertices and only minimum-Neutrosophic-of-SuperHyperPart 6794
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
136EXM22a Example 31.0.10. In the Figure (31.5), the connected Neutrosophic SuperHyperMultipartite 6798
ESHM : (V, E), is highlighted and Neutrosophic featured. The obtained Neutrosophic 6799
SuperHyperSet, by the Algorithm in previous Neutrosophic result, of the Neutrosophic 6800
SuperHyperVertices of the connected Neutrosophic SuperHyperMultipartite ESHM : (V, E), 6801
in the Neutrosophic SuperHyperModel (31.5), is the Neutrosophic SuperHyperUnequal Connective 6802

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

Then, 6805

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

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

straightforward. Then there’s at least one SuperHyperUnequal Connective Dominating. Thus the 6812
notion of quasi isn’t up and the SuperHyperNotions based on SuperHyperUnequal Connective 6813
Dominating could be applied. The unique embedded SuperHyperUnequal Connective Dominating proposes 6814
some longest SuperHyperUnequal Connective Dominating excerpt from some representatives. The latter 6815
is straightforward. 6816
136EXM23a Example 31.0.12. In the Neutrosophic Figure (31.6), the connected Neutrosophic SuperHyper- 6817
Wheel N SHW : (V, E), is Neutrosophic highlighted and featured. The obtained Neutrosophic 6818
SuperHyperSet, by the Algorithm in previous result, of the Neutrosophic SuperHyperVer- 6819
tices of the connected Neutrosophic SuperHyperWheel ESHW : (V, E), in the Neutrosophic 6820
SuperHyperModel (31.6), is the Neutrosophic SuperHyperUnequal Connective Dominating. 6821

Figure 31.6: a Neutrosophic SuperHyperWheel Neutrosophic Associated to the Neutrosophic

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

CHAPTER 32 6822
The Surveys of Mathematical Sets On 6823
The Results But As The Initial Motivation 6824
For the SuperHyperUnequal Connective Dominating, Neutrosophic SuperHyperUnequal Connective Dominating, 6825
and the Neutrosophic SuperHyperUnequal Connective Dominating, some general results are introduced. 6826
6827
Remark 32.0.1. Let remind that the Neutrosophic SuperHyperUnequal Connective Dominating is 6828
“redefined” on the positions of the alphabets. 6829
Corollary 32.0.2. Assume Neutrosophic SuperHyperUnequal Connective Dominating. Then 6830
N eutrosophic SuperHyperU nequalConnectiveDominating =

{theSuperHyperU nequalConnectiveDominatingof theSuperHyperV ertices |
max |SuperHyperOf f ensive
SuperHyperU nequalConnectiveDominating
|N eutrosophiccardinalityamidthoseSuperHyperU nequalConnectiveDominating. }
plus one Neutrosophic SuperHypeNeighbor to one. Where σi is the unary operation on the 6831
SuperHyperVertices of the SuperHyperGraph to assign the determinacy, the indeterminacy and 6832
the neutrality, for i = 1, 2, 3, respectively. 6833
Corollary 32.0.3. Assume a Neutrosophic SuperHyperGraph on the same identical letter 6834
of the alphabet. Then the notion of Neutrosophic SuperHyperUnequal Connective Dominating and 6835
SuperHyperUnequal Connective Dominating coincide. 6836
Corollary 32.0.4. Assume a Neutrosophic SuperHyperGraph on the same identical letter of 6837
the alphabet. Then a consecutive sequence of the SuperHyperVertices is a Neutrosophic 6838

SuperHyperUnequal Connective Dominating if and only if it’s a SuperHyperUnequal Connective Dominating. 6839
Corollary 32.0.5. Assume a Neutrosophic SuperHyperGraph on the same identical letter of the 6840
alphabet. Then a consecutive sequence of the SuperHyperVertices is a strongest SuperHyperUnequal 6841
Connective Dominating if and only if it’s a longest SuperHyperUnequal Connective Dominating. 6842
Corollary 32.0.6. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph on the same 6843

identical letter of the alphabet. Then its Neutrosophic SuperHyperUnequal Connective Dominating is its 6844
339
Corollary 32.0.7. Assume a Neutrosophic SuperHyperPath(-/SuperHyperUnequal Connective Dominat- 6846

ing, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel) on the 6847
same identical letter of the alphabet. Then its Neutrosophic SuperHyperUnequal Connective Dominating 6848
is its SuperHyperUnequal Connective Dominating and reversely. 6849
Corollary 32.0.8. Assume a Neutrosophic SuperHyperGraph. Then its Neutrosophic SuperHy- 6850
perUnequal Connective Dominating isn’t well-defined if and only if its SuperHyperUnequal Connective Dominating 6851
isn’t well-defined. 6852
Corollary 32.0.9. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph. Then 6853

its Neutrosophic SuperHyperUnequal Connective Dominating isn’t well-defined if and only if its 6854
SuperHyperUnequal Connective Dominating isn’t well-defined. 6855
Corollary 32.0.10. Assume a Neutrosophic SuperHyperPath(-/SuperHyperUnequal Connective Domin- 6856

, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). Then
ating 6857
its Neutrosophic SuperHyperUnequal Connective Dominating isn’t well-defined if and only if its SuperHy- 6858
perUnequal Connective Dominating isn’t well-defined. 6859
Corollary 32.0.11. Assume a Neutrosophic SuperHyperGraph. Then its Neutrosophic SuperHy- 6860
perUnequal Connective Dominating is well-defined if and only if its SuperHyperUnequal Connective Dominating 6861
is well-defined. 6862
Corollary 32.0.12. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph. Then 6863
its Neutrosophic SuperHyperUnequal Connective Dominating is well-defined if and only if its SuperHy- 6864
perUnequal Connective Dominating is well-defined. 6865
Corollary 32.0.13. Assume a Neutrosophic SuperHyperPath(-/SuperHyperUnequal Connective Domin- 6866
, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). Then

ating 6867
its Neutrosophic SuperHyperUnequal Connective Dominating is well-defined if and only if its SuperHy- 6868
perUnequal Connective Dominating is well-defined. 6869
Proposition 32.0.14. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. Then V is 6870
(i) : the dual SuperHyperDefensive SuperHyperUnequal Connective Dominating; 6871
(ii) : the strong dual SuperHyperDefensive SuperHyperUnequal Connective Dominating; 6872
(iii) : the connected dual SuperHyperDefensive SuperHyperUnequal Connective Dominating; 6873
(iv) : the δ-dual SuperHyperDefensive SuperHyperUnequal Connective Dominating; 6874
(v) : the strong δ-dual SuperHyperDefensive SuperHyperUnequal Connective Dominating; 6875
(vi) : the connected δ-dual SuperHyperDefensive SuperHyperUnequal Connective Dominating. 6876
Proposition 32.0.15. Let N T G : (V, E, σ, µ) be a Neutrosophic SuperHyperGraph. Then ∅ is 6877
(iii) : the connected defensive SuperHyperDefensive SuperHyperUnequal Connective Dominating; 6880

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

independent SuperHyperSet is 6885
(iii) : the connected SuperHyperDefensive SuperHyperUnequal Connective Dominating; 6888
Proposition 32.0.17. Let ESHG : (V, E) be a Neutrosophic SuperHyperUniform SuperHyper- 6892

Graph which is a SuperHyperUnequal Connective Dominating/SuperHyperPath. Then V is a maximal 6893
(iv) : O(ESHG)-SuperHyperDefensive SuperHyperUnequal Connective Dominating; 6897
(v) : strong O(ESHG)-SuperHyperDefensive SuperHyperUnequal Connective Dominating; 6898
(vi) : connected O(ESHG)-SuperHyperDefensive SuperHyperUnequal Connective Dominating; 6899
Proposition 32.0.18. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is a 6901

SuperHyperUniform SuperHyperWheel. Then V is a maximal 6902
(iv) : O(ESHG)-dual SuperHyperDefensive SuperHyperUnequal Connective Dominating; 6906
(v) : strong O(ESHG)-dual SuperHyperDefensive SuperHyperUnequal Connective Dominating; 6907
(vi) : connected O(ESHG)-dual SuperHyperDefensive SuperHyperUnequal Connective Dominating; 6908
Proposition 32.0.19. Let ESHG : (V, E) be a Neutrosophic SuperHyperUniform SuperHy- 6910

perGraph which is a SuperHyperUnequal Connective Dominating/SuperHyperPath. Then the number 6911
of 6912

(i) : the SuperHyperUnequal Connective Dominating; 6913
(ii) : the SuperHyperUnequal Connective Dominating; 6914
(iii) : the connected SuperHyperUnequal Connective Dominating; 6915
(iv) : the O(ESHG)-SuperHyperUnequal Connective Dominating; 6916
(v) : the strong O(ESHG)-SuperHyperUnequal Connective Dominating; 6917
(vi) : the connected O(ESHG)-SuperHyperUnequal Connective Dominating. 6918
coincide. 6920

Graph which is a SuperHyperWheel. Then the number of 6922
(i) : the dual SuperHyperUnequal Connective Dominating; 6923
(ii) : the dual SuperHyperUnequal Connective Dominating; 6924
(iii) : the dual connected SuperHyperUnequal Connective Dominating; 6925
(iv) : the dual O(ESHG)-SuperHyperUnequal Connective Dominating; 6926
(v) : the strong dual O(ESHG)-SuperHyperUnequal Connective Dominating; 6927
(vi) : the connected dual O(ESHG)-SuperHyperUnequal Connective Dominating. 6928
coincide. 6930
Proposition 32.0.21. Let ESHG : (V, E) be a Neutrosophic SuperHyperUniform SuperHy- 6931

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


Graph which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperCom- 6943
plete SuperHyperMultipartite. Then a SuperHyperSet contains the half of multiplying r with 6944
the number of all the SuperHyperEdges plus one of all the SuperHyperVertices in the biggest 6945
SuperHyperPart is a 6946
(iv) : δ-SuperHyperDefensive SuperHyperUnequal Connective Dominating; 6950
(v) : strong δ-SuperHyperDefensive SuperHyperUnequal Connective Dominating; 6951
(vi) : connected δ-SuperHyperDefensive SuperHyperUnequal Connective Dominating. 6952
Graph which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperCom- 6954

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

Proposition 32.0.25. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. Then the 6973
number is at most O(ESHG) and the Neutrosophic number is at most On (ESHG). 6974
Proposition 32.0.26. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is 6975
SuperHyperComplete. The number is O(ESHG:(V,E)) 2 + 1 and the Neutrosophic number is 6976

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


Proposition 32.0.27. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is ∅. The 6984
number is 0 and the Neutrosophic number is 0, for an independent SuperHyperSet in the setting 6985
of dual 6986
(iv) : 0-SuperHyperDefensive SuperHyperUnequal Connective Dominating; 6990

SuperHyperComplete. Then there’s no independent SuperHyperSet. 6994
Proposition 32.0.29. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is Super- 6995
HyperUnequal Connective Dominating/SuperHyperPath/SuperHyperWheel. The number is O(ESHG : 6996
(V, E)) and the Neutrosophic number is On (ESHG : (V, E)), in the setting of a dual 6997
(iv) : O(ESHG : (V, E))-SuperHyperDefensive SuperHyperUnequal Connective Dominating; 7001
(v) : strong O(ESHG : (V, E))-SuperHyperDefensive SuperHyperUnequal Connective Dominating; 7002
(vi) : connected O(ESHG : (V, E))-SuperHyperDefensive SuperHyperUnequal Connective Dominating. 7003


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


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

that 7020
(i) v ∈ Ns (x); 7021
(ii) vx ∈ E. 7022
Proposition 32.0.33. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph. If S is 7023

a dual SuperHyperDefensive SuperHyperUnequal Connective Dominating, then 7024
(i) S is SuperHyperUnequal Connective Dominating set; 7025
(ii) there’s S ⊆ S 0 such that |S 0 | is SuperHyperChromatic number. 7026
Proposition 32.0.34. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph. Then 7027
(i) Γ ≤ O; 7028
(ii) Γs ≤ On . 7029
Proposition 32.0.35. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph which is 7030
connected. Then 7031
(i) Γ ≤ O − 1; 7032
(ii) Γs ≤ On − Σ3i=1 σi (x). 7033
Proposition 32.0.36. Let ESHG : (V, E) be an odd SuperHyperPath. Then 7034


(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· ,vn−1 } Σ3i=1 σi (s)}; 7038
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn−1 } and S2 = {v1 , v3 , · · · , vn−1 } are only a dual 7039
Proposition 32.0.37. Let ESHG : (V, E) be an even SuperHyperPath. Then 7041
(i) the set S = {v2 , v4 , · · · .vn } is a dual SuperHyperDefensive SuperHyperUnequal Connective 7042
Dominating; 7043
(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · .vn } and {v1 , v3 , · · · .vn−1 }; 7044
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 7045
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 7046
Proposition 32.0.38. Let ESHG : (V, E) be an even SuperHyperUnequal Connective Dominating. Then 7048
(i) the SuperHyperSet S = {v2 , v4 , · · · , vn } is a dual SuperHyperDefensive SuperHyperUnequal 7049
(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · , vn } and {v1 , v3 , · · · , vn−1 }; 7051
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } σ(s), Σs∈S={v1 ,v3 ,··· ,vn−1 } σ(s)}; 7052
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn } and S2 = {v1 , v3 , · · · , vn−1 } are only dual 7053
Proposition 32.0.39. Let ESHG : (V, E) be an odd SuperHyperUnequal Connective Dominating. Then 7055

(iii) Γs = min{Σs∈S={v2 ,v4 ,··· .vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 7059
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn−1 } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 7060
Proposition 32.0.40. Let ESHG : (V, E) be SuperHyperStar. Then 7062
(i) the SuperHyperSet S = {c} is a dual maximal SuperHyperUnequal Connective Dominating; 7063
(ii) Γ = 1; 7064
(iii) Γs = Σ3i=1 σi (c); 7065

(iv) the SuperHyperSets S = {c} and S ⊂ S 0 are only dual SuperHyperUnequal Connective Dominating. 7066
Proposition 32.0.41. Let ESHG : (V, E) be SuperHyperWheel. Then 7067
6+3(i−1)≤n
(i) the SuperHyperSet S = {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is a dual maximal 7068
6+3(i−1)≤n
(ii) Γ = |{v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 |; 7070
(iii) Γs = Σ{v1 ,v3 }∪{v6 ,v9 ··· ,vi+6 ,··· ,vn }6+3(i−1)≤n Σ3i=1 σi (s); 7071
i=1
6+3(i−1)≤n
(iv) the SuperHyperSet {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is only a dual maximal 7072
Proposition 32.0.42. Let ESHG : (V, E) be an odd SuperHyperComplete. Then 7074
b n c+1
2
Dominating; 7076
(ii) Γ = b n2 c + 1; 7077

b n c+1 ; 7078
S={vi }i=1
b n c+1
(iv) the SuperHyperSet S = {vi }i=1
2
is only a dual SuperHyperDefensive SuperHyperUnequal 7079
Proposition 32.0.43. Let ESHG : (V, E) be an even SuperHyperComplete. Then 7081
bn
2c
(i) the SuperHyperSet S = {vi }i=1 is a dual SuperHyperDefensive SuperHyperUnequal Connective 7082
Dominating; 7083
(ii) Γ = b n2 c; 7084

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

perStars with common Neutrosophic SuperHyperVertex SuperHyperSet. Then 7089
(i) the SuperHyperSet S = {c1 , c2 , · · · , cm } is a dual SuperHyperDefensive SuperHyperUnequal 7090
Connective Dominating for N SHF; 7091
(ii) Γ = m for N SHF : (V, E); 7092
(iii) Γs = Σm 3
i=1 Σj=1 σj (ci ) for N SHF : (V, E); 7093
(iv) the SuperHyperSets S = {c1 , c2 , · · · , cm } and S ⊂ S 0 are only dual SuperHyperUnequal 7094
Connective Dominating for N SHF : (V, E). 7095

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

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

2
for N SHF : (V, E); 7101
S={vi }i=1
b n c+1
are only a dual maximal SuperHyperUnequal Connective 7102
Dominating for N SHF : (V, E). 7103
Proposition 32.0.46. Let N SHF : (V, E) be a m-SuperHyperFamily of even SuperHyperCom- 7104
plete SuperHyperGraphs with common Neutrosophic SuperHyperVertex SuperHyperSet. Then 7105
bnc
Dominating for N SHF : (V, E); 7107
(ii) Γ = b n2 c for N SHF : (V, E); 7108
(iii) Γs = min{Σs∈S Σ3i=1 σi (s)} bnc

2
for N SHF : (V, E); 7109
S={vi }i=1
bnc
2
are only dual maximal SuperHyperUnequal Connective Dominating 7110
for N SHF : (V, E). 7111
(i) if s ≥ t and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 7114

SuperHyperUnequal Connective Dominating, then S is an s-SuperHyperDefensive SuperHyperUnequal 7115

perHyperUnequal Connective Dominating, then S is a dual s-SuperHyperDefensive SuperHyperUnequal 7118
(i) if s ≥ t + 2 and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 7122

SuperHyperUnequal Connective Dominating, then S is an s-SuperHyperPowerful SuperHyperUnequal 7123

perHyperUnequal Connective Dominating, then S is a dual s-SuperHyperPowerful SuperHyperUnequal 7126
Proposition 32.0.49. Let ESHG : (V, E) be a[an] [V-]SuperHyperUniform-strong-Neutrosophic 7128

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

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

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

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


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

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


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

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

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

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

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


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

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

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


CHAPTER 33 7188
Neutrosophic Applications in Cancer’s 7189
Neutrosophic Recognition 7190
The cancer is the Neutrosophic disease but the Neutrosophic model is going to figure out what’s 7191
going on this Neutrosophic phenomenon. The special Neutrosophic case of this Neutrosophic 7192
disease is considered and as the consequences of the model, some parameters are used. The cells 7193
are under attack of this disease but the moves of the cancer in the special region are the matter 7194
of mind. The Neutrosophic recognition of the cancer could help to find some Neutrosophic 7195
treatments for this Neutrosophic disease. 7196
In the following, some Neutrosophic steps are Neutrosophic devised on this disease. 7197
Step 1. (Neutrosophic Definition) The Neutrosophic recognition of the cancer in the long- 7198
term Neutrosophic function. 7199
Step 2. (Neutrosophic Issue) The specific region has been assigned by the Neutrosophic 7200
model [it’s called Neutrosophic SuperHyperGraph] and the long Neutrosophic cycle of the 7201
move from the cancer is identified by this research. Sometimes the move of the cancer 7202
about the moves and the effects of the cancer on that region; this event leads us to 7204
choose another model [it’s said to be Neutrosophic SuperHyperGraph] to have convenient 7205
perception on what’s happened and what’s done. 7206
Step 3. (Neutrosophic Model) There are some specific Neutrosophic models, which are well- 7207
known and they’ve got the names, and some general Neutrosophic models. The moves 7208
and the Neutrosophic traces of the cancer on the complex tracks and between complicated 7209
groups of cells could be fantasized by a Neutrosophic SuperHyperPath(-/SuperHyperUnequal 7210
Connective Dominating, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, Su- 7211
perHyperWheel). The aim is to find either the Neutrosophic SuperHyperUnequal Connective 7212
Dominating or the Neutrosophic SuperHyperUnequal Connective Dominating in those Neutrosophic 7213
Neutrosophic SuperHyperModels. 7214
351
CHAPTER 34 7215
Case 1: The Initial Neutrosophic Steps 7216
Toward Neutrosophic 7217
SuperHyperBipartite as Neutrosophic 7218
SuperHyperModel 7219
Step 4. (Neutrosophic Solution) In the Neutrosophic Figure (34.1), the Neutrosophic Super- 7220
HyperBipartite is Neutrosophic highlighted and Neutrosophic featured. 7221
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- 7222
perBipartite is obtained. 7223
The obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous 7224
Neutrosophic result, of the Neutrosophic SuperHyperVertices of the connected Neut- 7225
rosophic SuperHyperBipartite ESHB : (V, E), in the Neutrosophic SuperHyperModel 7226
(34.1), is the Neutrosophic SuperHyperUnequal Connective Dominating. 7227

CHAPTER 35 7228
Case 2: The Increasing Neutrosophic 7229
Steps Toward Neutrosophic 7230
SuperHyperMultipartite as 7231
Neutrosophic SuperHyperModel 7232
Step 4. (Neutrosophic Solution) In the Neutrosophic Figure (35.1), the Neutrosophic Super- 7233
HyperMultipartite is Neutrosophic highlighted and Neutrosophic featured. 7234
By using the Neutrosophic Figure (35.1) and the Table (35.1), the Neutrosophic SuperHy- 7235
perMultipartite is obtained. 7236
The obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous 7237
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- 7238

perMultipartite ESHM : (V, E), in the Neutrosophic SuperHyperModel (35.1), is the 7239
Neutrosophic SuperHyperUnequal Connective Dominating. 7240

CHAPTER 36 7241
Wondering Open Problems But As The 7242
Directions To Forming The Motivations 7243
In what follows, some “problems” and some “questions” are proposed. 7244
The SuperHyperUnequal Connective Dominating and the Neutrosophic SuperHyperUnequal Connective 7245
Dominating are defined on a real-world application, titled “Cancer’s Recognitions”. 7246
Question 36.0.1. Which the else SuperHyperModels could be defined based on Cancer’s 7247
recognitions? 7248
Question 36.0.2. Are there some SuperHyperNotions related to SuperHyperUnequal Connective 7249
and the Neutrosophic SuperHyperUnequal Connective Dominating?
Dominating 7250
Question 36.0.3. Are there some Algorithms to be defined on the SuperHyperModels to compute 7251
them? 7252
Question 36.0.4. Which the SuperHyperNotions are related to beyond the SuperHyperUnequal 7253
and the Neutrosophic SuperHyperUnequal Connective Dominating?
Problem 36.0.5. The SuperHyperUnequal Connective Dominating and the Neutrosophic SuperHyperUnequal 7255
do a SuperHyperModel for the Cancer’s recognitions and they’re based on
SuperHyperUnequal Connective Dominating, are there else? 7257
Problem 36.0.6. Which the fundamental SuperHyperNumbers are related to these SuperHyper- 7258
Numbers types-results? 7259
Problem 36.0.7. What’s the independent research based on Cancer’s recognitions concerning 7260
the multiple types of SuperHyperNotions? 7261
357
CHAPTER 37 7262
Conclusion and Closing Remarks 7263
In this section, concluding remarks and closing remarks are represented. The drawbacks of this 7264
research are illustrated. Some benefits and some advantages of this research are highlighted. 7265
This research uses some approaches to make Neutrosophic SuperHyperGraphs more understand- 7266
able. In this endeavor, two SuperHyperNotions are defined on the SuperHyperUnequal Connective 7267
Dominating. For that sake in the second definition, the main definition of the Neutrosophic Super- 7268
HyperGraph is redefined on the position of the alphabets. Based on the new definition for the 7269
Neutrosophic SuperHyperGraph, the new SuperHyperNotion, Neutrosophic SuperHyperUnequal 7270
Connective Dominating, finds the convenient background to implement some results based on that. 7271
Some SuperHyperClasses and some Neutrosophic SuperHyperClasses are the cases of this 7272
research on the modeling of the regions where are under the attacks of the cancer to recognize 7273
this disease as it’s mentioned on the title “Cancer’s Recognitions”. To formalize the instances 7274
on the SuperHyperNotion, SuperHyperUnequal Connective Dominating, the new SuperHyperClasses 7275
and SuperHyperClasses, are introduced. Some general results are gathered in the section on the 7276
SuperHyperUnequal Connective Dominating and the Neutrosophic SuperHyperUnequal Connective Dominating. 7277
The clarifications, instances and literature reviews have taken the whole way through. In this 7278
research, the literature reviews have fulfilled the lines containing the notions and the results. 7279
The SuperHyperGraph and Neutrosophic SuperHyperGraph are the SuperHyperModels on the 7280
“Cancer’s Recognitions” and both bases are the background of this research. Sometimes the 7281
of the moves of the cancer in the longest and strongest styles with the formation of the design 7284
and the architecture are formally called “ SuperHyperUnequal Connective Dominating” in the themes of 7285
jargons and buzzwords. The prefix “SuperHyper” refers to the theme of the embedded styles to 7286
figure out the background for the SuperHyperNotions. In the Table (37.1), benefits and avenues 7287
for this research are, figured out, pointed out and spoken out. 7288
359
Table 37.1: An Overlook On This Research And Beyond 136TBLTBL
Advantages Limitations
1. Redefining Neutrosophic SuperHyperGraph 1. General Results
2. SuperHyperUnequal Connective Dominating
3. Neutrosophic SuperHyperUnequal Connective Dominating 2. Other SuperHyperNumbers
4. Modeling of Cancer’s Recognitions
5. SuperHyperClasses 3. SuperHyperFamilies

CHAPTER 38 7289
Neutrosophic SuperHyperDuality But As 7290
Super Forms 7292
Definition 38.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperDuality). 7293

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

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

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

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

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

Neutrosophic re-SuperHyperDuality, Neutrosophic v-SuperHyperDuality, and Neutro- 7306
sophic rv-SuperHyperDuality. 7307
Definition 38.0.2. ((Neutrosophic) SuperHyperDuality). 7308

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

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

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

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

SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for a Neut- 7336
rosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 7337
SuperHyperDuality; and the Neutrosophic power is corresponded to its Neutrosophic 7342
coefficient; 7343
(v) an Extreme R-SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 7344

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

SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic v-SuperHyperDuality,7352
and Neutrosophic rv-SuperHyperDuality and C(N SHG) for a Neutrosophic SuperHyper- 7353
Graph N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic 7354
SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 7355
that they form the Neutrosophic SuperHyperDuality; 7357
(vii) an Extreme R-SuperHyperDuality SuperHyperPolynomial if it’s either of 7358

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

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

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

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

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

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7380
E1 and E3 are some empty Extreme SuperHyperEdges but E2 is a loop Neutrosophic 7381
SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of 7382
Neutrosophic SuperHyperNeighbor, there’s only one Neutrosophic SuperHyperEdge, 7383
namely, E4 . The Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means 7384
that there’s no Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. 7385
Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in every given Neutrosophic 7386
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 7390
SuperHyperEdge. Thus in the terms of Neutrosophic SuperHyperNeighbor, there’s only 7391
one Neutrosophic SuperHyperEdge, namely, E4 . The Neutrosophic SuperHyperVertex, V3 7392
is Neutrosophic isolated means that there’s no Neutrosophic SuperHyperEdge has it as 7393
a Neutrosophic endpoint. Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in 7394

every given Neutrosophic SuperHyperDuality. 7395




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

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


the Neutrosophic SuperHyperDuality. 7466
Then 7468
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 7469
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL


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

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

(V, E). Then 7489

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


Then there’s at least one SuperHyperDuality. Thus the notion of quasi isn’t up and 7495
the SuperHyperNotions based on SuperHyperDuality could be applied. There are only z 0 7496
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. 7508
Proposition 38.0.14. Assume a connected Neutrosophic SuperHyperWheel ESHW : (V, E). 7509
Then, 7510
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 7511
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 7512


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

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

CHAPTER 39 7525
Neutrosophic SuperHyperJoin But As 7526
Super Forms 7528
Definition 39.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperJoin). 7529

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

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

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

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

Neutrosophic re-SuperHyperJoin, Neutrosophic v-SuperHyperJoin, and Neutrosophic 7544
rv-SuperHyperJoin. 7545
Definition 39.0.2. ((Neutrosophic) SuperHyperJoin). 7546

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

375

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

rv-SuperHyperJoin and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7558
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a 7559
Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive Neutrosophic 7560
SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the 7561
Neutrosophic SuperHyperJoin; 7562
(iii) an Extreme SuperHyperJoin SuperHyperPolynomial if it’s either of Neutrosophic 7563

e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic v-SuperHyperJoin, 7564
and Neutrosophic rv-SuperHyperJoin and C(N SHG) for an Extreme SuperHyperGraph 7565
Extreme SuperHyperJoin; and the Extreme power is corresponded to its Extreme 7570
coefficient; 7571
(iv) a Neutrosophic SuperHyperJoin SuperHyperPolynomial if it’s either of 7572

Neutrosophic e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic v- 7573
SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for a Neutrosophic 7574
SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains 7575
the Neutrosophic coefficients defined as the Neutrosophic number of the maximum Neutro- 7576
sophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet 7577
S of high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and 7578

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

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

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

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

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

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

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

the Neutrosophic coefficients defined as the Neutrosophic number of the maximum 7608
Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic 7609
SuperHyperJoin; and the Neutrosophic power is corresponded to its Neutrosophic 7612
coefficient. 7613
SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7617

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

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




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


SuperHyperModel (31.1), is the SuperHyperJoin. 7683

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

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

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


the Neutrosophic SuperHyperJoin. 7703
Then 7705
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 7706
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 7712
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperJoin taken from a connected Neutrosophic SuperHyperBipartite 7714

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


(V, E). Then 7725

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

is a longest SuperHyperJoin taken from a connected Neutrosophic SuperHyperMultipartite 7727


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

Then, 7745

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

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


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

CHAPTER 40 7759
Neutrosophic SuperHyperPerfect But As 7760
Super Forms 7762
Definition 40.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperPerfect). 7763

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

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

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

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

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

Neutrosophic re-SuperHyperPerfect, Neutrosophic v-SuperHyperPerfect, and Neutrosophic 7776
rv-SuperHyperPerfect. 7777
Definition 40.0.2. ((Neutrosophic) SuperHyperPerfect). 7778

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

rv-SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 7783
389
(ii) a Neutrosophic SuperHyperPerfect if it’s either of Neutrosophic e-SuperHyperPerfect, 7788

rv-SuperHyperPerfect and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : 7790
(V, E) is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges 7791
of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive 7792
form the Neutrosophic SuperHyperPerfect; 7794
(iii) an Extreme SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7795

rosophic e-SuperHyperPerfect, Neutrosophic re-SuperHyperPerfect, Neutrosophic v- 7796
SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for an Ex- 7797
ality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme 7800
(iv) a Neutrosophic SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7804

SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for a Neut- 7806
SuperHyperPerfect; and the Neutrosophic power is corresponded to its Neutrosophic 7812
coefficient; 7813
(v) an Extreme R-SuperHyperPerfect if it’s either of Neutrosophic e-SuperHyperPerfect, 7814

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

SuperHyperPerfect, Neutrosophic re-SuperHyperPerfect, Neutrosophic v-SuperHyperPerfect,7822
and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for a Neutrosophic SuperHyper- 7823
Graph N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic 7824
SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 7825
that they form the Neutrosophic SuperHyperPerfect; 7827
(vii) an Extreme R-SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7828

SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for an Ex- 7830

ality of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme 7833
(viii) a Neutrosophic SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7837

SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for a Neut- 7839

SuperHyperPerfect; and the Neutrosophic power is corresponded to its Neutrosophic 7845
coefficient. 7846

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7850

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





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

SuperHyperModel (31.1), is the SuperHyperPerfect. 7916
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 7918
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3

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

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



the Neutrosophic SuperHyperPerfect. 7936
Then 7938
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 7939
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 7943
there’s no at least one SuperHyperPerfect. Thus the notion of quasi may be up but the 7944
SuperHyperNotions based on SuperHyperPerfect could be applied. There are only two 7945
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperPerfect taken from a connected Neutrosophic SuperHyperBipartite 7948

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

(V, E). Then 7959

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



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

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

is a longest SuperHyperPerfect taken from a connected Neutrosophic SuperHyperWheel 7982


ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is straightforward. Then there’s 7985
at least one SuperHyperPerfect. Thus the notion of quasi isn’t up and the SuperHyperNotions 7986
based on SuperHyperPerfect could be applied. The unique embedded SuperHyperPerfect 7987
proposes some longest SuperHyperPerfect excerpt from some representatives. The latter is 7988
SuperHyperModel (31.6), is the Neutrosophic SuperHyperPerfect. 7994

CHAPTER 41 7995
Neutrosophic SuperHyperTotal But As 7996
Super Forms 7998
Definition 41.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperTotal). 7999

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

Va ∈ Ei , Ej ; 8004
(ii) Neutrosophic re-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that 8005

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

Vi , Vj ∈ Ea ; 8008
(iv) Neutrosophic rv-SuperHyperTotal if ∀Vi ∈ VESHG:(V,E) , ∃!Vj ∈ V 0 , such that 8009

Vi , Vj ∈ Ea ; and |Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; 8010
(v) Neutrosophic SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 8011

Neutrosophic re-SuperHyperTotal, Neutrosophic v-SuperHyperTotal, and Neutrosophic 8012
rv-SuperHyperTotal. 8013
Definition 41.0.2. ((Neutrosophic) SuperHyperTotal). 8014

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

rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 8019
Extreme SuperHyperTotal; 8023
403
(ii) a Neutrosophic SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 8024

rv-SuperHyperTotal and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 8026
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a 8027
Neutrosophic SuperHyperTotal; 8030
(iii) an Extreme SuperHyperTotal SuperHyperPolynomial if it’s either of Neutrosophic 8031
e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v-SuperHyperTotal, 8032

and Neutrosophic rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph 8033
Extreme SuperHyperTotal; and the Extreme power is corresponded to its Extreme 8038
coefficient; 8039
(iv) a Neutrosophic SuperHyperTotal SuperHyperPolynomial if it’s either of 8040
Neutrosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v- 8041

SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for a Neutro- 8042
contains the Neutrosophic coefficients defined as the Neutrosophic number of the maximum 8044
Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHy- 8045
perSet S of high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and 8046
Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperTotal; 8047
and the Neutrosophic power is corresponded to its Neutrosophic coefficient; 8048
(v) an Extreme R-SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 8049

rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 8051
Extreme SuperHyperTotal; 8055
(vi) a Neutrosophic R-SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 8056

rv-SuperHyperTotal and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 8058
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a 8059
Neutrosophic SuperHyperTotal; 8062
(vii) an Extreme R-SuperHyperTotal SuperHyperPolynomial if it’s either of Neut- 8063

rosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v- 8064
SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for an Extreme 8065

that they form the Extreme SuperHyperTotal; and the Extreme power is corresponded to 8070
its Extreme coefficient; 8071
(viii) a Neutrosophic SuperHyperTotal SuperHyperPolynomial if it’s either of 8072
Neutrosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v- 8073

SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for a Neutro- 8074
contains the Neutrosophic coefficients defined as the Neutrosophic number of the maximum 8076
Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic Supe- 8077
rHyperSet S of high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges 8078
and Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyper- 8079
Total; and the Neutrosophic power is corresponded to its Neutrosophic coefficient. 8080

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 8084

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




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

SuperHyperModel (31.1), is the SuperHyperTotal. 8150
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 8152
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. 8159
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 8161


the Neutrosophic SuperHyperTotal. 8170
Then 8172
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 8173
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

based on SuperHyperTotal could be applied. There are only two SuperHyperParts. Thus every 8179
P :

V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperTotal taken from a connected Neutrosophic SuperHyperBipartite 8181

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
(V, E). Then 8192

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

is a longest SuperHyperTotal taken from a connected Neutrosophic SuperHyperMultipartite 8194


based on SuperHyperTotal could be applied. There are only z 0 SuperHyperParts. Thus every 8199
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. 8210
Then, 8212
∗
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 8213
P : ViEXT ERN AL , Ei∗ , CEN T ER, Ej .
is a longest SuperHyperTotal taken from a connected Neutrosophic SuperHyperWheel ESHW : 8214


at least one SuperHyperTotal. Thus the notion of quasi isn’t up and the SuperHyperNotions 8218
based on SuperHyperTotal could be applied. The unique embedded SuperHyperTotal 8219
proposes some longest SuperHyperTotal excerpt from some representatives. The latter is 8220
SuperHyperModel (31.6), is the Neutrosophic SuperHyperTotal. 8226

CHAPTER 42 8227
Neutrosophic SuperHyperConnected But 8228
As The Extensions Excerpt From Dense 8229
And Super Forms 8230
Definition 42.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperConnected). 8231

(i) Neutrosophic e-SuperHyperConnected if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such 8235
that Va ∈ Ei , Ej ; and ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; 8236
(ii) Neutrosophic re-SuperHyperConnected if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ 8237

E 0 , such that Va ∈ Ei , Ej ; ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; and 8238
|Ei |NEUTROSOPHIC CARDINALITY = |Ej |NEUTROSOPHIC CARDINALITY ; 8239
(iii) Neutrosophic v-SuperHyperConnected if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such 8240

that Vi , Vj 6∈ Ea ; and ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; 8241
(iv) Neutrosophic rv-SuperHyperConnected if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ 8242

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

8245
Neutrosophic re-SuperHyperConnected, Neutrosophic v-SuperHyperConnected, and Neut- 8246
rosophic rv-SuperHyperConnected. 8247
Definition 42.0.2. ((Neutrosophic) SuperHyperConnected). 8248

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

8251
Neutrosophic re-SuperHyperConnected, Neutrosophic v-SuperHyperConnected, and Neut- 8252
rosophic rv-SuperHyperConnected and C(N SHG) for an Extreme SuperHyperGraph 8253
417
form the Extreme SuperHyperConnected; 8257
(ii) a Neutrosophic SuperHyperConnected if it’s either of Neutrosophic e- 8258

SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neutrosophic v- 8259
SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) 8260
for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic car- 8261
dinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of high 8262
Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and Neutrosophic 8263

SuperHyperVertices such that they form the Neutrosophic SuperHyperConnected; 8264
(iii) an Extreme SuperHyperConnected SuperHyperPolynomial if it’s either of Neut- 8265
rosophic e-SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neutrosophic 8266

v-SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) for 8267
an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial 8268
contains the Extreme coefficients defined as the Extreme number of the maximum Extreme 8269
(iv) a Neutrosophic SuperHyperConnected SuperHyperPolynomial if it’s either of 8274

Neutrosophic e-SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neut- 8275
rosophic v-SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and 8276
C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic 8277
SuperHyperPolynomial contains the Neutrosophic coefficients defined as the Neutrosophic 8278
number of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges 8279
of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive Neutro- 8280

sophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the 8281
Neutrosophic SuperHyperConnected; and the Neutrosophic power is corresponded to its 8282
(v) an Extreme R-SuperHyperConnected if it’s either of Neutrosophic e- 8284

SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) 8286
for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme cardinality 8287
of an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme SuperHyper- 8288
Vertices in the consecutive Extreme sequence of Extreme SuperHyperEdges and Extreme 8289
SuperHyperVertices such that they form the Extreme SuperHyperConnected; 8290
(vi) a Neutrosophic R-SuperHyperConnected if it’s either of Neutrosophic e- 8291

SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) for a 8293
Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic cardinality 8294
of the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S of high 8295
Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and Neutrosophic 8296
SuperHyperVertices such that they form the Neutrosophic SuperHyperConnected; 8297

(vii) an Extreme R-SuperHyperConnected SuperHyperPolynomial if it’s either of 8298

C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme Super- 8301
HyperPolynomial contains the Extreme coefficients defined as the Extreme number of 8302

and the Extreme power is corresponded to its Extreme coefficient; 8306
(viii) a Neutrosophic SuperHyperConnected SuperHyperPolynomial if it’s either of 8307

C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic 8310
SuperHyperPolynomial contains the Neutrosophic coefficients defined as the Neutrosophic 8311
number of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices 8312
of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive Neutro- 8313

sophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the 8314
Neutrosophic SuperHyperConnected; and the Neutrosophic power is corresponded to its 8315
• On the Figure (30.1), the Neutrosophic SuperHyperNotion, namely, Neutrosophic Super- 8319
HyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 8320
SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of Neutro- 8322
sophic SuperHyperNeighbor, there’s only one Neutrosophic SuperHyperEdge, namely, E4 . 8323

The Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means that there’s no 8324
Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. Thus the Neutrosophic 8325
SuperHyperVertex, V3 , is excluded in every given Neutrosophic SuperHyperConnected. 8326
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. 8334


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 8378
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. 8385
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 8387
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. 8394
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 8396



the Neutrosophic SuperHyperConnected. 8405
Then 8407
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 8408
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 8413
SuperHyperNotions based on SuperHyperConnected could be applied. There are only two 8414
P :

V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperConnected taken from a connected Neutrosophic SuperHyperBipartite 8417

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
(V, E). Then 8428
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 8429
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

is a longest SuperHyperConnected taken from a connected Neutrosophic SuperHyperMultipartite 8430


there’s no at least one SuperHyperConnected. Thus the notion of quasi may be up but 8434
the SuperHyperNotions based on SuperHyperConnected could be applied. There are only 8435
z 0 SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as the 8436
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. 8447
Then, 8449
∗
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 8450
P : V EXT ERN AL i , E ∗ i , CEN T ER, Ej .

is a longest SuperHyperConnected taken from a connected Neutrosophic SuperHyperWheel 8451


to ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is straightforward. 8454
Then there’s at least one SuperHyperConnected. Thus the notion of quasi isn’t up and 8455
the SuperHyperNotions based on SuperHyperConnected could be applied. The unique 8456
embedded SuperHyperConnected proposes some longest SuperHyperConnected excerpt from 8457
some representatives. The latter is straightforward. 8458
SuperHyperModel (31.6), is the Neutrosophic SuperHyperConnected. 8463

CHAPTER 43 8464
Background 8465
431






SuperHyperClasses” in Ref. [HG20] by Henry Garrett (2022), “SuperHyperGirth on Su- 8556
perHyperGraph and Neutrosophic SuperHyperGraph With SuperHyperModeling of Cancer’s 8557

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

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

Henry Garrett (2023), “Indeterminacy On The All Possible Connections of Cells In Front of 8570
Cancer’s Attacks In The Terms of Neutrosophic Failed SuperHyperClique on Cancer’s Recogni- 8571
tion called Neutrosophic SuperHyperGraphs” in Ref. [HG27] by Henry Garrett (2023), “Perfect 8572
Directions Toward Idealism in Cancer’s Neutrosophic Recognition Forwarding Neutrosophic 8573
SuperHyperClique on Neutrosophic SuperHyperGraphs” in Ref. [HG28] by Henry Garrett 8574
(2023), “Demonstrating Complete Connections in Every Embedded Regions and Sub-Regions in 8575
the Terms of Cancer’s Recognition and (Neutrosophic) SuperHyperGraphs With (Neutrosophic) 8576
SuperHyperClique” in Ref. [HG29] by Henry Garrett (2023), “Different Neutrosophic Types 8577
of Neutrosophic Regions titled neutrosophic Failed SuperHyperStable in Cancer’s Neutrosophic 8578
Recognition modeled in the Form of Neutrosophic SuperHyperGraphs” in Ref. [HG30] by 8579
Henry Garrett (2023), “Using the Tool As (Neutrosophic) Failed SuperHyperStable To SuperHy- 8580
perModel Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs” in Ref. [HG31] by 8581
Henry Garrett (2023), “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic 8582
SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints” in Ref. 8583
[HG32] by Henry Garrett (2023), “(Neutrosophic) SuperHyperStable on Cancer’s Recognition 8584
by Well-SuperHyperModelled (Neutrosophic) SuperHyperGraphs” in Ref. [HG33] by Henry 8585
Garrett (2023), “Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To Use 8586

Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond” in Ref. 8587
[HG34] by Henry Garrett (2022), “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s 8588
Recognitions And (Neutrosophic) SuperHyperGraphs” in Ref. [HG35] by Henry Garrett (2022), 8589
“Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic) SuperHyperModeling 8590

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

Garrett (2022), “Basic Neutrosophic Notions Concerning SuperHyperDominating and Neutro- 8592
sophic SuperHyperResolving in SuperHyperGraph” in Ref. [HG37] by Henry Garrett (2022), 8593
“Initial Material of Neutrosophic Preliminaries to Study Some Neutrosophic Notions Based on 8594
Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic SuperHyperGraph (NSHG)” in Ref. 8595
[HG38] by Henry Garrett (2022), and [HG44s; HG55s; HG4; HG5; HG6; HG7; HG8; 8596
HG282; HG283; HG284; HG285; HG286; HG287], there are some endeavors to formalize 8617
the basic SuperHyperNotions about neutrosophic SuperHyperGraph and SuperHyperGraph 8618



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




Bibliography 8690
10.33140/JMTCM.01.03.09) 8713
437



10.20944/preprints202301.0282.v1). 8729

10.20944/preprints202301.0267.v1). 8732

(doi: 10.20944/preprints202301.0265.v1). 8737
prints202301.0262.v1). 8741
2023010224, (doi: 10.20944/preprints202301.0224.v1). 8747

prints202301.0105.v1). 8750

Preprints 2023, 2023010044 8756
10.20944/preprints202301.0043.v1). 8759

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

(doi: 10.20944/preprints202212.0500.v1). 8775
10.5281/zenodo.8076416). 8784

2023, (doi: 10.5281/zenodo.8076399). 8787
(doi: 10.5281/zenodo.8072171). 8790
2023, (doi: 10.5281/zenodo.8072267). 8793
10.5281/zenodo.8067384). 8796

2023, (doi: 10.5281/zenodo.8067409). 8799
10.5281/zenodo.8061927). 8802
10.5281/zenodo.8062016). 8805
10.5281/zenodo.8057696). 8808
2023, (doi: 10.5281/zenodo.8057753). 8811
10.5281/zenodo.8052893). 8814
2023, (doi: 10.5281/zenodo.8052925). 8817
10.5281/zenodo.8051346). 8820
10.5281/zenodo.8051360). 8823
10.5281/zenodo.8025707). 8826
10.5281/zenodo.8027275). 8829
odo.8017246). 8832
10.5281/zenodo.8020128). 8835

odo.7978571). 8838
10.5281/zenodo.7978857). 8841
10.5281/zenodo.7940830). 8844
10.5281/zenodo.7943578). 8847
odo.7916595). 8850
odo.7923632). 8853
(doi: 10.5281/zenodo.7904698). 8856
2023, (doi: 10.5281/zenodo.7904671). 8859
10.5281/zenodo.7871026). 8868
2023, (doi: 10.5281/zenodo.7874647). 8871
10.5281/zenodo.7857856). 8874

2023, (doi: 10.5281/zenodo.7857841). 8877
10.5281/zenodo.7853867). 8886
10.5281/zenodo.7853922). 8889
(doi: 10.5281/zenodo.7851519). 8892
(doi: 10.5281/zenodo.7851550). 8895
10.5281/zenodo.7834229). 8904
10.5281/zenodo.7834261). 8907
10.5281/zenodo.7824560). 8910
(doi: 10.5281/zenodo.7824623). 8913

2023, (doi: 10.5281/zenodo.7809365). 8924
2023, (doi: 10.5281/zenodo.7809358). 8927
10.5281/zenodo.7809219). 8930
10.5281/zenodo.7809328). 8933
2023, (doi: 10.5281/zenodo.7806767). 8936
2023, (doi: 10.5281/zenodo.7806838). 8939
10.5281/zenodo.7799902). 8948
(doi: 10.5281/zenodo.7804218). 8951

(doi: 10.5281/zenodo.7796334). 8954
10.5281/zenodo.7791952). 8960
10.5281/zenodo.7791982). 8963
10.5281/zenodo.7790026). 8966
10.5281/zenodo.7790052). 8969
2023, (doi: 10.5281/zenodo.7787066). 8972
10.5281/zenodo.7781476). 8978
10.5281/zenodo.7783082). 8981
10.5281/zenodo.7777857). 8984
10.5281/zenodo.7779286). 8987
(doi: 10.5281/zenodo.7771831). 8990

2023, (doi: 10.5281/zenodo.7772468). 8993
10.13140/RG.2.2.20913.25446). 8996
odo.7764916). 8999
10.13140/RG.2.2.11770.98247). 9002
10.13140/RG.2.2.12400.12808). 9005
2023, (doi: 10.13140/RG.2.2.22545.10089). 9008
10.13140/RG.2.2.11377.76644). 9014
10.13140/RG.2.2.23750.96329). 9017
10.13140/RG.2.2.31366.24641). 9020
10.13140/RG.2.2.34721.68960). 9023
2023, (doi: 10.13140/RG.2.2.30212.81289). 9026

10.13140/RG.2.2.24288.35842). 9032
10.13140/RG.2.2.32467.25124). 9035
10.13140/RG.2.2.31025.45925). 9038
10.13140/RG.2.2.17184.25602). 9041
10.13140/RG.2.2.23423.28327). 9044
10.13140/RG.2.2.28456.44805). 9047
10.13140/RG.2.2.23525.68320). 9050
10.13140/RG.2.2.20170.24000). 9053
10.13140/RG.2.2.36475.59683). 9056
10.13140/RG.2.2.29764.71046). 9059
2023, (doi: 10.13140/RG.2.2.18780.87683). 9062
10.13140/RG.2.2.26134.01603). 9068

10.13140/RG.2.2.27392.30721). 9071
10.13140/RG.2.2.33028.40321). 9074
10.13140/RG.2.2.21389.20966). 9077
10.13140/RG.2.2.16356.04489). 9080
10.13140/RG.2.2.21756.21129). 9083
10.13140/RG.2.2.30983.68009). 9086
10.13140/RG.2.2.28552.29445). 9089
(doi: 10.13140/RG.2.2.10936.21761). 9092
10.13140/RG.2.2.35105.89447). 9095
(doi: 10.13140/RG.2.2.30072.72960). 9098
10.13140/RG.2.2.31147.52003). 9101
10.13140/RG.2.2.32825.24163). 9104
10.13140/RG.2.2.13059.58401). 9107

10.13140/RG.2.2.11172.14720). 9110
2023, (doi: 10.13140/RG.2.2.22011.80165). 9113
ate 2023, (doi: 10.13140/RG.2.2.30819.84003). 9116
2023, (doi: 10.13140/RG.2.2.10493.84962). 9119
ate 2023, (doi: 10.13140/RG.2.2.13849.29280). 9122
2023, (doi: 10.13140/RG.2.2.19944.14086). 9125
ate 2023, (doi: 10.13140/RG.2.2.23299.58404). 9128
(doi: 10.13140/RG.2.2.33103.76968). 9131
(doi: 10.13140/RG.2.2.23037.44003). 9134
(doi: 10.13140/RG.2.2.35646.56641). 9137
10.13140/RG.2.2.18030.48967). 9140
(doi: 10.13140/RG.2.2.13973.81121). 9143
2023, (doi: 10.13140/RG.2.2.34106.47047). 9146

2023, (doi: 10.13140/RG.2.2.31956.88961). 9152
2023, (doi: 10.13140/RG.2.2.15179.67361). 9155
10.13140/RG.2.2.21510.45125). 9158
2023, (doi: 10.13140/RG.2.2.13121.84321). 9161
10.13140/RG.2.2.11758.69441). 9164
2023, (doi: 10.13140/RG.2.2.31891.35367). 9167
10.13140/RG.2.2.19360.87048). 9170
10.13140/RG.2.2.32363.21286). 9173
10.13140/RG.2.2.23266.81602). 9176
10.13140/RG.2.2.19911.37285). 9179
10.13140/RG.2.2.11050.90569). 9182
2023, (doi: 10.13140/RG.2.2.17761.79206). 9185

ate 2023, (doi: 10.13140/RG.2.2.33275.80161). 9191
(doi: 10.13140/RG.2.2.30182.50241). 9194

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


2023010396 (doi: 10.20944/preprints202301.0396.v1). 9236
2023, 2023010395 (doi: 10.20944/preprints202301.0395.v1). 9239




2023,(doi: 10.13140/RG.2.2.36745.93289). 9253
10.20944/preprints202301.0282.v1). 9260
10.20944/preprints202301.0267.v1).). 9263

(doi: 10.20944/preprints202301.0265.v1). 9268
prints202301.0262.v1). 9272
2023010224, (doi: 10.20944/preprints202301.0224.v1). 9278

10.13140/RG.2.2.35061.65767). 9281

10.13140/RG.2.2.18494.15680). 9285

10.13140/RG.2.2.32530.73922). 9289

10.13140/RG.2.2.15897.70243). 9293

10.13140/RG.2.2.32530.73922). 9297

prints202301.0105.v1). 9300

10.13140/RG.2.2.23172.19849). 9307
10.13140/RG.2.2.17385.36968). 9317
Preprints 2023, 2023010044 9320
10.20944/preprints202301.0043.v1). 9323

2023, (doi: 10.13140/RG.2.2.28945.92007). 9326
10.13140/RG.2.2.35774.77123). 9332

10.13140/RG.2.2.29430.88642). 9338

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

10.13140/RG.2.2.19380.94084). 9347
(doi: 10.20944/preprints202212.0500.v1). 9358
10.13140/RG.2.2.20993.12640). 9361


10.13140/RG.2.2.29173.86244). 9376

2023 (doi: 10.5281/zenodo.8076449). 9381
2023 (doi: 10.5281/zenodo.8067469). 9385
(doi: 10.5281/zenodo.8062076). 9387
2023 (doi: 10.5281/zenodo.8052976). 9391
(doi: 10.5281/zenodo.8051368). 9393
(doi: 10.5281/zenodo.8027488). 9395
10.5281/zenodo.8020181). 9397
10.5281/zenodo.7978921). 9399
odo.7943878). 9401
10.5281/zenodo.7943871). 9403
10.5281/zenodo.7923786). 9405
2023 (doi: 10.5281/zenodo.7905287). 9407
2023 (doi: 10.5281/zenodo.7874677). 9411
(doi: 10.5281/zenodo.7857906). 9413
2023 (doi: 10.5281/zenodo.7856329). 9415

10.5281/zenodo.7854561). 9417
2023 (doi: 10.5281/zenodo.7851893). 9419

(doi: 10.5281/zenodo.7835063). 9423
(doi: 10.5281/zenodo.7826705). 9425
2023 (doi: 10.5281/zenodo.7820680). 9427
10.5281/zenodo.7812750). 9429

2023 (doi: 10.5281/zenodo.7807782). 9435
2023 (doi: 10.5281/zenodo.7804449). 9437
(doi: 10.5281/zenodo.7792307). 9441
(doi: 10.5281/zenodo.7790728). 9443
2023 (doi: 10.5281/zenodo.7787712). 9445
10.5281/zenodo.7783791). 9447
10.5281/zenodo.7780123). 9449
(doi: 10.5281/zenodo.7773119). 9451

odo.7637762). 9453
10.5281/zenodo.7766174). 9455
10.5281/zenodo.7762232). 9457
(doi: 10.5281/zenodo.7758601). 9459
10.5281/zenodo.7754661). 9461
10.5281/zenodo.7750995) . 9463
(doi: 10.5281/zenodo.7749875). 9465
10.5281/zenodo.7747236). 9467
10.5281/zenodo.7742587). 9469
(doi: 10.5281/zenodo.7738635). 9471
10.5281/zenodo.7734719). 9473
10.5281/zenodo.7730484). 9475
(doi: 10.5281/zenodo.7730469). 9477
10.5281/zenodo.7722865). 9479
odo.7713563). 9481
odo.7709116). 9483
10.5281/zenodo.7706415). 9485
10.5281/zenodo.7706063). 9487

10.5281/zenodo.7701906). 9489
odo.7700205). 9491
10.5281/zenodo.7694876). 9493
10.5281/zenodo.7679410). 9495
10.5281/zenodo.7675982). 9497
10.5281/zenodo.7672388). 9499
odo.7668648). 9501
10.5281/zenodo.7662810). 9503
10.5281/zenodo.7659162). 9505
odo.7653233). 9507
odo.7653204). 9509
odo.7653142). 9511
odo.7653117). 9513
odo.7651687). 9516
odo.7651619). 9518
odo.7651439). 9520
odo.7650729). 9522

odo.7647868). 9524
odo.7647017). 9526
odo.7644894). 9528
odo.7632923). 9531
odo.7623459). 9533
10.5281/zenodo.7606416). 9535
10.5281/zenodo.7606416). 9537
odo.7606404). 9539
10.5281/zenodo.7580018). 9541
odo.7580018). 9543
odo.7580018). 9545
odo.7579929). 9547
10.5281/zenodo.7563170). 9549
odo.7563164). 9551
odo.7563160). 9553
odo.7563160). 9555
10.5281/zenodo.7563160). 9557

10.5281/zenodo.7557063). 9559
10.5281/zenodo.7557009). 9561
10.5281/zenodo.7539484). 9563
10.5281/zenodo.7523390). 9565
10.5281/zenodo.7523390). 9567
10.5281/zenodo.7523390). 9569
odo.7574952). 9571
10.5281/zenodo.7574992). 9573
odo.7523357). 9575
10.5281/zenodo.7523357). 9577
10.5281/zenodo.7504782). 9579
10.5281/zenodo.7504782). 9581
10.5281/zenodo.7504782). 9583
10.5281/zenodo.7499395). 9585
odo.7499395). 9587
10.5281/zenodo.7499395). 9589
10.5281/zenodo.7497450). 9591
10.5281/zenodo.7497450). 9593

10.5281/zenodo.7494862). 9595
odo.7494862). 9597
10.5281/zenodo.7494862). 9599
10.5281/zenodo.7493845). 9601
odo.7493845). 9603
10.5281/zenodo.7493845). 9605
odo.7539484). 9607
odo.7523390). 9609
odo.7523357). 9611
odo.7504782). 9613
odo.7499395). 9615
odo.7497450). 9617
odo.7494862). 9619
odo.7493845). 9621
odo.7480110). 9623
odo.7378758). 9625
odo.6320305). 9627
odo.6677173). 9629

CHAPTER 44 9630
Books’ Contributions 9631
“Books’ Contributions”: | Featured Threads 9632

The following references are cited by chapters. 9633
9634
[Ref288] 9635
Henry Garrett, “New Ideas On Super Con By Hyper Conceit Of Unequal Connective Domin- 9636
ating In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 9637
10.5281/zenodo.8078543). 9638
9639
[Ref289] 9640
Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph 9641
By Unequal Connective Dominating As Hyper Conceit On Super Con”, Zenodo 2023, (doi: 9642
10.5281/zenodo.8078445). 9643
9644
The links to the contributions of this scientific research book are listed below. 9645
[HG288] 9646
10.5281/zenodo.8078543). 9649
9650
[TITLE] “New Ideas On Super Con By Hyper Conceit Of Unequal Connective Domin- 9651
ating In Recognition of Cancer With (Neutrosophic) SuperHyperGraph” 9652

9653
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ResearchGate”] 9654
https://www.researchgate.net/publication/371832376 9655
9656
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “Scribd”:] 9657
https://www.scribd.com/document/655205099 9658
9659
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ZENODO_ORG”:] 9660
https://zenodo.org/record/8078543 9661
9662
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “academia”:] 9663
https://www.academia.edu/103820904 9664
463
Figure 44.1: [HG288] Henry Garrett, “New Ideas On Super Con By Hyper Conceit Of Unequal
Connective Dominating In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”,
Zenodo 2023, (doi: 10.5281/zenodo.8078543).
9665
[ADDRESSED CITATION] 9666
10.5281/zenodo.8078543). 9669
[ASSIGNED NUMBER] #288 Article 9670
[DATE] June 2023 9671

[DOI] 10.5281/zenodo.8078543 9672
[LICENSE] CC BY-NC-ND 4.0 9673
[PROJECT] Neutrosophic SuperHyperGraphs and SuperHyperGraphs 9674
[AVAILABLE AT TWITTER’S IDS] WordPress ResearchGate Scribd academia ZEN- 9675
ODO_ORG Twitter facebook LinkedIn Amazon googlebooks GooglePlay 9676
9677
[HG289] 9678
10.5281/zenodo.8078445). 9681
9682
[TITLE] “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph By 9683

Unequal Connective Dominating As Hyper Conceit On Super Con” 9684
9685
https://www.researchgate.net/publication/371832359 9687
9688
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “Scribd”:] 9689


Figure 44.4: [HG289] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic
SuperHyperGraph By Unequal Connective Dominating As Hyper Conceit On Super Con”,
https://www.scribd.com/document/655200569 9690
9691
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ZENODO_ORG”:] 9692
9694
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “academia”:] 9695
https://www.academia.edu/103820093 9696
9697
10.5281/zenodo.8078445). 9701
[ASSIGNED NUMBER] #289 Article 9702
[DATE] June 2023 9703
[DOI] 10.5281/zenodo.8078445 9704
[LICENSE] CC BY-NC-ND 4.0 9705

[PROJECT] Neutrosophic SuperHyperGraphs and SuperHyperGraphs 9706
[AVAILABLE AT TWITTER’S IDS] 9707
WordPress ResearchGate Scribd academia ZENODO_ORG Twitter facebook LinkedIn Amazon 9708
googlebooks GooglePlay 9709
9710
[ASSIGNED NUMBER] | Book #184 9711

HG184b
Henry Garrett, “Unequal Connective Dominating In SuperHyperGraphs”. Dr. Henry Garrett, 9713
2023 (doi: 10.5281/zenodo.8078574). 9714


[TITLE] Unequal Connective Dominating In SuperHyperGraphs 9715

#Latest_Updates 9716
#The_Links 9717
9721
9723
#The_Links 9724
9725
[ASSIGNED NUMBER] | Book #184 9726

9727
[TITLE] Unequal Connective Dominating In SuperHyperGraphs 9728
9729
9733
– 9734
9735
[PUBLISHER] 9736
(Paperback): https://www.amazon.com/dp/- 9737
(Hardcover): https://www.amazon.com/dp/- 9738

(Kindle Edition): https://www.amazon.com/dp/- 9739
9740
– 9741
9742
[ISBN] 9743
(Paperback): - 9744
(Hardcover): - 9745
(Kindle Edition): CC BY-NC-ND 4.0 9746
(EBook): CC BY-NC-ND 4.0 9747
9748
– 9749
9750
[PRINT LENGTH] 9751
(Paperback): - pages 9752
(Hardcover): - pages 9753
(Kindle Edition): - pages 9754
(E-Book): - pages 9755
9756
– 9757
9758
9760

#The_Links 9761
9762
https://www.researchgate.net/publication/- 9764
9765
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “WordPress”] 9766
https://drhenrygarrett.wordpress.com/2023/07/22/ 9767
Unequal-Connective-Dominating-In-SuperHyperGraphs/ 9768
9769
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “Scribd”] 9770
https://www.scribd.com/document/- 9771
9772
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “academia”] 9773
https://www.academia.edu/- 9774
9775
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ZENODO_ORG”] 9776
9778
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “googlebooks”] 9779
https://books.google.com/books/about?id=- 9780
9781
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “GooglePlay”] 9782
https://play.google.com/store/books/details?id=- 9783

[TITLE] Unequal Connective Dominating In SuperHyperGraphs (Published Version) 9784

9785
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “WordPress”] 9786
9787
https://drhenrygarrett.wordpress.com/2023/07/22/ 9788
Unequal-Connective-Dominating-In-SuperHyperGraphs/ 9789
9790
– 9791
9792
[POSTED BY] Dr. Henry Garrett 9793
9794
[DATE] June 024, 2023 9795

9796
[POSTED IN] 184 | Unequal Connective Dominating In SuperHyperGraphs 9797
9798
[TAGS] 9799
Applications, Applied Mathematics, Applied Research, Cancer, Cancer’s Recognitions, Combin- 9800
atorics, Edge, Edges, Graph Theory, Graphs, Latest Research, Literature Reviews, Modeling, 9801
Neutrosophic Graph, Neutrosophic Graph Theory, Neutrosophic Science, Neutrosophic Su- 9802
perHyperClasses, Neutrosophic SuperHyperGraph, Neutrosophic SuperHyperGraph Theory, 9803
neutrosophic SuperHyperGraphs, Neutrosophic Unequal Connective Dominating In SuperHyper- 9804
Graphs, Open Problems, Open Questions, Problems, Pure Math, Pure Mathematics, Questions, 9805
Real-World Applications, Recent Research, Recognitions, Research, scientific research Article, 9806
scientific research Articles, scientific research Book, scientific research Chapter, scientific research 9807
Chapters, Review, SuperHyperClasses, SuperHyperEdges, SuperHyperGraph, SuperHyper- 9808

Graph Theory, SuperHyperGraphs, Unequal Connective Dominating In SuperHyperGraphs, 9809
SuperHyperModeling, SuperHyperVertices, Theoretical Research, Vertex, Vertices. 9810
In this scientific research book, there are some scientific research chapters on “Extreme Un- 9811
equal Connective Dominating In SuperHyperGraphs” and “Neutrosophic Unequal Connective 9812
Dominating In SuperHyperGraphs” about some scientific research on Unequal Connective 9813
Dominating In SuperHyperGraphs by two (Extreme/Neutrosophic) notions, namely, Extreme 9814

Unequal Connective Dominating In SuperHyperGraphs and Neutrosophic Unequal Connective 9815
Dominating In SuperHyperGraphs. With scientific research on the basic scientific research 9816
properties, the scientific research book starts to make Extreme Unequal Connective Dom- 9817
inating In SuperHyperGraphs theory and Neutrosophic Unequal Connective Dominating In 9818
SuperHyperGraphs theory more (Extremely/Neutrosophicly) understandable. 9819

HG184b1.png
Figure 44.7: [HG184b] Henry Garrett, “Unequal Connective Dominating In SuperHyperGraphs”.

Dr. Henry Garrett, 2023 (doi: 10.5281/zenodo.8078574).

HG184b2.png


HG184b3.png


CHAPTER 45 9820
“SuperHyperGraph-Based Books”: | 9821
Featured Tweets 9822
“SuperHyperGraph-Based Books”: | Featured Tweets 9823
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 9824
CV 9825
503
9826
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
9827
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)
9828
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

9829

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

9831
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

9832
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

9833
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

9834
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

9835
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

9836
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

9837
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

9838
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

9839
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).
9840
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

9841
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

9842
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

9843
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

9844
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

9845
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/-
9846
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

9847
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

9848
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

9849
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

9850
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

9851
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

9852
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

9853
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

9854
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

9855
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

9856
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

9857
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

9858
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

9859
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

9860
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

9861
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

9862
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
9863
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).
9864
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
9865
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”,
9866
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”,
9867
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
9868
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
9869
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
9870
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).
9871
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).
9872
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).
9873
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

9874
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).
9875
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).
9876
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).
9877
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

9878
[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

9879
[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

9880
[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

9881
[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

9882
[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

9883
[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

9884
[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

9885
[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

9886
[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

9887
[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

9888
[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

9889
[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

9890
[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

9891
[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

9892
[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

9893
[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

9894
[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

9895
[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

9896
[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

9897
[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

9898
[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

9899
[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

9900
[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

9901
[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

9902
[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

9903
[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

9904
[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

9905
[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

9906
[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

9907
[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
9908
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

9909
[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

9910
[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

9911
[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

9912
[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

9913
[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
9914
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

9915
“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

9916
[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
9917
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

9918
[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

9919
[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

9920
[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

9921
[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

9922
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

9923
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
9924
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
9925
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

9926
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

9927
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
-
9928
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

9929
Анализ моделей и руководство за пределами Подход и проблемы в двух моде-

лях 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

9930
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
9931
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
9932
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

9933
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
9934
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
...
9935
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/
9936
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
9937
9938
9939
Henry Garrett
01/23/2022
9940
9941
9942
9943
9944
9945
9946
9947
9948
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
9949
View publication stats

Unequal Connective Dominating in SuperHyperGraphs

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Unequal Connective Dominating in SuperHyperGraphs

Uploaded by

Copyright:

Available Formats

See discussions, stats, and author profiles for this publication at: https://www.researchgate.

Unequal Connective Dominating In SuperHyperGraphs

Book · June 2023

510 PUBLICATIONS 22,802 CITATIONS

Neutrosophic Graphs View project

Number Graphs And Numbers View project

The user has requested enhancement of the downloaded file.

Dr. Henry Garrett

4 Cancer In Extreme SuperHyperGraph 47

5 Extreme Unequal Connective Dominating 51

6 New Ideas On Super Con By Hyper Conceit Of Unequal Connective

8 Applied Notions Under The Scrutiny Of The Motivation Of This

9 Extreme Preliminaries Of This Scientific Research On the Redeemed Ways 65

10 Extreme SuperHyperUnequal Connective Dominating But As The Extensions

11 The Extreme Departures on The Theoretical Results Toward Theoretical

12 The Surveys of Mathematical Sets On The Results But As The Initial

13 Extreme Applications in Cancer’s Extreme Recognition 141

14 Case 1: The Initial Extreme Steps Toward Extreme SuperHyperBipart-

15 Case 2: The Increasing Extreme Steps Toward Extreme SuperHyper-

16 Wondering Open Problems But As The Directions To Forming The

17 Conclusion and Closing Remarks 149

18 Extreme SuperHyperDuality But As The Extensions Excerpt From

19 Extreme SuperHyperJoin But As The Extensions Excerpt From Dense

20 Extreme SuperHyperPerfect But As The Extensions Excerpt From

21 Extreme SuperHyperTotal But As The Extensions Excerpt From Dense

22 Extreme SuperHyperConnected But As The Extensions Excerpt From

24 Cancer In Neutrosophic SuperHyperGraph 253

25 Neutrosophic Unequal Connective 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 SuperHyperUnequal Connective Dominating But As The Exten-

31 The Neutrosophic Departures on The Theoretical Results Toward

32 The Surveys of Mathematical Sets On The Results But As The Initial

33 Neutrosophic Applications in Cancer’s Neutrosophic Recognition 351

34 Case 1: The Initial Neutrosophic Steps Toward Neutrosophic SuperHy-

35 Case 2: The Increasing Neutrosophic Steps Toward Neutrosophic

36 Wondering Open Problems But As The Directions To Forming The

37 Conclusion and Closing Remarks 359

38 Neutrosophic SuperHyperDuality But As The Extensions Excerpt From

39 Neutrosophic SuperHyperJoin But As The Extensions Excerpt From

40 Neutrosophic SuperHyperPerfect But As The Extensions Excerpt From

41 Neutrosophic SuperHyperTotal But As The Extensions Excerpt From

42 Neutrosophic SuperHyperConnected But As The Extensions Excerpt

44 Books’ Contributions 463

45 “SuperHyperGraph-Based Books”: | Featured Tweets 475

Henry Garrett · Independent Researcher · Department of Mathematics ·

10.1 The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme

10.17The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme

11.1 an Extreme SuperHyperPath Associated to the Notions of Extreme SuperHy-

14.1 an Extreme SuperHyperBipartite Associated to the Notions of Extreme SuperHy-

15.1 an Extreme SuperHyperMultipartite Associated to the Notions of Extreme

30.1 The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of

Henry Garrett · Independent Researcher · Department of Mathematics ·

30.6 The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of

Henry Garrett · Independent Researcher · Department of Mathematics ·

30.21The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of

31.1 a Neutrosophic SuperHyperPath Associated to the Notions of Neutrosophic

34.1 a Neutrosophic SuperHyperBipartite Associated to the Notions of Neutrosophic

35.1 a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic

Henry Garrett · Independent Researcher · Department of Mathematics ·

44.7 [HG184b] Henry Garrett, “Unequal Connective Dominating In SuperHyperGraphs”.