Strict Connective Dominating in SuperHyperGraphs

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

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

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

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

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

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

Graph By Strict 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 SuperHyperStrict Connective Dominating But As The Extensions

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

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

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

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

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

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

39 Neutrosophic SuperHyperJoin But As The Extensions Excerpt From

40 Neutrosophic SuperHyperPerfect But As The Extensions Excerpt From

41 Neutrosophic SuperHyperTotal But As The Extensions Excerpt From

42 Neutrosophic SuperHyperConnected But As The Extensions Excerpt

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

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

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

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 SuperHyperStrict Connective Dominating in the Example (42.0.11) . . . . . . . . 125
11.5 an Extreme SuperHyperMultipartite Associated to the Notions of Extreme
SuperHyperStrict Connective Dominating in the Example (42.0.13) . . . . . . . . . . . . . 127
11.6 an Extreme SuperHyperWheel Extreme Associated to the Extreme Notions of
Extreme SuperHyperStrict Connective Dominating in the Extreme Example (42.0.15) . . . 128
14.1 an Extreme SuperHyperBipartite Associated to the Notions of Extreme SuperHy-

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

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

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


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

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


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

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

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

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

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

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

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

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

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

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

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

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

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

“Neutrosophic Strict Connective Dominating In SuperHyperGraphs”, “Neutrosophic Super- 80

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

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

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

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

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

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

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

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

SuperHyperClasses if the intended Table holds. Thus SuperHyperPath, Strict Connective 202
Dominating In SuperHyperGraphs, SuperHyperStar, SuperHyperBipartite, SuperHyperMul- 203
tiPartite, and SuperHyperWheel, are “Neutrosophic SuperHyperPath”, “Neutrosophic Strict 204
Connective Dominating In SuperHyperGraphs”, “Neutrosophic SuperHyperStar”, “Neutro- 205
sophic SuperHyperBipartite”, “Neutrosophic SuperHyperMultiPartite”, and “Neutrosophic 206

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

SuperVertex as intersection amid all SuperHyperEdges; it’s SuperHyperBipartite it’s only one 217
SuperVertex as intersection amid two given SuperHyperEdges and these SuperVertices, forming 218
two separate sets, has no SuperHyperEdge in common; it’s SuperHyperMultiPartite it’s only 219
one SuperVertex as intersection amid two given SuperHyperEdges and these SuperVertices, 220
forming multi separate sets, has no SuperHyperEdge in common; it’s SuperHyperWheel if it’s 221
be based on the “Cancer’s Neutrosophic Recognition” and the results and the definitions will 231
be introduced in redeemed ways. The Neutrosophic recognition of the cancer in the long-term 232
function. The specific region has been assigned by the model [it’s called SuperHyperGraph] 233
and the long cycle of the move from the cancer is identified by this research. Sometimes the 234
move of the cancer hasn’t be easily identified since there are some determinacy, indeterminacy 235
and neutrality about the moves and the effects of the cancer on that region; this event leads us 236
to choose another model [it’s said to be Neutrosophic SuperHyperGraph] to have convenient 237
perception on what’s happened and what’s done. There are some specific models, which are 238
well-known and they’ve got the names, and some SuperHyperGeneral SuperHyperModels. The 239
moves and the traces of the cancer on the complex tracks and between complicated groups 240
of cells could be fantasized by a Neutrosophic SuperHyperPath(-/Strict Connective Dominat- 241

ing In SuperHyperGraphs, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, 242
SuperHyperWheel). The aim is to find either the longest Strict Connective Dominating In 243
SuperHyperGraphs or the strongest Strict Connective Dominating In SuperHyperGraphs 244
in those Neutrosophic SuperHyperModels. For the longest Strict Connective Dominating 245
In SuperHyperGraphs, called Strict Connective Dominating In SuperHyperGraphs, and the 246
strongest Strict Connective Dominating In SuperHyperGraphs, called Neutrosophic Strict 247

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

259
Some scientific studies and scientific researches about neutrosophic graphs, are proposed 260
as book in the following by Henry Garrett (2022) which is indexed by Google Scholar and has 261

more than 3181 readers in Scribd. It’s titled “Beyond Neutrosophic Graphs” and published by 262
Ohio: E-publishing: Educational Publisher 1091 West 1st Ave Grandview Heights, Ohio 43212 263
United State. This research book covers different types of notions and settings in neutrosophic 264
graph theory and neutrosophic SuperHyperGraph theory. 265
266
267
[Ref] Henry Garrett, (2022). “Beyond Neutrosophic Graphs”, Ohio: E-publishing: Edu- 268
cational Publisher 1091 West 1st Ave Grandview Heights, Ohio 43212 United States. ISBN: 269
978-1-59973-725-6 (http://fs.unm.edu/BeyondNeutrosophicGraphs.pdf). 270
[Ref] Henry Garrett, (2022). “Beyond Neutrosophic Graphs”, Ohio: E-publishing: Educational 271
Publisher 1091 West 1st Ave Grandview Heights, Ohio 43212 United States. ISBN: 978-1-59973- 272
725-6 (http://fs.unm.edu/BeyondNeutrosophicGraphs.pdf). 273

274
Also, some scientific studies and scientific researches about neutrosophic graphs, are pro- 275
posed as book in the following by Henry Garrett (2022) which is indexed by Google Scholar 276
and has more than 4060 readers in Scribd. It’s titled “Neutrosophic Duality” and published 277
by Florida: GLOBAL KNOWLEDGE - Publishing House 848 Brickell Ave Ste 950 Miami, 278
Florida 33131 United States. This research book presents different types of notions SuperHy- 279
perResolving and Strict Connective Dominating In SuperHyperGraphs in the setting of duality 280
in neutrosophic graph theory and neutrosophic SuperHyperGraph theory. This research book 281
has scrutiny on the complement of the intended set and the intended set, simultaneously. It’s 282
smart to consider a set but acting on its complement that what’s done in this research book 283
which is popular in the terms of high readers in Scribd. 284
[Ref] Henry Garrett, (2022). “Neutrosophic Duality”, Florida: GLOBAL KNOWLEDGE 285

- Publishing House 848 Brickell Ave Ste 950 Miami, Florida 33131 United States. ISBN: 286
978-1-59973-743-0 (http://fs.unm.edu/NeutrosophicDuality.pdf). 287

[Ref] Henry Garrett, (2022). “Neutrosophic Duality”, Florida: GLOBAL KNOWLEDGE 288
- Publishing House 848 Brickell Ave Ste 950 Miami, Florida 33131 United States. ISBN: 289
978-1-59973-743-0 (http://fs.unm.edu/NeutrosophicDuality.pdf). 290




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

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

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

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

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

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

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

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

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

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

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

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

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


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

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



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

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

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

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

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

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

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

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

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

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

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

2023, (doi: 10.5281/zenodo.8076399). 614
By Reverse Dimension Dominating As Hyper Dimple On Super Dimity”, Zenodo 2023, 616
(doi: 10.5281/zenodo.8072171). 617
HG284 [29] Henry Garrett, “New Ideas On Super Dimity By Hyper Dimple Of Reverse Dimension 618
2023, (doi: 10.5281/zenodo.8072267). 620
By Equal Dimension Dominating As Hyper Dimple On Super Dimity”, Zenodo 2023, (doi: 622
10.5281/zenodo.8067384). 623

HG282 [31] Henry Garrett, “New Ideas On Super Dimity By Hyper Dimple Of Equal Dimension 624
2023, (doi: 10.5281/zenodo.8067409). 626
By Dimension Dominating As Hyper Dimple On Super Dimity”, Zenodo 2023, (doi: 628
10.5281/zenodo.8061927). 629
HG280 [33] Henry Garrett, “New Ideas On Super Dimity By Hyper Dimple Of Dimension Dominating 630
In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 631
10.5281/zenodo.8062016). 632
By Reverse Connective Dominating As Hyper Conceit On Super Con”, Zenodo 2023, (doi: 634
10.5281/zenodo.8057696). 635
HG278 [35] Henry Garrett, “New Ideas On Super Con By Hyper Conceit Of Reverse Connective 636
2023, (doi: 10.5281/zenodo.8057753). 638
By Equal Connective Dominating As Hyper Conceit On Super Con”, Zenodo 2023, (doi: 640
10.5281/zenodo.8052893). 641
HG276 [37] Henry Garrett, “New Ideas On Super Con By Hyper Conceit Of Equal Connective 642
2023, (doi: 10.5281/zenodo.8052925). 644
By Connective Dominating As Hyper Conceit On Super Con”, Zenodo 2023, (doi: 646
10.5281/zenodo.8051346). 647
HG274 [39] Henry Garrett, “New Ideas On Super Con By Hyper Conceit Of Connective Dominating 648
10.5281/zenodo.8051360). 650
HG273 [40] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyper- 651
Graph By United Dominating As Hyper Ultra On Super Units”, Zenodo 2023, (doi: 652
10.5281/zenodo.8025707). 653
HG272 [41] Henry Garrett, “New Ideas On Super Units By Hyper Ultra Of United Dominating 654
10.5281/zenodo.8027275). 656
By Zero Forcing As Hyper ford On Super forceps”, Zenodo 2023, (doi: 10.5281/zen- 658
odo.8017246). 659
HG270 [43] Henry Garrett, “New Ideas On Super forceps By Hyper ford Of Zero Forcing In 660
Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 661
10.5281/zenodo.8020128). 662

By Matrix-Based As Hyper mat On Super matte”, Zenodo 2023, (doi: 10.5281/zen- 664
odo.7978571). 665
HG268 [45] Henry Garrett, “New Ideas On Super mat By Hyper matte Of Matrix-Based In 666
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 667
10.5281/zenodo.7978857). 668
Graph By Dominating-Edges As Hyper Dome On Super Eddy”, Zenodo 2023, (doi: 670
10.5281/zenodo.7940830). 671
HG266 [47] Henry Garrett, “New Ideas On Super Eddy By Hyper Dome Of Dominating-Edges 672
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 673
10.5281/zenodo.7943578). 674
Graph By Edge-Gap As Hyper Gape On Super Gab”, Zenodo 2023, (doi: 10.5281/zen- 676
odo.7916595). 677
HG264 [49] Henry Garrett, “New Ideas On Super Gab By Hyper Gape Of Edge-Gap In Cancer’s 678
Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zen- 679
odo.7923632). 680
By Eulerian-Type-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, 682
(doi: 10.5281/zenodo.7904698). 683
HG262 [51] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Type- 684
Cycle-Neighbor In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 685
2023, (doi: 10.5281/zenodo.7904671). 686
By Eulerian-Type-Cycle-Decomposition As Hyper Decompress On Super Decompensation”, 688
Zenodo 2023, (doi: 10.5281/zenodo.7904529). 689
HG260 [53] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of Eulerian- 690
Type-Cycle-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyper- 691
Graph”, Zenodo 2023, (doi: 10.5281/zenodo.7904401). 692
By Eulerian-Type-Cycle-Cut As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 694
10.5281/zenodo.7871026). 695
Cycle-Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 697
2023, (doi: 10.5281/zenodo.7874647). 698
By Eulerian-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 700
10.5281/zenodo.7857856). 701

HG256 [57] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Cycle- 702
Neighbor In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 703
2023, (doi: 10.5281/zenodo.7857841). 704
By Eulerian-Cycle-Decomposition As Hyper Decompress On Super Decompensation”, 706
Cycle-Decomposition In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, 709
Graph By Eulerian-Cycle-Cut As Hyper Eulogy On Super EULA”, Zenodo 2023, (doi: 712
10.5281/zenodo.7853867). 713
HG252 [61] Henry Garrett, “New Ideas On Super EULA By Hyper Eulogy Of Eulerian-Cycle-Cut 714
10.5281/zenodo.7853922). 716
By Eulerian-Type-Path-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, 718
(doi: 10.5281/zenodo.7851519). 719
HG250 [63] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Type-Path- 720
Neighbor In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, 721
(doi: 10.5281/zenodo.7851550). 722
By Eulerian-Type-Path-Decomposition As Hyper Decompress On Super Decompensation”, 724
Type-Path-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 727
By Eulerian-Type-Path-Cut As Hyper Eulogy On Super EULA”, Zenodo 2023, (doi: 730
10.5281/zenodo.7834229). 731
HG246 [67] Henry Garrett, “New Ideas On Super EULA By Hyper Eulogy Of Eulerian-Type-Path-Cut 732
10.5281/zenodo.7834261). 734
By Eulerian-Path-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 736
10.5281/zenodo.7824560). 737
HG244 [69] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Path- 738
(doi: 10.5281/zenodo.7824623). 740

By Eulerian-Path-Decomposition As Hyper Decompress On Super Decompensation”, 742
Path-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 745
As Hyper Tool On Super Toot”, Zenodo 2023, (doi: 10.5281/zenodo.7812236). 748
By initial Eulerian-Path-Cut As Hyper initial Eulogy On Super initial EULA”, Zenodo 750
2023, (doi: 10.5281/zenodo.7809365). 751
By Eulerian-Path-Cut As Hyper Eulogy-Path-Cut On Super EULA-Path-Cut”, Zenodo 753
2023, (doi: 10.5281/zenodo.7809358). 754
HG238 [75] Henry Garrett, “New Ideas On Super EULA By Hyper Eulogy Of Eulerian-Path-Cut 755
10.5281/zenodo.7809219). 757
Graph By Eulerian-Path-Cut As Hyper Eulogy On Super EULA”, Zenodo 2023, (doi: 759
10.5281/zenodo.7809328). 760
By Hamiltonian-Type-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 762
2023, (doi: 10.5281/zenodo.7806767). 763
HG235 [78] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Hamiltonian-Type- 764
2023, (doi: 10.5281/zenodo.7806838). 766
By Hamiltonian-Type-Cycle-Decomposition As Hyper Decompress On Super Decompensa- 768
tion”, Zenodo 2023, (doi: 10.5281/zenodo.7804238). 769
HG233 [80] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of 770
Hamiltonian-Type-Cycle-Decomposition In Cancer’s Recognition With (Neutrosophic) 771
SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zenodo.7804228). 772
By Hamiltonian-Type-Cycle-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi: 774
10.5281/zenodo.7799902). 775
HG231 [82] Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Type- 776
Cycle-Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, 777
(doi: 10.5281/zenodo.7804218). 778

By Hamiltonian-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, 780
(doi: 10.5281/zenodo.7796334). 781
By Hamiltonian-Cycle-Decomposition As Hyper Decompress On Super Decompensation”, 783
By Hamiltonian-Cycle-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi: 786
10.5281/zenodo.7791952). 787
HG225 [86] Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Cycle- 788
Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 789
10.5281/zenodo.7791982). 790
By Hamiltonian-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 792
10.5281/zenodo.7790026). 793
HG223 [88] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Hamiltonian-Neighbor 794
10.5281/zenodo.7790052). 796
By Hamiltonian-Decomposition As Hyper Decompress On Super Decompensation”, Zenodo 798
2023, (doi: 10.5281/zenodo.7787066). 799
Hamiltonian-Decomposition In Recognition of Cancer With (Neutrosophic) SuperHy- 801
perGraph”, Zenodo 2023, (doi: 10.5281/zenodo.7787094). 802
By Hamiltonian-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi: 804
10.5281/zenodo.7781476). 805
HG219 [92] Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Cut 806
10.5281/zenodo.7783082). 808
Graph By Trace-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 810
10.5281/zenodo.7777857). 811
HG217 [94] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Trace-Neighbor 812
10.5281/zenodo.7779286). 814
HG215 [95] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 815
By Trace-Decomposition As Hyper Decompress On Super Decompensation”, Zenodo 2023, 816
(doi: 10.5281/zenodo.7771831). 817

HG214 [96] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of Trace- 818
Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 819
2023, (doi: 10.5281/zenodo.7772468). 820
By Trace-Cut As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 822
10.13140/RG.2.2.20913.25446). 823
HG212 [98] Henry Garrett, “New Ideas On Super Tract By Hyper Track Of Trace-Cut In Cancer’s 824
odo.7764916). 826
By Edge-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 828
10.13140/RG.2.2.11770.98247). 829
HG210 [100] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Edge-Neighbor In 830
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 831
10.13140/RG.2.2.12400.12808). 832
By Edge-Decomposition As Hyper Decompress On Super Decompensation”, ResearchGate 834
2023, (doi: 10.13140/RG.2.2.22545.10089). 835
Edge-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 837
ResearchGate 2023, (doi: 10.13140/RG.2.2.29544.34564). 838
HG207 [103] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyper- 839
Graph By Edge-Cut As Hyper Edify On Super Eddy”, ResearchGate 2023, (doi: 840
10.13140/RG.2.2.11377.76644). 841
HG206 [104] Henry Garrett, “New Ideas On Super Eddy By Hyper Edify Of Edge-Cut In Can- 842
cer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 843
10.13140/RG.2.2.23750.96329). 844
By Vertex-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 846
10.13140/RG.2.2.31366.24641). 847
HG204 [106] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Vertex-Neighbor In 848
10.13140/RG.2.2.34721.68960). 850
By Vertex-Decomposition As Hyper Decompress On Super Decompensation”, ResearchGate 852
2023, (doi: 10.13140/RG.2.2.30212.81289). 853
Vertex-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 855

Graph By Vertex-Cut As Hyper Vertu On Super Vertigo”, ResearchGate 2023, (doi: 858
10.13140/RG.2.2.24288.35842). 859
HG200 [110] Henry Garrett, “New Ideas On Super Vertigo By Hyper Vertu Of Vertex-Cut In 860
10.13140/RG.2.2.32467.25124). 862
By Stable-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 864
10.13140/RG.2.2.31025.45925). 865
HG198 [112] Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of Stable-Neighbor In 866
10.13140/RG.2.2.17184.25602). 868
By Stable-Decompositions As Hyper Stain On Super Stagy”, ResearchGate 2023, (doi: 870
10.13140/RG.2.2.23423.28327). 871
HG196 [114] Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Decompositions In 872
10.13140/RG.2.2.28456.44805). 874
Graph By Stable-Cut As Hyper Stain On Super Stagy”, ResearchGate 2023, (doi: 876
10.13140/RG.2.2.23525.68320). 877
HG194 [116] Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Cut In Can- 878
10.13140/RG.2.2.20170.24000). 880
By Clique-Neighbors As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 882
10.13140/RG.2.2.36475.59683). 883
HG192 [118] Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of Clique-Neighbors In 884
10.13140/RG.2.2.29764.71046). 886
By Clique-Decompositions As Hyper Decompile On Super Decommission”, ResearchGate 888
2023, (doi: 10.13140/RG.2.2.18780.87683). 889
Clique- Decompositions In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 891
Graph By Clique-Cut As Hyper Click On Super Cliche”, ResearchGate 2023, (doi: 894
10.13140/RG.2.2.26134.01603). 895

HG188 [122] Henry Garrett, “New Ideas On Super Cliff By Hyper Cling Of Clique-Cut In Can- 896
10.13140/RG.2.2.27392.30721). 898
HG187 [123] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHy- 899
perGraph By Space As Hyper Spin On Super Spacy”, ResearchGate 2023, (doi: 900
10.13140/RG.2.2.33028.40321). 901
Graph By List- Coloring As Hyper List On Super Lisle”, ResearchGate 2023, (doi: 903
10.13140/RG.2.2.21389.20966). 904
HG185 [125] Henry Garrett, “New Ideas On Super Lith By Hyper Lite Of List-Coloring In 905
10.13140/RG.2.2.16356.04489). 907
perGraph By Space As Hyper Sparse On Super Spark”, ResearchGate 2023, (doi: 909
10.13140/RG.2.2.21756.21129). 910
HG183 [127] Henry Garrett, “New Ideas On Super Solidarity By Hyper Soul Of Space In 911
Cancer’s Recognition With (Extreme) SuperHyperGraph”, ResearchGate 2023, (doi: 912
10.13140/RG.2.2.30983.68009). 913
By Edge-Connectivity As Hyper Disclosure On Super Closure”, ResearchGate 2023, (doi: 915
10.13140/RG.2.2.28552.29445). 916
HG181 [129] Henry Garrett, “New Ideas On Super Uniform By Hyper Deformation Of Edge-Connectivity 917
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, 918
(doi: 10.13140/RG.2.2.10936.21761). 919
By Vertex-Connectivity As Hyper Leak On Super Structure”, ResearchGate 2023, (doi: 921
10.13140/RG.2.2.35105.89447). 922
HG179 [131] Henry Garrett, “New Ideas On Super System By Hyper Explosions Of Vertex-Connectivity 923
(doi: 10.13140/RG.2.2.30072.72960). 925
By Tree-Decomposition As Hyper Forward On Super Returns”, ResearchGate 2023, (doi: 927
10.13140/RG.2.2.31147.52003). 928
HG177 [133] Henry Garrett, “New Ideas On Super Nodes By Hyper Moves Of Tree-Decomposition In 929
10.13140/RG.2.2.32825.24163). 931
Graph By Chord As Hyper Excellence On Super Excess”, ResearchGate 2023, (doi: 933
10.13140/RG.2.2.13059.58401). 934

HG175 [135] Henry Garrett, “New Ideas On Super Gap By Hyper Navigations Of Chord In 935
10.13140/RG.2.2.11172.14720). 937
By SuperHyper(i,j)-Domination As Hyper Controller On Super Waves”, ResearchGate 939
2023, (doi: 10.13140/RG.2.2.22011.80165). 940
HG173 [137] Henry Garrett, “New Ideas On Super Coincidence By Hyper Routes Of SuperHyper(i,j)- 941
Domination In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchG- 942
ate 2023, (doi: 10.13140/RG.2.2.30819.84003). 943
By SuperHyperEdge-Domination As Hyper Reversion On Super Indirection”, ResearchGate 945
2023, (doi: 10.13140/RG.2.2.10493.84962). 946
HG171 [139] Henry Garrett, “New Ideas On Super Obstacles By Hyper Model Of SuperHyperEdge- 947
ate 2023, (doi: 10.13140/RG.2.2.13849.29280). 949
By SuperHyperK-Domination As Hyper k-Actions On Super Patterns”, ResearchGate 951
2023, (doi: 10.13140/RG.2.2.19944.14086). 952
HG169 [141] Henry Garrett, “New Ideas On Super Harmony By Hyper k-Function Of SuperHyperK- 953
ate 2023, (doi: 10.13140/RG.2.2.23299.58404). 955
By SuperHyperK-Number As Hyper k-Partition On Super Layers”, ResearchGate 2023, 957
(doi: 10.13140/RG.2.2.33103.76968). 958
HG167 [143] Henry Garrett, “New Ideas On Super Gradient By Hyper k-Class Of SuperHyperK-Number 959
(doi: 10.13140/RG.2.2.23037.44003). 961
By SuperHyperOrder As Hyper Enumerations On Super Landmarks”, ResearchGate 2023, 963
(doi: 10.13140/RG.2.2.35646.56641). 964
HG165 [145] Henry Garrett, “New Ideas On Super Analogous By Hyper Visions Of SuperHyperOrder In 965
10.13140/RG.2.2.18030.48967). 967
By SuperHyperColoring As Hyper Categories On Super Neighbors”, ResearchGate 2023, 969
(doi: 10.13140/RG.2.2.13973.81121). 970
HG163 [147] Henry Garrett, “New Ideas On Super Relations By Hyper Identifications Of SuperHyper- 971
Coloring In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 972
2023, (doi: 10.13140/RG.2.2.34106.47047). 973

HG162 [148] Henry Garrett, “New Ideas On Super Contradiction By Hyper Detection of SuperHyper- 974
Defensive In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 975
By SuperHyperDimension As Hyper Distinguishing On Super Distances”, ResearchGate 978
2023, (doi: 10.13140/RG.2.2.31956.88961). 979
HG160 [150] Henry Garrett, “New Ideas On Super Locations By Hyper Differing Of SuperHyperDi- 980
mension In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 981
2023, (doi: 10.13140/RG.2.2.15179.67361). 982
By SuperHyperDominating As Hyper Closing On Super Messy”, ResearchGate 2023, (doi: 984
10.13140/RG.2.2.21510.45125). 985
HG158 [152] Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDom- 986
inating In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 987
2023, (doi: 10.13140/RG.2.2.13121.84321). 988
By SuperHyperConnected As Hyper Group On Super Surge”, ResearchGate 2023, (doi: 990
10.13140/RG.2.2.11758.69441). 991
HG156 [154] Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of SuperHyperCon- 992
nected In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 993
2023, (doi: 10.13140/RG.2.2.31891.35367). 994
By SuperHyperTotal As Hyper Covering On Super Infections”, ResearchGate 2023, (doi: 996
10.13140/RG.2.2.19360.87048). 997
HG154 [156] Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal 998
In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 999
10.13140/RG.2.2.32363.21286). 1000
HG153 [157] Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect 1001
10.13140/RG.2.2.23266.81602). 1003
By SuperHyperPerfect As Hyper Idealism On Super Vacancy”, ResearchGate 2023, (doi: 1005
10.13140/RG.2.2.19911.37285). 1006
By SuperHyperJoin As Hyper Separations On Super Sorts”, ResearchGate 2023, (doi: 1008
10.13140/RG.2.2.11050.90569). 1009
HG150 [160] Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of SuperHy- 1010
perJoin In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 1011
2023, (doi: 10.13140/RG.2.2.17761.79206). 1012

HG149 [161] Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of Super- 1013
HyperDuality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 1014
HG148 [162] Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph 1016
By SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchG- 1017
ate 2023, (doi: 10.13140/RG.2.2.33275.80161). 1018
By Path SuperHyperColoring As Hyper Correction On Super Faults”, ResearchGate 2023, 1020
(doi: 10.13140/RG.2.2.30182.50241). 1021
HG146 [164] Henry Garrett, “New Ideas On Super Reflections By Hyper Rotations Of Path SuperHy- 1022
perColoring In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 1023
HG145 [165] Henry Garrett, “New Ideas As Hyper Deformations On Super Chains In Cancer’s 1025
Neutrosophic Recognition and Neutrosophic SuperHyperGraph By SuperHyperDensity”, 1026
HG144 [166] Henry Garrett, “New Ideas As Hyper Ignorance By SuperHyperDensity On Super 1028
Resistances In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 1029
ResearchGate 2023, (doi:10.13140/RG.2.2.16800.05123). 1030
HG143 [167] Henry Garrett, “New Research On Cancer’s Recognition and Neutrosophic SuperHyper- 1031
Graph By Eulerian SuperHyperCycles and Hamiltonian Sets As Hyper Covering Versus 1032
Super separations-VI ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.29913.80482). 1033
Super separations-V ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.33269.24809). 1036
Super separations-IV ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.34946.96960). 1039
HG140 [170] Henry Garrett, “A Research On Cancer’s Recognition and Neutrosophic SuperHyperGraph 1040
By Eulerian SuperHyperCycles and Hamiltonian Sets As Hyper Covering Versus Super 1041
separations-III ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.14814.31040). 1042
separations-II ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.15653.17125). 1045
separations-I ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.25719.50089). 1048
HG137 [173] Henry Garrett, “New Ideas On Super Disruptions In Cancer’s Extreme Recognition 1049
As Neutrosophic SuperHyperGraph By Hyper Plans Called SuperHyperConnectivities”, 1050

HG136 [174] Henry Garrett, “Cancer’s Neutrosophic Recognition As Neutrosophic SuperHyperGraph 1052
By SuperHyperConnectivities As Hyper Diagnosis On Super Mechanism”, ResearchGate 1053
2023, (doi: 10.13140/RG.2.2.17252.24968). 1054
HG135 [175] Henry Garrett,“Cancer’s Recognition and (Neutrosophic) SuperHyperGraph By the Criteria 1055
of Eulerian and Hamiltonian Type-Sets As Hyper Modified Cycles On Super Mess”, 1056
ResearchGate 2023,(doi: 10.13140/RG.2.2.16652.59525). 1057
HG134 [176] Henry Garrett,“Eulerian and Hamiltonian In Cancer’s Neutrosophic Recognition and 1058
Neutrosophic SuperHyperGraph On Super Interactions By Hyper Extensions of Cycles”, 1059

HG132 [177] Henry Garrett,“SuperHyperGirth Type-Results on extreme SuperHyperGirth theory and 1061
(Neutrosophic) SuperHyperGraphs Toward Cancer’s extreme Recognition”, Preprints 2023, 1062

2023010396 (doi: 10.20944/preprints202301.0396.v1). 1063
HG131 [178] Henry Garrett,“Neutrosophic SuperHyperGraphs Warns Hyper Landmark of neutrosophic 1064
SuperHyperGirth In Super Type-Versions of Cancer’s neutrosophic Recognition”, Preprints 1065
2023, 2023010395 (doi: 10.20944/preprints202301.0395.v1). 1066
HG130 [179] Henry Garrett,“The Constructions of (Neutrosophic) SuperHyperGraphs on the Cancer’s 1067
Recognition in The Confrontation With Super Attacks In Hyper Situations By Implementing 1068
(Neutrosophic) 1-Failed SuperHyperForcing in The Technical Approaches to Neutralize 1069

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

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

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

Graph”, ResearchGate 2023,(doi: 10.13140/RG.2.2.26836.88960). 1077
HG127 [182] Henry Garrett,“SuperHyperGirth Approaches on the Super Challenges on the Cancer’s 1078
Recognition In the Hyper Model of (Neutrosophic) SuperHyperGraph”, ResearchGate 1079
2023,(doi: 10.13140/RG.2.2.36745.93289). 1080
HG126 [183] Henry Garrett,“Extreme SuperHyperClique as the Firm Scheme of Confrontation under 1081
HG125 [184] Henry Garrett,“Uncertainty On The Act And Effect Of Cancer Alongside The Foggy 1084
10.20944/preprints202301.0282.v1). 1087
HG124 [185] Henry Garrett,“Neutrosophic Version Of Separates Groups Of Cells In Cancer’s 1088
10.20944/preprints202301.0267.v1).). 1090

(doi: 10.20944/preprints202301.0265.v1). 1095
HG122 [187] Henry Garrett,“Breaking the Continuity and Uniformity of Cancer In The Worst Case of 1096
prints202301.0262.v1). 1099
2023010224, (doi: 10.20944/preprints202301.0224.v1). 1105
HG24 [190] Henry Garrett,“SuperHyperMatching By (R-)Definitions And Polynomials To Monitor 1106
Cancer’s Recognition In Neutrosophic SuperHyperGraphs”, ResearchGate 2023,(doi: 1107

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

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

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

cer’s Recognition called Neutrosophic SuperHyperGraphs”, ResearchGate 2023, (doi: 1119
10.13140/RG.2.2.15897.70243). 1120

10.13140/RG.2.2.32530.73922). 1124

prints202301.0105.v1). 1127
HG28 [196] Henry Garrett,“Perfect Directions Toward Idealism in Cancer’s Neutrosophic Recogni- 1128
tion Forwarding Neutrosophic SuperHyperClique on Neutrosophic SuperHyperGraphs”, 1129

HG29 [197] Henry Garrett,“Demonstrating Complete Connections in Every Embedded Regions 1131
and Sub-Regions in the Terms of Cancer’s Recognition and (Neutrosophic) Su- 1132
perHyperGraphs With (Neutrosophic) SuperHyperClique”, ResearchGate 2023, (doi: 1133
10.13140/RG.2.2.23172.19849). 1134
HG30 [200] Henry Garrett,“Different Neutrosophic Types of Neutrosophic Regions titled neut- 1141
rosophic Failed SuperHyperStable in Cancer’s Neutrosophic Recognition modeled 1142
in the Form of Neutrosophic SuperHyperGraphs”, ResearchGate 2023, (doi: 1143
10.13140/RG.2.2.17385.36968). 1144
Preprints 2023, 2023010044 1147
10.20944/preprints202301.0043.v1). 1150
HG31 [203] Henry Garrett, “Using the Tool As (Neutrosophic) Failed SuperHyperStable To SuperHy- 1151
perModel Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs”, ResearchGate 1152

2023, (doi: 10.13140/RG.2.2.28945.92007). 1153
SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 1158
10.13140/RG.2.2.35774.77123). 1159
HG35 [207] Henry Garrett, “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Re- 1163
cognitions And (Neutrosophic) SuperHyperGraphs”, ResearchGate 2022, (doi: 1164

10.13140/RG.2.2.29430.88642). 1165

(doi: 10.20944/preprints202212.0549.v1). 1171
(Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, ResearchGate 2022, (doi: 1173

10.13140/RG.2.2.19380.94084). 1174
SuperHyperClasses”, ResearchGate 2022, (doi: 10.13140/RG.2.2.14426.41923). 1182
(doi: 10.20944/preprints202212.0500.v1). 1185
Graph With SuperHyperModeling of Cancer’s Recognitions”, ResearchGate 2022 (doi: 1187
10.13140/RG.2.2.20993.12640). 1188
HG952 [215] Henry Garrett,“Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic 1189

HG95 [216] Henry Garrett, “Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic Su- 1192
perHyperGraphs And SuperHyperGraphs Alongside Applications in Cancer’s Treatments”, 1193
ResearchGate 2022 (doi: 10.13140/RG.2.2.23123.04641). 1194
HG37 [219] Henry Garrett, “Basic Neutrosophic Notions Concerning SuperHyperDominating and 1201
Neutrosophic SuperHyperResolving in SuperHyperGraph”, ResearchGate 2022 (doi: 1202

10.13140/RG.2.2.29173.86244). 1203
HG38 [220] Henry Garrett, “Initial Material of Neutrosophic Preliminaries to Study Some Neutrosophic 1204
Notions Based on Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic SuperHyper- 1205
Graph (NSHG)”, ResearchGate 2022 (doi: 10.13140/RG.2.2.25385.88160). 1206

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

HG165b [239] Henry Garrett, “Eulerian-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1243
10.5281/zenodo.7854561). 1244
HG164b [240] Henry Garrett, “Eulerian-Type-Path-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 1245
2023 (doi: 10.5281/zenodo.7851893). 1246
HG163b [241] Henry Garrett, “Eulerian-Type-Path-Decomposition In SuperHyperGraphs”. Dr. Henry 1247

HG162b [242] Henry Garrett, “Eulerian-Type-Path-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1249
(doi: 10.5281/zenodo.7835063). 1250
HG161b [243] Henry Garrett, “Eulerian-Path-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1251
(doi: 10.5281/zenodo.7826705). 1252
HG160b [244] Henry Garrett, “Eulerian-Path-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 1253
2023 (doi: 10.5281/zenodo.7820680). 1254
HG159b [245] Henry Garrett, “Eulerian-Path-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1255
10.5281/zenodo.7812750). 1256
HG158b [246] Henry Garrett, “Hamiltonian-Type-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry 1257

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

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

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

HG111b [293] Henry Garrett, “SuperHyperConnected”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1350
odo.7647868). 1351
HG110b [294] Henry Garrett, “SuperHyperTotal”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1352
odo.7647017). 1353
HG109b [295] Henry Garrett, “SuperHyperPerfect”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1354
odo.7644894). 1355
HG108b [296] Henry Garrett, “SuperHyperJoin”. Dr. Henry Garrett, 2023 (doi: 10.5281/zenodo.7641880). 1356
HG107b [297] Henry Garrett, “Path SuperHyperColoring”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1357
odo.7632923). 1358
HG106b [298] Henry Garrett, “SuperHyperDensity”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1359
odo.7623459). 1360
HG105b [299] Henry Garrett, “Neutrosophic SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 1361
10.5281/zenodo.7606416). 1362
HG104b [300] Henry Garrett, “Extreme SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 1363
10.5281/zenodo.7606416). 1364
HG103b [301] Henry Garrett, “SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1365
odo.7606404). 1366
HG102b [302] Henry Garrett, “Neutrosophic SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 1367
10.5281/zenodo.7580018). 1368
HG101b [303] Henry Garrett, “Extreme SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1369
odo.7580018). 1370
odo.7580018). 1372
odo.7579929). 1374
HG98b [306] Henry Garrett, “Neutrosophic SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 1375
10.5281/zenodo.7563170). 1376
HG97b [307] Henry Garrett, “Extreme SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1377
odo.7563164). 1378
HG96b [308] Henry Garrett, “SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1379
odo.7563160). 1380
odo.7563160). 1382
HG94b [310] Henry Garrett, “Overlook On SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 1383
10.5281/zenodo.7563160). 1384

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

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

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

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

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

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

CHAPTER 5 1565
Extreme Strict Connective Dominating 1566
Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of SuperHyperDu- 1567
ality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, ResearchGate 1568
2023, (doi: 10.13140/RG.2.2.34953.52320). 1569

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

CHAPTER 6 1603
New Ideas On Super Con By Hyper 1604
Conceit Of Strict Connective Dominating 1605
In Recognition of Cancer With 1606
(Neutrosophic) SuperHyperGraph 1607
53
CHAPTER 7 1608
ABSTRACT 1609
In this scientific research, (Different Neutrosophic Types of Neutrosophic SuperHyperStrict 1610

Connective Dominating). Assume a Neutrosophic SuperHyperGraph (NSHG) S is a Strict Connective 1611
0
Dominating pair S = (V, E). Consider a Neutrosophic SuperHyperSet V = {V1 , V2 , . . . , Vs } and 1612
0 0 0
E = {E1 , E2 , . . . , Ez }. Then either V or E is called Neutrosophic e-SuperHyperStrict Connective 1613
Dominating if the following expression is called Neutrosophic e-SuperHyperStrict Connective Dominating 1614
criteria holds 1615
∀Ea ∈ EN SHG , ∃Eb ∈ E 0 : ∃Vc ∈ VN SHG , Vc ∈ Ea , Eb

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

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

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

55
Neutrosophic rv-SuperHyperStrict Connective Dominating if the following expression is called 1621

Neutrosophic v-SuperHyperStrict Connective Dominating criteria holds 1622

and |Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; Neutrosophic Super- 1623
HyperStrict Connective Dominating if it’s either of Neutrosophic e-SuperHyperStrict Connective Dominating, 1624
Neutrosophic re-SuperHyperStrict Connective Dominating, Neutrosophic v-SuperHyperStrict Connective 1625
Dominating, and Neutrosophic rv-SuperHyperStrict Connective Dominating. ((Neutrosophic) SuperHy- 1626
perStrict Connective Dominating). Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair 1627
S = (V, E). Consider a Neutrosophic SuperHyperEdge (NSHE) E = {V1 , V2 , . . . , Vs }. Then 1628
E is called an Extreme SuperHyperStrict Connective Dominating if it’s either of Neutrosophic e- 1629

SuperHyperStrict Connective Dominating, Neutrosophic re-SuperHyperStrict Connective Dominating, Neut- 1630
rosophic v-SuperHyperStrict Connective Dominating, and Neutrosophic rv-SuperHyperStrict Connective 1631
Dominating and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum 1632
Extreme cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of the Ex- 1633
treme SuperHyperEdges in the consecutive Extreme sequence of Extreme SuperHyperEdges 1634
and Extreme SuperHyperVertices such that they form the Extreme SuperHyperStrict Connect- 1635
ive Dominating; a Neutrosophic SuperHyperStrict Connective Dominating if it’s either of Neutrosophic 1636
e-SuperHyperStrict Connective Dominating, Neutrosophic re-SuperHyperStrict Connective Dominating, Neut- 1637
Dominating and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum 1639
Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet 1640
S of high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and Neutrosophic 1641

SuperHyperVertices such that they form the Neutrosophic SuperHyperStrict Connective Dominating; an 1642
Extreme SuperHyperStrict Connective Dominating SuperHyperPolynomial if it’s either of Neutrosophic 1643
Dominating and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme 1646
SuperHyperPolynomial contains the Extreme coefficients defined as the Extreme number of the 1647
maximum Extreme cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet 1648
S of high Extreme cardinality consecutive Extreme SuperHyperEdges and Extreme Super- 1649
HyperVertices such that they form the Extreme SuperHyperStrict Connective Dominating; and the 1650
Extreme power is corresponded to its Extreme coefficient; a Neutrosophic SuperHyperStrict Con- 1651
nective Dominating SuperHyperPolynomial if it’s either of Neutrosophic e-SuperHyperStrict Connective 1652
Dominating, Neutrosophic re-SuperHyperStrict Connective Dominating, Neutrosophic v-SuperHyperStrict 1653

Connective Dominating, and Neutrosophic rv-SuperHyperStrict Connective Dominating and C(N SHG) for a 1654
Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 1655
contains the Neutrosophic coefficients defined as the Neutrosophic number of the maximum Neut- 1656
rosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S 1657
of high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and Neutrosophic 1658
SuperHyperVertices such that they form the Neutrosophic SuperHyperStrict Connective Dominat- 1659

ing; and the Neutrosophic power is corresponded to its Neutrosophic coefficient; an Extreme 1660
V-SuperHyperStrict Connective Dominating if it’s either of Neutrosophic e-SuperHyperStrict Connective 1661
Connective Dominating, and Neutrosophic rv-SuperHyperStrict Connective Dominating and C(N SHG) for 1663
an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme cardinality of an 1664
Extreme SuperHyperSet S of high Extreme cardinality of the Extreme SuperHyperVertices 1665
in the consecutive Extreme sequence of Extreme SuperHyperEdges and Extreme SuperHyper- 1666
Vertices such that they form the Extreme SuperHyperStrict Connective Dominating; a Neutrosophic 1667
a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic cardin- 1671
ality of the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S of high 1672

Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and Neutrosophic Supe- 1673
rHyperVertices such that they form the Neutrosophic SuperHyperStrict Connective Dominating; an 1674
Extreme V-SuperHyperStrict Connective Dominating SuperHyperPolynomial if it’s either of Neutro- 1675
sophic e-SuperHyperStrict Connective Dominating, Neutrosophic re-SuperHyperStrict Connective Dominating, 1676
Neutrosophic v-SuperHyperStrict Connective Dominating, and Neutrosophic rv-SuperHyperStrict Connect- 1677
ive Dominating and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme 1678
maximum Extreme cardinality of the Extreme SuperHyperVertices of an Extreme SuperHyperSet 1680
S of high Extreme cardinality consecutive Extreme SuperHyperEdges and Extreme SuperHyper- 1681
Vertices such that they form the Extreme SuperHyperStrict Connective Dominating; and the Extreme 1682
power is corresponded to its Extreme coefficient; a Neutrosophic SuperHyperStrict Connective Domin- 1683
ating SuperHyperPolynomial if it’s either of Neutrosophic e-SuperHyperStrict Connective Dominating, 1684

Dominating, and Neutrosophic rv-SuperHyperStrict Connective Dominating and C(N SHG) for a Neutro- 1686
sophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains 1687
the Neutrosophic coefficients defined as the Neutrosophic number of the maximum Neutrosophic 1688
cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S of high 1689
Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and Neutrosophic Super- 1690

HyperVertices such that they form the Neutrosophic SuperHyperStrict Connective Dominating; and the 1691
Neutrosophic power is corresponded to its Neutrosophic coefficient. In this scientific research, 1692
new setting is introduced for new SuperHyperNotions, namely, a SuperHyperStrict Connective 1693
Dominating and Neutrosophic SuperHyperStrict Connective Dominating. Two different types of Super- 1694
HyperDefinitions are debut for them but the research goes further and the SuperHyperNotion, 1695
SuperHyperUniform, and SuperHyperClass based on that are well-defined and well-reviewed. 1696
The literature review is implemented in the whole of this research. For shining the elegancy and 1697
the significancy of this research, the comparison between this SuperHyperNotion with other 1698
SuperHyperNotions and fundamental SuperHyperNumbers are featured. The definitions are 1699
followed by the examples and the instances thus the clarifications are driven with different tools. 1700
The applications are figured out to make sense about the theoretical aspect of this ongoing 1701
research. The “Cancer’s Recognition” are the under research to figure out the challenges make 1702

perGraph” and “Neutrosophic SuperHyperGraph” are chosen and elected to research about 1707
“Cancer’s Recognition”. Thus these complex and dense SuperHyperModels open up some avenues 1708
to research on theoretical segments and “Cancer’s Recognition”. Some avenues are posed to 1709
pursue this research. It’s also officially collected in the form of some questions and some problems. 1710
Assume a SuperHyperGraph. Assume a SuperHyperGraph. Then δ−SuperHyperStrict Connective 1711
Dominating is a maximal of SuperHyperVertices with a maximum cardinality such that either of 1712
the following expressions hold for the (Neutrosophic) cardinalities of SuperHyperNeighbors of 1713
first Expression, holds if S is an δ−SuperHyperOffensive. And the second Expression, holds 1715
if S is an δ−SuperHyperDefensive; a Neutrosophic δ−SuperHyperStrict Connective Dominating is a 1716
maximal Neutrosophic of SuperHyperVertices with maximum Neutrosophic cardinality such 1717
that either of the following expressions hold for the Neutrosophic cardinalities of SuperHy- 1718
perNeighbors of s ∈ S there are: |S ∩ N (s)|N eutrosophic > |S ∩ (V \ N (s))|N eutrosophic + δ; 1719
and |S ∩ N (s)|N eutrosophic < |S ∩ (V \ N (s))|N eutrosophic + δ. The first Expression, holds 1720
if S is a Neutrosophic δ−SuperHyperOffensive. And the second Expression, holds if S is a 1721
Neutrosophic δ−SuperHyperDefensive It’s useful to define a “Neutrosophic” version of a 1722
SuperHyperStrict Connective Dominating . Since there’s more ways to get type-results to make a 1723
SuperHyperStrict Connective Dominating more understandable. For the sake of having Neutrosophic 1724
SuperHyperStrict Connective Dominating, there’s a need to “redefine” the notion of a “SuperHyperStrict 1725
Connective Dominating ”. The SuperHyperVertices and the SuperHyperEdges are assigned by the 1726
labels from the letters of the alphabets. In this procedure, there’s the usage of the position 1727
of labels to assign to the values. Assume a SuperHyperStrict Connective Dominating . It’s redefined 1728
a Neutrosophic SuperHyperStrict Connective Dominating if the mentioned Table holds, concerning, 1729
“The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges Belong to 1730
The Neutrosophic SuperHyperGraph” with the key points, “The Values of The Vertices & 1731
The Number of Position in Alphabet”, “The Values of The SuperVertices&The maximum 1732
SuperHyperStrict Connective Dominating . It’s the main. It’ll be disciplinary to have the foundation of 1737
previous definition in the kind of SuperHyperClass. If there’s a need to have all SuperHyperStrict 1738
Connective Dominating until the SuperHyperStrict Connective Dominating, then it’s officially called a “Super- 1739
HyperStrict Connective Dominating” but otherwise, it isn’t a SuperHyperStrict Connective Dominating . There 1740
are some instances about the clarifications for the main definition titled a “SuperHyperStrict 1741
Connective Dominating ”. These two examples get more scrutiny and discernment since there are 1742
characterized in the disciplinary ways of the SuperHyperClass based on a SuperHyperStrict 1743
Connective Dominating . For the sake of having a Neutrosophic SuperHyperStrict Connective Dominating, 1744
there’s a need to “redefine” the notion of a “Neutrosophic SuperHyperStrict Connective Dominating” 1745
and a “Neutrosophic SuperHyperStrict Connective Dominating ”. The SuperHyperVertices and the 1746
And a SuperHyperStrict Connective Dominating are redefined to a “Neutrosophic SuperHyperStrict 1750
Connective Dominating” if the intended Table holds. It’s useful to define “Neutrosophic” version 1751

of SuperHyperClasses. Since there’s more ways to get Neutrosophic type-results to make a 1752
Neutrosophic SuperHyperStrict Connective Dominating more understandable. Assume a Neutrosophic 1753
SuperHyperGraph. There are some Neutrosophic SuperHyperClasses if the intended Table holds. 1754
Thus SuperHyperPath, SuperHyperStrict Connective Dominating, SuperHyperStar, SuperHyperBi- 1755
partite, SuperHyperMultiPartite, and SuperHyperWheel, are “Neutrosophic SuperHyperPath”, 1756
“Neutrosophic SuperHyperStrict Connective Dominating”, “Neutrosophic SuperHyperStar”, “Neutro- 1757

SuperHyperWheel” if the intended Table holds. A SuperHyperGraph has a “Neutrosophic 1759
SuperHyperStrict Connective Dominating” where it’s the strongest [the maximum Neutrosophic value 1760
from all the SuperHyperStrict Connective Dominating amid the maximum value amid all SuperHy- 1761
perVertices from a SuperHyperStrict Connective Dominating .] SuperHyperStrict Connective Dominating . 1762
A graph is a SuperHyperUniform if it’s a SuperHyperGraph and the number of elements of 1763
SuperHyperEdges are the same. Assume a Neutrosophic SuperHyperGraph. There are some 1764
SuperHyperClasses as follows. It’s SuperHyperPath if it’s only one SuperVertex as intersection 1765
amid two given SuperHyperEdges with two exceptions; it’s SuperHyperStrict Connective Dominating if 1766
it’s only one SuperVertex as intersection amid two given SuperHyperEdges; it’s SuperHyperStar 1767
it’s only one SuperVertex as intersection amid all SuperHyperEdges; it’s SuperHyperBipartite it’s 1768

cancer on the complex tracks and between complicated groups of cells could be fantasized by a 1791
Neutrosophic SuperHyperPath(-/SuperHyperStrict Connective Dominating, SuperHyperStar, Super- 1792
HyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find either the 1793

longest SuperHyperStrict Connective Dominating or the strongest SuperHyperStrict Connective Dominating 1794
in those Neutrosophic SuperHyperModels. For the longest SuperHyperStrict Connective Dominating, 1795
called SuperHyperStrict Connective Dominating, and the strongest SuperHyperStrict Connective Dominating, 1796
called Neutrosophic SuperHyperStrict Connective Dominating, some general results are introduced. 1797

Beyond that in SuperHyperStar, all possible SuperHyperPaths have only two SuperHyperEdges 1798
but it’s not enough since it’s essential to have at least three SuperHyperEdges to form any style 1799
of a SuperHyperStrict Connective Dominating. There isn’t any formation of any SuperHyperStrict Con- 1800
nective Dominating but literarily, it’s the deformation of any SuperHyperStrict Connective Dominating. It, 1801
literarily, deforms and it doesn’t form. A basic familiarity with Neutrosophic SuperHyperStrict 1802
Connective Dominating theory, SuperHyperGraphs, and Neutrosophic SuperHyperGraphs theory are 1803
proposed. 1804
Keywords: Extreme SuperHyperGraph, SuperHyperStrict Connective Dominating, Cancer’s Ex- 1805
treme Recognition 1806


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

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

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

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

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

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

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

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

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

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

SuperHyperVertex (NSHV) V. TV0 (Ei0 ), TV0 (Ei0 ), and TV0 (Ei0 ) denote the degree of truth- 1938
membership, the degree of indeterminacy-membership and the degree of falsity-membership 1939
of the Neutrosophic SuperHyperEdge (NSHE) Ei0 to the Neutrosophic SuperHyperEdge 1940
(NSHE) E. Thus, the ii0 th element of the Strict Connective Dominating of Neutrosophic 1941
SuperHyperGraph (NSHG) are of the form (Vi , TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 )), the sets V and E 1942
are crisp sets. 1943

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

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

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

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

where 1968

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

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

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

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

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

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

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


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

(xii) Neutrosophic connective if (T (E), I(E), F (E)) ≥ maximum number of Neutrosophic 2059
strength of SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex (NSHV) Vi 2060
to Neutrosophic SuperHyperVertex (NSHV) Vj where 1 ≤ i, j ≤ s. 2061
Definition 9.0.18. (Different Neutrosophic Types of Neutrosophic SuperHyperStrict Connective 2062

Dominating). 2063
Neutrosophic SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and E 0 = {E1 , E2 , . . . , Ez }. Then either V 0 2065
or E 0 is called 2066
(i) Neutrosophic e-SuperHyperStrict Connective Dominating if the following expression is 2067

called Neutrosophic e-SuperHyperStrict Connective Dominating criteria holds 2068

(ii) Neutrosophic re-SuperHyperStrict Connective Dominating if the following expression is 2069

called Neutrosophic re-SuperHyperStrict Connective Dominating criteria holds 2070

and |Ei |NEUTROSOPHIC CARDINALITY = |Ej |NEUTROSOPHIC CARDINALITY ; 2071
(iii) Neutrosophic v-SuperHyperStrict Connective Dominating if the following expression is 2072
called Neutrosophic v-SuperHyperStrict Connective Dominating criteria holds 2073


(iv) Neutrosophic rv-SuperHyperStrict Connective Dominating if the following expression is 2074


and |Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; 2076
(v) Neutrosophic SuperHyperStrict Connective Dominating if it’s either of Neutrosophic e- 2077

SuperHyperStrict Connective Dominating, Neutrosophic re-SuperHyperStrict Connective Dominating, 2078
Neutrosophic v-SuperHyperStrict Connective Dominating, and Neutrosophic rv-SuperHyperStrict 2079
Connective Dominating. 2080
Definition 9.0.19. ((Neutrosophic) SuperHyperStrict Connective Dominating). 2081

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

Connective Dominating and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is 2087
the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Extreme 2088
cardinality of the Extreme SuperHyperEdges in the consecutive Extreme sequence of 2089

Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 2090
Extreme SuperHyperStrict Connective Dominating; 2091
(ii) a Neutrosophic SuperHyperStrict Connective Dominating if it’s either of Neutrosophic 2092
e-SuperHyperStrict Connective Dominating, Neutrosophic re-SuperHyperStrict Connective Dominating, 2093

Connective Dominating and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 2095
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a 2096
Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive Neutrosophic 2097
SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the 2098
Neutrosophic SuperHyperStrict Connective Dominating; 2099
(iii) an Extreme SuperHyperStrict Connective Dominating SuperHyperPolynomial if 2100

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

(iv) a Neutrosophic SuperHyperStrict Connective Dominating SuperHyperPolynomial 2110

if it’s either of Neutrosophic e-SuperHyperStrict Connective Dominating, Neutrosophic re- 2111
and Neutrosophic rv-SuperHyperStrict Connective Dominating and C(N SHG) for a Neutrosophic 2113
SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains 2114
the Neutrosophic coefficients defined as the Neutrosophic number of the maximum Neutro- 2115
sophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet 2116

S of high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and Neutro- 2117
sophic SuperHyperVertices such that they form the Neutrosophic SuperHyperStrict Connective 2118
Dominating; and the Neutrosophic power is corresponded to its Neutrosophic coefficient; 2119
(v) an Extreme V-SuperHyperStrict Connective Dominating if it’s either of Neutrosophic e- 2120

cardinality of the Extreme SuperHyperVertices in the consecutive Extreme sequence of 2125

(vi) a Neutrosophic V-SuperHyperStrict Connective Dominating if it’s either of Neutrosophic 2128

is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a 2132
(vii) an Extreme V-SuperHyperStrict Connective Dominating SuperHyperPolynomial if 2136

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

(viii) a Neutrosophic SuperHyperStrict Connective Dominating SuperHyperPolynomial 2146

and Neutrosophic rv-SuperHyperStrict Connective Dominating and C(N SHG) for a Neutro- 2149
sophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 2150
contains the Neutrosophic coefficients defined as the Neutrosophic number of the max- 2151
imum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic 2152

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
SuperHyperSet S of high Neutrosophic cardinality consecutive Neutrosophic SuperHy- 2153

perEdges and Neutrosophic SuperHyperVertices such that they form the Neutrosophic 2154
SuperHyperStrict Connective Dominating; and the Neutrosophic power is corresponded to its 2155
Neutrosophic coefficient. 2156
Definition 9.0.20. ((Extreme/Neutrosophic)δ−SuperHyperStrict Connective Dominating). 2157
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Then 2158
(i) an δ−SuperHyperStrict Connective Dominating is a Neutrosophic kind of Neutrosophic 2159
SuperHyperStrict Connective Dominating such that either of the following expressions hold for 2160
the Neutrosophic cardinalities of SuperHyperNeighbors of s ∈ S : 2161
|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 2162

(29.1), holds if S is an δ−SuperHyperDefensive; 2163
(ii) a Neutrosophic δ−SuperHyperStrict Connective Dominating is a Neutrosophic kind 2164

of Neutrosophic SuperHyperStrict Connective Dominating such that either of the following 2165
Neutrosophic expressions hold for the Neutrosophic cardinalities of SuperHyperNeighbors 2166

of s ∈ S : 2167
|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 2168

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

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 = 2178

(V, E). There are some Neutrosophic SuperHyperClasses if the Table (29.2) holds. 2179
Thus Neutrosophic SuperHyperPath , SuperHyperStrict Connective Dominating, SuperHyperStar, 2180
SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, are Neutrosophic 2181
SuperHyperPath, Neutrosophic SuperHyperCycle, Neutrosophic SuperHyperStar, 2182

Neutrosophic SuperHyperBipartite, Neutrosophic SuperHyperMultiPartite, and 2183
Neutrosophic SuperHyperWheel if the Table (29.2) holds. 2184
It’s useful to define a “Neutrosophic” version of a Neutrosophic SuperHyperStrict Connective 2185

Dominating . Since there’s more ways to get type-results to make a Neutrosophic SuperHyperStrict 2186
Connective Dominating more Neutrosophicly understandable. 2187
“redefine” the Neutrosophic notion of “Neutrosophic SuperHyperStrict Connective Dominating”. The 2189
2192
136DEF1 Definition 9.0.23. Assume a SuperHyperStrict Connective Dominating. It’s redefined a Neutrosophic 2193
SuperHyperStrict Connective Dominating if the Table (29.3) holds. 2194

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

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

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

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

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

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

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

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

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

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

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

S = (V, E) is a probability Strict Connective Dominating. Let X be an Extreme Variable and let t be 2292
a positive real number. Then 2293
2
2 Ex((X − Ex(X)) ) V (X)
E(|X − Ex(X)| ≥ t) = E((X − Ex(X)) ≥ t2 ) ≤ 2
= .
t t2
2294
Consider S = (V, E) is a probability Strict Connective Dominating. Let Xn be an Extreme Variable in a 2296
probability Strict Connective Dominating (Vn , En ), n ≥ 1. If Ex(Xn ) 6= 0 and V (Xn ) << E 2 (Xn ), then 2297
E(Xn = 0) → 0 as n → ∞
S = (V, E) is a probability Strict Connective Dominating. Set X := Xn and t := |Ex(Xn )| in 2299
Chebyshev’s Inequality, and observe that E(Xn = 0) ≤ E(|Xn − Ex(Xn )| ≥ |Ex(Xn )|) because 2300
|Xn − Ex(Xn )| = |Ex(Xn )| when Xn = 0. 2301
Consider S = (V, E) is a probability Strict Connective Dominating. Let G ∈ Gn,1/2 . For 0 ≤ k ≤ n, set 2303
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 2304
one. Then almost surely α(G) takes one of the three values k ∗ − 2, k ∗ − 1, k ∗ . 2305
S = (V, E) is a probability Strict Connective Dominating. As in the proof of related Theorem, the 2307
result is straightforward. 2308
Consider S = (V, E) is a probability Strict Connective Dominating. Let G ∈ Gn,1/2 and let f and k ∗ be 2310
as defined in previous Theorem. Then either: 2311
(i). f (k ∗ ) << 1, in which case almost surely α(G) is equal to either k ∗ − 2 or k ∗ − 1, or 2312
(ii). f (k ∗ − 1) >> 1, in which case almost surely α(G) is equal to either k ∗ − 1 or k ∗ . 2313
S = (V, E) is a probability Strict Connective Dominating. The latter is straightforward. 2315
Definition 10.0.17. (Extreme Threshold). 2316
a probability Strict Connective Dominating. Let P be a monotone property of SuperHyperGraphs (one 2318
which is preserved when SuperHyperEdges are added). Then a Extreme Threshold for P is 2319
a function f (n) such that: 2320
(i). if p << f (n), then G ∈ Gn,p almost surely does not have P, 2321
(ii). if p >> f (n), then G ∈ Gn,p almost surely has P. 2322

Definition 10.0.18. (Extreme Balanced). 2323

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

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

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

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

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

{}.
= 0z 0 .
{}.
= 0z 0 .
2356



{}.
= 0z 0 .
{}.
= 0z 0 .
2359

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

= z 7−c .
2362

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

{E15 , E16 , E17 }.

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

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

= z 3−a .
2371

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

{E1 , E2 , E3 }.



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

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


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

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


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

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


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

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


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

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


{V2 , V17 , V7 , V27 }.

= z 2−a .
2398

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


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

{E6 }.
= z 4−a .


{V1 }.
= z 6−a .
2407

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


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

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

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

(V, E). There’s only one Extreme SuperHyperEdge E ∈ EESHG:(V,E) has only the maximum 2420
possibilities of the distinct interior Extreme SuperHyperVertices inside of any given Extreme 2421
quasi-R-Strict Connective Dominating minus all Extreme SuperHypeNeighbor to some of them but not 2422
all of them. In other words, there’s only an unique Extreme SuperHyperEdge E ∈ EESHG:(V,E) 2423
has only two distinct Extreme SuperHyperVertices in an Extreme quasi-R-Strict Connective Dominating, 2424
minus all Extreme SuperHypeNeighbor to some of them but not all of them. 2425
Proposition 10.0.23. Assume a connected Extreme SuperHyperGraph ESHG : (V, E). If an

Extreme SuperHyperEdge E ∈ EESHG:(V,E) has z Extreme SuperHyperVertices, then the Extreme
cardinality of the Extreme R-Strict Connective Dominating is at least
V \ (V \ {aE , bE , cE , . . . , zE }).
It’s straightforward that the Extreme cardinality of the Extreme R-Strict Connective Dominating is at least 2426
the maximum Extreme number of Extreme SuperHyperVertices of the Extreme SuperHyperEdges 2427
with the maximum number of the Extreme SuperHyperEdges. In other words, the maximum 2428

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

Is an Extreme type-result-Strict Connective Dominating. In other words, the least cardinality, the lower 2438
sharp bound for the cardinality, of an Extreme type-result-Strict Connective Dominating is the cardinality 2439
of 2440
= {V1 , E1 , V2 , E2 , V3 , E3 , V4 , E4 , V1 }.
C(N SHG)ExtremeQuasi−StrictConnectiveDominatingSuperHyperP olynomial = z 4 .
C(N SHG)ExtremeQuasi−StrictConnectiveDominating = {V1 , V2 , V3 , V4 , V1 }.
C(N SHG)ExtremeR−Quasi−StrictConnectiveDominatingSuperHyperP olynomial = z 5 .
Proof. Assume a connected loopless Extreme SuperHyperGraph ESHG : (V, E). The
SuperHyperSet of the SuperHyperVertices V \ V \ {z} isn’t a quasi-R-Strict 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-Strict Connective Dominating. In other words, the least cardinality, the lower sharp bound
for the cardinality, of a quasi-R-Strict 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-Strict 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-Strict 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-Strict 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-Strict Connective Dominating has the Extreme cardinality of an Extreme
SuperHyperEdge. Thus, an Extreme R-Strict 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-Strict 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-Strict 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-Strict 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-Strict 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-Strict Connective Dominating. Those Extreme
SuperHyperVertices are potentially included in an Extreme style-R-Strict 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-Strict Connective Dominating is
{aE , bE , cE , . . . , zE } .
This definition coincides with the definition of the Extreme R-Strict 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-Strict 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, 2441
Extreme R-Strict Connective Dominating =

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

2442
Extreme R-Strict Connective Dominating =

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

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

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

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

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

= max zExtreme Number

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


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


2515

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

2516


2517


Now, the extension of these types of approaches is up. Since the new term, “Extreme Super- 2518
HyperNeighborhood”, could be redefined as the collection of the Extreme SuperHyperVertices 2519
such that any amount of its Extreme SuperHyperVertices are incident to an Extreme SuperHy- 2520
perEdge. It’s, literarily, another name for “Extreme Quasi-Strict Connective Dominating” but, precisely, 2521
it’s the generalization of “Extreme Quasi-Strict Connective Dominating” since “Extreme Quasi-Strict 2522
Connective Dominating” happens “Extreme Strict Connective Dominating” in an Extreme SuperHyperGraph 2523
as initial framework and background but “Extreme SuperHyperNeighborhood” may not happens 2524
“Extreme Strict Connective Dominating” in an Extreme SuperHyperGraph as initial framework and 2525
preliminarily background since there are some ambiguities about the Extreme SuperHyperCar- 2526
dinality arise from it. To get orderly keywords, the terms, “Extreme SuperHyperNeighborhood”, 2527
“Extreme Quasi-Strict Connective Dominating”, and “Extreme Strict Connective Dominating” are up. 2528
Thus, let 2529

zExtreme Number , NExtreme SuperHyperNeighborhood and 2530
GExtreme Strict Connective Dominating be an Extreme number, an Extreme SuperHyperNeighborhood 2531
and an Extreme Strict Connective Dominating and the new terms are up. 2532
GExtreme Strict Connective Dominating ∈ ∪zExtreme Number

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


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

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

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

2536

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

2537


2538


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

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

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

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

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

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

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

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

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

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

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

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

Extreme SuperHyperEdge is common and there’s an Extreme SuperHyperEdge for all Extreme 2602
SuperHyperVertices. There are not only two Extreme SuperHyperVertices inside the intended 2603
Extreme SuperHyperSet. Thus the non-obvious Extreme Strict Connective Dominating is up. The 2604
obvious simple Extreme type-SuperHyperSet called the Extreme Strict Connective Dominating is an 2605
Extreme SuperHyperSet includes only two Extreme SuperHyperVertices. But the Extreme 2606
SuperHyperSet of the Extreme SuperHyperEdges[SuperHyperVertices], 2607
b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Doesn’t have less than three SuperHyperVertices inside the intended Extreme SuperHyper- 2608
Set. Thus the non-obvious simple Extreme type-SuperHyperSet of the Extreme Strict Connective 2609
Dominating is up. To sum them up, the Extreme SuperHyperSet of the Extreme SuperHy- 2610
b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .

Is the non-obvious simple Extreme type-SuperHyperSet of the Extreme Strict Connective Dominating. 2612
Since the Extreme SuperHyperSet of the Extreme SuperHyperEdges[SuperHyperVertices], 2613
b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Is an Extreme Strict Connective Dominating C(ESHG) for an Extreme SuperHyperGraph ESHG : 2614
(V, E) is the Extreme SuperHyperSet S of Extreme SuperHyperVertices such that there’s 2615
no an Extreme SuperHyperEdge for some Extreme SuperHyperVertices given by that Ex- 2616
treme type-SuperHyperSet called the Extreme Strict Connective Dominating and it’s an Extreme 2617
Strict Connective Dominating. Since it’s 2618
2619
the maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme Su- 2620
perHyperEdges[SuperHyperVertices] such that there’s no Extreme SuperHyperVertex of an 2621

Extreme SuperHyperEdge is common and there’s an Extreme SuperHyperEdge for all Extreme 2622
SuperHyperVertices. There aren’t only less than three Extreme SuperHyperVertices inside the 2623
intended Extreme SuperHyperSet, 2624
b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Thus the non-obvious Extreme Strict Connective Dominating , 2625
b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .

Is up. The obvious simple Extreme type-SuperHyperSet of the Extreme Strict Connective Dominating , 2626
not: 2627
b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Is the Extreme SuperHyperSet, not: 2628
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 2629
ESHG : (V, E). It’s interesting to mention that the only non-obvious simple Extreme type- 2630
SuperHyperSet called the 2631
“Extreme Strict Connective Dominating ” 2632
amid those obvious[non-obvious] simple Extreme type-SuperHyperSets called the 2633
Extreme ,
Strict Connective Dominating 2634
is only and only 2635
b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
In a connected Extreme SuperHyperGraph ESHG : (V, E). 2636

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

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

in the Example (42.0.5)
Connective Dominating 136NSHG18a
...,
EXT ERN AL
E |EN SHG | , V |EN SHG |
3 3
be a longest path taken from a connected Extreme SuperHyperPath ESHP : (V, E). There’s a 2646
new way to redefine as 2647
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 2648
to ViEXT ERN AL in the literatures of SuperHyperStrict Connective Dominating. The latter is 2649
straightforward. 2650
136EXM18a Example 11.0.2. In the Figure (31.1), the connected Extreme SuperHyperPath ESHP : (V, E), 2651
is highlighted and featured. The Extreme SuperHyperSet, in the Extreme SuperHyperModel 2652
(31.1), is the SuperHyperStrict Connective Dominating. 2653
Proposition 11.0.3. Assume a connected Extreme SuperHyperCycle ESHC : (V, E). Then 2654

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

136EXM19a Example 11.0.4. In the Figure (31.2), the connected Extreme SuperHyperCycle N SHC : 2662
(V, E), is highlighted and featured. The obtained Extreme SuperHyperSet, in the Extreme 2663
SuperHyperModel (31.2), is the Extreme SuperHyperStrict Connective Dominating. 2664

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

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

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

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

SuperHyperStrict 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 2668
way to redefine as 2669

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

|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 2679
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
2680
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 2681
a new way to redefine as 2682

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

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

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

|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 2700
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
j N SHG
2701
P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
...,
EXT ERN AL
j N SHG
is a longest SuperHyperStrict Connective Dominating taken from a connected Extreme SuperHyper- 2702
Multipartite ESHM : (V, E). There’s a new way to redefine as 2703

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

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

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

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

Then, 2721

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

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

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

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

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

SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel) on the same 2762
identical letter of the alphabet. Then its Extreme SuperHyperStrict Connective Dominating is its 2763
Corollary 12.0.8. Assume an Extreme SuperHyperGraph. Then its Extreme SuperHyperStrict 2765
isn’t well-defined if and only if its SuperHyperStrict Connective Dominating isn’t well-
Connective Dominating 2766
defined. 2767
Corollary 12.0.9. Assume SuperHyperClasses of an Extreme SuperHyperGraph. Then its 2768

Extreme SuperHyperStrict Connective Dominating isn’t well-defined if and only if its SuperHyperStrict 2769
Connective Dominating isn’t well-defined. 2770
SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). Then its 2772

Extreme SuperHyperStrict Connective Dominating isn’t well-defined if and only if its SuperHyperStrict 2773
Corollary 12.0.11. Assume an Extreme SuperHyperGraph. Then its Extreme SuperHyperStrict 2775
is well-defined if and only if its SuperHyperStrict Connective Dominating is well-defined.
Corollary 12.0.12. Assume SuperHyperClasses of an Extreme SuperHyperGraph. Then its 2777

Extreme SuperHyperStrict Connective Dominating is well-defined if and only if its SuperHyperStrict 2778
Connective Dominating is well-defined. 2779

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

(v) : the strong δ-SuperHyperDefensive SuperHyperStrict Connective Dominating; 2796
(vi) : the connected δ-SuperHyperDefensive SuperHyperStrict Connective Dominating. 2797
Proposition 12.0.16. Let ESHG : (V, E) be an Extreme SuperHyperGraph. Then an 2798

independent SuperHyperSet is 2799
(iii) : the connected SuperHyperDefensive SuperHyperStrict Connective Dominating; 2802
Proposition 12.0.17. Let ESHG : (V, E) be an Extreme SuperHyperUniform SuperHyperGraph 2806

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

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

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

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


SuperHyperMultipartite. Then a SuperHyperSet contains the half of multiplying r with the 2857
number of all the SuperHyperEdges plus one of all the SuperHyperVertices in the biggest 2858
SuperHyperPart is a 2859
(iv) : δ-SuperHyperDefensive SuperHyperStrict Connective Dominating; 2863
(v) : strong δ-SuperHyperDefensive SuperHyperStrict Connective Dominating; 2864
(vi) : connected δ-SuperHyperDefensive SuperHyperStrict Connective Dominating. 2865

SuperHyperMultipartite. Then Then the number of 2868
O(ESHG)
O(ESHG)
O(ESHG)
is one and it’s only S, a SuperHyperSet contains [the SuperHyperCenter and] the half of 2875
multiplying r with the number of all the SuperHyperEdges plus one of all the SuperHyperVertices. 2876
Proposition 12.0.24. Let ESHG : (V, E) be an Extreme SuperHyperGraph. The number of 2878
connected component is |V − S| if there’s a SuperHyperSet which is a dual 2879
(iv) : SuperHyperStrict Connective Dominating; 2883
(v) : strong 1-SuperHyperDefensive SuperHyperStrict Connective Dominating; 2884
(vi) : connected 1-SuperHyperDefensive SuperHyperStrict Connective Dominating. 2885

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

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

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

2 + 1)-SuperHyperDefensive SuperHyperStrict Connective Dominating. 2896
Proposition 12.0.27. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is ∅. The 2897
number is 0 and the Extreme number is 0, for an independent SuperHyperSet in the setting of 2898
dual 2899
(iv) : 0-SuperHyperDefensive SuperHyperStrict Connective Dominating; 2903
Proposition 12.0.28. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is SuperHy- 2906
perComplete. Then there’s no independent SuperHyperSet. 2907
Proposition 12.0.29. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is SuperHy- 2908
perStrict Connective Dominating/SuperHyperPath/SuperHyperWheel. The number is O(ESHG : (V, E)) 2909
and the Extreme number is On (ESHG : (V, E)), in the setting of a dual 2910
(iv) : O(ESHG : (V, E))-SuperHyperDefensive SuperHyperStrict Connective Dominating; 2914
(v) : strong O(ESHG : (V, E))-SuperHyperDefensive SuperHyperStrict Connective Dominating; 2915
(vi) : connected O(ESHG : (V, E))-SuperHyperDefensive SuperHyperStrict Connective Dominating. 2916

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


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

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

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

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

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

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

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

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

b n c+1
(i) the SuperHyperSet S = {vi }i=1 2
is a dual maximal SuperHyperDefensive SuperHyperStrict 3010
(ii) Γ = b n2 c + 1 for N SHF : (V, E); 3012

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

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

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

SuperHyperStrict Connective Dominating, then S is an s-SuperHyperDefensive SuperHyperStrict 3027
(ii) if s ≤ t and a SuperHyperSet S of SuperHyperVertices is a dual t-SuperHyperDefensive 3029

SuperHyperStrict Connective Dominating, then S is a dual s-SuperHyperDefensive SuperHyperStrict 3030
(i) if s ≥ t + 2 and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 3034
SuperHyperStrict Connective Dominating, then S is an s-SuperHyperPowerful SuperHyperStrict 3035


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

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

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

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

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

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

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

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

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


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

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


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

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

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


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

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

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


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

SuperHyperStrict Connective Dominating 136NSHGaa21aa
143
Belong to The Extreme SuperHyperBipartite

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

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

CHAPTER 15 3137
Case 2: The Increasing Extreme Steps 3138
Toward Extreme 3139
SuperHyperMultipartite as Extreme 3140
SuperHyperModel 3141
Step 4. (Extreme Solution) In the Extreme Figure (35.1), the Extreme SuperHyperMultipart- 3142
ite is Extreme highlighted and Extreme featured. 3143
By using the Extreme Figure (35.1) and the Table (35.1), the Extreme SuperHyperMulti- 3144
partite is obtained. 3145
The obtained Extreme SuperHyperSet, by the Extreme Algorithm in previous result, 3146
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 3147

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

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

CHAPTER 18 3198
Extreme SuperHyperDuality But As The 3199
Super Forms 3201
Definition 18.0.1. (Different Extreme Types of Extreme SuperHyperDuality). 3202

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

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

SuperHyperDuality. 3215
Definition 18.0.2. ((Extreme) SuperHyperDuality). 3216

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

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

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

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

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

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

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

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

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


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

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


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

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

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



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

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

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

is a longest SuperHyperDuality taken from a connected Extreme SuperHyperMultipartite 3390

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

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

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

∃!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 3415
SuperHyperDuality proposes some longest SuperHyperDuality excerpt from some representatives. 3416
Extreme SuperHyperDuality. 3422

CHAPTER 19 3423
Extreme SuperHyperJoin But As The 3424
Super Forms 3426
Definition 19.0.1. (Different Extreme Types of Extreme SuperHyperJoin). 3427

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

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

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

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

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

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

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

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

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

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


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

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

Extreme number of the maximum Extreme cardinality of the Extreme SuperHyperVertices 3489

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

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

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

is up. The Extreme Algorithm is Extremely straightforward. 3519


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

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

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


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

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



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

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

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


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

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

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

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

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

CHAPTER 20 3640
Extreme SuperHyperPerfect But As The 3641
Super Forms 3643
Definition 20.0.1. (Different Extreme Types of Extreme SuperHyperPerfect). 3644

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

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

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

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

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

re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, and Extreme rv-SuperHyperPerfect. 3656
Definition 20.0.2. ((Extreme) SuperHyperPerfect). 3657

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

Extreme re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, and Extreme rv- 3661
SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3662
Extreme SuperHyperPerfect; 3666
179
(ii) a Extreme SuperHyperPerfect if it’s either of Extreme e-SuperHyperPerfect, Extreme 3667

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

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

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

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

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

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

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


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

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


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

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

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

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

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



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

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

Then 3829

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



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

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

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


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

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

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

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

re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Extreme rv-SuperHyperTotal. 3878
Definition 21.0.2. ((Extreme) SuperHyperTotal). 3879

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

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

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

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

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

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

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

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

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

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

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



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

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

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

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

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

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

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



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

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



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

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

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

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

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

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

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

Extreme re-SuperHyperConnected, Extreme v-SuperHyperConnected, and Extreme rv- 4097
SuperHyperConnected. 4098
Definition 22.0.2. ((Extreme) SuperHyperConnected). 4099
(i) an Extreme SuperHyperConnected if it’s either of Extreme e-SuperHyperConnected, 4102

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

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

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


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

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

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

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

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

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

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

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

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


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

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

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 4224
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. 4228
(31.1), is the SuperHyperConnected. 4231
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 4233
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. 4240
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 4242



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

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

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

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

is a longest SuperHyperConnected taken from a connected Extreme SuperHyperBipartite 4261

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


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

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

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


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

CHAPTER 23 4306
Background 4307
221










“Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic) SuperHyperMod- 4432

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

Henry Garrett (2022), “Basic Neutrosophic Notions Concerning SuperHyperDominating and 4434
Neutrosophic SuperHyperResolving in SuperHyperGraph” in Ref. [HG37] by Henry Garrett 4435
(2022), “Initial Material of Neutrosophic Preliminaries to Study Some Neutrosophic Notions 4436
Based on Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic SuperHyperGraph (NSHG)” 4437
in Ref. [HG38] by Henry Garrett (2022), and [HG44s; HG55s; HG4; HG5; HG6; HG7; 4438
HG281; HG282; HG283; HG284; HG285], there are some endeavors to formalize the basic 4459
SuperHyperNotions about neutrosophic SuperHyperGraph and SuperHyperGraph alongside 4460
scientific research books at [HG60b; HG61b; HG62b; HG63b; HG64b; HG65b; HG66b; 4461


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

HG278; HG279; HG280; HG281; HG282; HG283; HG284; HG285] alongside scientific 4514
research books at [HG60b; HG61b; HG62b; HG63b; HG64b; HG65b; HG66b; HG67b; 4515



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

Bibliography 4532
10.33140/JMTCM.01.03.09) 4555
227



10.20944/preprints202301.0282.v1). 4571

10.20944/preprints202301.0267.v1). 4574

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

prints202301.0105.v1). 4592

Preprints 2023, 2023010044 4598
10.20944/preprints202301.0043.v1). 4601

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

(doi: 10.20944/preprints202212.0500.v1). 4617
(doi: 10.5281/zenodo.8072171). 4626

2023, (doi: 10.5281/zenodo.8072267). 4629
10.5281/zenodo.8067384). 4632
2023, (doi: 10.5281/zenodo.8067409). 4635
10.5281/zenodo.8061927). 4638

10.5281/zenodo.8062016). 4641
10.5281/zenodo.8057696). 4644
2023, (doi: 10.5281/zenodo.8057753). 4647
10.5281/zenodo.8052893). 4650
2023, (doi: 10.5281/zenodo.8052925). 4653
10.5281/zenodo.8051346). 4656
10.5281/zenodo.8051360). 4659
10.5281/zenodo.8025707). 4662
10.5281/zenodo.8027275). 4665
odo.8017246). 4668
10.5281/zenodo.8020128). 4671
odo.7978571). 4674
10.5281/zenodo.7978857). 4677

10.5281/zenodo.7940830). 4680
10.5281/zenodo.7943578). 4683
odo.7916595). 4686
odo.7923632). 4689
(doi: 10.5281/zenodo.7904698). 4692
2023, (doi: 10.5281/zenodo.7904671). 4695
10.5281/zenodo.7871026). 4704
2023, (doi: 10.5281/zenodo.7874647). 4707
10.5281/zenodo.7857856). 4710
2023, (doi: 10.5281/zenodo.7857841). 4713

10.5281/zenodo.7853867). 4722
10.5281/zenodo.7853922). 4725
(doi: 10.5281/zenodo.7851519). 4728
(doi: 10.5281/zenodo.7851550). 4731
10.5281/zenodo.7834229). 4740
10.5281/zenodo.7834261). 4743
10.5281/zenodo.7824560). 4746
(doi: 10.5281/zenodo.7824623). 4749

2023, (doi: 10.5281/zenodo.7809365). 4760
2023, (doi: 10.5281/zenodo.7809358). 4763

10.5281/zenodo.7809219). 4766
10.5281/zenodo.7809328). 4769
2023, (doi: 10.5281/zenodo.7806767). 4772

2023, (doi: 10.5281/zenodo.7806838). 4775
10.5281/zenodo.7799902). 4784
(doi: 10.5281/zenodo.7804218). 4787
(doi: 10.5281/zenodo.7796334). 4790

10.5281/zenodo.7791952). 4796
10.5281/zenodo.7791982). 4799
10.5281/zenodo.7790026). 4802
10.5281/zenodo.7790052). 4805
2023, (doi: 10.5281/zenodo.7787066). 4808
10.5281/zenodo.7781476). 4814
10.5281/zenodo.7783082). 4817
10.5281/zenodo.7777857). 4820
10.5281/zenodo.7779286). 4823
(doi: 10.5281/zenodo.7771831). 4826
2023, (doi: 10.5281/zenodo.7772468). 4829
10.13140/RG.2.2.20913.25446). 4832

odo.7764916). 4835
10.13140/RG.2.2.11770.98247). 4838
10.13140/RG.2.2.12400.12808). 4841
2023, (doi: 10.13140/RG.2.2.22545.10089). 4844
10.13140/RG.2.2.11377.76644). 4850
10.13140/RG.2.2.23750.96329). 4853
10.13140/RG.2.2.31366.24641). 4856
10.13140/RG.2.2.34721.68960). 4859
2023, (doi: 10.13140/RG.2.2.30212.81289). 4862
10.13140/RG.2.2.24288.35842). 4868
10.13140/RG.2.2.32467.25124). 4871

10.13140/RG.2.2.31025.45925). 4874
10.13140/RG.2.2.17184.25602). 4877
10.13140/RG.2.2.23423.28327). 4880
10.13140/RG.2.2.28456.44805). 4883
10.13140/RG.2.2.23525.68320). 4886
10.13140/RG.2.2.20170.24000). 4889
10.13140/RG.2.2.36475.59683). 4892
10.13140/RG.2.2.29764.71046). 4895
2023, (doi: 10.13140/RG.2.2.18780.87683). 4898
10.13140/RG.2.2.26134.01603). 4904
10.13140/RG.2.2.27392.30721). 4907
10.13140/RG.2.2.33028.40321). 4910

10.13140/RG.2.2.21389.20966). 4913
10.13140/RG.2.2.16356.04489). 4916
10.13140/RG.2.2.21756.21129). 4919
10.13140/RG.2.2.30983.68009). 4922
10.13140/RG.2.2.28552.29445). 4925
(doi: 10.13140/RG.2.2.10936.21761). 4928
10.13140/RG.2.2.35105.89447). 4931
(doi: 10.13140/RG.2.2.30072.72960). 4934
10.13140/RG.2.2.31147.52003). 4937
10.13140/RG.2.2.32825.24163). 4940
10.13140/RG.2.2.13059.58401). 4943
10.13140/RG.2.2.11172.14720). 4946
2023, (doi: 10.13140/RG.2.2.22011.80165). 4949

ate 2023, (doi: 10.13140/RG.2.2.30819.84003). 4952
2023, (doi: 10.13140/RG.2.2.10493.84962). 4955
ate 2023, (doi: 10.13140/RG.2.2.13849.29280). 4958
2023, (doi: 10.13140/RG.2.2.19944.14086). 4961
ate 2023, (doi: 10.13140/RG.2.2.23299.58404). 4964
(doi: 10.13140/RG.2.2.33103.76968). 4967
(doi: 10.13140/RG.2.2.23037.44003). 4970
(doi: 10.13140/RG.2.2.35646.56641). 4973
10.13140/RG.2.2.18030.48967). 4976
(doi: 10.13140/RG.2.2.13973.81121). 4979
2023, (doi: 10.13140/RG.2.2.34106.47047). 4982
2023, (doi: 10.13140/RG.2.2.31956.88961). 4988

2023, (doi: 10.13140/RG.2.2.15179.67361). 4991
10.13140/RG.2.2.21510.45125). 4994
2023, (doi: 10.13140/RG.2.2.13121.84321). 4997
10.13140/RG.2.2.11758.69441). 5000
2023, (doi: 10.13140/RG.2.2.31891.35367). 5003
10.13140/RG.2.2.19360.87048). 5006
10.13140/RG.2.2.32363.21286). 5009
10.13140/RG.2.2.23266.81602). 5012
10.13140/RG.2.2.19911.37285). 5015
10.13140/RG.2.2.11050.90569). 5018
2023, (doi: 10.13140/RG.2.2.17761.79206). 5021
ate 2023, (doi: 10.13140/RG.2.2.33275.80161). 5027

(doi: 10.13140/RG.2.2.30182.50241). 5030
2023, (doi: 10.13140/RG.2.2.17252.24968). 5063


2023010396 (doi: 10.20944/preprints202301.0396.v1). 5072

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




2023,(doi: 10.13140/RG.2.2.36745.93289). 5089
10.20944/preprints202301.0282.v1). 5096
10.20944/preprints202301.0267.v1).). 5099
(doi: 10.20944/preprints202301.0265.v1). 5104

prints202301.0262.v1). 5108

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

10.13140/RG.2.2.35061.65767). 5117

10.13140/RG.2.2.18494.15680). 5121
10.13140/RG.2.2.32530.73922). 5125

10.13140/RG.2.2.15897.70243). 5129
10.13140/RG.2.2.32530.73922). 5133

prints202301.0105.v1). 5136
10.13140/RG.2.2.23172.19849). 5143

10.13140/RG.2.2.17385.36968). 5153
Preprints 2023, 2023010044 5156
10.20944/preprints202301.0043.v1). 5159
2023, (doi: 10.13140/RG.2.2.28945.92007). 5162
10.13140/RG.2.2.35774.77123). 5168

10.13140/RG.2.2.29430.88642). 5174
(doi: 10.20944/preprints202212.0549.v1). 5180

10.13140/RG.2.2.19380.94084). 5183
(doi: 10.20944/preprints202212.0500.v1). 5194
10.13140/RG.2.2.20993.12640). 5197


10.13140/RG.2.2.29173.86244). 5212

2023 (doi: 10.5281/zenodo.8067469). 5219

(doi: 10.5281/zenodo.8062076). 5221
2023 (doi: 10.5281/zenodo.8052976). 5225
(doi: 10.5281/zenodo.8051368). 5227
(doi: 10.5281/zenodo.8027488). 5229
10.5281/zenodo.8020181). 5231
10.5281/zenodo.7978921). 5233
odo.7943878). 5235
10.5281/zenodo.7943871). 5237
10.5281/zenodo.7923786). 5239
2023 (doi: 10.5281/zenodo.7905287). 5241
2023 (doi: 10.5281/zenodo.7874677). 5245
(doi: 10.5281/zenodo.7857906). 5247
2023 (doi: 10.5281/zenodo.7856329). 5249
10.5281/zenodo.7854561). 5251
2023 (doi: 10.5281/zenodo.7851893). 5253

(doi: 10.5281/zenodo.7835063). 5257
(doi: 10.5281/zenodo.7826705). 5259
2023 (doi: 10.5281/zenodo.7820680). 5261
10.5281/zenodo.7812750). 5263


2023 (doi: 10.5281/zenodo.7807782). 5269
2023 (doi: 10.5281/zenodo.7804449). 5271
(doi: 10.5281/zenodo.7792307). 5275
(doi: 10.5281/zenodo.7790728). 5277
2023 (doi: 10.5281/zenodo.7787712). 5279
10.5281/zenodo.7783791). 5281
10.5281/zenodo.7780123). 5283
(doi: 10.5281/zenodo.7773119). 5285
odo.7637762). 5287
10.5281/zenodo.7766174). 5289
10.5281/zenodo.7762232). 5291

(doi: 10.5281/zenodo.7758601). 5293
10.5281/zenodo.7754661). 5295
10.5281/zenodo.7750995) . 5297
(doi: 10.5281/zenodo.7749875). 5299
10.5281/zenodo.7747236). 5301
10.5281/zenodo.7742587). 5303
(doi: 10.5281/zenodo.7738635). 5305
10.5281/zenodo.7734719). 5307
10.5281/zenodo.7730484). 5309
(doi: 10.5281/zenodo.7730469). 5311
10.5281/zenodo.7722865). 5313
odo.7713563). 5315
odo.7709116). 5317
10.5281/zenodo.7706415). 5319
10.5281/zenodo.7706063). 5321
10.5281/zenodo.7701906). 5323
odo.7700205). 5325
10.5281/zenodo.7694876). 5327

10.5281/zenodo.7679410). 5329
10.5281/zenodo.7675982). 5331
10.5281/zenodo.7672388). 5333
odo.7668648). 5335
10.5281/zenodo.7662810). 5337
10.5281/zenodo.7659162). 5339
odo.7653233). 5341
odo.7653204). 5343
odo.7653142). 5345
odo.7653117). 5347
odo.7651687). 5350
odo.7651619). 5352
odo.7651439). 5354
odo.7650729). 5356
odo.7647868). 5358
odo.7647017). 5360
odo.7644894). 5362

odo.7632923). 5365
odo.7623459). 5367
10.5281/zenodo.7606416). 5369
10.5281/zenodo.7606416). 5371
odo.7606404). 5373
10.5281/zenodo.7580018). 5375
odo.7580018). 5377
odo.7580018). 5379
odo.7579929). 5381
10.5281/zenodo.7563170). 5383
odo.7563164). 5385
odo.7563160). 5387
odo.7563160). 5389
10.5281/zenodo.7563160). 5391
10.5281/zenodo.7557063). 5393
10.5281/zenodo.7557009). 5395
10.5281/zenodo.7539484). 5397

10.5281/zenodo.7523390). 5399
10.5281/zenodo.7523390). 5401
10.5281/zenodo.7523390). 5403
odo.7574952). 5405
10.5281/zenodo.7574992). 5407
odo.7523357). 5409
10.5281/zenodo.7523357). 5411
10.5281/zenodo.7504782). 5413
10.5281/zenodo.7504782). 5415
10.5281/zenodo.7504782). 5417
10.5281/zenodo.7499395). 5419
odo.7499395). 5421
10.5281/zenodo.7499395). 5423
10.5281/zenodo.7497450). 5425
10.5281/zenodo.7497450). 5427
10.5281/zenodo.7494862). 5429
odo.7494862). 5431
10.5281/zenodo.7494862). 5433

10.5281/zenodo.7493845). 5435
odo.7493845). 5437
10.5281/zenodo.7493845). 5439
odo.7539484). 5441
odo.7523390). 5443
odo.7523357). 5445
odo.7504782). 5447
odo.7499395). 5449
odo.7497450). 5451
odo.7494862). 5453
odo.7493845). 5455
odo.7480110). 5457
odo.7378758). 5459
odo.6320305). 5461
odo.6677173). 5463

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

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

SuperHyperK-Domination” on “SuperHyperGraph” and “Neutrosophic SuperHyperGraph”. 5544
Then the research has taken more motivations to define SuperHyperClasses and to find some 5545
connections amid this SuperHyperNotion with other SuperHyperNotions. It motivates us to get 5546
some instances and examples to make clarifications about the framework of this research. The 5547
general results and some results about some connections are some avenues to make key point of 5548
this research, “Cancer’s Recognition”, more understandable and more clear. 5549
Some SuperHyperClasses and some Neutrosophic SuperHyperClasses are the cases of this 5550
research on the modeling of the regions where are under the attacks of the cancer to 5551
recognize this disease as it’s mentioned on the title “Cancer’s Recognitions”. To formalize 5552
the instances on the SuperHyperNotion, SuperHyperK-Domination, the new SuperHyperClasses 5553
and SuperHyperClasses, are introduced. Some general results are gathered in the section on the 5554
SuperHyperK-Domination and the Neutrosophic SuperHyperK-Domination. The clarifications, 5555

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

CHAPTER 25 5566
Neutrosophic Strict Connective 5567
Dominating 5568
Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of SuperHyperDu- 5569
ality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, ResearchGate 5570
2023, (doi: 10.13140/RG.2.2.34953.52320). 5571
Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph By 5572
SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchGate 2023, 5573
(doi: 10.13140/RG.2.2.33275.80161). 5574
10.13140/RG.2.2.11050.90569). 5577
Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of SuperHyperJoin 5578
10.13140/RG.2.2.17761.79206). 5580
10.13140/RG.2.2.19911.37285). 5583
Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect 5584
10.13140/RG.2.2.23266.81602). 5586
10.13140/RG.2.2.19360.87048). 5589
Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal 5590
10.13140/RG.2.2.32363.21286). 5592
10.13140/RG.2.2.11758.69441). 5595
Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of SuperHyperConnected 5596
10.13140/RG.2.2.31891.35367). 5598
257

10.13140/RG.2.2.21510.45125). 5601
Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDominating 5602
10.13140/RG.2.2.13121.84321). 5604

CHAPTER 26 5605
New Ideas In Recognition of Cancer And 5606
Neutrosophic SuperHyperGraph By Strict 5607
Connective Dominating As Hyper Conceit 5608
On Super Con 5609
259
CHAPTER 27 5610
ABSTRACT 5611
In this scientific research, (Different Neutrosophic Types of Neutrosophic SuperHyperStrict 5612

Connective Dominating). Assume a Neutrosophic SuperHyperGraph (NSHG) S is a Strict Connective 5613
0
Dominating pair S = (V, E). Consider a Neutrosophic SuperHyperSet V = {V1 , V2 , . . . , Vs } and 5614
0 0 0
E = {E1 , E2 , . . . , Ez }. Then either V or E is called Neutrosophic e-SuperHyperStrict Connective 5615
Dominating if the following expression is called Neutrosophic e-SuperHyperStrict Connective Dominating 5616
criteria holds 5617

Neutrosophic re-SuperHyperStrict Connective Dominating if the following expression is called 5618
Neutrosophic e-SuperHyperStrict Connective Dominating criteria holds 5619

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

SuperHyperStrict Connective Dominating if the following expression is called Neutrosophic v- 5621
SuperHyperStrict Connective Dominating criteria holds 5622

261
Neutrosophic rv-SuperHyperStrict Connective Dominating if the following expression is called 5623

Neutrosophic v-SuperHyperStrict Connective Dominating criteria holds 5624

and |Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; Neutrosophic Super- 5625
HyperStrict Connective Dominating if it’s either of Neutrosophic e-SuperHyperStrict Connective Dominating, 5626
Dominating, and Neutrosophic rv-SuperHyperStrict Connective Dominating. ((Neutrosophic) SuperHy- 5628
perStrict Connective Dominating). Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair 5629
S = (V, E). Consider a Neutrosophic SuperHyperEdge (NSHE) E = {V1 , V2 , . . . , Vs }. Then 5630
E is called an Extreme SuperHyperStrict Connective Dominating if it’s either of Neutrosophic e- 5631

SuperHyperStrict Connective Dominating, Neutrosophic re-SuperHyperStrict Connective Dominating, Neut- 5632
Dominating and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum 5634
Extreme cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of the Ex- 5635
treme SuperHyperEdges in the consecutive Extreme sequence of Extreme SuperHyperEdges 5636
and Extreme SuperHyperVertices such that they form the Extreme SuperHyperStrict Connect- 5637
ive Dominating; a Neutrosophic SuperHyperStrict Connective Dominating if it’s either of Neutrosophic 5638
Dominating and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum 5641
Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet 5642
S of high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and Neutrosophic 5643

SuperHyperVertices such that they form the Neutrosophic SuperHyperStrict Connective Dominating; an 5644
Extreme SuperHyperStrict Connective Dominating SuperHyperPolynomial if it’s either of Neutrosophic 5645
Dominating and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme 5648
maximum Extreme cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet 5650
S of high Extreme cardinality consecutive Extreme SuperHyperEdges and Extreme Super- 5651
HyperVertices such that they form the Extreme SuperHyperStrict Connective Dominating; and the 5652
Extreme power is corresponded to its Extreme coefficient; a Neutrosophic SuperHyperStrict Con- 5653
nective Dominating SuperHyperPolynomial if it’s either of Neutrosophic e-SuperHyperStrict Connective 5654

Connective Dominating, and Neutrosophic rv-SuperHyperStrict Connective Dominating and C(N SHG) for a 5656
Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 5657
contains the Neutrosophic coefficients defined as the Neutrosophic number of the maximum Neut- 5658
rosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S 5659
of high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and Neutrosophic 5660
SuperHyperVertices such that they form the Neutrosophic SuperHyperStrict Connective Dominat- 5661

ing; and the Neutrosophic power is corresponded to its Neutrosophic coefficient; an Extreme 5662
an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme cardinality of an 5666
Extreme SuperHyperSet S of high Extreme cardinality of the Extreme SuperHyperVertices 5667
in the consecutive Extreme sequence of Extreme SuperHyperEdges and Extreme SuperHyper- 5668
Vertices such that they form the Extreme SuperHyperStrict Connective Dominating; a Neutrosophic 5669
a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic cardin- 5673
ality of the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S of high 5674

Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and Neutrosophic Supe- 5675
rHyperVertices such that they form the Neutrosophic SuperHyperStrict Connective Dominating; an 5676
Extreme V-SuperHyperStrict Connective Dominating SuperHyperPolynomial if it’s either of Neutro- 5677
sophic e-SuperHyperStrict Connective Dominating, Neutrosophic re-SuperHyperStrict Connective Dominating, 5678
Neutrosophic v-SuperHyperStrict Connective Dominating, and Neutrosophic rv-SuperHyperStrict Connect- 5679
ive Dominating and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme 5680
maximum Extreme cardinality of the Extreme SuperHyperVertices of an Extreme SuperHyperSet 5682
S of high Extreme cardinality consecutive Extreme SuperHyperEdges and Extreme SuperHyper- 5683
Vertices such that they form the Extreme SuperHyperStrict Connective Dominating; and the Extreme 5684
power is corresponded to its Extreme coefficient; a Neutrosophic SuperHyperStrict Connective Domin- 5685
ating SuperHyperPolynomial if it’s either of Neutrosophic e-SuperHyperStrict Connective Dominating, 5686

Dominating, and Neutrosophic rv-SuperHyperStrict Connective Dominating and C(N SHG) for a Neutro- 5688
sophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains 5689
the Neutrosophic coefficients defined as the Neutrosophic number of the maximum Neutrosophic 5690
cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S of high 5691
Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and Neutrosophic Super- 5692

HyperVertices such that they form the Neutrosophic SuperHyperStrict Connective Dominating; and the 5693
Neutrosophic power is corresponded to its Neutrosophic coefficient. In this scientific research, 5694
new setting is introduced for new SuperHyperNotions, namely, a SuperHyperStrict Connective 5695
Dominating and Neutrosophic SuperHyperStrict Connective Dominating. Two different types of Super- 5696
HyperDefinitions are debut for them but the research goes further and the SuperHyperNotion, 5697
SuperHyperUniform, and SuperHyperClass based on that are well-defined and well-reviewed. 5698
The literature review is implemented in the whole of this research. For shining the elegancy and 5699
the significancy of this research, the comparison between this SuperHyperNotion with other 5700
SuperHyperNotions and fundamental SuperHyperNumbers are featured. The definitions are 5701
followed by the examples and the instances thus the clarifications are driven with different tools. 5702
The applications are figured out to make sense about the theoretical aspect of this ongoing 5703
research. The “Cancer’s Recognition” are the under research to figure out the challenges make 5704

perGraph” and “Neutrosophic SuperHyperGraph” are chosen and elected to research about 5709
“Cancer’s Recognition”. Thus these complex and dense SuperHyperModels open up some avenues 5710
to research on theoretical segments and “Cancer’s Recognition”. Some avenues are posed to 5711
pursue this research. It’s also officially collected in the form of some questions and some problems. 5712
Assume a SuperHyperGraph. Assume a SuperHyperGraph. Then δ−SuperHyperStrict Connective 5713
Dominating is a maximal of SuperHyperVertices with a maximum cardinality such that either of 5714
the following expressions hold for the (Neutrosophic) cardinalities of SuperHyperNeighbors of 5715
first Expression, holds if S is an δ−SuperHyperOffensive. And the second Expression, holds 5717
if S is an δ−SuperHyperDefensive; a Neutrosophic δ−SuperHyperStrict Connective Dominating is a 5718
maximal Neutrosophic of SuperHyperVertices with maximum Neutrosophic cardinality such 5719
that either of the following expressions hold for the Neutrosophic cardinalities of SuperHy- 5720
perNeighbors of s ∈ S there are: |S ∩ N (s)|N eutrosophic > |S ∩ (V \ N (s))|N eutrosophic + δ; 5721
and |S ∩ N (s)|N eutrosophic < |S ∩ (V \ N (s))|N eutrosophic + δ. The first Expression, holds 5722
if S is a Neutrosophic δ−SuperHyperOffensive. And the second Expression, holds if S is a 5723
Neutrosophic δ−SuperHyperDefensive It’s useful to define a “Neutrosophic” version of a 5724
SuperHyperStrict Connective Dominating . Since there’s more ways to get type-results to make a 5725
SuperHyperStrict Connective Dominating more understandable. For the sake of having Neutrosophic 5726
SuperHyperStrict Connective Dominating, there’s a need to “redefine” the notion of a “SuperHyperStrict 5727
Connective Dominating ”. The SuperHyperVertices and the SuperHyperEdges are assigned by the 5728
labels from the letters of the alphabets. In this procedure, there’s the usage of the position 5729
of labels to assign to the values. Assume a SuperHyperStrict Connective Dominating . It’s redefined 5730
a Neutrosophic SuperHyperStrict Connective Dominating if the mentioned Table holds, concerning, 5731
“The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges Belong to 5732
The Neutrosophic SuperHyperGraph” with the key points, “The Values of The Vertices & 5733
The Number of Position in Alphabet”, “The Values of The SuperVertices&The maximum 5734
SuperHyperStrict Connective Dominating . It’s the main. It’ll be disciplinary to have the foundation of 5739
previous definition in the kind of SuperHyperClass. If there’s a need to have all SuperHyperStrict 5740
Connective Dominating until the SuperHyperStrict Connective Dominating, then it’s officially called a “Super- 5741
HyperStrict Connective Dominating” but otherwise, it isn’t a SuperHyperStrict Connective Dominating . There 5742
are some instances about the clarifications for the main definition titled a “SuperHyperStrict 5743
Connective Dominating ”. These two examples get more scrutiny and discernment since there are 5744
characterized in the disciplinary ways of the SuperHyperClass based on a SuperHyperStrict 5745
Connective Dominating . For the sake of having a Neutrosophic SuperHyperStrict Connective Dominating, 5746
there’s a need to “redefine” the notion of a “Neutrosophic SuperHyperStrict Connective Dominating” 5747
and a “Neutrosophic SuperHyperStrict Connective Dominating ”. The SuperHyperVertices and the 5748
And a SuperHyperStrict Connective Dominating are redefined to a “Neutrosophic SuperHyperStrict 5752
Connective Dominating” if the intended Table holds. It’s useful to define “Neutrosophic” version 5753

of SuperHyperClasses. Since there’s more ways to get Neutrosophic type-results to make a 5754
Neutrosophic SuperHyperStrict Connective Dominating more understandable. Assume a Neutrosophic 5755
SuperHyperGraph. There are some Neutrosophic SuperHyperClasses if the intended Table holds. 5756
Thus SuperHyperPath, SuperHyperStrict Connective Dominating, SuperHyperStar, SuperHyperBi- 5757
partite, SuperHyperMultiPartite, and SuperHyperWheel, are “Neutrosophic SuperHyperPath”, 5758
“Neutrosophic SuperHyperStrict Connective Dominating”, “Neutrosophic SuperHyperStar”, “Neutro- 5759

SuperHyperWheel” if the intended Table holds. A SuperHyperGraph has a “Neutrosophic 5761
SuperHyperStrict Connective Dominating” where it’s the strongest [the maximum Neutrosophic value 5762
from all the SuperHyperStrict Connective Dominating amid the maximum value amid all SuperHy- 5763
perVertices from a SuperHyperStrict Connective Dominating .] SuperHyperStrict Connective Dominating . 5764
A graph is a SuperHyperUniform if it’s a SuperHyperGraph and the number of elements of 5765
SuperHyperEdges are the same. Assume a Neutrosophic SuperHyperGraph. There are some 5766
SuperHyperClasses as follows. It’s SuperHyperPath if it’s only one SuperVertex as intersection 5767
amid two given SuperHyperEdges with two exceptions; it’s SuperHyperStrict Connective Dominating if 5768
it’s only one SuperVertex as intersection amid two given SuperHyperEdges; it’s SuperHyperStar 5769
it’s only one SuperVertex as intersection amid all SuperHyperEdges; it’s SuperHyperBipartite it’s 5770

cancer on the complex tracks and between complicated groups of cells could be fantasized by a 5793
Neutrosophic SuperHyperPath(-/SuperHyperStrict Connective Dominating, SuperHyperStar, Super- 5794
HyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find either the 5795

longest SuperHyperStrict Connective Dominating or the strongest SuperHyperStrict Connective Dominating 5796
in those Neutrosophic SuperHyperModels. For the longest SuperHyperStrict Connective Dominating, 5797
called SuperHyperStrict Connective Dominating, and the strongest SuperHyperStrict Connective Dominating, 5798
called Neutrosophic SuperHyperStrict Connective Dominating, some general results are introduced. 5799

Beyond that in SuperHyperStar, all possible SuperHyperPaths have only two SuperHyperEdges 5800
but it’s not enough since it’s essential to have at least three SuperHyperEdges to form any style 5801
of a SuperHyperStrict Connective Dominating. There isn’t any formation of any SuperHyperStrict Con- 5802
nective Dominating but literarily, it’s the deformation of any SuperHyperStrict Connective Dominating. It, 5803
literarily, deforms and it doesn’t form. A basic familiarity with Neutrosophic SuperHyperStrict 5804
Connective Dominating theory, SuperHyperGraphs, and Neutrosophic SuperHyperGraphs theory are 5805
proposed. 5806
Keywords: Neutrosophic SuperHyperGraph, SuperHyperStrict Connective Dominating, Cancer’s 5807
Neutrosophic Recognition 5808


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

SuperHyperGraph”. Then the research has taken more motivations to define SuperHyperClasses 5870
and to find some connections amid this SuperHyperNotion with other SuperHyperNotions. It 5871
motivates us to get some instances and examples to make clarifications about the framework of 5872
this research. The general results and some results about some connections are some avenues to 5873
make key point of this research, “Cancer’s Recognition”, more understandable and more clear. 5874
The framework of this research is as follows. In the beginning, I introduce basic definitions 5875
to clarify about preliminaries. In the subsection “Preliminaries”, initial definitions about 5876
SuperHyperGraphs and Neutrosophic SuperHyperGraph are deeply-introduced and in-depth- 5877
discussed. The elementary concepts are clarified and illustrated completely and sometimes 5878
review literature are applied to make sense about what’s going to figure out about the upcoming 5879
sections. The main definitions and their clarifications alongside some results about new notions, 5880
SuperHyperStrict Connective Dominating and Neutrosophic SuperHyperStrict Connective Dominating, are 5881
figured out in sections “ SuperHyperStrict Connective Dominating” and “Neutrosophic SuperHyperStrict 5882
Connective Dominating”. In the sense of tackling on getting results and in Strict Connective Dominating to 5883
make sense about continuing the research, the ideas of SuperHyperUniform and Neutrosophic 5884
SuperHyperUniform are introduced and as their consequences, corresponded SuperHyperClasses 5885
are figured out to debut what’s done in this section, titled “Results on SuperHyperClasses” 5886
and “Results on Neutrosophic SuperHyperClasses”. As going back to origin of the notions, 5887

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

CHAPTER 29 5908
Neutrosophic Preliminaries Of This 5909
Scientific Research On the Redeemed 5910
Ways 5911
In this section, the basic material in this scientific research, is referred to [Single Valued Neut- 5912
rosophic Set](Ref.[HG11s],Definition 2.2,p.2), [Neutrosophic Set](Ref.[HG11s],Definition 5913

2.1,p.1), [Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG11s],Definition 2.5,p.2), [Charac- 5914
terization of the Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG11s],Definition 2.7,p.3), 5915
[t-norm](Ref.[HG11s], Definition 2.7, p.3), and [Characterization of the Neutrosophic Super- 5916
HyperGraph (NSHG)](Ref.[HG11s],Definition 2.7,p.3), [Neutrosophic Strength of the Neutro- 5917
sophic SuperHyperPaths] (Ref.[HG11s],Definition 5.3,p.7), and [Different Neutrosophic Types 5918
of Neutrosophic SuperHyperEdges (NSHE)] (Ref.[HG11s],Definition 5.4,p.7). Also, the new 5919

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

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

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

TA (x), IA (x), FA (x) >, x ∈ X}:
TA (X) = min[TA (vi ), TA (vj )]vi ,vj ∈X ,
IA (X) = min[IA (vi ), IA (vj )]vi ,vj ∈X ,
and FA (X) = min[FA (vi ), FA (vj )]vi ,vj ∈X .
TA (x), IA (x), FA (x) >, x ∈ X}:
Definition 29.0.5 (Neutrosophic SuperHyperGraph (NSHG)). (Ref.[HG11s],Definition 5924
2.5,p.2). 5925
Assume V 0 is a given set. a Neutrosophic SuperHyperGraph (NSHG) S is a pair 5926
S = (V, E), where 5927
1, 2, . . . , n0 ); 5932
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 5933
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 5934

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



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

A binary operation ⊗ : [0, 1] × [0, 1] → [0, 1] is a t-norm if it satisfies the following for 5964
x, y, z, w ∈ [0, 1]: 5965
(i) 1 ⊗ x = x; 5966
(ii) x ⊗ y = y ⊗ x; 5967
(iii) x ⊗ (y ⊗ z) = (x ⊗ y) ⊗ z; 5968
(iv) If w ≤ x and y ≤ z then w ⊗ y ≤ x ⊗ z. 5969

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

where 5972

1, 2, . . . , n0 ); 5977
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 5978
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 5979
P
(vii) i supp(Vi ) = V, (i = 1, 2, . . . , n); 5980
0 0
P
(viii) i0 supp(Ei ) = V, (i = 1, 2, . . . , n ). 5981
0

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

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

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

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. 6039
(i) If for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | = 2, then NSHP is called path; 6040
(ii) if for all Ej 0 , |Ej 0 | = 2, and there’s Vi , |Vi | ≥ 1, then NSHP is called SuperPath; 6041
(iii) if for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | ≥ 2, then NSHP is called HyperPath; 6042
(iv) if there are Vi , Ej 0 , |Vi | ≥ 1, |Ej 0 | ≥ 2, then NSHP is called Neutrosophic SuperHy- 6043
perPath . 6044
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 6045
(i) Neutrosophic t-strength (min{T (Vi )}, m, n)si=1 ; 6046
(ii) Neutrosophic i-strength (m, min{I(Vi )}, n)si=1 ; 6047
(iii) Neutrosophic f-strength (m, n, min{F (Vi )})si=1 ; 6048
(iv) Neutrosophic strength (min{T (Vi )}, min{I(Vi )}, min{F (Vi )})si=1 . 6049
Definition 29.0.17 (Different Neutrosophic Types of Neutrosophic SuperHyperEdges (NSHE)). 6050

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

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


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

(xii) Neutrosophic connective if (T (E), I(E), F (E)) ≥ maximum number of Neutrosophic 6063
strength of SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex (NSHV) Vi 6064
to Neutrosophic SuperHyperVertex (NSHV) Vj where 1 ≤ i, j ≤ s. 6065
Definition 29.0.18. (Different Neutrosophic Types of Neutrosophic SuperHyperStrict Connective 6066

Dominating). 6067
(i) Neutrosophic e-SuperHyperStrict Connective Dominating if the following expression is 6071

called Neutrosophic e-SuperHyperStrict Connective Dominating criteria holds 6072

(ii) Neutrosophic re-SuperHyperStrict Connective Dominating if the following expression is 6073

called Neutrosophic re-SuperHyperStrict Connective Dominating criteria holds 6074

and |Ei |NEUTROSOPHIC CARDINALITY = |Ej |NEUTROSOPHIC CARDINALITY ; 6075
(iii) Neutrosophic v-SuperHyperStrict Connective Dominating if the following expression is 6076


(iv) Neutrosophic rv-SuperHyperStrict Connective Dominating if the following expression is 6078


and |Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; 6080
(v) Neutrosophic SuperHyperStrict Connective Dominating if it’s either of Neutrosophic e- 6081

Definition 29.0.19. ((Neutrosophic) SuperHyperStrict Connective Dominating). 6085

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


(ii) a Neutrosophic SuperHyperStrict Connective Dominating if it’s either of Neutrosophic 6096

(iii) an Extreme SuperHyperStrict Connective Dominating SuperHyperPolynomial if 6104

of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme 6110

(iv) a Neutrosophic SuperHyperStrict Connective Dominating SuperHyperPolynomial 6114

and Neutrosophic rv-SuperHyperStrict Connective Dominating and C(N SHG) for a Neutrosophic 6117

S of high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and Neutro- 6121
sophic SuperHyperVertices such that they form the Neutrosophic SuperHyperStrict Connective 6122
Dominating; and the Neutrosophic power is corresponded to its Neutrosophic coefficient; 6123
(v) an Extreme V-SuperHyperStrict Connective Dominating if it’s either of Neutrosophic e- 6124


(vi) a Neutrosophic V-SuperHyperStrict Connective Dominating if it’s either of Neutrosophic 6132

(vii) an Extreme V-SuperHyperStrict Connective Dominating SuperHyperPolynomial if 6140


(viii) a Neutrosophic SuperHyperStrict Connective Dominating SuperHyperPolynomial 6150

and Neutrosophic rv-SuperHyperStrict Connective Dominating and C(N SHG) for a Neutro- 6153


136TBL3

SuperHyperStrict Connective Dominating; and the Neutrosophic power is corresponded to its 6159
Definition 29.0.20. ((Extreme/Neutrosophic)δ−SuperHyperStrict Connective Dominating). 6161
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Then 6162
(i) an δ−SuperHyperStrict Connective Dominating is a Neutrosophic kind of Neutrosophic 6163
SuperHyperStrict Connective Dominating such that either of the following expressions hold for 6164
the Neutrosophic cardinalities of SuperHyperNeighbors of s ∈ S : 6165
|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 6166

(29.1), holds if S is an δ−SuperHyperDefensive; 6167
(ii) a Neutrosophic δ−SuperHyperStrict Connective Dominating is a Neutrosophic kind 6168

of Neutrosophic SuperHyperStrict Connective Dominating such that either of the following 6169
Neutrosophic expressions hold for the Neutrosophic cardinalities of SuperHyperNeighbors 6170

of s ∈ S : 6171
|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 6172

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

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 = 6182

(V, E). There are some Neutrosophic SuperHyperClasses if the Table (29.2) holds. 6183
Thus Neutrosophic SuperHyperPath , SuperHyperStrict Connective Dominating, SuperHyperStar, 6184
SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, are Neutrosophic 6185
SuperHyperPath, Neutrosophic SuperHyperCycle, Neutrosophic SuperHyperStar, 6186

Neutrosophic SuperHyperBipartite, Neutrosophic SuperHyperMultiPartite, and 6187
Neutrosophic SuperHyperWheel if the Table (29.2) holds. 6188
It’s useful to define a “Neutrosophic” version of a Neutrosophic SuperHyperStrict Connective 6189

Dominating . Since there’s more ways to get type-results to make a Neutrosophic SuperHyperStrict 6190
Connective Dominating more Neutrosophicly understandable. 6191
“redefine” the Neutrosophic notion of “Neutrosophic SuperHyperStrict Connective Dominating”. The 6193
6196
136DEF1 Definition 29.0.23. Assume a SuperHyperStrict Connective Dominating. It’s redefined a Neutro- 6197
sophic SuperHyperStrict Connective Dominating if the Table (29.3) holds. 6198

CHAPTER 30 6199
Neutrosophic SuperHyper But Strict Connective Dominating 6200
As The Extensions Excerpt From Dense 6201
And Super Forms 6202
Definition 30.0.1. (Neutrosophic event). 6203
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 6204

S = (V, E) is a probability Strict Connective Dominating. Any Neutrosophic k-subset of A of V 6205
is called Neutrosophic k-event and if k = 2, then Neutrosophic subset of A of V is called 6206
Neutrosophic event. The following expression is called Neutrosophic probability of A. 6207
X
E(A) = E(a). (30.1)
a∈A
Definition 30.0.2. (Neutrosophic Independent). 6208

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

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

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) 6215
is a probability Strict Connective Dominating. Any k-function Strict Connective Dominating like E is called 6216
Neutrosophic k-Variable. If k = 2, then any 2-function Strict Connective Dominating like E is 6217
called Neutrosophic Variable. 6218
The notion of independent on Neutrosophic Variable is likewise. 6219
Definition 30.0.4. (Neutrosophic Expectation). 6220
283
is a probability Strict Connective Dominating. A Neutrosophic k-Variable E has a number is called 6222
Neutrosophic Expectation if the following expression is called Neutrosophic Expectation 6223
criteria 6224
X
Ex(E) = E(α)P (α).
α∈V
Definition 30.0.5. (Neutrosophic Crossing). 6225

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) is 6226
a probability Strict Connective Dominating. A Neutrosophic number is called Neutrosophic Crossing 6227
if the following expression is called Neutrosophic Crossing criteria 6228
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). 6229
Consider S = (V, E) is a probability Strict Connective Dominating. Let m and n propose special Strict 6230
Connective Dominating. Then with m ≥ 4n, 6231
Proof. Consider a planar embedding G of G with cr(G) crossings. Let S be a Neutrosophic

random k-subset of V obtained by choosing each SuperHyperVertex of G Neutrosophic
independently with probability Strict 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: 6232
pm − 3n n 1 3 2
cr(G) ≥ = 3 = 64 m n .
p3 (4n/m)
6233
Theorem 30.0.7. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 6234
points in the plane, and let l be the Neutrosophic number of√SuperHyperLines in the plane 6236
passing through at least k + 1 of these points, where 1 ≤ k ≤ 2 2n. Then l < 32n2 /k 3 . 6237
Proof. Form a Neutrosophic SuperHyperGraph G with SuperHyperVertex SuperHyperSet P 6238

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

points in the plane, and let k be the number of pairs of points of P at unit SuperHyperDistance. 6246
Then k < 5n4/3 . 6247
Proof. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = 6248
(V, E) is a probability Strict Connective Dominating. Draw a SuperHyperUnit SuperHyperCircle around 6249
each SuperHyperPoint of P. Let ni be the Neutrosophic number of these SuperHyperCircles 6250
i = 0n−1 ni = n and k = 12 i = 0n−1 ini .
P P
passing through exactly i points of P. Then 6251
Now form a Neutrosophic SuperHyperGraph H with SuperHyperVertex SuperHyperSet P 6252
whose SuperHyperEdges are the SuperHyperArcs between consecutive SuperHyperPoints on 6253
the SuperHyperCircles that pass through at least three SuperHyperPoints of P. Then 6254
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 6255

SuperHyperEdges. Delete from H one of each SuperHyperPair of parallel SuperHyperEdges, 6256
so as to obtain a simple Neutrosophic SuperHyperGraph G with e(G) ≥ k − n. Now 6257
cr(G) ≤ n(n − 1) because G is formed from at most n SuperHyperCircles, and any two 6258
SuperHyperCircles cross at most twice. Thus either e(G) < 4n, in which case k < 5n < 5n4/3 , 6259
3
or n2 > n(n − 1) ≥ cr(G) ≥ (k − n) /64n2 by the Neutrosophic Crossing Lemma, and 6260
4/3 4/3
k < 4n + n < 5n . 6261
Proposition 30.0.9. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 6262
Consider S = (V, E) is a probability Strict Connective Dominating. Let X be a nonnegative Neutrosophic 6263
Variable and t a positive real number. Then 6264
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. 6265
Corollary 30.0.10. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 6266
Consider S = (V, E) is a probability Strict Connective Dominating. Let Xn be a nonnegative integer- 6267
valued variable in a probability Strict Connective Dominating (Vn , En ), n ≥ 1. If E(Xn ) → 0 as n → ∞, 6268
then P (Xn = 0) → 1 as n → ∞. 6269
Proof. 6270
Consider S = (V, E) is a probability Strict Connective Dominating. A special SuperHyperGraph in Gn,p 6272
almost surely has stability number at most d2p−1 log ne. 6273

Proof. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 6274
S = (V, E) is a probability Strict Connective Dominating. A special SuperHyperGraph in Gn,p is 6275
up. Let G ∈ Gn,p and let S be a given SuperHyperSet of k + 1 SuperHyperVertices of G, 6276
where k ∈ N. The probability that S is a stable SuperHyperSet of G is (1 − p)(k+1)choose2 , this 6277
being the probability that none of the (k + 1)choose2 pairs of SuperHyperVertices of S is a 6278
SuperHyperEdge of the Neutrosophic SuperHyperGraph G. 6279
Let AS denote the event that S is a stable SuperHyperSet of G, and let XS denote the indicator 6280
Neutrosophic Variable for this Neutrosophic Event. By equation, we have 6281
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 6282
X
X= {XS : S ⊆ V, |S| = k + 1}
and so, by those, 6283
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: 6284
nk+1
(n choose k+1) ≤ and1 − p ≤ e−p .
(k + 1)!
This yields the following upper bound on E(X). 6285
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 6286
least as fast as the logarithm of n, implies that E(X) → 0 as n → ∞. Because X is integer-valued 6287
and nonnegative, we deduce from Corollary that P (X = 0) → 1 as n → ∞. Consequently, a 6288
Neutrosophic SuperHyperGraph in Gn,p almost surely has stability number at most k. 6289
Definition 30.0.12. (Neutrosophic Variance). 6290
is a probability Strict Connective Dominating. A Neutrosophic k-Variable E has a number is called 6292
Neutrosophic Variance if the following expression is called Neutrosophic Variance 6293
criteria 6294
2
V x(E) = Ex((X − Ex(X)) ).
Consider S = (V, E) is a probability Strict Connective Dominating. Let X be a Neutrosophic Variable 6296
and let t be a positive real number. Then 6297
V (X)
E(|X − Ex(X)| ≥ t) ≤ .
t2

S = (V, E) is a probability Strict Connective Dominating. Let X be a Neutrosophic Variable and let t 6299
be a positive real number. Then 6300
2
2 Ex((X − Ex(X)) ) V (X)
E(|X − Ex(X)| ≥ t) = E((X − Ex(X)) ≥ t2 ) ≤ 2
= .
t t2
6301
Consider S = (V, E) is a probability Strict Connective Dominating. Let Xn be a Neutrosophic Variable 6303
in a probability Strict Connective Dominating (Vn , En ), n ≥ 1. If Ex(Xn ) 6= 0 and V (Xn ) << E 2 (Xn ), 6304
then 6305
E(Xn = 0) → 0 as n → ∞
S = (V, E) is a probability Strict Connective Dominating. Set X := Xn and t := |Ex(Xn )| in 6307
Chebyshev’s Inequality, and observe that E(Xn = 0) ≤ E(|Xn − Ex(Xn )| ≥ |Ex(Xn )|) because 6308
|Xn − Ex(Xn )| = |Ex(Xn )| when Xn = 0. 6309
Consider S = (V, E) is a probability Strict Connective Dominating. Let G ∈ Gn,1/2 . For 0 ≤ k ≤ n, set 6311
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 6312
one. Then almost surely α(G) takes one of the three values k ∗ − 2, k ∗ − 1, k ∗ . 6313
S = (V, E) is a probability Strict Connective Dominating. As in the proof of related Theorem, the 6315
result is straightforward. 6316
Consider S = (V, E) is a probability Strict Connective Dominating. Let G ∈ Gn,1/2 and let f and k ∗ be 6318
as defined in previous Theorem. Then either: 6319
(i). f (k ∗ ) << 1, in which case almost surely α(G) is equal to either k ∗ − 2 or k ∗ − 1, or 6320
(ii). f (k ∗ − 1) >> 1, in which case almost surely α(G) is equal to either k ∗ − 1 or k ∗ . 6321
Definition 30.0.17. (Neutrosophic Threshold). 6324

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

Definition 30.0.18. (Neutrosophic Balanced). 6331

is a probability Strict Connective Dominating. Let F be a fixed Neutrosophic SuperHyperGraph. Then 6333
there is a threshold function for the property of containing a copy of F as a Neutrosophic 6334
SubSuperHyperGraph is called Neutrosophic Balanced. 6335
Theorem 30.0.19. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = 6336

(V, E). Consider S = (V, E) is a probability Strict Connective Dominating. Let F be a nonempty 6337
balanced Neutrosophic SubSuperHyperGraph with k SuperHyperVertices and l SuperHyperEdges. 6338
Then n−k/l is a threshold function for the property of containing F as a Neutrosophic 6339
SubSuperHyperGraph. 6340
136EXM1 Example 30.0.20. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E) 6343
in the mentioned Neutrosophic Figures in every Neutrosophic items. 6344
• On the Figure (30.1), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 6345

SuperHyperStrict Connective Dominating, is up. The Neutrosophic Algorithm is Neutrosophicly 6346
straightforward. E1 and E3 are some empty Neutrosophic SuperHyperEdges but E2 6347
is a loop Neutrosophic SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. 6348

Thus in the terms of Neutrosophic SuperHyperNeighbor, there’s only one Neutrosophic 6349
SuperHyperEdge, namely, E4 . The Neutrosophic SuperHyperVertex, V3 is Neutrosophic 6350
isolated means that there’s no Neutrosophic SuperHyperEdge has it as a Neutrosophic 6351
endpoint. Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in every given 6352
Neutrosophic SuperHyperStrict Connective Dominating. 6353
C(N SHG)Neutrosophic Strict Connective Dominating =

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

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

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

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

Dominating. 6363

{}.
= 0z 0 .
{}.
= 0z 0 .
6364


{}.
= 0z 0 .
{}.



= 0z 0 .
6368


{}.
= 0z 0 .
{}.
= 0z 0 .
6372






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


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



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


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




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


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


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


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







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


{E1 }.


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


{E9 , E3 }.
= z 3−a .
{V1 , V6 }.
= z 5−a .
6408




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


{E3i+1 }1i=0 .


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


{E3i+1 }1i=0 .


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


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







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


{E3i+1 }3i=0 .



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


{E6 }.
= z 4−a .
{V1 }.


= z 6−a .
6436


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


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

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


Neutrosophic SuperHyperStrict Connective Dominating in the Neutrosophic Example (42.0.3) 95NHG2
Dominating if for any of them, and any of other corresponded Neutrosophic SuperHyperVertex, 6447
some interior Neutrosophic SuperHyperVertices are mutually Neutrosophic SuperHyperNeighbors 6448
with no Neutrosophic exception at all minus all Neutrosophic SuperHypeNeighbors to any amount 6449
of them. 6450
Proposition 30.0.22. Assume a connected non-obvious Neutrosophic SuperHyperGraph ESHG : 6451
(V, E). There’s only one Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) has only the maximum 6452
possibilities of the distinct interior Neutrosophic SuperHyperVertices inside of any given 6453
Neutrosophic quasi-R-Strict Connective Dominating minus all Neutrosophic SuperHypeNeighbor to some 6454
of them but not all of them. In other words, there’s only an unique Neutrosophic SuperHyperEdge 6455
E ∈ EESHG:(V,E) has only two distinct Neutrosophic SuperHyperVertices in an Neutrosophic 6456
quasi-R-Strict Connective Dominating, minus all Neutrosophic SuperHypeNeighbor to some of them but 6457
not all of them. 6458
Proposition 30.0.23. Assume a connected Neutrosophic SuperHyperGraph ESHG : (V, E). If

a Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) has z Neutrosophic SuperHyperVertices, then
the Neutrosophic cardinality of the Neutrosophic R-Strict Connective Dominating is at least
V \ (V \ {aE , bE , cE , . . . , zE }).
It’s straightforward that the Neutrosophic cardinality of the Neutrosophic R-Strict Connective Dominating 6459
is at least the maximum Neutrosophic number of Neutrosophic SuperHyperVertices of the 6460
Neutrosophic SuperHyperEdges with the maximum number of the Neutrosophic SuperHyperEdges. 6461
In other words, the maximum number of the Neutrosophic SuperHyperEdges contains 6462
the maximum Neutrosophic number of Neutrosophic SuperHyperVertices are renamed to 6463

Neutrosophic Strict Connective Dominating in some cases but the maximum number of the Neutrosophic 6464
SuperHyperEdge with the maximum Neutrosophic number of Neutrosophic SuperHyperVertices, 6465
has the Neutrosophic SuperHyperVertices are contained in a Neutrosophic R-Strict Connective 6466
Dominating. 6467
Proposition 30.0.24. Assume a simple Neutrosophic SuperHyperGraph ESHG : (V, E). Then
the Neutrosophic number of type-result-R-Strict 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-Strict Connective Dominating with the least Neutrosophic 6468
cardinality, the lower sharp Neutrosophic bound for cardinality. 6469
Proposition 30.0.25. Assume a connected loopless Neutrosophic SuperHyperGraph ESHG : 6470

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

= {V1 , E1 , V2 , E2 , V3 , E3 , V4 , E4 , V1 }.
C(N SHG)N eutrosophicQuasi−StrictConnectiveDominatingSuperHyperP olynomial = z 4 .
C(N SHG)N eutrosophicQuasi−StrictConnectiveDominating = {V1 , V2 , V3 , V4 , V1 }.
C(N SHG)N eutrosophicR−Quasi−StrictConnectiveDominatingSuperHyperP olynomial = z 5 .
Is a Neutrosophic type-result-Strict Connective Dominating. In other words, the least cardinality, the 6472
lower sharp bound for the cardinality, of a Neutrosophic type-result-Strict Connective Dominating is the 6473
cardinality of 6474

= {V1 , E1 , V2 , E2 , V3 , E3 , V4 , E4 , V1 }.
C(N SHG)N eutrosophicQuasi−StrictConnectiveDominatingSuperHyperP olynomial = z 4 .
C(N SHG)N eutrosophicQuasi−StrictConnectiveDominating = {V1 , V2 , V3 , V4 , V1 }.
C(N SHG)N eutrosophicR−Quasi−StrictConnectiveDominatingSuperHyperP olynomial = z 5 .
Proof. Assume a connected loopless Neutrosophic SuperHyperGraph ESHG : (V, E). The
SuperHyperSet of the SuperHyperVertices V \ V \ {z} isn’t a quasi-R-Strict 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-Strict Connective Dominating. In other words, the least cardinality, the lower sharp bound
for the cardinality, of a quasi-R-Strict 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-Strict 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-Strict 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-Strict 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-Strict Connective Dominating has
the Neutrosophic cardinality of a Neutrosophic SuperHyperEdge. Thus, a Neutrosophic R-Strict
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-Strict 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-Strict 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-Strict 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-Strict 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-Strict Connective Dominating.
Those Neutrosophic SuperHyperVertices are potentially included in a Neutrosophic style-R-Strict
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-Strict Connective Dominating is
{aE , bE , cE , . . . , zE } .
This definition coincides with the definition of the Neutrosophic R-Strict 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-Strict Connective Dominating. Let
E
Zi ∼ Zj , be defined as Zi and Zj are the Neutrosophic SuperHyperVertices belong to the
Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) . Thus,
E
E = {Z1 , Z2 , . . . , Zz | Zi ∼ Zj , i 6= j, i, j = 1, 2, . . . , z}.
Or
{aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .
But with the slightly differences, 6475
Neutrosophic R-Strict Connective Dominating =

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

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

the maximum Neutrosophic number of Neutrosophic SuperHyperVertices are renamed to Neut- 6481
rosophic Strict Connective Dominating in some cases but the maximum number of the Neutrosophic 6482
SuperHyperEdge with the maximum Neutrosophic number of Neutrosophic SuperHyperVertices, 6483
has the Neutrosophic SuperHyperVertices are contained in a Neutrosophic R-Strict Connective 6484
Dominating. 6485
The obvious SuperHyperGraph has no Neutrosophic SuperHyperEdges. But the non-obvious 6486
Neutrosophic SuperHyperModel is up. The quasi-SuperHyperModel addresses some issues about 6487
the Neutrosophic optimal SuperHyperObject. It specially delivers some remarks on the Neutro- 6488
sophic SuperHyperSet of the Neutrosophic SuperHyperVertices such that there’s distinct amount 6489
of Neutrosophic SuperHyperEdges for distinct amount of Neutrosophic SuperHyperVertices up 6490
to all taken from that Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices 6491
but this Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices is either has 6492
the maximum Neutrosophic SuperHyperCardinality or it doesn’t have maximum Neutrosophic 6493

SuperHyperCardinality. In a non-obvious SuperHyperModel, there’s at least one Neutrosophic 6494
SuperHyperEdge containing at least all Neutrosophic SuperHyperVertices. Thus it forms a 6495
Neutrosophic quasi-R-Strict Connective Dominating where the Neutrosophic completion of the Neutro- 6496
sophic incidence is up in that. Thus it’s, literarily, a Neutrosophic embedded R-Strict Connective 6497
Dominating. The SuperHyperNotions of embedded SuperHyperSet and quasi-SuperHyperSet 6498
coincide. In the original setting, these types of SuperHyperSets only don’t satisfy on the 6499
maximum SuperHyperCardinality. Thus the embedded setting is elected such that those Super- 6500
HyperSets have the maximum Neutrosophic SuperHyperCardinality and they’re Neutrosophic 6501
SuperHyperOptimal. The less than two distinct types of Neutrosophic SuperHyperVertices are 6502
included in the minimum Neutrosophic style of the embedded Neutrosophic R-Strict Connective 6503
Dominating. The interior types of the Neutrosophic SuperHyperVertices are deciders. Since the 6504
Neutrosophic number of SuperHyperNeighbors are only affected by the interior Neutrosophic 6505
SuperHyperVertices. The common connections, more precise and more formal, the perfect 6506
unique connections inside the Neutrosophic SuperHyperSet for any distinct types of Neutro- 6507
sophic SuperHyperVertices pose the Neutrosophic R-Strict Connective Dominating. Thus Neutrosophic 6508
exterior SuperHyperVertices could be used only in one Neutrosophic SuperHyperEdge and in 6509
Neutrosophic SuperHyperRelation with the interior Neutrosophic SuperHyperVertices in that 6510
Neutrosophic SuperHyperEdge. In the embedded Neutrosophic Strict Connective Dominating, there’s 6511
the usage of exterior Neutrosophic SuperHyperVertices since they’ve more connections inside 6512
more than outside. Thus the title “exterior” is more relevant than the title “interior”. One Neut- 6513
rosophic SuperHyperVertex has no connection, inside. Thus, the Neutrosophic SuperHyperSet 6514
of the Neutrosophic SuperHyperVertices with one SuperHyperElement has been ignored in the 6515
exploring to lead on the optimal case implying the Neutrosophic R-Strict Connective Dominating. The 6516
Neutrosophic R-Strict Connective Dominating with the exclusion of the exclusion of all Neutrosophic 6517
SuperHyperVertices in one Neutrosophic SuperHyperEdge and with other terms, the Neutro- 6518
sophic R-Strict Connective Dominating with the inclusion of all Neutrosophic SuperHyperVertices in 6519
one Neutrosophic SuperHyperEdge, is a Neutrosophic quasi-R-Strict Connective Dominating. To sum 6520
them up, in a connected non-obvious Neutrosophic SuperHyperGraph ESHG : (V, E). There’s 6521
only one Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) has only the maximum possibilities 6522
of the distinct interior Neutrosophic SuperHyperVertices inside of any given Neutrosophic 6523
quasi-R-Strict Connective Dominating minus all Neutrosophic SuperHypeNeighbor to some of them 6524
but not all of them. In other words, there’s only an unique Neutrosophic SuperHyperEdge 6525
E ∈ EESHG:(V,E) has only two distinct Neutrosophic SuperHyperVertices in an Neutrosophic 6526

quasi-R-Strict Connective Dominating, minus all Neutrosophic SuperHypeNeighbor to some of them 6527
but not all of them. 6528
The main definition of the Neutrosophic R-Strict Connective Dominating has two titles. a Neut- 6529
rosophic quasi-R-Strict Connective Dominating and its corresponded quasi-maximum Neutrosophic 6530
R-SuperHyperCardinality are two titles in the terms of quasi-R-styles. For any Neutrosophic 6531
number, there’s a Neutrosophic quasi-R-Strict Connective Dominating with that quasi-maximum Neut- 6532
rosophic SuperHyperCardinality in the terms of the embedded Neutrosophic SuperHyper- 6533

Graph. If there’s an embedded Neutrosophic SuperHyperGraph, then the Neutrosophic quasi- 6534
SuperHyperNotions lead us to take the collection of all the Neutrosophic quasi-R-Strict Connective 6535
Dominatings for all Neutrosophic numbers less than its Neutrosophic corresponded maximum 6536
number. The essence of the Neutrosophic Strict Connective Dominating ends up but this essence starts 6537
up in the terms of the Neutrosophic quasi-R-Strict Connective Dominating, again and more in the 6538
operations of collecting all the Neutrosophic quasi-R-Strict Connective Dominatings acted on the all 6539
possible used formations of the Neutrosophic SuperHyperGraph to achieve one Neutrosophic 6540
number. This Neutrosophic number is 6541
considered as the equivalence class for all corresponded quasi-R-Strict Connective Dominatings. 6542
Let zNeutrosophic Number , SNeutrosophic SuperHyperSet and GNeutrosophic Strict Connective Dominating be a 6543
Neutrosophic number, a Neutrosophic SuperHyperSet and a Neutrosophic Strict Connective Dominating. 6544
Then 6545
[zNeutrosophic Number ]Neutrosophic Class = {SNeutrosophic SuperHyperSet |

SNeutrosophic SuperHyperSet = GNeutrosophic Strict Connective Dominating ,
|SNeutrosophic SuperHyperSet |Neutrosophic Cardinality
= zNeutrosophic Number }.
As its consequences, the formal definition of the Neutrosophic Strict Connective Dominating is re- 6546
formalized and redefined as follows. 6547
GNeutrosophic Strict 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 6548
definition for the Neutrosophic Strict Connective Dominating. 6549
GNeutrosophic Strict 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 Strict 6550
Connective Dominating poses the upcoming expressions. 6551

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

= max zNeutrosophic Number

And then, 6553


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

6555

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


6556


6557


Now, the extension of these types of approaches is up. Since the new term, “Neutrosophic 6558
SuperHyperNeighborhood”, could be redefined as the collection of the Neutrosophic Super- 6559
HyperVertices such that any amount of its Neutrosophic SuperHyperVertices are incident to 6560
a Neutrosophic SuperHyperEdge. It’s, literarily, another name for “Neutrosophic Quasi-Strict 6561
Connective Dominating” but, precisely, it’s the generalization of “Neutrosophic Quasi-Strict Connective 6562
Dominating” since “Neutrosophic Quasi-Strict Connective Dominating” happens “Neutrosophic Strict Con- 6563
nective Dominating” in a Neutrosophic SuperHyperGraph as initial framework and background but 6564
“Neutrosophic SuperHyperNeighborhood” may not happens “Neutrosophic Strict Connective Dominat- 6565
ing” in a Neutrosophic SuperHyperGraph as initial framework and preliminarily background 6566

since there are some ambiguities about the Neutrosophic SuperHyperCardinality arise from it. 6567
To get orderly keywords, the terms, “Neutrosophic SuperHyperNeighborhood”, “Neutrosophic 6568
Quasi-Strict Connective Dominating”, and “Neutrosophic Strict Connective Dominating” are up. 6569
Thus, let 6570
zNeutrosophic Number , NNeutrosophic SuperHyperNeighborhood and 6571

GNeutrosophic Strict Connective Dominating be a Neutrosophic number, a Neutrosophic SuperHyper- 6572
Neighborhood and a Neutrosophic Strict Connective Dominating and the new terms are up. 6573
GNeutrosophic Strict Connective Dominating ∈ ∪zNeutrosophic Number

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

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

6575

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

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

6578

∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class =

6579



6580


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

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

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

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

. Since the Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices,
Dominating
(V \ V \ {x, z}) ∪ {xy}
or
(V \ V \ {x, z}) ∪ {zy}
is an Neutrosophic R-Strict 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 Strict
Connective Dominating and it’s an Neutrosophic Strict 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 Strict Connective Dominating. There isn’t only less than two
Neutrosophic SuperHyperVertices inside the intended Neutrosophic SuperHyperSet,
Thus the non-obvious Neutrosophic R-Strict Connective Dominating,
is up. The non-obvious simple Neutrosophic type-SuperHyperSet of the Neutrosophic Strict
, not:
Connective Dominating
Is the Neutrosophic SuperHyperSet, not:
does includes only less than two SuperHyperVertices in a connected Neutrosophic Super- 6581
HyperGraph ESHG : (V, E) but it’s impossible in the case, they’ve corresponded to an 6582
SuperHyperEdge. It’s interesting to mention that the only non-obvious simple Neutrosophic 6583
type-SuperHyperSet called the 6584
“Neutrosophic R-Strict Connective Dominating” 6585

amid those obvious[non-obvious] simple Neutrosophic type-SuperHyperSets called the 6586
Neutrosophic R-Strict Connective Dominating, 6587
is only and only
In a connected Neutrosophic SuperHyperGraph ESHG : (V, E) with a illustrated SuperHyper-

Modeling. It’s also, not only a Neutrosophic free-triangle embedded SuperHyperModel and a
Neutrosophic on-triangle embedded SuperHyperModel but also it’s a Neutrosophic stable em-
bedded SuperHyperModel. But all only non-obvious simple Neutrosophic type-SuperHyperSets
of the Neutrosophic R-Strict Connective Dominating amid those obvious simple Neutrosophic type-
SuperHyperSets of the Neutrosophic Strict 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-Strict Connective Dominating. In other words, the least cardinality, the lower
sharp bound for the cardinality, of a Neutrosophic R-Strict Connective Dominating is the cardinality of
6588
To sum them up, in a connected Neutrosophic SuperHyperGraph ESHG : (V, E). The all 6589
interior Neutrosophic SuperHyperVertices belong to any Neutrosophic quasi-R-Strict Connective 6590
Dominating if for any of them, and any of other corresponded Neutrosophic SuperHyperVertex, 6591
some interior Neutrosophic SuperHyperVertices are mutually Neutrosophic SuperHyperNeigh- 6592
bors with no Neutrosophic exception at all minus all Neutrosophic SuperHypeNeighbors to any 6593
amount of them. 6594
Assume a connected Neutrosophic SuperHyperGraph ESHG : (V, E). Let a Neutrosophic Supe- 6595
rHyperEdge ESHE : E ∈ EESHG:(V,E) has some Neutrosophic SuperHyperVertices r. Consider 6596
all Neutrosophic numbers of those Neutrosophic SuperHyperVertices from that Neutrosophic 6597
SuperHyperEdge excluding excluding more than r distinct Neutrosophic SuperHyperVertices, 6598
exclude to any given Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices. 6599
Consider there’s a Neutrosophic R-Strict Connective Dominating with the least cardinality, the lower 6600
sharp Neutrosophic bound for Neutrosophic cardinality. Assume a connected Neutrosophic 6601
SuperHyperGraph ESHG : (V, E). The Neutrosophic SuperHyperSet of the Neutrosophic 6602
SuperHyperVertices VESHE \ {z} is a Neutrosophic SuperHyperSet S of the Neutrosophic Su- 6603
perHyperVertices such that there’s a Neutrosophic SuperHyperEdge to have some Neutrosophic 6604
SuperHyperVertices uniquely but it isn’t a Neutrosophic R-Strict Connective Dominating. Since it 6605
doesn’t have 6606
6607

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

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

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

the Neutrosophic Strict Connective Dominating. The Neutrosophic SuperHyperSet of Neutrosophic 6639
SuperHyperEdges[SuperHyperVertices], 6640

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

Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperEdges[SuperHyperVertices], 6642

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

Graph ESHG : (V, E) is a Neutrosophic type-SuperHyperSet with 6644
6645
rosophic SuperHyperEdges[SuperHyperVertices] such that there’s no Neutrosophic Super- 6647
HyperVertex of a Neutrosophic SuperHyperEdge is common and there’s an Neutrosophic 6648
SuperHyperEdge for all Neutrosophic SuperHyperVertices. There are not only two Neut- 6649
rosophic SuperHyperVertices inside the intended Neutrosophic SuperHyperSet. Thus the 6650
non-obvious Neutrosophic Strict Connective Dominating is up. The obvious simple Neutrosophic type- 6651
SuperHyperSet called the Neutrosophic Strict Connective Dominating is a Neutrosophic SuperHyperSet 6652
includes only two Neutrosophic SuperHyperVertices. But the Neutrosophic SuperHyperSet of 6653
the Neutrosophic SuperHyperEdges[SuperHyperVertices], 6654

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- 6655
Set. Thus the non-obvious simple Neutrosophic type-SuperHyperSet of the Neutrosophic Strict 6656
Connective Dominating is up. To sum them up, the Neutrosophic SuperHyperSet of the Neutrosophic 6657
SuperHyperEdges[SuperHyperVertices], 6658

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


= az s + bz t .
Is the non-obvious simple Neutrosophic type-SuperHyperSet of the Neutrosophic Strict Con- 6659
. Since the Neutrosophic SuperHyperSet of the Neutrosophic SuperHy-
nective Dominating 6660

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

that there’s no a Neutrosophic SuperHyperEdge for some Neutrosophic SuperHyperVertices 6664
given by that Neutrosophic type-SuperHyperSet called the Neutrosophic Strict Connective Dominating 6665
and it’s an Neutrosophic Strict Connective Dominating. Since it’s 6666
6667
rosophic SuperHyperEdges[SuperHyperVertices] such that there’s no Neutrosophic Super- 6669

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

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

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


= az s + bz t .
Is up. The obvious simple Neutrosophic type-SuperHyperSet of the Neutrosophic Strict Connective 6674
, not:
Dominating 6675

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

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- 6677
HyperGraph ESHG : (V, E). It’s interesting to mention that the only non-obvious simple 6678
Neutrosophic type-SuperHyperSet called the 6679
“Neutrosophic Strict Connective Dominating ” 6680
amid those obvious[non-obvious] simple Neutrosophic type-SuperHyperSets called the 6681
Neutrosophic Strict Connective Dominating , 6682
is only and only 6683

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


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

CHAPTER 31 6685
The Neutrosophic Departures on The 6686
Theoretical Results Toward Theoretical 6687
Motivations 6688
The previous Neutrosophic approach apply on the upcoming Neutrosophic results on 6689
Neutrosophic SuperHyperClasses. 6690
Proposition 31.0.1. Assume a connected Neutrosophic SuperHyperPath ESHP : (V, E). Then 6691

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

136EXM18a Example 31.0.2. In the Figure (31.1), the connected Neutrosophic SuperHyperPath ESHP : 6699
(V, E), is highlighted and featured. The Neutrosophic SuperHyperSet, in the Neutrosophic 6700
SuperHyperModel (31.1), is the SuperHyperStrict Connective Dominating. 6701
Proposition 31.0.3. Assume a connected Neutrosophic SuperHyperCycle ESHC : (V, E). Then 6702

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

136EXM19a Example 31.0.4. In the Figure (31.2), the connected Neutrosophic SuperHyperCycle N SHC : 6710
(V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, in the 6711
Neutrosophic SuperHyperModel (31.2), is the Neutrosophic SuperHyperStrict Connective Dominating. 6712
6713

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

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

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

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

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

136EXM20a Example 31.0.6. In the Figure (31.3), the connected Neutrosophic SuperHyperStar ESHS : 6722
(V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, by the Algorithm 6723
in previous Neutrosophic result, of the Neutrosophic SuperHyperVertices of the connected 6724
Neutrosophic SuperHyperStar ESHS : (V, E), in the Neutrosophic SuperHyperModel (31.3), is 6725
the Neutrosophic SuperHyperStrict Connective Dominating. 6726
Proposition 31.0.7. Assume a connected Neutrosophic SuperHyperBipartite ESHB : (V, E). 6727

Then 6728

|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 6729
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
j N SHG
6730
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). 6731

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

Figure 31.4: Neutrosophic SuperHyperBipartite Neutrosophic Associated to the Neutrosophic

Notions of Neutrosophic SuperHyperStrict Connective Dominating in the Example (42.0.11) 136NSHG21a
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperStrict Connective Dominating taken from a connected Neutrosophic Supe- 6739
rHyperBipartite ESHB : (V, E). Thus only some SuperHyperVertices and only minimum- 6740
Neutrosophic-of-SuperHyperPart SuperHyperEdges are attained in any solution 6741
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
136EXM21a Example 31.0.8. In the Neutrosophic Figure (31.4), the connected Neutrosophic SuperHy- 6743
perBipartite ESHB : (V, E), is Neutrosophic highlighted and Neutrosophic featured. The 6744
obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous Neutrosophic 6745
result, of the Neutrosophic SuperHyperVertices of the connected Neutrosophic SuperHyper- 6746

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

Then 6750

|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 6751
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
j N SHG
6752
P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
...,
EXT ERN AL
j N SHG
is a longest SuperHyperStrict Connective Dominating taken from a connected Neutrosophic SuperHy- 6753
perMultipartite ESHM : (V, E). There’s a new way to redefine as 6754

0
Dominating could be applied. There are only z SuperHyperParts. Thus every SuperHyperPart 6759
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). 6761
Thus only some SuperHyperVertices and only minimum-Neutrosophic-of-SuperHyperPart 6762
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
136EXM22a Example 31.0.10. In the Figure (31.5), the connected Neutrosophic SuperHyperMultipartite 6766
ESHM : (V, E), is highlighted and Neutrosophic featured. The obtained Neutrosophic 6767
SuperHyperSet, by the Algorithm in previous Neutrosophic result, of the Neutrosophic 6768
SuperHyperVertices of the connected Neutrosophic SuperHyperMultipartite ESHM : (V, E), 6769
in the Neutrosophic SuperHyperModel (31.5), is the Neutrosophic SuperHyperStrict Connective 6770

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

Then, 6773

{Ei }.
= z |Ei | .
{CEN T ER}.
= z |CEN T ER| .
Proof. Let 6774
P :
CEN T ER, E2∗
6775
P :
E1∗ , V1EXT ERN AL ,
E2∗ , CEN T ER
is a longest SuperHyperStrict Connective Dominating taken from a connected Neutrosophic SuperHy- 6776
perWheel ESHW : (V, E). There’s a new way to redefine as 6777

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

Figure 31.6: a Neutrosophic SuperHyperWheel Neutrosophic Associated to the Neutrosophic

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

CHAPTER 32 6790
The Surveys of Mathematical Sets On 6791
The Results But As The Initial Motivation 6792
For the SuperHyperStrict Connective Dominating, Neutrosophic SuperHyperStrict Connective Dominating, 6793
and the Neutrosophic SuperHyperStrict Connective Dominating, some general results are introduced. 6794
6795
Remark 32.0.1. Let remind that the Neutrosophic SuperHyperStrict Connective Dominating is 6796
“redefined” on the positions of the alphabets. 6797
Corollary 32.0.2. Assume Neutrosophic SuperHyperStrict Connective Dominating. Then 6798
N eutrosophic SuperHyperStrictConnectiveDominating =
{theSuperHyperStrictConnectiveDominatingof theSuperHyperV ertices |
max |SuperHyperOf f ensive
SuperHyperStrictConnectiveDominating
|N eutrosophiccardinalityamidthoseSuperHyperStrictConnectiveDominating. }
plus one Neutrosophic SuperHypeNeighbor to one. Where σi is the unary operation on the 6799
SuperHyperVertices of the SuperHyperGraph to assign the determinacy, the indeterminacy and 6800
the neutrality, for i = 1, 2, 3, respectively. 6801
Corollary 32.0.3. Assume a Neutrosophic SuperHyperGraph on the same identical letter of the 6802
alphabet. Then the notion of Neutrosophic SuperHyperStrict Connective Dominating and SuperHyperStrict 6803
Connective Dominating coincide. 6804
Corollary 32.0.4. Assume a Neutrosophic SuperHyperGraph on the same identical letter of 6805
the alphabet. Then a consecutive sequence of the SuperHyperVertices is a Neutrosophic 6806

SuperHyperStrict Connective Dominating if and only if it’s a SuperHyperStrict Connective Dominating. 6807
Corollary 32.0.5. Assume a Neutrosophic SuperHyperGraph on the same identical letter of the 6808
alphabet. Then a consecutive sequence of the SuperHyperVertices is a strongest SuperHyperStrict 6809
Connective Dominating if and only if it’s a longest SuperHyperStrict Connective Dominating. 6810
Corollary 32.0.6. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph on the same 6811

identical letter of the alphabet. Then its Neutrosophic SuperHyperStrict Connective Dominating is its 6812
339
Corollary 32.0.7. Assume a Neutrosophic SuperHyperPath(-/SuperHyperStrict Connective Dominating, 6814

SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel) on the same 6815
identical letter of the alphabet. Then its Neutrosophic SuperHyperStrict Connective Dominating is its 6816
Corollary 32.0.8. Assume a Neutrosophic SuperHyperGraph. Then its Neutrosophic SuperHy- 6818
perStrict Connective Dominating isn’t well-defined if and only if its SuperHyperStrict Connective Dominating 6819
isn’t well-defined. 6820
Corollary 32.0.9. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph. Then its 6821

Neutrosophic SuperHyperStrict Connective Dominating isn’t well-defined if and only if its SuperHyperStrict 6822

Neutrosophic SuperHyperStrict Connective Dominating isn’t well-defined if and only if its SuperHyperStrict 6826
Corollary 32.0.11. Assume a Neutrosophic SuperHyperGraph. Then its Neutrosophic Super- 6828
HyperStrict Connective Dominating is well-defined if and only if its SuperHyperStrict Connective Dominating is 6829
well-defined. 6830
Corollary 32.0.12. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph. Then its 6831
Neutrosophic SuperHyperStrict Connective Dominating is well-defined if and only if its SuperHyperStrict 6832

Neutrosophic SuperHyperStrict Connective Dominating is well-defined if and only if its SuperHyperStrict 6836
Proposition 32.0.14. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. Then V is 6838
(i) : the dual SuperHyperDefensive SuperHyperStrict Connective Dominating; 6839
(ii) : the strong dual SuperHyperDefensive SuperHyperStrict Connective Dominating; 6840
(iii) : the connected dual SuperHyperDefensive SuperHyperStrict Connective Dominating; 6841
(iv) : the δ-dual SuperHyperDefensive SuperHyperStrict Connective Dominating; 6842
(v) : the strong δ-dual SuperHyperDefensive SuperHyperStrict Connective Dominating; 6843
(vi) : the connected δ-dual SuperHyperDefensive SuperHyperStrict Connective Dominating. 6844
Proposition 32.0.15. Let N T G : (V, E, σ, µ) be a Neutrosophic SuperHyperGraph. Then ∅ is 6845
(iii) : the connected defensive SuperHyperDefensive SuperHyperStrict Connective Dominating; 6848

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

independent SuperHyperSet is 6853
(iii) : the connected SuperHyperDefensive SuperHyperStrict Connective Dominating; 6856
Proposition 32.0.17. Let ESHG : (V, E) be a Neutrosophic SuperHyperUniform SuperHyper- 6860

Graph which is a SuperHyperStrict Connective Dominating/SuperHyperPath. Then V is a maximal 6861
(iv) : O(ESHG)-SuperHyperDefensive SuperHyperStrict Connective Dominating; 6865
(v) : strong O(ESHG)-SuperHyperDefensive SuperHyperStrict Connective Dominating; 6866
(vi) : connected O(ESHG)-SuperHyperDefensive SuperHyperStrict Connective Dominating; 6867
Proposition 32.0.18. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is a 6869
SuperHyperUniform SuperHyperWheel. Then V is a maximal 6870
(iv) : O(ESHG)-dual SuperHyperDefensive SuperHyperStrict Connective Dominating; 6874
(v) : strong O(ESHG)-dual SuperHyperDefensive SuperHyperStrict Connective Dominating; 6875
(vi) : connected O(ESHG)-dual SuperHyperDefensive SuperHyperStrict Connective Dominating; 6876
Graph which is a SuperHyperStrict Connective Dominating/SuperHyperPath. Then the number of 6879

(i) : the SuperHyperStrict Connective Dominating; 6880
(ii) : the SuperHyperStrict Connective Dominating; 6881
(iii) : the connected SuperHyperStrict Connective Dominating; 6882
(iv) : the O(ESHG)-SuperHyperStrict Connective Dominating; 6883
(v) : the strong O(ESHG)-SuperHyperStrict Connective Dominating; 6884
(vi) : the connected O(ESHG)-SuperHyperStrict Connective Dominating. 6885
coincide. 6887

Graph which is a SuperHyperWheel. Then the number of 6889
(i) : the dual SuperHyperStrict Connective Dominating; 6890
(ii) : the dual SuperHyperStrict Connective Dominating; 6891
(iii) : the dual connected SuperHyperStrict Connective Dominating; 6892
(iv) : the dual O(ESHG)-SuperHyperStrict Connective Dominating; 6893
(v) : the strong dual O(ESHG)-SuperHyperStrict Connective Dominating; 6894
(vi) : the connected dual O(ESHG)-SuperHyperStrict Connective Dominating. 6895
coincide. 6897
Proposition 32.0.21. Let ESHG : (V, E) be a Neutrosophic SuperHyperUniform SuperHy- 6898

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


Graph which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperCom- 6910
plete SuperHyperMultipartite. Then a SuperHyperSet contains the half of multiplying r with 6911
the number of all the SuperHyperEdges plus one of all the SuperHyperVertices in the biggest 6912
SuperHyperPart is a 6913
(iv) : δ-SuperHyperDefensive SuperHyperStrict Connective Dominating; 6917
(v) : strong δ-SuperHyperDefensive SuperHyperStrict Connective Dominating; 6918
(vi) : connected δ-SuperHyperDefensive SuperHyperStrict Connective Dominating. 6919
Graph which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperCom- 6921

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

Proposition 32.0.25. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. Then the 6940
number is at most O(ESHG) and the Neutrosophic number is at most On (ESHG). 6941
Proposition 32.0.26. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is 6942
SuperHyperComplete. The number is O(ESHG:(V,E)) 2 + 1 and the Neutrosophic number is 6943

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


Proposition 32.0.27. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is ∅. The 6951
number is 0 and the Neutrosophic number is 0, for an independent SuperHyperSet in the setting 6952
of dual 6953
(iv) : 0-SuperHyperDefensive SuperHyperStrict Connective Dominating; 6957

SuperHyperComplete. Then there’s no independent SuperHyperSet. 6961
Proposition 32.0.29. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is Supe- 6962
rHyperStrict Connective Dominating/SuperHyperPath/SuperHyperWheel. The number is O(ESHG : 6963
(V, E)) and the Neutrosophic number is On (ESHG : (V, E)), in the setting of a dual 6964
(iv) : O(ESHG : (V, E))-SuperHyperDefensive SuperHyperStrict Connective Dominating; 6968
(v) : strong O(ESHG : (V, E))-SuperHyperDefensive SuperHyperStrict Connective Dominating; 6969
(vi) : connected O(ESHG : (V, E))-SuperHyperDefensive SuperHyperStrict Connective Dominating. 6970


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


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

dual SuperHyperDefensive SuperHyperStrict Connective Dominating, then ∀v ∈ V \ S, ∃x ∈ S such that 6986
(i) v ∈ Ns (x); 6987
(ii) vx ∈ E. 6988
Proposition 32.0.33. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph. If S is 6989

a dual SuperHyperDefensive SuperHyperStrict Connective Dominating, then 6990
(i) S is SuperHyperStrict Connective Dominating set; 6991
(ii) there’s S ⊆ S 0 such that |S 0 | is SuperHyperChromatic number. 6992
Proposition 32.0.34. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph. Then 6993
(i) Γ ≤ O; 6994
(ii) Γs ≤ On . 6995
Proposition 32.0.35. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph which is 6996
connected. Then 6997
(i) Γ ≤ O − 1; 6998
(ii) Γs ≤ On − Σ3i=1 σi (x). 6999
Proposition 32.0.36. Let ESHG : (V, E) be an odd SuperHyperPath. Then 7000

(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· ,vn−1 } Σ3i=1 σi (s)}; 7004
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn−1 } and S2 = {v1 , v3 , · · · , vn−1 } are only a dual 7005
Proposition 32.0.37. Let ESHG : (V, E) be an even SuperHyperPath. Then 7007
(i) the set S = {v2 , v4 , · · · .vn } is a dual SuperHyperDefensive SuperHyperStrict Connective 7008
Dominating; 7009
(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · .vn } and {v1 , v3 , · · · .vn−1 }; 7010
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 7011
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 7012
Proposition 32.0.38. Let ESHG : (V, E) be an even SuperHyperStrict Connective Dominating. Then 7014
(i) the SuperHyperSet S = {v2 , v4 , · · · , vn } is a dual SuperHyperDefensive SuperHyperStrict 7015
(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · , vn } and {v1 , v3 , · · · , vn−1 }; 7017
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } σ(s), Σs∈S={v1 ,v3 ,··· ,vn−1 } σ(s)}; 7018
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn } and S2 = {v1 , v3 , · · · , vn−1 } are only dual 7019
Proposition 32.0.39. Let ESHG : (V, E) be an odd SuperHyperStrict Connective Dominating. Then 7021

(iii) Γs = min{Σs∈S={v2 ,v4 ,··· .vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 7025
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn−1 } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 7026
Proposition 32.0.40. Let ESHG : (V, E) be SuperHyperStar. Then 7028
(i) the SuperHyperSet S = {c} is a dual maximal SuperHyperStrict Connective Dominating; 7029
(ii) Γ = 1; 7030
(iii) Γs = Σ3i=1 σi (c); 7031
(iv) the SuperHyperSets S = {c} and S ⊂ S 0 are only dual SuperHyperStrict Connective Dominating. 7032
Proposition 32.0.41. Let ESHG : (V, E) be SuperHyperWheel. Then 7033

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

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

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

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

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

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

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

plete SuperHyperGraphs with common Neutrosophic SuperHyperVertex SuperHyperSet. Then 7071
bnc
Dominating for N SHF : (V, E); 7073
(ii) Γ = b n2 c for N SHF : (V, E); 7074

bnc for N SHF : (V, E); 7075
S={vi }i=1
bnc
2
are only dual maximal SuperHyperStrict Connective Dominating 7076
for N SHF : (V, E). 7077
(i) if s ≥ t and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 7080

SuperHyperStrict Connective Dominating, then S is an s-SuperHyperDefensive SuperHyperStrict 7081

SuperHyperStrict Connective Dominating, then S is a dual s-SuperHyperDefensive SuperHyperStrict 7084
(i) if s ≥ t + 2 and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 7088
SuperHyperStrict Connective Dominating, then S is an s-SuperHyperPowerful SuperHyperStrict 7089


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

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

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

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

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

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

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

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

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


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

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


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

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

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


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

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

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


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

CHAPTER 35 7194
Case 2: The Increasing Neutrosophic 7195
Steps Toward Neutrosophic 7196
SuperHyperMultipartite as 7197
Neutrosophic SuperHyperModel 7198
Step 4. (Neutrosophic Solution) In the Neutrosophic Figure (35.1), the Neutrosophic Super- 7199
HyperMultipartite is Neutrosophic highlighted and Neutrosophic featured. 7200
By using the Neutrosophic Figure (35.1) and the Table (35.1), the Neutrosophic SuperHy- 7201
perMultipartite is obtained. 7202
The obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous 7203
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- 7204

perMultipartite ESHM : (V, E), in the Neutrosophic SuperHyperModel (35.1), is the 7205
Neutrosophic SuperHyperStrict Connective Dominating. 7206

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

CHAPTER 38 7255
Neutrosophic SuperHyperDuality But As 7256
Super Forms 7258
Definition 38.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperDuality). 7259

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

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

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

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

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

Neutrosophic re-SuperHyperDuality, Neutrosophic v-SuperHyperDuality, and Neutro- 7272
sophic rv-SuperHyperDuality. 7273
Definition 38.0.2. ((Neutrosophic) SuperHyperDuality). 7274

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

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

sophic rv-SuperHyperDuality and C(N SHG) for a Neutrosophic SuperHyperGraph 7286
N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic SuperHy- 7287
perEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive 7288
Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they 7289
form the Neutrosophic SuperHyperDuality; 7290
(iii) an Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of Neut- 7291
rosophic e-SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic v- 7292

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

SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for a Neut- 7302
rosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 7303
imum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic 7305
SuperHyperDuality; and the Neutrosophic power is corresponded to its Neutrosophic 7308
coefficient; 7309
(v) an Extreme R-SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 7310

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

SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic v-SuperHyperDuality,7318
and Neutrosophic rv-SuperHyperDuality and C(N SHG) for a Neutrosophic SuperHyper- 7319
Graph N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic 7320
SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 7321
consecutive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such 7322
that they form the Neutrosophic SuperHyperDuality; 7323
(vii) an Extreme R-SuperHyperDuality SuperHyperPolynomial if it’s either of 7324

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

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

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

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

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

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7346
E1 and E3 are some empty Extreme SuperHyperEdges but E2 is a loop Neutrosophic 7347
SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of 7348
Neutrosophic SuperHyperNeighbor, there’s only one Neutrosophic SuperHyperEdge, 7349
namely, E4 . The Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means 7350
that there’s no Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. 7351
Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in every given Neutrosophic 7352
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 7356
SuperHyperEdge. Thus in the terms of Neutrosophic SuperHyperNeighbor, there’s only 7357
one Neutrosophic SuperHyperEdge, namely, E4 . The Neutrosophic SuperHyperVertex, V3 7358
is Neutrosophic isolated means that there’s no Neutrosophic SuperHyperEdge has it as 7359
a Neutrosophic endpoint. Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in 7360

every given Neutrosophic SuperHyperDuality. 7361




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

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


the Neutrosophic SuperHyperDuality. 7432
Then 7434
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 7435
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL


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

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

(V, E). Then 7455

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


Then there’s at least one SuperHyperDuality. Thus the notion of quasi isn’t up and 7461
the SuperHyperNotions based on SuperHyperDuality could be applied. There are only z 0 7462
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. 7474
Proposition 38.0.14. Assume a connected Neutrosophic SuperHyperWheel ESHW : (V, E). 7475
Then, 7476
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 7477
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 7478


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

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

CHAPTER 39 7491
Neutrosophic SuperHyperJoin But As 7492
Super Forms 7494
Definition 39.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperJoin). 7495

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

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

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

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

Neutrosophic re-SuperHyperJoin, Neutrosophic v-SuperHyperJoin, and Neutrosophic 7510
rv-SuperHyperJoin. 7511
Definition 39.0.2. ((Neutrosophic) SuperHyperJoin). 7512

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

375

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

rv-SuperHyperJoin and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7524
Neutrosophic SuperHyperJoin; 7528
(iii) an Extreme SuperHyperJoin SuperHyperPolynomial if it’s either of Neutrosophic 7529

e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic v-SuperHyperJoin, 7530
and Neutrosophic rv-SuperHyperJoin and C(N SHG) for an Extreme SuperHyperGraph 7531
Extreme SuperHyperJoin; and the Extreme power is corresponded to its Extreme 7536
coefficient; 7537
(iv) a Neutrosophic SuperHyperJoin SuperHyperPolynomial if it’s either of 7538

Neutrosophic e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic v- 7539
SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for a Neutrosophic 7540
S of high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and 7544

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

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

rv-SuperHyperJoin and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7556
Neutrosophic SuperHyperJoin; 7560

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

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

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

SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for a Neutrosophic 7572

the Neutrosophic coefficients defined as the Neutrosophic number of the maximum 7574
Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic 7575
SuperHyperJoin; and the Neutrosophic power is corresponded to its Neutrosophic 7578
coefficient. 7579
SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7583

E1 and E3 are some empty Neutrosophic SuperHyperEdges but E2 is a loop Neutrosophic 7584

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




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


SuperHyperModel (31.1), is the SuperHyperJoin. 7649

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

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

Neutrosophic SuperHyperModel (31.2), is the Neutrosophic SuperHyperJoin. 7658
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 7660


the Neutrosophic SuperHyperJoin. 7669
Then 7671
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 7672
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 7678
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperJoin taken from a connected Neutrosophic SuperHyperBipartite 7680

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL


(V, E). Then 7691

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

is a longest SuperHyperJoin taken from a connected Neutrosophic SuperHyperMultipartite 7693


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

Then, 7711

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

.
Proof. Let 7712
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3
is a longest SuperHyperJoin taken from a connected Neutrosophic SuperHyperWheel ESHW : 7713


at least one SuperHyperJoin. Thus the notion of quasi isn’t up and the SuperHyperNotions based 7717
on SuperHyperJoin could be applied. The unique embedded SuperHyperJoin proposes some 7718
longest SuperHyperJoin excerpt from some representatives. The latter is straightforward. 7719
SuperHyperModel (31.6), is the Neutrosophic SuperHyperJoin. 7724

CHAPTER 40 7725
Neutrosophic SuperHyperPerfect But As 7726
Super Forms 7728
Definition 40.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperPerfect). 7729

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

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

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

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

Vi , Vj ∈ Ea ; and |Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; 7740
(v) Neutrosophic SuperHyperPerfect if it’s either of Neutrosophic e-SuperHyperPerfect, 7741

Neutrosophic re-SuperHyperPerfect, Neutrosophic v-SuperHyperPerfect, and Neutrosophic 7742
rv-SuperHyperPerfect. 7743
Definition 40.0.2. ((Neutrosophic) SuperHyperPerfect). 7744

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

rv-SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 7749
389
(ii) a Neutrosophic SuperHyperPerfect if it’s either of Neutrosophic e-SuperHyperPerfect, 7754

rv-SuperHyperPerfect and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : 7756
(V, E) is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges 7757
of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive 7758
Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they 7759
form the Neutrosophic SuperHyperPerfect; 7760
(iii) an Extreme SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7761

rosophic e-SuperHyperPerfect, Neutrosophic re-SuperHyperPerfect, Neutrosophic v- 7762
SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for an Ex- 7763
ality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme 7766
(iv) a Neutrosophic SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7770

SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for a Neut- 7772
imum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic 7775
SuperHyperPerfect; and the Neutrosophic power is corresponded to its Neutrosophic 7778
coefficient; 7779
(v) an Extreme R-SuperHyperPerfect if it’s either of Neutrosophic e-SuperHyperPerfect, 7780

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

SuperHyperPerfect, Neutrosophic re-SuperHyperPerfect, Neutrosophic v-SuperHyperPerfect,7788
and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for a Neutrosophic SuperHyper- 7789
Graph N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic 7790
SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 7791
consecutive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such 7792
that they form the Neutrosophic SuperHyperPerfect; 7793
(vii) an Extreme R-SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7794

SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for an Ex- 7796

ality of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme 7799
(viii) a Neutrosophic SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7803

SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for a Neut- 7805

SuperHyperPerfect; and the Neutrosophic power is corresponded to its Neutrosophic 7811
coefficient. 7812

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7816

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





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

SuperHyperModel (31.1), is the SuperHyperPerfect. 7882
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 7884
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3

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

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



the Neutrosophic SuperHyperPerfect. 7902
Then 7904
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 7905
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 7909
there’s no at least one SuperHyperPerfect. Thus the notion of quasi may be up but the 7910
SuperHyperNotions based on SuperHyperPerfect could be applied. There are only two 7911
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperPerfect taken from a connected Neutrosophic SuperHyperBipartite 7914

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL

(V, E). Then 7925

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



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

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

is a longest SuperHyperPerfect taken from a connected Neutrosophic SuperHyperWheel 7948


ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is straightforward. Then there’s 7951
at least one SuperHyperPerfect. Thus the notion of quasi isn’t up and the SuperHyperNotions 7952
based on SuperHyperPerfect could be applied. The unique embedded SuperHyperPerfect 7953
proposes some longest SuperHyperPerfect excerpt from some representatives. The latter is 7954
SuperHyperModel (31.6), is the Neutrosophic SuperHyperPerfect. 7960

CHAPTER 41 7961
Neutrosophic SuperHyperTotal But As 7962
Super Forms 7964
Definition 41.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperTotal). 7965

(i) Neutrosophic e-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that 7969

Va ∈ Ei , Ej ; 7970
(ii) Neutrosophic re-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that 7971

Va ∈ Ei , Ej ; and |Ei |NEUTROSOPHIC CARDINALITY = |Ej |NEUTROSOPHIC CARDINALITY ; 7972
(iii) Neutrosophic v-SuperHyperTotal if ∀Vi ∈ VESHG:(V,E) , ∃!Vj ∈ V 0 , such that 7973

Vi , Vj ∈ Ea ; 7974
(iv) Neutrosophic rv-SuperHyperTotal if ∀Vi ∈ VESHG:(V,E) , ∃!Vj ∈ V 0 , such that 7975

Vi , Vj ∈ Ea ; and |Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; 7976
(v) Neutrosophic SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 7977

Neutrosophic re-SuperHyperTotal, Neutrosophic v-SuperHyperTotal, and Neutrosophic 7978
rv-SuperHyperTotal. 7979
Definition 41.0.2. ((Neutrosophic) SuperHyperTotal). 7980

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

rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 7985
Extreme SuperHyperTotal; 7989
403
(ii) a Neutrosophic SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 7990

rv-SuperHyperTotal and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7992
Neutrosophic SuperHyperTotal; 7996
(iii) an Extreme SuperHyperTotal SuperHyperPolynomial if it’s either of Neutrosophic 7997
e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v-SuperHyperTotal, 7998

and Neutrosophic rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph 7999
Extreme SuperHyperTotal; and the Extreme power is corresponded to its Extreme 8004
coefficient; 8005
(iv) a Neutrosophic SuperHyperTotal SuperHyperPolynomial if it’s either of 8006
Neutrosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v- 8007

SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for a Neutro- 8008
contains the Neutrosophic coefficients defined as the Neutrosophic number of the maximum 8010
Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHy- 8011
perSet S of high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and 8012
Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperTotal; 8013
and the Neutrosophic power is corresponded to its Neutrosophic coefficient; 8014
(v) an Extreme R-SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 8015

rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 8017
Extreme SuperHyperTotal; 8021
(vi) a Neutrosophic R-SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 8022

rv-SuperHyperTotal and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 8024
Neutrosophic SuperHyperTotal; 8028
(vii) an Extreme R-SuperHyperTotal SuperHyperPolynomial if it’s either of Neut- 8029

rosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v- 8030
SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for an Extreme 8031

that they form the Extreme SuperHyperTotal; and the Extreme power is corresponded to 8036
its Extreme coefficient; 8037
(viii) a Neutrosophic SuperHyperTotal SuperHyperPolynomial if it’s either of 8038
Neutrosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v- 8039

SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for a Neutro- 8040
contains the Neutrosophic coefficients defined as the Neutrosophic number of the maximum 8042
Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic Supe- 8043
rHyperSet S of high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges 8044
and Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyper- 8045
Total; and the Neutrosophic power is corresponded to its Neutrosophic coefficient. 8046

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 8050

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




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

SuperHyperModel (31.1), is the SuperHyperTotal. 8116
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 8118
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. 8125
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 8127


the Neutrosophic SuperHyperTotal. 8136
Then 8138
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 8139
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

based on SuperHyperTotal could be applied. There are only two SuperHyperParts. Thus every 8145
P :

V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperTotal taken from a connected Neutrosophic SuperHyperBipartite 8147

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
(V, E). Then 8158

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

is a longest SuperHyperTotal taken from a connected Neutrosophic SuperHyperMultipartite 8160


based on SuperHyperTotal could be applied. There are only z 0 SuperHyperParts. Thus every 8165
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. 8176
Then, 8178
∗
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 8179
P : ViEXT ERN AL , Ei∗ , CEN T ER, Ej .
is a longest SuperHyperTotal taken from a connected Neutrosophic SuperHyperWheel ESHW : 8180


at least one SuperHyperTotal. Thus the notion of quasi isn’t up and the SuperHyperNotions 8184
based on SuperHyperTotal could be applied. The unique embedded SuperHyperTotal 8185
proposes some longest SuperHyperTotal excerpt from some representatives. The latter is 8186
SuperHyperModel (31.6), is the Neutrosophic SuperHyperTotal. 8192

CHAPTER 42 8193
Neutrosophic SuperHyperConnected But 8194
As The Extensions Excerpt From Dense 8195
And Super Forms 8196
Definition 42.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperConnected). 8197

(i) Neutrosophic e-SuperHyperConnected if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such 8201
that Va ∈ Ei , Ej ; and ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; 8202
(ii) Neutrosophic re-SuperHyperConnected if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ 8203

E 0 , such that Va ∈ Ei , Ej ; ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; and 8204
|Ei |NEUTROSOPHIC CARDINALITY = |Ej |NEUTROSOPHIC CARDINALITY ; 8205
(iii) Neutrosophic v-SuperHyperConnected if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such 8206

that Vi , Vj 6∈ Ea ; and ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; 8207
(iv) Neutrosophic rv-SuperHyperConnected if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ 8208

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

8211
Neutrosophic re-SuperHyperConnected, Neutrosophic v-SuperHyperConnected, and Neut- 8212
rosophic rv-SuperHyperConnected. 8213
Definition 42.0.2. ((Neutrosophic) SuperHyperConnected). 8214

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

8217
Neutrosophic re-SuperHyperConnected, Neutrosophic v-SuperHyperConnected, and Neut- 8218
rosophic rv-SuperHyperConnected and C(N SHG) for an Extreme SuperHyperGraph 8219
N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of 8220
417
high Extreme cardinality of the Extreme SuperHyperEdges in the consecutive Extreme 8221
sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 8222
form the Extreme SuperHyperConnected; 8223
(ii) a Neutrosophic SuperHyperConnected if it’s either of Neutrosophic e- 8224

SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neutrosophic v- 8225
SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) 8226
for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic car- 8227
dinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of high 8228
Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and Neutrosophic 8229

SuperHyperVertices such that they form the Neutrosophic SuperHyperConnected; 8230
(iii) an Extreme SuperHyperConnected SuperHyperPolynomial if it’s either of Neut- 8231
rosophic e-SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neutrosophic 8232

v-SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) for 8233
an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial 8234
contains the Extreme coefficients defined as the Extreme number of the maximum Extreme 8235
(iv) a Neutrosophic SuperHyperConnected SuperHyperPolynomial if it’s either of 8240

Neutrosophic e-SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neut- 8241
rosophic v-SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and 8242
C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic 8243
SuperHyperPolynomial contains the Neutrosophic coefficients defined as the Neutrosophic 8244
number of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges 8245
of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive Neutro- 8246

sophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the 8247
Neutrosophic SuperHyperConnected; and the Neutrosophic power is corresponded to its 8248
Neutrosophic coefficient; 8249
(v) an Extreme R-SuperHyperConnected if it’s either of Neutrosophic e- 8250

SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) 8252
for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme cardinality 8253
of an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme SuperHyper- 8254
Vertices in the consecutive Extreme sequence of Extreme SuperHyperEdges and Extreme 8255
SuperHyperVertices such that they form the Extreme SuperHyperConnected; 8256
(vi) a Neutrosophic R-SuperHyperConnected if it’s either of Neutrosophic e- 8257

SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) for a 8259
Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic cardinality 8260
of the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S of high 8261
Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and Neutrosophic 8262
SuperHyperVertices such that they form the Neutrosophic SuperHyperConnected; 8263

(vii) an Extreme R-SuperHyperConnected SuperHyperPolynomial if it’s either of 8264

C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme Super- 8267
HyperPolynomial contains the Extreme coefficients defined as the Extreme number of 8268

and the Extreme power is corresponded to its Extreme coefficient; 8272
(viii) a Neutrosophic SuperHyperConnected SuperHyperPolynomial if it’s either of 8273

C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic 8276
SuperHyperPolynomial contains the Neutrosophic coefficients defined as the Neutrosophic 8277
number of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices 8278
of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive Neutro- 8279

sophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the 8280
Neutrosophic SuperHyperConnected; and the Neutrosophic power is corresponded to its 8281
• On the Figure (30.1), the Neutrosophic SuperHyperNotion, namely, Neutrosophic Super- 8285
HyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 8286
SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of Neutro- 8288
sophic SuperHyperNeighbor, there’s only one Neutrosophic SuperHyperEdge, namely, E4 . 8289

The Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means that there’s no 8290
Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. Thus the Neutrosophic 8291
SuperHyperVertex, V3 , is excluded in every given Neutrosophic SuperHyperConnected. 8292
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. 8300


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 8344
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. 8351
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 8353
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. 8360
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 8362



the Neutrosophic SuperHyperConnected. 8371
Then 8373
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 8374
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 8379
SuperHyperNotions based on SuperHyperConnected could be applied. There are only two 8380
P :

V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperConnected taken from a connected Neutrosophic SuperHyperBipartite 8383

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
(V, E). Then 8394
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 8395
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

is a longest SuperHyperConnected taken from a connected Neutrosophic SuperHyperMultipartite 8396


there’s no at least one SuperHyperConnected. Thus the notion of quasi may be up but 8400
the SuperHyperNotions based on SuperHyperConnected could be applied. There are only 8401
z 0 SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as the 8402
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. 8413
Then, 8415
∗
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 8416
P : V EXT ERN AL i , E ∗ i , CEN T ER, Ej .

is a longest SuperHyperConnected taken from a connected Neutrosophic SuperHyperWheel 8417


to ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is straightforward. 8420
Then there’s at least one SuperHyperConnected. Thus the notion of quasi isn’t up and 8421
the SuperHyperNotions based on SuperHyperConnected could be applied. The unique 8422
embedded SuperHyperConnected proposes some longest SuperHyperConnected excerpt from 8423
some representatives. The latter is straightforward. 8424
SuperHyperModel (31.6), is the Neutrosophic SuperHyperConnected. 8429

CHAPTER 43 8430
Background 8431
431










“Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic) SuperHyperMod- 8556

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

Henry Garrett (2022), “Basic Neutrosophic Notions Concerning SuperHyperDominating and 8558
Neutrosophic SuperHyperResolving in SuperHyperGraph” in Ref. [HG37] by Henry Garrett 8559
(2022), “Initial Material of Neutrosophic Preliminaries to Study Some Neutrosophic Notions 8560
Based on Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic SuperHyperGraph (NSHG)” 8561
in Ref. [HG38] by Henry Garrett (2022), and [HG44s; HG55s; HG4; HG5; HG6; HG7; 8562
HG281; HG282; HG283; HG284; HG285], there are some endeavors to formalize the basic 8583
SuperHyperNotions about neutrosophic SuperHyperGraph and SuperHyperGraph alongside 8584
scientific research books at [HG60b; HG61b; HG62b; HG63b; HG64b; HG65b; HG66b; 8585


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

HG278; HG279; HG280; HG281; HG282; HG283; HG284; HG285] alongside scientific 8638
research books at [HG60b; HG61b; HG62b; HG63b; HG64b; HG65b; HG66b; HG67b; 8639



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

Bibliography 8656
10.33140/JMTCM.01.03.09) 8679
437



10.20944/preprints202301.0282.v1). 8695

10.20944/preprints202301.0267.v1). 8698

(doi: 10.20944/preprints202301.0265.v1). 8703
prints202301.0262.v1). 8707
2023010224, (doi: 10.20944/preprints202301.0224.v1). 8713

prints202301.0105.v1). 8716

Preprints 2023, 2023010044 8722
10.20944/preprints202301.0043.v1). 8725

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

(doi: 10.20944/preprints202212.0500.v1). 8741
(doi: 10.5281/zenodo.8072171). 8750

2023, (doi: 10.5281/zenodo.8072267). 8753
10.5281/zenodo.8067384). 8756
2023, (doi: 10.5281/zenodo.8067409). 8759
10.5281/zenodo.8061927). 8762

10.5281/zenodo.8062016). 8765
10.5281/zenodo.8057696). 8768
2023, (doi: 10.5281/zenodo.8057753). 8771
10.5281/zenodo.8052893). 8774
2023, (doi: 10.5281/zenodo.8052925). 8777
10.5281/zenodo.8051346). 8780
10.5281/zenodo.8051360). 8783
10.5281/zenodo.8025707). 8786
10.5281/zenodo.8027275). 8789
odo.8017246). 8792
10.5281/zenodo.8020128). 8795
odo.7978571). 8798
10.5281/zenodo.7978857). 8801

10.5281/zenodo.7940830). 8804
10.5281/zenodo.7943578). 8807
odo.7916595). 8810
odo.7923632). 8813
(doi: 10.5281/zenodo.7904698). 8816
2023, (doi: 10.5281/zenodo.7904671). 8819
10.5281/zenodo.7871026). 8828
2023, (doi: 10.5281/zenodo.7874647). 8831
10.5281/zenodo.7857856). 8834
2023, (doi: 10.5281/zenodo.7857841). 8837

10.5281/zenodo.7853867). 8846
10.5281/zenodo.7853922). 8849
(doi: 10.5281/zenodo.7851519). 8852
(doi: 10.5281/zenodo.7851550). 8855
10.5281/zenodo.7834229). 8864
10.5281/zenodo.7834261). 8867
10.5281/zenodo.7824560). 8870
(doi: 10.5281/zenodo.7824623). 8873

2023, (doi: 10.5281/zenodo.7809365). 8884
2023, (doi: 10.5281/zenodo.7809358). 8887

10.5281/zenodo.7809219). 8890
10.5281/zenodo.7809328). 8893
2023, (doi: 10.5281/zenodo.7806767). 8896

2023, (doi: 10.5281/zenodo.7806838). 8899
10.5281/zenodo.7799902). 8908
(doi: 10.5281/zenodo.7804218). 8911
(doi: 10.5281/zenodo.7796334). 8914

10.5281/zenodo.7791952). 8920
10.5281/zenodo.7791982). 8923
10.5281/zenodo.7790026). 8926
10.5281/zenodo.7790052). 8929
2023, (doi: 10.5281/zenodo.7787066). 8932
10.5281/zenodo.7781476). 8938
10.5281/zenodo.7783082). 8941
10.5281/zenodo.7777857). 8944
10.5281/zenodo.7779286). 8947
(doi: 10.5281/zenodo.7771831). 8950
2023, (doi: 10.5281/zenodo.7772468). 8953
10.13140/RG.2.2.20913.25446). 8956

odo.7764916). 8959
10.13140/RG.2.2.11770.98247). 8962
10.13140/RG.2.2.12400.12808). 8965
2023, (doi: 10.13140/RG.2.2.22545.10089). 8968
10.13140/RG.2.2.11377.76644). 8974
10.13140/RG.2.2.23750.96329). 8977
10.13140/RG.2.2.31366.24641). 8980
10.13140/RG.2.2.34721.68960). 8983
2023, (doi: 10.13140/RG.2.2.30212.81289). 8986
10.13140/RG.2.2.24288.35842). 8992
10.13140/RG.2.2.32467.25124). 8995

10.13140/RG.2.2.31025.45925). 8998
10.13140/RG.2.2.17184.25602). 9001
10.13140/RG.2.2.23423.28327). 9004
10.13140/RG.2.2.28456.44805). 9007
10.13140/RG.2.2.23525.68320). 9010
10.13140/RG.2.2.20170.24000). 9013
10.13140/RG.2.2.36475.59683). 9016
10.13140/RG.2.2.29764.71046). 9019
2023, (doi: 10.13140/RG.2.2.18780.87683). 9022
10.13140/RG.2.2.26134.01603). 9028
10.13140/RG.2.2.27392.30721). 9031
10.13140/RG.2.2.33028.40321). 9034

10.13140/RG.2.2.21389.20966). 9037
10.13140/RG.2.2.16356.04489). 9040
10.13140/RG.2.2.21756.21129). 9043
10.13140/RG.2.2.30983.68009). 9046
10.13140/RG.2.2.28552.29445). 9049
(doi: 10.13140/RG.2.2.10936.21761). 9052
10.13140/RG.2.2.35105.89447). 9055
(doi: 10.13140/RG.2.2.30072.72960). 9058
10.13140/RG.2.2.31147.52003). 9061
10.13140/RG.2.2.32825.24163). 9064
10.13140/RG.2.2.13059.58401). 9067
10.13140/RG.2.2.11172.14720). 9070
2023, (doi: 10.13140/RG.2.2.22011.80165). 9073

ate 2023, (doi: 10.13140/RG.2.2.30819.84003). 9076
2023, (doi: 10.13140/RG.2.2.10493.84962). 9079
ate 2023, (doi: 10.13140/RG.2.2.13849.29280). 9082
2023, (doi: 10.13140/RG.2.2.19944.14086). 9085
ate 2023, (doi: 10.13140/RG.2.2.23299.58404). 9088
(doi: 10.13140/RG.2.2.33103.76968). 9091
(doi: 10.13140/RG.2.2.23037.44003). 9094
(doi: 10.13140/RG.2.2.35646.56641). 9097
10.13140/RG.2.2.18030.48967). 9100
(doi: 10.13140/RG.2.2.13973.81121). 9103
2023, (doi: 10.13140/RG.2.2.34106.47047). 9106
2023, (doi: 10.13140/RG.2.2.31956.88961). 9112

2023, (doi: 10.13140/RG.2.2.15179.67361). 9115
10.13140/RG.2.2.21510.45125). 9118
2023, (doi: 10.13140/RG.2.2.13121.84321). 9121
10.13140/RG.2.2.11758.69441). 9124
2023, (doi: 10.13140/RG.2.2.31891.35367). 9127
10.13140/RG.2.2.19360.87048). 9130
10.13140/RG.2.2.32363.21286). 9133
10.13140/RG.2.2.23266.81602). 9136
10.13140/RG.2.2.19911.37285). 9139
10.13140/RG.2.2.11050.90569). 9142
2023, (doi: 10.13140/RG.2.2.17761.79206). 9145
ate 2023, (doi: 10.13140/RG.2.2.33275.80161). 9151

(doi: 10.13140/RG.2.2.30182.50241). 9154
2023, (doi: 10.13140/RG.2.2.17252.24968). 9187


2023010396 (doi: 10.20944/preprints202301.0396.v1). 9196

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




2023,(doi: 10.13140/RG.2.2.36745.93289). 9213
10.20944/preprints202301.0282.v1). 9220
10.20944/preprints202301.0267.v1).). 9223
(doi: 10.20944/preprints202301.0265.v1). 9228

prints202301.0262.v1). 9232

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

10.13140/RG.2.2.35061.65767). 9241

10.13140/RG.2.2.18494.15680). 9245
10.13140/RG.2.2.32530.73922). 9249

10.13140/RG.2.2.15897.70243). 9253
10.13140/RG.2.2.32530.73922). 9257

prints202301.0105.v1). 9260
10.13140/RG.2.2.23172.19849). 9267

10.13140/RG.2.2.17385.36968). 9277
Preprints 2023, 2023010044 9280
10.20944/preprints202301.0043.v1). 9283
2023, (doi: 10.13140/RG.2.2.28945.92007). 9286
10.13140/RG.2.2.35774.77123). 9292

10.13140/RG.2.2.29430.88642). 9298
(doi: 10.20944/preprints202212.0549.v1). 9304

10.13140/RG.2.2.19380.94084). 9307
(doi: 10.20944/preprints202212.0500.v1). 9318
10.13140/RG.2.2.20993.12640). 9321


10.13140/RG.2.2.29173.86244). 9336

2023 (doi: 10.5281/zenodo.8067469). 9343

(doi: 10.5281/zenodo.8062076). 9345
2023 (doi: 10.5281/zenodo.8052976). 9349
(doi: 10.5281/zenodo.8051368). 9351
(doi: 10.5281/zenodo.8027488). 9353
10.5281/zenodo.8020181). 9355
10.5281/zenodo.7978921). 9357
odo.7943878). 9359
10.5281/zenodo.7943871). 9361
10.5281/zenodo.7923786). 9363
2023 (doi: 10.5281/zenodo.7905287). 9365
2023 (doi: 10.5281/zenodo.7874677). 9369
(doi: 10.5281/zenodo.7857906). 9371
2023 (doi: 10.5281/zenodo.7856329). 9373
10.5281/zenodo.7854561). 9375
2023 (doi: 10.5281/zenodo.7851893). 9377

(doi: 10.5281/zenodo.7835063). 9381
(doi: 10.5281/zenodo.7826705). 9383
2023 (doi: 10.5281/zenodo.7820680). 9385
10.5281/zenodo.7812750). 9387


2023 (doi: 10.5281/zenodo.7807782). 9393
2023 (doi: 10.5281/zenodo.7804449). 9395
(doi: 10.5281/zenodo.7792307). 9399
(doi: 10.5281/zenodo.7790728). 9401
2023 (doi: 10.5281/zenodo.7787712). 9403
10.5281/zenodo.7783791). 9405
10.5281/zenodo.7780123). 9407
(doi: 10.5281/zenodo.7773119). 9409
odo.7637762). 9411
10.5281/zenodo.7766174). 9413
10.5281/zenodo.7762232). 9415

(doi: 10.5281/zenodo.7758601). 9417
10.5281/zenodo.7754661). 9419
10.5281/zenodo.7750995) . 9421
(doi: 10.5281/zenodo.7749875). 9423
10.5281/zenodo.7747236). 9425
10.5281/zenodo.7742587). 9427
(doi: 10.5281/zenodo.7738635). 9429
10.5281/zenodo.7734719). 9431
10.5281/zenodo.7730484). 9433
(doi: 10.5281/zenodo.7730469). 9435
10.5281/zenodo.7722865). 9437
odo.7713563). 9439
odo.7709116). 9441
10.5281/zenodo.7706415). 9443
10.5281/zenodo.7706063). 9445
10.5281/zenodo.7701906). 9447
odo.7700205). 9449
10.5281/zenodo.7694876). 9451

10.5281/zenodo.7679410). 9453
10.5281/zenodo.7675982). 9455
10.5281/zenodo.7672388). 9457
odo.7668648). 9459
10.5281/zenodo.7662810). 9461
10.5281/zenodo.7659162). 9463
odo.7653233). 9465
odo.7653204). 9467
odo.7653142). 9469
odo.7653117). 9471
odo.7651687). 9474
odo.7651619). 9476
odo.7651439). 9478
odo.7650729). 9480
odo.7647868). 9482
odo.7647017). 9484
odo.7644894). 9486

odo.7632923). 9489
odo.7623459). 9491
10.5281/zenodo.7606416). 9493
10.5281/zenodo.7606416). 9495
odo.7606404). 9497
10.5281/zenodo.7580018). 9499
odo.7580018). 9501
odo.7580018). 9503
odo.7579929). 9505
10.5281/zenodo.7563170). 9507
odo.7563164). 9509
odo.7563160). 9511
odo.7563160). 9513
10.5281/zenodo.7563160). 9515
10.5281/zenodo.7557063). 9517
10.5281/zenodo.7557009). 9519
10.5281/zenodo.7539484). 9521

10.5281/zenodo.7523390). 9523
10.5281/zenodo.7523390). 9525
10.5281/zenodo.7523390). 9527
odo.7574952). 9529
10.5281/zenodo.7574992). 9531
odo.7523357). 9533
10.5281/zenodo.7523357). 9535
10.5281/zenodo.7504782). 9537
10.5281/zenodo.7504782). 9539
10.5281/zenodo.7504782). 9541
10.5281/zenodo.7499395). 9543
odo.7499395). 9545
10.5281/zenodo.7499395). 9547
10.5281/zenodo.7497450). 9549
10.5281/zenodo.7497450). 9551
10.5281/zenodo.7494862). 9553
odo.7494862). 9555
10.5281/zenodo.7494862). 9557

10.5281/zenodo.7493845). 9559
odo.7493845). 9561
10.5281/zenodo.7493845). 9563
odo.7539484). 9565
odo.7523390). 9567
odo.7523357). 9569
odo.7504782). 9571
odo.7499395). 9573
odo.7497450). 9575
odo.7494862). 9577
odo.7493845). 9579
odo.7480110). 9581
odo.7378758). 9583
odo.6320305). 9585
odo.6677173). 9587

CHAPTER 44 9588
Books’ Contributions 9589
“Books’ Contributions”: | Featured Threads 9590

The following references are cited by chapters. 9591
9592
[Ref286] 9593
Henry Garrett, “New Ideas On Super Con By Hyper Conceit Of Strict Connective Domin- 9594
ating In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 9595
10.5281/zenodo.8076399). 9596
9597
[Ref287] 9598
Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph 9599
10.5281/zenodo.8076416). 9601
9602
The links to the contributions of this scientific research book are listed below. 9603
[HG286] 9604
10.5281/zenodo.8076399). 9607
9608
[TITLE] “New Ideas On Super Con By Hyper Conceit Of Strict Connective Dominat- 9609
ing In Recognition of Cancer With (Neutrosophic) SuperHyperGraph” 9610

9611
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ResearchGate”] 9612
https://www.researchgate.net/publication/371807572 9613
9614
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “Scribd”:] 9615
https://www.scribd.com/document/655028879 9616
9617
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ZENODO_ORG”:] 9618
https://zenodo.org/record/8076399 9619
9620
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “academia”:] 9621
https://www.academia.edu/103780932 9622
463
Figure 44.1: [HG286] Henry Garrett, “New Ideas On Super Con By Hyper Conceit Of Strict
Connective Dominating In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”,
Zenodo 2023, (doi: 10.5281/zenodo.8076399).
9623
[ADDRESSED CITATION] 9624
10.5281/zenodo.8076399). 9627
[ASSIGNED NUMBER] #286 Article 9628
[DATE] June 2023 9629

[DOI] 10.5281/zenodo.8076399 9630
[LICENSE] CC BY-NC-ND 4.0 9631
[PROJECT] Neutrosophic SuperHyperGraphs and SuperHyperGraphs 9632
[AVAILABLE AT TWITTER’S IDS] WordPress ResearchGate Scribd academia ZEN- 9633
ODO_ORG Twitter facebook LinkedIn Amazon googlebooks GooglePlay 9634
9635
[HG287] 9636
10.5281/zenodo.8076416). 9639
9640
[TITLE] “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph By 9641

Strict Connective Dominating As Hyper Conceit On Super Con” 9642
9643
https://www.researchgate.net/publication/371807675 9645
9646
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “Scribd”:] 9647


Figure 44.4: [HG287] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic
SuperHyperGraph By Strict Connective Dominating As Hyper Conceit On Super Con”, Zenodo
2023, (doi: 10.5281/zenodo.8076416).
https://www.scribd.com/document/655029841 9648
9649
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ZENODO_ORG”:] 9650
9652
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “academia”:] 9653
https://www.academia.edu/103781164 9654
9655
10.5281/zenodo.8076416). 9659
[ASSIGNED NUMBER] #287 Article 9660
[DATE] June 2023 9661
[DOI] 10.5281/zenodo.8076416 9662
[LICENSE] CC BY-NC-ND 4.0 9663

[PROJECT] Neutrosophic SuperHyperGraphs and SuperHyperGraphs 9664
[AVAILABLE AT TWITTER’S IDS] 9665
WordPress ResearchGate Scribd academia ZENODO_ORG Twitter facebook LinkedIn Amazon 9666
googlebooks GooglePlay 9667
9668
[ASSIGNED NUMBER] | Book #183 9669

HG183b
Henry Garrett, “Strict Connective Dominating In SuperHyperGraphs”. Dr. Henry Garrett, 9671
2023 (doi: 10.5281/zenodo.8076449). 9672

2023, (doi: 10.5281/zenodo.8076416).
2023, (doi: 10.5281/zenodo.8076416).

[TITLE] Strict Connective Dominating In SuperHyperGraphs 9673

#Latest_Updates 9674
#The_Links 9675
9679
9681
#The_Links 9682
9683
[ASSIGNED NUMBER] | Book #183 9684

9685
[TITLE] Strict Connective Dominating In SuperHyperGraphs 9686
9687
9691
– 9692
9693
[PUBLISHER] 9694
(Paperback): https://www.amazon.com/dp/- 9695
(Hardcover): https://www.amazon.com/dp/- 9696

(Kindle Edition): https://www.amazon.com/dp/- 9697
9698
– 9699
9700
[ISBN] 9701
(Paperback): - 9702
(Hardcover): - 9703
(Kindle Edition): CC BY-NC-ND 4.0 9704
(EBook): CC BY-NC-ND 4.0 9705
9706
– 9707
9708
[PRINT LENGTH] 9709
(Paperback): - pages 9710
(Hardcover): - pages 9711
(Kindle Edition): - pages 9712
(E-Book): - pages 9713
9714
– 9715
9716
9718

#The_Links 9719
9720
https://www.researchgate.net/publication/- 9722
9723
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “WordPress”] 9724
https://drhenrygarrett.wordpress.com/2023/07/22/ 9725
Strict-Connective-Dominating-In-SuperHyperGraphs/ 9726
9727
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “Scribd”] 9728
https://www.scribd.com/document/- 9729
9730
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “academia”] 9731
https://www.academia.edu/- 9732
9733
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ZENODO_ORG”] 9734
9736
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “googlebooks”] 9737
https://books.google.com/books/about?id=- 9738
9739
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “GooglePlay”] 9740
https://play.google.com/store/books/details?id=- 9741

[TITLE] Strict Connective Dominating In SuperHyperGraphs (Published Version) 9742

9743
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “WordPress”] 9744
9745
https://drhenrygarrett.wordpress.com/2023/07/22/ 9746
Strict-Connective-Dominating-In-SuperHyperGraphs/ 9747
9748
– 9749
9750
[POSTED BY] Dr. Henry Garrett 9751
9752
[DATE] June 023, 2023 9753

9754
[POSTED IN] 183 | Strict Connective Dominating In SuperHyperGraphs 9755
9756
[TAGS] 9757
Applications, Applied Mathematics, Applied Research, Cancer, Cancer’s Recognitions, Combin- 9758
atorics, Edge, Edges, Graph Theory, Graphs, Latest Research, Literature Reviews, Modeling, 9759
Neutrosophic Graph, Neutrosophic Graph Theory, Neutrosophic Science, Neutrosophic Su- 9760
perHyperClasses, Neutrosophic SuperHyperGraph, Neutrosophic SuperHyperGraph Theory, 9761
neutrosophic SuperHyperGraphs, Neutrosophic Strict Connective Dominating In SuperHyper- 9762
Graphs, Open Problems, Open Questions, Problems, Pure Math, Pure Mathematics, Questions, 9763
Real-World Applications, Recent Research, Recognitions, Research, scientific research Article, 9764
scientific research Articles, scientific research Book, scientific research Chapter, scientific 9765
research Chapters, Review, SuperHyperClasses, SuperHyperEdges, SuperHyperGraph, Super- 9766

HyperGraph Theory, SuperHyperGraphs, Strict Connective Dominating In SuperHyperGraphs, 9767
SuperHyperModeling, SuperHyperVertices, Theoretical Research, Vertex, Vertices. 9768
In this scientific research book, there are some scientific research chapters on “Extreme Strict 9769
Connective Dominating In SuperHyperGraphs” and “Neutrosophic Strict Connective Dominat- 9770
ing In SuperHyperGraphs” about some scientific research on Strict Connective Dominating In 9771
SuperHyperGraphs by two (Extreme/Neutrosophic) notions, namely, Extreme Strict Connective 9772

Dominating In SuperHyperGraphs and Neutrosophic Strict Connective Dominating In Super- 9773
HyperGraphs. With scientific research on the basic scientific research properties, the scientific 9774
research book starts to make Extreme Strict Connective Dominating In SuperHyperGraphs 9775
theory and Neutrosophic Strict Connective Dominating In SuperHyperGraphs theory more 9776
(Extremely/Neutrosophicly) understandable. 9777

HG183b1.png
Figure 44.7: [HG183b] Henry Garrett, “Strict Connective Dominating In SuperHyperGraphs”.

Dr. Henry Garrett, 2023 (doi: 10.5281/zenodo.8076449).

HG183b2.png


HG183b3.png


CHAPTER 45 9778
“SuperHyperGraph-Based Books”: | 9779
Featured Tweets 9780
“SuperHyperGraph-Based Books”: | Featured Tweets 9781
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 9782
CV 9783
503
9784
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
9785
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)
9786
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

9787

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

9789
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

9790
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

9791
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

9792
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

9793
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

9794
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

9795
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

9796
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

9797
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).
9798
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

9799
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

9800
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

9801
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

9802
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

9803
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/-
9804
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

9805
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

9806
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

9807
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

9808
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

9809
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

9810
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

9811
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

9812
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

9813
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

9814
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

9815
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

9816
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

9817
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

9818
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

9819
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

9820
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
9821
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).
9822
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
9823
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”,
9824
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”,
9825
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
9826
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
9827
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
9828
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).
9829
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).
9830
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).
9831
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

9832
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).
9833
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).
9834
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).
9835
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

9836
[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

9837
[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

9838
[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

9839
[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

9840
[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

9841
[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

9842
[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

9843
[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

9844
[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

9845
[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

9846
[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

9847
[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

9848
[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

9849
[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

9850
[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

9851
[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

9852
[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

9853
[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

9854
[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

9855
[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

9856
[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

9857
[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

9858
[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

9859
[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

9860
[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

9861
[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

9862
[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

9863
[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

9864
[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

9865
[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
9866
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

9867
[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

9868
[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

9869
[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

9870
[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

9871
[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
9872
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

9873
“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

9874
[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
9875
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

9876
[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

9877
[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

9878
[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

9879
[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

9880
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

9881
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
9882
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
9883
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

9884
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

9885
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
-
9886
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

9887
Анализ моделей и руководство за пределами Подход и проблемы в двух моде-

лях 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

9888
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
9889
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
9890
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

9891
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
9892
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
...
9893
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/
9894
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
9895
9896
9897
Henry Garrett
01/23/2022
9898
9899
9900
9901
9902
9903
9904
9905
9906
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
9907
View publication stats

Strict 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

Strict Connective Dominating in SuperHyperGraphs

Uploaded by

Copyright:

Available Formats

See discussions, stats, and author profiles for this publication at: https://www.researchgate.

Strict Connective Dominating In SuperHyperGraphs

Book · June 2023

507 PUBLICATIONS 22,274 CITATIONS

Featured Articles View project

Neutrosophic SuperHyperGraphs and SuperHyperGraphs View project

The user has requested enhancement of the downloaded file.

Dr. Henry Garrett

4 Cancer In Extreme SuperHyperGraph 47

5 Extreme Strict Connective Dominating 51

6 New Ideas On Super Con By Hyper Conceit Of Strict Connective Dom-

8 Applied Notions Under The Scrutiny Of The Motivation Of This

9 Extreme Preliminaries Of This Scientific Research On the Redeemed Ways 65

10 Extreme SuperHyperStrict 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 Strict 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 SuperHyperStrict Connective Dominating But As The Extensions

31 The Neutrosophic Departures on The Theoretical Results Toward

32 The Surveys of Mathematical Sets On The Results But As The Initial

33 Neutrosophic Applications in Cancer’s Neutrosophic Recognition 351

34 Case 1: The Initial Neutrosophic Steps Toward Neutrosophic SuperHy-

35 Case 2: The Increasing Neutrosophic Steps Toward Neutrosophic

36 Wondering Open Problems But As The Directions To Forming The

37 Conclusion and Closing Remarks 359

38 Neutrosophic SuperHyperDuality But As The Extensions Excerpt From

39 Neutrosophic SuperHyperJoin But As The Extensions Excerpt From

40 Neutrosophic SuperHyperPerfect But As The Extensions Excerpt From

41 Neutrosophic SuperHyperTotal But As The Extensions Excerpt From

42 Neutrosophic SuperHyperConnected But As The Extensions Excerpt

44 Books’ Contributions 463

45 “SuperHyperGraph-Based Books”: | Featured Tweets 475

Henry Garrett · Independent Researcher · Department of Mathematics ·

10.1 The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme

10.17The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme

11.1 an Extreme SuperHyperPath Associated to the Notions of Extreme SuperHyperStrict

14.1 an Extreme SuperHyperBipartite Associated to the Notions of Extreme SuperHy-

15.1 an Extreme SuperHyperMultipartite Associated to the Notions of Extreme

30.1 The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions

Henry Garrett · Independent Researcher · Department of Mathematics ·

30.6 The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions

Henry Garrett · Independent Researcher · Department of Mathematics ·

30.21The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions

31.1 a Neutrosophic SuperHyperPath Associated to the Notions of Neutrosophic

34.1 a Neutrosophic SuperHyperBipartite Associated to the Notions of Neutrosophic

35.1 a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic

Henry Garrett · Independent Researcher · Department of Mathematics ·

44.8 [HG183b] Henry Garrett, “Strict Connective Dominating In SuperHyperGraphs”.