Eulerian-Type-Path-Neighbor in SuperHyperGraphs

See discussions, stats, and author profiles for this publication at: https://www.researchgate.
net/publication/370156884
Eulerian-Type-Path-Neighbor In SuperHyperGraphs
Book · April 2023

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

Eulerian-Type-Path-
Neighbor 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 41
4 Cancer In Extreme SuperHyperGraph 43
5 Extreme Eulerian-Type-Path-Neighbor 47
6 New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Type-

Path-Decomposition In Cancer’s Recognition With (Neutrosophic) Su-
perHyperGraph 49
7 ABSTRACT 51
8 Applied Notions Under The Scrutiny Of The Motivation Of This

Scientific Research 57
9 Extreme Preliminaries Of This Scientific Research On the Redeemed Ways 61
10 Extreme SuperHyperEulerian-Type-Path-Neighbor But As The Extensions

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

Motivations 115
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 125
13 Extreme Applications in Cancer’s Extreme Recognition 137
14 Case 1: The Initial Extreme Steps Toward Extreme SuperHyperBipart-

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

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

Motivations 143
17 Conclusion and Closing Remarks 145
18 Extreme SuperHyperDuality But As The Extensions Excerpt From

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

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

21 Extreme SuperHyperTotal But As The Extensions Excerpt From Dense

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

23 Background 217
Bibliography 223
24 Cancer In Neutrosophic SuperHyperGraph 245
25 Neutrosophic Eulerian-Type-Path-Neighbor 249
26 New Ideas In Recognition of Cancer And Neutrosophic SuperHyper-

Graph By Eulerian-Type-Path-Neighbor As Hyper Nebbish On Super
Nebulous 251
27 ABSTRACT 253
28 Applied Notions Under The Scrutiny Of The Motivation Of This

Scientific Research 259

29 Neutrosophic Preliminaries Of This Scientific Research On the Re-

deemed Ways 263
30 Neutrosophic SuperHyperEulerian-Type-Path-Neighbor But As The Extensions

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

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

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

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

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

Motivations 347
37 Conclusion and Closing Remarks 349
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 407
43 Background 421
Bibliography 427
44 Books’ Contributions 449
45 “SuperHyperGraph-Based Books”: | Featured Tweets 457
46 CV 485

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

SuperHyperEulerian-Type-Path-Neighbor in the Extreme Example (42.0.3) . . . . . . . . 79
10.10The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
vi

11.1 an Extreme SuperHyperPath Associated to the Notions of Extreme

SuperHyperEulerian-Type-Path-Neighbor in the Example (42.0.5) . . . . . . . . . . . . . . 116
11.2 an Extreme SuperHyperCycle Associated to the Extreme Notions of Extreme
SuperHyperEulerian-Type-Path-Neighbor in the Extreme Example (42.0.7) . . . . . . . . . 118
11.3 an Extreme SuperHyperStar Associated to the Extreme Notions of Extreme
SuperHyperEulerian-Type-Path-Neighbor in the Extreme Example (42.0.9) . . . . . . . . . 119
11.4 Extreme SuperHyperBipartite Extreme Associated to the Extreme Notions of
Extreme SuperHyperEulerian-Type-Path-Neighbor in the Example (42.0.11) . . . . . . . . 121
11.5 an Extreme SuperHyperMultipartite Associated to the Notions of Extreme
SuperHyperEulerian-Type-Path-Neighbor in the Example (42.0.13) . . . . . . . . . . . . . 123
11.6 an Extreme SuperHyperWheel Extreme Associated to the Extreme Notions of
Extreme SuperHyperEulerian-Type-Path-Neighbor in the Extreme Example (42.0.15) . . . 124
14.1 an Extreme SuperHyperBipartite Associated to the Notions of Extreme

SuperHyperEulerian-Type-Path-Neighbor . . . . . . . . . . . . . . . . . . . . . . . . . . . . 139
15.1 an Extreme SuperHyperMultipartite Associated to the Notions of Extreme

30.1 The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions

of Neutrosophic SuperHyperEulerian-Type-Path-Neighbor in the Neutrosophic Example
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 281
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 282
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 283
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 283
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 284


(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 285
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 286
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 287
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 288
30.10The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 288
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 289
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 290
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 291
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 292
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 293
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 294
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 294
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 295
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 296
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 297


(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 298
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 299
31.1 a Neutrosophic SuperHyperPath Associated to the Notions of Neutrosophic

SuperHyperEulerian-Type-Path-Neighbor in the Example (42.0.5) . . . . . . . . . . . . . . 320
31.2 a Neutrosophic SuperHyperCycle Associated to the Neutrosophic Notions of
Neutrosophic SuperHyperEulerian-Type-Path-Neighbor in the Neutrosophic Example (42.0.7) 322
31.3 a Neutrosophic SuperHyperStar Associated to the Neutrosophic Notions of
Neutrosophic SuperHyperEulerian-Type-Path-Neighbor in the Neutrosophic Example (42.0.9) 323
31.4 Neutrosophic SuperHyperBipartite Neutrosophic Associated to the Neutrosophic
Notions of Neutrosophic SuperHyperEulerian-Type-Path-Neighbor in the Example (42.0.11) 325
31.5 a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic
SuperHyperEulerian-Type-Path-Neighbor in the Example (42.0.13) . . . . . . . . . . . . . 327
31.6 a Neutrosophic SuperHyperWheel Neutrosophic Associated to the Neutrosophic
Notions of Neutrosophic SuperHyperEulerian-Type-Path-Neighbor in the Neutrosophic
Example (42.0.15) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 328
34.1 a Neutrosophic SuperHyperBipartite Associated to the Notions of Neutrosophic

35.1 a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic

44.1 Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Type-
Path-Neighbor In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”,
Zenodo 2023, (doi: 10.5281/zenodo.7851550). . . . . . . . . . . . . . . . . . . . . . 450
44.4 Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHy-
perGraph By Eulerian-Type-Path-Neighbor As Hyper Nebbish On Super Nebulous”,
45.1 “SuperHyperGraph-Based Books”: | Featured Tweets . . . . . . . . . . . . . . . . 458

45.2 “SuperHyperGraph-Based Books”: | Featured Tweets . . . . . . . . . . . . . . . . 459

45.3 “SuperHyperGraph-Based Books”: | Featured Tweets #69 . . . . . . . . . . . . . . 460
45.10“SuperHyperGraph-Based Books”: | Featured Tweets #67 . . . . . . . . . . . . . . 466

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) 70
Belong to The Neutrosophic SuperHyperGraph, Mentioned in the Definition (29.0.22) 71

Belong to The Extreme SuperHyperBipartite . . . . . . . . . . . . . . . . . . . . . 140

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

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

Belong to The Neutrosophic SuperHyperBipartite . . . . . . . . . . . . . . . . . . 344

Belong to The Neutrosophic SuperHyperMultipartite . . . . . . . . . . . . . . . . . 346
37.1 An Overlook On This Research And Beyond . . . . . . . . . . . . . . . . . . . . . 350
xi
CHAPTER 1
ABSTRACT
In this scientific research book, there are some scientific research chapters on “Extreme Eulerian- 1
Type-Path-Neighbor In SuperHyperGraphs” and “Neutrosophic Eulerian-Type-Path-Neighbor 2
In SuperHyperGraphs” about some scientific research on Eulerian-Type-Path-Neighbor In 3

SuperHyperGraphs by two (Extreme/Neutrosophic) notions, namely, Extreme Eulerian-Type- 4
Path-Neighbor In SuperHyperGraphs and Neutrosophic Eulerian-Type-Path-Neighbor In 5
SuperHyperGraphs. With scientific research on the basic scientific research properties, the 6
scientific research book starts to make Extreme Eulerian-Type-Path-Neighbor In SuperHyper- 7
Graphs theory and Neutrosophic Eulerian-Type-Path-Neighbor In SuperHyperGraphs theory 8
more (Extremely/Neutrosophicly) understandable. 9

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

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

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

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

and discernment since there are characterized in the disciplinary ways of the SuperHyperClass 65
based on a Eulerian-Type-Path-Neighbor In SuperHyperGraphs . For the sake of having a 66
Neutrosophic Eulerian-Type-Path-Neighbor In SuperHyperGraphs, there’s a need to “redefine” 67
the notion of a “Neutrosophic Eulerian-Type-Path-Neighbor In SuperHyperGraphs” and a 68
“Neutrosophic Eulerian-Type-Path-Neighbor In SuperHyperGraphs ”. The SuperHyperVertices 69

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

ite, SuperHyperMultiPartite, and SuperHyperWheel, are “Neutrosophic SuperHyperPath”, 80

“Neutrosophic Eulerian-Type-Path-Neighbor In SuperHyperGraphs”, “Neutrosophic SuperHy- 81
perStar”, “Neutrosophic SuperHyperBipartite”, “Neutrosophic SuperHyperMultiPartite”, and 82
“Neutrosophic SuperHyperWheel” if the intended Table holds. A SuperHyperGraph has a 83
“Neutrosophic Eulerian-Type-Path-Neighbor In SuperHyperGraphs” where it’s the strongest [the 84
maximum Neutrosophic value from all the Eulerian-Type-Path-Neighbor In SuperHyperGraphs 85
amid the maximum value amid all SuperHyperVertices from a Eulerian-Type-Path-Neighbor 86

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

SuperHyperGraphs, and the strongest Eulerian-Type-Path-Neighbor In SuperHyperGraphs, 122
called Neutrosophic Eulerian-Type-Path-Neighbor In SuperHyperGraphs, some general results 123
are introduced. Beyond that in SuperHyperStar, all possible SuperHyperPaths have only two 124
SuperHyperEdges but it’s not enough since it’s essential to have at least three SuperHyperEdges 125

to form any style of a Eulerian-Type-Path-Neighbor In SuperHyperGraphs. There isn’t any 126

formation of any Eulerian-Type-Path-Neighbor In SuperHyperGraphs but literarily, it’s the 127
deformation of any Eulerian-Type-Path-Neighbor In SuperHyperGraphs. It, literarily, deforms 128
and it doesn’t form. A basic familiarity with SuperHyperGraph theory and Neutrosophic 129
SuperHyperGraph theory are proposed. 130
Keywords: SuperHyperGraph, (Neutrosophic) Eulerian-Type-Path-Neighbor In SuperHyper- 131
Graphs, Cancer’s Recognition 132

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

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

|S ∩ (V \ N (s))|N eutrosophic + δ. The first Expression, holds if S is a “Neutrosophic 165
δ−SuperHyperOffensive”. And the second Expression, holds if S is a “Neutrosophic 166
δ−SuperHyperDefensive”. It’s useful to define “Neutrosophic” version of Eulerian-Type- 167
Path-Neighbor In SuperHyperGraphs . Since there’s more ways to get type-results to make 168
Eulerian-Type-Path-Neighbor In SuperHyperGraphs more understandable. For the sake of 169
having Neutrosophic Eulerian-Type-Path-Neighbor In SuperHyperGraphs, there’s a need 170

to “redefine” the notion of “Eulerian-Type-Path-Neighbor In SuperHyperGraphs ”. The 171

SuperHyperVertices and the SuperHyperEdges are assigned by the labels from the letters 172
of the alphabets. In this procedure, there’s the usage of the position of labels to assign to 173
the values. Assume a Eulerian-Type-Path-Neighbor In SuperHyperGraphs . It’s redefined 174
Neutrosophic Eulerian-Type-Path-Neighbor In SuperHyperGraphs if the mentioned Table holds, 175
concerning, “The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges 176
Belong to The Neutrosophic SuperHyperGraph” with the key points, “The Values of The 177
Vertices & The Number of Position in Alphabet”, “The Values of The SuperVertices&The 178
maximum Values of Its Vertices”, “The Values of The Edges&The maximum Values of Its 179
Vertices”, “The Values of The HyperEdges&The maximum Values of Its Vertices”, “The 180
Values of The SuperHyperEdges&The maximum Values of Its Endpoints”. To get structural 181
examples and instances, I’m going to introduce the next SuperHyperClass of SuperHyper- 182
Graph based on Eulerian-Type-Path-Neighbor In SuperHyperGraphs . It’s the main. It’ll 183

be disciplinary to have the foundation of previous definition in the kind of SuperHyperClass. 184
If there’s a need to have all Eulerian-Type-Path-Neighbor In SuperHyperGraphs until the 185
Eulerian-Type-Path-Neighbor In SuperHyperGraphs, then it’s officially called “Eulerian-Type- 186
Path-Neighbor In SuperHyperGraphs” but otherwise, it isn’t Eulerian-Type-Path-Neighbor In 187
SuperHyperGraphs . There are some instances about the clarifications for the main definition 188
titled “Eulerian-Type-Path-Neighbor In SuperHyperGraphs ”. These two examples get more 189

scrutiny and discernment since there are characterized in the disciplinary ways of the Super- 190
HyperClass based on Eulerian-Type-Path-Neighbor In SuperHyperGraphs . For the sake of 191
having Neutrosophic Eulerian-Type-Path-Neighbor In SuperHyperGraphs, there’s a need to 192
“redefine” the notion of “Neutrosophic Eulerian-Type-Path-Neighbor In SuperHyperGraphs” and 193
“Neutrosophic Eulerian-Type-Path-Neighbor In SuperHyperGraphs ”. The SuperHyperVertices 194
and the SuperHyperEdges are assigned by the labels from the letters of the alphabets. In 195
this procedure, there’s the usage of the position of labels to assign to the values. Assume 196
a Neutrosophic SuperHyperGraph. It’s redefined “Neutrosophic SuperHyperGraph” if the 197
intended Table holds. And Eulerian-Type-Path-Neighbor In SuperHyperGraphs are redefined 198
“Neutrosophic Eulerian-Type-Path-Neighbor In SuperHyperGraphs” if the intended Table 199
holds. It’s useful to define “Neutrosophic” version of SuperHyperClasses. Since there’s more 200
ways to get Neutrosophic type-results to make Neutrosophic Eulerian-Type-Path-Neighbor In 201

SuperHyperGraphs more understandable. Assume a Neutrosophic SuperHyperGraph. There 202
are some Neutrosophic SuperHyperClasses if the intended Table holds. Thus SuperHyperPath, 203
Eulerian-Type-Path-Neighbor In SuperHyperGraphs, SuperHyperStar, SuperHyperBipart- 204
ite, SuperHyperMultiPartite, and SuperHyperWheel, are “Neutrosophic SuperHyperPath”, 205
“Neutrosophic Eulerian-Type-Path-Neighbor In SuperHyperGraphs”, “Neutrosophic Super- 206

HyperStar”, “Neutrosophic SuperHyperBipartite”, “Neutrosophic SuperHyperMultiPartite”, 207
and “Neutrosophic SuperHyperWheel” if the intended Table holds. A SuperHyperGraph has 208
“Neutrosophic Eulerian-Type-Path-Neighbor In SuperHyperGraphs” where it’s the strongest 209
[the maximum Neutrosophic value from all Eulerian-Type-Path-Neighbor In SuperHyperGraphs 210
amid the maximum value amid all SuperHyperVertices from a Eulerian-Type-Path-Neighbor 211
In SuperHyperGraphs .] Eulerian-Type-Path-Neighbor In SuperHyperGraphs . A graph is 212

SuperHyperUniform if it’s SuperHyperGraph and the number of elements of SuperHyperEdges 213
are the same. Assume a Neutrosophic SuperHyperGraph. There are some SuperHyperClasses as 214
follows. It’s SuperHyperPath if it’s only one SuperVertex as intersection amid two given Super- 215
HyperEdges with two exceptions; it’s Eulerian-Type-Path-Neighbor In SuperHyperGraphs if it’s 216

only one SuperVertex as intersection amid two given SuperHyperEdges; it’s SuperHyperStar it’s 217
only one SuperVertex as intersection amid all SuperHyperEdges; it’s SuperHyperBipartite it’s 218
forming multi separate sets, has no SuperHyperEdge in common; it’s SuperHyperWheel if it’s 222
and the common and intended properties between “specific” cells and “specific group” of 228
cells are SuperHyperModeled as “SuperHyperEdges”. Sometimes, it’s useful to have some 229
degrees of determinacy, indeterminacy, and neutrality to have more precise SuperHyperModel 230
which in this case the SuperHyperModel is called “Neutrosophic”. In the future research, 231
the foundation will be based on the “Cancer’s Neutrosophic Recognition” and the results 232
and the definitions will be introduced in redeemed ways. The Neutrosophic recognition of 233
the cancer in the long-term function. The specific region has been assigned by the model 234
[it’s called SuperHyperGraph] and the long cycle of the move from the cancer is identified 235
by this research. Sometimes the move of the cancer hasn’t be easily identified since there 236
are some determinacy, indeterminacy and neutrality about the moves and the effects of the 237
cancer on that region; this event leads us to choose another model [it’s said to be Neutro- 238
sophic SuperHyperGraph] to have convenient perception on what’s happened and what’s 239
done. There are some specific models, which are well-known and they’ve got the names, and 240
some SuperHyperGeneral SuperHyperModels. The moves and the traces of the cancer on the 241
complex tracks and between complicated groups of cells could be fantasized by a Neutrosophic 242
SuperHyperPath(-/Eulerian-Type-Path-Neighbor In SuperHyperGraphs, SuperHyperStar, 243
SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find either 244
the longest Eulerian-Type-Path-Neighbor In SuperHyperGraphs or the strongest Eulerian-Type- 245
Path-Neighbor In SuperHyperGraphs in those Neutrosophic SuperHyperModels. For the longest 246
Eulerian-Type-Path-Neighbor In SuperHyperGraphs, called Eulerian-Type-Path-Neighbor In 247

SuperHyperGraphs, and the strongest Eulerian-Type-Path-Neighbor In SuperHyperGraphs, 248
called Neutrosophic Eulerian-Type-Path-Neighbor In SuperHyperGraphs, some general results 249
are introduced. Beyond that in SuperHyperStar, all possible SuperHyperPaths have only two 250
to form any style of a Eulerian-Type-Path-Neighbor In SuperHyperGraphs. There isn’t any 252

formation of any Eulerian-Type-Path-Neighbor In SuperHyperGraphs but literarily, it’s the 253
deformation of any Eulerian-Type-Path-Neighbor In SuperHyperGraphs. It, literarily, deforms 254
and it doesn’t form. A basic familiarity with SuperHyperGraph theory and Neutrosophic 255
SuperHyperGraph theory are proposed. 256
Keywords: Neutrosophic SuperHyperGraph, Neutrosophic Eulerian-Type-Path-Neighbor In 257
SuperHyperGraphs, Cancer’s Neutrosophic Recognition 258

260
Some scientific studies and scientific researches about neutrosophic graphs, are proposed 261

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

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




CHAPTER 2 292
Background 293
There are some scientific researches covering the topic of this research. In what follows, there 294
are some discussion and literature reviews about them. 295
The seminal paper and groundbreaking article is titled “neutrosophic co-degree and neutrosophic 296
degree alongside chromatic numbers in the setting of some classes related to neutrosophic 297
hypergraphs” in Ref. [HG1] by Henry Garrett (2022). In this research article, a novel approach 298
is implemented on SuperHyperGraph and neutrosophic SuperHyperGraph based on general 299
forms without using neutrosophic classes of neutrosophic SuperHyperGraph. It’s published in 300
prestigious and fancy journal is entitled “Journal of Current Trends in Computer Science Re- 301
search (JCTCSR)” with ISO abbreviation “J Curr Trends Comp Sci Res” in volume 1 and issue 302
1 with pages 06-14. The research article studies deeply with choosing neutrosophic hypergraphs 303
instead of neutrosophic SuperHyperGraph. It’s the breakthrough toward independent results 304
based on initial background. 305
The seminal paper and groundbreaking article is titled “Super Hyper Dominating and Super Hy- 306
per Resolving on Neutrosophic Super Hyper Graphs and Their Directions in Game Theory and 307
Neutrosophic Super Hyper Classes” in Ref. [HG2] by Henry Garrett (2022). In this research 308
article, a novel approach is implemented on SuperHyperGraph and neutrosophic SuperHyper- 309
Graph based on fundamental SuperHyperNumber and using neutrosophic SuperHyperClasses 310
of neutrosophic SuperHyperGraph. It’s published in prestigious and fancy journal is entitled 311
“Journal of Mathematical Techniques and Computational Mathematics(JMTCM)” with ISO 312
abbreviation “J Math Techniques Comput Math” in volume 1 and issue 3 with pages 242-263. 313
The research article studies deeply with choosing directly neutrosophic SuperHyperGraph 314
and SuperHyperGraph. It’s the breakthrough toward independent results based on initial 315
background and fundamental SuperHyperNumbers. 316
The seminal paper and groundbreaking article is titled “Some Super Hyper Degrees and 317
Co-Super Hyper Degrees on Neutrosophic Super Hyper Graphs And Super Hyper Graphs 318
Alongside Applications in Cancer’s Treatments” in Ref. [HG3] by Henry Garrett (2023). In 319
this research article, a novel approach is implemented on SuperHyperGraph and neutrosophic 320
SuperHyperGraph based on fundamental notions and using vital tools in Cancer’s Treatments. 321
It’s published in prestigious and fancy journal is entitled “Journal of Mathematical Techniques 322
and Computational Mathematics(JMTCM)” with ISO abbreviation “J Math Techniques Com- 323
put Math” in volume 2 and issue 1 with pages 35-47. The research article studies deeply with 324
choosing directly neutrosophic SuperHyperGraph and SuperHyperGraph. It’s the breakthrough 325
toward independent results based on initial background and fundamental SuperHyperNumbers. 326
13
In some articles are titled “0039 | Closing Numbers and Super-Closing Numbers as 327
(Dual)Resolving and (Dual)Coloring alongside (Dual)Dominating in (Neutrosophic)n- 328
SuperHyperGraph” in Ref. [HG4] by Henry Garrett (2022), “0049 | (Failed)1-Zero-Forcing 329
Number in Neutrosophic Graphs” in Ref. [HG5] by Henry Garrett (2022), “Extreme SuperHy- 330
perClique as the Firm Scheme of Confrontation under Cancer’s Recognition as the Model in 331
The Setting of (Neutrosophic) SuperHyperGraphs” in Ref. [HG6] by Henry Garrett (2022), 332
“Uncertainty On The Act And Effect Of Cancer Alongside The Foggy Positions Of Cells Toward 333
Neutrosophic Failed SuperHyperClique inside Neutrosophic SuperHyperGraphs Titled Cancer’s 334
Recognition” in Ref. [HG7] by Henry Garrett (2022), “Neutrosophic Version Of Separates 335
Groups Of Cells In Cancer’s Recognition On Neutrosophic SuperHyperGraphs” in Ref. [HG8] 336
by Henry Garrett (2022), “The Shift Paradigm To Classify Separately The Cells and Affected 337
Cells Toward The Totality Under Cancer’s Recognition By New Multiple Definitions On the 338
Sets Polynomials Alongside Numbers In The (Neutrosophic) SuperHyperMatching Theory 339

Based on SuperHyperGraph and Neutrosophic SuperHyperGraph” in Ref. [HG9] by Henry 340
Garrett (2022), “Breaking the Continuity and Uniformity of Cancer In The Worst Case of 341
Full Connections With Extreme Failed SuperHyperClique In Cancer’s Recognition Applied in 342
(Neutrosophic) SuperHyperGraphs” in Ref. [HG10] by Henry Garrett (2022), “Neutrosophic 343
Failed SuperHyperStable as the Survivors on the Cancer’s Neutrosophic Recognition Based 344
on Uncertainty to All Modes in Neutrosophic SuperHyperGraphs” in Ref. [HG11] by Henry 345

Garrett (2022), “Extremism of the Attacked Body Under the Cancer’s Circumstances Where 346
Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs” in Ref. [HG12] by Henry 347
Garrett (2022), “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Recognitions And 348
Messy-Style SuperHyperGraphs To Form Neutrosophic SuperHyperStable To Act on Cancer’s 350
Neutrosophic Recognitions In Special ViewPoints” in Ref. [HG14] by Henry Garrett (2022), 351
“Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To Use Neutrosophic 352
SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond” in Ref. [HG15] by 353
Henry Garrett (2022), “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well- 354
SuperHyperModelled (Neutrosophic) SuperHyperGraphs ” in Ref. [HG16] by Henry Garrett 355
(2022), “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic SuperHyperStable 356
To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints” in Ref. [HG12] by 357

Henry Garrett (2022), “Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic) 358
SuperHyperModeling in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs” in 359
Ref. [HG17] by Henry Garrett (2022), “Neutrosophic Messy-Style SuperHyperGraphs To 360
Form Neutrosophic SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special 361
ViewPoints” in Ref. [HG18] by Henry Garrett (2022),“(Neutrosophic) SuperHyperModeling 362

of Cancer’s Recognitions Featuring (Neutrosophic) SuperHyperDefensive SuperHyperAlli- 363
ances” in Ref. [HG19] by Henry Garrett (2022), “(Neutrosophic) SuperHyperAlliances With 364
SuperHyperDefensive and SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) Super- 365
HyperGraph With (Neutrosophic) SuperHyperModeling of Cancer’s Recognitions And Related 366
(Neutrosophic) SuperHyperClasses” in Ref. [HG20] by Henry Garrett (2022), “SuperHyper- 367
Girth on SuperHyperGraph and Neutrosophic SuperHyperGraph With SuperHyperModeling of 368

Cancer’s Recognitions” in Ref. [HG21] by Henry Garrett (2022), “Some SuperHyperDegrees 369
and Co-SuperHyperDegrees on Neutrosophic SuperHyperGraphs and SuperHyperGraphs 370
Alongside Applications in Cancer’s Treatments” in Ref. [HG22] by Henry Garrett (2022), 371
“SuperHyperDominating and SuperHyperResolving on Neutrosophic SuperHyperGraphs And 372

Their Directions in Game Theory and Neutrosophic SuperHyperClasses” in Ref. [HG23] by 373
Henry Garrett (2022), “SuperHyperMatching By (R-)Definitions And Polynomials To Monitor 374
Cancer’s Recognition In Neutrosophic SuperHyperGraphs” in Ref. [HG24] by Henry Garrett 375
(2023), “The Focus on The Partitions Obtained By Parallel Moves In The Cancer’s Extreme 376
Recognition With Different Types of Extreme SuperHyperMatching Set and Polynomial on 377
(Neutrosophic) SuperHyperGraphs” in Ref. [HG25] by Henry Garrett (2023), “Extreme Failed 378
SuperHyperClique Decides the Failures on the Cancer’s Recognition in the Perfect Connections 379
of Cancer’s Attacks By SuperHyperModels Named (Neutrosophic) SuperHyperGraphs” in Ref. 380
[HG26] by Henry Garrett (2023), “Indeterminacy On The All Possible Connections of Cells In 381
Front of Cancer’s Attacks In The Terms of Neutrosophic Failed SuperHyperClique on Cancer’s 382
Recognition called Neutrosophic SuperHyperGraphs” in Ref. [HG27] by Henry Garrett 383
(2023), “Perfect Directions Toward Idealism in Cancer’s Neutrosophic Recognition Forwarding 384
Neutrosophic SuperHyperClique on Neutrosophic SuperHyperGraphs” in Ref. [HG28] by 385

Henry Garrett (2023), “Demonstrating Complete Connections in Every Embedded Regions 386
and Sub-Regions in the Terms of Cancer’s Recognition and (Neutrosophic) SuperHyperGraphs 387
With (Neutrosophic) SuperHyperClique” in Ref. [HG29] by Henry Garrett (2023), “Different 388
Neutrosophic Types of Neutrosophic Regions titled neutrosophic Failed SuperHyperStable in 389
Cancer’s Neutrosophic Recognition modeled in the Form of Neutrosophic SuperHyperGraphs” 390
in Ref. [HG30] by Henry Garrett (2023), “Using the Tool As (Neutrosophic) Failed SuperHy- 391
perStable To SuperHyperModel Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs” 392
in Ref. [HG31] by Henry Garrett (2023), “Neutrosophic Messy-Style SuperHyperGraphs To 393
Form Neutrosophic SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special 394
ViewPoints” in Ref. [HG32] by Henry Garrett (2023), “(Neutrosophic) SuperHyperStable 395
on Cancer’s Recognition by Well-SuperHyperModelled (Neutrosophic) SuperHyperGraphs” 396
in Ref. [HG33] by Henry Garrett (2023), “Neutrosophic 1-Failed SuperHyperForcing in 397

the SuperHyperFunction To Use Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic 398
Recognition And Beyond” in Ref. [HG34] by Henry Garrett (2022), “(Neutrosophic) 1-Failed 399
SuperHyperForcing in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs” in Ref. 400
[HG35] by Henry Garrett (2022), “Basic Notions on (Neutrosophic) SuperHyperForcing And 401
(Neutrosophic) SuperHyperModeling in Cancer’s Recognitions And (Neutrosophic) SuperHyper- 402
Graphs” in Ref. [HG36] by Henry Garrett (2022), “Basic Neutrosophic Notions Concerning 403
SuperHyperDominating and Neutrosophic SuperHyperResolving in SuperHyperGraph” in Ref. 404
[HG37] by Henry Garrett (2022), “Initial Material of Neutrosophic Preliminaries to Study 405
Some Neutrosophic Notions Based on Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic 406
SuperHyperGraph (NSHG)” in Ref. [HG38] by Henry Garrett (2022), and [HG4; HG5; 407
HG6; HG7; HG8; HG9; HG10; HG11; HG12; HG13; HG14; HG15; HG16; HG17; 408
HG18; HG19; HG20; HG21; HG22; HG23; HG24; HG25; HG26; HG27; HG28; 409
HG942; HG95; HG952; HG96; HG962; HG97; HG972; HG98; HG982; HG106; 411

HG248; HG249; HG250; HG251], there are some endeavors to formalize the basic Su- 425
perHyperNotions about neutrosophic SuperHyperGraph and SuperHyperGraph alongside 426
scientific research books at [HG60b; HG61b; HG62b; HG63b; HG64b; HG65b; HG66b; 427
HG67b; HG68b; HG69b; HG70b; HG71b; HG72b; HG73b; HG74b; HG75b; HG76b; 428
HG97b; HG98b; HG99b; HG100b; HG101b; HG102b; HG103b; HG104b; HG105b; 431
HG106b; HG107b; HG108b; HG109b; HG110b; HG111b; HG112b; HG113b; 432

HG162b; HG163b; HG164b]. Two popular scientific research books in Scribd in the 439
terms of high readers, 4190 and 5189 respectively, on neutrosophic science is on [HG32b; 440
HG44b]. 441
Some scientific studies and scientific researches about neutrosophic graphs, are proposed as 442
book in Ref. [HG71b] by Henry Garrett (2023) which is indexed by Google Scholar and has 443
more than 4331 readers in Scribd. It’s titled “Beyond Neutrosophic Graphs” and published 444
by Dr. Henry Garrett. This research book covers different types of notions and settings in 445
neutrosophic graph theory and neutrosophic SuperHyperGraph theory. 446
Also, some scientific studies and scientific researches about neutrosophic graphs, are proposed 447
as book in Ref. [HG70b] by Henry Garrett (2023) which is indexed by Google Scholar and 448
has more than 5327 readers in Scribd. It’s titled “Neutrosophic Duality” and published by Dr. 449
Henry Garrett. This research book presents different types of notions SuperHyperResolving and 450
SuperHyperDominating in the setting of duality in neutrosophic graph theory and neutrosophic 451
SuperHyperGraph theory. This research book has scrutiny on the complement of the intended 452
set and the intended set, simultaneously. It’s smart to consider a set but acting on its 453
complement that what’s done in this research book which is popular in the terms of high readers 454
in Scribd. 455
See the seminal scientific researches [HG1; HG2; HG3]. The formalization of the notions 456
on the framework of notions in SuperHyperGraphs, Neutrosophic notions in SuperHyper- 457
Graphs theory, and (Neutrosophic) SuperHyperGraphs theory at [HG4; HG5; HG6; HG7; 458
HG8; HG9; HG10; HG11; HG12; HG13; HG14; HG15; HG16; HG17; HG18; HG19; 459

HG250; HG251] alongside scientific research books at [HG60b; HG61b; HG62b; HG63b; 476

HG159b; HG160b; HG161b; HG162b; HG163b; HG164b]. Two popular scientific 488
research books in Scribd in the terms of high readers, 4331 and 5327 respectively, on neutro- 489
sophic science is on [HG32b; HG44b]. 490

Bibliography 491
HG1 [1] Henry Garrett, “Neutrosophic Co-degree and Neutrosophic Degree alongside Chromatic 492
Numbers in the Setting of Some Classes Related to Neutrosophic Hypergraphs”, J Curr 493
Trends Comp Sci Res 1(1) (2022) 06-14. 494
HG2 [2] Henry Garrett, “Super Hyper Dominating and Super Hyper Resolving on Neutro- 495
sophic Super Hyper Graphs and Their Directions in Game Theory and Neutrosophic 496
Super Hyper Classes”, J Math Techniques Comput Math 1(3) (2022) 242-263. (doi: 497
10.33140/JMTCM.01.03.09) 498
HG3 [3] Henry Garrett, “Some Super Hyper Degrees and Co-Super Hyper Degrees on Neut- 499
rosophic Super Hyper Graphs And Super Hyper Graphs Alongside Applications 500
in Cancer’s Treatments”, J Math Techniques Comput Math 2(1) (2023) 35-47. 501
(https://www.opastpublishers.com/open-access-articles/some-super-hyper-degrees-and- 502
cosuper-hyper-degrees-on-neutrosophic-super-hyper-graphs-and-super-hyper-graphs- 503
alongside-a.pdf) 504
HG216 [4] Henry Garrett, “A Research on Cancers Recognition and Neutrosophic Super 505
Hypergraph by Eulerian Super Hyper Cycles and Hamiltonian Sets as Hyper Cov- 506
ering Versus Super separations”, J Math Techniques Comput Math 2(3) (2023) 507
136-148. (https://www.opastpublishers.com/open-access-articles/a-research-on-cancers- 508
recognition-and-neutrosophic-super-hypergraph-by-eulerian-super-hyper-cycles-and- 509
hamiltonian-sets-.pdf) 510
HG4 [5] Garrett, Henry. “0039 | Closing Numbers and Super-Closing Numbers as (Dual)Resolving 511
and (Dual)Coloring alongside (Dual)Dominating in (Neutrosophic)n-SuperHyperGraph.” 512
CERN European Organization for Nuclear Research - Zenodo, Nov. 2022. CERN 513
European Organization for Nuclear Research, https://doi.org/10.5281/zenodo.6319942. 514
https://oa.mg/work/10.5281/zenodo.6319942 515
HG5 [6] Garrett, Henry. “0049 | (Failed)1-Zero-Forcing Number in Neutrosophic Graphs.” 516
CERN European Organization for Nuclear Research - Zenodo, Feb. 2022. CERN 517
European Organization for Nuclear Research, https://doi.org/10.13140/rg.2.2.35241.26724. 518
https://oa.mg/work/10.13140/rg.2.2.35241.26724 519
19
HG6 [7] Henry Garrett, “Extreme SuperHyperClique as the Firm Scheme of Confrontation under 520
Cancer’s Recognition as the Model in The Setting of (Neutrosophic) SuperHyperGraphs”, 521
Preprints 2023, 2023010308 (doi: 10.20944/preprints202301.0308.v1). 522
HG7 [8] Henry Garrett, “Uncertainty On The Act And Effect Of Cancer Alongside The Foggy 523
Positions Of Cells Toward Neutrosophic Failed SuperHyperClique inside Neutrosophic 524
SuperHyperGraphs Titled Cancer’s Recognition”, Preprints 2023, 2023010282 (doi: 525
10.20944/preprints202301.0282.v1). 526
HG8 [9] Henry Garrett, “Neutrosophic Version Of Separates Groups Of Cells In Cancer’s 527
Recognition On Neutrosophic SuperHyperGraphs”, Preprints 2023, 2023010267 (doi: 528
10.20944/preprints202301.0267.v1). 529
HG9 [10] Henry Garrett, “The Shift Paradigm To Classify Separately The Cells and Affected Cells 530
Toward The Totality Under Cancer’s Recognition By New Multiple Definitions On the Sets 531
Polynomials Alongside Numbers In The (Neutrosophic) SuperHyperMatching Theory Based 532
on SuperHyperGraph and Neutrosophic SuperHyperGraph”, Preprints 2023, 2023010265 533

(doi: 10.20944/preprints202301.0265.v1). 534
HG10 [11] Henry Garrett, “Breaking the Continuity and Uniformity of Cancer In The Worst Case of 535
Full Connections With Extreme Failed SuperHyperClique In Cancer’s Recognition Applied 536
in (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010262,(doi: 10.20944/pre- 537
prints202301.0262.v1). 538
HG11 [12] Henry Garrett, “Neutrosophic Failed SuperHyperStable as the Survivors on the Cancer’s 539
Neutrosophic Recognition Based on Uncertainty to All Modes in Neutrosophic SuperHy- 540
perGraphs”, Preprints 2023, 2023010240 (doi: 10.20944/preprints202301.0240.v1). 541
HG12 [13] Henry Garrett, “Extremism of the Attacked Body Under the Cancer’s Circumstances 542
Where Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 543
2023010224, (doi: 10.20944/preprints202301.0224.v1). 544
HG13 [14] Henry Garrett, “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Recognitions 545
And (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010105 (doi: 10.20944/pre- 546
prints202301.0105.v1). 547
HG14 [15] Henry Garrett, “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic 548
SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints”, 549
HG15 [16] Henry Garrett, “Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To 551
Use Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond”, 552
Preprints 2023, 2023010044 553
HG16 [17] Henry Garrett, “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well- 554
SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010043 (doi: 555
10.20944/preprints202301.0043.v1). 556
HG17 [18] Henry Garrett, “Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic) 557
SuperHyperModeling in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs”, 558

HG19 [20] Henry Garrett, “(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions Featuring 563
(Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, Preprints 2022, 2022120549 564
(doi: 10.20944/preprints202212.0549.v1). 565
HG20 [21] Henry Garrett, “(Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and 566
SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With 567
(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions And Related (Neutrosophic) 568
SuperHyperClasses”, Preprints 2022, 2022120540 (doi: 10.20944/preprints202212.0540.v1). 569
HG21 [22] Henry Garrett, “SuperHyperGirth on SuperHyperGraph and Neutrosophic SuperHyper- 570
Graph With SuperHyperModeling of Cancer’s Recognitions”, Preprints 2022, 2022120500 571
(doi: 10.20944/preprints202212.0500.v1). 572
HG22 [23] Henry Garrett, “Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic 573
SuperHyperGraphs and SuperHyperGraphs Alongside Applications in Cancer’s Treatments”, 574
HG23 [24] Henry Garrett, “SuperHyperDominating and SuperHyperResolving on Neutrosophic Super- 576
HyperGraphs And Their Directions in Game Theory and Neutrosophic SuperHyperClasses”, 577
HG251 [25] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph 579
By Eulerian-Type-Path-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, 580
(doi: 10.5281/zenodo.7851519). 581
HG250 [26] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Type- 582
Path-Neighbor In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 583
2023, (doi: 10.5281/zenodo.7851550). 584
By Eulerian-Type-Path-Decomposition As Hyper Decompress On Super Decompensation”, 586

Zenodo 2023, (doi: 10.5281/zenodo.7839333). 587
HG248 [28] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of Eulerian- 588
Type-Path-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyper- 589
Graph”, Zenodo 2023, (doi: 10.5281/zenodo.7840206). 590
By Eulerian-Type-Path-Cut As Hyper Eulogy On Super EULA”, Zenodo 2023, (doi: 592
10.5281/zenodo.7834229). 593
HG246 [30] Henry Garrett, “New Ideas On Super EULA By Hyper Eulogy Of Eulerian-Type-Path-Cut 594
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 595
10.5281/zenodo.7834261). 596

By Eulerian-Path-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 598
10.5281/zenodo.7824560). 599
HG244 [32] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Path- 600
Neighbor In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, 601
(doi: 10.5281/zenodo.7824623). 602
By Eulerian-Path-Decomposition As Hyper Decompress On Super Decompensation”, 604
Path-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 607
As Hyper Tool On Super Toot”, Zenodo 2023, (doi: 10.5281/zenodo.7812236). 610
By initial Eulerian-Path-Cut As Hyper initial Eulogy On Super initial EULA”, Zenodo 612
2023, (doi: 10.5281/zenodo.7809365). 613
By Eulerian-Path-Cut As Hyper Eulogy-Path-Cut On Super EULA-Path-Cut”, Zenodo 615

2023, (doi: 10.5281/zenodo.7809358). 616
HG238 [38] Henry Garrett, “New Ideas On Super EULA By Hyper Eulogy Of Eulerian-Path-Cut 617
10.5281/zenodo.7809219). 619
By Eulerian-Path-Cut As Hyper Eulogy On Super EULA”, Zenodo 2023, (doi: 621
10.5281/zenodo.7809328). 622
By Hamiltonian-Type-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 624
2023, (doi: 10.5281/zenodo.7806767). 625
HG235 [41] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Hamiltonian-Type- 626
Cycle-Neighbor In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 627
2023, (doi: 10.5281/zenodo.7806838). 628
By Hamiltonian-Type-Cycle-Decomposition As Hyper Decompress On Super Decompens- 630
ation”, Zenodo 2023, (doi: 10.5281/zenodo.7804238). 631
HG233 [43] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of 632
Hamiltonian-Type-Cycle-Decomposition In Cancer’s Recognition With (Neutrosophic) 633
SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zenodo.7804228). 634

By Hamiltonian-Type-Cycle-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, 636
(doi: 10.5281/zenodo.7799902). 637
HG231 [45] Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Type- 638
Cycle-Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 639
2023, (doi: 10.5281/zenodo.7804218). 640
By Hamiltonian-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, 642
(doi: 10.5281/zenodo.7796334). 643
By Hamiltonian-Cycle-Decomposition As Hyper Decompress On Super Decompensation”, 645
By Hamiltonian-Cycle-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi: 648
10.5281/zenodo.7791952). 649
HG225 [49] Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Cycle- 650
Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, 651
(doi: 10.5281/zenodo.7791982). 652
By Hamiltonian-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 654
10.5281/zenodo.7790026). 655
HG223 [51] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Hamiltonian- 656
Neighbor In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 657
2023, (doi: 10.5281/zenodo.7790052). 658
By Hamiltonian-Decomposition As Hyper Decompress On Super Decompensation”, Zenodo 660
2023, (doi: 10.5281/zenodo.7787066). 661
Hamiltonian-Decomposition In Recognition of Cancer With (Neutrosophic) SuperHyper- 663
Graph”, Zenodo 2023, (doi: 10.5281/zenodo.7787094). 664
By Hamiltonian-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi: 666
10.5281/zenodo.7781476). 667
HG219 [55] Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Cut 668
In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 669
10.5281/zenodo.7783082). 670
By Trace-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 672
10.5281/zenodo.7777857). 673

HG217 [57] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Trace-Neighbor 674
10.5281/zenodo.7779286). 676
HG215 [58] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 677
By Trace-Decomposition As Hyper Decompress On Super Decompensation”, Zenodo 2023, 678
(doi: 10.5281/zenodo.7771831). 679
HG214 [59] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of Trace- 680
Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 681
2023, (doi: 10.5281/zenodo.7772468). 682
By Trace-Cut As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 684
10.13140/RG.2.2.20913.25446). 685
HG212 [61] Henry Garrett, “New Ideas On Super Tract By Hyper Track Of Trace-Cut In 686
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 687
10.5281/zenodo.7764916). 688
By Edge-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 690
10.13140/RG.2.2.11770.98247). 691
HG210 [63] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Edge-Neighbor In 692
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 693
10.13140/RG.2.2.12400.12808). 694
By Edge-Decomposition As Hyper Decompress On Super Decompensation”, ResearchGate 696
2023, (doi: 10.13140/RG.2.2.22545.10089). 697
Edge-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 699
ResearchGate 2023, (doi: 10.13140/RG.2.2.29544.34564). 700
HG207 [66] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyper- 701
Graph By Edge-Cut As Hyper Edify On Super Eddy”, ResearchGate 2023, (doi: 702
10.13140/RG.2.2.11377.76644). 703
HG206 [67] Henry Garrett, “New Ideas On Super Eddy By Hyper Edify Of Edge-Cut In Can- 704
cer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 705
10.13140/RG.2.2.23750.96329). 706
By Vertex-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 708
10.13140/RG.2.2.31366.24641). 709
HG204 [69] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Vertex-Neighbor In 710
10.13140/RG.2.2.34721.68960). 712

Graph By Vertex-Decomposition As Hyper Decompress On Super Decompensation”, 714
Vertex-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 717
Graph By Vertex-Cut As Hyper Vertu On Super Vertigo”, ResearchGate 2023, (doi: 720
10.13140/RG.2.2.24288.35842). 721
HG200 [73] Henry Garrett, “New Ideas On Super Vertigo By Hyper Vertu Of Vertex-Cut In 722
10.13140/RG.2.2.32467.25124). 724
By Stable-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 726
10.13140/RG.2.2.31025.45925). 727
HG198 [75] Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of Stable-Neighbor In 728
10.13140/RG.2.2.17184.25602). 730
By Stable-Decompositions As Hyper Stain On Super Stagy”, ResearchGate 2023, (doi: 732
10.13140/RG.2.2.23423.28327). 733
HG196 [77] Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Decompositions In 734
10.13140/RG.2.2.28456.44805). 736
Graph By Stable-Cut As Hyper Stain On Super Stagy”, ResearchGate 2023, (doi: 738
10.13140/RG.2.2.23525.68320). 739
HG194 [79] Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Cut In 740
10.13140/RG.2.2.20170.24000). 742
By Clique-Neighbors As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 744
10.13140/RG.2.2.36475.59683). 745
HG192 [81] Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of Clique-Neighbors In 746
10.13140/RG.2.2.29764.71046). 748
By Clique-Decompositions As Hyper Decompile On Super Decommission”, ResearchGate 750
2023, (doi: 10.13140/RG.2.2.18780.87683). 751

Clique- Decompositions In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 753
Graph By Clique-Cut As Hyper Click On Super Cliche”, ResearchGate 2023, (doi: 756
10.13140/RG.2.2.26134.01603). 757
HG188 [85] Henry Garrett, “New Ideas On Super Cliff By Hyper Cling Of Clique-Cut In 758
10.13140/RG.2.2.27392.30721). 760
HG187 [86] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHy- 761
perGraph By Space As Hyper Spin On Super Spacy”, ResearchGate 2023, (doi: 762
10.13140/RG.2.2.33028.40321). 763
Graph By List- Coloring As Hyper List On Super Lisle”, ResearchGate 2023, (doi: 765
10.13140/RG.2.2.21389.20966). 766
HG185 [88] Henry Garrett, “New Ideas On Super Lith By Hyper Lite Of List-Coloring In 767
10.13140/RG.2.2.16356.04489). 769
perGraph By Space As Hyper Sparse On Super Spark”, ResearchGate 2023, (doi: 771
10.13140/RG.2.2.21756.21129). 772
HG183 [90] Henry Garrett, “New Ideas On Super Solidarity By Hyper Soul Of Space In Can- 773
cer’s Recognition With (Extreme) SuperHyperGraph”, ResearchGate 2023, (doi: 774
10.13140/RG.2.2.30983.68009). 775
By Edge-Connectivity As Hyper Disclosure On Super Closure”, ResearchGate 2023, (doi: 777
10.13140/RG.2.2.28552.29445). 778
HG181 [92] Henry Garrett, “New Ideas On Super Uniform By Hyper Deformation Of Edge- 779
Connectivity In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Re- 780
searchGate 2023, (doi: 10.13140/RG.2.2.10936.21761). 781
By Vertex-Connectivity As Hyper Leak On Super Structure”, ResearchGate 2023, (doi: 783
10.13140/RG.2.2.35105.89447). 784
HG179 [94] Henry Garrett, “New Ideas On Super System By Hyper Explosions Of Vertex-Connectivity 785
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, 786
(doi: 10.13140/RG.2.2.30072.72960). 787
By Tree-Decomposition As Hyper Forward On Super Returns”, ResearchGate 2023, (doi: 789
10.13140/RG.2.2.31147.52003). 790

HG177 [96] Henry Garrett, “New Ideas On Super Nodes By Hyper Moves Of Tree-Decomposition In 791
10.13140/RG.2.2.32825.24163). 793
Graph By Chord As Hyper Excellence On Super Excess”, ResearchGate 2023, (doi: 795
10.13140/RG.2.2.13059.58401). 796
HG175 [98] Henry Garrett, “New Ideas On Super Gap By Hyper Navigations Of Chord In 797
10.13140/RG.2.2.11172.14720). 799
By SuperHyper(i,j)-Domination As Hyper Controller On Super Waves”, ResearchGate 801
2023, (doi: 10.13140/RG.2.2.22011.80165). 802
HG173 [100] Henry Garrett, “New Ideas On Super Coincidence By Hyper Routes Of SuperHyper(i,j)- 803
Domination In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchG- 804
ate 2023, (doi: 10.13140/RG.2.2.30819.84003). 805
Graph By SuperHyperEdge-Domination As Hyper Reversion On Super Indirection”, 807
HG171 [102] Henry Garrett, “New Ideas On Super Obstacles By Hyper Model Of SuperHyperEdge- 809
ate 2023, (doi: 10.13140/RG.2.2.13849.29280). 811
By SuperHyperK-Domination As Hyper k-Actions On Super Patterns”, ResearchGate 813
2023, (doi: 10.13140/RG.2.2.19944.14086). 814
HG169 [104] Henry Garrett, “New Ideas On Super Harmony By Hyper k-Function Of SuperHyperK- 815
ate 2023, (doi: 10.13140/RG.2.2.23299.58404). 817
By SuperHyperK-Number As Hyper k-Partition On Super Layers”, ResearchGate 2023, 819
(doi: 10.13140/RG.2.2.33103.76968). 820
HG167 [106] Henry Garrett, “New Ideas On Super Gradient By Hyper k-Class Of SuperHyperK- 821
Number In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 822
2023, (doi: 10.13140/RG.2.2.23037.44003). 823
By SuperHyperOrder As Hyper Enumerations On Super Landmarks”, ResearchGate 2023, 825
(doi: 10.13140/RG.2.2.35646.56641). 826
HG165 [108] Henry Garrett, “New Ideas On Super Analogous By Hyper Visions Of SuperHyperOrder 827
(doi: 10.13140/RG.2.2.18030.48967). 829

By SuperHyperColoring As Hyper Categories On Super Neighbors”, ResearchGate 2023, 831
(doi: 10.13140/RG.2.2.13973.81121). 832
HG163 [110] Henry Garrett, “New Ideas On Super Relations By Hyper Identifications Of SuperHyper- 833
Coloring In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 834
2023, (doi: 10.13140/RG.2.2.34106.47047). 835
HG162 [111] Henry Garrett, “New Ideas On Super Contradiction By Hyper Detection of SuperHyper- 836
Defensive In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 837
By SuperHyperDimension As Hyper Distinguishing On Super Distances”, ResearchGate 840
2023, (doi: 10.13140/RG.2.2.31956.88961). 841
HG160 [113] Henry Garrett, “New Ideas On Super Locations By Hyper Differing Of SuperHyperDi- 842
mension In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 843
2023, (doi: 10.13140/RG.2.2.15179.67361). 844
By SuperHyperDominating As Hyper Closing On Super Messy”, ResearchGate 2023, (doi: 846
10.13140/RG.2.2.21510.45125). 847
HG158 [115] Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDomin- 848
ating In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 849
2023, (doi: 10.13140/RG.2.2.13121.84321). 850
By SuperHyperConnected As Hyper Group On Super Surge”, ResearchGate 2023, (doi: 852
10.13140/RG.2.2.11758.69441). 853
HG156 [117] Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of SuperHyperCon- 854
nected In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 855
2023, (doi: 10.13140/RG.2.2.31891.35367). 856
By SuperHyperTotal As Hyper Covering On Super Infections”, ResearchGate 2023, (doi: 858
10.13140/RG.2.2.19360.87048). 859
HG154 [119] Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyper- 860
Total In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 861
2023, (doi: 10.13140/RG.2.2.32363.21286). 862
HG153 [120] Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect 863
In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, 864
(doi: 10.13140/RG.2.2.23266.81602). 865
By SuperHyperPerfect As Hyper Idealism On Super Vacancy”, ResearchGate 2023, (doi: 867
10.13140/RG.2.2.19911.37285). 868

By SuperHyperJoin As Hyper Separations On Super Sorts”, ResearchGate 2023, (doi: 870
10.13140/RG.2.2.11050.90569). 871
HG150 [123] Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of 872
SuperHyperJoin In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, 873
HG149 [124] Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of SuperHy- 875
perDuality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 876
HG148 [125] Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyper- 878
Graph By SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, 879
HG147 [126] Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph 881
By Path SuperHyperColoring As Hyper Correction On Super Faults”, ResearchGate 2023, 882
(doi: 10.13140/RG.2.2.30182.50241). 883
HG146 [127] Henry Garrett, “New Ideas On Super Reflections By Hyper Rotations Of Path SuperHy- 884
perColoring In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 885
HG145 [128] Henry Garrett, “New Ideas As Hyper Deformations On Super Chains In Cancer’s 887
Neutrosophic Recognition and Neutrosophic SuperHyperGraph By SuperHyperDensity”, 888
HG144 [129] Henry Garrett, “New Ideas As Hyper Ignorance By SuperHyperDensity On Super 890
Resistances In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 891
ResearchGate 2023, (doi:10.13140/RG.2.2.16800.05123). 892
HG143 [130] Henry Garrett, “New Research On Cancer’s Recognition and Neutrosophic SuperHyper- 893
Graph By Eulerian SuperHyperCycles and Hamiltonian Sets As Hyper Covering Versus 894
Super separations-VI”, ResearchGate 2023, (doi: 10.13140/RG.2.2.29913.80482). 895
Super separations-V”, ResearchGate 2023, (doi: 10.13140/RG.2.2.33269.24809). 898
Super separations-IV”, ResearchGate 2023, (doi: 10.13140/RG.2.2.34946.96960). 901
HG140 [133] Henry Garrett, “A Research On Cancer’s Recognition and Neutrosophic SuperHyperGraph 902
By Eulerian SuperHyperCycles and Hamiltonian Sets As Hyper Covering Versus Super 903
separations-III”, ResearchGate 2023, (doi: 10.13140/RG.2.2.14814.31040). 904
separations-II”, ResearchGate 2023, (doi: 10.13140/RG.2.2.15653.17125). 907

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

HG136 [137] Henry Garrett, “Cancer’s Neutrosophic Recognition As Neutrosophic SuperHyperGraph 914
By SuperHyperConnectivities As Hyper Diagnosis On Super Mechanism”, ResearchGate 915
2023, (doi: 10.13140/RG.2.2.17252.24968). 916
HG135 [138] Henry Garrett,“Cancer’s Recognition and (Neutrosophic) SuperHyperGraph By the 917
Criteria of Eulerian and Hamiltonian Type-Sets As Hyper Modified Cycles On Super 918
Mess”, ResearchGate 2023,(doi: 10.13140/RG.2.2.16652.59525). 919
HG134 [139] Henry Garrett,“Eulerian and Hamiltonian In Cancer’s Neutrosophic Recognition and 920
Neutrosophic SuperHyperGraph On Super Interactions By Hyper Extensions of Cycles”, 921
ResearchGate 2023,(doi: 10.13140/RG.2.2.34583.24485). 922
HG132 [140] Henry Garrett,“SuperHyperGirth Type-Results on extreme SuperHyperGirth theory and 923
(Neutrosophic) SuperHyperGraphs Toward Cancer’s extreme Recognition”, Preprints 924

2023, 2023010396 (doi: 10.20944/preprints202301.0396.v1). 925
HG131 [141] Henry Garrett,“Neutrosophic SuperHyperGraphs Warns Hyper Landmark of neutrosophic 926
SuperHyperGirth In Super Type-Versions of Cancer’s neutrosophic Recognition”, Preprints 927
2023, 2023010395 (doi: 10.20944/preprints202301.0395.v1). 928
HG130 [142] Henry Garrett,“The Constructions of (Neutrosophic) SuperHyperGraphs on the Cancer’s 929
Recognition in The Confrontation With Super Attacks In Hyper Situations By 930
Implementing (Neutrosophic) 1-Failed SuperHyperForcing in The Technical Approaches to 931
Neutralize SuperHyperViews”, ResearchGate 2023, (doi: 10.13140/RG.2.2.26240.51204). 932
HG129 [143] Henry Garrett,“(Neutrosophic) 1-Failed SuperHyperForcing As the Entrepreneurs on 933

Cancer’s Recognitions To Fail Forcing Style As the Super Classes With Hyper Effects 934
In The Background of the Framework is So-Called (Neutrosophic) SuperHyperGraphs”, 935
HG128 [144] Henry Garrett,“Super Actions On The Types of Hyper Levels In The Sensible 937
Neutrosophic SuperHyperGirth On Cancer’s Neutrosophic Recognition and Neutrosophic 938
SuperHyperGraph”, ResearchGate 2023,(doi: 10.13140/RG.2.2.26836.88960). 939
HG127 [145] Henry Garrett,“SuperHyperGirth Approaches on the Super Challenges on the Cancer’s 940
Recognition In the Hyper Model of (Neutrosophic) SuperHyperGraph”, ResearchGate 941

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

HG125 [147] Henry Garrett,“Uncertainty On The Act And Effect Of Cancer Alongside The Foggy 946
10.20944/preprints202301.0282.v1). 949
HG124 [148] Henry Garrett,“Neutrosophic Version Of Separates Groups Of Cells In Cancer’s 950
10.20944/preprints202301.0267.v1).). 952
HG123 [149] Henry Garrett, “The Shift Paradigm To Classify Separately The Cells and Affected 953
Cells Toward The Totality Under Cancer’s Recognition By New Multiple Definitions On 954
the Sets Polynomials Alongside Numbers In The (Neutrosophic) SuperHyperMatching 955
Theory Based on SuperHyperGraph and Neutrosophic SuperHyperGraph”, Preprints 956
2023, 2023010265 (doi: 10.20944/preprints202301.0265.v1). 957
HG122 [150] Henry Garrett,“Breaking the Continuity and Uniformity of Cancer In The Worst Case of 958
prints202301.0262.v1). 961
HG121 [151] Henry Garrett, “Neutrosophic Failed SuperHyperStable as the Survivors on the 962
Cancer’s Neutrosophic Recognition Based on Uncertainty to All Modes in Neutrosophic 963
SuperHyperGraphs”, Preprints 2023, 2023010240 (doi: 10.20944/preprints202301.0240.v1). 964
2023010224, (doi: 10.20944/preprints202301.0224.v1). 967
HG24 [153] Henry Garrett,“SuperHyperMatching By (R-)Definitions And Polynomials To Monitor 968

Cancer’s Recognition In Neutrosophic SuperHyperGraphs”, ResearchGate 2023,(doi: 969
10.13140/RG.2.2.35061.65767). 970
HG25 [154] Henry Garrett,“The Focus on The Partitions Obtained By Parallel Moves In The 971
Cancer’s Extreme Recognition With Different Types of Extreme SuperHyperMatching 972
Set and Polynomial on (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 973
10.13140/RG.2.2.18494.15680). 974
HG26 [155] Henry Garrett,“Extreme Failed SuperHyperClique Decides the Failures on the Can- 975
cer’s Recognition in the Perfect Connections of Cancer’s Attacks By SuperHy- 976
perModels Named (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 977
10.13140/RG.2.2.32530.73922). 978
HG27 [156] Henry Garrett,“Indeterminacy On The All Possible Connections of Cells In Front 979
of Cancer’s Attacks In The Terms of Neutrosophic Failed SuperHyperClique on Can- 980
cer’s Recognition called Neutrosophic SuperHyperGraphs”, ResearchGate 2023, (doi: 981
10.13140/RG.2.2.15897.70243). 982
10.13140/RG.2.2.32530.73922). 986

prints202301.0105.v1). 989
HG28 [159] Henry Garrett,“Perfect Directions Toward Idealism in Cancer’s Neutrosophic Recogni- 990
tion Forwarding Neutrosophic SuperHyperClique on Neutrosophic SuperHyperGraphs”, 991

HG29 [160] Henry Garrett,“Demonstrating Complete Connections in Every Embedded Regions 993
and Sub-Regions in the Terms of Cancer’s Recognition and (Neutrosophic) Su- 994
perHyperGraphs With (Neutrosophic) SuperHyperClique”, ResearchGate 2023, (doi: 995
10.13140/RG.2.2.23172.19849). 996
HG30 [163] Henry Garrett,“Different Neutrosophic Types of Neutrosophic Regions titled neut- 1003
rosophic Failed SuperHyperStable in Cancer’s Neutrosophic Recognition modeled 1004
in the Form of Neutrosophic SuperHyperGraphs”, ResearchGate 2023, (doi: 1005
10.13140/RG.2.2.17385.36968). 1006
HG107 [164] Henry Garrett, “Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction 1007
To Use Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition And 1008

Beyond”, Preprints 2023, 2023010044 1009
SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010043 1011
(doi: 10.20944/preprints202301.0043.v1). 1012
HG31 [166] Henry Garrett, “Using the Tool As (Neutrosophic) Failed SuperHyperStable To SuperHy- 1013
perModel Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs”, ResearchGate 1014
2023, (doi: 10.13140/RG.2.2.28945.92007). 1015
SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 1020

10.13140/RG.2.2.35774.77123). 1021

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

(doi: 10.20944/preprints202212.0549.v1). 1033
(Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, ResearchGate 2022, (doi: 1035
10.13140/RG.2.2.19380.94084). 1036
SuperHyperClasses”, Preprints 2022, 2022120540 (doi: 10.20944/preprints202212.0540.v1). 1040
SuperHyperClasses”, ResearchGate 2022, (doi: 10.13140/RG.2.2.14426.41923). 1044

(doi: 10.20944/preprints202212.0500.v1). 1047
Graph With SuperHyperModeling of Cancer’s Recognitions”, ResearchGate 2022 (doi: 1049
10.13140/RG.2.2.20993.12640). 1050
HG952 [178] Henry Garrett,“Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic Su- 1051
perHyperGraphs and SuperHyperGraphs Alongside Applications in Cancer’s Treatments”, 1052
SuperHyperGraphs And SuperHyperGraphs Alongside Applications in Cancer’s Treat- 1055
ments”, ResearchGate 2022 (doi: 10.13140/RG.2.2.23123.04641). 1056
HG942 [180] Henry Garrett, “SuperHyperDominating and SuperHyperResolving on Neutrosophic 1057
SuperHyperGraphs And Their Directions in Game Theory and Neutrosophic SuperHyper- 1058
Classes”, Preprints 2022, 2022110576 (doi: 10.20944/preprints202211.0576.v1). 1059
HG94 [181] Henry Garrett, “SuperHyperDominating and SuperHyperResolving on Neutrosophic 1060

SuperHyperGraphs And Their Directions in Game Theory and Neutrosophic SuperHyper- 1061
Classes”, ResearchGate 2022 (doi: 10.13140/RG.2.2.23324.56966). 1062

HG37 [182] Henry Garrett, “Basic Neutrosophic Notions Concerning SuperHyperDominating and 1063
Neutrosophic SuperHyperResolving in SuperHyperGraph”, ResearchGate 2022 (doi: 1064
10.13140/RG.2.2.29173.86244). 1065
HG38 [183] Henry Garrett, “Initial Material of Neutrosophic Preliminaries to Study Some Neutrosophic 1066
Notions Based on Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic SuperHyper- 1067

Graph (NSHG)”, ResearchGate 2022 (doi: 10.13140/RG.2.2.25385.88160). 1068
HG164b [184] Henry Garrett, “Eulerian-Type-Path-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 1069
2023 (doi: 10.5281/zenodo.7851893). 1070
HG163b [185] Henry Garrett, “Eulerian-Type-Path-Decomposition In SuperHyperGraphs”. Dr. Henry 1071

Garrett, 2023 (doi: 10.5281/zenodo.7848019). 1072
HG162b [186] Henry Garrett, “Eulerian-Type-Path-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1073
(doi: 10.5281/zenodo.7835063). 1074
HG161b [187] Henry Garrett, “Eulerian-Path-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1075
(doi: 10.5281/zenodo.7826705). 1076
HG160b [188] Henry Garrett, “Eulerian-Path-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 1077
2023 (doi: 10.5281/zenodo.7820680). 1078
HG159b [189] Henry Garrett, “Eulerian-Path-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1079
10.5281/zenodo.7812750). 1080
HG158b [190] Henry Garrett, “Hamiltonian-Type-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry 1081

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

Henry Garrett, 2023 (doi: 10.5281/zenodo.7810394). 1084
HG156b [192] Henry Garrett, “Hamiltonian-Type-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 1085
2023 (doi: 10.5281/zenodo.7807782). 1086
HG155b [193] Henry Garrett, “Hamiltonian-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 1087
2023 (doi: 10.5281/zenodo.7804449). 1088
HG154b [194] Henry Garrett, “Hamiltonian-Cycle-Decomposition In SuperHyperGraphs”. Dr. Henry 1089

HG153b [195] Henry Garrett, “Hamiltonian-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1091
(doi: 10.5281/zenodo.7792307). 1092
HG152b [196] Henry Garrett, “Hamiltonian-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1093
(doi: 10.5281/zenodo.7790728). 1094
HG151b [197] Henry Garrett, “Hamiltonian-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 1095
2023 (doi: 10.5281/zenodo.7787712). 1096
HG150b [198] Henry Garrett, “Hamiltonian-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1097
10.5281/zenodo.7783791). 1098

HG149b [199] Henry Garrett, “Trace-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1099
10.5281/zenodo.7780123). 1100
HG148b [200] Henry Garrett, “Trace-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1101
(doi: 10.5281/zenodo.7773119). 1102
HG147b [201] Henry Garrett, “SuperHyperDuality”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1103
odo.7637762). 1104
HG146b [202] Henry Garrett, “Trace-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1105
10.5281/zenodo.7766174). 1106
HG145b [203] Henry Garrett, “Edge-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1107
10.5281/zenodo.7762232). 1108
HG144b [204] Henry Garrett, “Edge-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1109
(doi: 10.5281/zenodo.7758601). 1110
HG143b [205] Henry Garrett, “Edge-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1111
10.5281/zenodo.7754661). 1112
HG142b [206] Henry Garrett, “Vertex-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1113
10.5281/zenodo.7750995) . 1114
HG141b [207] Henry Garrett, “Vertex-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1115
(doi: 10.5281/zenodo.7749875). 1116
HG140b [208] Henry Garrett, “Vertex-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1117
10.5281/zenodo.7747236). 1118
HG139b [209] Henry Garrett, “Stable-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1119
10.5281/zenodo.7742587). 1120
HG138b [210] Henry Garrett, “Stable-Decompositions In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1121
(doi: 10.5281/zenodo.7738635). 1122
HG137b [211] Henry Garrett, “Stable-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1123
10.5281/zenodo.7734719). 1124
HG136b [212] Henry Garrett, “Clique-Neighbors In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1125
10.5281/zenodo.7730484). 1126
HG135b [213] Henry Garrett, “Clique-Decompositions In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1127
(doi: 10.5281/zenodo.7730469). 1128
HG134b [214] Henry Garrett, “Clique-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1129
10.5281/zenodo.7722865). 1130
HG133b [215] Henry Garrett, “Space In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1131
odo.7713563). 1132
odo.7709116). 1134

HG131b [217] Henry Garrett, “Edge-Connectivity In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1135
10.5281/zenodo.7706415). 1136
HG130b [218] Henry Garrett, “Vertex-Connectivity In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1137
(doi: 10.5281/zenodo.7706063). 1138
HG129b [219] Henry Garrett, “Tree-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1139
(doi: 10.5281/zenodo.7701906). 1140
HG128b [220] Henry Garrett, “Chord In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1141
odo.7700205). 1142
HG127b [221] Henry Garrett, “(i,j)-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1143
10.5281/zenodo.7694876). 1144
HG126b [222] Henry Garrett, “Edge-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1145
10.5281/zenodo.7679410). 1146
HG125b [223] Henry Garrett, “K-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1147
10.5281/zenodo.7675982). 1148
HG124b [224] Henry Garrett, “K-Number In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1149
10.5281/zenodo.7672388). 1150
HG123b [225] Henry Garrett, “Order In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1151
odo.7668648). 1152
HG122b [226] Henry Garrett, “Coloring In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1153
10.5281/zenodo.7662810). 1154
HG121b [227] Henry Garrett, “Dimension In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1155
10.5281/zenodo.7659162). 1156
HG120b [228] Henry Garrett, “Cancer In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1157
odo.7653233). 1158
HG119b [229] Henry Garrett, “SuperHyperWheel”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1159
odo.7653204). 1160
HG118b [230] Henry Garrett, “SuperHyperMultipartite”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1161
odo.7653142). 1162
HG117b [231] Henry Garrett, “SuperHyperBipartite”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1163
odo.7653117). 1164
HG116b [232] Henry Garrett, “SuperHyperStar”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1165
odo.7653089). 1166
HG115b [233] Henry Garrett, “SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1167
odo.7651687). 1168
HG114b [234] Henry Garrett, “SuperHyperPath”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1169
odo.7651619). 1170

HG113b [235] Henry Garrett, “SuperHyperDomination”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1171
odo.7651439). 1172
HG112b [236] Henry Garrett, “SuperHyperDominating”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1173
odo.7650729). 1174
HG111b [237] Henry Garrett, “SuperHyperConnected”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1175
odo.7647868). 1176
HG110b [238] Henry Garrett, “SuperHyperTotal”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1177
odo.7647017). 1178
HG109b [239] Henry Garrett, “SuperHyperPerfect”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1179
odo.7644894). 1180
HG108b [240] Henry Garrett, “SuperHyperJoin”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1181
odo.7641880). 1182
HG107b [241] Henry Garrett, “Path SuperHyperColoring”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1183
odo.7632923). 1184
HG106b [242] Henry Garrett, “SuperHyperDensity”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1185
odo.7623459). 1186
HG105b [243] Henry Garrett, “Neutrosophic SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 1187
10.5281/zenodo.7606416). 1188
HG104b [244] Henry Garrett, “Extreme SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 1189
10.5281/zenodo.7606416). 1190
HG103b [245] Henry Garrett, “SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1191
odo.7606404). 1192
HG102b [246] Henry Garrett, “Neutrosophic SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 1193
10.5281/zenodo.7580018). 1194
HG101b [247] Henry Garrett, “Extreme SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1195
odo.7580018). 1196
odo.7580018). 1198
odo.7579929). 1200
HG98b [250] Henry Garrett, “Neutrosophic SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 1201
10.5281/zenodo.7563170). 1202
HG97b [251] Henry Garrett, “Extreme SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1203
odo.7563164). 1204
HG96b [252] Henry Garrett, “SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1205
odo.7563160). 1206

odo.7563160). 1208
HG94b [254] Henry Garrett, “Overlook On SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 1209
10.5281/zenodo.7563160). 1210
HG93b [255] Henry Garrett, “Neutrosophic SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 1211
10.5281/zenodo.7557063). 1212
HG92b [256] Henry Garrett, “Extreme SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 1213
10.5281/zenodo.7557009). 1214
HG91b [257] Henry Garrett, “Overlook On SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 1215
10.5281/zenodo.7539484). 1216
HG90b [258] Henry Garrett, “Neutrosophic Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1217
10.5281/zenodo.7523390). 1218
HG89b [259] Henry Garrett, “Extreme Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1219
10.5281/zenodo.7523390). 1220
HG88b [260] Henry Garrett, “Overlook On Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1221
10.5281/zenodo.7523390). 1222
HG87b [261] Henry Garrett, “Extreme SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1223
odo.7574952). 1224
HG86b [262] Henry Garrett, “Neutrosophic SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1225
10.5281/zenodo.7574992). 1226
odo.7523357). 1228
HG84b [264] Henry Garrett, “Overlook On SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1229
10.5281/zenodo.7523357). 1230
HG83b [265] Henry Garrett, “Neutrosophic Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1231
10.5281/zenodo.7504782). 1232
HG82b [266] Henry Garrett, “Extreme Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1233
10.5281/zenodo.7504782). 1234
HG81b [267] Henry Garrett, “Overlook On Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1235
10.5281/zenodo.7504782). 1236
HG80b [268] Henry Garrett, “Neutrosophic SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1237
10.5281/zenodo.7499395). 1238
HG79b [269] Henry Garrett, “Extreme SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1239
odo.7499395). 1240
HG78b [270] Henry Garrett, “Overlook On SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1241
10.5281/zenodo.7499395). 1242

HG77b [271] Henry Garrett, “Neutrosophic Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1243
10.5281/zenodo.7497450). 1244
HG76b [272] Henry Garrett, “Extreme Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1245
10.5281/zenodo.7497450). 1246
HG75b [273] Henry Garrett, “Neutrosophic SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1247
10.5281/zenodo.7494862). 1248
HG74b [274] Henry Garrett, “Extreme SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1249
odo.7494862). 1250
HG73b [275] Henry Garrett, “Overlook On SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1251
10.5281/zenodo.7494862). 1252
HG72b [276] Henry Garrett, “Neutrosophic SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 1253
10.5281/zenodo.7493845). 1254
HG71b [277] Henry Garrett, “Extreme SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 1255
10.5281/zenodo.7493845). 1256
HG70b [278] Henry Garrett, “Overlook On SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 1257
10.5281/zenodo.7493845). 1258
HG69b [279] Henry Garrett, “SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1259
odo.7539484). 1260
HG68b [280] Henry Garrett, “Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1261
odo.7523390). 1262
HG67b [281] Henry Garrett, “SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1263
odo.7523357). 1264
HG66b [282] Henry Garrett, “Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1265
odo.7504782). 1266
HG65b [283] Henry Garrett, “SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1267
odo.7499395). 1268
HG64b [284] Henry Garrett, “Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1269
odo.7497450). 1270
HG63b [285] Henry Garrett, “SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1271
odo.7494862). 1272
HG62b [286] Henry Garrett, “SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1273
odo.7493845). 1274
HG61b [287] Henry Garrett, “SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1275
odo.7480110). 1276
HG60b [288] Henry Garrett, “Neut. SuperHyperEdges”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1277
odo.7378758). 1278

HG32b [289] Henry Garrett, “Beyond Neutrosophic Graphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1279
odo.6320305). 1280
HG44b [290] Henry Garrett, “Neutrosophic Duality”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1281
odo.6677173). 1282

CHAPTER 3 1283
Acknowledgements 1284
The author is going to express his gratitude and his appreciation about the brains and their 1285
hands which are showing the importance of words in the framework of every wisdom, knowledge, 1286
arts, and emotions which are streaming in the lines from the words, notions, ideas and approaches The
1287 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
1288
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 1289
of acknowledgements
minds for surviving from them and making the outstanding experiences about the tools and the 1290
ideas to be on the star lines of words and shining like stars, forever. 1291
41
CHAPTER 4 1292
Cancer In Extreme SuperHyperGraph 1293
The cancer is the Extreme disease but the Extreme model is going to figure out what’s going on 1294
this Extreme phenomenon. The special Extreme case of this Extreme disease is considered and 1295
as the consequences of the model, some parameters are used. The cells are under attack of this 1296
disease but the moves of the cancer in the special region are the matter of mind. The Extreme 1297
recognition of the cancer could help to find some Extreme treatments for this Extreme disease. 1298
In the following, some Extreme steps are Extreme devised on this disease. 1299
Step 1. (Extreme Definition) The Extreme recognition of the cancer in the long-term Extreme 1300
function. 1301
Step 2. (Extreme Issue) The specific region has been assigned by the Extreme model [it’s 1302
called Extreme SuperHyperGraph] and the long Extreme cycle of the move from the cancer 1303
is identified by this research. Sometimes the move of the cancer hasn’t be easily identified 1304
since there are some determinacy, indeterminacy and neutrality about the moves and the 1305
effects of the cancer on that region; this event leads us to choose another model [it’s said 1306
to be Extreme SuperHyperGraph] to have convenient perception on what’s happened and 1307
what’s done. 1308
Step 3. (Extreme Model) There are some specific Extreme models, which are well-known and 1309
they’ve got the names, and some general Extreme models. The moves and the Extreme 1310
traces of the cancer on the complex tracks and between complicated groups of cells could be 1311
fantasized by an Extreme SuperHyperPath(-/SuperHyperK-Domination, SuperHyperStar, 1312
SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find 1313
either the Extreme SuperHyperK-Domination or the Extreme SuperHyperK-Domination 1314
in those Extreme Extreme SuperHyperModels. 1315
Some cells have been faced with some attacks from the situation which is caused by the 1316
cancer’s attacks. In this case, there are some embedded analysis on the ongoing situations 1317
which in that, the cells could be labelled as some groups and some groups or individuals have 1318
excessive labels which all are raised from the behaviors to overcome the cancer’s attacks. In 1319
the embedded situations, the individuals of cells and the groups of cells could be considered 1320
as “new groups”. Thus it motivates us to find the proper SuperHyperModels for getting more 1321
proper analysis on this messy story. I’ve found the SuperHyperModels which are officially 1322
called “SuperHyperGraphs” and “Extreme SuperHyperGraphs”. In this SuperHyperModel, the 1323
cells and the groups of cells are defined as “SuperHyperVertices” and the relations between 1324
43
the individuals of cells and the groups of cells are defined as “SuperHyperEdges”. Thus it’s 1325
another motivation for us to do research on this SuperHyperModel based on the “Cancer’s 1326
Recognition”. Sometimes, the situations get worst. The situation is passed from the certainty 1327
and precise style. Thus it’s the beyond them. There are three descriptions, namely, the 1328
degrees of determinacy, indeterminacy and neutrality, for any object based on vague forms, 1329
namely, incomplete data, imprecise data, and uncertain analysis. The latter model could be 1330
considered on the previous SuperHyperModel. It’s SuperHyperModel. It’s SuperHyperGraph 1331

but it’s officially called “Extreme SuperHyperGraphs”. The cancer is the disease but the model 1332
is going to figure out what’s going on this phenomenon. The special case of this disease is 1333
considered and as the consequences of the model, some parameters are used. The cells are 1334
under attack of this disease but the moves of the cancer in the special region are the matter of 1335
mind. The recognition of the cancer could help to find some treatments for this disease. The 1336
SuperHyperGraph and Extreme SuperHyperGraph are the SuperHyperModels on the “Cancer’s 1337
Recognition” and both bases are the background of this research. Sometimes the cancer has 1338
been happened on the region, full of cells, groups of cells and embedded styles. In this segment, 1339
the SuperHyperModel proposes some SuperHyperNotions based on the connectivities of the 1340
moves of the cancer in the forms of alliances’ styles with the formation of the design and the 1341
architecture are formally called “ SuperHyperK-Domination” in the themes of jargons and 1342
buzzwords. The prefix “SuperHyper” refers to the theme of the embedded styles to figure out 1343
the background for the SuperHyperNotions. The recognition of the cancer in the long-term 1344
function. The specific region has been assigned by the model [it’s called SuperHyperGraph] 1345
and the long cycle of the move from the cancer is identified by this research. Sometimes the 1346
move of the cancer hasn’t be easily identified since there are some determinacy, indeterminacy 1347
and neutrality about the moves and the effects of the cancer on that region; this event leads 1348
us to choose another model [it’s said to be Extreme SuperHyperGraph] to have convenient 1349
perception on what’s happened and what’s done. There are some specific models, which 1350
are well-known and they’ve got the names, and some general models. The moves and the 1351
traces of the cancer on the complex tracks and between complicated groups of cells could 1352
be fantasized by an Extreme SuperHyperPath (-/SuperHyperK-Domination, SuperHyperStar, 1353
SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find either the 1354
optimal SuperHyperK-Domination or the Extreme SuperHyperK-Domination in those Extreme 1355

SuperHyperModels. Some general results are introduced. Beyond that in SuperHyperStar, 1356
all possible Extreme SuperHyperPath s have only two SuperHyperEdges but it’s not enough 1357
since it’s essential to have at least three SuperHyperEdges to form any style of a SuperHyperK- 1358
Domination. There isn’t any formation of any SuperHyperK-Domination but literarily, it’s the 1359
deformation of any SuperHyperK-Domination. It, literarily, deforms and it doesn’t form. 1360
Question 4.0.1. How to define the SuperHyperNotions and to do research on them to find the “ 1361
amount of SuperHyperK-Domination” of either individual of cells or the groups of cells based on 1362
the fixed cell or the fixed group of cells, extensively, the “amount of SuperHyperK-Domination” 1363
based on the fixed groups of cells or the fixed groups of group of cells? 1364
Question 4.0.2. What are the best descriptions for the “Cancer’s Recognition” in terms of these 1365
messy and dense SuperHyperModels where embedded notions are illustrated? 1366
It’s motivation to find notions to use in this dense model is titled “SuperHyperGraphs”. 1367
Thus it motivates us to define different types of “ SuperHyperK-Domination” and “Extreme 1368
SuperHyperK-Domination” on “SuperHyperGraph” and “Extreme SuperHyperGraph”. Then the 1369

research has taken more motivations to define SuperHyperClasses and to find some connections 1370
amid this SuperHyperNotion with other SuperHyperNotions. It motivates us to get some 1371
instances and examples to make clarifications about the framework of this research. The general 1372
results and some results about some connections are some avenues to make key point of this 1373
research, “Cancer’s Recognition”, more understandable and more clear. 1374
Some SuperHyperClasses and some Extreme SuperHyperClasses are the cases of this research 1375
on the modeling of the regions where are under the attacks of the cancer to recognize 1376
this disease as it’s mentioned on the title “Cancer’s Recognitions”. To formalize the 1377
instances on the SuperHyperNotion, SuperHyperK-Domination, the new SuperHyperClasses 1378
and SuperHyperClasses, are introduced. Some general results are gathered in the section on 1379
the SuperHyperK-Domination and the Extreme SuperHyperK-Domination. The clarifications, 1380
instances and literature reviews have taken the whole way through. In this scientific research, 1381
the literature reviews have fulfilled the lines containing the notions and the results. The 1382
SuperHyperGraph and Extreme SuperHyperGraph are the SuperHyperModels on the “Cancer’s 1383
Recognitions” and both bases are the background of this research. Sometimes the cancer has 1384
been happened on the region, full of cells, groups of cells and embedded styles. In this scientific 1385
segment, the SuperHyperModel proposes some SuperHyperNotions based on the connectivities 1386
of the moves of the cancer in the longest and strongest styles with the formation of the design 1387
and the architecture are formally called “ SuperHyperK-Domination” in the themes of jargons 1388
and buzzwords. The prefix “SuperHyper” refers to the theme of the embedded styles to figure 1389
out the background for the SuperHyperNotions. 1390

CHAPTER 5 1391
Extreme Eulerian-Type-Path-Neighbor 1392
Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of SuperHyperDu- 1393
ality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, ResearchGate 1394
2023, (doi: 10.13140/RG.2.2.34953.52320). 1395

Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph By 1396
SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchGate 2023, 1397
(doi: 10.13140/RG.2.2.33275.80161). 1398
Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 1399
10.13140/RG.2.2.11050.90569). 1401
Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of SuperHyperJoin 1402
In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 1403
10.13140/RG.2.2.17761.79206). 1404
10.13140/RG.2.2.19911.37285). 1407
Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect 1408
10.13140/RG.2.2.23266.81602). 1410
10.13140/RG.2.2.19360.87048). 1413
Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal 1414
10.13140/RG.2.2.32363.21286). 1416
10.13140/RG.2.2.11758.69441). 1419
Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of SuperHyperConnected 1420
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 1421
10.13140/RG.2.2.31891.35367). 1422
10.13140/RG.2.2.21510.45125). 1425
47
Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDominating 1426
10.13140/RG.2.2.13121.84321). 1428

CHAPTER 6 1429
New Ideas On Super Nebulous By Hyper 1430
Nebbish Of 1431
Eulerian-Type-Path-Decomposition In 1432
Cancer’s Recognition With 1433
(Neutrosophic) SuperHyperGraph 1434
49
CHAPTER 7 1435
ABSTRACT 1436
In this scientific research, (Different Neutrosophic Types of Neutrosophic SuperHyperEulerian- 1437

Type-Path-Neighbor ). Assume a Neutrosophic SuperHyperGraph (NSHG) S is a Eulerian-Type-Path- 1438
0
Neighbor pair S = (V, E). Consider a Neutrosophic SuperHyperSet V = {V1 , V2 , . . . , Vs } and 1439
0 0 0
E = {E1 , E2 , . . . , Ez }. Then either V or E is called Neutrosophic e-SuperHyperEulerian-Type- 1440
Path-Neighbor if the following expression is called Neutrosophic e-SuperHyperEulerian-Type-Path-Neighbor 1441

criteria holds 1442
∀N (Ea ) ∈ P : P is
a SuperHyperPath and it has
the maximum number of SuperHyperEdges;
Neutrosophic re-SuperHyperEulerian-Type-Path-Neighbor if the following expression is called Neutro- 1443

sophic e-SuperHyperEulerian-Type-Path-Neighbor criteria holds 1444
∀N (Ea ) ∈ P : P is
and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; Neutrosophic v- 1445

SuperHyperEulerian-Type-Path-Neighbor if the following expression is called Neutrosophic v- 1446
SuperHyperEulerian-Type-Path-Neighbor criteria holds 1447
∀N (Va ) ∈ P : P is
Neutrosophic rv-SuperHyperEulerian-Type-Path-Neighbor if the following expression is called Neutro- 1448

sophic v-SuperHyperEulerian-Type-Path-Neighbor criteria holds 1449
∀N (Va ) ∈ P : P is
51
and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; Neutrosophic 1450

SuperHyperEulerian-Type-Path-Neighbor if it’s either of Neutrosophic e-SuperHyperEulerian-Type-Path- 1451
Neighbor, Neutrosophic re-SuperHyperEulerian-Type-Path-Neighbor, Neutrosophic v-SuperHyperEulerian- 1452
Type-Path-Neighbor, and Neutrosophic rv-SuperHyperEulerian-Type-Path-Neighbor. ((Neutrosophic) 1453
SuperHyperEulerian-Type-Path-Neighbor). Assume a Neutrosophic SuperHyperGraph (NSHG) S is 1454
a pair S = (V, E). Consider a Neutrosophic SuperHyperEdge (NSHE) E = {V1 , V2 , . . . , Vs }. 1455
Then E is called an Extreme SuperHyperEulerian-Type-Path-Neighbor if it’s either of Neutrosophic 1456

e-SuperHyperEulerian-Type-Path-Neighbor, Neutrosophic re-SuperHyperEulerian-Type-Path-Neighbor, Neut- 1457
rosophic v-SuperHyperEulerian-Type-Path-Neighbor, and Neutrosophic rv-SuperHyperEulerian-Type-Path- 1458
Neighbor and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum 1459
Extreme cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme 1460
SuperHyperEdges in the conseNeighborive Extreme sequence of Extreme SuperHyperEdges 1461
and Extreme SuperHyperVertices such that they form the Extreme SuperHyperEulerian-Type- 1462
Path-Neighbor; a Neutrosophic SuperHyperEulerian-Type-Path-Neighbor if it’s either of Neutrosophic 1463
e-SuperHyperEulerian-Type-Path-Neighbor, Neutrosophic re-SuperHyperEulerian-Type-Path-Neighbor, Neut- 1464
rosophic v-SuperHyperEulerian-Type-Path-Neighbor, and Neutrosophic rv-SuperHyperEulerian-Type- 1465
Path-Neighbor and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the 1466
maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic 1467
SuperHyperSet S of high Neutrosophic cardinality conseNeighborive Neutrosophic Super- 1468

HyperEdges and Neutrosophic SuperHyperVertices such that they form the Neutrosophic 1469
SuperHyperEulerian-Type-Path-Neighbor; an Extreme SuperHyperEulerian-Type-Path-Neighbor SuperHyper- 1470
Polynomial if it’s either of Neutrosophic e-SuperHyperEulerian-Type-Path-Neighbor, Neutrosophic 1471
re-SuperHyperEulerian-Type-Path-Neighbor, Neutrosophic v-SuperHyperEulerian-Type-Path-Neighbor, and 1472
Neutrosophic rv-SuperHyperEulerian-Type-Path-Neighbor and C(N SHG) for an Extreme Super- 1473
HyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme 1474
coefficients defined as the Extreme number of the maximum Extreme cardinality of the 1475
Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme cardinality 1476
conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 1477
form the Extreme SuperHyperEulerian-Type-Path-Neighbor; and the Extreme power is corresponded 1478
to its Extreme coefficient; a Neutrosophic SuperHyperEulerian-Type-Path-Neighbor SuperHyper- 1479

Neutrosophic rv-SuperHyperEulerian-Type-Path-Neighbor and C(N SHG) for a Neutrosophic SuperHy- 1482
perGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains the Neutrosophic 1483
coefficients defined as the Neutrosophic number of the maximum Neutrosophic cardinality of the 1484
Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic cardin- 1485

ality conseNeighborive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices 1486
such that they form the Neutrosophic SuperHyperEulerian-Type-Path-Neighbor; and the Neutrosophic 1487
power is corresponded to its Neutrosophic coefficient; an Extreme V-SuperHyperEulerian-Type- 1488
Path-Neighbor if it’s either of Neutrosophic e-SuperHyperEulerian-Type-Path-Neighbor, Neutrosophic 1489
Neutrosophic rv-SuperHyperEulerian-Type-Path-Neighbor and C(N SHG) for an Extreme SuperHy- 1491

perGraph N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet 1492
S of high Extreme cardinality of the Extreme SuperHyperVertices in the conseNeighborive 1493
Extreme sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that 1494
they form the Extreme SuperHyperEulerian-Type-Path-Neighbor; a Neutrosophic V-SuperHyperEulerian- 1495

Type-Path-Neighbor if it’s either of Neutrosophic e-SuperHyperEulerian-Type-Path-Neighbor, Neutrosophic 1496

perGraph N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic Super- 1499
HyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality conseNeigh- 1500
borive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they 1501
form the Neutrosophic SuperHyperEulerian-Type-Path-Neighbor; an Extreme V-SuperHyperEulerian-Type- 1502

Path-Neighbor SuperHyperPolynomial if it’s either of Neutrosophic e-SuperHyperEulerian-Type-Path- 1503
Type-Path-Neighbor, and Neutrosophic rv-SuperHyperEulerian-Type-Path-Neighbor and C(N SHG) for an 1505
Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the 1506
Extreme coefficients defined as the Extreme number of the maximum Extreme cardinality of 1507
the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality 1508

conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 1509
form the Extreme SuperHyperEulerian-Type-Path-Neighbor; and the Extreme power is corresponded 1510
to its Extreme coefficient; a Neutrosophic SuperHyperEulerian-Type-Path-Neighbor SuperHyper- 1511

perGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains the Neutrosophic 1515
coefficients defined as the Neutrosophic number of the maximum Neutrosophic cardinality of the 1516
Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic car- 1517
dinality conseNeighborive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices 1518
such that they form the Neutrosophic SuperHyperEulerian-Type-Path-Neighbor; and the Neutrosophic 1519
power is corresponded to its Neutrosophic coefficient. In this scientific research, new setting is 1520
introduced for new SuperHyperNotions, namely, a SuperHyperEulerian-Type-Path-Neighbor and Neut- 1521
rosophic SuperHyperEulerian-Type-Path-Neighbor. Two different types of SuperHyperDefinitions are 1522
debut for them but the research goes further and the SuperHyperNotion, SuperHyperUniform, 1523
and SuperHyperClass based on that are well-defined and well-reviewed. The literature review is 1524
implemented in the whole of this research. For shining the elegancy and the significancy of this 1525
research, the comparison between this SuperHyperNotion with other SuperHyperNotions and 1526
fundamental SuperHyperNumbers are featured. The definitions are followed by the examples 1527
and the instances thus the clarifications are driven with different tools. The applications are 1528
figured out to make sense about the theoretical aspect of this ongoing research. The “Cancer’s 1529
Recognition” are the under research to figure out the challenges make sense about ongoing and 1530
upcoming research. The special case is up. The cells are viewed in the deemed ways. There are 1531
different types of them. Some of them are individuals and some of them are well-modeled by 1532
the group of cells. These types are all officially called “SuperHyperVertex” but the relations 1533
“Neutrosophic SuperHyperGraph” are chosen and elected to research about “Cancer’s Recogni- 1535
tion”. Thus these complex and dense SuperHyperModels open up some avenues to research 1536
on theoretical segments and “Cancer’s Recognition”. Some avenues are posed to pursue this 1537
research. It’s also officially collected in the form of some questions and some problems. Assume 1538
a SuperHyperGraph. Assume a SuperHyperGraph. Then δ−SuperHyperEulerian-Type-Path-Neighbor 1539

first Expression, holds if S is an δ−SuperHyperOffensive. And the second Expression, holds 1543
if S is an δ−SuperHyperDefensive; a Neutrosophic δ−SuperHyperEulerian-Type-Path-Neighbor is a 1544
maximal Neutrosophic of SuperHyperVertices with maximum Neutrosophic cardinality 1545
such that either of the following expressions hold for the Neutrosophic cardinalities of Super- 1546
HyperNeighbors of s ∈ S there are: |S ∩ N (s)|N eutrosophic > |S ∩ (V \ N (s))|N eutrosophic + δ; 1547
and |S ∩ N (s)|N eutrosophic < |S ∩ (V \ N (s))|N eutrosophic + δ. The first Expression, holds 1548
if S is a Neutrosophic δ−SuperHyperOffensive. And the second Expression, holds if S is 1549
a Neutrosophic δ−SuperHyperDefensive It’s useful to define a “Neutrosophic” version 1550
of a SuperHyperEulerian-Type-Path-Neighbor . Since there’s more ways to get type-results to 1551
make a SuperHyperEulerian-Type-Path-Neighbor more understandable. For the sake of having 1552
Neutrosophic SuperHyperEulerian-Type-Path-Neighbor, there’s a need to “redefine” the notion of a 1553
“SuperHyperEulerian-Type-Path-Neighbor ”. The SuperHyperVertices and the SuperHyperEdges are 1554

assigned by the labels from the letters of the alphabets. In this procedure, there’s the usage 1555
of the position of labels to assign to the values. Assume a SuperHyperEulerian-Type-Path-Neighbor . 1556
It’s redefined a Neutrosophic SuperHyperEulerian-Type-Path-Neighbor if the mentioned Table holds, 1557
concerning, “The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges 1558
Belong to The Neutrosophic SuperHyperGraph” with the key points, “The Values of The 1559
Vertices & The Number of Position in Alphabet”, “The Values of The SuperVertices&The 1560
maximum Values of Its Vertices”, “The Values of The Edges&The maximum Values of Its 1561
Vertices”, “The Values of The HyperEdges&The maximum Values of Its Vertices”, “The 1562
Values of The SuperHyperEdges&The maximum Values of Its Endpoints”. To get structural 1563
examples and instances, I’m going to introduce the next SuperHyperClass of SuperHyper- 1564
Graph based on a SuperHyperEulerian-Type-Path-Neighbor . It’s the main. It’ll be disciplinary 1565
to have the foundation of previous definition in the kind of SuperHyperClass. If there’s 1566
a need to have all SuperHyperEulerian-Type-Path-Neighbor until the SuperHyperEulerian-Type-Path- 1567
Neighbor, then it’s officially called a “SuperHyperEulerian-Type-Path-Neighbor” but otherwise, it isn’t 1568
a SuperHyperEulerian-Type-Path-Neighbor . There are some instances about the clarifications for 1569
the main definition titled a “SuperHyperEulerian-Type-Path-Neighbor ”. These two examples get 1570
more scrutiny and discernment since there are characterized in the disciplinary ways of the 1571
SuperHyperClass based on a SuperHyperEulerian-Type-Path-Neighbor . For the sake of having a 1572

Neutrosophic SuperHyperEulerian-Type-Path-Neighbor, there’s a need to “redefine” the notion of 1573
a “Neutrosophic SuperHyperEulerian-Type-Path-Neighbor” and a “Neutrosophic SuperHyperEulerian- 1574
Type-Path-Neighbor ”. The SuperHyperVertices and the SuperHyperEdges are assigned by the 1575
labels from the letters of the alphabets. In this procedure, there’s the usage of the position 1576
of labels to assign to the values. Assume a Neutrosophic SuperHyperGraph. It’s redefined 1577
“Neutrosophic SuperHyperGraph” if the intended Table holds. And a SuperHyperEulerian-Type- 1578
Path-Neighbor are redefined to a “Neutrosophic SuperHyperEulerian-Type-Path-Neighbor” if the intended 1579
Table holds. It’s useful to define “Neutrosophic” version of SuperHyperClasses. Since there’s 1580
more ways to get Neutrosophic type-results to make a Neutrosophic SuperHyperEulerian-Type- 1581
Path-Neighbor more understandable. Assume a Neutrosophic SuperHyperGraph. There are 1582
some Neutrosophic SuperHyperClasses if the intended Table holds. Thus SuperHyperPath, 1583
SuperHyperEulerian-Type-Path-Neighbor, SuperHyperStar, SuperHyperBipartite, SuperHyperMul- 1584
tiPartite, and SuperHyperWheel, are “Neutrosophic SuperHyperPath”, “Neutrosophic 1585
SuperHyperEulerian-Type-Path-Neighbor”, “Neutrosophic SuperHyperStar”, “Neutrosophic SuperHy- 1586
perBipartite”, “Neutrosophic SuperHyperMultiPartite”, and “Neutrosophic SuperHyperWheel” 1587

if the intended Table holds. A SuperHyperGraph has a “Neutrosophic SuperHyperEulerian- 1588

Type-Path-Neighbor” where it’s the strongest [the maximum Neutrosophic value from all the 1589
SuperHyperEulerian-Type-Path-Neighbor amid the maximum value amid all SuperHyperVertices 1590
from a SuperHyperEulerian-Type-Path-Neighbor .] SuperHyperEulerian-Type-Path-Neighbor . A graph is a 1591
SuperHyperUniform if it’s a SuperHyperGraph and the number of elements of SuperHyperEdges 1592
are the same. Assume a Neutrosophic SuperHyperGraph. There are some SuperHyperClasses 1593
as follows. It’s SuperHyperPath if it’s only one SuperVertex as intersection amid two given 1594
SuperHyperEdges with two exceptions; it’s SuperHyperEulerian-Type-Path-Neighbor if it’s only one 1595
SuperVertex as intersection amid two given SuperHyperEdges; it’s SuperHyperStar it’s only one 1596
SuperVertex as intersection amid all SuperHyperEdges; it’s SuperHyperBipartite it’s only one 1597
SuperVertex as intersection amid two given SuperHyperEdges and these SuperVertices, forming 1598
two separate sets, has no SuperHyperEdge in common; it’s SuperHyperMultiPartite it’s only 1599
one SuperVertex as intersection amid two given SuperHyperEdges and these SuperVertices, 1600
and the common and intended properties between “specific” cells and “specific group” of cells 1607
are SuperHyperModeled as “SuperHyperEdges”. Sometimes, it’s useful to have some degrees of 1608
determinacy, indeterminacy, and neutrality to have more precise SuperHyperModel which in this 1609
case the SuperHyperModel is called “Neutrosophic”. In the future research, the foundation will 1610
be based on the “Cancer’s Recognition” and the results and the definitions will be introduced 1611
identified since there are some determinacy, indeterminacy and neutrality about the moves 1615
and the effects of the cancer on that region; this event leads us to choose another model [it’s 1616
said to be Neutrosophic SuperHyperGraph] to have convenient perception on what’s happened 1617
and what’s done. There are some specific models, which are well-known and they’ve got the 1618
names, and some SuperHyperGeneral SuperHyperModels. The moves and the traces of the 1619
cancer on the complex tracks and between complicated groups of cells could be fantasized by a 1620
Neutrosophic SuperHyperPath(-/SuperHyperEulerian-Type-Path-Neighbor, SuperHyperStar, SuperHy- 1621
perBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find either the longest 1622
SuperHyperEulerian-Type-Path-Neighbor or the strongest SuperHyperEulerian-Type-Path-Neighbor in those 1623

Neutrosophic SuperHyperModels. For the longest SuperHyperEulerian-Type-Path-Neighbor, called 1624
SuperHyperEulerian-Type-Path-Neighbor, and the strongest SuperHyperEulerian-Type-Path-Neighbor, called 1625
Neutrosophic SuperHyperEulerian-Type-Path-Neighbor, some general results are introduced. Beyond 1626
that in SuperHyperStar, all possible SuperHyperPaths have only two SuperHyperEdges but it’s 1627
not enough since it’s essential to have at least three SuperHyperEdges to form any style of a 1628
SuperHyperEulerian-Type-Path-Neighbor. There isn’t any formation of any SuperHyperEulerian-Type-Path- 1629

Neighbor but literarily, it’s the deformation of any SuperHyperEulerian-Type-Path-Neighbor. It, literarily, 1630
deforms and it doesn’t form. A basic familiarity with Neutrosophic SuperHyperEulerian-Type-Path- 1631
Neighbor theory, SuperHyperGraphs, and Neutrosophic SuperHyperGraphs theory are proposed. 1632
Keywords: Neutrosophic SuperHyperGraph, SuperHyperEulerian-Type-Path-Neighbor, Cancer’s 1633

Neutrosophic Recognition 1634


CHAPTER 8 1636
Applied Notions Under The Scrutiny Of 1637
The Motivation Of This Scientific 1638
Research 1639
In this scientific research, there are some ideas in the featured frameworks of motivations. I 1640
try to bring the motivations in the narrative ways. Some cells have been faced with some 1641
attacks from the situation which is caused by the cancer’s attacks. In this case, there are 1642
some embedded analysis on the ongoing situations which in that, the cells could be labelled 1643
as some groups and some groups or individuals have excessive labels which all are raised from 1644
the behaviors to overcome the cancer’s attacks. In the embedded situations, the individuals 1645
of cells and the groups of cells could be considered as “new groups”. Thus it motivates us to 1646
find the proper SuperHyperModels for getting more proper analysis on this messy story. I’ve 1647
found the SuperHyperModels which are officially called “SuperHyperGraphs” and “Extreme 1648
SuperHyperGraphs”. In this SuperHyperModel, the cells and the groups of cells are defined as 1649
“SuperHyperVertices” and the relations between the individuals of cells and the groups of cells 1650
are defined as “SuperHyperEdges”. Thus it’s another motivation for us to do research on this 1651
SuperHyperModel based on the “Cancer’s Recognition”. Sometimes, the situations get worst. 1652
The situation is passed from the certainty and precise style. Thus it’s the beyond them. There 1653
are three descriptions, namely, the degrees of determinacy, indeterminacy and neutrality, for any 1654
object based on vague forms, namely, incomplete data, imprecise data, and uncertain analysis. 1655
The latter model could be considered on the previous SuperHyperModel. It’s SuperHyperModel. 1656
It’s SuperHyperGraph but it’s officially called “Extreme SuperHyperGraphs”. The cancer is the 1657
disease but the model is going to figure out what’s going on this phenomenon. The special case 1658
of this disease is considered and as the consequences of the model, some parameters are used. 1659
The cells are under attack of this disease but the moves of the cancer in the special region are 1660
the matter of mind. The recognition of the cancer could help to find some treatments for this 1661
disease. The SuperHyperGraph and Extreme SuperHyperGraph are the SuperHyperModels on 1662
the “Cancer’s Recognition” and both bases are the background of this research. Sometimes the 1663
cancer has been happened on the region, full of cells, groups of cells and embedded styles. In this 1664
segment, the SuperHyperModel proposes some SuperHyperNotions based on the connectivities 1665
of the moves of the cancer in the forms of alliances’ styles with the formation of the design 1666
and the architecture are formally called “ SuperHyperEulerian-Type-Path-Neighbor” in the themes 1667
of jargons and buzzwords. The prefix “SuperHyper” refers to the theme of the embedded 1668
57
styles to figure out the background for the SuperHyperNotions. The recognition of the cancer 1669
in the long-term function. The specific region has been assigned by the model [it’s called 1670
SuperHyperGraph] and the long cycle of the move from the cancer is identified by this research. 1671
Sometimes the move of the cancer hasn’t be easily identified since there are some determinacy, 1672
indeterminacy and neutrality about the moves and the effects of the cancer on that region; 1673
this event leads us to choose another model [it’s said to be Extreme SuperHyperGraph] to 1674
have convenient perception on what’s happened and what’s done. There are some specific 1675
models, which are well-known and they’ve got the names, and some general models. The 1676
moves and the traces of the cancer on the complex tracks and between complicated groups of 1677
cells could be fantasized by an Extreme SuperHyperPath (-/SuperHyperEulerian-Type-Path-Neighbor, 1678
SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is 1679
to find either the optimal SuperHyperEulerian-Type-Path-Neighbor or the Extreme SuperHyperEulerian- 1680
Type-Path-Neighbor in those Extreme SuperHyperModels. Some general results are introduced. 1681
Beyond that in SuperHyperStar, all possible Extreme SuperHyperPath s have only two 1682
to form any style of a SuperHyperEulerian-Type-Path-Neighbor. There isn’t any formation of any 1684
SuperHyperEulerian-Type-Path-Neighbor but literarily, it’s the deformation of any SuperHyperEulerian- 1685
Type-Path-Neighbor. It, literarily, deforms and it doesn’t form. 1686
amount of SuperHyperEulerian-Type-Path-Neighbor” of either individual of cells or the groups of cells 1688

based on the fixed cell or the fixed group of cells, extensively, the “amount of SuperHyperEulerian- 1689
Type-Path-Neighbor” based on the fixed groups of cells or the fixed groups of group of cells? 1690
Question 8.0.2. What are the best descriptions for the “Cancer’s Recognition” in terms of these 1691
messy and dense SuperHyperModels where embedded notions are illustrated? 1692
It’s motivation to find notions to use in this dense model is titled “SuperHyperGraphs”. Thus 1693
it motivates us to define different types of “ SuperHyperEulerian-Type-Path-Neighbor” and “Extreme 1694
SuperHyperEulerian-Type-Path-Neighbor” on “SuperHyperGraph” and “Extreme SuperHyperGraph”. 1695

Then the research has taken more motivations to define SuperHyperClasses and to find some 1696
connections amid this SuperHyperNotion with other SuperHyperNotions. It motivates us to get 1697
some instances and examples to make clarifications about the framework of this research. The 1698
general results and some results about some connections are some avenues to make key point of 1699
this research, “Cancer’s Recognition”, more understandable and more clear. 1700
The framework of this research is as follows. In the beginning, I introduce basic definitions 1701
to clarify about preliminaries. In the subsection “Preliminaries”, initial definitions about 1702
SuperHyperGraphs and Extreme SuperHyperGraph are deeply-introduced and in-depth- 1703
discussed. The elementary concepts are clarified and illustrated completely and sometimes 1704
review literature are applied to make sense about what’s going to figure out about the upcoming 1705
sections. The main definitions and their clarifications alongside some results about new 1706
notions, SuperHyperEulerian-Type-Path-Neighbor and Extreme SuperHyperEulerian-Type-Path-Neighbor, are 1707

figured out in sections “ SuperHyperEulerian-Type-Path-Neighbor” and “Extreme SuperHyperEulerian- 1708
Type-Path-Neighbor”. In the sense of tackling on getting results and in Eulerian-Type-Path-Neighbor to 1709
make sense about continuing the research, the ideas of SuperHyperUniform and Extreme 1710
SuperHyperUniform are introduced and as their consequences, corresponded SuperHyperClasses 1711
are figured out to debut what’s done in this section, titled “Results on SuperHyperClasses” 1712
and “Results on Extreme SuperHyperClasses”. As going back to origin of the notions, 1713

there are some smart steps toward the common notions to extend the new notions in new 1714
frameworks, SuperHyperGraph and Extreme SuperHyperGraph, in the sections “Results on 1715
SuperHyperClasses” and “Results on Extreme SuperHyperClasses”. The starter research about 1716
the general SuperHyperRelations and as concluding and closing section of theoretical research are 1717
contained in the section “General Results”. Some general SuperHyperRelations are fundamental 1718
and they are well-known as fundamental SuperHyperNotions as elicited and discussed in the 1719
sections, “General Results”, “ SuperHyperEulerian-Type-Path-Neighbor”, “Extreme SuperHyperEulerian- 1720

Type-Path-Neighbor”, “Results on SuperHyperClasses” and “Results on Extreme SuperHyperClasses”. 1721
There are curious questions about what’s done about the SuperHyperNotions to make sense 1722
about excellency of this research and going to figure out the word “best” as the description 1723
and adjective for this research as presented in section, “ SuperHyperEulerian-Type-Path-Neighbor”. 1724
The keyword of this research debut in the section “Applications in Cancer’s Recognition” 1725
with two cases and subsections “Case 1: The Initial Steps Toward SuperHyperBipartite as 1726
SuperHyperModel” and “Case 2: The Increasing Steps Toward SuperHyperMultipartite as 1727
SuperHyperModel”. In the section, “Open Problems”, there are some scrutiny and discernment 1728
on what’s done and what’s happened in this research in the terms of “questions” and “problems” 1729
to make sense to figure out this research in featured style. The advantages and the limitations 1730
of this research alongside about what’s done in this research to make sense and to get sense 1731
about what’s figured out are included in the section, “Conclusion and Closing Remarks”. 1732

CHAPTER 9 1733
Extreme Preliminaries Of This Scientific 1734
Research On the Redeemed Ways 1735
In this section, the basic material in this scientific research, is referred to [Single Valued 1736
Neutrosophic Set](Ref.[HG38],Definition 2.2,p.2), [Neutrosophic Set](Ref.[HG38],Definition 1737
2.1,p.1), [Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG38],Definition 2.5,p.2), [Charac- 1738

terization of the Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG38],Definition 2.7,p.3), 1739
[t-norm](Ref.[HG38], Definition 2.7, p.3), and [Characterization of the Neutrosophic SuperHy- 1740
perGraph (NSHG)](Ref.[HG38],Definition 2.7,p.3), [Neutrosophic Strength of the Neutrosophic 1741
SuperHyperPaths] (Ref.[HG38],Definition 5.3,p.7), and [Different Neutrosophic Types of Neut- 1742
rosophic SuperHyperEdges (NSHE)] (Ref.[HG38],Definition 5.4,p.7). Also, the new ideas and 1743
their clarifications are addressed to Ref.[HG38]. 1744

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

Let X be a Eulerian-Type-Path-Neighbor 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 [. 1747
Definition 9.0.2 (Single Valued Neutrosophic Set). (Ref.[HG38],Definition 2.2,p.2).

Let X be a Eulerian-Type-Path-Neighbor 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}.
61
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.[HG38],Definition 2.5,p.2). 1748
Assume V 0 is a given set. a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E), 1749
where 1750
(i) V = {V1 , V2 , . . . , Vn } a finite set of finite single valued Neutrosophic subsets of V 0 ; 1751
(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); 1752
(iii) E = {E1 , E2 , . . . , En0 } a finite set of finite single valued Neutrosophic subsets of V ; 1753
(iv) E = {(Ei0 , TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 )) : TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 ) ≥ 0}, (i0 = 1754
1, 2, . . . , n0 ); 1755
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 1756
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 1757

P
(vii) i supp(Vi ) = V, (i = 1, 2, . . . , n); 1758
0 0
P
(viii) i0 supp(Ei ) = V, (i = 1, 2, . . . , n ); 1759
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 . 1760
Here the Neutrosophic SuperHyperEdges (NSHE) Ej 0 and the Neutrosophic SuperHyperVertices 1761
(NSHV) Vj are single valued Neutrosophic sets. TV 0 (Vi ), IV 0 (Vi ), and FV 0 (Vi ) denote the 1762
degree of truth-membership, the degree of indeterminacy-membership and the degree of 1763

falsity-membership the Neutrosophic SuperHyperVertex (NSHV) Vi to the Neutrosophic 1764
SuperHyperVertex (NSHV) V. TV0 (Ei0 ), TV0 (Ei0 ), and TV0 (Ei0 ) denote the degree of truth- 1765
membership, the degree of indeterminacy-membership and the degree of falsity-membership of 1766
the Neutrosophic SuperHyperEdge (NSHE) Ei0 to the Neutrosophic SuperHyperEdge (NSHE) 1767
E. Thus, the ii0 th element of the incidence matrix of Neutrosophic SuperHyperGraph (NSHG) 1768
are of the form (Vi , TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 )), the sets V and E are crisp sets. 1769

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

(Ref.[HG38],Definition 2.7,p.3). 1771
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). The Neutro- 1772
sophic SuperHyperEdges (NSHE) Ei0 and the Neutrosophic SuperHyperVertices (NSHV) Vi of 1773
Neutrosophic SuperHyperGraph (NSHG) S = (V, E) could be characterized as follow-up items. 1774
(i) If |Vi | = 1, then Vi is called vertex; 1775
(ii) if |Vi | ≥ 1, then Vi is called SuperVertex; 1776
(iii) if for all Vi s are incident in Ei0 , |Vi | = 1, and |Ei0 | = 2, then Ei0 is called edge; 1777
(iv) if for all Vi s are incident in Ei0 , |Vi | = 1, and |Ei0 | ≥ 2, then Ei0 is called HyperEdge; 1778
(v) if there’s a Vi is incident in Ei0 such that |Vi | ≥ 1, and |Ei0 | = 2, then Ei0 is called 1779
SuperEdge; 1780
(vi) if there’s a Vi is incident in Ei0 such that |Vi | ≥ 1, and |Ei0 | ≥ 2, then Ei0 is called 1781
SuperHyperEdge. 1782
If we choose different types of binary operations, then we could get hugely diverse types of 1783
general forms of Neutrosophic SuperHyperGraph (NSHG). 1784
Definition 9.0.7 (t-norm). (Ref.[HG38], Definition 2.7, p.3). 1785

A binary operation ⊗ : [0, 1] × [0, 1] → [0, 1] is a t-norm if it satisfies the following for 1786
x, y, z, w ∈ [0, 1]: 1787
(i) 1 ⊗ x = x; 1788
(ii) x ⊗ y = y ⊗ x; 1789
(iii) x ⊗ (y ⊗ z) = (x ⊗ y) ⊗ z; 1790
(iv) If w ≤ x and y ≤ z then w ⊗ y ≤ x ⊗ z. 1791

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

where 1794

1, 2, . . . , n0 ); 1799
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 1800
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 1801
P
(vii) i supp(Vi ) = V, (i = 1, 2, . . . , n); 1802
0 0
P
(viii) i0 supp(Ei ) = V, (i = 1, 2, . . . , n ). 1803
0


SuperEdge; 1823
This SuperHyperModel is too messy and too dense. Thus there’s a need to have some 1826
restrictions and conditions on SuperHyperGraph. The special case of this SuperHyperGraph 1827
makes the patterns and regularities. 1828
Definition 9.0.12. A graph is SuperHyperUniform if it’s SuperHyperGraph and the number 1829
of elements of SuperHyperEdges are the same. 1830

To get more visions on SuperHyperUniform, the some SuperHyperClasses are introduced. It 1831
makes to have SuperHyperUniform more understandable. 1832
Definition 9.0.13. Assume a Neutrosophic SuperHyperGraph. There are some SuperHyper- 1833
Classes as follows. 1834
(i). It’s Neutrosophic SuperHyperPath if it’s only one SuperVertex as intersection amid 1835
two given SuperHyperEdges with two exceptions; 1836
(ii). it’s SuperHyperCycle if it’s only one SuperVertex as intersection amid two given 1837
SuperHyperEdges; 1838
(iii). it’s SuperHyperStar it’s only one SuperVertex as intersection amid all SuperHyperEdges; 1839
(iv). it’s SuperHyperBipartite it’s only one SuperVertex as intersection amid two given Supe- 1840
rHyperEdges and these SuperVertices, forming two separate sets, has no SuperHyperEdge 1841
in common; 1842
(v). it’s SuperHyperMultiPartite it’s only one SuperVertex as intersection amid two 1843
given SuperHyperEdges and these SuperVertices, forming multi separate sets, has no 1844
SuperHyperEdge in common; 1845
(vi). it’s SuperHyperWheel if it’s only one SuperVertex as intersection amid two given 1846
SuperHyperEdges and one SuperVertex has one SuperHyperEdge with any common 1847
SuperVertex. 1848
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 1849
(NSHV) V1 to Neutrosophic SuperHyperVertex (NSHV) Vs if either of following conditions hold: 1850
(i) Vi , Vi+1 ∈ Ei0 ; 1851
(ii) there’s a vertex vi ∈ Vi such that vi , Vi+1 ∈ Ei0 ; 1852
(iii) there’s a SuperVertex Vi0 ∈ Vi such that Vi0 , Vi+1 ∈ Ei0 ; 1853
(iv) there’s a vertex vi+1 ∈ Vi+1 such that Vi , vi+1 ∈ Ei0 ; 1854
0 0
(v) there’s a SuperVertex Vi+1 ∈ Vi+1 such that Vi , Vi+1 ∈ E i0 ; 1855
(vi) there are a vertex vi ∈ Vi and a vertex vi+1 ∈ Vi+1 such that vi , vi+1 ∈ Ei0 ; 1856
0 0
(vii) there are a vertex vi ∈ Vi and a SuperVertex Vi+1 ∈ Vi+1 such that vi , Vi+1 ∈ Ei0 ; 1857
(viii) there are a SuperVertex Vi0 ∈ Vi and a vertex vi+1 ∈ Vi+1 such that Vi0 , vi+1 ∈ Ei0 ; 1858
(ix) there are a SuperVertex Vi0 ∈ Vi and a SuperVertex Vi+1

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

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. 1860
(i) If for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | = 2, then NSHP is called path; 1861
(ii) if for all Ej 0 , |Ej 0 | = 2, and there’s Vi , |Vi | ≥ 1, then NSHP is called SuperPath; 1862
(iii) if for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | ≥ 2, then NSHP is called HyperPath; 1863
(iv) if there are Vi , Ej 0 , |Vi | ≥ 1, |Ej 0 | ≥ 2, then NSHP is called Neutrosophic SuperHy- 1864
perPath . 1865
Definition 9.0.16 (Neutrosophic Strength of the Neutrosophic SuperHyperPaths).

(Ref.[HG38],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 1866
(i) Neutrosophic t-strength (min{T (Vi )}, m, n)si=1 ; 1867
(ii) Neutrosophic i-strength (m, min{I(Vi )}, n)si=1 ; 1868
(iii) Neutrosophic f-strength (m, n, min{F (Vi )})si=1 ; 1869
(iv) Neutrosophic strength (min{T (Vi )}, min{I(Vi )}, min{F (Vi )})si=1 . 1870
Definition 9.0.17 (Different Neutrosophic Types of Neutrosophic SuperHyperEdges (NSHE)). 1871

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

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


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

(xii) Neutrosophic connective if (T (E), I(E), F (E)) ≥ maximum number of Neutrosophic 1884
strength of SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex (NSHV) Vi 1885
to Neutrosophic SuperHyperVertex (NSHV) Vj where 1 ≤ i, j ≤ s. 1886
Definition 9.0.18. (Different Neutrosophic Types of Neutrosophic SuperHyperEulerian-Type-Path- 1887

Neighbor). 1888
Neutrosophic SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and E 0 = {E1 , E2 , . . . , Ez }. Then either V 0 1890
or E 0 is called 1891
(i) Neutrosophic e-SuperHyperEulerian-Type-Path-Neighbor if the following expression is 1892

called Neutrosophic e-SuperHyperEulerian-Type-Path-Neighbor criteria holds 1893
∀N (Ea ) ∈ P : P is
(ii) Neutrosophic re-SuperHyperEulerian-Type-Path-Neighbor if the following expression is 1894

called Neutrosophic re-SuperHyperEulerian-Type-Path-Neighbor criteria holds 1895
∀N (Ea ) ∈ P : P is
and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 1896
(iii) Neutrosophic v-SuperHyperEulerian-Type-Path-Neighbor if the following expression is 1897
called Neutrosophic v-SuperHyperEulerian-Type-Path-Neighbor criteria holds 1898
∀N (Va ) ∈ P : P is
(iv) Neutrosophic rv-SuperHyperEulerian-Type-Path-Neighbor if the following expression is 1899
∀N (Va ) ∈ P : P is
and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; 1901

(v) Neutrosophic SuperHyperEulerian-Type-Path-Neighbor if it’s either of Neutro- 1902

sophic e-SuperHyperEulerian-Type-Path-Neighbor, Neutrosophic re-SuperHyperEulerian-Type- 1903
Path-Neighbor, Neutrosophic v-SuperHyperEulerian-Type-Path-Neighbor, and Neutrosophic rv- 1904
SuperHyperEulerian-Type-Path-Neighbor. 1905
Definition 9.0.19. ((Neutrosophic) SuperHyperEulerian-Type-Path-Neighbor). 1906

(i) an Extreme SuperHyperEulerian-Type-Path-Neighbor if it’s either of Neutrosophic 1909

e-SuperHyperEulerian-Type-Path-Neighbor, Neutrosophic re-SuperHyperEulerian-Type-Path- 1910
Neighbor, Neutrosophic v-SuperHyperEulerian-Type-Path-Neighbor, and Neutrosophic rv- 1911
SuperHyperEulerian-Type-Path-Neighbor and C(N SHG) for an Extreme SuperHyperGraph 1912
N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S 1913

of high Extreme cardinality of the Extreme SuperHyperEdges in the conseNeighborive 1914
Extreme sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such 1915
that they form the Extreme SuperHyperEulerian-Type-Path-Neighbor; 1916
(ii) a Neutrosophic SuperHyperEulerian-Type-Path-Neighbor if it’s either of Neutro- 1917

SuperHyperEulerian-Type-Path-Neighbor and C(N SHG) for a Neutrosophic SuperHyperGraph 1920
N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic Su- 1921
perHyperEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 1922

conseNeighborive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices 1923
such that they form the Neutrosophic SuperHyperEulerian-Type-Path-Neighbor; 1924
(iii) an Extreme SuperHyperEulerian-Type-Path-Neighbor SuperHyperPolynomial if 1925

it’s either of Neutrosophic e-SuperHyperEulerian-Type-Path-Neighbor, Neutrosophic re- 1926
SuperHyperEulerian-Type-Path-Neighbor, Neutrosophic v-SuperHyperEulerian-Type-Path-Neighbor, 1927
and Neutrosophic rv-SuperHyperEulerian-Type-Path-Neighbor and C(N SHG) for an Extreme 1928
SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the 1929
Extreme coefficients defined as the Extreme number of the maximum Extreme cardinality 1930
of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme 1931

cardinality conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVertices 1932
such that they form the Extreme SuperHyperEulerian-Type-Path-Neighbor; and the Extreme 1933
power is corresponded to its Extreme coefficient; 1934
(iv) a Neutrosophic SuperHyperEulerian-Type-Path-Neighbor SuperHyperPolynomial 1935

if it’s either of Neutrosophic e-SuperHyperEulerian-Type-Path-Neighbor, Neutrosophic re- 1936
and Neutrosophic rv-SuperHyperEulerian-Type-Path-Neighbor and C(N SHG) for a Neutro- 1938
sophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 1939

contains the Neutrosophic coefficients defined as the Neutrosophic number of the max- 1940
imum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic 1941
SuperHyperEulerian-Type-Path-Neighbor; and the Neutrosophic power is corresponded to its 1944
Neutrosophic coefficient; 1945

(v) an Extreme V-SuperHyperEulerian-Type-Path-Neighbor if it’s either of Neutro- 1946

N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of 1950
high Extreme cardinality of the Extreme SuperHyperVertices in the conseNeighborive 1951

(vi) a Neutrosophic V-SuperHyperEulerian-Type-Path-Neighbor if it’s either of Neut- 1954

rosophic e-SuperHyperEulerian-Type-Path-Neighbor, Neutrosophic re-SuperHyperEulerian-Type- 1955

N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic Supe- 1958
rHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 1959
(vii) an Extreme V-SuperHyperEulerian-Type-Path-Neighbor SuperHyperPolynomial 1962

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

(viii) a Neutrosophic SuperHyperEulerian-Type-Path-Neighbor SuperHyperPolynomial 1972

and Neutrosophic rv-SuperHyperEulerian-Type-Path-Neighbor and C(N SHG) for a Neutrosophic 1975
SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains 1976
the Neutrosophic coefficients defined as the Neutrosophic number of the maximum 1977
Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic 1978

Neutrosophic coefficient. 1982
Definition 9.0.20. ((Extreme/Neutrosophic)δ−SuperHyperEulerian-Type-Path-Neighbor). 1983

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Then 1984
(i) an δ−SuperHyperEulerian-Type-Path-Neighbor is a Neutrosophic kind of Neutrosophic 1985
SuperHyperEulerian-Type-Path-Neighbor such that either of the following expressions hold for 1986

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
the Neutrosophic cardinalities of SuperHyperNeighbors of s ∈ S : 1987
|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 1988

(29.1), holds if S is an δ−SuperHyperDefensive; 1989
(ii) a Neutrosophic δ−SuperHyperEulerian-Type-Path-Neighbor is a Neutrosophic kind 1990

of Neutrosophic SuperHyperEulerian-Type-Path-Neighbor such that either of the following 1991
Neutrosophic expressions hold for the Neutrosophic cardinalities of SuperHyperNeighbors 1992
of s ∈ S : 1993
|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 1994

the Expression (29.1), holds if S is a Neutrosophic δ−SuperHyperDefensive. 1995
For the sake of having a Neutrosophic SuperHyperEulerian-Type-Path-Neighbor, there’s a need to 1996

“redefine” the notion of “Neutrosophic SuperHyperGraph”. The SuperHyperVertices and the 1997
SuperHyperEdges are assigned by the labels from the letters of the alphabets. In this procedure, 1998
there’s the usage of the position of labels to assign to the values. 1999
136DEF1 Definition 9.0.21. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 2000
It’s redefined Neutrosophic SuperHyperGraph if the Table (29.1) holds. 2001
It’s useful to define a “Neutrosophic” version of SuperHyperClasses. Since there’s more ways 2002
to get Neutrosophic type-results to make a Neutrosophic more understandable. 2003
136DEF2 Definition 9.0.22. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = 2004

(V, E). There are some Neutrosophic SuperHyperClasses if the Table (29.2) holds. 2005
Thus Neutrosophic SuperHyperPath , SuperHyperEulerian-Type-Path-Neighbor, SuperHyperStar, 2006
SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, are Neutrosophic 2007
SuperHyperPath, Neutrosophic SuperHyperCycle, Neutrosophic SuperHyperStar, 2008
Neutrosophic SuperHyperBipartite, Neutrosophic SuperHyperMultiPartite, and 2009
Neutrosophic SuperHyperWheel if the Table (29.2) holds. 2010

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

136TBL4

136TBL1
It’s useful to define a “Neutrosophic” version of a Neutrosophic SuperHyperEulerian-Type-Path- 2011

Neighbor. Since there’s more ways to get type-results to make a Neutrosophic SuperHyperEulerian- 2012
Type-Path-Neighbor more Neutrosophicly understandable. 2013
“redefine” the Neutrosophic notion of “Neutrosophic SuperHyperEulerian-Type-Path-Neighbor”. The 2015

2018
136DEF1 Definition 9.0.23. Assume a SuperHyperEulerian-Type-Path-Neighbor. It’s redefined a Neutrosophic 2019

SuperHyperEulerian-Type-Path-Neighbor if the Table (29.3) holds. 2020

CHAPTER 10 2021
Extreme SuperHyper But As The Eulerian-Type-Path-Neighbor 2022
Extensions Excerpt From Dense And 2023
Super Forms 2024
Definition 10.0.1. (Extreme event). 2025
Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) 2026
is a probability Eulerian-Type-Path-Neighbor. Any Extreme k-subset of A of V is called Extreme 2027
k-event and if k = 2, then Extreme subset of A of V is called Extreme event. The following 2028
expression is called Extreme probability of A. 2029
X
E(A) = E(a). (10.1)
a∈A
Definition 10.0.2. (Extreme Independent). 2030

is a probability Eulerian-Type-Path-Neighbor. s Extreme k-events Ai , i ∈ I is called Extreme 2032

s-independent if the following expression is called Extreme s-independent criteria 2033
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 2034
following expression is called Extreme independent criteria 2035
E(A ∩ B) = P (A)P (B). (10.2)
Definition 10.0.3. (Extreme Variable). 2036

is a probability Eulerian-Type-Path-Neighbor. Any k-function Eulerian-Type-Path-Neighbor like E is called 2038

Extreme k-Variable. If k = 2, then any 2-function Eulerian-Type-Path-Neighbor like E is called 2039
Extreme Variable. 2040
The notion of independent on Extreme Variable is likewise. 2041
Definition 10.0.4. (Extreme Expectation). 2042
Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) is 2043
73
a probability Eulerian-Type-Path-Neighbor. an Extreme k-Variable E has a number is called Extreme 2044

Expectation if the following expression is called Extreme Expectation criteria 2045
X
Ex(E) = E(α)P (α).
α∈V
Definition 10.0.5. (Extreme Crossing). 2046

a probability Eulerian-Type-Path-Neighbor. an Extreme number is called Extreme Crossing if the 2048

following expression is called Extreme Crossing criteria 2049
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 2050
S = (V, E) is a probability Eulerian-Type-Path-Neighbor. Let m and n propose special Eulerian-Type-Path- 2051
Neighbor. Then with m ≥ 4n, 2052
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 Eulerian-Type-Path-Neighbor 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: 2053
pm − 3n n 1 3 2
cr(G) ≥ 3
= 3 = m n .
p (4n/m) 64
2054
Theorem 10.0.7. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). 2055
Consider S = (V, E) is a probability Eulerian-Type-Path-Neighbor. Let P be a SuperHyperSet of n points 2056
in the plane, and let l be the Extreme number √ of SuperHyperLines in the plane passing through 2057
at least k + 1 of these points, where 1 ≤ k ≤ 2 2n. Then l < 32n2 /k 3 . 2058
Proof. Form an Extreme SuperHyperGraph G with SuperHyperVertex SuperHyperSet P whose 2059

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

in the plane, and let k be the number of pairs of points of P at unit SuperHyperDistance. Then 2067
k < 5n4/3 . 2068
Proof. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 2069
S = (V, E) is a probability Eulerian-Type-Path-Neighbor. Draw a SuperHyperUnit SuperHyperCircle 2070
around each SuperHyperPoint of P. Let ni be the P Extreme number of these SuperHyperCircles 2071
i = 0n−1 ni = n and k = 12 i = 0n−1 ini .
P
passing through exactly i points of P. Then 2072
Now form an Extreme SuperHyperGraph H with SuperHyperVertex SuperHyperSet P whose 2073

SuperHyperEdges are the SuperHyperArcs between conseNeighborive SuperHyperPoints on the 2074
SuperHyperCircles that pass through at least three SuperHyperPoints of P. Then 2075
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 2076
SuperHyperEdges. Delete from H one of each SuperHyperPair of parallel SuperHyperEdges, so 2077

as to obtain a simple Extreme SuperHyperGraph G with e(G) ≥ k − n. Now cr(G) ≤ n(n − 1) 2078
because G is formed from at most n SuperHyperCircles, and any two SuperHyperCircles cross 2079
at most twice. Thus either e(G) < 4n, in which case k < 5n < 5n4/3 , or n2 > n(n − 1) ≥ 2080
3
cr(G) ≥ (k − n) /64n2 by the Extreme Crossing Lemma, and k < 4n4/3 + n < 5n4/3 . 2081
Proposition 10.0.9. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). 2082
Consider S = (V, E) is a probability Eulerian-Type-Path-Neighbor. Let X be a nonnegative Extreme 2083
Variable and t a positive real number. Then 2084
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. 2085
Corollary 10.0.10. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). 2086
Consider S = (V, E) is a probability Eulerian-Type-Path-Neighbor. Let Xn be a nonnegative integer- 2087
valued variable in a probability Eulerian-Type-Path-Neighbor (Vn , En ), n ≥ 1. If E(Xn ) → 0 as n → ∞, 2088

then P (Xn = 0) → 1 as n → ∞. 2089
Proof. 2090
Consider S = (V, E) is a probability Eulerian-Type-Path-Neighbor. A special SuperHyperGraph in Gn,p 2092
almost surely has stability number at most d2p−1 log ne. 2093

S = (V, E) is a probability Eulerian-Type-Path-Neighbor. A special SuperHyperGraph in Gn,p is 2095
up. Let G ∈ Gn,p and let S be a given SuperHyperSet of k + 1 SuperHyperVertices of G, 2096
where k ∈ N. The probability that S is a stable SuperHyperSet of G is (1 − p)(k+1)choose2 , this 2097
being the probability that none of the (k + 1)choose2 pairs of SuperHyperVertices of S is a 2098
SuperHyperEdge of the Extreme SuperHyperGraph G. 2099
Let AS denote the event that S is a stable SuperHyperSet of G, and let XS denote the indicator 2100
Extreme Variable for this Extreme Event. By equation, we have 2101
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 2102
X
X= {XS : S ⊆ V, |S| = k + 1}
and so, by those, 2103
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: 2104
nk+1
(n choose k+1) ≤ and1 − p ≤ e−p .
(k + 1)!
This yields the following upper bound on E(X). 2105
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 2106
least as fast as the logarithm of n, implies that E(X) → 0 as n → ∞. Because X is integer-valued 2107
and nonnegative, we deduce from Corollary that P (X = 0) → 1 as n → ∞. Consequently, an 2108
Extreme SuperHyperGraph in Gn,p almost surely has stability number at most k. 2109
Definition 10.0.12. (Extreme Variance). 2110

a probability Eulerian-Type-Path-Neighbor. an Extreme k-Variable E has a number is called Extreme 2112
Variance if the following expression is called Extreme Variance criteria 2113
2
V x(E) = Ex((X − Ex(X)) ).
Consider S = (V, E) is a probability Eulerian-Type-Path-Neighbor. Let X be an Extreme Variable and 2115
let t be a positive real number. Then 2116
V (X)
E(|X − Ex(X)| ≥ t) ≤ .
t2

S = (V, E) is a probability Eulerian-Type-Path-Neighbor. Let X be an Extreme Variable and let t be 2118
a positive real number. Then 2119
2
2 Ex((X − Ex(X)) ) V (X)
E(|X − Ex(X)| ≥ t) = E((X − Ex(X)) ≥ t2 ) ≤ 2
= .
t t2
2120
Consider S = (V, E) is a probability Eulerian-Type-Path-Neighbor. Let Xn be an Extreme Variable in a 2122

probability Eulerian-Type-Path-Neighbor (Vn , En ), n ≥ 1. If Ex(Xn ) 6= 0 and V (Xn ) << E 2 (Xn ), then 2123
E(Xn = 0) → 0 as n → ∞
S = (V, E) is a probability Eulerian-Type-Path-Neighbor. Set X := Xn and t := |Ex(Xn )| in 2125
Chebyshev’s Inequality, and observe that E(Xn = 0) ≤ E(|Xn − Ex(Xn )| ≥ |Ex(Xn )|) because 2126
|Xn − Ex(Xn )| = |Ex(Xn )| when Xn = 0. 2127
Consider S = (V, E) is a probability Eulerian-Type-Path-Neighbor. Let G ∈ Gn,1/2 . For 0 ≤ k ≤ n, set 2129
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 2130
one. Then almost surely α(G) takes one of the three values k ∗ − 2, k ∗ − 1, k ∗ . 2131
S = (V, E) is a probability Eulerian-Type-Path-Neighbor. As in the proof of related Theorem, the 2133
result is straightforward. 2134
Consider S = (V, E) is a probability Eulerian-Type-Path-Neighbor. Let G ∈ Gn,1/2 and let f and k ∗ be 2136
as defined in previous Theorem. Then either: 2137
(i). f (k ∗ ) << 1, in which case almost surely α(G) is equal to either k ∗ − 2 or k ∗ − 1, or 2138
(ii). f (k ∗ − 1) >> 1, in which case almost surely α(G) is equal to either k ∗ − 1 or k ∗ . 2139
S = (V, E) is a probability Eulerian-Type-Path-Neighbor. The latter is straightforward. 2141
Definition 10.0.17. (Extreme Threshold). 2142
a probability Eulerian-Type-Path-Neighbor. Let P be a monotone property of SuperHyperGraphs (one 2144
which is preserved when SuperHyperEdges are added). Then a Extreme Threshold for P is 2145
a function f (n) such that: 2146
(i). if p << f (n), then G ∈ Gn,p almost surely does not have P, 2147
(ii). if p >> f (n), then G ∈ Gn,p almost surely has P. 2148

Definition 10.0.18. (Extreme Balanced). 2149

a probability Eulerian-Type-Path-Neighbor. Let F be a fixed Extreme SuperHyperGraph. Then 2151
there is a threshold function for the property of containing a copy of F as an Extreme 2152
SubSuperHyperGraph is called Extreme Balanced. 2153
Consider S = (V, E) is a probability Eulerian-Type-Path-Neighbor. Let F be a nonempty balanced 2155
Extreme SubSuperHyperGraph with k SuperHyperVertices and l SuperHyperEdges. Then n−k/l 2156

is a threshold function for the property of containing F as an Extreme SubSuperHyperGraph. 2157
136EXM1 Example 10.0.20. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E) in 2160
the mentioned Extreme Figures in every Extreme items. 2161
• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperEulerian- 2162
Type-Path-Neighbor, is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 2163
are some empty Extreme SuperHyperEdges but E2 is a loop Extreme SuperHyperEdge and 2164
E4 is an Extreme SuperHyperEdge. Thus in the terms of Extreme SuperHyperNeighbor, 2165
there’s only one Extreme SuperHyperEdge, namely, E4 . The Extreme SuperHyperVertex, 2166
V3 is Extreme isolated means that there’s no Extreme SuperHyperEdge has it as an 2167
Extreme endpoint. Thus the Extreme SuperHyperVertex, V3 , is excluded in every given 2168
Extreme SuperHyperEulerian-Type-Path-Neighbor. 2169
C(N SHG)Extreme Eulerian-Type-Path-Neighbor

= {E4 }.
C(N SHG)Extreme Eulerian-Type-Path-Neighbor SuperHyperPolynomial
= z3.
C(N SHG)Extreme V-Eulerian-Type-Path-Neighbor
= {V1 , V2 , V4 }.
C(N SHG)Extreme V-Eulerian-Type-Path-Neighbor SuperHyperPolynomial
= z 5 + 2z 3 .
2170
Type-Path-Neighbor, is up. The Extreme Algorithm is Extremely straightforward. E1 , E2 and 2172
E3 are some empty Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. 2173

Thus in the terms of Extreme SuperHyperNeighbor, there’s only one Extreme SuperHy- 2174
perEdge, namely, E4 . The Extreme SuperHyperVertex, V3 is Extreme isolated means that 2175
there’s no Extreme SuperHyperEdge has it as an Extreme endpoint. Thus the Extreme 2176
SuperHyperVertex, V3 , is excluded in every given Extreme SuperHyperEulerian-Type-Path- 2177
Neighbor. 2178

Figure 10.1: The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
SuperHyperEulerian-Type-Path-Neighbor in the Extreme Example (42.0.3) 136NSHG1
= {E4 }.
= z3.
= {V1 , V2 , V4 }.
= z 5 + z 3 + z.
2179
Type-Path-Neighbor, is up. The Extreme Algorithm is Extremely straightforward. 2181

= {E4 }.
= z3.
= {V1 , V2 , V3 }.
= z8 + z4 + z3.
2182



= {E1 }.
= z3.
= {V3 }.
= z2.
2185

= {Ei }.
= z5.
= {V5 }.

= z7.
2188

= {Ei }.
= z2.
= {Vi }.
= z6.
2191

= {E17 }.
= z5.
= {V14 }.
= z5.
2194

= {E4 }.
= z3.
= {V14 }.

= z5.
2197

= {E23 }.
= z 11 .
= {V17 }.
= z5.
2200
• On the Figure (30.10), the Extreme SuperHyperNotion, namely, Extreme 2201

SuperHyperEulerian-Type-Path-Neighbor, is up. The Extreme Algorithm is Extremely straight- 2202
forward. 2203


= {E3 }.
= z5.
= {V14 }.
= z5.
2204

forward. 2207

= {E1 }.
= z3.
= {V1 }.

= z5.
2208

forward. 2211

= {E1 }.
= z5.
= {V8 }
= z8.
2212

forward. 2215

= {E1 }.
= z2.
= {V1 }.
= z5.
2216

forward. 2219

= {E1 }.
= z2.


= {V1 }.
= z5.
2220

forward. 2223

= {E1 }.
= z2.
= {V1 }.
= z5.
2224


forward. 2227

= {Ei ∈ EN SHG }.
= z |Ei ∈EN SHG | .
= {Vi ∈ VN SHG }.
= z |Vi ∈VN SHG | .
2228



forward. 2231

= {Ei ∈ EN SHG }.
= {Vi ∈ VN SHG }.
2232

forward. 2235

= {Ei ∈ EN SHG }.


= {Vi ∈ VN SHG }.
2236

forward. 2239

= {Ei ∈ EN SHG }.
= {Vi ∈ VN SHG }.

2240

forward. 2243

= {Ei ∈ EN SHG }.
= {Vi ∈ VN SHG }.
2244

forward. 2247

= {E2 }.
= z 10 .
= {V2 , {R}, {M6 }, {L6 }, {F }, {P }, {J}, {M }, V1 , V3 }.
= z 5 + 2z 3 + 7z.
2248

forward. 2251

= {Ei ∈ EN SHG \ {E1 }}.

SuperHyperEulerian-Type-Path-Neighbor in the Extreme Example (42.0.3) 95NHG1
= z |Ei ∈EN SHG \{E1 }| .

= {Vi ∈ VN SHG \ {VE1 }}.
= z |Vi ∈VN SHG \{VE1 }| .
2252
Proposition 10.0.21. Assume a connected Extreme SuperHyperGraph ESHG : (V, E). The all 2253
interior Extreme SuperHyperVertices belong to any Extreme quasi-R-Eulerian-Type-Path-Neighbor if for 2254
any of them, and any of other corresponded Extreme SuperHyperVertex, some interior Extreme 2255
SuperHyperVertices are mutually Extreme SuperHyperNeighbors with no Extreme exception at 2256
all minus all Extreme SuperHypeNeighbors to any amount of them. 2257
Proposition 10.0.22. Assume a connected non-obvious Extreme SuperHyperGraph ESHG : 2258
(V, E). There’s only one Extreme SuperHyperEdge E ∈ EESHG:(V,E) has only the maximum 2259

SuperHyperEulerian-Type-Path-Neighbor in the Extreme Example (42.0.3) 95NHG2
possibilities of the distinct interior Extreme SuperHyperVertices inside of any given Extreme 2260
quasi-R-Eulerian-Type-Path-Neighbor minus all Extreme SuperHypeNeighbor to some of them but not 2261
all of them. In other words, there’s only an unique Extreme SuperHyperEdge E ∈ EESHG:(V,E) 2262
has only two distinct Extreme SuperHyperVertices in an Extreme quasi-R-Eulerian-Type-Path-Neighbor, 2263
minus all Extreme SuperHypeNeighbor to some of them but not all of them. 2264
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-Eulerian-Type-Path-Neighbor is at least
V \ (V \ {aE , bE , cE , . . . , zE }).
It’s straightforward that the Extreme cardinality of the Extreme R-Eulerian-Type-Path-Neighbor is at least 2265
the maximum Extreme number of Extreme SuperHyperVertices of the Extreme SuperHyperEdges 2266
with the maximum number of the Extreme SuperHyperEdges. In other words, the maximum 2267
number of the Extreme SuperHyperEdges contains the maximum Extreme number of Extreme 2268
SuperHyperVertices are renamed to Extreme Eulerian-Type-Path-Neighbor in some cases but the 2269
maximum number of the Extreme SuperHyperEdge with the maximum Extreme number of 2270
Extreme SuperHyperVertices, has the Extreme SuperHyperVertices are contained in an Extreme 2271
R-Eulerian-Type-Path-Neighbor. 2272
Proposition 10.0.24. Assume a simple Extreme SuperHyperGraph ESHG : (V, E). Then the
Extreme number of type-result-R-Eulerian-Type-Path-Neighbor 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-Eulerian-Type-Path-Neighbor with the least Extreme cardinality, the 2273
lower sharp Extreme bound for cardinality. 2274
Proposition 10.0.25. Assume a connected loopless Extreme SuperHyperGraph ESHG : (V, E). 2275
Then in the worst case, literally, 2276
C(N SHG)ExtremeQuasi−Eulerian−T ype−P ath−N eighbor

= {V1 , E1 , V2 , E2 , V3 , E3 , V4 , E4 , V1 }.
C(N SHG)ExtremeQuasi−Eulerian−T ype−P ath−N eighborSuperHyperP olynomial = z 4 .
C(N SHG)ExtremeQuasi−Eulerian−T ype−P ath−N eighbor = {V1 , V2 , V3 , V4 , V1 }.
C(N SHG)ExtremeR−Quasi−Eulerian−T ype−P ath−N eighborSuperHyperP olynomial = z 5 .
Is an Extreme type-result-Eulerian-Type-Path-Neighbor. In other words, the least cardinality, the lower 2277
sharp bound for the cardinality, of an Extreme type-result-Eulerian-Type-Path-Neighbor is the cardinality 2278
of 2279

= {V1 , E1 , V2 , E2 , V3 , E3 , V4 , E4 , V1 }.
C(N SHG)ExtremeQuasi−Eulerian−T ype−P ath−N eighborSuperHyperP olynomial = z 4 .
C(N SHG)ExtremeQuasi−Eulerian−T ype−P ath−N eighbor = {V1 , V2 , V3 , V4 , V1 }.
C(N SHG)ExtremeR−Quasi−Eulerian−T ype−P ath−N eighborSuperHyperP 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-Eulerian-Type-Path-Neighbor
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-Eulerian-Type-Path-Neighbor. In other words, the least cardinality, the lower sharp bound
for the cardinality, of a quasi-R-Eulerian-Type-Path-Neighbor 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-Eulerian-Type-Path-Neighbor. 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-Eulerian-Type-Path-Neighbor 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-Eulerian-Type-Path-Neighbor.
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-Eulerian-Type-Path-Neighbor has the Extreme cardinality of an Extreme SuperHyperEdge.
Thus, an Extreme R-Eulerian-Type-Path-Neighbor has the Extreme cardinality at least an Extreme
SuperHyperEdge. Assume an Extreme SuperHyperSet V \V \{z}. This Extreme SuperHyperSet
isn’t an Extreme R-Eulerian-Type-Path-Neighbor 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-Eulerian-Type-Path-Neighbor” 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-Eulerian-Type-Path-Neighbor 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-Eulerian-Type-Path-Neighbor 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-Eulerian-Type-Path-Neighbor. Those Extreme
SuperHyperVertices are potentially included in an Extreme style-R-Eulerian-Type-Path-Neighbor.
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-Eulerian-Type-Path-Neighbor is
{aE , bE , cE , . . . , zE } .
This definition coincides with the definition of the Extreme R-Eulerian-Type-Path-Neighbor 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-Eulerian-Type-Path-Neighbor. 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, 2280
Extreme R-Eulerian-Type-Path-Neighbor =
E
{Z1 , Z2 , . . . , Zz | ∀i 6= j, i, j = 1, 2, . . . , z, ∃Ex , Zi ∼x Zj , }.
2281
Extreme R-Eulerian-Type-Path-Neighbor =
Thus E ∈ EESHG:(V,E) is an Extreme quasi-R-Eulerian-Type-Path-Neighbor where E ∈ EESHG:(V,E)

is fixed that means Ex = E ∈ EESHG:(V,E) . for all Extreme intended SuperHyperVertices
but in an Extreme Eulerian-Type-Path-Neighbor, 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-Eulerian-Type-Path-Neighbor is at least
V \ (V \ {aE , bE , cE , . . . , zE }).
It’s straightforward that the Extreme cardinality of the Extreme R-Eulerian-Type-Path-Neighbor 2282
is at least the maximum Extreme number of Extreme SuperHyperVertices of the Extreme 2283
SuperHyperEdges with the maximum number of the Extreme SuperHyperEdges. In other 2284
words, the maximum number of the Extreme SuperHyperEdges contains the maximum Extreme 2285
number of Extreme SuperHyperVertices are renamed to Extreme Eulerian-Type-Path-Neighbor in some 2286
cases but the maximum number of the Extreme SuperHyperEdge with the maximum Extreme 2287
number of Extreme SuperHyperVertices, has the Extreme SuperHyperVertices are contained in 2288
an Extreme R-Eulerian-Type-Path-Neighbor. 2289

The obvious SuperHyperGraph has no Extreme SuperHyperEdges. But the non-obvious 2290
Extreme SuperHyperModel is up. The quasi-SuperHyperModel addresses some issues about 2291
the Extreme optimal SuperHyperObject. It specially delivers some remarks on the Extreme 2292
SuperHyperSet of the Extreme SuperHyperVertices such that there’s distinct amount of Extreme 2293
SuperHyperEdges for distinct amount of Extreme SuperHyperVertices up to all taken from that 2294
Extreme SuperHyperSet of the Extreme SuperHyperVertices but this Extreme SuperHyperSet of 2295
the Extreme SuperHyperVertices is either has the maximum Extreme SuperHyperCardinality or 2296
it doesn’t have maximum Extreme SuperHyperCardinality. In a non-obvious SuperHyperModel, 2297
there’s at least one Extreme SuperHyperEdge containing at least all Extreme SuperHyperVertices. 2298
Thus it forms an Extreme quasi-R-Eulerian-Type-Path-Neighbor where the Extreme completion of 2299
the Extreme incidence is up in that. Thus it’s, literarily, an Extreme embedded R-Eulerian-Type- 2300
Path-Neighbor. The SuperHyperNotions of embedded SuperHyperSet and quasi-SuperHyperSet 2301

coincide. In the original setting, these types of SuperHyperSets only don’t satisfy on the 2302
maximum SuperHyperCardinality. Thus the embedded setting is elected such that those 2303
SuperHyperSets have the maximum Extreme SuperHyperCardinality and they’re Extreme 2304
SuperHyperOptimal. The less than two distinct types of Extreme SuperHyperVertices are 2305
included in the minimum Extreme style of the embedded Extreme R-Eulerian-Type-Path-Neighbor. 2306
The interior types of the Extreme SuperHyperVertices are deciders. Since the Extreme number 2307
of SuperHyperNeighbors are only affected by the interior Extreme SuperHyperVertices. The 2308
common connections, more precise and more formal, the perfect unique connections inside 2309
the Extreme SuperHyperSet for any distinct types of Extreme SuperHyperVertices pose the 2310
Extreme R-Eulerian-Type-Path-Neighbor. Thus Extreme exterior SuperHyperVertices could be used 2311
only in one Extreme SuperHyperEdge and in Extreme SuperHyperRelation with the interior 2312
Extreme SuperHyperVertices in that Extreme SuperHyperEdge. In the embedded Extreme 2313
Eulerian-Type-Path-Neighbor, there’s the usage of exterior Extreme SuperHyperVertices since they’ve 2314
more connections inside more than outside. Thus the title “exterior” is more relevant than 2315
the title “interior”. One Extreme SuperHyperVertex has no connection, inside. Thus, the 2316
Extreme SuperHyperSet of the Extreme SuperHyperVertices with one SuperHyperElement 2317
has been ignored in the exploring to lead on the optimal case implying the Extreme R-Eulerian- 2318
Type-Path-Neighbor. The Extreme R-Eulerian-Type-Path-Neighbor with the exclusion of the exclusion of 2319
all Extreme SuperHyperVertices in one Extreme SuperHyperEdge and with other terms, the 2320
Extreme R-Eulerian-Type-Path-Neighbor with the inclusion of all Extreme SuperHyperVertices in 2321
one Extreme SuperHyperEdge, is an Extreme quasi-R-Eulerian-Type-Path-Neighbor. To sum them 2322
up, in a connected non-obvious Extreme SuperHyperGraph ESHG : (V, E). There’s only one 2323
Extreme SuperHyperEdge E ∈ EESHG:(V,E) has only the maximum possibilities of the distinct 2324
interior Extreme SuperHyperVertices inside of any given Extreme quasi-R-Eulerian-Type-Path-Neighbor 2325
minus all Extreme SuperHypeNeighbor to some of them but not all of them. In other words, 2326
there’s only an unique Extreme SuperHyperEdge E ∈ EESHG:(V,E) has only two distinct 2327
Extreme SuperHyperVertices in an Extreme quasi-R-Eulerian-Type-Path-Neighbor, minus all Extreme 2328
SuperHypeNeighbor to some of them but not all of them. 2329
The main definition of the Extreme R-Eulerian-Type-Path-Neighbor has two titles. an Extreme quasi-R- 2330
Eulerian-Type-Path-Neighbor and its corresponded quasi-maximum Extreme R-SuperHyperCardinality 2331
are two titles in the terms of quasi-R-styles. For any Extreme number, there’s an Extreme 2332
quasi-R-Eulerian-Type-Path-Neighbor with that quasi-maximum Extreme SuperHyperCardinality in 2333
the terms of the embedded Extreme SuperHyperGraph. If there’s an embedded Extreme 2334
SuperHyperGraph, then the Extreme quasi-SuperHyperNotions lead us to take the collection of 2335
all the Extreme quasi-R-Eulerian-Type-Path-Neighbors for all Extreme numbers less than its Extreme 2336
corresponded maximum number. The essence of the Extreme Eulerian-Type-Path-Neighbor ends up 2337
but this essence starts up in the terms of the Extreme quasi-R-Eulerian-Type-Path-Neighbor, again 2338
and more in the operations of collecting all the Extreme quasi-R-Eulerian-Type-Path-Neighbors acted 2339
on the all possible used formations of the Extreme SuperHyperGraph to achieve one Extreme 2340
number. This Extreme number is 2341
considered as the equivalence class for all corresponded quasi-R-Eulerian-Type-Path-Neighbors. 2342
Let zExtreme Number , SExtreme SuperHyperSet and GExtreme Eulerian-Type-Path-Neighbor be an Extreme 2343
number, an Extreme SuperHyperSet and an Extreme Eulerian-Type-Path-Neighbor. Then 2344
[zExtreme Number ]Extreme Class = {SExtreme SuperHyperSet |

SExtreme SuperHyperSet = GExtreme Eulerian-Type-Path-Neighbor ,

|SExtreme SuperHyperSet |Extreme Cardinality

= zExtreme Number }.
As its consequences, the formal definition of the Extreme Eulerian-Type-Path-Neighbor is re-formalized 2345
and redefined as follows. 2346
GExtreme Eulerian-Type-Path-Neighbor ∈ ∪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 2347
definition for the Extreme Eulerian-Type-Path-Neighbor. 2348
GExtreme Eulerian-Type-Path-Neighbor =
{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 Eulerian-Type- 2349
poses the upcoming expressions.
Path-Neighbor 2350
{S ∈ ∪zExtreme Number [zExtreme Number ]Extreme Class |
To translate the statement to this mathematical literature, the formulae will be revised. 2351
= max zExtreme Number

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

And then, 2352

To get more visions in the closer look-up, there’s an overall overlook. 2353
GExtreme Eulerian-Type-Path-Neighbor ∈ ∪zExtreme Number [zExtreme Number ]Extreme Class =


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

2355

2356

Now, the extension of these types of approaches is up. Since the new term, “Extreme Super- 2357
HyperNeighborhood”, could be redefined as the collection of the Extreme SuperHyperVertices 2358
such that any amount of its Extreme SuperHyperVertices are incident to an Extreme SuperHy- 2359
perEdge. It’s, literarily, another name for “Extreme Quasi-Eulerian-Type-Path-Neighbor” but, precisely, 2360

it’s the generalization of “Extreme Quasi-Eulerian-Type-Path-Neighbor” since “Extreme Quasi-Eulerian- 2361

” happens “Extreme Eulerian-Type-Path-Neighbor” in an Extreme SuperHyperGraph as
Type-Path-Neighbor 2362
initial framework and background but “Extreme SuperHyperNeighborhood” may not happens 2363
“Extreme Eulerian-Type-Path-Neighbor” in an Extreme SuperHyperGraph as initial framework and 2364
preliminarily background since there are some ambiguities about the Extreme SuperHyperCar- 2365
dinality arise from it. To get orderly keywords, the terms, “Extreme SuperHyperNeighborhood”, 2366
“Extreme Quasi-Eulerian-Type-Path-Neighbor”, and “Extreme Eulerian-Type-Path-Neighbor” are up. 2367

Thus, let 2368
zExtreme Number , NExtreme SuperHyperNeighborhood and 2369
GExtreme Eulerian-Type-Path-Neighbor be an Extreme number, an Extreme SuperHyperNeighborhood 2370
and an Extreme Eulerian-Type-Path-Neighbor and the new terms are up. 2371
GExtreme Eulerian-Type-Path-Neighbor ∈ ∪zExtreme Number

[zExtreme Number ]Extreme Class =
∪zExtreme Number {NExtreme SuperHyperNeighborhood |
|NExtreme SuperHyperNeighborhood |Extreme Cardinality
2372
{NExtreme SuperHyperNeighborhood
∈ ∪zExtreme Number [zExtreme Number ]Extreme Class =
|NExtreme SuperHyperSet |Extreme Cardinality
= zExtreme Number |
2373
∈ ∪zExtreme Number [zExtreme Number ]Extreme Class |
2374

And with go back to initial structure, 2375
GExtreme Eulerian-Type-Path-Neighbor ∈ ∪zExtreme Number [zExtreme Number ]Extreme Class =


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

2377

2378

Thus, in a connected Extreme SuperHyperGraph ESHG : (V, E). The all interior Extreme
SuperHyperVertices belong to any Extreme quasi-R-Eulerian-Type-Path-Neighbor 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-Eulerian-Type-Path-Neighbor.

The Extreme SuperHyperSet of Extreme SuperHyperVertices,
Is the simple Extreme type-SuperHyperSet of the Extreme R-Eulerian-Type-Path-Neighbor. The

Extreme SuperHyperSet of the Extreme SuperHyperVertices,
Is an Extreme R-Eulerian-Type-Path-Neighbor 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 Eulerian-Type-Path-Neighbor 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 Eulerian-Type-Path-Neighbor is up. The obvious simple Extreme
type-SuperHyperSet called the Extreme Eulerian-Type-Path-Neighbor 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-Eulerian-Type-Path-Neighbor is up. To sum them up,
the Extreme SuperHyperSet of Extreme SuperHyperVertices,
Is the non-obvious simple Extreme type-SuperHyperSet of the Extreme R-Eulerian-Type-Path-Neighbor.

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

Neighbor, not:
Is the Extreme SuperHyperSet, not:
does includes only less than two SuperHyperVertices in a connected Extreme SuperHyperGraph 2379
ESHG : (V, E) but it’s impossible in the case, they’ve corresponded to an SuperHyperEdge. 2380
It’s interesting to mention that the only non-obvious simple Extreme type-SuperHyperSet called 2381
the 2382
“Extreme R-Eulerian-Type-Path-Neighbor” 2383
amid those obvious[non-obvious] simple Extreme type-SuperHyperSets called the 2384
Extreme R-Eulerian-Type-Path-Neighbor, 2385
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-Eulerian-Type-Path-Neighbor amid those obvious simple Extreme type-SuperHyperSets of
the Extreme Eulerian-Type-Path-Neighbor, 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-Eulerian-Type-Path-Neighbor. In other words, the least cardinality, the lower sharp
bound for the cardinality, of an Extreme R-Eulerian-Type-Path-Neighbor is the cardinality of
2386
To sum them up, in a connected Extreme SuperHyperGraph ESHG : (V, E). The all interior 2387
Extreme SuperHyperVertices belong to any Extreme quasi-R-Eulerian-Type-Path-Neighbor if for any 2388
of them, and any of other corresponded Extreme SuperHyperVertex, some interior Extreme 2389
SuperHyperVertices are mutually Extreme SuperHyperNeighbors with no Extreme exception at 2390
all minus all Extreme SuperHypeNeighbors to any amount of them. 2391
Assume a connected Extreme SuperHyperGraph ESHG : (V, E). Let an Extreme SuperHy- 2392
perEdge ESHE : E ∈ EESHG:(V,E) has some Extreme SuperHyperVertices r. Consider all 2393
Extreme numbers of those Extreme SuperHyperVertices from that Extreme SuperHyperEdge 2394
excluding excluding more than r distinct Extreme SuperHyperVertices, exclude to any given 2395
Extreme SuperHyperSet of the Extreme SuperHyperVertices. Consider there’s an Extreme 2396
R-Eulerian-Type-Path-Neighbor with the least cardinality, the lower sharp Extreme bound for Extreme 2397
cardinality. Assume a connected Extreme SuperHyperGraph ESHG : (V, E). The Extreme 2398
SuperHyperSet of the Extreme SuperHyperVertices VESHE \ {z} is an Extreme SuperHyperSet 2399
S of the Extreme SuperHyperVertices such that there’s an Extreme SuperHyperEdge to have 2400
some Extreme SuperHyperVertices uniquely but it isn’t an Extreme R-Eulerian-Type-Path-Neighbor. 2401
Since it doesn’t have 2402
2403
the maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme SuperHy- 2404
perVertices such that there’s an Extreme SuperHyperEdge to have some SuperHyperVertices 2405
uniquely. The Extreme SuperHyperSet of the Extreme SuperHyperVertices VESHE ∪ {z} is 2406
the maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme SuperHyper- 2407
Vertices but it isn’t an Extreme R-Eulerian-Type-Path-Neighbor. Since it doesn’t do the Extreme 2408
procedure such that such that there’s an Extreme SuperHyperEdge to have some Extreme 2409
SuperHyperVertices uniquely [there are at least one Extreme SuperHyperVertex outside 2410
implying there’s, sometimes in the connected Extreme SuperHyperGraph ESHG : (V, E), 2411
an Extreme SuperHyperVertex, titled its Extreme SuperHyperNeighbor, to that Extreme 2412
SuperHyperVertex in the Extreme SuperHyperSet S so as S doesn’t do “the Extreme pro- 2413
cedure”.]. There’s only one Extreme SuperHyperVertex outside the intended Extreme 2414
SuperHyperSet, VESHE ∪ {z}, in the terms of Extreme SuperHyperNeighborhood. Thus 2415

the obvious Extreme R-Eulerian-Type-Path-Neighbor, VESHE is up. The obvious simple Extreme 2416
type-SuperHyperSet of the Extreme R-Eulerian-Type-Path-Neighbor, VESHE , is an Extreme SuperHy- 2417
perSet, VESHE , includes only all Extreme SuperHyperVertices does forms any kind of Extreme 2418
pairs are titled Extreme SuperHyperNeighbors in a connected Extreme SuperHyperGraph 2419
ESHG : (V, E). Since the Extreme SuperHyperSet of the Extreme SuperHyperVertices VESHE , 2420
is the maximum Extreme SuperHyperCardinality of an Extreme SuperHyperSet S of 2421

Extreme SuperHyperVertices such that there’s an Extreme SuperHyperEdge to have some 2422
Extreme SuperHyperVertices uniquely. Thus, in a connected Extreme SuperHyperGraph 2423
ESHG : (V, E). Any Extreme R-Eulerian-Type-Path-Neighbor only contains all interior Extreme 2424
SuperHyperVertices and all exterior Extreme SuperHyperVertices from the unique Extreme 2425
SuperHyperEdge where there’s any of them has all possible Extreme SuperHyperNeighbors in 2426
and there’s all Extreme SuperHyperNeighborhoods in with no exception minus all Extreme 2427

SuperHypeNeighbors to some of them not all of them but everything is possible about Extreme 2428
SuperHyperNeighborhoods and Extreme SuperHyperNeighbors out. 2429
The SuperHyperNotion, namely, Eulerian-Type-Path-Neighbor, is up. There’s neither empty Su- 2430
perHyperEdge nor loop SuperHyperEdge. The following Extreme SuperHyperSet of Ex- 2431
treme SuperHyperEdges[SuperHyperVertices] is the simple Extreme type-SuperHyperSet 2432
of the Extreme Eulerian-Type-Path-Neighbor. The Extreme SuperHyperSet of Extreme SuperHy- 2433
perEdges[SuperHyperVertices], 2434

|EESHG:(V,E) |Extreme Cardinality
b c
= {E2i−1 }i=1 2
.
C(N SHG)ExtremeQuasi−Eulerian−T ype−P ath−N eighborSuperHyperP olynomial
= 2z b 2 c
.
C(N SHG)ExtremeR−Quasi−Eulerian−T ype−P ath−N eighbor = {Vi }si=1 , {Vj }tj=1 .
C(N SHG)ExtremeR−Quasi−Eulerian−T ype−P ath−N eighborSuperHyperP olynomial
= az s + bz t .
is the simple Extreme type-SuperHyperSet of the Extreme Eulerian-Type-Path-Neighbor. The Extreme 2435
SuperHyperSet of the Extreme SuperHyperEdges[SuperHyperVertices], 2436

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Is an Extreme Eulerian-Type-Path-Neighbor C(ESHG) for an Extreme SuperHyperGraph 2437

ESHG : (V, E) is an Extreme type-SuperHyperSet with 2438
2439
the maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme Su- 2440
perHyperEdges[SuperHyperVertices] such that there’s no Extreme SuperHyperVertex of an 2441
Extreme SuperHyperEdge is common and there’s an Extreme SuperHyperEdge for all Extreme 2442
SuperHyperVertices. There are not only two Extreme SuperHyperVertices inside the intended 2443
Extreme SuperHyperSet. Thus the non-obvious Extreme Eulerian-Type-Path-Neighbor is up. The 2444
obvious simple Extreme type-SuperHyperSet called the Extreme Eulerian-Type-Path-Neighbor is an 2445

Extreme SuperHyperSet includes only two Extreme SuperHyperVertices. But the Extreme 2446
SuperHyperSet of the Extreme SuperHyperEdges[SuperHyperVertices], 2447

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- 2448
Set. Thus the non-obvious simple Extreme type-SuperHyperSet of the Extreme Eulerian-Type- 2449
Path-Neighbor is up. To sum them up, the Extreme SuperHyperSet of the Extreme SuperHy- 2450

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 Eulerian-Type-Path-Neighbor. 2452

Since the Extreme SuperHyperSet of the Extreme SuperHyperEdges[SuperHyperVertices], 2453

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Is an Extreme Eulerian-Type-Path-Neighbor C(ESHG) for an Extreme SuperHyperGraph ESHG : 2454

(V, E) is the Extreme SuperHyperSet S of Extreme SuperHyperVertices such that there’s 2455
no an Extreme SuperHyperEdge for some Extreme SuperHyperVertices given by that Ex- 2456
treme type-SuperHyperSet called the Extreme Eulerian-Type-Path-Neighbor and it’s an Extreme 2457
Eulerian-Type-Path-Neighbor. Since it’s 2458
2459
the maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme Su- 2460
perHyperEdges[SuperHyperVertices] such that there’s no Extreme SuperHyperVertex of an 2461
Extreme SuperHyperEdge is common and there’s an Extreme SuperHyperEdge for all Extreme 2462
SuperHyperVertices. There aren’t only less than three Extreme SuperHyperVertices inside the 2463
intended Extreme SuperHyperSet, 2464

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Thus the non-obvious Extreme Eulerian-Type-Path-Neighbor , 2465

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 ,

Eulerian-Type-Path-Neighbor 2466
not: 2467

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

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 2469
ESHG : (V, E). It’s interesting to mention that the only non-obvious simple Extreme type- 2470
SuperHyperSet called the 2471
“Extreme Eulerian-Type-Path-Neighbor ” 2472
amid those obvious[non-obvious] simple Extreme type-SuperHyperSets called the 2473
Extreme Eulerian-Type-Path-Neighbor , 2474
is only and only 2475

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

CHAPTER 11 2477
The Extreme Departures on The 2478
Theoretical Results Toward Theoretical 2479
Motivations 2480
The previous Extreme approach apply on the upcoming Extreme results on Extreme 2481
SuperHyperClasses. 2482
Proposition 11.0.1. Assume a connected Extreme SuperHyperPath ESHP : (V, E). Then 2483

= {Ei ∈ EN SHG }.
= {Vi ∈ VN SHG }.
Proof. Let 2484
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V |EN SHG |
, E |EN SHG |
3 3
2485
P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
...,
EXT ERN AL
E |EN SHG | , V |EN SHG |
3 3
115
Figure 11.1: an Extreme SuperHyperPath Associated to the Notions of Extreme

SuperHyperEulerian-Type-Path-Neighbor in the Example (42.0.5) 136NSHG18a
be a longest path taken from a connected Extreme SuperHyperPath ESHP : (V, E). There’s a 2486
new way to redefine as 2487
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 2488
to ViEXT ERN AL in the literatures of SuperHyperEulerian-Type-Path-Neighbor. The latter is 2489

straightforward. 2490
136EXM18a Example 11.0.2. In the Figure (31.1), the connected Extreme SuperHyperPath ESHP : (V, E), 2491
is highlighted and featured. The Extreme SuperHyperSet, in the Extreme SuperHyperModel 2492
(31.1), is the SuperHyperEulerian-Type-Path-Neighbor. 2493
Proposition 11.0.3. Assume a connected Extreme SuperHyperCycle ESHC : (V, E). Then 2494

= {Ei ∈ EN SHG }.
= |EN SHG |z |Ei ∈EN SHG | .

= {Vi ∈ VN SHG }.
= |EN SHG |z |Vi ∈VN SHG | .
Proof. Let 2495
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V |EN SHG |
, E |EN SHG |
3 3
2496
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 2497

136EXM19a Example 11.0.4. In the Figure (31.2), the connected Extreme SuperHyperCycle N SHC : 2502
(V, E), is highlighted and featured. The obtained Extreme SuperHyperSet, in the Extreme 2503
SuperHyperModel (31.2), is the Extreme SuperHyperEulerian-Type-Path-Neighbor. 2504
Proposition 11.0.5. Assume a connected Extreme SuperHyperStar ESHS : (V, E). Then 2505

= {Ei }.
= z |Ei | .
= {VEEXT
i
ERN AL
}.
EXT ERN AL
= z |VEi |
.

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

SuperHyperEulerian-Type-Path-Neighbor in the Extreme Example (42.0.7) 136NSHG19a
Proof. Let 2506
P :
V1EXT ERN AL , E1 ,
CEN T ER, E2
2507
P :
E1 , V1EXT ERN AL ,
E2 , CEN T ER
be a longest path taken a connected Extreme SuperHyperStar ESHS : (V, E). There’s a new 2508
way to redefine as 2509


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

SuperHyperEulerian-Type-Path-Neighbor in the Extreme Example (42.0.9) 136NSHG20a
136EXM20a Example 11.0.6. In the Figure (31.3), the connected Extreme SuperHyperStar ESHS : (V, E), 2513
is highlighted and featured. The obtained Extreme SuperHyperSet, by the Algorithm in previous 2514
Extreme result, of the Extreme SuperHyperVertices of the connected Extreme SuperHyperStar 2515
ESHS : (V, E), in the Extreme SuperHyperModel (31.3), is the Extreme SuperHyperEulerian- 2516
Type-Path-Neighbor. 2517
Proposition 11.0.7. Assume a connected Extreme SuperHyperBipartite ESHB : (V, E). Then 2518

= {Ei ∈ PNmin
SHG }.
min
= z |Ei ∈PN SHG | .
= {VEEXT
i ∈P
ERN AL
min }.
N SHG

|VEEXT ERN AL
∈P min
|
=z i N SHG .
Proof. Let 2519
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
2520
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 2521
a new way to redefine as 2522

straightforward. Then there’s no at least one SuperHyperEulerian-Type-Path-Neighbor. Thus the 2525
notion of quasi may be up but the SuperHyperNotions based on SuperHyperEulerian-Type-Path- 2526
Neighbor could be applied. There are only two SuperHyperParts. Thus every SuperHyperPart 2527
could have one SuperHyperVertex as the representative in the 2528
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperEulerian-Type-Path-Neighbor taken from a connected Extreme SuperHyperBi- 2529

partite ESHB : (V, E). Thus only some SuperHyperVertices and only minimum-Extreme-of- 2530
SuperHyperPart SuperHyperEdges are attained in any solution 2531
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
The latter is straightforward. 2532
136EXM21a Example 11.0.8. In the Extreme Figure (31.4), the connected Extreme SuperHyperBipartite 2533
ESHB : (V, E), is Extreme highlighted and Extreme featured. The obtained Extreme 2534
SuperHyperSet, by the Extreme Algorithm in previous Extreme result, of the Extreme 2535
SuperHyperVertices of the connected Extreme SuperHyperBipartite ESHB : (V, E), in the 2536
Extreme SuperHyperModel (31.4), is the Extreme SuperHyperEulerian-Type-Path-Neighbor. 2537

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

Extreme SuperHyperEulerian-Type-Path-Neighbor in the Example (42.0.11) 136NSHG21a
Proposition 11.0.9. Assume a connected Extreme SuperHyperMultipartite ESHM : (V, E). 2538
Then 2539

= {Ei ∈ PNmin
SHG }.
min
= {VEEXT
i ∈P
ERN AL
min }.
N SHG

|VEEXT ERN AL
∈P min
|
=z i N SHG .
Proof. Let 2540
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
j N SHG

2541
P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
...,
EXT ERN AL
j N SHG
is a longest SuperHyperEulerian-Type-Path-Neighbor taken from a connected Extreme SuperHyper- 2542

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

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

(V, E). Thus only some SuperHyperVertices and only minimum-Extreme-of-SuperHyperPart 2551
SuperHyperEdges are attained in any solution 2552
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest path taken from a connected Extreme SuperHyperMultipartite ESHM : (V, E). 2553
136EXM22a Example 11.0.10. In the Figure (31.5), the connected Extreme SuperHyperMultipartite 2555
ESHM : (V, E), is highlighted and Extreme featured. The obtained Extreme SuperHyperSet, by 2556
the Algorithm in previous Extreme result, of the Extreme SuperHyperVertices of the connected 2557
Extreme SuperHyperMultipartite ESHM : (V, E), in the Extreme SuperHyperModel (31.5), is 2558
the Extreme SuperHyperEulerian-Type-Path-Neighbor. 2559
Proposition 11.0.11. Assume a connected Extreme SuperHyperWheel ESHW : (V, E). Then, 2560

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

= {Ei ∈ (EN SHG }.

= z |Ei ∈(EN SHG | .
= {V EXT ERN AL }.
EXT ERN AL
= z |V |
.
Proof. Let 2561
P :
V1EXT ERN AL , E1∗ ,
CEN T ER, E2∗
2562
P :
E1∗ , V1EXT ERN AL ,
E2∗ , CEN T ER
is a longest SuperHyperEulerian-Type-Path-Neighbor taken from a connected Extreme SuperHyper- 2563

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

Extreme SuperHyperEulerian-Type-Path-Neighbor in the Extreme Example (42.0.15) 136NSHG23a
Wheel ESHW : (V, E). There’s a new way to redefine as 2564

straightforward. Then there’s at least one SuperHyperEulerian-Type-Path-Neighbor. Thus the notion 2567
of quasi isn’t up and the SuperHyperNotions based on SuperHyperEulerian-Type-Path-Neighbor 2568
could be applied. The unique embedded SuperHyperEulerian-Type-Path-Neighbor proposes some 2569
longest SuperHyperEulerian-Type-Path-Neighbor excerpt from some representatives. The latter is 2570

136EXM23a Example 11.0.12. In the Extreme Figure (31.6), the connected Extreme SuperHyperWheel 2572
N SHW : (V, E), is Extreme highlighted and featured. The obtained Extreme SuperHyperSet, 2573
by the Algorithm in previous result, of the Extreme SuperHyperVertices of the connected 2574
Extreme SuperHyperWheel ESHW : (V, E), in the Extreme SuperHyperModel (31.6), is the 2575
Extreme SuperHyperEulerian-Type-Path-Neighbor. 2576

CHAPTER 12 2577
The Surveys of Mathematical Sets On 2578
The Results But As The Initial Motivation 2579
For the SuperHyperEulerian-Type-Path-Neighbor, Extreme SuperHyperEulerian-Type-Path-Neighbor, and the 2580

Extreme SuperHyperEulerian-Type-Path-Neighbor, some general results are introduced. 2581
Remark 12.0.1. Let remind that the Extreme SuperHyperEulerian-Type-Path-Neighbor is “redefined” 2582
on the positions of the alphabets. 2583
Corollary 12.0.2. Assume Extreme SuperHyperEulerian-Type-Path-Neighbor. Then 2584
Extreme SuperHyperEulerian − T ype − P ath − N eighbor =

{theSuperHyperEulerian − T ype − P ath − N eighborof theSuperHyperV ertices |
max |SuperHyperOf f ensive
SuperHyperEulerian − T ype − P ath − N eighbor
|ExtremecardinalityamidthoseSuperHyperEulerian−T ype−P ath−N eighbor. }
plus one Extreme SuperHypeNeighbor to one. Where σi is the unary operation on the 2585
SuperHyperVertices of the SuperHyperGraph to assign the determinacy, the indeterminacy 2586
and the neutrality, for i = 1, 2, 3, respectively. 2587
Corollary 12.0.3. Assume an Extreme SuperHyperGraph on the same identical letter of the 2588
alphabet. Then the notion of Extreme SuperHyperEulerian-Type-Path-Neighbor and SuperHyperEulerian- 2589
Type-Path-Neighbor coincide. 2590
Corollary 12.0.4. Assume an Extreme SuperHyperGraph on the same identical letter of 2591
the alphabet. Then a conseNeighborive sequence of the SuperHyperVertices is an Extreme 2592
SuperHyperEulerian-Type-Path-Neighbor if and only if it’s a SuperHyperEulerian-Type-Path-Neighbor. 2593
Corollary 12.0.5. Assume an Extreme SuperHyperGraph on the same identical letter of 2594
the alphabet. Then a conseNeighborive sequence of the SuperHyperVertices is a strongest 2595
SuperHyperEulerian-Type-Path-Neighbor if and only if it’s a longest SuperHyperEulerian-Type-Path-Neighbor. 2596
Corollary 12.0.6. Assume SuperHyperClasses of an Extreme SuperHyperGraph on the same 2597
identical letter of the alphabet. Then its Extreme SuperHyperEulerian-Type-Path-Neighbor is its 2598
SuperHyperEulerian-Type-Path-Neighbor and reversely. 2599
125
Corollary 12.0.7. Assume an Extreme SuperHyperPath(-/SuperHyperEulerian-Type-Path-Neighbor, 2600

SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel) on the same 2601
identical letter of the alphabet. Then its Extreme SuperHyperEulerian-Type-Path-Neighbor is its 2602
Corollary 12.0.8. Assume an Extreme SuperHyperGraph. Then its Extreme SuperHyperEulerian- 2604
isn’t well-defined if and only if its SuperHyperEulerian-Type-Path-Neighbor isn’t well-

defined. 2606
Corollary 12.0.9. Assume SuperHyperClasses of an Extreme SuperHyperGraph. Then its 2607

Extreme SuperHyperEulerian-Type-Path-Neighbor isn’t well-defined if and only if its SuperHyperEulerian- 2608
Type-Path-Neighbor isn’t well-defined. 2609
SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). Then its 2611

Extreme SuperHyperEulerian-Type-Path-Neighbor isn’t well-defined if and only if its SuperHyperEulerian- 2612
Type-Path-Neighbor isn’t well-defined. 2613
Corollary 12.0.11. Assume an Extreme SuperHyperGraph. Then its Extreme SuperHyperEulerian- 2614
is well-defined if and only if its SuperHyperEulerian-Type-Path-Neighbor is well-defined.
Corollary 12.0.12. Assume SuperHyperClasses of an Extreme SuperHyperGraph. Then its 2616

Extreme SuperHyperEulerian-Type-Path-Neighbor is well-defined if and only if its SuperHyperEulerian-Type- 2617
Path-Neighbor is well-defined. 2618

Extreme SuperHyperEulerian-Type-Path-Neighbor is well-defined if and only if its SuperHyperEulerian-Type- 2621

Path-Neighbor is well-defined. 2622
Proposition 12.0.14. Let ESHG : (V, E) be an Extreme SuperHyperGraph. Then V is 2623
(i) : the dual SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 2624
(ii) : the strong dual SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 2625
(iii) : the connected dual SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 2626
(iv) : the δ-dual SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 2627
(v) : the strong δ-dual SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 2628
(vi) : the connected δ-dual SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor. 2629
Proposition 12.0.15. Let N T G : (V, E, σ, µ) be an Extreme SuperHyperGraph. Then ∅ is 2630
(i) : the SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 2631
(ii) : the strong SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 2632
(iii) : the connected defensive SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 2633
(iv) : the δ-SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 2634

(v) : the strong δ-SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 2635
(vi) : the connected δ-SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor. 2636
Proposition 12.0.16. Let ESHG : (V, E) be an Extreme SuperHyperGraph. Then an 2637

independent SuperHyperSet is 2638
(iii) : the connected SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 2641
Proposition 12.0.17. Let ESHG : (V, E) be an Extreme SuperHyperUniform SuperHyperGraph 2645

which is a SuperHyperEulerian-Type-Path-Neighbor/SuperHyperPath. Then V is a maximal 2646
(i) : SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 2647
(ii) : strong SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 2648
(iii) : connected SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 2649
(iv) : O(ESHG)-SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 2650
(v) : strong O(ESHG)-SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 2651
(vi) : connected O(ESHG)-SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 2652
Where the exterior SuperHyperVertices and the interior SuperHyperVertices coincide. 2653
Proposition 12.0.18. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is a 2654
SuperHyperUniform SuperHyperWheel. Then V is a maximal 2655
(i) : dual SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 2656
(ii) : strong dual SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 2657
(iii) : connected dual SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 2658
(iv) : O(ESHG)-dual SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 2659
(v) : strong O(ESHG)-dual SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 2660
(vi) : connected O(ESHG)-dual SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 2661
which is a SuperHyperEulerian-Type-Path-Neighbor/SuperHyperPath. Then the number of 2664

(i) : the SuperHyperEulerian-Type-Path-Neighbor; 2665
(ii) : the SuperHyperEulerian-Type-Path-Neighbor; 2666
(iii) : the connected SuperHyperEulerian-Type-Path-Neighbor; 2667
(iv) : the O(ESHG)-SuperHyperEulerian-Type-Path-Neighbor; 2668
(v) : the strong O(ESHG)-SuperHyperEulerian-Type-Path-Neighbor; 2669
(vi) : the connected O(ESHG)-SuperHyperEulerian-Type-Path-Neighbor. 2670
is one and it’s only V. Where the exterior SuperHyperVertices and the interior SuperHyperVertices 2671
coincide. 2672

which is a SuperHyperWheel. Then the number of 2674
(i) : the dual SuperHyperEulerian-Type-Path-Neighbor; 2675
(ii) : the dual SuperHyperEulerian-Type-Path-Neighbor; 2676
(iii) : the dual connected SuperHyperEulerian-Type-Path-Neighbor; 2677
(iv) : the dual O(ESHG)-SuperHyperEulerian-Type-Path-Neighbor; 2678
(v) : the strong dual O(ESHG)-SuperHyperEulerian-Type-Path-Neighbor; 2679
(vi) : the connected dual O(ESHG)-SuperHyperEulerian-Type-Path-Neighbor. 2680
coincide. 2682

which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperComplete 2684
SuperHyperMultipartite. Then a SuperHyperSet contains [the SuperHyperCenter and] the half of 2685
multiplying r with the number of all the SuperHyperEdges plus one of all the SuperHyperVertices 2686
is a 2687
O(ESHG)
(iv) : 2 + 1-dual SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 2691
O(ESHG)
(v) : strong 2 + 1-dual SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 2692
O(ESHG)
(vi) : connected 2 + 1-dual SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor. 2693


SuperHyperMultipartite. Then a SuperHyperSet contains the half of multiplying r with the 2696
number of all the SuperHyperEdges plus one of all the SuperHyperVertices in the biggest 2697
SuperHyperPart is a 2698
(iv) : δ-SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 2702
(v) : strong δ-SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 2703
(vi) : connected δ-SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor. 2704

SuperHyperMultipartite. Then Then the number of 2707
O(ESHG)
O(ESHG)
O(ESHG)
is one and it’s only S, a SuperHyperSet contains [the SuperHyperCenter and] the half of 2714
multiplying r with the number of all the SuperHyperEdges plus one of all the SuperHyperVertices. 2715
Proposition 12.0.24. Let ESHG : (V, E) be an Extreme SuperHyperGraph. The number of 2717
connected component is |V − S| if there’s a SuperHyperSet which is a dual 2718
(iv) : SuperHyperEulerian-Type-Path-Neighbor; 2722
(v) : strong 1-SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 2723
(vi) : connected 1-SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor. 2724

Proposition 12.0.25. Let ESHG : (V, E) be an Extreme SuperHyperGraph. Then the number 2725
is at most O(ESHG) and the Extreme number is at most On (ESHG). 2726
Proposition 12.0.26. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is 2727
SuperHyperComplete. The number is O(ESHG:(V,E)) 2 + 1 and the Extreme number is 2728

min Σv∈{v1 ,v2 ,··· ,vt } O(ESHG:(V,E)) ⊆V σ(v), in the setting of dual 2729
t>
2
(iv) : ( O(ESHG:(V,E))
2 + 1)-SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 2733
(v) : strong ( O(ESHG:(V,E))

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

2 + 1)-SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor. 2735
Proposition 12.0.27. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is ∅. The 2736
number is 0 and the Extreme number is 0, for an independent SuperHyperSet in the setting of 2737
dual 2738
(iv) : 0-SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 2742
Proposition 12.0.28. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is SuperHy- 2745
perComplete. Then there’s no independent SuperHyperSet. 2746
Proposition 12.0.29. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is 2747

SuperHyperEulerian-Type-Path-Neighbor/SuperHyperPath/SuperHyperWheel. The number is O(ESHG : 2748
(V, E)) and the Extreme number is On (ESHG : (V, E)), in the setting of a dual 2749
(iv) : O(ESHG : (V, E))-SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 2753
(v) : strong O(ESHG : (V, E))-SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 2754
(vi) : connected O(ESHG : (V, E))-SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor. 2755

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


Proposition 12.0.31. Let N SHF : (V, E) be a SuperHyperFamily of the ESHGs : (V, E) 2766
Extreme SuperHyperGraphs which are from one-type SuperHyperClass which the result is obtained 2767
for the individuals. Then the results also hold for the SuperHyperFamily N SHF : (V, E) of 2768
these specific SuperHyperClasses of the Extreme SuperHyperGraphs. 2769
Proposition 12.0.32. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph. If S is a dual 2770
SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor, then ∀v ∈ V \ S, ∃x ∈ S such that 2771
(i) v ∈ Ns (x); 2772
(ii) vx ∈ E. 2773
Proposition 12.0.33. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph. If S is a dual 2774
SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor, then 2775
(i) S is SuperHyperEulerian-Type-Path-Neighbor set; 2776
(ii) there’s S ⊆ S 0 such that |S 0 | is SuperHyperChromatic number. 2777
Proposition 12.0.34. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph. Then 2778
(i) Γ ≤ O; 2779
(ii) Γs ≤ On . 2780
Proposition 12.0.35. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph which is 2781
connected. Then 2782
(i) Γ ≤ O − 1; 2783
(ii) Γs ≤ On − Σ3i=1 σi (x). 2784
Proposition 12.0.36. Let ESHG : (V, E) be an odd SuperHyperPath. Then 2785
(i) the SuperHyperSet S = {v2 , v4 , · · · , vn−1 } is a dual SuperHyperDefensive 2786
SuperHyperEulerian-Type-Path-Neighbor; 2787

(ii) Γ = b n2 c + 1 and corresponded SuperHyperSet is S = {v2 , v4 , · · · , vn−1 }; 2788
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· ,vn−1 } Σ3i=1 σi (s)}; 2789
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn−1 } and S2 = {v1 , v3 , · · · , vn−1 } are only a dual 2790
Proposition 12.0.37. Let ESHG : (V, E) be an even SuperHyperPath. Then 2792
(i) the set S = {v2 , v4 , · · · .vn } is a dual SuperHyperDefensive SuperHyperEulerian-Type-Path- 2793

Neighbor; 2794
(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · .vn } and {v1 , v3 , · · · .vn−1 }; 2795
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 2796
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 2797
Proposition 12.0.38. Let ESHG : (V, E) be an even SuperHyperEulerian-Type-Path-Neighbor. Then 2799
(i) the SuperHyperSet S = {v2 , v4 , · · · , vn } is a dual SuperHyperDefensive SuperHyperEulerian- 2800
Type-Path-Neighbor; 2801
(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · , vn } and {v1 , v3 , · · · , vn−1 }; 2802
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } σ(s), Σs∈S={v1 ,v3 ,··· ,vn−1 } σ(s)}; 2803
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn } and S2 = {v1 , v3 , · · · , vn−1 } are only dual 2804
Proposition 12.0.39. Let ESHG : (V, E) be an odd SuperHyperEulerian-Type-Path-Neighbor. Then 2806

(iii) Γs = min{Σs∈S={v2 ,v4 ,··· .vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 2810
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn−1 } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 2811
Proposition 12.0.40. Let ESHG : (V, E) be SuperHyperStar. Then 2813
(i) the SuperHyperSet S = {c} is a dual maximal SuperHyperEulerian-Type-Path-Neighbor; 2814
(ii) Γ = 1; 2815
(iii) Γs = Σ3i=1 σi (c); 2816
(iv) the SuperHyperSets S = {c} and S ⊂ S 0 are only dual SuperHyperEulerian-Type-Path-Neighbor. 2817
Proposition 12.0.41. Let ESHG : (V, E) be SuperHyperWheel. Then 2818

6+3(i−1)≤n
(i) the SuperHyperSet S = {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is a dual maximal 2819
SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 2820
6+3(i−1)≤n
(ii) Γ = |{v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 |; 2821
(iii) Γs = Σ{v1 ,v3 }∪{v6 ,v9 ··· ,vi+6 ,··· ,vn }6+3(i−1)≤n Σ3i=1 σi (s); 2822
i=1
6+3(i−1)≤n
(iv) the SuperHyperSet {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is only a dual maximal 2823
SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor. 2824
Proposition 12.0.42. Let ESHG : (V, E) be an odd SuperHyperComplete. Then 2825
b n c+1
(i) the SuperHyperSet S = {vi }i=1
2
is a dual SuperHyperDefensive SuperHyperEulerian-Type- 2826
Path-Neighbor; 2827
(ii) Γ = b n2 c + 1; 2828
(iii) Γs = min{Σs∈S Σ3i=1 σi (s)} 2

b n c+1 ; 2829
S={vi }i=1
b n c+1
(iv) the SuperHyperSet S = {vi }i=1
2
is only a dual SuperHyperDefensive SuperHyperEulerian- 2830
Proposition 12.0.43. Let ESHG : (V, E) be an even SuperHyperComplete. Then 2832
bnc
2
is a dual SuperHyperDefensive SuperHyperEulerian-Type-Path- 2833
Neighbor; 2834
(ii) Γ = b n2 c; 2835

bnc ; 2836
S={vi }i=1
bnc
(iv) the SuperHyperSet S = {vi }i=1 2
is only a dual maximal SuperHyperDefensive 2837
Proposition 12.0.44. Let N SHF : (V, E) be a m-SuperHyperFamily of Extreme SuperHyper- 2839

Stars with common Extreme SuperHyperVertex SuperHyperSet. Then 2840
(i) the SuperHyperSet S = {c1 , c2 , · · · , cm } is a dual SuperHyperDefensive SuperHyperEulerian- 2841

Type-Path-Neighbor for N SHF; 2842
(ii) Γ = m for N SHF : (V, E); 2843
(iii) Γs = Σm 3
i=1 Σj=1 σj (ci ) for N SHF : (V, E); 2844
(iv) the SuperHyperSets S = {c1 , c2 , · · · , cm } and S ⊂ S 0 are only dual SuperHyperEulerian-Type- 2845
Path-Neighbor for N SHF : (V, E). 2846
Proposition 12.0.45. Let N SHF : (V, E) be an m-SuperHyperFamily of odd SuperHyperCom- 2847
plete SuperHyperGraphs with common Extreme SuperHyperVertex SuperHyperSet. Then 2848

b n c+1
(i) the SuperHyperSet S = {vi }i=1 2
is a dual maximal SuperHyperDefensive 2849
SuperHyperEulerian-Type-Path-Neighbor for N SHF; 2850
(ii) Γ = b n2 c + 1 for N SHF : (V, E); 2851

b n c+1 for N SHF : (V, E); 2852
S={vi }i=1
b n c+1
(iv) the SuperHyperSets S = {vi }i=1
2
are only a dual maximal SuperHyperEulerian-Type-Path- 2853
Neighbor for N SHF : (V, E). 2854
Proposition 12.0.46. Let N SHF : (V, E) be a m-SuperHyperFamily of even SuperHyperCom- 2855

plete SuperHyperGraphs with common Extreme SuperHyperVertex SuperHyperSet. Then 2856
bnc
2
Neighbor for N SHF : (V, E); 2858
(ii) Γ = b n2 c for N SHF : (V, E); 2859

bnc for N SHF : (V, E); 2860
S={vi }i=1
bnc
2
are only dual maximal SuperHyperEulerian-Type-Path-Neighbor 2861
for N SHF : (V, E). 2862
following statements hold; 2864
(i) if s ≥ t and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 2865

SuperHyperEulerian-Type-Path-Neighbor, then S is an s-SuperHyperDefensive SuperHyperEulerian- 2866
(ii) if s ≤ t and a SuperHyperSet S of SuperHyperVertices is a dual t-SuperHyperDefensive 2868

SuperHyperEulerian-Type-Path-Neighbor, then S is a dual s-SuperHyperDefensive SuperHyperEulerian- 2869
(i) if s ≥ t + 2 and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 2873
SuperHyperEulerian-Type-Path-Neighbor, then S is an s-SuperHyperPowerful SuperHyperEulerian- 2874


SuperHyperEulerian-Type-Path-Neighbor, then S is a dual s-SuperHyperPowerful SuperHyperEulerian- 2877
Proposition 12.0.49. Let ESHG : (V, E) be a[an] [V-]SuperHyperUniform-strong-Extreme 2879

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

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

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

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

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

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

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

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


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

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


SuperHyperGraph which is SuperHyperEulerian-Type-Path-Neighbor. Then following statements hold; 2920
(i) ∀a ∈ S, |Ns (a)∩S| < 2 if ESHG : (V, E)) is an 2-SuperHyperDefensive SuperHyperEulerian- 2921
(ii) ∀a ∈ V \ S, |Ns (a) ∩ S| > 2 if ESHG : (V, E) is a dual 2-SuperHyperDefensive 2923

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

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


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

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

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


CHAPTER 13 2939
Extreme Applications in Cancer’s 2940
Extreme Recognition 2941
The cancer is the Extreme disease but the Extreme model is going to figure out what’s going on 2942
this Extreme phenomenon. The special Extreme case of this Extreme disease is considered and 2943
disease but the moves of the cancer in the special region are the matter of mind. The Extreme 2945
recognition of the cancer could help to find some Extreme treatments for this Extreme disease. 2946
In the following, some Extreme steps are Extreme devised on this disease. 2947
Step 1. (Extreme Definition) The Extreme recognition of the cancer in the long-term Extreme 2948
function. 2949
Step 2. (Extreme Issue) The specific region has been assigned by the Extreme model [it’s called 2950
Extreme SuperHyperGraph] and the long Extreme cycle of the move from the cancer is 2951
identified by this research. Sometimes the move of the cancer hasn’t be easily identified 2952
since there are some determinacy, indeterminacy and neutrality about the moves and the 2953
effects of the cancer on that region; this event leads us to choose another model [it’s said 2954
to be Extreme SuperHyperGraph] to have convenient perception on what’s happened and 2955
what’s done. 2956
Step 3. (Extreme Model) There are some specific Extreme models, which are well-known 2957
and they’ve got the names, and some general Extreme models. The moves and the 2958
Extreme traces of the cancer on the complex tracks and between complicated groups 2959
of cells could be fantasized by an Extreme SuperHyperPath(-/SuperHyperEulerian-Type-Path- 2960
Neighbor, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). 2961
The aim is to find either the Extreme SuperHyperEulerian-Type-Path-Neighbor or the Extreme 2962
SuperHyperEulerian-Type-Path-Neighbor in those Extreme Extreme SuperHyperModels. 2963
137
CHAPTER 14 2964
Case 1: The Initial Extreme Steps 2965
Toward Extreme SuperHyperBipartite 2966
as Extreme SuperHyperModel 2967
Step 4. (Extreme Solution) In the Extreme Figure (34.1), the Extreme SuperHyperBipartite 2968
is Extreme highlighted and Extreme featured. 2969
By using the Extreme Figure (34.1) and the Table (34.1), the Extreme SuperHyperBipartite 2970
is obtained. 2971
The obtained Extreme SuperHyperSet, by the Extreme Algorithm in previous Extreme 2972
Figure 14.1: an Extreme SuperHyperBipartite Associated to the Notions of Extreme

SuperHyperEulerian-Type-Path-Neighbor 136NSHGaa21aa
139
Belong to The Extreme SuperHyperBipartite

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

ESHB : (V, E), in the Extreme SuperHyperModel (34.1), is the Extreme SuperHyperEulerian- 2974

CHAPTER 15 2976
Case 2: The Increasing Extreme Steps 2977
Toward Extreme 2978
SuperHyperMultipartite as Extreme 2979
SuperHyperModel 2980
Step 4. (Extreme Solution) In the Extreme Figure (35.1), the Extreme SuperHyperMultipartite 2981
is Extreme highlighted and Extreme featured. 2982
By using the Extreme Figure (35.1) and the Table (35.1), the Extreme SuperHyperMulti- 2983
partite is obtained. 2984
The obtained Extreme SuperHyperSet, by the Extreme Algorithm in previous result, of the 2985
Figure 15.1: an Extreme SuperHyperMultipartite Associated to the Notions of Extreme

141
Belong to The Extreme SuperHyperMultipartite

136TBLaa22aa
Extreme SuperHyperVertices of the connected Extreme SuperHyperMultipartite ESHM : 2986

(V, E), in the Extreme SuperHyperModel (35.1), is the Extreme SuperHyperEulerian-Type-Path- 2987
Neighbor. 2988

CHAPTER 16 2989
Wondering Open Problems But As The 2990
Directions To Forming The Motivations 2991
In what follows, some “problems” and some “questions” are proposed. 2992
The SuperHyperEulerian-Type-Path-Neighbor and the Extreme SuperHyperEulerian-Type-Path-Neighbor are 2993
defined on a real-world application, titled “Cancer’s Recognitions”. 2994
Question 16.0.1. Which the else SuperHyperModels could be defined based on Cancer’s 2995
recognitions? 2996
Question 16.0.2. Are there some SuperHyperNotions related to SuperHyperEulerian-Type-Path-Neighbor 2997

and the Extreme SuperHyperEulerian-Type-Path-Neighbor? 2998
Question 16.0.3. Are there some Algorithms to be defined on the SuperHyperModels to compute 2999
them? 3000
Question 16.0.4. Which the SuperHyperNotions are related to beyond the SuperHyperEulerian- 3001
and the Extreme SuperHyperEulerian-Type-Path-Neighbor?
Problem 16.0.5. The SuperHyperEulerian-Type-Path-Neighbor and the Extreme SuperHyperEulerian- 3003

do a SuperHyperModel for the Cancer’s recognitions and they’re based on
SuperHyperEulerian-Type-Path-Neighbor, are there else? 3005
Problem 16.0.6. Which the fundamental SuperHyperNumbers are related to these SuperHyper- 3006
Numbers types-results? 3007
Problem 16.0.7. What’s the independent research based on Cancer’s recognitions concerning 3008
the multiple types of SuperHyperNotions? 3009
143
CHAPTER 17 3010
Conclusion and Closing Remarks 3011
In this section, concluding remarks and closing remarks are represented. The drawbacks of this 3012
research are illustrated. Some benefits and some advantages of this research are highlighted. 3013
This research uses some approaches to make Extreme SuperHyperGraphs more understandable. 3014
In this endeavor, two SuperHyperNotions are defined on the SuperHyperEulerian-Type-Path-Neighbor. 3015
For that sake in the second definition, the main definition of the Extreme SuperHyperGraph 3016
is redefined on the position of the alphabets. Based on the new definition for the Extreme 3017
SuperHyperGraph, the new SuperHyperNotion, Extreme SuperHyperEulerian-Type-Path-Neighbor, finds 3018
the convenient background to implement some results based on that. Some SuperHyperClasses 3019
and some Extreme SuperHyperClasses are the cases of this research on the modeling of the regions 3020
where are under the attacks of the cancer to recognize this disease as it’s mentioned on the title 3021
“Cancer’s Recognitions”. To formalize the instances on the SuperHyperNotion, SuperHyperEulerian- 3022
Type-Path-Neighbor, the new SuperHyperClasses and SuperHyperClasses, are introduced. Some general 3023
results are gathered in the section on the SuperHyperEulerian-Type-Path-Neighbor and the Extreme 3024
SuperHyperEulerian-Type-Path-Neighbor. The clarifications, instances and literature reviews have taken 3025
the whole way through. In this research, the literature reviews have fulfilled the lines containing 3026
the notions and the results. The SuperHyperGraph and Extreme SuperHyperGraph are the 3027
SuperHyperModels on the “Cancer’s Recognitions” and both bases are the background of this 3028
research. Sometimes the cancer has been happened on the region, full of cells, groups of cells 3029
and embedded styles. In this segment, the SuperHyperModel proposes some SuperHyperNotions 3030
based on the connectivities of the moves of the cancer in the longest and strongest styles with 3031
the formation of the design and the architecture are formally called “ SuperHyperEulerian-Type-Path- 3032
Neighbor” in the themes of jargons and buzzwords. The prefix “SuperHyper” refers to the theme of 3033
the embedded styles to figure out the background for the SuperHyperNotions. In the Table (37.1), 3034
benefits and avenues for this research are, figured out, pointed out and spoken out. 3035
145
Table 17.1: An Overlook On This Research And Beyond 136TBLTBL
Advantages Limitations
1. Redefining Extreme SuperHyperGraph 1. General Results
2. SuperHyperEulerian-Type-Path-Neighbor
3. Extreme SuperHyperEulerian-Type-Path-Neighbor 2. Other SuperHyperNumbers
4. Modeling of Cancer’s Recognitions
5. SuperHyperClasses 3. SuperHyperFamilies

CHAPTER 18 3036
Extreme SuperHyperDuality But As The 3037
Super Forms 3039
Definition 18.0.1. (Different Extreme Types of Extreme SuperHyperDuality). 3040

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

Va ∈ Ei , Ej ; 3044
(ii) Extreme re-SuperHyperDuality if ∀Ei ∈ E 0 , ∃Ej ∈ EESHG:(V,E) \ E 0 such that 3045
Va ∈ Ei , Ej and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 3046
(iii) Extreme v-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 3047
Vi , Vj ∈ Ea ; 3048
(iv) Extreme rv-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 3049
Vi , Vj ∈ Ea and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; 3050
(v) Extreme SuperHyperDuality if it’s either of Extreme e-SuperHyperDuality, 3051
Extreme re-SuperHyperDuality, Extreme v-SuperHyperDuality, and Extreme rv- 3052

SuperHyperDuality. 3053
Definition 18.0.2. ((Extreme) SuperHyperDuality). 3054

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

SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3059
is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Extreme 3060
cardinality of the Extreme SuperHyperEdges in the conseNeighborive Extreme sequence 3061
of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 3062
Extreme SuperHyperDuality; 3063
147
(ii) a Extreme SuperHyperDuality if it’s either of Extreme e-SuperHyperDuality, Extreme 3064

re-SuperHyperDuality, Extreme v-SuperHyperDuality, and Extreme rv-SuperHyperDuality 3065
and C(N SHG) for a Extreme SuperHyperGraph N SHG : (V, E) is the maximum 3066
Extreme cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S 3067
of high Extreme cardinality conseNeighborive Extreme SuperHyperEdges and Extreme 3068
SuperHyperVertices such that they form the Extreme SuperHyperDuality; 3069
(iii) an Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of Extreme 3070

e-SuperHyperDuality, Extreme re-SuperHyperDuality, Extreme v-SuperHyperDuality, 3071
and Extreme rv-SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph 3072
N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients 3073
defined as the Extreme number of the maximum Extreme cardinality of the Extreme 3074
SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme cardinality conseNeigh- 3075
borive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form 3076
the Extreme SuperHyperDuality; and the Extreme power is corresponded to its Extreme 3077
coefficient; 3078
(iv) a Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of Extreme 3079

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

SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3090
cardinality of the Extreme SuperHyperVertices in the conseNeighborive Extreme sequence 3092
Extreme SuperHyperDuality; 3094
(vi) a Extreme R-SuperHyperDuality if it’s either of Extreme e-SuperHyperDuality, 3095

SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is 3097
the maximum Extreme cardinality of the Extreme SuperHyperVertices of an Extreme Su- 3098
perHyperSet S of high Extreme cardinality conseNeighborive Extreme SuperHyperEdges 3099
and Extreme SuperHyperVertices such that they form the Extreme SuperHyperDuality; 3100
(vii) an Extreme R-SuperHyperDuality SuperHyperPolynomial if it’s either 3101

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

cardinality conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVer- 3107

tices such that they form the Extreme SuperHyperDuality; and the Extreme power is 3108
corresponded to its Extreme coefficient; 3109
(viii) a Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of Extreme 3110

SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality 3115
conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVertices such 3116
that they form the Extreme SuperHyperDuality; and the Extreme power is corresponded 3117
to its Extreme coefficient. 3118
136EXM1 Example 18.0.3. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E) in the 3119
mentioned Extreme Figures in every Extreme items. 3120
• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperDu- 3121
ality, is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are some 3122
empty Extreme SuperHyperEdges but E2 is a loop Extreme SuperHyperEdge and E4 is 3123
an Extreme SuperHyperEdge. Thus in the terms of Extreme SuperHyperNeighbor, there’s 3124
only one Extreme SuperHyperEdge, namely, E4 . The Extreme SuperHyperVertex, V3 is 3125
Extreme isolated means that there’s no Extreme SuperHyperEdge has it as an Extreme 3126
endpoint. Thus the Extreme SuperHyperVertex, V3 , is excluded in every given Extreme 3127
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- 3129
Duality, is up. The Extreme Algorithm is Extremely straightforward. E1 , E2 and E3 3130
are some empty Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. 3131
SuperHyperVertex, V3 , is excluded in every given Extreme SuperHyperDuality. 3135


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

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 3179
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 3182
ViEXT ERN AL in the literatures of SuperHyperDuality. The latter is straightforward. 3183
(31.1), is the SuperHyperDuality. 3186
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 3188
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3

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



ESHS : (V, E), in the Extreme SuperHyperModel (31.3), is the Extreme SuperHyperDuality. 3205
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 3207
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. 3211
Then there’s at least one SuperHyperDuality. Thus the notion of quasi isn’t up and the 3212
SuperHyperNotions based on SuperHyperDuality could be applied. There are only two 3213
SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as the 3214
representative in the 3215
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 : 3216

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

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

is a longest SuperHyperDuality taken from a connected Extreme SuperHyperMultipartite 3228

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

Then there’s at least one SuperHyperDuality. Thus the notion of quasi isn’t up and 3232
the SuperHyperNotions based on SuperHyperDuality could be applied. There are only z 0 3233
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. 3245
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 3247
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 : 3248

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

∃!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 3253
SuperHyperDuality proposes some longest SuperHyperDuality excerpt from some representatives. 3254
Extreme SuperHyperDuality. 3260

CHAPTER 19 3261
Extreme SuperHyperJoin But As The 3262
Super Forms 3264
Definition 19.0.1. (Different Extreme Types of Extreme SuperHyperJoin). 3265

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

Va ∈ Ei , Ej ; and ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; 3269
(ii) Extreme re-SuperHyperJoin if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such that 3270
Va ∈ Ei , Ej ; ∀Ei , Ej ∈ E 0 , such that Va ∈

6 Ei , Ej ; and |Ei |NEUTROSOPIC CARDINALITY = 3271
|Ej |NEUTROSOPIC CARDINALITY ; 3272
(iii) Extreme v-SuperHyperJoin if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such that 3273

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

Vi , Vj ∈ Ea ; ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; and |Vi |NEUTROSOPIC CARDINALITY = 3276
|Vj |NEUTROSOPIC CARDINALITY ; 3277
(v) Extreme SuperHyperJoin if it’s either of Extreme e-SuperHyperJoin, Extreme re- 3278
SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme rv-SuperHyperJoin. 3279
Definition 19.0.2. ((Extreme) SuperHyperJoin). 3280

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

re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme rv-SuperHyperJoin and 3284
C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme 3285
cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme 3286
and Extreme SuperHyperVertices such that they form the Extreme SuperHyperJoin; 3288
161
(ii) a Extreme SuperHyperJoin if it’s either of Extreme e-SuperHyperJoin, Extreme 3289

C(N SHG) for a Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme 3291
cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of 3292
high Extreme cardinality conseNeighborive Extreme SuperHyperEdges and Extreme 3293
SuperHyperVertices such that they form the Extreme SuperHyperJoin; 3294
(iii) an Extreme SuperHyperJoin SuperHyperPolynomial if it’s either of Extreme e- 3295

SuperHyperJoin, Extreme re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme 3296
rv-SuperHyperJoin and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3297
is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined as the 3298
Extreme number of the maximum Extreme cardinality of the Extreme SuperHyperEdges 3299
of an Extreme SuperHyperSet S of high Extreme cardinality conseNeighborive Extreme 3300
SuperHyperEdges and Extreme SuperHyperVertices such that they form the Extreme 3301
SuperHyperJoin; and the Extreme power is corresponded to its Extreme coefficient; 3302
(iv) a Extreme SuperHyperJoin SuperHyperPolynomial if it’s either of Extreme e- 3303

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

cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of the 3314

Extreme SuperHyperVertices in the conseNeighborive Extreme sequence of Extreme 3315
SuperHyperJoin; 3317
(vi) a Extreme R-SuperHyperJoin if it’s either of Extreme e-SuperHyperJoin, Extreme 3318

cardinality of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of 3321
high Extreme cardinality conseNeighborive Extreme SuperHyperEdges and Extreme 3322
SuperHyperVertices such that they form the Extreme SuperHyperJoin; 3323
(vii) an Extreme R-SuperHyperJoin SuperHyperPolynomial if it’s either of Extreme 3324
e-SuperHyperJoin, Extreme re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme 3325

Extreme number of the maximum Extreme cardinality of the Extreme SuperHyperVertices 3328

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

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

SuperHyperJoin. 3349
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 3351
Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. Thus in the terms of 3352
Extreme SuperHyperNeighbor, there’s only one Extreme SuperHyperEdge, namely, E4 . 3353
The Extreme SuperHyperVertex, V3 is Extreme isolated means that there’s no Extreme 3354
SuperHyperEdge has it as an Extreme endpoint. Thus the Extreme SuperHyperVertex, 3355
V3 , is excluded in every given Extreme SuperHyperJoin. 3356

is up. The Extreme Algorithm is Extremely straightforward. 3358


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

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

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


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

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



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

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

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


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

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

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

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

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

CHAPTER 20 3479
Extreme SuperHyperPerfect But As The 3480
Super Forms 3482
Definition 20.0.1. (Different Extreme Types of Extreme SuperHyperPerfect). 3483

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

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

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

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

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

re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, and Extreme rv-SuperHyperPerfect. 3495
Definition 20.0.2. ((Extreme) SuperHyperPerfect). 3496

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

Extreme re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, and Extreme rv- 3500
SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3501
Extreme SuperHyperPerfect; 3505
175
(ii) a Extreme SuperHyperPerfect if it’s either of Extreme e-SuperHyperPerfect, Extreme 3506

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

e-SuperHyperPerfect, Extreme re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, 3513
and Extreme rv-SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph 3514
the Extreme SuperHyperPerfect; and the Extreme power is corresponded to its Extreme 3519
coefficient; 3520
(iv) a Extreme SuperHyperPerfect SuperHyperPolynomial if it’s either of Extreme 3521

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

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

SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is 3539
the maximum Extreme cardinality of the Extreme SuperHyperVertices of an Extreme Su- 3540
and Extreme SuperHyperVertices such that they form the Extreme SuperHyperPerfect; 3542
(vii) an Extreme R-SuperHyperPerfect SuperHyperPolynomial if it’s either 3543

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


tices such that they form the Extreme SuperHyperPerfect; and the Extreme power is 3550
(viii) a Extreme SuperHyperPerfect SuperHyperPolynomial if it’s either of Extreme 3552

SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality 3557
conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVertices such 3558
that they form the Extreme SuperHyperPerfect; and the Extreme power is corresponded 3559
to its Extreme coefficient. 3560
• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperPer- 3563
fect, is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are some 3564
SuperHyperPerfect. 3570
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 3572
are some empty Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. 3573
SuperHyperVertex, V3 , is excluded in every given Extreme SuperHyperPerfect. 3577


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

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

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

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

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



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

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

Then 3668

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



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

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

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


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

CHAPTER 21 3703
Extreme SuperHyperTotal But As The 3704
Super Forms 3706
Definition 21.0.1. (Different Extreme Types of Extreme SuperHyperTotal). 3707
(i) Extreme e-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that Va ∈ Ei , Ej ; 3710
(ii) Extreme re-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that Va ∈ 3711

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

(v) Extreme SuperHyperTotal if it’s either of Extreme e-SuperHyperTotal, Extreme 3716

re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Extreme rv-SuperHyperTotal. 3717
Definition 21.0.2. ((Extreme) SuperHyperTotal). 3718

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

re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Extreme rv-SuperHyperTotal and 3722
and Extreme SuperHyperVertices such that they form the Extreme SuperHyperTotal; 3726
(ii) a Extreme SuperHyperTotal if it’s either of Extreme e-SuperHyperTotal, Extreme 3727

re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Extreme rv-SuperHyperTotal 3728
189

SuperHyperVertices such that they form the Extreme SuperHyperTotal; 3732
(iii) an Extreme SuperHyperTotal SuperHyperPolynomial if it’s either of Extreme 3733

e-SuperHyperTotal, Extreme re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Ex- 3734
treme rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph N SHG : 3735
(V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined 3736
as the Extreme number of the maximum Extreme cardinality of the Extreme SuperHy- 3737
perEdges of an Extreme SuperHyperSet S of high Extreme cardinality conseNeighborive 3738
Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 3739
Extreme SuperHyperTotal; and the Extreme power is corresponded to its Extreme coeffi- 3740
cient; 3741
(iv) a Extreme SuperHyperTotal SuperHyperPolynomial if it’s either of Extreme e- 3742

SuperHyperTotal, Extreme re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Ex- 3743
(V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined 3745
as the Extreme number of the maximum Extreme cardinality of the Extreme SuperHy- 3746
perEdges of an Extreme SuperHyperSet S of high Extreme cardinality conseNeighborive 3747

cient; 3750
(v) an Extreme R-SuperHyperTotal if it’s either of Extreme e-SuperHyperTotal, Extreme 3751

and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum 3753
Extreme cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of 3754
the Extreme SuperHyperVertices in the conseNeighborive Extreme sequence of Extreme 3755
SuperHyperTotal; 3757
(vi) a Extreme R-SuperHyperTotal if it’s either of Extreme e-SuperHyperTotal, Extreme 3758

and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum 3760
Extreme cardinality of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S 3761
SuperHyperVertices such that they form the Extreme SuperHyperTotal; 3763
(vii) an Extreme R-SuperHyperTotal SuperHyperPolynomial if it’s either of Ex- 3764

treme e-SuperHyperTotal, Extreme re-SuperHyperTotal, Extreme v-SuperHyperTotal, 3765
and Extreme rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph 3766
SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality con- 3769
seNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that 3770
they form the Extreme SuperHyperTotal; and the Extreme power is corresponded to its 3771
Extreme coefficient; 3772

(viii) a Extreme SuperHyperTotal SuperHyperPolynomial if it’s either of Extreme e- 3773

SuperHyperTotal, Extreme re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Ex- 3774
(V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined as 3776
the Extreme number of the maximum Extreme cardinality of the Extreme SuperHyper- 3777
Vertices of an Extreme SuperHyperSet S of high Extreme cardinality conseNeighborive 3778
cient. 3781
• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperTotal, 3784
is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are some empty 3785
Extreme SuperHyperEdges but E2 is a loop Extreme SuperHyperEdge and E4 is an 3786
Extreme SuperHyperEdge. Thus in the terms of Extreme SuperHyperNeighbor, there’s 3787
SuperHyperTotal. 3791
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 3793
Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. Thus in the terms of 3794
Extreme SuperHyperNeighbor, there’s only one Extreme SuperHyperEdge, namely, E4 . 3795
The Extreme SuperHyperVertex, V3 is Extreme isolated means that there’s no Extreme 3796
SuperHyperEdge has it as an Extreme endpoint. Thus the Extreme SuperHyperVertex, 3797

V3 , is excluded in every given Extreme SuperHyperTotal. 3798



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

ViEXT ERN AL in the literatures of SuperHyperTotal. The latter is straightforward. 3846
(31.1), is the SuperHyperTotal. 3849
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 3851
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. 3858
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 3860
P : ViEXT ERN AL , Ei , CEN T ER, Ej .

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

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

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

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

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



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

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



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

CHAPTER 22 3922
Extreme SuperHyperConnected But As 3923
The Extensions Excerpt From Dense And 3924
Super Forms 3925
Definition 22.0.1. (Different Extreme Types of Extreme SuperHyperConnected). 3926

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

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

(iii) Extreme v-SuperHyperConnected if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such that 3934

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

(v) Extreme SuperHyperConnected if it’s either of Extreme e-SuperHyperConnected, 3939

Extreme re-SuperHyperConnected, Extreme v-SuperHyperConnected, and Extreme rv- 3940
SuperHyperConnected. 3941
Definition 22.0.2. ((Extreme) SuperHyperConnected). 3942
(i) an Extreme SuperHyperConnected if it’s either of Extreme e-SuperHyperConnected, 3945

SuperHyperConnected and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3947
203
Extreme SuperHyperConnected; 3951
(ii) a Extreme SuperHyperConnected if it’s either of Extreme e-SuperHyperConnected, 3952

SuperHyperConnected and C(N SHG) for a Extreme SuperHyperGraph N SHG : (V, E) 3954
is the maximum Extreme cardinality of the Extreme SuperHyperEdges of an Extreme 3955
SuperHyperSet S of high Extreme cardinality conseNeighborive Extreme SuperHyperEdges 3956
and Extreme SuperHyperVertices such that they form the Extreme SuperHyperConnected; 3957
(iii) an Extreme SuperHyperConnected SuperHyperPolynomial if it’s either of 3958

Extreme e-SuperHyperConnected, Extreme re-SuperHyperConnected, Extreme v- 3959
SuperHyperConnected, and Extreme rv-SuperHyperConnected and C(N SHG) for an 3960
Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial con- 3961
tains the Extreme coefficients defined as the Extreme number of the maximum Extreme 3962
cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high 3963
Extreme cardinality conseNeighborive Extreme SuperHyperEdges and Extreme SuperHy- 3964
perVertices such that they form the Extreme SuperHyperConnected; and the Extreme 3965
(iv) a Extreme SuperHyperConnected SuperHyperPolynomial if it’s either of 3967


cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high 3972
(v) an Extreme R-SuperHyperConnected if it’s either of Extreme e-SuperHyperConnected,3976

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

is the maximum Extreme cardinality of the Extreme SuperHyperVertices of an Extreme Su- 3986
and Extreme SuperHyperVertices such that they form the Extreme SuperHyperConnected; 3988
(vii) an Extreme R-SuperHyperConnected SuperHyperPolynomial if it’s either 3989

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

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

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

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

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

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


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

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

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 4067
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. 4071
(31.1), is the SuperHyperConnected. 4074
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 4076
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. 4083
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 4085



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

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

is a longest SuperHyperConnected taken from a connected Extreme SuperHyperBipartite 4104

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


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

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

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


to ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is straightforward. 4139
Then there’s at least one SuperHyperConnected. Thus the notion of quasi isn’t up and 4140
the SuperHyperNotions based on SuperHyperConnected could be applied. The unique 4141
embedded SuperHyperConnected proposes some longest SuperHyperConnected excerpt from 4142
some representatives. The latter is straightforward. 4143
Extreme SuperHyperConnected. 4148

CHAPTER 23 4149
Background 4150
forms without using neutrosophic classes of neutrosophic SuperHyperGraph. It’s published 4157
in prestigious and fancy journal is entitled “Journal of Current Trends in Computer Science 4158
Research (JCTCSR)” with ISO abbreviation “J Curr Trends Comp Sci Res” in volume 1 4159
and issue 1 with pages 06-14. The research article studies deeply with choosing neutrosophic 4160
hypergraphs instead of neutrosophic SuperHyperGraph. It’s the breakthrough toward independent 4161
results based on initial background. 4162
The seminal paper and groundbreaking article is titled “Super Hyper Dominating and Super 4163
Hyper Resolving on Neutrosophic Super Hyper Graphs and Their Directions in Game Theory and 4164
The research article studies deeply with choosing directly neutrosophic SuperHyperGraph and 4171
SuperHyperGraph. It’s the breakthrough toward independent results based on initial background 4172
and fundamental SuperHyperNumbers. 4173
The seminal paper and groundbreaking article is titled “Some Super Hyper Degrees and Co-Super 4174
Hyper Degrees on Neutrosophic Super Hyper Graphs And Super Hyper Graphs Alongside 4175
Applications in Cancer’s Treatments” in Ref. [HG3] by Henry Garrett (2023). In this research 4176
article, a novel approach is implemented on SuperHyperGraph and neutrosophic SuperHy- 4177

perGraph based on fundamental notions and using vital tools in Cancer’s Treatments. It’s 4178
published in prestigious and fancy journal is entitled “Journal of Mathematical Techniques and 4179
Computational Mathematics(JMTCM)” with ISO abbreviation “J Math Techniques Comput 4180
Math” in volume 2 and issue 1 with pages 35-47. The research article studies deeply with 4181
217


Henry Garrett (2022), “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well- Supe- 4211
rHyperModelled (Neutrosophic) SuperHyperGraphs ” in Ref. [HG16] by Henry Garrett (2022), 4212
“Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic SuperHyperStable To Act on 4213
Cancer’s Neutrosophic Recognitions In Special ViewPoints” in Ref. [HG12] by Henry Garrett 4214
(2022), “Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic) SuperHyper- 4215
Modeling in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs” in Ref. [HG17] by 4216
Henry Garrett (2022), “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic 4217
SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints” in Ref. 4218
[HG18] by Henry Garrett (2022),“(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions 4219

Featuring (Neutrosophic) SuperHyperDefensive SuperHyperAlliances” in Ref. [HG19] by Henry 4220
Garrett (2022), “(Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and Super- 4221
HyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With (Neutrosophic) 4222
SuperHyperModeling of Cancer’s Recognitions And Related (Neutrosophic) SuperHyperClasses” 4223
in Ref. [HG20] by Henry Garrett (2022), “SuperHyperGirth on SuperHyperGraph and Neutro- 4224
sophic SuperHyperGraph With SuperHyperModeling of Cancer’s Recognitions” in Ref. [HG21] 4225

by Henry Garrett (2022), “Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic 4226
SuperHyperGraphs and SuperHyperGraphs Alongside Applications in Cancer’s Treatments” in 4227
Ref. [HG22] by Henry Garrett (2022), “SuperHyperDominating and SuperHyperResolving 4228
on Neutrosophic SuperHyperGraphs And Their Directions in Game Theory and Neutrosophic 4229

SuperHyperClasses” in Ref. [HG23] by Henry Garrett (2022), “SuperHyperMatching By 4230

(R-)Definitions And Polynomials To Monitor Cancer’s Recognition In Neutrosophic Supe- 4231
rHyperGraphs” in Ref. [HG24] by Henry Garrett (2023), “The Focus on The Partitions 4232
Obtained By Parallel Moves In The Cancer’s Extreme Recognition With Different Types of 4233
Extreme SuperHyperMatching Set and Polynomial on (Neutrosophic) SuperHyperGraphs” in 4234
Ref. [HG25] by Henry Garrett (2023), “Extreme Failed SuperHyperClique Decides the Failures 4235
on the Cancer’s Recognition in the Perfect Connections of Cancer’s Attacks By SuperHyper- 4236
Models Named (Neutrosophic) SuperHyperGraphs” in Ref. [HG26] by Henry Garrett (2023), 4237
“Indeterminacy On The All Possible Connections of Cells In Front of Cancer’s Attacks In The 4238
Terms of Neutrosophic Failed SuperHyperClique on Cancer’s Recognition called Neutrosophic 4239
SuperHyperGraphs” in Ref. [HG27] by Henry Garrett (2023), “Perfect Directions Toward 4240
Idealism in Cancer’s Neutrosophic Recognition Forwarding Neutrosophic SuperHyperClique on 4241
Neutrosophic SuperHyperGraphs” in Ref. [HG28] by Henry Garrett (2023), “Demonstrating 4242

Complete Connections in Every Embedded Regions and Sub-Regions in the Terms of Cancer’s 4243
Recognition and (Neutrosophic) SuperHyperGraphs With (Neutrosophic) SuperHyperClique” in 4244
Ref. [HG29] by Henry Garrett (2023), “Different Neutrosophic Types of Neutrosophic Regions 4245
titled neutrosophic Failed SuperHyperStable in Cancer’s Neutrosophic Recognition modeled in the 4246
Form of Neutrosophic SuperHyperGraphs” in Ref. [HG30] by Henry Garrett (2023), “Using 4247
the Tool As (Neutrosophic) Failed SuperHyperStable To SuperHyperModel Cancer’s Recognition 4248

Titled (Neutrosophic) SuperHyperGraphs” in Ref. [HG31] by Henry Garrett (2023), “Neut- 4249
rosophic Messy-Style SuperHyperGraphs To Form Neutrosophic SuperHyperStable To Act on 4250
(2023), “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well-SuperHyperModelled 4252
1-Failed SuperHyperForcing in the SuperHyperFunction To Use Neutrosophic SuperHyperGraphs 4254

on Cancer’s Neutrosophic Recognition And Beyond” in Ref. [HG34] by Henry Garrett (2022), 4255
“(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Recognitions And (Neutrosophic) Supe- 4256
rHyperGraphs” in Ref. [HG35] by Henry Garrett (2022), “Basic Notions on (Neutrosophic) 4257
SuperHyperForcing And (Neutrosophic) SuperHyperModeling in Cancer’s Recognitions And 4258
(Neutrosophic) SuperHyperGraphs” in Ref. [HG36] by Henry Garrett (2022), “Basic Neutro- 4259
sophic Notions Concerning SuperHyperDominating and Neutrosophic SuperHyperResolving in 4260

SuperHyperGraph” in Ref. [HG37] by Henry Garrett (2022), “Initial Material of Neutrosophic 4261
Preliminaries to Study Some Neutrosophic Notions Based on Neutrosophic SuperHyperEdge 4262
(NSHE) in Neutrosophic SuperHyperGraph (NSHG)” in Ref. [HG38] by Henry Garrett 4263
(2022), and [HG4; HG5; HG6; HG7; HG8; HG9; HG10; HG11; HG12; HG13; HG14; 4264

HG246; HG247; HG248; HG249; HG250; HG251], there are some endeavors to formalize 4281
the basic SuperHyperNotions about neutrosophic SuperHyperGraph and SuperHyperGraph along- 4282
side scientific research books at [HG60b; HG61b; HG62b; HG63b; HG64b; HG65b; 4283


HG158b; HG159b; HG160b; HG161b; HG162b; HG163b; HG164b]. Two popu- 4295
lar scientific research books in Scribd in the terms of high readers, 4190 and 5189 respectively, 4296
on neutrosophic science is on [HG32b; HG44b]. 4297
Some scientific studies and scientific researches about neutrosophic graphs, are proposed as book 4298
in Ref. [HG71b] by Henry Garrett (2023) which is indexed by Google Scholar and has more 4299
than 4331 readers in Scribd. It’s titled “Beyond Neutrosophic Graphs” and published by Dr. 4300
Henry Garrett. This research book covers different types of notions and settings in neutrosophic 4301
SuperHyperGraph theory. This research book has scrutiny on the complement of the intended set 4308
and the intended set, simultaneously. It’s smart to consider a set but acting on its complement 4309
that what’s done in this research book which is popular in the terms of high readers in Scribd. 4310
See the seminal scientific researches [HG1; HG2; HG3]. The formalization of the notions on 4311
the framework of notions in SuperHyperGraphs, Neutrosophic notions in SuperHyperGraphs the- 4312
ory, and (Neutrosophic) SuperHyperGraphs theory at [HG4; HG5; HG6; HG7; HG8; HG9; 4313

HG251] alongside scientific research books at [HG60b; HG61b; HG62b; HG63b; HG64b; 4331

HG157b; HG158b; HG159b; HG160b; HG161b; HG162b; HG163b; HG164b]. 4343
Two popular scientific research books in Scribd in the terms of high readers, 4331 and 5327 4344
respectively, on neutrosophic science is on [HG32b; HG44b]. 4345

Bibliography 4346
10.33140/JMTCM.01.03.09) 4353
HG5 [6] Garrett, Henry. “0049 | (Failed)1-Zero-Forcing Number in Neutrosophic Graphs.” CERN 4371
European Organization for Nuclear Research - Zenodo, Feb. 2022. CERN European 4372
Organization for Nuclear Research, https://doi.org/10.13140/rg.2.2.35241.26724. ht- 4373
tps://oa.mg/work/10.13140/rg.2.2.35241.26724 4374
223
10.20944/preprints202301.0282.v1). 4381
10.20944/preprints202301.0267.v1). 4384
Theory Based on SuperHyperGraph and Neutrosophic SuperHyperGraph”, Preprints 2023, 4388

2023010265 (doi: 10.20944/preprints202301.0265.v1). 4389
prints202301.0262.v1). 4393
2023010224, (doi: 10.20944/preprints202301.0224.v1). 4399
prints202301.0105.v1). 4402
Preprints 2023, 2023010044 4408
(doi: 10.20944/preprints202301.0043.v1). 4411

(doi: 10.20944/preprints202212.0549.v1). 4420
HG20 [21] Henry Garrett, “(Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and Su- 4421
perHyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With (Neut- 4422
rosophic) SuperHyperModeling of Cancer’s Recognitions And Related (Neutrosophic) Su- 4423
perHyperClasses”, Preprints 2022, 2022120540 (doi: 10.20944/preprints202212.0540.v1). 4424
(doi: 10.20944/preprints202212.0500.v1). 4427
(doi: 10.5281/zenodo.7851519). 4436
HG250 [26] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Type-Path- 4437
(doi: 10.5281/zenodo.7851550). 4439

Type-Path-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 4444
10.5281/zenodo.7834229). 4448
10.5281/zenodo.7834261). 4451

10.5281/zenodo.7824560). 4454
(doi: 10.5281/zenodo.7824623). 4457
2023, (doi: 10.5281/zenodo.7809365). 4468

2023, (doi: 10.5281/zenodo.7809358). 4471
10.5281/zenodo.7809219). 4474
HG237 [39] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyper- 4475
Graph By Eulerian-Path-Cut As Hyper Eulogy On Super EULA”, Zenodo 2023, (doi: 4476
10.5281/zenodo.7809328). 4477
2023, (doi: 10.5281/zenodo.7806767). 4480
2023, (doi: 10.5281/zenodo.7806838). 4483
By Hamiltonian-Type-Cycle-Decomposition As Hyper Decompress On Super Decompensa- 4485
tion”, Zenodo 2023, (doi: 10.5281/zenodo.7804238). 4486

(doi: 10.5281/zenodo.7799902). 4492
2023, (doi: 10.5281/zenodo.7804218). 4495
(doi: 10.5281/zenodo.7796334). 4498
10.5281/zenodo.7791952). 4504
Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 4506
10.5281/zenodo.7791982). 4507
10.5281/zenodo.7790026). 4510
HG223 [51] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Hamiltonian-Neighbor 4511
10.5281/zenodo.7790052). 4513
2023, (doi: 10.5281/zenodo.7787066). 4516
Hamiltonian-Decomposition In Recognition of Cancer With (Neutrosophic) SuperHy- 4518
perGraph”, Zenodo 2023, (doi: 10.5281/zenodo.7787094). 4519
10.5281/zenodo.7781476). 4522
10.5281/zenodo.7783082). 4525
Graph By Trace-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 4527
10.5281/zenodo.7777857). 4528

10.5281/zenodo.7779286). 4531
(doi: 10.5281/zenodo.7771831). 4534
2023, (doi: 10.5281/zenodo.7772468). 4537
10.13140/RG.2.2.20913.25446). 4540
HG212 [61] Henry Garrett, “New Ideas On Super Tract By Hyper Track Of Trace-Cut In Cancer’s 4541
Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zen- 4542
odo.7764916). 4543
10.13140/RG.2.2.11770.98247). 4546
10.13140/RG.2.2.12400.12808). 4549
2023, (doi: 10.13140/RG.2.2.22545.10089). 4552
10.13140/RG.2.2.11377.76644). 4558
10.13140/RG.2.2.23750.96329). 4561
10.13140/RG.2.2.31366.24641). 4564
10.13140/RG.2.2.34721.68960). 4567

By Vertex-Decomposition As Hyper Decompress On Super Decompensation”, ResearchGate 4569
2023, (doi: 10.13140/RG.2.2.30212.81289). 4570
10.13140/RG.2.2.24288.35842). 4576
10.13140/RG.2.2.32467.25124). 4579
10.13140/RG.2.2.31025.45925). 4582
10.13140/RG.2.2.17184.25602). 4585
10.13140/RG.2.2.23423.28327). 4588
10.13140/RG.2.2.28456.44805). 4591
10.13140/RG.2.2.23525.68320). 4594
HG194 [79] Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Cut In Can- 4595
10.13140/RG.2.2.20170.24000). 4597
10.13140/RG.2.2.36475.59683). 4600
10.13140/RG.2.2.29764.71046). 4603
2023, (doi: 10.13140/RG.2.2.18780.87683). 4606

10.13140/RG.2.2.26134.01603). 4612
HG188 [85] Henry Garrett, “New Ideas On Super Cliff By Hyper Cling Of Clique-Cut In Can- 4613
10.13140/RG.2.2.27392.30721). 4615
10.13140/RG.2.2.33028.40321). 4618
10.13140/RG.2.2.21389.20966). 4621
10.13140/RG.2.2.16356.04489). 4624
10.13140/RG.2.2.21756.21129). 4627
HG183 [90] Henry Garrett, “New Ideas On Super Solidarity By Hyper Soul Of Space In 4628
Cancer’s Recognition With (Extreme) SuperHyperGraph”, ResearchGate 2023, (doi: 4629
10.13140/RG.2.2.30983.68009). 4630
10.13140/RG.2.2.28552.29445). 4633
Connectivity In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchG- 4635
ate 2023, (doi: 10.13140/RG.2.2.10936.21761). 4636
10.13140/RG.2.2.35105.89447). 4639
(doi: 10.13140/RG.2.2.30072.72960). 4642
10.13140/RG.2.2.31147.52003). 4645

10.13140/RG.2.2.32825.24163). 4648
10.13140/RG.2.2.13059.58401). 4651
10.13140/RG.2.2.11172.14720). 4654
2023, (doi: 10.13140/RG.2.2.22011.80165). 4657
ate 2023, (doi: 10.13140/RG.2.2.30819.84003). 4660
By SuperHyperEdge-Domination As Hyper Reversion On Super Indirection”, ResearchGate 4662
2023, (doi: 10.13140/RG.2.2.10493.84962). 4663
ate 2023, (doi: 10.13140/RG.2.2.13849.29280). 4666
2023, (doi: 10.13140/RG.2.2.19944.14086). 4669
ate 2023, (doi: 10.13140/RG.2.2.23299.58404). 4672
(doi: 10.13140/RG.2.2.33103.76968). 4675
HG167 [106] Henry Garrett, “New Ideas On Super Gradient By Hyper k-Class Of SuperHyperK-Number 4676
(doi: 10.13140/RG.2.2.23037.44003). 4678
(doi: 10.13140/RG.2.2.35646.56641). 4681
(doi: 10.13140/RG.2.2.18030.48967). 4684

(doi: 10.13140/RG.2.2.13973.81121). 4687
2023, (doi: 10.13140/RG.2.2.34106.47047). 4690
2023, (doi: 10.13140/RG.2.2.31956.88961). 4696
2023, (doi: 10.13140/RG.2.2.15179.67361). 4699
10.13140/RG.2.2.21510.45125). 4702
HG158 [115] Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDom- 4703
inating In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 4704
2023, (doi: 10.13140/RG.2.2.13121.84321). 4705
10.13140/RG.2.2.11758.69441). 4708
2023, (doi: 10.13140/RG.2.2.31891.35367). 4711
10.13140/RG.2.2.19360.87048). 4714
HG154 [119] Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal 4715
10.13140/RG.2.2.32363.21286). 4717
10.13140/RG.2.2.23266.81602). 4720
10.13140/RG.2.2.19911.37285). 4723

10.13140/RG.2.2.11050.90569). 4726
HG150 [123] Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of SuperHy- 4727
perJoin In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 4728
2023, (doi: 10.13140/RG.2.2.17761.79206). 4729
HG149 [124] Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of Super- 4730
HyperDuality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 4731
By SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchG- 4734
ate 2023, (doi: 10.13140/RG.2.2.33275.80161). 4735
(doi: 10.13140/RG.2.2.30182.50241). 4738


2023, (doi: 10.13140/RG.2.2.17252.24968). 4771
(Neutrosophic) SuperHyperGraphs Toward Cancer’s extreme Recognition”, Preprints 2023, 4779

2023010396 (doi: 10.20944/preprints202301.0396.v1). 4780
2023, 2023010395 (doi: 10.20944/preprints202301.0395.v1). 4783
Recognition in The Confrontation With Super Attacks In Hyper Situations By Implement- 4785
ing (Neutrosophic) 1-Failed SuperHyperForcing in The Technical Approaches to Neutralize 4786
SuperHyperViews”, ResearchGate 2023, (doi: 10.13140/RG.2.2.26240.51204). 4787

HG128 [144] Henry Garrett,“Super Actions On The Types of Hyper Levels In The Sensible Neutrosophic 4792
SuperHyperGirth On Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyper- 4793
Graph”, ResearchGate 2023,(doi: 10.13140/RG.2.2.26836.88960). 4794

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

10.20944/preprints202301.0282.v1). 4804
10.20944/preprints202301.0267.v1).). 4807
2023010265 (doi: 10.20944/preprints202301.0265.v1). 4812
prints202301.0262.v1). 4816
2023010224, (doi: 10.20944/preprints202301.0224.v1). 4822

10.13140/RG.2.2.35061.65767). 4825
10.13140/RG.2.2.18494.15680). 4829
10.13140/RG.2.2.32530.73922). 4833
of Cancer’s Attacks In The Terms of Neutrosophic Failed SuperHyperClique on 4835
Cancer’s Recognition called Neutrosophic SuperHyperGraphs”, ResearchGate 2023, (doi: 4836
10.13140/RG.2.2.15897.70243). 4837
10.13140/RG.2.2.32530.73922). 4841

prints202301.0105.v1). 4844

10.13140/RG.2.2.23172.19849). 4851
10.13140/RG.2.2.17385.36968). 4861

Preprints 2023, 2023010044 4864
(doi: 10.20944/preprints202301.0043.v1). 4867
2023, (doi: 10.13140/RG.2.2.28945.92007). 4870

10.13140/RG.2.2.35774.77123). 4876

10.13140/RG.2.2.29430.88642). 4882

(doi: 10.20944/preprints202212.0549.v1). 4888
10.13140/RG.2.2.19380.94084). 4891

(doi: 10.20944/preprints202212.0500.v1). 4902
10.13140/RG.2.2.20993.12640). 4905
HG952 [178] Henry Garrett,“Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic 4906

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

10.13140/RG.2.2.29173.86244). 4920
HG38 [183] Henry Garrett, “Initial Material of Neutrosophic Preliminaries to Study Some Neutro- 4921
sophic Notions Based on Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic Super- 4922

HyperGraph (NSHG)”, ResearchGate 2022 (doi: 10.13140/RG.2.2.25385.88160). 4923
2023 (doi: 10.5281/zenodo.7851893). 4925

(doi: 10.5281/zenodo.7835063). 4929
(doi: 10.5281/zenodo.7826705). 4931
2023 (doi: 10.5281/zenodo.7820680). 4933
10.5281/zenodo.7812750). 4935


2023 (doi: 10.5281/zenodo.7807782). 4941
2023 (doi: 10.5281/zenodo.7804449). 4943

(doi: 10.5281/zenodo.7792307). 4947
(doi: 10.5281/zenodo.7790728). 4949
2023 (doi: 10.5281/zenodo.7787712). 4951
10.5281/zenodo.7783791). 4953

10.5281/zenodo.7780123). 4955
(doi: 10.5281/zenodo.7773119). 4957
odo.7637762). 4959
10.5281/zenodo.7766174). 4961
10.5281/zenodo.7762232). 4963
(doi: 10.5281/zenodo.7758601). 4965
10.5281/zenodo.7754661). 4967
10.5281/zenodo.7750995) . 4969
(doi: 10.5281/zenodo.7749875). 4971
10.5281/zenodo.7747236). 4973
10.5281/zenodo.7742587). 4975
(doi: 10.5281/zenodo.7738635). 4977
10.5281/zenodo.7734719). 4979
10.5281/zenodo.7730484). 4981
(doi: 10.5281/zenodo.7730469). 4983
10.5281/zenodo.7722865). 4985
odo.7713563). 4987
odo.7709116). 4989

10.5281/zenodo.7706415). 4991
(doi: 10.5281/zenodo.7706063). 4993
(doi: 10.5281/zenodo.7701906). 4995
odo.7700205). 4997
10.5281/zenodo.7694876). 4999
10.5281/zenodo.7679410). 5001
10.5281/zenodo.7675982). 5003
10.5281/zenodo.7672388). 5005
odo.7668648). 5007
10.5281/zenodo.7662810). 5009
10.5281/zenodo.7659162). 5011
HG120b [228] Henry Garrett, “Cancer In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 5012
10.5281/zenodo.7653233). 5013
odo.7653204). 5015
odo.7653142). 5017
odo.7653117). 5019
odo.7653089). 5021
odo.7651687). 5023
odo.7651619). 5025

odo.7651439). 5027
odo.7650729). 5029
odo.7647868). 5031
odo.7647017). 5033
odo.7644894). 5035
odo.7641880). 5037
odo.7632923). 5039
odo.7623459). 5041
10.5281/zenodo.7606416). 5043
10.5281/zenodo.7606416). 5045
odo.7606404). 5047
10.5281/zenodo.7580018). 5049
odo.7580018). 5051
odo.7580018). 5053
odo.7579929). 5055
10.5281/zenodo.7563170). 5057
odo.7563164). 5059
odo.7563160). 5061

odo.7563160). 5063
10.5281/zenodo.7563160). 5065
10.5281/zenodo.7557063). 5067
10.5281/zenodo.7557009). 5069
10.5281/zenodo.7539484). 5071
10.5281/zenodo.7523390). 5073
10.5281/zenodo.7523390). 5075
10.5281/zenodo.7523390). 5077
odo.7574952). 5079
10.5281/zenodo.7574992). 5081
odo.7523357). 5083
10.5281/zenodo.7523357). 5085
10.5281/zenodo.7504782). 5087
10.5281/zenodo.7504782). 5089
10.5281/zenodo.7504782). 5091
10.5281/zenodo.7499395). 5093
odo.7499395). 5095
10.5281/zenodo.7499395). 5097

10.5281/zenodo.7497450). 5099
10.5281/zenodo.7497450). 5101
10.5281/zenodo.7494862). 5103
odo.7494862). 5105
10.5281/zenodo.7494862). 5107
10.5281/zenodo.7493845). 5109
10.5281/zenodo.7493845). 5111
10.5281/zenodo.7493845). 5113
odo.7539484). 5115
odo.7523390). 5117
odo.7523357). 5119
odo.7504782). 5121
odo.7499395). 5123
odo.7497450). 5125
odo.7494862). 5127
odo.7493845). 5129
odo.7480110). 5131
odo.7378758). 5133

HG32b [289] Henry Garrett, “Beyond Neutrosophic Graphs”. Dr. Henry Garrett, 2023 (doi: 5134
10.5281/zenodo.6320305). 5135
odo.6677173). 5137

CHAPTER 24 5138
Cancer In Neutrosophic 5139
SuperHyperGraph 5140
The cancer is the Neutrosophic disease but the Neutrosophic model is going to figure out what’s 5141
going on this Neutrosophic phenomenon. The special Neutrosophic case of this Neutrosophic 5142
disease is considered and as the consequences of the model, some parameters are used. The 5143
cells are under attack of this disease but the moves of the cancer in the special region are the 5144
matter of mind. The Neutrosophic recognition of the cancer could help to find some Neutrosophic 5145
treatments for this Neutrosophic disease. 5146
In the following, some Neutrosophic steps are Neutrosophic devised on this disease. 5147
Step 1. (Neutrosophic Definition) The Neutrosophic recognition of the cancer in the long-term 5148
Neutrosophic function. 5149
Step 2. (Neutrosophic Issue) The specific region has been assigned by the Neutrosophic model 5150
[it’s called Neutrosophic SuperHyperGraph] and the long Neutrosophic cycle of the move 5151
from the cancer is identified by this research. Sometimes the move of the cancer hasn’t be 5152
easily identified since there are some determinacy, indeterminacy and neutrality about the 5153
moves and the effects of the cancer on that region; this event leads us to choose another 5154
model [it’s said to be Neutrosophic SuperHyperGraph] to have convenient perception on 5155
what’s happened and what’s done. 5156
Step 3. (Neutrosophic Model) There are some specific Neutrosophic models, which are well- 5157
known and they’ve got the names, and some general Neutrosophic models. The moves and 5158
the Neutrosophic traces of the cancer on the complex tracks and between complicated groups 5159
of cells could be fantasized by a Neutrosophic SuperHyperPath(-/SuperHyperK-Domination, 5160
SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The 5161
aim is to find either the Neutrosophic SuperHyperK-Domination or the Neutrosophic 5162
SuperHyperK-Domination in those Neutrosophic Neutrosophic SuperHyperModels. 5163
Some cells have been faced with some attacks from the situation which is caused by the 5164
cancer’s attacks. In this case, there are some embedded analysis on the ongoing situations 5165
which in that, the cells could be labelled as some groups and some groups or individuals have 5166
excessive labels which all are raised from the behaviors to overcome the cancer’s attacks. In 5167
the embedded situations, the individuals of cells and the groups of cells could be considered 5168
as “new groups”. Thus it motivates us to find the proper SuperHyperModels for getting more 5169
245
proper analysis on this messy story. I’ve found the SuperHyperModels which are officially 5170
called “SuperHyperGraphs” and “Neutrosophic SuperHyperGraphs”. In this SuperHyperModel, 5171
the cells and the groups of cells are defined as “SuperHyperVertices” and the relations between 5172
the individuals of cells and the groups of cells are defined as “SuperHyperEdges”. Thus it’s 5173
another motivation for us to do research on this SuperHyperModel based on the “Cancer’s 5174
Recognition”. Sometimes, the situations get worst. The situation is passed from the certainty 5175
and precise style. Thus it’s the beyond them. There are three descriptions, namely, the degrees 5176
of determinacy, indeterminacy and neutrality, for any object based on vague forms, namely, 5177
incomplete data, imprecise data, and uncertain analysis. The latter model could be considered on 5178
the previous SuperHyperModel. It’s SuperHyperModel. It’s SuperHyperGraph but it’s officially 5179
called “Neutrosophic SuperHyperGraphs”. The cancer is the disease but the model is going to 5180
figure out what’s going on this phenomenon. The special case of this disease is considered and 5181
disease but the moves of the cancer in the special region are the matter of mind. The recognition 5183
of the cancer could help to find some treatments for this disease. The SuperHyperGraph and 5184
Neutrosophic SuperHyperGraph are the SuperHyperModels on the “Cancer’s Recognition” and 5185
both bases are the background of this research. Sometimes the cancer has been happened on the 5186
region, full of cells, groups of cells and embedded styles. In this segment, the SuperHyperModel 5187
proposes some SuperHyperNotions based on the connectivities of the moves of the cancer in the 5188
forms of alliances’ styles with the formation of the design and the architecture are formally called 5189
“ SuperHyperK-Domination” in the themes of jargons and buzzwords. The prefix “SuperHyper” 5190
refers to the theme of the embedded styles to figure out the background for the SuperHyperNotions. 5191
The recognition of the cancer in the long-term function. The specific region has been assigned 5192
by the model [it’s called SuperHyperGraph] and the long cycle of the move from the cancer is 5193
identified by this research. Sometimes the move of the cancer hasn’t be easily identified since 5194
there are some determinacy, indeterminacy and neutrality about the moves and the effects of the 5195
cancer on that region; this event leads us to choose another model [it’s said to be Neutrosophic 5196
SuperHyperGraph] to have convenient perception on what’s happened and what’s done. There are 5197
some specific models, which are well-known and they’ve got the names, and some general models. 5198
The moves and the traces of the cancer on the complex tracks and between complicated groups 5199
of cells could be fantasized by a Neutrosophic SuperHyperPath (-/SuperHyperK-Domination, 5200

SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim 5201
is to find either the optimal SuperHyperK-Domination or the Neutrosophic SuperHyperK- 5202
Domination in those Neutrosophic SuperHyperModels. Some general results are introduced. 5203
Beyond that in SuperHyperStar, all possible Neutrosophic SuperHyperPath s have only two 5204
to form any style of a SuperHyperK-Domination. There isn’t any formation of any SuperHyperK- 5206
Domination but literarily, it’s the deformation of any SuperHyperK-Domination. It, literarily, 5207
deforms and it doesn’t form. 5208
amount of SuperHyperK-Domination” of either individual of cells or the groups of cells based on 5210
the fixed cell or the fixed group of cells, extensively, the “amount of SuperHyperK-Domination” 5211
based on the fixed groups of cells or the fixed groups of group of cells? 5212
Question 24.0.2. What are the best descriptions for the “Cancer’s Recognition” in terms of 5213
these messy and dense SuperHyperModels where embedded notions are illustrated? 5214

it motivates us to define different types of “ SuperHyperK-Domination” and “Neutrosophic 5216
SuperHyperK-Domination” on “SuperHyperGraph” and “Neutrosophic SuperHyperGraph”. Then 5217
the research has taken more motivations to define SuperHyperClasses and to find some 5218
Some SuperHyperClasses and some Neutrosophic SuperHyperClasses are the cases of this 5223
research on the modeling of the regions where are under the attacks of the cancer to 5224
recognize this disease as it’s mentioned on the title “Cancer’s Recognitions”. To formalize 5225
the instances on the SuperHyperNotion, SuperHyperK-Domination, the new SuperHyperClasses 5226
and SuperHyperClasses, are introduced. Some general results are gathered in the section on the 5227
SuperHyperK-Domination and the Neutrosophic SuperHyperK-Domination. The clarifications, 5228
instances and literature reviews have taken the whole way through. In this scientific research, 5229
the literature reviews have fulfilled the lines containing the notions and the results. The 5230
SuperHyperGraph and Neutrosophic SuperHyperGraph are the SuperHyperModels on the 5231
“Cancer’s Recognitions” and both bases are the background of this research. Sometimes the 5232
cancer has been happened on the region, full of cells, groups of cells and embedded styles. In 5233
this scientific segment, the SuperHyperModel proposes some SuperHyperNotions based on the 5234
connectivities of the moves of the cancer in the longest and strongest styles with the formation 5235
of the design and the architecture are formally called “ SuperHyperK-Domination” in the themes 5236
of jargons and buzzwords. The prefix “SuperHyper” refers to the theme of the embedded styles to 5237
figure out the background for the SuperHyperNotions. 5238

CHAPTER 25 5239
Neutrosophic 5240
Eulerian-Type-Path-Neighbor 5241
Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of SuperHyperDu- 5242
ality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, ResearchGate 5243
2023, (doi: 10.13140/RG.2.2.34953.52320). 5244
Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph By 5245
SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchGate 2023, 5246
(doi: 10.13140/RG.2.2.33275.80161). 5247
10.13140/RG.2.2.11050.90569). 5250
Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of SuperHyperJoin 5251
10.13140/RG.2.2.17761.79206). 5253
10.13140/RG.2.2.19911.37285). 5256
Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect 5257
10.13140/RG.2.2.23266.81602). 5259
10.13140/RG.2.2.19360.87048). 5262
Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal 5263
10.13140/RG.2.2.32363.21286). 5265
10.13140/RG.2.2.11758.69441). 5268
Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of SuperHyperConnected 5269
10.13140/RG.2.2.31891.35367). 5271
249

10.13140/RG.2.2.21510.45125). 5274
Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDominating 5275
10.13140/RG.2.2.13121.84321). 5277

CHAPTER 26 5278
New Ideas In Recognition of Cancer And 5279
Neutrosophic SuperHyperGraph By 5280
Eulerian-Type-Path-Neighbor As Hyper 5281
Nebbish On Super Nebulous 5282
251
CHAPTER 27 5283
ABSTRACT 5284
In this scientific research, (Different Neutrosophic Types of Neutrosophic SuperHyperEulerian- 5285

Type-Path-Neighbor). Assume a Neutrosophic SuperHyperGraph (NSHG) S is a Eulerian-Type-Path- 5286
0
Neighbor pair S = (V, E). Consider a Neutrosophic SuperHyperSet V = {V1 , V2 , . . . , Vs } and 5287
0 0 0
E = {E1 , E2 , . . . , Ez }. Then either V or E is called Neutrosophic e-SuperHyperEulerian-Type- 5288
Path-Neighbor if the following expression is called Neutrosophic e-SuperHyperEulerian-Type-Path-Neighbor 5289

criteria holds 5290
∀N (Ea ) ∈ P : P is
Neutrosophic re-SuperHyperEulerian-Type-Path-Neighbor if the following expression is called Neutro- 5291

sophic e-SuperHyperEulerian-Type-Path-Neighbor criteria holds 5292
∀N (Ea ) ∈ P : P is
and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; Neutrosophic v- 5293

SuperHyperEulerian-Type-Path-Neighbor if the following expression is called Neutrosophic v- 5294
SuperHyperEulerian-Type-Path-Neighbor criteria holds 5295
∀N (Va ) ∈ P : P is
Neutrosophic rv-SuperHyperEulerian-Type-Path-Neighbor if the following expression is called Neutro- 5296

sophic v-SuperHyperEulerian-Type-Path-Neighbor criteria holds 5297
∀N (Va ) ∈ P : P is
253
and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; Neutrosophic 5298

SuperHyperEulerian-Type-Path-Neighbor if it’s either of Neutrosophic e-SuperHyperEulerian-Type-Path- 5299
Type-Path-Neighbor, and Neutrosophic rv-SuperHyperEulerian-Type-Path-Neighbor. ((Neutrosophic) 5301
SuperHyperEulerian-Type-Path-Neighbor). Assume a Neutrosophic SuperHyperGraph (NSHG) S 5302
is a pair S = (V, E). Consider a Neutrosophic SuperHyperEdge (NSHE) E = {V1 , V2 , . . . , Vs }. 5303
Then E is called an Extreme SuperHyperEulerian-Type-Path-Neighbor if it’s either of Neutrosophic 5304

e-SuperHyperEulerian-Type-Path-Neighbor, Neutrosophic re-SuperHyperEulerian-Type-Path-Neighbor, Neutro- 5305
sophic v-SuperHyperEulerian-Type-Path-Neighbor, and Neutrosophic rv-SuperHyperEulerian-Type-Path-Neighbor 5306
and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme 5307
and Extreme SuperHyperVertices such that they form the Extreme SuperHyperEulerian-Type- 5310
Path-Neighbor; a Neutrosophic SuperHyperEulerian-Type-Path-Neighbor if it’s either of Neutrosophic 5311
and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutro- 5314
sophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of 5315
high Neutrosophic cardinality conseNeighborive Neutrosophic SuperHyperEdges and Neutrosophic 5316

SuperHyperVertices such that they form the Neutrosophic SuperHyperEulerian-Type-Path-Neighbor; an 5317
Extreme SuperHyperEulerian-Type-Path-Neighbor SuperHyperPolynomial if it’s either of Neutrosophic 5318
and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyper- 5321
Polynomial contains the Extreme coefficients defined as the Extreme number of the maximum 5322
Extreme cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high 5323
Extreme cardinality conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyper- 5324
Vertices such that they form the Extreme SuperHyperEulerian-Type-Path-Neighbor; and the Extreme 5325
power is corresponded to its Extreme coefficient; a Neutrosophic SuperHyperEulerian-Type-Path- 5326
Neighbor SuperHyperPolynomial if it’s either of Neutrosophic e-SuperHyperEulerian-Type-Path-Neighbor, 5327
Neutrosophic re-SuperHyperEulerian-Type-Path-Neighbor, Neutrosophic v-SuperHyperEulerian-Type-Path- 5328

Neighbor, and Neutrosophic rv-SuperHyperEulerian-Type-Path-Neighbor and C(N SHG) for a Neutrosophic 5329
SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains the 5330
Neutrosophic coefficients defined as the Neutrosophic number of the maximum Neutrosophic 5331
cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of high 5332
Neutrosophic cardinality conseNeighborive Neutrosophic SuperHyperEdges and Neutrosophic 5333

SuperHyperVertices such that they form the Neutrosophic SuperHyperEulerian-Type-Path-Neighbor; 5334
and the Neutrosophic power is corresponded to its Neutrosophic coefficient; an Extreme V- 5335
SuperHyperEulerian-Type-Path-Neighbor if it’s either of Neutrosophic e-SuperHyperEulerian-Type-Path-Neighbor, 5336
Neutrosophic re-SuperHyperEulerian-Type-Path-Neighbor, Neutrosophic v-SuperHyperEulerian-Type-Path- 5337
Neighbor, and Neutrosophic rv-SuperHyperEulerian-Type-Path-Neighbor and C(N SHG) for an Extreme 5338
SuperHyperGraph N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHy- 5339
perSet S of high Extreme cardinality of the Extreme SuperHyperVertices in the conseNeighborive 5340
Extreme sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 5341
form the Extreme SuperHyperEulerian-Type-Path-Neighbor; a Neutrosophic V-SuperHyperEulerian-Type- 5342
Path-Neighbor if it’s either of Neutrosophic e-SuperHyperEulerian-Type-Path-Neighbor, Neutrosophic re- 5343

SuperHyperEulerian-Type-Path-Neighbor, Neutrosophic v-SuperHyperEulerian-Type-Path-Neighbor, and Neutro- 5344

sophic rv-SuperHyperEulerian-Type-Path-Neighbor and C(N SHG) for a Neutrosophic SuperHyperGraph 5345
N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVer- 5346
tices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality conseNeighborive 5347
Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the 5348
Neutrosophic SuperHyperEulerian-Type-Path-Neighbor; an Extreme V-SuperHyperEulerian-Type-Path-Neighbor 5349
SuperHyperPolynomial if it’s either of Neutrosophic e-SuperHyperEulerian-Type-Path-Neighbor, Neut- 5350

rosophic re-SuperHyperEulerian-Type-Path-Neighbor, Neutrosophic v-SuperHyperEulerian-Type-Path-Neighbor, 5351
and Neutrosophic rv-SuperHyperEulerian-Type-Path-Neighbor and C(N SHG) for an Extreme Supe- 5352
rHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme 5353
coefficients defined as the Extreme number of the maximum Extreme cardinality of the Extreme 5354
SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality conseNeigh- 5355
borive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 5356
Extreme SuperHyperEulerian-Type-Path-Neighbor; and the Extreme power is corresponded to its Extreme 5357
coefficient; a Neutrosophic SuperHyperEulerian-Type-Path-Neighbor SuperHyperPolynomial if it’s either 5358
of Neutrosophic e-SuperHyperEulerian-Type-Path-Neighbor, Neutrosophic re-SuperHyperEulerian-Type-Path- 5359
Neighbor, Neutrosophic v-SuperHyperEulerian-Type-Path-Neighbor, and Neutrosophic rv-SuperHyperEulerian- 5360
Type-Path-Neighbor and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the 5361
Neutrosophic SuperHyperPolynomial contains the Neutrosophic coefficients defined as the 5362

Neutrosophic number of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyper- 5363
Vertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality conseNeighborive 5364
Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form 5365
the Neutrosophic SuperHyperEulerian-Type-Path-Neighbor; and the Neutrosophic power is corres- 5366
ponded to its Neutrosophic coefficient. In this scientific research, new setting is introduced 5367
for new SuperHyperNotions, namely, a SuperHyperEulerian-Type-Path-Neighbor and Neutrosophic 5368

SuperHyperEulerian-Type-Path-Neighbor. Two different types of SuperHyperDefinitions are debut 5369
for them but the research goes further and the SuperHyperNotion, SuperHyperUniform, and 5370
SuperHyperClass based on that are well-defined and well-reviewed. The literature review is 5371
implemented in the whole of this research. For shining the elegancy and the significancy of this 5372
research, the comparison between this SuperHyperNotion with other SuperHyperNotions and 5373
fundamental SuperHyperNumbers are featured. The definitions are followed by the examples 5374
and the instances thus the clarifications are driven with different tools. The applications are 5375
figured out to make sense about the theoretical aspect of this ongoing research. The “Cancer’s 5376
Recognition” are the under research to figure out the challenges make sense about ongoing and 5377
upcoming research. The special case is up. The cells are viewed in the deemed ways. There 5378
are different types of them. Some of them are individuals and some of them are well-modeled 5379
by the group of cells. These types are all officially called “SuperHyperVertex” but the relations 5380
“Neutrosophic SuperHyperGraph” are chosen and elected to research about “Cancer’s Recog- 5382
nition”. Thus these complex and dense SuperHyperModels open up some avenues to research 5383
on theoretical segments and “Cancer’s Recognition”. Some avenues are posed to pursue this 5384
research. It’s also officially collected in the form of some questions and some problems. Assume 5385
a SuperHyperGraph. Assume a SuperHyperGraph. Then δ−SuperHyperEulerian-Type-Path-Neighbor 5386

first Expression, holds if S is an δ−SuperHyperOffensive. And the second Expression, holds 5390
if S is an δ−SuperHyperDefensive; a Neutrosophic δ−SuperHyperEulerian-Type-Path-Neighbor is a 5391
maximal Neutrosophic of SuperHyperVertices with maximum Neutrosophic cardinality such 5392
that either of the following expressions hold for the Neutrosophic cardinalities of SuperHy- 5393
perNeighbors of s ∈ S there are: |S ∩ N (s)|N eutrosophic > |S ∩ (V \ N (s))|N eutrosophic + δ; 5394
and |S ∩ N (s)|N eutrosophic < |S ∩ (V \ N (s))|N eutrosophic + δ. The first Expression, holds 5395
if S is a Neutrosophic δ−SuperHyperOffensive. And the second Expression, holds if S is 5396

a Neutrosophic δ−SuperHyperDefensive It’s useful to define a “Neutrosophic” version of 5397
a SuperHyperEulerian-Type-Path-Neighbor . Since there’s more ways to get type-results to make a 5398
SuperHyperEulerian-Type-Path-Neighbor more understandable. For the sake of having Neutrosophic 5399
SuperHyperEulerian-Type-Path-Neighbor, there’s a need to “redefine” the notion of a “SuperHyperEulerian- 5400
Type-Path-Neighbor ”. The SuperHyperVertices and the SuperHyperEdges are assigned by the labels 5401
from the letters of the alphabets. In this procedure, there’s the usage of the position of labels to 5402
assign to the values. Assume a SuperHyperEulerian-Type-Path-Neighbor . It’s redefined a Neutrosophic 5403
SuperHyperEulerian-Type-Path-Neighbor if the mentioned Table holds, concerning, “The Values of 5404
Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges Belong to The Neutrosophic 5405
SuperHyperGraph” with the key points, “The Values of The Vertices & The Number of 5406
Position in Alphabet”, “The Values of The SuperVertices&The maximum Values of Its Ver- 5407
tices”, “The Values of The Edges&The maximum Values of Its Vertices”, “The Values of The 5408
HyperEdges&The maximum Values of Its Vertices”, “The Values of The SuperHyperEdges&The 5409
maximum Values of Its Endpoints”. To get structural examples and instances, I’m going to 5410
introduce the next SuperHyperClass of SuperHyperGraph based on a SuperHyperEulerian-Type-Path- 5411
Neighbor . It’s the main. It’ll be disciplinary to have the foundation of previous definition in the 5412
kind of SuperHyperClass. If there’s a need to have all SuperHyperEulerian-Type-Path-Neighbor until the 5413
SuperHyperEulerian-Type-Path-Neighbor, then it’s officially called a “SuperHyperEulerian-Type-Path-Neighbor” 5414

but otherwise, it isn’t a SuperHyperEulerian-Type-Path-Neighbor . There are some instances about the 5415
clarifications for the main definition titled a “SuperHyperEulerian-Type-Path-Neighbor ”. These two 5416
examples get more scrutiny and discernment since there are characterized in the disciplinary ways 5417
of the SuperHyperClass based on a SuperHyperEulerian-Type-Path-Neighbor . For the sake of having 5418
a Neutrosophic SuperHyperEulerian-Type-Path-Neighbor, there’s a need to “redefine” the notion of a 5419
“Neutrosophic SuperHyperEulerian-Type-Path-Neighbor” and a “Neutrosophic SuperHyperEulerian-Type-Path- 5420

Neighbor ”. The SuperHyperVertices and the SuperHyperEdges are assigned by the labels from the 5421
letters of the alphabets. In this procedure, there’s the usage of the position of labels to assign to 5422
the values. Assume a Neutrosophic SuperHyperGraph. It’s redefined “Neutrosophic SuperHyper- 5423
Graph” if the intended Table holds. And a SuperHyperEulerian-Type-Path-Neighbor are redefined to a 5424
“Neutrosophic SuperHyperEulerian-Type-Path-Neighbor” if the intended Table holds. It’s useful to define 5425
“Neutrosophic” version of SuperHyperClasses. Since there’s more ways to get Neutrosophic 5426
type-results to make a Neutrosophic SuperHyperEulerian-Type-Path-Neighbor more understandable. 5427
Assume a Neutrosophic SuperHyperGraph. There are some Neutrosophic SuperHyperClasses if 5428
the intended Table holds. Thus SuperHyperPath, SuperHyperEulerian-Type-Path-Neighbor, SuperHyper- 5429
Star, SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, are “Neutrosophic 5430
SuperHyperPath”, “Neutrosophic SuperHyperEulerian-Type-Path-Neighbor”, “Neutrosophic SuperHy- 5431

perStar”, “Neutrosophic SuperHyperBipartite”, “Neutrosophic SuperHyperMultiPartite”, and 5432
“Neutrosophic SuperHyperWheel” if the intended Table holds. A SuperHyperGraph has a 5433
“Neutrosophic SuperHyperEulerian-Type-Path-Neighbor” where it’s the strongest [the maximum Neutro- 5434
sophic value from all the SuperHyperEulerian-Type-Path-Neighbor amid the maximum value amid all 5435

SuperHyperVertices from a SuperHyperEulerian-Type-Path-Neighbor .] SuperHyperEulerian-Type-Path-Neighbor 5436

. A graph is a SuperHyperUniform if it’s a SuperHyperGraph and the number of elements of 5437
SuperHyperEdges are the same. Assume a Neutrosophic SuperHyperGraph. There are some 5438
SuperHyperClasses as follows. It’s SuperHyperPath if it’s only one SuperVertex as intersection 5439
amid two given SuperHyperEdges with two exceptions; it’s SuperHyperEulerian-Type-Path-Neighbor if 5440
it’s only one SuperVertex as intersection amid two given SuperHyperEdges; it’s SuperHyperStar 5441
it’s only one SuperVertex as intersection amid all SuperHyperEdges; it’s SuperHyperBipartite it’s 5442
“specific” cells and “specific group” of cells are SuperHyperModeled as “SuperHyperVertices” and 5451
the common and intended properties between “specific” cells and “specific group” of cells are 5452
SuperHyperModeled as “SuperHyperEdges”. Sometimes, it’s useful to have some degrees of 5453
determinacy, indeterminacy, and neutrality to have more precise SuperHyperModel which in 5454
this case the SuperHyperModel is called “Neutrosophic”. In the future research, the foundation 5455
will be based on the “Cancer’s Recognition” and the results and the definitions will be introduced 5456
identified since there are some determinacy, indeterminacy and neutrality about the moves 5460
and the effects of the cancer on that region; this event leads us to choose another model [it’s 5461
said to be Neutrosophic SuperHyperGraph] to have convenient perception on what’s happened 5462
and what’s done. There are some specific models, which are well-known and they’ve got the 5463
names, and some SuperHyperGeneral SuperHyperModels. The moves and the traces of the 5464
cancer on the complex tracks and between complicated groups of cells could be fantasized by 5465
a Neutrosophic SuperHyperPath(-/SuperHyperEulerian-Type-Path-Neighbor, SuperHyperStar, Super- 5466

HyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find either the 5467
longest SuperHyperEulerian-Type-Path-Neighbor or the strongest SuperHyperEulerian-Type-Path-Neighbor in 5468
those Neutrosophic SuperHyperModels. For the longest SuperHyperEulerian-Type-Path-Neighbor, called 5469
SuperHyperEulerian-Type-Path-Neighbor, and the strongest SuperHyperEulerian-Type-Path-Neighbor, called 5470
Neutrosophic SuperHyperEulerian-Type-Path-Neighbor, some general results are introduced. Beyond 5471

that in SuperHyperStar, all possible SuperHyperPaths have only two SuperHyperEdges but it’s 5472
not enough since it’s essential to have at least three SuperHyperEdges to form any style of a 5473
SuperHyperEulerian-Type-Path-Neighbor. There isn’t any formation of any SuperHyperEulerian-Type-Path- 5474
Neighbor but literarily, it’s the deformation of any SuperHyperEulerian-Type-Path-Neighbor. It, literarily, 5475
deforms and it doesn’t form. A basic familiarity with Neutrosophic SuperHyperEulerian-Type-Path- 5476
Neighbor theory, SuperHyperGraphs, and Neutrosophic SuperHyperGraphs theory are proposed. 5477
Keywords: Neutrosophic SuperHyperGraph, SuperHyperEulerian-Type-Path-Neighbor, Cancer’s Neut- 5478
rosophic Recognition 5479

CHAPTER 28 5481
Applied Notions Under The Scrutiny Of 5482
The Motivation Of This Scientific 5483
Research 5484
In this scientific research, there are some ideas in the featured frameworks of motivations. 5485
I try to bring the motivations in the narrative ways. Some cells have been faced with some 5486
attacks from the situation which is caused by the cancer’s attacks. In this case, there are 5487
some embedded analysis on the ongoing situations which in that, the cells could be labelled as 5488
some groups and some groups or individuals have excessive labels which all are raised from 5489
the behaviors to overcome the cancer’s attacks. In the embedded situations, the individuals 5490
of cells and the groups of cells could be considered as “new groups”. Thus it motivates us to 5491
find the proper SuperHyperModels for getting more proper analysis on this messy story. I’ve 5492
found the SuperHyperModels which are officially called “SuperHyperGraphs” and “Neutrosophic 5493
SuperHyperGraphs”. In this SuperHyperModel, the cells and the groups of cells are defined as 5494
“SuperHyperVertices” and the relations between the individuals of cells and the groups of cells 5495
are defined as “SuperHyperEdges”. Thus it’s another motivation for us to do research on this 5496
SuperHyperModel based on the “Cancer’s Recognition”. Sometimes, the situations get worst. 5497
The situation is passed from the certainty and precise style. Thus it’s the beyond them. There 5498
are three descriptions, namely, the degrees of determinacy, indeterminacy and neutrality, for any 5499
object based on vague forms, namely, incomplete data, imprecise data, and uncertain analysis. 5500
The latter model could be considered on the previous SuperHyperModel. It’s SuperHyperModel. 5501
It’s SuperHyperGraph but it’s officially called “Neutrosophic SuperHyperGraphs”. The cancer is 5502
the disease but the model is going to figure out what’s going on this phenomenon. The special 5503
case of this disease is considered and as the consequences of the model, some parameters 5504
are used. The cells are under attack of this disease but the moves of the cancer in the 5505
special region are the matter of mind. The recognition of the cancer could help to find some 5506
treatments for this disease. The SuperHyperGraph and Neutrosophic SuperHyperGraph are the 5507
SuperHyperModels on the “Cancer’s Recognition” and both bases are the background of this 5508
research. Sometimes the cancer has been happened on the region, full of cells, groups of cells 5509
and embedded styles. In this segment, the SuperHyperModel proposes some SuperHyperNotions 5510
based on the connectivities of the moves of the cancer in the forms of alliances’ styles with 5511
the formation of the design and the architecture are formally called “ SuperHyperEulerian-Type- 5512
Path-Neighbor” in the themes of jargons and buzzwords. The prefix “SuperHyper” refers to the 5513
259
theme of the embedded styles to figure out the background for the SuperHyperNotions. The 5514
recognition of the cancer in the long-term function. The specific region has been assigned by 5515
the model [it’s called SuperHyperGraph] and the long cycle of the move from the cancer is 5516
identified by this research. Sometimes the move of the cancer hasn’t be easily identified since 5517
there are some determinacy, indeterminacy and neutrality about the moves and the effects of the 5518
cancer on that region; this event leads us to choose another model [it’s said to be Neutrosophic 5519
SuperHyperGraph] to have convenient perception on what’s happened and what’s done. There 5520
are some specific models, which are well-known and they’ve got the names, and some general 5521
models. The moves and the traces of the cancer on the complex tracks and between complicated 5522
groups of cells could be fantasized by a Neutrosophic SuperHyperPath (-/SuperHyperEulerian-Type- 5523
Path-Neighbor, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). 5524
The aim is to find either the optimal SuperHyperEulerian-Type-Path-Neighbor or the Neutrosophic 5525
SuperHyperEulerian-Type-Path-Neighbor in those Neutrosophic SuperHyperModels. Some general results 5526

are introduced. Beyond that in SuperHyperStar, all possible Neutrosophic SuperHyperPath s 5527
have only two SuperHyperEdges but it’s not enough since it’s essential to have at least three 5528
SuperHyperEdges to form any style of a SuperHyperEulerian-Type-Path-Neighbor. There isn’t any 5529
formation of any SuperHyperEulerian-Type-Path-Neighbor but literarily, it’s the deformation of any 5530
SuperHyperEulerian-Type-Path-Neighbor. It, literarily, deforms and it doesn’t form. 5531
Question 28.0.1. How to define the SuperHyperNotions and to do research on them to find the 5532
“ amount of SuperHyperEulerian-Type-Path-Neighbor” of either individual of cells or the groups of cells 5533

based on the fixed cell or the fixed group of cells, extensively, the “amount of SuperHyperEulerian- 5534
Type-Path-Neighbor” based on the fixed groups of cells or the fixed groups of group of cells? 5535
Question 28.0.2. What are the best descriptions for the “Cancer’s Recognition” in terms of 5536
these messy and dense SuperHyperModels where embedded notions are illustrated? 5537
it motivates us to define different types of “ SuperHyperEulerian-Type-Path-Neighbor” and “Neutrosophic 5539
SuperHyperEulerian-Type-Path-Neighbor” on “SuperHyperGraph” and “Neutrosophic SuperHyperGraph”. 5540

Then the research has taken more motivations to define SuperHyperClasses and to find some 5541
The framework of this research is as follows. In the beginning, I introduce basic definitions to 5546
clarify about preliminaries. In the subsection “Preliminaries”, initial definitions about SuperHy- 5547
perGraphs and Neutrosophic SuperHyperGraph are deeply-introduced and in-depth-discussed. 5548
The elementary concepts are clarified and illustrated completely and sometimes review literature 5549
are applied to make sense about what’s going to figure out about the upcoming sections. The main 5550
definitions and their clarifications alongside some results about new notions, SuperHyperEulerian- 5551
Type-Path-Neighbor and Neutrosophic SuperHyperEulerian-Type-Path-Neighbor, are figured out in sections “ 5552

SuperHyperEulerian-Type-Path-Neighbor” and “Neutrosophic SuperHyperEulerian-Type-Path-Neighbor”. In the 5553
sense of tackling on getting results and in Eulerian-Type-Path-Neighbor to make sense about continu- 5554
ing the research, the ideas of SuperHyperUniform and Neutrosophic SuperHyperUniform are 5555
introduced and as their consequences, corresponded SuperHyperClasses are figured out to debut 5556
what’s done in this section, titled “Results on SuperHyperClasses” and “Results on Neutrosophic 5557
SuperHyperClasses”. As going back to origin of the notions, there are some smart steps toward 5558

the common notions to extend the new notions in new frameworks, SuperHyperGraph and 5559
Neutrosophic SuperHyperGraph, in the sections “Results on SuperHyperClasses” and “Results 5560
on Neutrosophic SuperHyperClasses”. The starter research about the general SuperHyperRela- 5561
tions and as concluding and closing section of theoretical research are contained in the section 5562
“General Results”. Some general SuperHyperRelations are fundamental and they are well-known 5563
as fundamental SuperHyperNotions as elicited and discussed in the sections, “General Results”, 5564
“ SuperHyperEulerian-Type-Path-Neighbor”, “Neutrosophic SuperHyperEulerian-Type-Path-Neighbor”, “Results 5565

on SuperHyperClasses” and “Results on Neutrosophic SuperHyperClasses”. There are curious 5566
questions about what’s done about the SuperHyperNotions to make sense about excellency of this 5567
research and going to figure out the word “best” as the description and adjective for this research 5568
as presented in section, “ SuperHyperEulerian-Type-Path-Neighbor”. The keyword of this research debut 5569
in the section “Applications in Cancer’s Recognition” with two cases and subsections “Case 5570
1: The Initial Steps Toward SuperHyperBipartite as SuperHyperModel” and “Case 2: The 5571
Increasing Steps Toward SuperHyperMultipartite as SuperHyperModel”. In the section, “Open 5572
Problems”, there are some scrutiny and discernment on what’s done and what’s happened in this 5573
research in the terms of “questions” and “problems” to make sense to figure out this research 5574
in featured style. The advantages and the limitations of this research alongside about what’s 5575
done in this research to make sense and to get sense about what’s figured out are included in the 5576
section, “Conclusion and Closing Remarks”. 5577

CHAPTER 29 5578
Neutrosophic Preliminaries Of This 5579
Scientific Research On the Redeemed 5580
Ways 5581
In this section, the basic material in this scientific research, is referred to [Single Valued 5582
Neutrosophic Set](Ref.[HG38],Definition 2.2,p.2), [Neutrosophic Set](Ref.[HG38],Definition 5583

2.1,p.1), [Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG38],Definition 2.5,p.2), [Char- 5584
acterization of the Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG38],Definition 2.7,p.3), 5585
[t-norm](Ref.[HG38], Definition 2.7, p.3), and [Characterization of the Neutrosophic SuperHy- 5586
perGraph (NSHG)](Ref.[HG38],Definition 2.7,p.3), [Neutrosophic Strength of the Neutrosophic 5587
SuperHyperPaths] (Ref.[HG38],Definition 5.3,p.7), and [Different Neutrosophic Types of Neut- 5588
rosophic SuperHyperEdges (NSHE)] (Ref.[HG38],Definition 5.4,p.7). Also, the new ideas and 5589
their clarifications are addressed to Ref.[HG38]. 5590
In this subsection, the basic material which is used in this scientific research, is presented. Also, 5591
the new ideas and their clarifications are elicited. 5592
Definition 29.0.1 (Neutrosophic Set). (Ref.[HG38],Definition 2.1,p.1).

Let X be a Eulerian-Type-Path-Neighbor 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 [. 5593
Definition 29.0.2 (Single Valued Neutrosophic Set). (Ref.[HG38],Definition 2.2,p.2).

Let X be a Eulerian-Type-Path-Neighbor 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}.
263

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.[HG38],Definition 2.5,p.2). 5594
where 5596
1, 2, . . . , n0 ); 5601
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 5602
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 5603

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



SuperEdge; 5626
If we choose different types of binary operations, then we could get hugely diverse types of 5629
general forms of Neutrosophic SuperHyperGraph (NSHG). 5630
Definition 29.0.7 (t-norm). (Ref.[HG38], Definition 2.7, p.3). 5631

A binary operation ⊗ : [0, 1] × [0, 1] → [0, 1] is a t-norm if it satisfies the following for 5632
x, y, z, w ∈ [0, 1]: 5633
(i) 1 ⊗ x = x; 5634
(ii) x ⊗ y = y ⊗ x; 5635
(iii) x ⊗ (y ⊗ z) = (x ⊗ y) ⊗ z; 5636
(iv) If w ≤ x and y ≤ z then w ⊗ y ≤ x ⊗ z. 5637

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

where 5640

1, 2, . . . , n0 ); 5645
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 5646
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 5647
P
(vii) i supp(Vi ) = V, (i = 1, 2, . . . , n); 5648
0 0
P
(viii) i0 supp(Ei ) = V, (i = 1, 2, . . . , n ). 5649
0


Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). The Neutrosophic 5661
SuperHyperEdges (NSHE) Ei0 and the Neutrosophic SuperHyperVertices (NSHV) Vi of Neutro- 5662
sophic SuperHyperGraph (NSHG) S = (V, E) could be characterized as follow-up items. 5663
SuperEdge; 5669
This SuperHyperModel is too messy and too dense. Thus there’s a need to have some 5672
restrictions and conditions on SuperHyperGraph. The special case of this SuperHyperGraph 5673
makes the patterns and regularities. 5674
Definition 29.0.12. A graph is SuperHyperUniform if it’s SuperHyperGraph and the number 5675
of elements of SuperHyperEdges are the same. 5676

To get more visions on SuperHyperUniform, the some SuperHyperClasses are introduced. It 5677
makes to have SuperHyperUniform more understandable. 5678
Definition 29.0.13. Assume a Neutrosophic SuperHyperGraph. There are some SuperHyper- 5679
Classes as follows. 5680
(i). It’s Neutrosophic SuperHyperPath if it’s only one SuperVertex as intersection amid 5681
two given SuperHyperEdges with two exceptions; 5682
(ii). it’s SuperHyperCycle if it’s only one SuperVertex as intersection amid two given 5683
SuperHyperEdges; 5684
(iii). it’s SuperHyperStar it’s only one SuperVertex as intersection amid all SuperHyperEdges; 5685
(iv). it’s SuperHyperBipartite it’s only one SuperVertex as intersection amid two given Supe- 5686
rHyperEdges and these SuperVertices, forming two separate sets, has no SuperHyperEdge 5687
in common; 5688
(v). it’s SuperHyperMultiPartite it’s only one SuperVertex as intersection amid two 5689
given SuperHyperEdges and these SuperVertices, forming multi separate sets, has no 5690
SuperHyperEdge in common; 5691
(vi). it’s SuperHyperWheel if it’s only one SuperVertex as intersection amid two given 5692
SuperHyperEdges and one SuperVertex has one SuperHyperEdge with any common 5693
SuperVertex. 5694
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 5695
(NSHV) V1 to Neutrosophic SuperHyperVertex (NSHV) Vs if either of following conditions hold: 5696
(i) Vi , Vi+1 ∈ Ei0 ; 5697
(ii) there’s a vertex vi ∈ Vi such that vi , Vi+1 ∈ Ei0 ; 5698
(iii) there’s a SuperVertex Vi0 ∈ Vi such that Vi0 , Vi+1 ∈ Ei0 ; 5699
(iv) there’s a vertex vi+1 ∈ Vi+1 such that Vi , vi+1 ∈ Ei0 ; 5700
0 0
(v) there’s a SuperVertex Vi+1 ∈ Vi+1 such that Vi , Vi+1 ∈ E i0 ; 5701
(vi) there are a vertex vi ∈ Vi and a vertex vi+1 ∈ Vi+1 such that vi , vi+1 ∈ Ei0 ; 5702
0 0
(vii) there are a vertex vi ∈ Vi and a SuperVertex Vi+1 ∈ Vi+1 such that vi , Vi+1 ∈ Ei0 ; 5703
(viii) there are a SuperVertex Vi0 ∈ Vi and a vertex vi+1 ∈ Vi+1 such that Vi0 , vi+1 ∈ Ei0 ; 5704
(ix) there are a SuperVertex Vi0 ∈ Vi and a SuperVertex Vi+1

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

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. 5706
(i) If for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | = 2, then NSHP is called path; 5707
(ii) if for all Ej 0 , |Ej 0 | = 2, and there’s Vi , |Vi | ≥ 1, then NSHP is called SuperPath; 5708
(iii) if for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | ≥ 2, then NSHP is called HyperPath; 5709
(iv) if there are Vi , Ej 0 , |Vi | ≥ 1, |Ej 0 | ≥ 2, then NSHP is called Neutrosophic SuperHy- 5710
perPath . 5711
Definition 29.0.16 (Neutrosophic Strength of the Neutrosophic SuperHyperPaths).

(Ref.[HG38],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 5712
(i) Neutrosophic t-strength (min{T (Vi )}, m, n)si=1 ; 5713
(ii) Neutrosophic i-strength (m, min{I(Vi )}, n)si=1 ; 5714
(iii) Neutrosophic f-strength (m, n, min{F (Vi )})si=1 ; 5715
(iv) Neutrosophic strength (min{T (Vi )}, min{I(Vi )}, min{F (Vi )})si=1 . 5716
Definition 29.0.17 (Different Neutrosophic Types of Neutrosophic SuperHyperEdges (NSHE)). 5717

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

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


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

(xii) Neutrosophic connective if (T (E), I(E), F (E)) ≥ maximum number of Neutrosophic 5730
strength of SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex (NSHV) Vi 5731
to Neutrosophic SuperHyperVertex (NSHV) Vj where 1 ≤ i, j ≤ s. 5732
Definition 29.0.18. (Different Neutrosophic Types of Neutrosophic SuperHyperEulerian-Type-Path- 5733

Neighbor). 5734
(i) Neutrosophic e-SuperHyperEulerian-Type-Path-Neighbor if the following expression is 5738

called Neutrosophic e-SuperHyperEulerian-Type-Path-Neighbor criteria holds 5739
∀N (Ea ) ∈ P : P is
(ii) Neutrosophic re-SuperHyperEulerian-Type-Path-Neighbor if the following expression is 5740

called Neutrosophic re-SuperHyperEulerian-Type-Path-Neighbor criteria holds 5741
∀N (Ea ) ∈ P : P is
and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 5742
(iii) Neutrosophic v-SuperHyperEulerian-Type-Path-Neighbor if the following expression is 5743
∀N (Va ) ∈ P : P is
(iv) Neutrosophic rv-SuperHyperEulerian-Type-Path-Neighbor if the following expression is 5745
∀N (Va ) ∈ P : P is

(v) Neutrosophic SuperHyperEulerian-Type-Path-Neighbor if it’s either of Neutro- 5748

Definition 29.0.19. ((Neutrosophic) SuperHyperEulerian-Type-Path-Neighbor). 5752

(i) an Extreme SuperHyperEulerian-Type-Path-Neighbor if it’s either of Neutrosophic 5755

e-SuperHyperEulerian-Type-Path-Neighbor, Neutrosophic re-SuperHyperEulerian-Type-Path- 5756
Neighbor, Neutrosophic v-SuperHyperEulerian-Type-Path-Neighbor, and Neutrosophic rv- 5757

(ii) a Neutrosophic SuperHyperEulerian-Type-Path-Neighbor if it’s either of Neutro- 5763


(iii) an Extreme SuperHyperEulerian-Type-Path-Neighbor SuperHyperPolynomial if 5771

it’s either of Neutrosophic e-SuperHyperEulerian-Type-Path-Neighbor, Neutrosophic re- 5772
of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme 5777

(iv) a Neutrosophic SuperHyperEulerian-Type-Path-Neighbor SuperHyperPolynomial 5781

and Neutrosophic rv-SuperHyperEulerian-Type-Path-Neighbor and C(N SHG) for a Neutro- 5784

Neutrosophic coefficient; 5791

(v) an Extreme V-SuperHyperEulerian-Type-Path-Neighbor if it’s either of Neutro- 5792

N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of 5796
high Extreme cardinality of the Extreme SuperHyperVertices in the conseNeighborive 5797

(vi) a Neutrosophic V-SuperHyperEulerian-Type-Path-Neighbor if it’s either of Neut- 5800

rosophic e-SuperHyperEulerian-Type-Path-Neighbor, Neutrosophic re-SuperHyperEulerian-Type- 5801

N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic Supe- 5804
rHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 5805
(vii) an Extreme V-SuperHyperEulerian-Type-Path-Neighbor SuperHyperPolynomial 5808


(viii) a Neutrosophic SuperHyperEulerian-Type-Path-Neighbor SuperHyperPolynomial 5818

and Neutrosophic rv-SuperHyperEulerian-Type-Path-Neighbor and C(N SHG) for a Neutrosophic 5821

Neutrosophic coefficient. 5828
Definition 29.0.20. ((Extreme/Neutrosophic)δ−SuperHyperEulerian-Type-Path-Neighbor). 5829

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Then 5830
(i) an δ−SuperHyperEulerian-Type-Path-Neighbor is a Neutrosophic kind of Neutrosophic 5831
SuperHyperEulerian-Type-Path-Neighbor such that either of the following expressions hold for 5832


136TBL3
the Neutrosophic cardinalities of SuperHyperNeighbors of s ∈ S : 5833
|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 5834

(29.1), holds if S is an δ−SuperHyperDefensive; 5835
(ii) a Neutrosophic δ−SuperHyperEulerian-Type-Path-Neighbor is a Neutrosophic kind 5836

of Neutrosophic SuperHyperEulerian-Type-Path-Neighbor such that either of the following 5837
Neutrosophic expressions hold for the Neutrosophic cardinalities of SuperHyperNeighbors 5838
of s ∈ S : 5839
|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 5840

the Expression (29.1), holds if S is a Neutrosophic δ−SuperHyperDefensive. 5841

“redefine” the notion of “Neutrosophic SuperHyperGraph”. The SuperHyperVertices and the 5843
SuperHyperEdges are assigned by the labels from the letters of the alphabets. In this procedure, 5844
there’s the usage of the position of labels to assign to the values. 5845
136DEF1 Definition 29.0.21. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 5846
It’s redefined Neutrosophic SuperHyperGraph if the Table (29.1) holds. 5847
It’s useful to define a “Neutrosophic” version of SuperHyperClasses. Since there’s more ways 5848
to get Neutrosophic type-results to make a Neutrosophic more understandable. 5849
136DEF2 Definition 29.0.22. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = 5850

(V, E). There are some Neutrosophic SuperHyperClasses if the Table (29.2) holds. 5851
Thus Neutrosophic SuperHyperPath , SuperHyperEulerian-Type-Path-Neighbor, SuperHyperStar, 5852
SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, are Neutrosophic 5853
SuperHyperPath, Neutrosophic SuperHyperCycle, Neutrosophic SuperHyperStar, 5854
Neutrosophic SuperHyperBipartite, Neutrosophic SuperHyperMultiPartite, and 5855
Neutrosophic SuperHyperWheel if the Table (29.2) holds. 5856

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

136TBL4

136TBL1
It’s useful to define a “Neutrosophic” version of a Neutrosophic SuperHyperEulerian-Type-Path- 5857

Neighbor. Since there’s more ways to get type-results to make a Neutrosophic SuperHyperEulerian- 5858
Type-Path-Neighbor more Neutrosophicly understandable. 5859
“redefine” the Neutrosophic notion of “Neutrosophic SuperHyperEulerian-Type-Path-Neighbor”. The 5861

136DEF1 Definition 29.0.23. Assume a SuperHyperEulerian-Type-Path-Neighbor. It’s redefined a Neutro- 5864

sophic SuperHyperEulerian-Type-Path-Neighbor if the Table (29.3) holds. 5865

CHAPTER 30 5866
Neutrosophic SuperHyper But As Eulerian-Type-Path-Neighbor 5867
Super Forms 5869
Definition 30.0.1. (Neutrosophic event). 5870
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 5871

S = (V, E) is a probability Eulerian-Type-Path-Neighbor. Any Neutrosophic k-subset of A of V 5872
is called Neutrosophic k-event and if k = 2, then Neutrosophic subset of A of V is called 5873
Neutrosophic event. The following expression is called Neutrosophic probability of A. 5874
X
E(A) = E(a). (30.1)
a∈A
Definition 30.0.2. (Neutrosophic Independent). 5875

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) is 5876
a probability Eulerian-Type-Path-Neighbor. s Neutrosophic k-events Ai , i ∈ I is called Neutrosophic 5877

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

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) 5882
is a probability Eulerian-Type-Path-Neighbor. Any k-function Eulerian-Type-Path-Neighbor like E is called 5883

Neutrosophic k-Variable. If k = 2, then any 2-function Eulerian-Type-Path-Neighbor like E is 5884
called Neutrosophic Variable. 5885
The notion of independent on Neutrosophic Variable is likewise. 5886
Definition 30.0.4. (Neutrosophic Expectation). 5887
275
is a probability Eulerian-Type-Path-Neighbor. A Neutrosophic k-Variable E has a number is called 5889

Neutrosophic Expectation if the following expression is called Neutrosophic Expectation 5890
criteria 5891
X
Ex(E) = E(α)P (α).
α∈V
Definition 30.0.5. (Neutrosophic Crossing). 5892

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) is 5893
a probability Eulerian-Type-Path-Neighbor. A Neutrosophic number is called Neutrosophic Crossing 5894
if the following expression is called Neutrosophic Crossing criteria 5895
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). 5896
Consider S = (V, E) is a probability Eulerian-Type-Path-Neighbor. Let m and n propose special Eulerian- 5897
Type-Path-Neighbor. Then with m ≥ 4n, 5898
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 Eulerian-Type-Path-Neighbor 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).
2
Now E(X) = pn, E(Y ) = p 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: 5899
pm − 3n n 1 3 2
cr(G) ≥ = 3 = 64 m n .
p3 (4n/m)
5900
Theorem 30.0.7. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 5901
in the plane, and let l be the Neutrosophic number of√SuperHyperLines in the plane passing 5903
through at least k + 1 of these points, where 1 ≤ k ≤ 2 2n. Then l < 32n2 /k 3 . 5904
Proof. Form a Neutrosophic SuperHyperGraph G with SuperHyperVertex SuperHyperSet 5905

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

in the plane, and let k be the number of pairs of points of P at unit SuperHyperDistance. Then 5913
k < 5n4/3 . 5914
Proof. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = 5915
(V, E) is a probability Eulerian-Type-Path-Neighbor. Draw a SuperHyperUnit SuperHyperCircle around 5916

each SuperHyperPoint of P. Let ni be the Neutrosophic number of thesePSuperHyperCircles 5917
i = 0n−1 ni = n and k = 12 i = 0n−1 ini . Now
P
passing through exactly i points of P. Then 5918
form a Neutrosophic SuperHyperGraph H with SuperHyperVertex SuperHyperSet P whose 5919
SuperHyperEdges are the SuperHyperArcs between conseNeighborive SuperHyperPoints on the 5920
SuperHyperCircles that pass through at least three SuperHyperPoints of P. Then 5921
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 5922

SuperHyperEdges. Delete from H one of each SuperHyperPair of parallel SuperHyperEdges, 5923
so as to obtain a simple Neutrosophic SuperHyperGraph G with e(G) ≥ k − n. Now 5924
cr(G) ≤ n(n − 1) because G is formed from at most n SuperHyperCircles, and any two 5925
SuperHyperCircles cross at most twice. Thus either e(G) < 4n, in which case k < 5n < 5n4/3 , 5926
3
or n2 > n(n − 1) ≥ cr(G) ≥ (k − n) /64n2 by the Neutrosophic Crossing Lemma, and 5927
4/3 4/3
k < 4n + n < 5n . 5928
Proposition 30.0.9. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 5929
Consider S = (V, E) is a probability Eulerian-Type-Path-Neighbor. Let X be a nonnegative Neutrosophic 5930
Variable and t a positive real number. Then 5931
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. 5932
Corollary 30.0.10. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 5933
Consider S = (V, E) is a probability Eulerian-Type-Path-Neighbor. Let Xn be a nonnegative integer- 5934
valued variable in a probability Eulerian-Type-Path-Neighbor (Vn , En ), n ≥ 1. If E(Xn ) → 0 as n → ∞, 5935

then P (Xn = 0) → 1 as n → ∞. 5936
Proof. 5937
Consider S = (V, E) is a probability Eulerian-Type-Path-Neighbor. A special SuperHyperGraph in Gn,p 5939
almost surely has stability number at most d2p−1 log ne. 5940

Proof. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 5941
S = (V, E) is a probability Eulerian-Type-Path-Neighbor. A special SuperHyperGraph in Gn,p is 5942
up. Let G ∈ Gn,p and let S be a given SuperHyperSet of k + 1 SuperHyperVertices of G, 5943
where k ∈ N. The probability that S is a stable SuperHyperSet of G is (1 − p)(k+1)choose2 , this 5944
being the probability that none of the (k + 1)choose2 pairs of SuperHyperVertices of S is a 5945
SuperHyperEdge of the Neutrosophic SuperHyperGraph G. 5946
Let AS denote the event that S is a stable SuperHyperSet of G, and let XS denote the indicator 5947
Neutrosophic Variable for this Neutrosophic Event. By equation, we have 5948
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 5949
X
X= {XS : S ⊆ V, |S| = k + 1}
and so, by those, 5950
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: 5951
nk+1
(n choose k+1) ≤ and1 − p ≤ e−p .
(k + 1)!
This yields the following upper bound on E(X). 5952
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 5953
least as fast as the logarithm of n, implies that E(X) → 0 as n → ∞. Because X is integer-valued 5954
and nonnegative, we deduce from Corollary that P (X = 0) → 1 as n → ∞. Consequently, a 5955
Neutrosophic SuperHyperGraph in Gn,p almost surely has stability number at most k. 5956
Definition 30.0.12. (Neutrosophic Variance). 5957
is a probability Eulerian-Type-Path-Neighbor. A Neutrosophic k-Variable E has a number is called 5959
Neutrosophic Variance if the following expression is called Neutrosophic Variance 5960
criteria 5961
2
V x(E) = Ex((X − Ex(X)) ).
Consider S = (V, E) is a probability Eulerian-Type-Path-Neighbor. Let X be a Neutrosophic Variable 5963
and let t be a positive real number. Then 5964
V (X)
E(|X − Ex(X)| ≥ t) ≤ .
t2

S = (V, E) is a probability Eulerian-Type-Path-Neighbor. Let X be a Neutrosophic Variable and let t 5966
be a positive real number. Then 5967
2
2 Ex((X − Ex(X)) ) V (X)
E(|X − Ex(X)| ≥ t) = E((X − Ex(X)) ≥ t2 ) ≤ 2
= .
t t2
5968
Consider S = (V, E) is a probability Eulerian-Type-Path-Neighbor. Let Xn be a Neutrosophic Variable 5970
in a probability Eulerian-Type-Path-Neighbor (Vn , En ), n ≥ 1. If Ex(Xn ) 6= 0 and V (Xn ) << E 2 (Xn ), 5971
then 5972
E(Xn = 0) → 0 as n → ∞
S = (V, E) is a probability Eulerian-Type-Path-Neighbor. Set X := Xn and t := |Ex(Xn )| in 5974
Chebyshev’s Inequality, and observe that E(Xn = 0) ≤ E(|Xn − Ex(Xn )| ≥ |Ex(Xn )|) because 5975
|Xn − Ex(Xn )| = |Ex(Xn )| when Xn = 0. 5976
Consider S = (V, E) is a probability Eulerian-Type-Path-Neighbor. Let G ∈ Gn,1/2 . For 0 ≤ k ≤ n, set 5978
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 5979
one. Then almost surely α(G) takes one of the three values k ∗ − 2, k ∗ − 1, k ∗ . 5980
S = (V, E) is a probability Eulerian-Type-Path-Neighbor. As in the proof of related Theorem, the 5982
result is straightforward. 5983
Consider S = (V, E) is a probability Eulerian-Type-Path-Neighbor. Let G ∈ Gn,1/2 and let f and k ∗ be 5985
as defined in previous Theorem. Then either: 5986
(i). f (k ∗ ) << 1, in which case almost surely α(G) is equal to either k ∗ − 2 or k ∗ − 1, or 5987
(ii). f (k ∗ − 1) >> 1, in which case almost surely α(G) is equal to either k ∗ − 1 or k ∗ . 5988
Definition 30.0.17. (Neutrosophic Threshold). 5991

is a probability Eulerian-Type-Path-Neighbor. Let P be a monotone property of SuperHyperGraphs 5993
(one which is preserved when SuperHyperEdges are added). Then a Neutrosophic Threshold 5994
for P is a function f (n) such that: 5995
(i). if p << f (n), then G ∈ Gn,p almost surely does not have P, 5996
(ii). if p >> f (n), then G ∈ Gn,p almost surely has P. 5997

Definition 30.0.18. (Neutrosophic Balanced). 5998

is a probability Eulerian-Type-Path-Neighbor. Let F be a fixed Neutrosophic SuperHyperGraph. Then 6000
there is a threshold function for the property of containing a copy of F as a Neutrosophic 6001
SubSuperHyperGraph is called Neutrosophic Balanced. 6002
Theorem 30.0.19. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = 6003

(V, E). Consider S = (V, E) is a probability Eulerian-Type-Path-Neighbor. Let F be a nonempty 6004
balanced Neutrosophic SubSuperHyperGraph with k SuperHyperVertices and l SuperHyperEdges. 6005
Then n−k/l is a threshold function for the property of containing F as a Neutrosophic 6006
SubSuperHyperGraph. 6007
136EXM1 Example 30.0.20. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E) 6010
in the mentioned Neutrosophic Figures in every Neutrosophic items. 6011
• On the Figure (30.1), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 6012

SuperHyperEulerian-Type-Path-Neighbor, is up. The Neutrosophic Algorithm is Neutrosophicly 6013
straightforward. E1 and E3 are some empty Neutrosophic SuperHyperEdges but E2 6014
is a loop Neutrosophic SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. 6015

Thus in the terms of Neutrosophic SuperHyperNeighbor, there’s only one Neutrosophic 6016
SuperHyperEdge, namely, E4 . The Neutrosophic SuperHyperVertex, V3 is Neutrosophic 6017
isolated means that there’s no Neutrosophic SuperHyperEdge has it as a Neutrosophic 6018
endpoint. Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in every given 6019
Neutrosophic SuperHyperEulerian-Type-Path-Neighbor. 6020
C(N SHG)Neutrosophic Eulerian-Type-Path-Neighbor

= {E4 }.
C(N SHG)Neutrosophic Eulerian-Type-Path-Neighbor SuperHyperPolynomial
= z3.
C(N SHG)Neutrosophic V-Eulerian-Type-Path-Neighbor
= {V1 , V2 , V4 }.
C(N SHG)Neutrosophic V-Eulerian-Type-Path-Neighbor SuperHyperPolynomial
= z 5 + 2z 3 .
6021

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

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

Neutrosophic SuperHyperEulerian-Type-Path-Neighbor in the Neutrosophic Example (42.0.3) 136NSHG1
SuperHyperVertex, V3 , is excluded in every given Neutrosophic SuperHyperEulerian-Type- 6029

Path-Neighbor. 6030

= {E4 }.
= z3.
= {V1 , V2 , V4 }.
= z 5 + z 3 + z.
6031


= {E4 }.
= z3.
= {V1 , V2 , V3 }.



= z8 + z4 + z3.
6035


= {E1 }.
= z3.
= {V3 }.
= z2.
6039






= {Ei }.
= z5.
= {V5 }.
= z7.
6043


= {Ei }.
= z2.



= {Vi }.
= z6.
6047


= {E17 }.
= z5.
= {V14 }.
= z5.
6051




= {E4 }.
= z3.
= {V14 }.
= z5.
6055


= {E23 }.


= z 11 .
= {V17 }.
= z5.
6059


= {E3 }.
= z5.
= {V14 }.
= z5.
6063







= {E1 }.
= z3.
= {V1 }.
= z5.
6067


= {E1 }.


= z5.
= {V8 }
= z8.
6071


= {E1 }.
= z2.
= {V1 }.
= z5.
6075




= {E1 }.
= z2.
= {V1 }.
= z5.
6079


= {E1 }.


= z2.
= {V1 }.
= z5.
6083


= {Ei ∈ EN SHG }.



= {Vi ∈ VN SHG }.
6087


= {Ei ∈ EN SHG }.
= {Vi ∈ VN SHG }.
6091







= {Ei ∈ EN SHG }.
= {Vi ∈ VN SHG }.
6095


= {Ei ∈ EN SHG }.



= {Vi ∈ VN SHG }.
6099


= {Ei ∈ EN SHG }.
= {Vi ∈ VN SHG }.


6103


= {E2 }.
= z 10 .
= {V2 , {R}, {M6 }, {L6 }, {F }, {P }, {J}, {M }, V1 , V3 }.
= z 5 + 2z 3 + 7z.
6107


Neutrosophic SuperHyperEulerian-Type-Path-Neighbor in the Neutrosophic Example (42.0.3) 95NHG1

= {Ei ∈ EN SHG \ {E1 }}.
= z |Ei ∈EN SHG \{E1 }| .
= {Vi ∈ VN SHG \ {VE1 }}.
= z |Vi ∈VN SHG \{VE1 }| .
6111
Proposition 30.0.21. Assume a connected Neutrosophic SuperHyperGraph ESHG : (V, E). The 6112
all interior Neutrosophic SuperHyperVertices belong to any Neutrosophic quasi-R-Eulerian-Type-Path- 6113


Neutrosophic SuperHyperEulerian-Type-Path-Neighbor in the Neutrosophic Example (42.0.3) 95NHG2
Neighbor if for any of them, and any of other corresponded Neutrosophic SuperHyperVertex, some 6114
interior Neutrosophic SuperHyperVertices are mutually Neutrosophic SuperHyperNeighbors with 6115
no Neutrosophic exception at all minus all Neutrosophic SuperHypeNeighbors to any amount of 6116
them. 6117
Proposition 30.0.22. Assume a connected non-obvious Neutrosophic SuperHyperGraph ESHG : 6118
(V, E). There’s only one Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) has only the maximum 6119
possibilities of the distinct interior Neutrosophic SuperHyperVertices inside of any given 6120
Neutrosophic quasi-R-Eulerian-Type-Path-Neighbor minus all Neutrosophic SuperHypeNeighbor to some 6121
of them but not all of them. In other words, there’s only an unique Neutrosophic SuperHyperEdge 6122
E ∈ EESHG:(V,E) has only two distinct Neutrosophic SuperHyperVertices in an Neutrosophic 6123
quasi-R-Eulerian-Type-Path-Neighbor, minus all Neutrosophic SuperHypeNeighbor to some of them but 6124
not all of them. 6125
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-Eulerian-Type-Path-Neighbor is at least
V \ (V \ {aE , bE , cE , . . . , zE }).
It’s straightforward that the Neutrosophic cardinality of the Neutrosophic R-Eulerian-Type-Path- 6126
Neighbor is at least the maximum Neutrosophic number of Neutrosophic SuperHyperVertices 6127
of the Neutrosophic SuperHyperEdges with the maximum number of the Neutrosophic 6128
SuperHyperEdges. In other words, the maximum number of the Neutrosophic SuperHyperEdges 6129
contains the maximum Neutrosophic number of Neutrosophic SuperHyperVertices are renamed to 6130

Neutrosophic Eulerian-Type-Path-Neighbor in some cases but the maximum number of the Neutrosophic 6131
SuperHyperEdge with the maximum Neutrosophic number of Neutrosophic SuperHyperVertices, 6132
has the Neutrosophic SuperHyperVertices are contained in a Neutrosophic R-Eulerian-Type-Path- 6133
Neighbor. 6134
Proposition 30.0.24. Assume a simple Neutrosophic SuperHyperGraph ESHG : (V, E). Then
the Neutrosophic number of type-result-R-Eulerian-Type-Path-Neighbor 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-Eulerian-Type-Path-Neighbor with the least Neutrosophic 6135

cardinality, the lower sharp Neutrosophic bound for cardinality. 6136
Proposition 30.0.25. Assume a connected loopless Neutrosophic SuperHyperGraph ESHG : 6137

(V, E). Then in the worst case, literally, 6138
C(N SHG)N eutrosophicQuasi−Eulerian−T ype−P ath−N eighbor

= {V1 , E1 , V2 , E2 , V3 , E3 , V4 , E4 , V1 }.
C(N SHG)N eutrosophicQuasi−Eulerian−T ype−P ath−N eighborSuperHyperP olynomial = z 4 .
C(N SHG)N eutrosophicQuasi−Eulerian−T ype−P ath−N eighbor = {V1 , V2 , V3 , V4 , V1 }.
C(N SHG)N eutrosophicR−Quasi−Eulerian−T ype−P ath−N eighborSuperHyperP olynomial = z 5 .
Is a Neutrosophic type-result-Eulerian-Type-Path-Neighbor. In other words, the least cardinality, the 6139

lower sharp bound for the cardinality, of a Neutrosophic type-result-Eulerian-Type-Path-Neighbor is the 6140
cardinality of 6141

= {V1 , E1 , V2 , E2 , V3 , E3 , V4 , E4 , V1 }.
C(N SHG)N eutrosophicQuasi−Eulerian−T ype−P ath−N eighborSuperHyperP olynomial = z 4 .
C(N SHG)N eutrosophicQuasi−Eulerian−T ype−P ath−N eighbor = {V1 , V2 , V3 , V4 , V1 }.
C(N SHG)N eutrosophicR−Quasi−Eulerian−T ype−P ath−N eighborSuperHyperP 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-Eulerian-Type-Path-Neighbor
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-Eulerian-Type-Path-Neighbor. In other words, the least cardinality, the lower sharp bound
for the cardinality, of a quasi-R-Eulerian-Type-Path-Neighbor 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-Eulerian-Type-Path-Neighbor. 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-Eulerian-Type-Path-Neighbor 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-Eulerian-Type-Path-Neighbor. 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-Eulerian-Type-Path-Neighbor
has the Neutrosophic cardinality of a Neutrosophic SuperHyperEdge. Thus, a Neutrosophic R-
Eulerian-Type-Path-Neighbor has the Neutrosophic cardinality at least a Neutrosophic SuperHyperEdge.
Assume a Neutrosophic SuperHyperSet V \ V \ {z}. This Neutrosophic SuperHyperSet isn’t a
Neutrosophic R-Eulerian-Type-Path-Neighbor 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-Eulerian-Type-Path-Neighbor” 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-Eulerian-Type-Path-Neighbor 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-Eulerian-Type-Path-Neighbor 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-Eulerian-Type-Path-
Neighbor. Those Neutrosophic SuperHyperVertices are potentially included in a Neutrosophic
style-R-Eulerian-Type-Path-Neighbor. 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-Eulerian-Type-Path-Neighbor is
{aE , bE , cE , . . . , zE } .
This definition coincides with the definition of the Neutrosophic R-Eulerian-Type-Path-Neighbor 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-Eulerian-Type-Path-Neighbor. 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, 6142
Neutrosophic R-Eulerian-Type-Path-Neighbor =
E
{Z1 , Z2 , . . . , Zz | ∀i 6= j, i, j = 1, 2, . . . , z, ∃Ex , Zi ∼x Zj , }.
6143
Neutrosophic R-Eulerian-Type-Path-Neighbor =
Thus E ∈ EESHG:(V,E) is a Neutrosophic quasi-R-Eulerian-Type-Path-Neighbor where E ∈ EESHG:(V,E)

is fixed that means Ex = E ∈ EESHG:(V,E) . for all Neutrosophic intended SuperHyperVertices
but in a Neutrosophic Eulerian-Type-Path-Neighbor, 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-Eulerian-Type-Path-Neighbor is at least
V \ (V \ {aE , bE , cE , . . . , zE }).
It’s straightforward that the Neutrosophic cardinality of the Neutrosophic R-Eulerian-Type-Path- 6144
Neighboris at least the maximum Neutrosophic number of Neutrosophic SuperHyperVertices of 6145
the Neutrosophic SuperHyperEdges with the maximum number of the Neutrosophic SuperHy- 6146
perEdges. In other words, the maximum number of the Neutrosophic SuperHyperEdges contains 6147

the maximum Neutrosophic number of Neutrosophic SuperHyperVertices are renamed to Neut- 6148
rosophic Eulerian-Type-Path-Neighbor in some cases but the maximum number of the Neutrosophic 6149
SuperHyperEdge with the maximum Neutrosophic number of Neutrosophic SuperHyperVertices, 6150
has the Neutrosophic SuperHyperVertices are contained in a Neutrosophic R-Eulerian-Type-Path- 6151
Neighbor. 6152
The obvious SuperHyperGraph has no Neutrosophic SuperHyperEdges. But the non-obvious 6153
Neutrosophic SuperHyperModel is up. The quasi-SuperHyperModel addresses some issues 6154

about the Neutrosophic optimal SuperHyperObject. It specially delivers some remarks on 6155
the Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices such that there’s 6156
distinct amount of Neutrosophic SuperHyperEdges for distinct amount of Neutrosophic Supe- 6157
rHyperVertices up to all taken from that Neutrosophic SuperHyperSet of the Neutrosophic 6158
SuperHyperVertices but this Neutrosophic SuperHyperSet of the Neutrosophic SuperHyper- 6159
Vertices is either has the maximum Neutrosophic SuperHyperCardinality or it doesn’t have 6160
maximum Neutrosophic SuperHyperCardinality. In a non-obvious SuperHyperModel, there’s 6161
at least one Neutrosophic SuperHyperEdge containing at least all Neutrosophic SuperHyper- 6162
Vertices. Thus it forms a Neutrosophic quasi-R-Eulerian-Type-Path-Neighbor where the Neutrosophic 6163
completion of the Neutrosophic incidence is up in that. Thus it’s, literarily, a Neutrosophic 6164
embedded R-Eulerian-Type-Path-Neighbor. The SuperHyperNotions of embedded SuperHyperSet and 6165
quasi-SuperHyperSet coincide. In the original setting, these types of SuperHyperSets only 6166
don’t satisfy on the maximum SuperHyperCardinality. Thus the embedded setting is elected 6167
such that those SuperHyperSets have the maximum Neutrosophic SuperHyperCardinality and 6168
they’re Neutrosophic SuperHyperOptimal. The less than two distinct types of Neutrosophic 6169
SuperHyperVertices are included in the minimum Neutrosophic style of the embedded Neutro- 6170
sophic R-Eulerian-Type-Path-Neighbor. The interior types of the Neutrosophic SuperHyperVertices 6171
are deciders. Since the Neutrosophic number of SuperHyperNeighbors are only affected by 6172
the interior Neutrosophic SuperHyperVertices. The common connections, more precise and 6173
more formal, the perfect unique connections inside the Neutrosophic SuperHyperSet for any 6174
distinct types of Neutrosophic SuperHyperVertices pose the Neutrosophic R-Eulerian-Type-Path- 6175
Neighbor. Thus Neutrosophic exterior SuperHyperVertices could be used only in one Neutrosophic 6176
SuperHyperEdge and in Neutrosophic SuperHyperRelation with the interior Neutrosophic 6177
SuperHyperVertices in that Neutrosophic SuperHyperEdge. In the embedded Neutrosophic 6178

Eulerian-Type-Path-Neighbor, there’s the usage of exterior Neutrosophic SuperHyperVertices since 6179
they’ve more connections inside more than outside. Thus the title “exterior” is more relevant 6180
than the title “interior”. One Neutrosophic SuperHyperVertex has no connection, inside. Thus, 6181
the Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices with one SuperHyper- 6182
Element has been ignored in the exploring to lead on the optimal case implying the Neutrosophic 6183
R-Eulerian-Type-Path-Neighbor. The Neutrosophic R-Eulerian-Type-Path-Neighbor with the exclusion of the 6184
exclusion of all Neutrosophic SuperHyperVertices in one Neutrosophic SuperHyperEdge and with 6185
other terms, the Neutrosophic R-Eulerian-Type-Path-Neighbor with the inclusion of all Neutrosophic 6186
SuperHyperVertices in one Neutrosophic SuperHyperEdge, is a Neutrosophic quasi-R-Eulerian- 6187
Type-Path-Neighbor. To sum them up, in a connected non-obvious Neutrosophic SuperHyperGraph 6188
ESHG : (V, E). There’s only one Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) has only the 6189
maximum possibilities of the distinct interior Neutrosophic SuperHyperVertices inside of any 6190
given Neutrosophic quasi-R-Eulerian-Type-Path-Neighbor minus all Neutrosophic SuperHypeNeighbor 6191
to some of them but not all of them. In other words, there’s only an unique Neutrosophic 6192
SuperHyperEdge E ∈ EESHG:(V,E) has only two distinct Neutrosophic SuperHyperVertices in 6193

an Neutrosophic quasi-R-Eulerian-Type-Path-Neighbor, minus all Neutrosophic SuperHypeNeighbor to 6194

some of them but not all of them. 6195
The main definition of the Neutrosophic R-Eulerian-Type-Path-Neighbor has two titles. a Neut- 6196
rosophic quasi-R-Eulerian-Type-Path-Neighbor and its corresponded quasi-maximum Neutrosophic 6197
R-SuperHyperCardinality are two titles in the terms of quasi-R-styles. For any Neutro- 6198
sophic number, there’s a Neutrosophic quasi-R-Eulerian-Type-Path-Neighbor with that quasi-maximum 6199
Neutrosophic SuperHyperCardinality in the terms of the embedded Neutrosophic SuperHy- 6200

perGraph. If there’s an embedded Neutrosophic SuperHyperGraph, then the Neutrosophic 6201
quasi-SuperHyperNotions lead us to take the collection of all the Neutrosophic quasi-R-Eulerian- 6202
Type-Path-Neighbors for all Neutrosophic numbers less than its Neutrosophic corresponded maximum 6203
number. The essence of the Neutrosophic Eulerian-Type-Path-Neighbor ends up but this essence starts 6204
up in the terms of the Neutrosophic quasi-R-Eulerian-Type-Path-Neighbor, again and more in the 6205
operations of collecting all the Neutrosophic quasi-R-Eulerian-Type-Path-Neighbors acted on the all 6206
possible used formations of the Neutrosophic SuperHyperGraph to achieve one Neutrosophic 6207
number. This Neutrosophic number is 6208
considered as the equivalence class for all corresponded quasi-R-Eulerian-Type-Path-Neighbors. Let 6209
zNeutrosophic Number , SNeutrosophic SuperHyperSet and GNeutrosophic Eulerian-Type-Path-Neighbor be a Neut- 6210
rosophic number, a Neutrosophic SuperHyperSet and a Neutrosophic Eulerian-Type-Path-Neighbor. 6211
Then 6212
[zNeutrosophic Number ]Neutrosophic Class = {SNeutrosophic SuperHyperSet |

SNeutrosophic SuperHyperSet = GNeutrosophic Eulerian-Type-Path-Neighbor ,
|SNeutrosophic SuperHyperSet |Neutrosophic Cardinality
= zNeutrosophic Number }.
As its consequences, the formal definition of the Neutrosophic Eulerian-Type-Path-Neighbor is re- 6213
formalized and redefined as follows. 6214
GNeutrosophic Eulerian-Type-Path-Neighbor ∈ ∪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 6215
definition for the Neutrosophic Eulerian-Type-Path-Neighbor. 6216
GNeutrosophic Eulerian-Type-Path-Neighbor =
{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 Eulerian- 6217
poses the upcoming expressions.
{S ∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class |
To translate the statement to this mathematical literature, the formulae will be revised. 6219
= max zNeutrosophic Number

And then, 6220

To get more visions in the closer look-up, there’s an overall overlook. 6221
GNeutrosophic Eulerian-Type-Path-Neighbor ∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class =


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


6223
[zNeutrosophic
Number ]Neutrosophic Class

6224

Now, the extension of these types of approaches is up. Since the new term, “Neutrosophic 6225
SuperHyperNeighborhood”, could be redefined as the collection of the Neutrosophic Supe- 6226
rHyperVertices such that any amount of its Neutrosophic SuperHyperVertices are incident 6227
to a Neutrosophic SuperHyperEdge. It’s, literarily, another name for “Neutrosophic Quasi- 6228
Eulerian-Type-Path-Neighbor” but, precisely, it’s the generalization of “Neutrosophic Quasi-Eulerian-Type- 6229
Path-Neighbor” since “Neutrosophic Quasi-Eulerian-Type-Path-Neighbor” happens “Neutrosophic Eulerian- 6230
Type-Path-Neighbor” in a Neutrosophic SuperHyperGraph as initial framework and background 6231
but “Neutrosophic SuperHyperNeighborhood” may not happens “Neutrosophic Eulerian-Type-Path- 6232
Neighbor” in a Neutrosophic SuperHyperGraph as initial framework and preliminarily background 6233

since there are some ambiguities about the Neutrosophic SuperHyperCardinality arise from it. 6234
To get orderly keywords, the terms, “Neutrosophic SuperHyperNeighborhood”, “Neutrosophic 6235
Quasi-Eulerian-Type-Path-Neighbor”, and “Neutrosophic Eulerian-Type-Path-Neighbor” are up. 6236
Thus, let 6237
zNeutrosophic Number , NNeutrosophic SuperHyperNeighborhood and 6238

GNeutrosophic Eulerian-Type-Path-Neighbor be a Neutrosophic number, a Neutrosophic SuperHyper- 6239
Neighborhood and a Neutrosophic Eulerian-Type-Path-Neighbor and the new terms are up. 6240
GNeutrosophic Eulerian-Type-Path-Neighbor ∈ ∪zNeutrosophic Number

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

6242
∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class |
6243
And with go back to initial structure, 6244
GNeutrosophic Eulerian-Type-Path-Neighbor ∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class =


6245
∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class =

6246


6247

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

The Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices,
Is an Neutrosophic R-Eulerian-Type-Path-Neighbor 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 Eulerian-Type-Path-Neighbor 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 Eulerian-Type-Path-Neighbor is up. The obvious
simple Neutrosophic type-SuperHyperSet called the Neutrosophic Eulerian-Type-Path-Neighbor 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-Eulerian-Type-Path-Neighbor is up. To sum
them up, the Neutrosophic SuperHyperSet of Neutrosophic SuperHyperVertices,
Is the non-obvious simple Neutrosophic type-SuperHyperSet of the Neutrosophic R-Eulerian-Type-

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

amid those obvious[non-obvious] simple Neutrosophic type-SuperHyperSets called the 6253
Neutrosophic R-Eulerian-Type-Path-Neighbor, 6254
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-Eulerian-Type-Path-Neighbor amid those obvious simple Neutrosophic type-
SuperHyperSets of the Neutrosophic Eulerian-Type-Path-Neighbor, 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-Eulerian-Type-Path-Neighbor. In other words, the least cardinality, the lower

sharp bound for the cardinality, of a Neutrosophic R-Eulerian-Type-Path-Neighbor is the cardinality of
6255
To sum them up, in a connected Neutrosophic SuperHyperGraph ESHG : (V, E). The all 6256
interior Neutrosophic SuperHyperVertices belong to any Neutrosophic quasi-R-Eulerian-Type-Path- 6257
Neighbor if for any of them, and any of other corresponded Neutrosophic SuperHyperVertex, some 6258
interior Neutrosophic SuperHyperVertices are mutually Neutrosophic SuperHyperNeighbors 6259
with no Neutrosophic exception at all minus all Neutrosophic SuperHypeNeighbors to any 6260
amount of them. 6261
Assume a connected Neutrosophic SuperHyperGraph ESHG : (V, E). Let a Neutrosophic Supe- 6262
rHyperEdge ESHE : E ∈ EESHG:(V,E) has some Neutrosophic SuperHyperVertices r. Consider 6263
all Neutrosophic numbers of those Neutrosophic SuperHyperVertices from that Neutrosophic 6264
SuperHyperEdge excluding excluding more than r distinct Neutrosophic SuperHyperVertices, 6265
exclude to any given Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices. 6266
Consider there’s a Neutrosophic R-Eulerian-Type-Path-Neighbor with the least cardinality, the lower 6267
sharp Neutrosophic bound for Neutrosophic cardinality. Assume a connected Neutrosophic 6268
SuperHyperGraph ESHG : (V, E). The Neutrosophic SuperHyperSet of the Neutrosophic 6269
SuperHyperVertices VESHE \ {z} is a Neutrosophic SuperHyperSet S of the Neutrosophic Su- 6270
perHyperVertices such that there’s a Neutrosophic SuperHyperEdge to have some Neutrosophic 6271
SuperHyperVertices uniquely but it isn’t a Neutrosophic R-Eulerian-Type-Path-Neighbor. Since it 6272
doesn’t have 6273
6274

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

rosophic SuperHyperVertices such that there’s a Neutrosophic SuperHyperEdge to have some 6276
SuperHyperVertices uniquely. The Neutrosophic SuperHyperSet of the Neutrosophic Supe- 6277
rHyperVertices VESHE ∪ {z} is the maximum Neutrosophic cardinality of a Neutrosophic 6278
SuperHyperSet S of Neutrosophic SuperHyperVertices but it isn’t a Neutrosophic R-Eulerian- 6279
Type-Path-Neighbor. Since it doesn’t do the Neutrosophic procedure such that such that there’s a 6280
Neutrosophic SuperHyperEdge to have some Neutrosophic SuperHyperVertices uniquely [there 6281

are at least one Neutrosophic SuperHyperVertex outside implying there’s, sometimes in the 6282
connected Neutrosophic SuperHyperGraph ESHG : (V, E), a Neutrosophic SuperHyperVertex, 6283
titled its Neutrosophic SuperHyperNeighbor, to that Neutrosophic SuperHyperVertex in the 6284
Neutrosophic SuperHyperSet S so as S doesn’t do “the Neutrosophic procedure”.]. There’s 6285
only one Neutrosophic SuperHyperVertex outside the intended Neutrosophic SuperHyperSet, 6286
VESHE ∪ {z}, in the terms of Neutrosophic SuperHyperNeighborhood. Thus the obvious 6287
Neutrosophic R-Eulerian-Type-Path-Neighbor, VESHE is up. The obvious simple Neutrosophic type- 6288
SuperHyperSet of the Neutrosophic R-Eulerian-Type-Path-Neighbor, VESHE , is a Neutrosophic Super- 6289
HyperSet, VESHE , includes only all Neutrosophic SuperHyperVertices does forms any kind of 6290
Neutrosophic pairs are titled Neutrosophic SuperHyperNeighbors in a connected Neutrosophic 6291
SuperHyperGraph ESHG : (V, E). Since the Neutrosophic SuperHyperSet of the Neutrosophic 6292
SuperHyperVertices VESHE , is the maximum Neutrosophic SuperHyperCardinality of 6293

a Neutrosophic SuperHyperSet S of Neutrosophic SuperHyperVertices such that there’s 6294
a Neutrosophic SuperHyperEdge to have some Neutrosophic SuperHyperVertices uniquely. 6295
Thus, in a connected Neutrosophic SuperHyperGraph ESHG : (V, E). Any Neutrosophic 6296
R-Eulerian-Type-Path-Neighbor only contains all interior Neutrosophic SuperHyperVertices and all 6297
exterior Neutrosophic SuperHyperVertices from the unique Neutrosophic SuperHyperEdge 6298
where there’s any of them has all possible Neutrosophic SuperHyperNeighbors in and there’s all 6299
Neutrosophic SuperHyperNeighborhoods in with no exception minus all Neutrosophic SuperHy- 6300
peNeighbors to some of them not all of them but everything is possible about Neutrosophic 6301
SuperHyperNeighborhoods and Neutrosophic SuperHyperNeighbors out. 6302
The SuperHyperNotion, namely, Eulerian-Type-Path-Neighbor, is up. There’s neither empty SuperHy- 6303
perEdge nor loop SuperHyperEdge. The following Neutrosophic SuperHyperSet of Neutrosophic 6304
SuperHyperEdges[SuperHyperVertices] is the simple Neutrosophic type-SuperHyperSet of 6305

the Neutrosophic Eulerian-Type-Path-Neighbor. The Neutrosophic SuperHyperSet of Neutrosophic 6306
SuperHyperEdges[SuperHyperVertices], 6307

|EESHG:(V,E) |Neutrosophic Cardinality
b c
= {E2i−1 }i=1 2
.
C(N SHG)N eutrosophicQuasi−Eulerian−T ype−P ath−N eighborSuperHyperP olynomial
= 2z b 2 c
.
C(N SHG)N eutrosophicR−Quasi−Eulerian−T ype−P ath−N eighbor = {Vi }si=1 , {Vj }tj=1 .
C(N SHG)N eutrosophicR−Quasi−Eulerian−T ype−P ath−N eighborSuperHyperP olynomial
= az s + bz t .
is the simple Neutrosophic type-SuperHyperSet of the Neutrosophic Eulerian-Type-Path-Neighbor. The 6308

Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperEdges[SuperHyperVertices], 6309

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Is an Neutrosophic Eulerian-Type-Path-Neighbor C(ESHG) for an Neutrosophic SuperHyper- 6310

Graph ESHG : (V, E) is a Neutrosophic type-SuperHyperSet with 6311
6312
rosophic SuperHyperEdges[SuperHyperVertices] such that there’s no Neutrosophic Super- 6314
HyperVertex of a Neutrosophic SuperHyperEdge is common and there’s an Neutrosophic 6315
SuperHyperEdge for all Neutrosophic SuperHyperVertices. There are not only two Neut- 6316
rosophic SuperHyperVertices inside the intended Neutrosophic SuperHyperSet. Thus the 6317
non-obvious Neutrosophic Eulerian-Type-Path-Neighbor is up. The obvious simple Neutrosophic type- 6318
SuperHyperSet called the Neutrosophic Eulerian-Type-Path-Neighbor is a Neutrosophic SuperHyperSet 6319
includes only two Neutrosophic SuperHyperVertices. But the Neutrosophic SuperHyperSet of 6320
the Neutrosophic SuperHyperEdges[SuperHyperVertices], 6321

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 SuperHy- 6322
perSet. Thus the non-obvious simple Neutrosophic type-SuperHyperSet of the Neutrosophic 6323
Eulerian-Type-Path-Neighbor is up. To sum them up, the Neutrosophic SuperHyperSet of the Neutro- 6324
sophic SuperHyperEdges[SuperHyperVertices], 6325

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 Eulerian- 6326

. Since the Neutrosophic SuperHyperSet of the Neutrosophic SuperHy-

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Is an Neutrosophic Eulerian-Type-Path-Neighbor C(ESHG) for an Neutrosophic SuperHyperGraph 6329
ESHG : (V, E) is the Neutrosophic SuperHyperSet S of Neutrosophic SuperHyperVertices such 6330

that there’s no a Neutrosophic SuperHyperEdge for some Neutrosophic SuperHyperVertices 6331
given by that Neutrosophic type-SuperHyperSet called the Neutrosophic Eulerian-Type-Path-Neighbor 6332
and it’s an Neutrosophic Eulerian-Type-Path-Neighbor. Since it’s 6333
6334
rosophic SuperHyperEdges[SuperHyperVertices] such that there’s no Neutrosophic Super- 6336

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

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Thus the non-obvious Neutrosophic Eulerian-Type-Path-Neighbor , 6340

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 Eulerian-Type- 6341
, not:
Path-Neighbor 6342

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

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- 6344
HyperGraph ESHG : (V, E). It’s interesting to mention that the only non-obvious simple 6345
Neutrosophic type-SuperHyperSet called the 6346
“Neutrosophic Eulerian-Type-Path-Neighbor ” 6347
amid those obvious[non-obvious] simple Neutrosophic type-SuperHyperSets called the 6348
Neutrosophic Eulerian-Type-Path-Neighbor , 6349
is only and only 6350

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


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

CHAPTER 31 6352
The Neutrosophic Departures on The 6353
Theoretical Results Toward Theoretical 6354
Motivations 6355
The previous Neutrosophic approach apply on the upcoming Neutrosophic results on Neutrosophic 6356
Proposition 31.0.1. Assume a connected Neutrosophic SuperHyperPath ESHP : (V, E). Then 6358

= {Ei ∈ EN SHG }.
= {Vi ∈ VN SHG }.
Proof. Let 6359
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V |EN SHG |
, E |EN SHG |
3 3
6360
P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
...,
EXT ERN AL
3 3
319
Figure 31.1: a Neutrosophic SuperHyperPath Associated to the Notions of Neutrosophic

be a longest path taken from a connected Neutrosophic SuperHyperPath ESHP : (V, E). 6361


136EXM18a Example 31.0.2. In the Figure (31.1), the connected Neutrosophic SuperHyperPath ESHP : 6366
(V, E), is highlighted and featured. The Neutrosophic SuperHyperSet, in the Neutrosophic 6367
SuperHyperModel (31.1), is the SuperHyperEulerian-Type-Path-Neighbor. 6368
Proposition 31.0.3. Assume a connected Neutrosophic SuperHyperCycle ESHC : (V, E). Then 6369

= {Ei ∈ EN SHG }.
= |EN SHG |z |Ei ∈EN SHG | .

= {Vi ∈ VN SHG }.
= |EN SHG |z |Vi ∈VN SHG | .
Proof. Let 6370
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V |EN SHG |
, E |EN SHG |
3 3
6371
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). 6372

136EXM19a Example 31.0.4. In the Figure (31.2), the connected Neutrosophic SuperHyperCycle N SHC : 6377
(V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, in the 6378
Neutrosophic SuperHyperModel (31.2), is the Neutrosophic SuperHyperEulerian-Type-Path-Neighbor. 6379
Proposition 31.0.5. Assume a connected Neutrosophic SuperHyperStar ESHS : (V, E). Then 6380

= {Ei }.
= z |Ei | .
= {VEEXT
i
ERN AL
}.
EXT ERN AL
= z |VEi |
.

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

Neutrosophic SuperHyperEulerian-Type-Path-Neighbor in the Neutrosophic Example (42.0.7) 136NSHG19a
Proof. Let 6381
P :
V1EXT ERN AL , E1 ,
CEN T ER, E2
6382
P :
E1 , V1EXT ERN AL ,
E2 , CEN T ER
be a longest path taken a connected Neutrosophic SuperHyperStar ESHS : (V, E). There’s a 6383


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

Neutrosophic SuperHyperEulerian-Type-Path-Neighbor in the Neutrosophic Example (42.0.9) 136NSHG20a
136EXM20a Example 31.0.6. In the Figure (31.3), the connected Neutrosophic SuperHyperStar ESHS : 6388
(V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, by the Algorithm 6389
in previous Neutrosophic result, of the Neutrosophic SuperHyperVertices of the connected 6390
Neutrosophic SuperHyperStar ESHS : (V, E), in the Neutrosophic SuperHyperModel (31.3), is 6391
the Neutrosophic SuperHyperEulerian-Type-Path-Neighbor. 6392
Proposition 31.0.7. Assume a connected Neutrosophic SuperHyperBipartite ESHB : (V, E). 6393
Then 6394

= {Ei ∈ PNmin
SHG }.
min
= {VEEXT
i ∈P
ERN AL
min }.
N SHG

|VEEXT ERN AL
∈P min
|
=z i N SHG .

Proof. Let 6395
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
j N SHG
6396
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). 6397


Neighbor could be applied. There are only two SuperHyperParts. Thus every SuperHyperPart 6403
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperEulerian-Type-Path-Neighbor taken from a connected Neutrosophic SuperHyper- 6405
Bipartite ESHB : (V, E). Thus only some SuperHyperVertices and only minimum-Neutrosophic- 6406
of-SuperHyperPart SuperHyperEdges are attained in any solution 6407
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
136EXM21a Example 31.0.8. In the Neutrosophic Figure (31.4), the connected Neutrosophic SuperHy- 6409
perBipartite ESHB : (V, E), is Neutrosophic highlighted and Neutrosophic featured. The 6410

Figure 31.4: Neutrosophic SuperHyperBipartite Neutrosophic Associated to the Neutrosophic

Notions of Neutrosophic SuperHyperEulerian-Type-Path-Neighbor in the Example (42.0.11) 136NSHG21a
obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous Neutrosophic 6411

result, of the Neutrosophic SuperHyperVertices of the connected Neutrosophic SuperHyper- 6412
Bipartite ESHB : (V, E), in the Neutrosophic SuperHyperModel (31.4), is the Neutrosophic 6413
Proposition 31.0.9. Assume a connected Neutrosophic SuperHyperMultipartite ESHM : (V, E). 6415
Then 6416

= {Ei ∈ PNmin
SHG }.
min
= {VEEXT
i ∈P
ERN AL
min }.
N SHG

|VEEXT ERN AL
∈P min
|
=z i N SHG .
Proof. Let 6417
P :
V1EXT ERN AL , E1 ,

V2EXT ERN AL , E2 ,
...,
EXT ERN AL
j N SHG
6418
P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
...,
EXT ERN AL
j N SHG
is a longest SuperHyperEulerian-Type-Path-Neighbor taken from a connected Neutrosophic SuperHy- 6419
perMultipartite ESHM : (V, E). There’s a new way to redefine as 6420


0
Neighbor could be applied. There are only z SuperHyperParts. Thus every SuperHyperPart 6425
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest path taken from a connected Neutrosophic SuperHyperMultipartite ESHM : (V, E). 6427
Thus only some SuperHyperVertices and only minimum-Neutrosophic-of-SuperHyperPart 6428
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
136EXM22a Example 31.0.10. In the Figure (31.5), the connected Neutrosophic SuperHyperMultipartite 6432
ESHM : (V, E), is highlighted and Neutrosophic featured. The obtained Neutrosophic 6433
SuperHyperSet, by the Algorithm in previous Neutrosophic result, of the Neutrosophic 6434
SuperHyperVertices of the connected Neutrosophic SuperHyperMultipartite ESHM : (V, E), 6435
in the Neutrosophic SuperHyperModel (31.5), is the Neutrosophic SuperHyperEulerian-Type-Path- 6436
Neighbor. 6437

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

Proposition 31.0.11. Assume a connected Neutrosophic SuperHyperWheel ESHW : (V, E). 6438
Then, 6439

= {Ei ∈ (EN SHG }.
= z |Ei ∈(EN SHG | .
= {V EXT ERN AL }.
EXT ERN AL
= z |V |
.
Proof. Let 6440
P :
CEN T ER, E2∗
6441
P :
E1∗ , V1EXT ERN AL ,
E2∗ , CEN T ER

Figure 31.6: a Neutrosophic SuperHyperWheel Neutrosophic Associated to the Neutrosophic

Notions of Neutrosophic SuperHyperEulerian-Type-Path-Neighbor in the Neutrosophic Example
(42.0.15) 136NSHG23a
is a longest SuperHyperEulerian-Type-Path-Neighbor taken from a connected Neutrosophic SuperHy- 6442
perWheel ESHW : (V, E). There’s a new way to redefine as 6443

straightforward. Then there’s at least one SuperHyperEulerian-Type-Path-Neighbor. Thus the notion 6446
of quasi isn’t up and the SuperHyperNotions based on SuperHyperEulerian-Type-Path-Neighbor 6447

could be applied. The unique embedded SuperHyperEulerian-Type-Path-Neighbor proposes some 6448
longest SuperHyperEulerian-Type-Path-Neighbor excerpt from some representatives. The latter is 6449
136EXM23a Example 31.0.12. In the Neutrosophic Figure (31.6), the connected Neutrosophic SuperHyper- 6451
Wheel N SHW : (V, E), is Neutrosophic highlighted and featured. The obtained Neutrosophic 6452
SuperHyperSet, by the Algorithm in previous result, of the Neutrosophic SuperHyperVer- 6453
tices of the connected Neutrosophic SuperHyperWheel ESHW : (V, E), in the Neutrosophic 6454
SuperHyperModel (31.6), is the Neutrosophic SuperHyperEulerian-Type-Path-Neighbor. 6455

CHAPTER 32 6456
The Surveys of Mathematical Sets On 6457
The Results But As The Initial Motivation 6458
For the SuperHyperEulerian-Type-Path-Neighbor, Neutrosophic SuperHyperEulerian-Type-Path-Neighbor, and 6459

the Neutrosophic SuperHyperEulerian-Type-Path-Neighbor, some general results are introduced. 6460
Remark 32.0.1. Let remind that the Neutrosophic SuperHyperEulerian-Type-Path-Neighbor is 6461

“redefined” on the positions of the alphabets. 6462
Corollary 32.0.2. Assume Neutrosophic SuperHyperEulerian-Type-Path-Neighbor. Then 6463
N eutrosophic SuperHyperEulerian − T ype − P ath − N eighbor =

{theSuperHyperEulerian − T ype − P ath − N eighborof theSuperHyperV ertices |
max |SuperHyperOf f ensive
SuperHyperEulerian − T ype − P ath − N eighbor
|N eutrosophiccardinalityamidthoseSuperHyperEulerian−T ype−P ath−N eighbor. }
plus one Neutrosophic SuperHypeNeighbor to one. Where σi is the unary operation on the 6464
SuperHyperVertices of the SuperHyperGraph to assign the determinacy, the indeterminacy and 6465
the neutrality, for i = 1, 2, 3, respectively. 6466
Corollary 32.0.3. Assume a Neutrosophic SuperHyperGraph on the same identical letter 6467
of the alphabet. Then the notion of Neutrosophic SuperHyperEulerian-Type-Path-Neighbor and 6468
SuperHyperEulerian-Type-Path-Neighbor coincide. 6469
Corollary 32.0.4. Assume a Neutrosophic SuperHyperGraph on the same identical letter of 6470
the alphabet. Then a conseNeighborive sequence of the SuperHyperVertices is a Neutrosophic 6471
SuperHyperEulerian-Type-Path-Neighbor if and only if it’s a SuperHyperEulerian-Type-Path-Neighbor. 6472
Corollary 32.0.5. Assume a Neutrosophic SuperHyperGraph on the same identical letter of 6473
the alphabet. Then a conseNeighborive sequence of the SuperHyperVertices is a strongest 6474
SuperHyperEulerian-Type-Path-Neighbor if and only if it’s a longest SuperHyperEulerian-Type-Path-Neighbor. 6475
Corollary 32.0.6. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph on the same 6476
identical letter of the alphabet. Then its Neutrosophic SuperHyperEulerian-Type-Path-Neighbor is its 6477
329
Corollary 32.0.7. Assume a Neutrosophic SuperHyperPath(-/SuperHyperEulerian-Type-Path-Neighbor, 6479

SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel) on the same 6480
identical letter of the alphabet. Then its Neutrosophic SuperHyperEulerian-Type-Path-Neighbor is its 6481
Corollary 32.0.8. Assume a Neutrosophic SuperHyperGraph. Then its Neutrosophic 6483

SuperHyperEulerian-Type-Path-Neighbor isn’t well-defined if and only if its SuperHyperEulerian-Type- 6484
Path-Neighbor isn’t well-defined. 6485
Corollary 32.0.9. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph. Then 6486

its Neutrosophic SuperHyperEulerian-Type-Path-Neighbor isn’t well-defined if and only if its 6487
SuperHyperEulerian-Type-Path-Neighbor isn’t well-defined. 6488
Corollary 32.0.10. Assume a Neutrosophic SuperHyperPath(-/SuperHyperEulerian-Type-Path- 6489

, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel).
Neighbor 6490
Then its Neutrosophic SuperHyperEulerian-Type-Path-Neighbor isn’t well-defined if and only if its 6491
SuperHyperEulerian-Type-Path-Neighbor isn’t well-defined. 6492
Corollary 32.0.11. Assume a Neutrosophic SuperHyperGraph. Then its Neutrosophic 6493

SuperHyperEulerian-Type-Path-Neighbor is well-defined if and only if its SuperHyperEulerian-Type-Path- 6494
Neighbor is well-defined. 6495
Corollary 32.0.12. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph. Then its 6496
Neutrosophic SuperHyperEulerian-Type-Path-Neighbor is well-defined if and only if its SuperHyperEulerian- 6497

Type-Path-Neighbor is well-defined. 6498
Corollary 32.0.13. Assume a Neutrosophic SuperHyperPath(-/SuperHyperEulerian-Type-Path-Neighbor, 6499

Neutrosophic SuperHyperEulerian-Type-Path-Neighbor is well-defined if and only if its SuperHyperEulerian- 6501
Type-Path-Neighbor is well-defined. 6502
Proposition 32.0.14. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. Then V is 6503
(i) : the dual SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 6504
(ii) : the strong dual SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 6505
(iii) : the connected dual SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 6506
(iv) : the δ-dual SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 6507
(v) : the strong δ-dual SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 6508
(vi) : the connected δ-dual SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor. 6509
Proposition 32.0.15. Let N T G : (V, E, σ, µ) be a Neutrosophic SuperHyperGraph. Then ∅ is 6510
(iii) : the connected defensive SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 6513

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

independent SuperHyperSet is 6518
(iii) : the connected SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 6521
Proposition 32.0.17. Let ESHG : (V, E) be a Neutrosophic SuperHyperUniform SuperHyper- 6525

Graph which is a SuperHyperEulerian-Type-Path-Neighbor/SuperHyperPath. Then V is a maximal 6526
(iv) : O(ESHG)-SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 6530
(v) : strong O(ESHG)-SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 6531
(vi) : connected O(ESHG)-SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 6532
Proposition 32.0.18. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is a 6534
SuperHyperUniform SuperHyperWheel. Then V is a maximal 6535
(iv) : O(ESHG)-dual SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 6539
(v) : strong O(ESHG)-dual SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 6540
(vi) : connected O(ESHG)-dual SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 6541
Graph which is a SuperHyperEulerian-Type-Path-Neighbor/SuperHyperPath. Then the number of 6544

(i) : the SuperHyperEulerian-Type-Path-Neighbor; 6545
(ii) : the SuperHyperEulerian-Type-Path-Neighbor; 6546
(iii) : the connected SuperHyperEulerian-Type-Path-Neighbor; 6547
(iv) : the O(ESHG)-SuperHyperEulerian-Type-Path-Neighbor; 6548
(v) : the strong O(ESHG)-SuperHyperEulerian-Type-Path-Neighbor; 6549
(vi) : the connected O(ESHG)-SuperHyperEulerian-Type-Path-Neighbor. 6550
coincide. 6552

Graph which is a SuperHyperWheel. Then the number of 6554
(i) : the dual SuperHyperEulerian-Type-Path-Neighbor; 6555
(ii) : the dual SuperHyperEulerian-Type-Path-Neighbor; 6556
(iii) : the dual connected SuperHyperEulerian-Type-Path-Neighbor; 6557
(iv) : the dual O(ESHG)-SuperHyperEulerian-Type-Path-Neighbor; 6558
(v) : the strong dual O(ESHG)-SuperHyperEulerian-Type-Path-Neighbor; 6559
(vi) : the connected dual O(ESHG)-SuperHyperEulerian-Type-Path-Neighbor. 6560
coincide. 6562
Proposition 32.0.21. Let ESHG : (V, E) be a Neutrosophic SuperHyperUniform SuperHy- 6563

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


Graph which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperCom- 6575
plete SuperHyperMultipartite. Then a SuperHyperSet contains the half of multiplying r with 6576
the number of all the SuperHyperEdges plus one of all the SuperHyperVertices in the biggest 6577
SuperHyperPart is a 6578
(iv) : δ-SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 6582
(v) : strong δ-SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 6583
(vi) : connected δ-SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor. 6584
Graph which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperCom- 6586

plete SuperHyperMultipartite. Then Then the number of 6587
O(ESHG)
O(ESHG)
O(ESHG)
is one and it’s only S, a SuperHyperSet contains [the SuperHyperCenter and] the half of 6594
multiplying r with the number of all the SuperHyperEdges plus one of all the SuperHyperVertices. 6595
Proposition 32.0.24. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. The number of 6597
connected component is |V − S| if there’s a SuperHyperSet which is a dual 6598
(iv) : SuperHyperEulerian-Type-Path-Neighbor; 6602

Proposition 32.0.25. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. Then the 6605
number is at most O(ESHG) and the Neutrosophic number is at most On (ESHG). 6606
Proposition 32.0.26. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is 6607
SuperHyperComplete. The number is O(ESHG:(V,E)) 2 + 1 and the Neutrosophic number is 6608

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


Proposition 32.0.27. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is ∅. The 6616
number is 0 and the Neutrosophic number is 0, for an independent SuperHyperSet in the setting 6617
of dual 6618
(iv) : 0-SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 6622

SuperHyperComplete. Then there’s no independent SuperHyperSet. 6626

SuperHyperEulerian-Type-Path-Neighbor/SuperHyperPath/SuperHyperWheel. The number is O(ESHG : 6628
(V, E)) and the Neutrosophic number is On (ESHG : (V, E)), in the setting of a dual 6629
(iv) : O(ESHG : (V, E))-SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 6633
(v) : strong O(ESHG : (V, E))-SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor; 6634
(vi) : connected O(ESHG : (V, E))-SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor. 6635


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


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

dual SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor, then ∀v ∈ V \ S, ∃x ∈ S such that 6651
(i) v ∈ Ns (x); 6652
(ii) vx ∈ E. 6653
Proposition 32.0.33. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph. If S is 6654

a dual SuperHyperDefensive SuperHyperEulerian-Type-Path-Neighbor, then 6655
(i) S is SuperHyperEulerian-Type-Path-Neighbor set; 6656
(ii) there’s S ⊆ S 0 such that |S 0 | is SuperHyperChromatic number. 6657
Proposition 32.0.34. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph. Then 6658
(i) Γ ≤ O; 6659
(ii) Γs ≤ On . 6660
Proposition 32.0.35. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph which is 6661
connected. Then 6662
(i) Γ ≤ O − 1; 6663
(ii) Γs ≤ On − Σ3i=1 σi (x). 6664
Proposition 32.0.36. Let ESHG : (V, E) be an odd SuperHyperPath. Then 6665

(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· ,vn−1 } Σ3i=1 σi (s)}; 6669
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn−1 } and S2 = {v1 , v3 , · · · , vn−1 } are only a dual 6670
Proposition 32.0.37. Let ESHG : (V, E) be an even SuperHyperPath. Then 6672
(i) the set S = {v2 , v4 , · · · .vn } is a dual SuperHyperDefensive SuperHyperEulerian-Type-Path- 6673

Neighbor; 6674
(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · .vn } and {v1 , v3 , · · · .vn−1 }; 6675
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 6676
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 6677
Proposition 32.0.38. Let ESHG : (V, E) be an even SuperHyperEulerian-Type-Path-Neighbor. Then 6679
(i) the SuperHyperSet S = {v2 , v4 , · · · , vn } is a dual SuperHyperDefensive SuperHyperEulerian- 6680
(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · , vn } and {v1 , v3 , · · · , vn−1 }; 6682
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } σ(s), Σs∈S={v1 ,v3 ,··· ,vn−1 } σ(s)}; 6683
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn } and S2 = {v1 , v3 , · · · , vn−1 } are only dual 6684
Proposition 32.0.39. Let ESHG : (V, E) be an odd SuperHyperEulerian-Type-Path-Neighbor. Then 6686

(iii) Γs = min{Σs∈S={v2 ,v4 ,··· .vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 6690
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn−1 } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 6691
Proposition 32.0.40. Let ESHG : (V, E) be SuperHyperStar. Then 6693
(i) the SuperHyperSet S = {c} is a dual maximal SuperHyperEulerian-Type-Path-Neighbor; 6694
(ii) Γ = 1; 6695
(iii) Γs = Σ3i=1 σi (c); 6696
(iv) the SuperHyperSets S = {c} and S ⊂ S 0 are only dual SuperHyperEulerian-Type-Path-Neighbor. 6697
Proposition 32.0.41. Let ESHG : (V, E) be SuperHyperWheel. Then 6698

6+3(i−1)≤n
(i) the SuperHyperSet S = {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is a dual maximal 6699
6+3(i−1)≤n
(ii) Γ = |{v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 |; 6701
(iii) Γs = Σ{v1 ,v3 }∪{v6 ,v9 ··· ,vi+6 ,··· ,vn }6+3(i−1)≤n Σ3i=1 σi (s); 6702
i=1
6+3(i−1)≤n
(iv) the SuperHyperSet {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is only a dual maximal 6703
Proposition 32.0.42. Let ESHG : (V, E) be an odd SuperHyperComplete. Then 6705
b n c+1
2
is a dual SuperHyperDefensive SuperHyperEulerian-Type- 6706
Path-Neighbor; 6707
(ii) Γ = b n2 c + 1; 6708

b n c+1 ; 6709
S={vi }i=1
b n c+1
(iv) the SuperHyperSet S = {vi }i=1
2
is only a dual SuperHyperDefensive SuperHyperEulerian- 6710
Proposition 32.0.43. Let ESHG : (V, E) be an even SuperHyperComplete. Then 6712
bnc
2
Neighbor; 6714
(ii) Γ = b n2 c; 6715

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

perStars with common Neutrosophic SuperHyperVertex SuperHyperSet. Then 6720
(i) the SuperHyperSet S = {c1 , c2 , · · · , cm } is a dual SuperHyperDefensive SuperHyperEulerian- 6721

Type-Path-Neighbor for N SHF; 6722
(ii) Γ = m for N SHF : (V, E); 6723
(iii) Γs = Σm 3
i=1 Σj=1 σj (ci ) for N SHF : (V, E); 6724
(iv) the SuperHyperSets S = {c1 , c2 , · · · , cm } and S ⊂ S 0 are only dual SuperHyperEulerian-Type- 6725
Path-Neighbor for N SHF : (V, E). 6726
Proposition 32.0.45. Let N SHF : (V, E) be an m-SuperHyperFamily of odd SuperHyperCom- 6727
plete SuperHyperGraphs with common Neutrosophic SuperHyperVertex SuperHyperSet. Then 6728

b n c+1
(i) the SuperHyperSet S = {vi }i=1 2
is a dual maximal SuperHyperDefensive 6729
SuperHyperEulerian-Type-Path-Neighbor for N SHF; 6730
(ii) Γ = b n2 c + 1 for N SHF : (V, E); 6731

b n c+1 for N SHF : (V, E); 6732
S={vi }i=1
b n c+1
2
are only a dual maximal SuperHyperEulerian-Type-Path- 6733
Neighbor for N SHF : (V, E). 6734
Proposition 32.0.46. Let N SHF : (V, E) be a m-SuperHyperFamily of even SuperHyperCom- 6735

plete SuperHyperGraphs with common Neutrosophic SuperHyperVertex SuperHyperSet. Then 6736
bnc
2
Neighbor for N SHF : (V, E); 6738
(ii) Γ = b n2 c for N SHF : (V, E); 6739

bnc for N SHF : (V, E); 6740
S={vi }i=1
bnc
2
are only dual maximal SuperHyperEulerian-Type-Path-Neighbor 6741
for N SHF : (V, E). 6742
(i) if s ≥ t and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 6745

SuperHyperEulerian-Type-Path-Neighbor, then S is an s-SuperHyperDefensive SuperHyperEulerian- 6746

SuperHyperEulerian-Type-Path-Neighbor, then S is a dual s-SuperHyperDefensive SuperHyperEulerian- 6749
(i) if s ≥ t + 2 and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 6753
SuperHyperEulerian-Type-Path-Neighbor, then S is an s-SuperHyperPowerful SuperHyperEulerian- 6754


SuperHyperEulerian-Type-Path-Neighbor, then S is a dual s-SuperHyperPowerful SuperHyperEulerian- 6757
Proposition 32.0.49. Let ESHG : (V, E) be a[an] [V-]SuperHyperUniform-strong-Neutrosophic 6759

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

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

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

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

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

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

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

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


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

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


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

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

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


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

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

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


CHAPTER 33 6819
Neutrosophic Applications in Cancer’s 6820
Neutrosophic Recognition 6821
The cancer is the Neutrosophic disease but the Neutrosophic model is going to figure out what’s 6822
going on this Neutrosophic phenomenon. The special Neutrosophic case of this Neutrosophic 6823
disease is considered and as the consequences of the model, some parameters are used. The 6824
cells are under attack of this disease but the moves of the cancer in the special region are the 6825
matter of mind. The Neutrosophic recognition of the cancer could help to find some Neutrosophic 6826
treatments for this Neutrosophic disease. 6827
In the following, some Neutrosophic steps are Neutrosophic devised on this disease. 6828
Step 1. (Neutrosophic Definition) The Neutrosophic recognition of the cancer in the long-term 6829
Neutrosophic function. 6830
Step 2. (Neutrosophic Issue) The specific region has been assigned by the Neutrosophic model 6831
[it’s called Neutrosophic SuperHyperGraph] and the long Neutrosophic cycle of the move 6832
from the cancer is identified by this research. Sometimes the move of the cancer hasn’t be 6833
easily identified since there are some determinacy, indeterminacy and neutrality about the 6834
moves and the effects of the cancer on that region; this event leads us to choose another 6835
model [it’s said to be Neutrosophic SuperHyperGraph] to have convenient perception on 6836
what’s happened and what’s done. 6837
Step 3. (Neutrosophic Model) There are some specific Neutrosophic models, which are well- 6838
known and they’ve got the names, and some general Neutrosophic models. The moves 6839
and the Neutrosophic traces of the cancer on the complex tracks and between complicated 6840
groups of cells could be fantasized by a Neutrosophic SuperHyperPath(-/SuperHyperEulerian- 6841
Type-Path-Neighbor, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHy- 6842
perWheel). The aim is to find either the Neutrosophic SuperHyperEulerian-Type-Path-Neighbor 6843

or the Neutrosophic SuperHyperEulerian-Type-Path-Neighbor in those Neutrosophic Neutrosophic 6844
SuperHyperModels. 6845
341
CHAPTER 34 6846
Case 1: The Initial Neutrosophic Steps 6847
Toward Neutrosophic 6848
SuperHyperBipartite as Neutrosophic 6849
SuperHyperModel 6850
Step 4. (Neutrosophic Solution) In the Neutrosophic Figure (34.1), the Neutrosophic Super- 6851
HyperBipartite is Neutrosophic highlighted and Neutrosophic featured. 6852
Figure 34.1: a Neutrosophic SuperHyperBipartite Associated to the Notions of Neutrosophic

343
Belong to The Neutrosophic SuperHyperBipartite

136TBLaa21aa
By using the Neutrosophic Figure (34.1) and the Table (34.1), the Neutrosophic SuperHy- 6853
perBipartite is obtained. 6854
The obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous 6855
Neutrosophic result, of the Neutrosophic SuperHyperVertices of the connected Neutrosophic 6856
SuperHyperBipartite ESHB : (V, E), in the Neutrosophic SuperHyperModel (34.1), is the 6857

CHAPTER 35 6859
Case 2: The Increasing Neutrosophic 6860
Steps Toward Neutrosophic 6861
SuperHyperMultipartite as 6862
Neutrosophic SuperHyperModel 6863
Step 4. (Neutrosophic Solution) In the Neutrosophic Figure (35.1), the Neutrosophic Super- 6864
HyperMultipartite is Neutrosophic highlighted and Neutrosophic featured. 6865
By using the Neutrosophic Figure (35.1) and the Table (35.1), the Neutrosophic SuperHy- 6866
perMultipartite is obtained. 6867
The obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous 6868
Figure 35.1: a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic

345
Belong to The Neutrosophic SuperHyperMultipartite

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

perMultipartite ESHM : (V, E), in the Neutrosophic SuperHyperModel (35.1), is the 6870

CHAPTER 36 6872
Wondering Open Problems But As The 6873
Directions To Forming The Motivations 6874
In what follows, some “problems” and some “questions” are proposed. 6875
The SuperHyperEulerian-Type-Path-Neighbor and the Neutrosophic SuperHyperEulerian-Type-Path-Neighbor are 6876
defined on a real-world application, titled “Cancer’s Recognitions”. 6877
Question 36.0.1. Which the else SuperHyperModels could be defined based on Cancer’s 6878
recognitions? 6879
Question 36.0.2. Are there some SuperHyperNotions related to SuperHyperEulerian-Type-Path-Neighbor 6880

and the Neutrosophic SuperHyperEulerian-Type-Path-Neighbor? 6881
Question 36.0.3. Are there some Algorithms to be defined on the SuperHyperModels to compute 6882
them? 6883
Question 36.0.4. Which the SuperHyperNotions are related to beyond the SuperHyperEulerian- 6884
and the Neutrosophic SuperHyperEulerian-Type-Path-Neighbor?
Problem 36.0.5. The SuperHyperEulerian-Type-Path-Neighbor and the Neutrosophic SuperHyperEulerian- 6886

do a SuperHyperModel for the Cancer’s recognitions and they’re based on
SuperHyperEulerian-Type-Path-Neighbor, are there else? 6888
Problem 36.0.6. Which the fundamental SuperHyperNumbers are related to these SuperHyper- 6889
Numbers types-results? 6890
Problem 36.0.7. What’s the independent research based on Cancer’s recognitions concerning 6891
the multiple types of SuperHyperNotions? 6892
347
CHAPTER 37 6893
Conclusion and Closing Remarks 6894
In this section, concluding remarks and closing remarks are represented. The drawbacks of this 6895
research are illustrated. Some benefits and some advantages of this research are highlighted. 6896
This research uses some approaches to make Neutrosophic SuperHyperGraphs more under- 6897
standable. In this endeavor, two SuperHyperNotions are defined on the SuperHyperEulerian-Type- 6898
Path-Neighbor. For that sake in the second definition, the main definition of the Neutrosophic 6899
SuperHyperGraph is redefined on the position of the alphabets. Based on the new definition for 6900
the Neutrosophic SuperHyperGraph, the new SuperHyperNotion, Neutrosophic SuperHyperEulerian- 6901
Type-Path-Neighbor, finds the convenient background to implement some results based on that. Some 6902
SuperHyperClasses and some Neutrosophic SuperHyperClasses are the cases of this research 6903
on the modeling of the regions where are under the attacks of the cancer to recognize this 6904
disease as it’s mentioned on the title “Cancer’s Recognitions”. To formalize the instances 6905
on the SuperHyperNotion, SuperHyperEulerian-Type-Path-Neighbor, the new SuperHyperClasses and 6906
SuperHyperClasses, are introduced. Some general results are gathered in the section on the 6907
SuperHyperEulerian-Type-Path-Neighbor and the Neutrosophic SuperHyperEulerian-Type-Path-Neighbor. The 6908

clarifications, instances and literature reviews have taken the whole way through. In this re- 6909
search, the literature reviews have fulfilled the lines containing the notions and the results. 6910
The SuperHyperGraph and Neutrosophic SuperHyperGraph are the SuperHyperModels on the 6911
“Cancer’s Recognitions” and both bases are the background of this research. Sometimes the 6912
cancer has been happened on the region, full of cells, groups of cells and embedded styles. In this 6913
segment, the SuperHyperModel proposes some SuperHyperNotions based on the connectivities of 6914
the moves of the cancer in the longest and strongest styles with the formation of the design and 6915
the architecture are formally called “ SuperHyperEulerian-Type-Path-Neighbor” in the themes of jargons 6916
and buzzwords. The prefix “SuperHyper” refers to the theme of the embedded styles to figure out 6917
the background for the SuperHyperNotions. In the Table (37.1), benefits and avenues for this 6918
research are, figured out, pointed out and spoken out. 6919
349
Table 37.1: An Overlook On This Research And Beyond 136TBLTBL
Advantages Limitations
1. Redefining Neutrosophic SuperHyperGraph 1. General Results
2. SuperHyperEulerian-Type-Path-Neighbor
3. Neutrosophic SuperHyperEulerian-Type-Path-Neighbor 2. Other SuperHyperNumbers
4. Modeling of Cancer’s Recognitions
5. SuperHyperClasses 3. SuperHyperFamilies

CHAPTER 38 6920
Neutrosophic SuperHyperDuality But As 6921
Super Forms 6923
Definition 38.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperDuality). 6924

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

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

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

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

Vi , Vj ∈ Ea and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; 6935
(v) Neutrosophic SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 6936

Neutrosophic re-SuperHyperDuality, Neutrosophic v-SuperHyperDuality, and Neutro- 6937
sophic rv-SuperHyperDuality. 6938
Definition 38.0.2. ((Neutrosophic) SuperHyperDuality). 6939

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

sophic rv-SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : 6944
(V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high 6945
Extreme cardinality of the Extreme SuperHyperEdges in the conseNeighborive Extreme 6946
sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 6947
form the Extreme SuperHyperDuality; 6948
351
(ii) a Neutrosophic SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 6949

sophic rv-SuperHyperDuality and C(N SHG) for a Neutrosophic SuperHyperGraph 6951
such that they form the Neutrosophic SuperHyperDuality; 6955
(iii) an Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of Neut- 6956
rosophic e-SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic v- 6957

SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for an Ex- 6958
treme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains 6959
the Extreme coefficients defined as the Extreme number of the maximum Extreme cardin- 6960
ality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme 6961
tices such that they form the Extreme SuperHyperDuality; and the Extreme power is 6963
(iv) a Neutrosophic SuperHyperDuality SuperHyperPolynomial if it’s either of Neut- 6965

SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for a Neut- 6967
rosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 6968
SuperHyperDuality; and the Neutrosophic power is corresponded to its Neutrosophic 6973
coefficient; 6974
(v) an Extreme R-SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 6975

sophic rv-SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : 6977
(V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high 6978
Extreme cardinality of the Extreme SuperHyperVertices in the conseNeighborive Extreme 6979
sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 6980
form the Extreme SuperHyperDuality; 6981
(vi) a Neutrosophic R-SuperHyperDuality if it’s either of Neutrosophic e- 6982

SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic v-SuperHyperDuality,6983
and Neutrosophic rv-SuperHyperDuality and C(N SHG) for a Neutrosophic SuperHyper- 6984
Graph N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic 6985
SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 6986
such that they form the Neutrosophic SuperHyperDuality; 6988
(vii) an Extreme R-SuperHyperDuality SuperHyperPolynomial if it’s either of 6989

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

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

contains the Extreme coefficients defined as the Extreme number of the maximum 6993
SuperHyperVertices such that they form the Extreme SuperHyperDuality; and the Extreme 6996
(viii) a Neutrosophic SuperHyperDuality SuperHyperPolynomial if it’s either of Neut- 6998

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

imum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic 7003
SuperHyperDuality; and the Neutrosophic power is corresponded to its Neutrosophic 7006
coefficient. 7007
136EXM1 Example 38.0.3. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E) in 7008
the mentioned Neutrosophic Figures in every Neutrosophic items. 7009

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7011
E1 and E3 are some empty Extreme SuperHyperEdges but E2 is a loop Neutrosophic 7012
SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of 7013
Neutrosophic SuperHyperNeighbor, there’s only one Neutrosophic SuperHyperEdge, 7014
namely, E4 . The Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means 7015
that there’s no Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. 7016
Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in every given Neutrosophic 7017
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 7021
SuperHyperEdge. Thus in the terms of Neutrosophic SuperHyperNeighbor, there’s only 7022
one Neutrosophic SuperHyperEdge, namely, E4 . The Neutrosophic SuperHyperVertex, V3 7023
is Neutrosophic isolated means that there’s no Neutrosophic SuperHyperEdge has it as 7024
a Neutrosophic endpoint. Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in 7025

every given Neutrosophic SuperHyperDuality. 7026




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 .
The previous Neutrosophic approach apply on the upcoming Neutrosophic results on 7067
Neutrosophic SuperHyperClasses. 7068
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 7070
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. 7077
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 7079
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3

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


the Neutrosophic SuperHyperDuality. 7097
Then 7099
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 7100
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL


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

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

(V, E). Then 7120

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


Then there’s at least one SuperHyperDuality. Thus the notion of quasi isn’t up and 7126
the SuperHyperNotions based on SuperHyperDuality could be applied. There are only z 0 7127
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. 7139
Then, 7141
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 7142
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 7143


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

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

CHAPTER 39 7156
Neutrosophic SuperHyperJoin But As 7157
Super Forms 7159
Definition 39.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperJoin). 7160

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

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

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

(v) Neutrosophic SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 7174

Neutrosophic re-SuperHyperJoin, Neutrosophic v-SuperHyperJoin, and Neutrosophic 7175
rv-SuperHyperJoin. 7176
Definition 39.0.2. ((Neutrosophic) SuperHyperJoin). 7177

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

365

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

rv-SuperHyperJoin and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7189
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of 7190
a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality conseNeighborive 7191
Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they 7192

form the Neutrosophic SuperHyperJoin; 7193
(iii) an Extreme SuperHyperJoin SuperHyperPolynomial if it’s either of Neutrosophic 7194

e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic v-SuperHyperJoin, 7195
and Neutrosophic rv-SuperHyperJoin and C(N SHG) for an Extreme SuperHyperGraph 7196
the Extreme SuperHyperJoin; and the Extreme power is corresponded to its Extreme 7201
coefficient; 7202
(iv) a Neutrosophic SuperHyperJoin SuperHyperPolynomial if it’s either of 7203

Neutrosophic e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic v- 7204
SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for a Neutrosophic 7205
the Neutrosophic coefficients defined as the Neutrosophic number of the maximum Neutro- 7207
sophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet 7208
S of high Neutrosophic cardinality conseNeighborive Neutrosophic SuperHyperEdges and 7209

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

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

rv-SuperHyperJoin and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7221
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of 7222
form the Neutrosophic SuperHyperJoin; 7225

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

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

such that they form the Extreme SuperHyperJoin; and the Extreme power is corresponded 7233
to its Extreme coefficient; 7234
(viii) a Neutrosophic SuperHyperJoin SuperHyperPolynomial if it’s either of 7235

SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for a Neutrosophic 7237

SuperHyperJoin; and the Neutrosophic power is corresponded to its Neutrosophic 7243
coefficient. 7244
SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7248

E1 and E3 are some empty Neutrosophic SuperHyperEdges but E2 is a loop Neutrosophic 7249

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




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


SuperHyperModel (31.1), is the SuperHyperJoin. 7314

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

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

Neutrosophic SuperHyperModel (31.2), is the Neutrosophic SuperHyperJoin. 7323
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 7325


the Neutrosophic SuperHyperJoin. 7334
Then 7336
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 7337
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 7343
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperJoin taken from a connected Neutrosophic SuperHyperBipartite 7345

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL


(V, E). Then 7356

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

is a longest SuperHyperJoin taken from a connected Neutrosophic SuperHyperMultipartite 7358


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

Then, 7376

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

.
Proof. Let 7377
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3
is a longest SuperHyperJoin taken from a connected Neutrosophic SuperHyperWheel ESHW : 7378


at least one SuperHyperJoin. Thus the notion of quasi isn’t up and the SuperHyperNotions based 7382
on SuperHyperJoin could be applied. The unique embedded SuperHyperJoin proposes some 7383
longest SuperHyperJoin excerpt from some representatives. The latter is straightforward. 7384
SuperHyperModel (31.6), is the Neutrosophic SuperHyperJoin. 7389

CHAPTER 40 7390
Neutrosophic SuperHyperPerfect But As 7391
Super Forms 7393
Definition 40.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperPerfect). 7394

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

Va ∈ Ei , Ej ; 7399
(ii) Neutrosophic re-SuperHyperPerfect if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃!Ej ∈ E 0 , such 7400

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

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

(v) Neutrosophic SuperHyperPerfect if it’s either of Neutrosophic e-SuperHyperPerfect, 7406

Neutrosophic re-SuperHyperPerfect, Neutrosophic v-SuperHyperPerfect, and Neutrosophic 7407
rv-SuperHyperPerfect. 7408
Definition 40.0.2. ((Neutrosophic) SuperHyperPerfect). 7409

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

rv-SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 7414
379
(ii) a Neutrosophic SuperHyperPerfect if it’s either of Neutrosophic e-SuperHyperPerfect, 7419

rv-SuperHyperPerfect and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : 7421
(V, E) is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges 7422
of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality conseNeighborive 7423
form the Neutrosophic SuperHyperPerfect; 7425
(iii) an Extreme SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7426

rosophic e-SuperHyperPerfect, Neutrosophic re-SuperHyperPerfect, Neutrosophic v- 7427
SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for an Ex- 7428
ality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme 7431
(iv) a Neutrosophic SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7435

SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for a Neut- 7437
SuperHyperPerfect; and the Neutrosophic power is corresponded to its Neutrosophic 7443
coefficient; 7444
(v) an Extreme R-SuperHyperPerfect if it’s either of Neutrosophic e-SuperHyperPerfect, 7445

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

SuperHyperPerfect, Neutrosophic re-SuperHyperPerfect, Neutrosophic v-SuperHyperPerfect,7453
and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for a Neutrosophic SuperHyper- 7454
Graph N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic 7455
SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 7456
such that they form the Neutrosophic SuperHyperPerfect; 7458
(vii) an Extreme R-SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7459

SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for an Ex- 7461

ality of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme 7464
(viii) a Neutrosophic SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7468

SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for a Neut- 7470

SuperHyperPerfect; and the Neutrosophic power is corresponded to its Neutrosophic 7476
coefficient. 7477

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7481

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





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

SuperHyperModel (31.1), is the SuperHyperPerfect. 7547
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 7549
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3

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

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



the Neutrosophic SuperHyperPerfect. 7567
Then 7569
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 7570
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 7574
there’s no at least one SuperHyperPerfect. Thus the notion of quasi may be up but the 7575
SuperHyperNotions based on SuperHyperPerfect could be applied. There are only two 7576
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperPerfect taken from a connected Neutrosophic SuperHyperBipartite 7579

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL

(V, E). Then 7590

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



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

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

is a longest SuperHyperPerfect taken from a connected Neutrosophic SuperHyperWheel 7613


ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is straightforward. Then there’s 7616
at least one SuperHyperPerfect. Thus the notion of quasi isn’t up and the SuperHyperNotions 7617
based on SuperHyperPerfect could be applied. The unique embedded SuperHyperPerfect 7618
proposes some longest SuperHyperPerfect excerpt from some representatives. The latter is 7619
SuperHyperModel (31.6), is the Neutrosophic SuperHyperPerfect. 7625

CHAPTER 41 7626
Neutrosophic SuperHyperTotal But As 7627
Super Forms 7629
Definition 41.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperTotal). 7630

(i) Neutrosophic e-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that 7634

Va ∈ Ei , Ej ; 7635
(ii) Neutrosophic re-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that 7636

Va ∈ Ei , Ej ; and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 7637
(iii) Neutrosophic v-SuperHyperTotal if ∀Vi ∈ VESHG:(V,E) , ∃!Vj ∈ V 0 , such that 7638

Vi , Vj ∈ Ea ; 7639
(iv) Neutrosophic rv-SuperHyperTotal if ∀Vi ∈ VESHG:(V,E) , ∃!Vj ∈ V 0 , such that 7640

(v) Neutrosophic SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 7642

Neutrosophic re-SuperHyperTotal, Neutrosophic v-SuperHyperTotal, and Neutrosophic 7643
rv-SuperHyperTotal. 7644
Definition 41.0.2. ((Neutrosophic) SuperHyperTotal). 7645

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

rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 7650
Extreme SuperHyperTotal; 7654
393
(ii) a Neutrosophic SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 7655

rv-SuperHyperTotal and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7657
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of 7658
form the Neutrosophic SuperHyperTotal; 7661
(iii) an Extreme SuperHyperTotal SuperHyperPolynomial if it’s either of Neutrosophic 7662
e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v-SuperHyperTotal, 7663

and Neutrosophic rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph 7664
the Extreme SuperHyperTotal; and the Extreme power is corresponded to its Extreme 7669
coefficient; 7670
(iv) a Neutrosophic SuperHyperTotal SuperHyperPolynomial if it’s either of 7671
Neutrosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v- 7672

SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for a Neutro- 7673
SuperHyperTotal; and the Neutrosophic power is corresponded to its Neutrosophic coeffi- 7679
cient; 7680
(v) an Extreme R-SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 7681

rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 7683
Extreme SuperHyperTotal; 7687
(vi) a Neutrosophic R-SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 7688

rv-SuperHyperTotal and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7690
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of 7691
form the Neutrosophic SuperHyperTotal; 7694
(vii) an Extreme R-SuperHyperTotal SuperHyperPolynomial if it’s either of Neut- 7695

rosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v- 7696
SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for an Extreme 7697


tices such that they form the Extreme SuperHyperTotal; and the Extreme power is 7702
(viii) a Neutrosophic SuperHyperTotal SuperHyperPolynomial if it’s either of 7704

Neutrosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v- 7705
SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for a Neutro- 7706

SuperHyperTotal; and the Neutrosophic power is corresponded to its Neutrosophic coeffi- 7712
cient. 7713

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7717
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. 7732




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 |Neutrosophic Cardinality −2
= {Ei }i=1ESHG:(V,E) .
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 7776
P :
V2EXT ERN AL , E2 ,
V3EXT ERN AL , E3 ,
...

SuperHyperModel (31.1), is the SuperHyperTotal. 7783
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 7785
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. 7792
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 7794



the Neutrosophic SuperHyperTotal. 7803
Then 7805
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 7806
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2


based on SuperHyperTotal could be applied. There are only two SuperHyperParts. Thus every 7812
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperTotal taken from a connected Neutrosophic SuperHyperBipartite 7814
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

(V, E). Then 7825

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


based on SuperHyperTotal could be applied. There are only z 0 SuperHyperParts. Thus every 7832
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. 7843
Then, 7845
∗
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 7846
P : ViEXT ERN AL , Ei∗ , CEN T ER, Ej .
is a longest SuperHyperTotal taken from a connected Neutrosophic SuperHyperWheel ESHW : 7847


at least one SuperHyperTotal. Thus the notion of quasi isn’t up and the SuperHyperNotions 7851
based on SuperHyperTotal could be applied. The unique embedded SuperHyperTotal 7852

proposes some longest SuperHyperTotal excerpt from some representatives. The latter is 7853
SuperHyperModel (31.6), is the Neutrosophic SuperHyperTotal. 7859

CHAPTER 42 7860
Neutrosophic SuperHyperConnected But 7861
As The Extensions Excerpt From Dense 7862
And Super Forms 7863
Definition 42.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperConnected). 7864

(i) Neutrosophic e-SuperHyperConnected if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such 7868
that Va ∈ Ei , Ej ; and ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; 7869
(ii) Neutrosophic re-SuperHyperConnected if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ 7870

E 0 , such that Va ∈ Ei , Ej ; ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; and 7871
|Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 7872
(iii) Neutrosophic v-SuperHyperConnected if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such 7873

that Vi , Vj 6∈ Ea ; and ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; 7874
(iv) Neutrosophic rv-SuperHyperConnected if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ 7875

V 0 , such that Vi , Vj ∈ Ea ; ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; and 7876
|Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; 7877
(v) Neutrosophic SuperHyperConnected if it’s either of Neutrosophic e-SuperHyperConnected,

7878
Neutrosophic re-SuperHyperConnected, Neutrosophic v-SuperHyperConnected, and Neut- 7879
rosophic rv-SuperHyperConnected. 7880
Definition 42.0.2. ((Neutrosophic) SuperHyperConnected). 7881

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

7884
Neutrosophic re-SuperHyperConnected, Neutrosophic v-SuperHyperConnected, and Neut- 7885
rosophic rv-SuperHyperConnected and C(N SHG) for an Extreme SuperHyperGraph 7886
407

that they form the Extreme SuperHyperConnected; 7890
(ii) a Neutrosophic SuperHyperConnected if it’s either of Neutrosophic e- 7891

SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neutrosophic v- 7892
SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) 7893
for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic 7894
cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S 7895
of high Neutrosophic cardinality conseNeighborive Neutrosophic SuperHyperEdges and 7896

Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperCon- 7897
nected; 7898
(iii) an Extreme SuperHyperConnected SuperHyperPolynomial if it’s either of Neut- 7899

rosophic e-SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neutrosophic 7900
v-SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) for 7901
an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial 7902
contains the Extreme coefficients defined as the Extreme number of the maximum Ex- 7903
treme cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S 7904

SuperHyperVertices such that they form the Extreme SuperHyperConnected; and the 7906
Extreme power is corresponded to its Extreme coefficient; 7907
(iv) a Neutrosophic SuperHyperConnected SuperHyperPolynomial if it’s either of 7908

Neutrosophic e-SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neut- 7909
rosophic v-SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and 7910
C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic 7911
SuperHyperPolynomial contains the Neutrosophic coefficients defined as the Neutrosophic 7912
number of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges 7913

the Neutrosophic SuperHyperConnected; and the Neutrosophic power is corresponded to 7916
its Neutrosophic coefficient; 7917
(v) an Extreme R-SuperHyperConnected if it’s either of Neutrosophic e- 7918

for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme cardinality 7921
of an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme SuperHyper- 7922

Vertices in the conseNeighborive Extreme sequence of Extreme SuperHyperEdges and 7923
Extreme SuperHyperVertices such that they form the Extreme SuperHyperConnected; 7924
(vi) a Neutrosophic R-SuperHyperConnected if it’s either of Neutrosophic e- 7925

for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic 7928
cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S 7929
of high Neutrosophic cardinality conseNeighborive Neutrosophic SuperHyperEdges and 7930

Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperCon- 7931
nected; 7932
(vii) an Extreme R-SuperHyperConnected SuperHyperPolynomial if it’s either of 7933

C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme Super- 7936
HyperPolynomial contains the Extreme coefficients defined as the Extreme number of the 7937
maximum Extreme cardinality of the Extreme SuperHyperVertices of an Extreme Super- 7938
HyperSet S of high Extreme cardinality conseNeighborive Extreme SuperHyperEdges and 7939

Extreme SuperHyperVertices such that they form the Extreme SuperHyperConnected; 7940
and the Extreme power is corresponded to its Extreme coefficient; 7941
(viii) a Neutrosophic SuperHyperConnected SuperHyperPolynomial if it’s either of 7942

C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic 7945
SuperHyperPolynomial contains the Neutrosophic coefficients defined as the Neutrosophic 7946

number of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices 7947
the Neutrosophic SuperHyperConnected; and the Neutrosophic power is corresponded to 7950
its Neutrosophic coefficient. 7951
• On the Figure (30.1), the Neutrosophic SuperHyperNotion, namely, Neutrosophic Super- 7954
HyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7955
SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of Neutro- 7957
sophic SuperHyperNeighbor, there’s only one Neutrosophic SuperHyperEdge, namely, E4 . 7958
The Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means that there’s no 7959
Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. Thus the Neutrosophic 7960
SuperHyperVertex, V3 , is excluded in every given Neutrosophic SuperHyperConnected. 7961
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. 7969


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 8013
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. 8020
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 8022
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. 8029
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 8031



the Neutrosophic SuperHyperConnected. 8040
Then 8042
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 8043
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 8048
SuperHyperNotions based on SuperHyperConnected could be applied. There are only two 8049
P :

V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperConnected taken from a connected Neutrosophic SuperHyperBipartite 8052

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
(V, E). Then 8063
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 8064
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

is a longest SuperHyperConnected taken from a connected Neutrosophic SuperHyperMultipartite 8065


there’s no at least one SuperHyperConnected. Thus the notion of quasi may be up but 8069
the SuperHyperNotions based on SuperHyperConnected could be applied. There are only 8070
z 0 SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as the 8071
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. 8082
Then, 8084
∗
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 8085
P : V EXT ERN AL i , E ∗ i , CEN T ER, Ej .

is a longest SuperHyperConnected taken from a connected Neutrosophic SuperHyperWheel 8086


to ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is straightforward. 8089
Then there’s at least one SuperHyperConnected. Thus the notion of quasi isn’t up and 8090
the SuperHyperNotions based on SuperHyperConnected could be applied. The unique 8091
embedded SuperHyperConnected proposes some longest SuperHyperConnected excerpt from 8092
some representatives. The latter is straightforward. 8093
SuperHyperModel (31.6), is the Neutrosophic SuperHyperConnected. 8098

CHAPTER 43 8099
Background 8100
forms without using neutrosophic classes of neutrosophic SuperHyperGraph. It’s published 8107
in prestigious and fancy journal is entitled “Journal of Current Trends in Computer Science 8108
Research (JCTCSR)” with ISO abbreviation “J Curr Trends Comp Sci Res” in volume 1 8109
and issue 1 with pages 06-14. The research article studies deeply with choosing neutrosophic 8110
hypergraphs instead of neutrosophic SuperHyperGraph. It’s the breakthrough toward independent 8111
results based on initial background. 8112
The seminal paper and groundbreaking article is titled “Super Hyper Dominating and Super 8113
Hyper Resolving on Neutrosophic Super Hyper Graphs and Their Directions in Game Theory and 8114
The research article studies deeply with choosing directly neutrosophic SuperHyperGraph and 8121
SuperHyperGraph. It’s the breakthrough toward independent results based on initial background 8122
and fundamental SuperHyperNumbers. 8123
The seminal paper and groundbreaking article is titled “Some Super Hyper Degrees and Co-Super 8124
Hyper Degrees on Neutrosophic Super Hyper Graphs And Super Hyper Graphs Alongside 8125
Applications in Cancer’s Treatments” in Ref. [HG3] by Henry Garrett (2023). In this research 8126
article, a novel approach is implemented on SuperHyperGraph and neutrosophic SuperHy- 8127

perGraph based on fundamental notions and using vital tools in Cancer’s Treatments. It’s 8128
published in prestigious and fancy journal is entitled “Journal of Mathematical Techniques and 8129
Computational Mathematics(JMTCM)” with ISO abbreviation “J Math Techniques Comput 8130
Math” in volume 2 and issue 1 with pages 35-47. The research article studies deeply with 8131
421


Henry Garrett (2022), “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well- Supe- 8161
rHyperModelled (Neutrosophic) SuperHyperGraphs ” in Ref. [HG16] by Henry Garrett (2022), 8162
“Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic SuperHyperStable To Act on 8163
(2022), “Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic) SuperHyper- 8165
Modeling in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs” in Ref. [HG17] by 8166
Henry Garrett (2022), “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic 8167
SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints” in Ref. 8168
[HG18] by Henry Garrett (2022),“(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions 8169

Featuring (Neutrosophic) SuperHyperDefensive SuperHyperAlliances” in Ref. [HG19] by Henry 8170
Garrett (2022), “(Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and Super- 8171
HyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With (Neutrosophic) 8172
SuperHyperModeling of Cancer’s Recognitions And Related (Neutrosophic) SuperHyperClasses” 8173
in Ref. [HG20] by Henry Garrett (2022), “SuperHyperGirth on SuperHyperGraph and Neutro- 8174
sophic SuperHyperGraph With SuperHyperModeling of Cancer’s Recognitions” in Ref. [HG21] 8175

by Henry Garrett (2022), “Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic 8176
SuperHyperGraphs and SuperHyperGraphs Alongside Applications in Cancer’s Treatments” in 8177
Ref. [HG22] by Henry Garrett (2022), “SuperHyperDominating and SuperHyperResolving 8178
on Neutrosophic SuperHyperGraphs And Their Directions in Game Theory and Neutrosophic 8179

SuperHyperClasses” in Ref. [HG23] by Henry Garrett (2022), “SuperHyperMatching By 8180

(R-)Definitions And Polynomials To Monitor Cancer’s Recognition In Neutrosophic Supe- 8181
rHyperGraphs” in Ref. [HG24] by Henry Garrett (2023), “The Focus on The Partitions 8182
Obtained By Parallel Moves In The Cancer’s Extreme Recognition With Different Types of 8183
Extreme SuperHyperMatching Set and Polynomial on (Neutrosophic) SuperHyperGraphs” in 8184
Ref. [HG25] by Henry Garrett (2023), “Extreme Failed SuperHyperClique Decides the Failures 8185
on the Cancer’s Recognition in the Perfect Connections of Cancer’s Attacks By SuperHyper- 8186
Models Named (Neutrosophic) SuperHyperGraphs” in Ref. [HG26] by Henry Garrett (2023), 8187
“Indeterminacy On The All Possible Connections of Cells In Front of Cancer’s Attacks In The 8188
Terms of Neutrosophic Failed SuperHyperClique on Cancer’s Recognition called Neutrosophic 8189
SuperHyperGraphs” in Ref. [HG27] by Henry Garrett (2023), “Perfect Directions Toward 8190
Idealism in Cancer’s Neutrosophic Recognition Forwarding Neutrosophic SuperHyperClique on 8191
Neutrosophic SuperHyperGraphs” in Ref. [HG28] by Henry Garrett (2023), “Demonstrating 8192

Complete Connections in Every Embedded Regions and Sub-Regions in the Terms of Cancer’s 8193
Recognition and (Neutrosophic) SuperHyperGraphs With (Neutrosophic) SuperHyperClique” in 8194
Ref. [HG29] by Henry Garrett (2023), “Different Neutrosophic Types of Neutrosophic Regions 8195
titled neutrosophic Failed SuperHyperStable in Cancer’s Neutrosophic Recognition modeled in the 8196
Form of Neutrosophic SuperHyperGraphs” in Ref. [HG30] by Henry Garrett (2023), “Using 8197
the Tool As (Neutrosophic) Failed SuperHyperStable To SuperHyperModel Cancer’s Recognition 8198

Titled (Neutrosophic) SuperHyperGraphs” in Ref. [HG31] by Henry Garrett (2023), “Neut- 8199
rosophic Messy-Style SuperHyperGraphs To Form Neutrosophic SuperHyperStable To Act on 8200
(2023), “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well-SuperHyperModelled 8202
1-Failed SuperHyperForcing in the SuperHyperFunction To Use Neutrosophic SuperHyperGraphs 8204

on Cancer’s Neutrosophic Recognition And Beyond” in Ref. [HG34] by Henry Garrett (2022), 8205
“(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Recognitions And (Neutrosophic) Supe- 8206
rHyperGraphs” in Ref. [HG35] by Henry Garrett (2022), “Basic Notions on (Neutrosophic) 8207
SuperHyperForcing And (Neutrosophic) SuperHyperModeling in Cancer’s Recognitions And 8208
(Neutrosophic) SuperHyperGraphs” in Ref. [HG36] by Henry Garrett (2022), “Basic Neutro- 8209
sophic Notions Concerning SuperHyperDominating and Neutrosophic SuperHyperResolving in 8210

SuperHyperGraph” in Ref. [HG37] by Henry Garrett (2022), “Initial Material of Neutrosophic 8211
Preliminaries to Study Some Neutrosophic Notions Based on Neutrosophic SuperHyperEdge 8212
(NSHE) in Neutrosophic SuperHyperGraph (NSHG)” in Ref. [HG38] by Henry Garrett 8213
(2022), and [HG4; HG5; HG6; HG7; HG8; HG9; HG10; HG11; HG12; HG13; HG14; 8214

HG246; HG247; HG248; HG249; HG250; HG251], there are some endeavors to formalize 8231
the basic SuperHyperNotions about neutrosophic SuperHyperGraph and SuperHyperGraph along- 8232
side scientific research books at [HG60b; HG61b; HG62b; HG63b; HG64b; HG65b; 8233


HG158b; HG159b; HG160b; HG161b; HG162b; HG163b; HG164b]. Two popu- 8245
lar scientific research books in Scribd in the terms of high readers, 4190 and 5189 respectively, 8246
on neutrosophic science is on [HG32b; HG44b]. 8247
Some scientific studies and scientific researches about neutrosophic graphs, are proposed as book 8248
in Ref. [HG71b] by Henry Garrett (2023) which is indexed by Google Scholar and has more 8249
than 4331 readers in Scribd. It’s titled “Beyond Neutrosophic Graphs” and published by Dr. 8250
Henry Garrett. This research book covers different types of notions and settings in neutrosophic 8251
SuperHyperGraph theory. This research book has scrutiny on the complement of the intended set 8258
and the intended set, simultaneously. It’s smart to consider a set but acting on its complement 8259
that what’s done in this research book which is popular in the terms of high readers in Scribd. 8260
See the seminal scientific researches [HG1; HG2; HG3]. The formalization of the notions on 8261
the framework of notions in SuperHyperGraphs, Neutrosophic notions in SuperHyperGraphs the- 8262
ory, and (Neutrosophic) SuperHyperGraphs theory at [HG4; HG5; HG6; HG7; HG8; HG9; 8263

HG251] alongside scientific research books at [HG60b; HG61b; HG62b; HG63b; HG64b; 8281

HG157b; HG158b; HG159b; HG160b; HG161b; HG162b; HG163b; HG164b]. 8293
Two popular scientific research books in Scribd in the terms of high readers, 4331 and 5327 8294
respectively, on neutrosophic science is on [HG32b; HG44b]. 8295

Bibliography 8296
10.33140/JMTCM.01.03.09) 8303
HG5 [6] Garrett, Henry. “0049 | (Failed)1-Zero-Forcing Number in Neutrosophic Graphs.” CERN 8321
European Organization for Nuclear Research - Zenodo, Feb. 2022. CERN European 8322
Organization for Nuclear Research, https://doi.org/10.13140/rg.2.2.35241.26724. ht- 8323
tps://oa.mg/work/10.13140/rg.2.2.35241.26724 8324
427
10.20944/preprints202301.0282.v1). 8331
10.20944/preprints202301.0267.v1). 8334

2023010265 (doi: 10.20944/preprints202301.0265.v1). 8339
prints202301.0262.v1). 8343
2023010224, (doi: 10.20944/preprints202301.0224.v1). 8349
prints202301.0105.v1). 8352
Preprints 2023, 2023010044 8358
(doi: 10.20944/preprints202301.0043.v1). 8361

(doi: 10.20944/preprints202212.0549.v1). 8370
(doi: 10.20944/preprints202212.0500.v1). 8377
(doi: 10.5281/zenodo.7851519). 8386
HG250 [26] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Type-Path- 8387
(doi: 10.5281/zenodo.7851550). 8389

Type-Path-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 8394
10.5281/zenodo.7834229). 8398
10.5281/zenodo.7834261). 8401

10.5281/zenodo.7824560). 8404
(doi: 10.5281/zenodo.7824623). 8407
2023, (doi: 10.5281/zenodo.7809365). 8418

2023, (doi: 10.5281/zenodo.7809358). 8421
10.5281/zenodo.7809219). 8424
Graph By Eulerian-Path-Cut As Hyper Eulogy On Super EULA”, Zenodo 2023, (doi: 8426
10.5281/zenodo.7809328). 8427
2023, (doi: 10.5281/zenodo.7806767). 8430
2023, (doi: 10.5281/zenodo.7806838). 8433
By Hamiltonian-Type-Cycle-Decomposition As Hyper Decompress On Super Decompensa- 8435
tion”, Zenodo 2023, (doi: 10.5281/zenodo.7804238). 8436

(doi: 10.5281/zenodo.7799902). 8442
2023, (doi: 10.5281/zenodo.7804218). 8445
(doi: 10.5281/zenodo.7796334). 8448
10.5281/zenodo.7791952). 8454
Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 8456
10.5281/zenodo.7791982). 8457
10.5281/zenodo.7790026). 8460
HG223 [51] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Hamiltonian-Neighbor 8461
10.5281/zenodo.7790052). 8463
2023, (doi: 10.5281/zenodo.7787066). 8466
Hamiltonian-Decomposition In Recognition of Cancer With (Neutrosophic) SuperHy- 8468
perGraph”, Zenodo 2023, (doi: 10.5281/zenodo.7787094). 8469
10.5281/zenodo.7781476). 8472
10.5281/zenodo.7783082). 8475
Graph By Trace-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 8477
10.5281/zenodo.7777857). 8478

10.5281/zenodo.7779286). 8481
(doi: 10.5281/zenodo.7771831). 8484
2023, (doi: 10.5281/zenodo.7772468). 8487
10.13140/RG.2.2.20913.25446). 8490
HG212 [61] Henry Garrett, “New Ideas On Super Tract By Hyper Track Of Trace-Cut In Cancer’s 8491
Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zen- 8492
odo.7764916). 8493
10.13140/RG.2.2.11770.98247). 8496
10.13140/RG.2.2.12400.12808). 8499
2023, (doi: 10.13140/RG.2.2.22545.10089). 8502
10.13140/RG.2.2.11377.76644). 8508
10.13140/RG.2.2.23750.96329). 8511
10.13140/RG.2.2.31366.24641). 8514
10.13140/RG.2.2.34721.68960). 8517

By Vertex-Decomposition As Hyper Decompress On Super Decompensation”, ResearchGate 8519
2023, (doi: 10.13140/RG.2.2.30212.81289). 8520
10.13140/RG.2.2.24288.35842). 8526
10.13140/RG.2.2.32467.25124). 8529
10.13140/RG.2.2.31025.45925). 8532
10.13140/RG.2.2.17184.25602). 8535
10.13140/RG.2.2.23423.28327). 8538
10.13140/RG.2.2.28456.44805). 8541
10.13140/RG.2.2.23525.68320). 8544
HG194 [79] Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Cut In Can- 8545
10.13140/RG.2.2.20170.24000). 8547
10.13140/RG.2.2.36475.59683). 8550
10.13140/RG.2.2.29764.71046). 8553
2023, (doi: 10.13140/RG.2.2.18780.87683). 8556

10.13140/RG.2.2.26134.01603). 8562
HG188 [85] Henry Garrett, “New Ideas On Super Cliff By Hyper Cling Of Clique-Cut In Can- 8563
10.13140/RG.2.2.27392.30721). 8565
10.13140/RG.2.2.33028.40321). 8568
10.13140/RG.2.2.21389.20966). 8571
10.13140/RG.2.2.16356.04489). 8574
10.13140/RG.2.2.21756.21129). 8577
HG183 [90] Henry Garrett, “New Ideas On Super Solidarity By Hyper Soul Of Space In 8578
Cancer’s Recognition With (Extreme) SuperHyperGraph”, ResearchGate 2023, (doi: 8579
10.13140/RG.2.2.30983.68009). 8580
10.13140/RG.2.2.28552.29445). 8583
Connectivity In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchG- 8585
ate 2023, (doi: 10.13140/RG.2.2.10936.21761). 8586
10.13140/RG.2.2.35105.89447). 8589
(doi: 10.13140/RG.2.2.30072.72960). 8592
10.13140/RG.2.2.31147.52003). 8595

10.13140/RG.2.2.32825.24163). 8598
10.13140/RG.2.2.13059.58401). 8601
10.13140/RG.2.2.11172.14720). 8604
2023, (doi: 10.13140/RG.2.2.22011.80165). 8607
ate 2023, (doi: 10.13140/RG.2.2.30819.84003). 8610
By SuperHyperEdge-Domination As Hyper Reversion On Super Indirection”, ResearchGate 8612
2023, (doi: 10.13140/RG.2.2.10493.84962). 8613
ate 2023, (doi: 10.13140/RG.2.2.13849.29280). 8616
2023, (doi: 10.13140/RG.2.2.19944.14086). 8619
ate 2023, (doi: 10.13140/RG.2.2.23299.58404). 8622
(doi: 10.13140/RG.2.2.33103.76968). 8625
HG167 [106] Henry Garrett, “New Ideas On Super Gradient By Hyper k-Class Of SuperHyperK-Number 8626
(doi: 10.13140/RG.2.2.23037.44003). 8628
(doi: 10.13140/RG.2.2.35646.56641). 8631
(doi: 10.13140/RG.2.2.18030.48967). 8634

(doi: 10.13140/RG.2.2.13973.81121). 8637
2023, (doi: 10.13140/RG.2.2.34106.47047). 8640
2023, (doi: 10.13140/RG.2.2.31956.88961). 8646
2023, (doi: 10.13140/RG.2.2.15179.67361). 8649
10.13140/RG.2.2.21510.45125). 8652
HG158 [115] Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDom- 8653
inating In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 8654
2023, (doi: 10.13140/RG.2.2.13121.84321). 8655
10.13140/RG.2.2.11758.69441). 8658
2023, (doi: 10.13140/RG.2.2.31891.35367). 8661
10.13140/RG.2.2.19360.87048). 8664
HG154 [119] Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal 8665
10.13140/RG.2.2.32363.21286). 8667
10.13140/RG.2.2.23266.81602). 8670
10.13140/RG.2.2.19911.37285). 8673

10.13140/RG.2.2.11050.90569). 8676
HG150 [123] Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of SuperHy- 8677
perJoin In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 8678
2023, (doi: 10.13140/RG.2.2.17761.79206). 8679
HG149 [124] Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of Super- 8680
HyperDuality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 8681
By SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchG- 8684
ate 2023, (doi: 10.13140/RG.2.2.33275.80161). 8685
(doi: 10.13140/RG.2.2.30182.50241). 8688


2023, (doi: 10.13140/RG.2.2.17252.24968). 8721
(Neutrosophic) SuperHyperGraphs Toward Cancer’s extreme Recognition”, Preprints 2023, 8729

2023010396 (doi: 10.20944/preprints202301.0396.v1). 8730
2023, 2023010395 (doi: 10.20944/preprints202301.0395.v1). 8733
Recognition in The Confrontation With Super Attacks In Hyper Situations By Implement- 8735
ing (Neutrosophic) 1-Failed SuperHyperForcing in The Technical Approaches to Neutralize 8736
SuperHyperViews”, ResearchGate 2023, (doi: 10.13140/RG.2.2.26240.51204). 8737

HG128 [144] Henry Garrett,“Super Actions On The Types of Hyper Levels In The Sensible Neutrosophic 8742
SuperHyperGirth On Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyper- 8743
Graph”, ResearchGate 2023,(doi: 10.13140/RG.2.2.26836.88960). 8744

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

10.20944/preprints202301.0282.v1). 8754
10.20944/preprints202301.0267.v1).). 8757
2023010265 (doi: 10.20944/preprints202301.0265.v1). 8762
prints202301.0262.v1). 8766
2023010224, (doi: 10.20944/preprints202301.0224.v1). 8772

10.13140/RG.2.2.35061.65767). 8775
10.13140/RG.2.2.18494.15680). 8779
10.13140/RG.2.2.32530.73922). 8783
of Cancer’s Attacks In The Terms of Neutrosophic Failed SuperHyperClique on 8785
Cancer’s Recognition called Neutrosophic SuperHyperGraphs”, ResearchGate 2023, (doi: 8786
10.13140/RG.2.2.15897.70243). 8787
10.13140/RG.2.2.32530.73922). 8791

prints202301.0105.v1). 8794

10.13140/RG.2.2.23172.19849). 8801
10.13140/RG.2.2.17385.36968). 8811

Preprints 2023, 2023010044 8814
(doi: 10.20944/preprints202301.0043.v1). 8817
2023, (doi: 10.13140/RG.2.2.28945.92007). 8820

10.13140/RG.2.2.35774.77123). 8826

10.13140/RG.2.2.29430.88642). 8832

(doi: 10.20944/preprints202212.0549.v1). 8838
10.13140/RG.2.2.19380.94084). 8841

(doi: 10.20944/preprints202212.0500.v1). 8852
10.13140/RG.2.2.20993.12640). 8855
HG952 [178] Henry Garrett,“Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic 8856

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

10.13140/RG.2.2.29173.86244). 8870
HG38 [183] Henry Garrett, “Initial Material of Neutrosophic Preliminaries to Study Some Neutro- 8871
sophic Notions Based on Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic Super- 8872

HyperGraph (NSHG)”, ResearchGate 2022 (doi: 10.13140/RG.2.2.25385.88160). 8873
2023 (doi: 10.5281/zenodo.7851893). 8875

(doi: 10.5281/zenodo.7835063). 8879
(doi: 10.5281/zenodo.7826705). 8881
2023 (doi: 10.5281/zenodo.7820680). 8883
10.5281/zenodo.7812750). 8885


2023 (doi: 10.5281/zenodo.7807782). 8891
2023 (doi: 10.5281/zenodo.7804449). 8893

(doi: 10.5281/zenodo.7792307). 8897
(doi: 10.5281/zenodo.7790728). 8899
2023 (doi: 10.5281/zenodo.7787712). 8901
10.5281/zenodo.7783791). 8903

10.5281/zenodo.7780123). 8905
(doi: 10.5281/zenodo.7773119). 8907
odo.7637762). 8909
10.5281/zenodo.7766174). 8911
10.5281/zenodo.7762232). 8913
(doi: 10.5281/zenodo.7758601). 8915
10.5281/zenodo.7754661). 8917
10.5281/zenodo.7750995) . 8919
(doi: 10.5281/zenodo.7749875). 8921
10.5281/zenodo.7747236). 8923
10.5281/zenodo.7742587). 8925
(doi: 10.5281/zenodo.7738635). 8927
10.5281/zenodo.7734719). 8929
10.5281/zenodo.7730484). 8931
(doi: 10.5281/zenodo.7730469). 8933
10.5281/zenodo.7722865). 8935
odo.7713563). 8937
odo.7709116). 8939

10.5281/zenodo.7706415). 8941
(doi: 10.5281/zenodo.7706063). 8943
(doi: 10.5281/zenodo.7701906). 8945
odo.7700205). 8947
10.5281/zenodo.7694876). 8949
10.5281/zenodo.7679410). 8951
10.5281/zenodo.7675982). 8953
10.5281/zenodo.7672388). 8955
odo.7668648). 8957
10.5281/zenodo.7662810). 8959
10.5281/zenodo.7659162). 8961
HG120b [228] Henry Garrett, “Cancer In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 8962
10.5281/zenodo.7653233). 8963
odo.7653204). 8965
odo.7653142). 8967
odo.7653117). 8969
odo.7653089). 8971
odo.7651687). 8973
odo.7651619). 8975

odo.7651439). 8977
odo.7650729). 8979
odo.7647868). 8981
odo.7647017). 8983
odo.7644894). 8985
odo.7641880). 8987
odo.7632923). 8989
odo.7623459). 8991
10.5281/zenodo.7606416). 8993
10.5281/zenodo.7606416). 8995
odo.7606404). 8997
10.5281/zenodo.7580018). 8999
odo.7580018). 9001
odo.7580018). 9003
odo.7579929). 9005
10.5281/zenodo.7563170). 9007
odo.7563164). 9009
odo.7563160). 9011

odo.7563160). 9013
10.5281/zenodo.7563160). 9015
10.5281/zenodo.7557063). 9017
10.5281/zenodo.7557009). 9019
10.5281/zenodo.7539484). 9021
10.5281/zenodo.7523390). 9023
10.5281/zenodo.7523390). 9025
10.5281/zenodo.7523390). 9027
odo.7574952). 9029
10.5281/zenodo.7574992). 9031
odo.7523357). 9033
10.5281/zenodo.7523357). 9035
10.5281/zenodo.7504782). 9037
10.5281/zenodo.7504782). 9039
10.5281/zenodo.7504782). 9041
10.5281/zenodo.7499395). 9043
odo.7499395). 9045
10.5281/zenodo.7499395). 9047

10.5281/zenodo.7497450). 9049
10.5281/zenodo.7497450). 9051
10.5281/zenodo.7494862). 9053
odo.7494862). 9055
10.5281/zenodo.7494862). 9057
10.5281/zenodo.7493845). 9059
10.5281/zenodo.7493845). 9061
10.5281/zenodo.7493845). 9063
odo.7539484). 9065
odo.7523390). 9067
odo.7523357). 9069
odo.7504782). 9071
odo.7499395). 9073
odo.7497450). 9075
odo.7494862). 9077
odo.7493845). 9079
odo.7480110). 9081
odo.7378758). 9083

HG32b [289] Henry Garrett, “Beyond Neutrosophic Graphs”. Dr. Henry Garrett, 2023 (doi: 9084
10.5281/zenodo.6320305). 9085
odo.6677173). 9087

CHAPTER 44 9088
Books’ Contributions 9089
“Books’ Contributions”: | Featured Threads 9090

The following references are cited by chapters. 9091
9092
[Ref250] 9093
Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Type-Path- 9094
Neighbor In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 9095
10.5281/zenodo.7851550). 9096
9097
[Ref251] 9098
Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph 9099
By Eulerian-Type-Path-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 9100
10.5281/zenodo.7851519). 9101
9102
The links to the contributions of this scientific research book are listed below. 9103
[HG250] 9104
10.5281/zenodo.7851550). 9107
9108
[TITLE] “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Type-Path-Neighbor 9109
In Recognition of Cancer With (Neutrosophic) SuperHyperGraph” 9110

9111
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ResearchGate”] 9112
https://www.researchgate.net/publication/370155678 9113
9114
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “Scribd”:] 9115
https://www.scribd.com/document/639808202 9116
9117
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ZENODO_ORG”:] 9118
https://zenodo.org/record/7851550 9119
9120
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “academia”:] 9121
https://www.academia.edu/100524344 9122
449
Figure 44.1: Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-
Type-Path-Neighbor In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo
2023, (doi: 10.5281/zenodo.7851550).
9123
[ADDRESSED CITATION] 9124
10.5281/zenodo.7851550). 9127
[ASSIGNED NUMBER] #250 Article 9128
[DATE] April 2023 9129

[DOI] 10.5281/zenodo.7851550 9130
[LICENSE] CC BY-NC-ND 4.0 9131
[PROJECT] Neutrosophic SuperHyperGraphs and SuperHyperGraphs 9132
[AVAILABLE AT TWITTER’S IDS] WordPress ResearchGate Scribd academia ZEN- 9133
ODO_ORG Twitter facebook LinkedIn Amazon googlebooks GooglePlay 9134
9135
[HG251] 9136
10.5281/zenodo.7851519). 9139
9140
[TITLE] “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph By 9141

Eulerian-Type-Path-Neighbor As Hyper Nebbish On Super Nebulous” 9142
9143
https://www.researchgate.net/publication/370155399 9145
9146
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “Scribd”:] 9147

2023, (doi: 10.5281/zenodo.7851550).
2023, (doi: 10.5281/zenodo.7851550).

Figure 44.4: Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic
SuperHyperGraph By Eulerian-Type-Path-Neighbor As Hyper Nebbish On Super Nebulous”,
Zenodo 2023, (doi: 10.5281/zenodo.7851519).
https://www.scribd.com/document/639805345 9148
9149
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ZENODO_ORG”:] 9150
9152
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “academia”:] 9153
https://www.academia.edu/100523370 9154
9155
10.5281/zenodo.7851519). 9159
[ASSIGNED NUMBER] #251 Article 9160

[DATE] April 2023 9161
[DOI] 10.5281/zenodo.7851519 9162
[LICENSE] CC BY-NC-ND 4.0 9163
[PROJECT] Neutrosophic SuperHyperGraphs and SuperHyperGraphs 9164
[AVAILABLE AT TWITTER’S IDS] 9165
WordPress ResearchGate Scribd academia ZENODO_ORG Twitter facebook LinkedIn Amazon 9166
googlebooks GooglePlay 9167
9168
[ASSIGNED NUMBER] | Book #164 9169
Henry Garrett, “Eulerian-Type-Path-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 9171
(doi: 10.5281/zenodo.7848019). 9172


[TITLE] Eulerian-Type-Path-Neighbor In SuperHyperGraphs 9173

#Latest_Updates 9174
#The_Links 9175
9179
9181
#The_Links 9182
9183
[ASSIGNED NUMBER] | Book #164 9184

9185
[TITLE] Eulerian-Type-Path-Neighbor In SuperHyperGraphs 9186
9187
9191
– 9192
9193
[PUBLISHER] 9194
(Paperback): https://www.amazon.com/dp/- 9195
(Hardcover): https://www.amazon.com/dp/- 9196

(Kindle Edition): https://www.amazon.com/dp/- 9197
9198
– 9199
9200
[ISBN] 9201
(Paperback): - 9202
(Hardcover): - 9203
(Kindle Edition): CC BY-NC-ND 4.0 9204
(EBook): CC BY-NC-ND 4.0 9205
9206
– 9207
9208
[PRINT LENGTH] 9209
(Paperback): - pages 9210
(Hardcover): - pages 9211
(Kindle Edition): - pages 9212
(E-Book): - pages 9213
9214
– 9215
9216
9218

#The_Links 9219
9220
https://www.researchgate.net/publication/- 9222
9223
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “WordPress”] 9224
https://drhenrygarrett.wordpress.com/2023/07/22/ 9225
Eulerian-Type-Path-Neighbor-In-SuperHyperGraphs/ 9226
9227
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “Scribd”] 9228
https://www.scribd.com/document/- 9229
9230
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “academia”] 9231
https://www.academia.edu/- 9232
9233
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ZENODO_ORG”] 9234
9236
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “googlebooks”] 9237
https://books.google.com/books/about?id=- 9238
9239
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “GooglePlay”] 9240
https://play.google.com/store/books/details?id=- 9241

[TITLE] Eulerian-Type-Path-Neighbor In SuperHyperGraphs (Published Version) 9242

9243
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “WordPress”] 9244
9245
https://drhenrygarrett.wordpress.com/2023/07/22/ 9246
Eulerian-Type-Path-Neighbor-In-SuperHyperGraphs/ 9247
9248
– 9249
9250
[POSTED BY] Dr. Henry Garrett 9251
9252
[DATE] April 021, 2023 9253

9254
[POSTED IN] 164 | Eulerian-Type-Path-Neighbor In SuperHyperGraphs 9255
9256
[TAGS] 9257
Applications, Applied Mathematics, Applied Research, Cancer, Cancer’s Recognitions, Combin- 9258
atorics, Edge, Edges, Graph Theory, Graphs, Latest Research, Literature Reviews, Modeling, 9259
Neutrosophic Graph, Neutrosophic Graph Theory, Neutrosophic Science, Neutrosophic Su- 9260
perHyperClasses, Neutrosophic SuperHyperGraph, Neutrosophic SuperHyperGraph Theory, 9261
neutrosophic SuperHyperGraphs, Neutrosophic Eulerian-Type-Path-Neighbor In SuperHyper- 9262
Graphs, Open Problems, Open Questions, Problems, Pure Math, Pure Mathematics, Questions, 9263
Real-World Applications, Recent Research, Recognitions, Research, scientific research Article, 9264
scientific research Articles, scientific research Book, scientific research Chapter, scientific 9265
research Chapters, Review, SuperHyperClasses, SuperHyperEdges, SuperHyperGraph, Super- 9266

HyperGraph Theory, SuperHyperGraphs, Eulerian-Type-Path-Neighbor In SuperHyperGraphs, 9267
SuperHyperModeling, SuperHyperVertices, Theoretical Research, Vertex, Vertices. 9268
In this scientific research book, there are some scientific research chapters on “Extreme 9269
Eulerian-Type-Path-Neighbor In SuperHyperGraphs” and “Neutrosophic Eulerian-Type-Path- 9270
Neighbor In SuperHyperGraphs” about some scientific research on Eulerian-Type-Path-Neighbor 9271
In SuperHyperGraphs by two (Extreme/Neutrosophic) notions, namely, Extreme Eulerian- 9272

Type-Path-Neighbor In SuperHyperGraphs and Neutrosophic Eulerian-Type-Path-Neighbor In 9273
SuperHyperGraphs. With scientific research on the basic scientific research properties, the 9274
scientific research book starts to make Extreme Eulerian-Type-Path-Neighbor In SuperHyper- 9275
Graphs theory and Neutrosophic Eulerian-Type-Path-Neighbor In SuperHyperGraphs theory 9276
more (Extremely/Neutrosophicly) understandable. 9277

CHAPTER 45 9278
“SuperHyperGraph-Based Books”: | 9279
Featured Tweets 9280
“SuperHyperGraph-Based Books”: | Featured Tweets 9281
457
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 9282
CV 9283
485
9284
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
9285
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)
9286
Publications: Articles
2023 245 Manuscript
Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph

By Eulerian-Path-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi:
10.5281/zenodo.7824560).
@ResearchGate: https://www.researchgate.net/publication/369977142
@Scribd: https://www.scribd.com/document/637993759
@ZENODO_ORG: https://zenodo.org/record/7824560
@academia: https://www.academia.edu/100136177
2023 244 Manuscript
Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Path-

Neighbor In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi:
10.5281/zenodo.7824623).
2023 243 Manuscript

By Eulerian-Path-Decomposition As Hyper Decompress On Super Decompensation”, Zenodo
2023, (doi: 10.5281/zenodo.7819531).
2023 242 Manuscript
Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of Eulerian-

Path-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo
2023, (doi: 10.5281/zenodo.7819579).
2023 241 Manuscript

As Hyper Tool On Super Toot”, Zenodo 2023, (doi: 10.5281/zenodo.7812236).
2023 240 Manuscript

9287

By initial Eulerian-Path-Cut As Hyper initial Eulogy On Super initial EULA”, Zenodo 2023,
(doi: 10.5281/zenodo.7809365).
2023 239 Manuscript

By Eulerian-Path-Cut As Hyper Eulogy-Path-Cut On Super EULA-Path-Cut”, Zenodo 2023,
(doi: 10.5281/zenodo.7809358).
2023 238 Manuscript

By Eulerian-Path-Cut As Hyper Eulogy On Super EULA”, Zenodo 2023, (doi:
10.5281/zenodo.7809328).
2023 237 Manuscript
Henry Garrett, “New Ideas On Super EULA By Hyper Eulogy Of Eulerian-Path-

Cut In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi:
10.5281/zenodo.7809219).
2023 236 Manuscript

By Hamiltonian-Type-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023,
(doi: 10.5281/zenodo.7806767).
2023 235 Manuscript

9288
Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Hamiltonian-Type-
Cycle-Neighbor In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo
2023, (doi: 10.5281/zenodo.7806838).
2023 234 Manuscript
Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic

SuperHyperGraph By Hamiltonian-Type-Cycle-Decomposition As Hyper Decompress
On Super Decompensation”, Zenodo 2023, (doi: 10.5281/zenodo.7804238).
2023 233 Manuscript
Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress

Of Hamiltonian-Type-Cycle-Decomposition In Cancer’s Recognition With (Neutrosophic)
SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zenodo.7804228).
2023 232 Manuscript

By Hamiltonian-Type-Cycle-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi:
10.5281/zenodo.7799902).
2023 231 Manuscript
Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Type-

Cycle-Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023,
(doi: 10.5281/zenodo.7804218).
2023 230 Manuscript

9289
By Hamiltonian-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi:
10.5281/zenodo.7796334).
2023 229 Manuscript
Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Hamiltonian-Cycle-

Neighbor In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023,
(doi: 10.5281/zenodo.7796354).
2023 228 Manuscript

By Hamiltonian-Cycle-Decomposition As Hyper Decompress On Super Decompensation”,
2023 227 Manuscript

Of Hamiltonian-Cycle-Decomposition In Recognition of Cancer With (Neutrosophic)
2023 226 Manuscript

By Hamiltonian-Cycle-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi:
10.5281/zenodo.7791952).
2023 225 Manuscript

9290
Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Cycle-
Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi:
10.5281/zenodo.7791982).
2023 224 Manuscript

By Hamiltonian-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi:
10.5281/zenodo.7790026).
2023 223 Manuscript
Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Hamiltonian-

Neighbor In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023,
(doi: 10.5281/zenodo.7790052).
2023 222 Manuscript

By Hamiltonian-Decomposition As Hyper Decompress On Super Decompensation”, Zenodo
2023, (doi: 10.5281/zenodo.7787066).
2023 221 Manuscript

Of Hamiltonian-Decomposition In Recognition of Cancer With (Neutrosophic)
2023 220 Manuscript

9291
By Hamiltonian-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi:
10.5281/zenodo.7781476).
2023 219 Manuscript
Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-

Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi:
10.5281/zenodo.7783082).
2023 218 Manuscript

By Trace-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi:
10.5281/zenodo.7777857).
2023 217 Manuscript
Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Trace-Neighbor

In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi:
10.5281/zenodo.7779286).
2023 216 Article

9292
Henry Garrett, “A Research on Cancers Recognition and Neutrosophic Super
Hypergraph by Eulerian Super Hyper Cycles and Hamiltonian Sets as Hyper Covering
Versus Super separations”, J Math Techniques Comput Math 2(3) (2023) 136-148.
(https://www.opastpublishers.com/open-access-articles/a-research-on-cancers-recognition-
and-neutrosophic-super-hypergraph-by-eulerian-super-hyper-cycles-and-hamiltonian-sets-
.pdf)
The links to PDF, its abstract, its citation and the volume are as follows.
PDF: https://www.opastpublishers.com/open-access-articles/a-research-on-cancers-
recognition-and-neutrosophic-super-hypergraph-by-eulerian-super-hyper-cycles-and-
hamiltonian-sets-.pdf
Abstract:https://www.opastpublishers.com/peer-review/a-research-on-cancers-recognition-
and-neutrosophic-super-hypergraph-by-eulerian-super-hyper-cycles-and-hamiltonian-sets–
5309.html
Citation: https://www.opastpublishers.com/citation/a-research-on-cancers-recognition-
and-neutrosophic-super-hypergraph-by-eulerian-super-hyper-cycles-and-hamiltonian-sets–
5309.html
Volume:https://www.opastpublishers.com/journal/journal-of-mathematics-
techniques/articles-in-press
JMTCM: https://www.opastpublishers.com/open-access-articles/a-research-on-cancers-
recognition-and-neutrosophic-super-hypergraph-by-eulerian-super-hyper-cycles-and-
hamiltonian-sets-.pdf
@ZENODOO RG : https : //zenodo.org/record/7774581
2023 215 Manuscript
Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph By

Trace-Decomposition As Hyper Decompress On Super Decompensation”, Zenodo 2023, (doi:
10.5281/zenodo.7771831).
@Scribd: https://www.scribd.com/document/-
2023 214 Manuscript
Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of Trace-

Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023,
(doi: 10.5281/zenodo.7772468).
2023 213 Manuscript
Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph

By Trace-Cut As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi:
10.13140/RG.2.2.20913.25446).
9293
2023 212 Manuscript
Henry Garrett, “New Ideas On Super Tract By Hyper Track Of Trace-Cut

In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi:
10.5281/zenodo.7764916).
2023 211 Manuscript

By Edge-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi:
10.13140/RG.2.2.11770.98247).
2023 210 Manuscript
Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Edge-Neighbor

In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi:
10.13140/RG.2.2.12400.12808).
2023 209 Manuscript

Edge-Decomposition As Hyper Decompress On Super Decompensation”, ResearchGate 2023,
(doi: 10.13140/RG.2.2.22545.10089).
2023 208 Manuscript
Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of

Edge-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”,
ResearchGate 2023, (doi: 10.13140/RG.2.2.29544.34564).
2023 207 Manuscript

9294
Edge-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”,
2023 207 Manuscript
Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic

SuperHyperGraph By Edge-Cut As Hyper Edify On Super Eddy”, ResearchGate 2023,
(doi: 10.13140/RG.2.2.11377.76644).
2023 206 Manuscript
Henry Garrett, “New Ideas On Super Eddy By Hyper Edify Of Edge-Cut In

Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi:
10.13140/RG.2.2.23750.96329).
2023 205 Manuscript

By Vertex-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi:
10.13140/RG.2.2.31366.24641).
2023 204 Manuscript
Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Vertex-Neighbor

10.13140/RG.2.2.34721.68960).
2023 203 Manuscript

9295
By Vertex-Decomposition As Hyper Decompress On Super Decompensation”, ResearchGate
2023, (doi: 10.13140/RG.2.2.30212.81289).
2023 202 Manuscript

Vertex-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”,
2023 201 Manuscript

By Vertex-Cut As Hyper Vertu On Super Vertigo”, ResearchGate 2023, (doi:
10.13140/RG.2.2.24288.35842).
2023 200 Manuscript
Henry Garrett, “New Ideas On Super Vertigo By Hyper Vertu Of Vertex-Cut In

10.13140/RG.2.2.32467.25124).
2023 199 Manuscript

By Stable-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi:
10.13140/RG.2.2.31025.45925).
2023 198 Manuscript

9296
Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of Stable-Neighbor
10.13140/RG.2.2.17184.25602).
2023 197 Manuscript

By Stable-Decompositions As Hyper Stain On Super Stagy”, ResearchGate 2023, (doi:
10.13140/RG.2.2.23423.28327).
2023 196 Manuscript
Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Decompositions

10.13140/RG.2.2.28456.44805).
2023 195 Manuscript

By Stable-Cut As Hyper Stain On Super Stagy”, ResearchGate 2023, (doi:
10.13140/RG.2.2.23525.68320).
2023 194 Manuscript
Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Cut In

10.13140/RG.2.2.20170.24000).
2023 193 Manuscript

9297
By Clique-Neighbors As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi:
10.13140/RG.2.2.36475.59683).
2023 192 Manuscript
Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of Clique-Neighbors

10.13140/RG.2.2.29764.71046).
2023 191 Manuscript

By Clique-Decompositions As Hyper Decompile On Super Decommission”, ResearchGate 2023,
(doi: 10.13140/RG.2.2.18780.87683).
2023 190 Manuscript

Clique-Decompositions In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”,
2023 189 Manuscript

By Clique-Cut As Hyper Click On Super Cliche”, ResearchGate 2023, (doi:
10.13140/RG.2.2.26134.01603).
2023 188 Manuscript

9298
Henry Garrett, “New Ideas On Super Cliff By Hyper Cling Of Clique-Cut In
10.13140/RG.2.2.27392.30721).
2023 187 Manuscript

SuperHyperGraph By Space As Hyper Spin On Super Spacy”, ResearchGate 2023, (doi:
10.13140/RG.2.2.33028.40321).
2023 186 Manuscript

By List-Coloring As Hyper List On Super Lisle”, ResearchGate 2023, (doi:
10.13140/RG.2.2.21389.20966).
2023 185 Manuscript
Henry Garrett, “New Ideas On Super Lith By Hyper Lite Of List-Coloring In

10.13140/RG.2.2.16356.04489).
2023 184 Manuscript

SuperHyperGraph By Space As Hyper Sparse On Super Spark”, ResearchGate 2023,
(doi: 10.13140/RG.2.2.21756.21129).
2023 183 Manuscript

9299
Henry Garrett, “New Ideas On Super Solidarity By Hyper Soul Of Space In
Cancer’s Recognition With (Extreme) SuperHyperGraph”, ResearchGate 2023, (doi:
10.13140/RG.2.2.30983.68009).
2023 182 Manuscript

By Edge-Connectivity As Hyper Disclosure On Super Closure”, ResearchGate 2023, (doi:
10.13140/RG.2.2.28552.29445).
2023 181 Manuscript
Henry Garrett, “New Ideas On Super Uniform By Hyper Deformation Of Edge-Connectivity

10.13140/RG.2.2.10936.21761).
2023 180 Manuscript

By Vertex-Connectivity As Hyper Leak On Super Structure”, ResearchGate 2023, (doi:
10.13140/RG.2.2.35105.89447).
2023 179 Manuscript
Henry Garrett, “New Ideas On Super System By Hyper Explosions Of Vertex-Connectivity

10.13140/RG.2.2.30072.72960).
2023 178 Manuscript

9300
By Tree-Decomposition As Hyper Forward On Super Returns”, ResearchGate 2023, (doi:
10.13140/RG.2.2.31147.52003).
2023 177 Manuscript
Henry Garrett, “New Ideas On Super Nodes By Hyper Moves Of Tree-Decomposition

10.13140/RG.2.2.32825.24163).
2023 176 Manuscript

By Chord As Hyper Excellence On Super Excess”, ResearchGate 2023, (doi:
10.13140/RG.2.2.13059.58401).
2023 175 Manuscript
Henry Garrett, “New Ideas On Super Gap By Hyper Navigations Of Chord In

10.13140/RG.2.2.11172.14720).
2023 174 Manuscript

By SuperHyper(i,j)-Domination As Hyper Controller On Super Waves”, ResearchGate 2023,
(doi: 10.13140/RG.2.2.22011.80165).
2023 173 Manuscript

9301
Henry Garrett, “New Ideas On Super Coincidence By Hyper Routes Of SuperHyper(i,j)-
Domination In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate
2023, (doi: 10.13140/RG.2.2.30819.84003).
2023 172 Manuscript

By SuperHyperEdge-Domination As Hyper Reversion On Super Indirection”, ResearchGate
2023, (doi: 10.13140/RG.2.2.10493.84962).
2023 171 Manuscript
Henry Garrett, “New Ideas On Super Obstacles By Hyper Model Of SuperHyperEdge-

2023, (doi: 10.13140/RG.2.2.13849.29280).
2023 170 Manuscript

By SuperHyperK-Domination As Hyper k-Actions On Super Patterns”, ResearchGate 2023,
(doi: 10.13140/RG.2.2.19944.14086).
2023 169 Manuscript
Henry Garrett, “New Ideas On Super Harmony By Hyper k-Function Of SuperHyperK-

2023, (doi: 10.13140/RG.2.2.23299.58404).
2023 168 Manuscript

9302
By SuperHyperK-Number As Hyper k-Partition On Super Layers”, ResearchGate 2023, (doi:
10.13140/RG.2.2.33103.76968).
2023 167 Manuscript
Henry Garrett, “New Ideas On Super Gradient By Hyper k-Class Of SuperHyperK-Number

10.13140/RG.2.2.23037.44003).
2023 166 Manuscript

SuperHyperOrder As Hyper Enumerations On Super Landmarks”, ResearchGate 2023, (doi:
10.13140/RG.2.2.35646.56641).
2023 165 Manuscript
Henry Garrett, “New Ideas On Super Analogous By Hyper Visions Of SuperHyperOrder

10.13140/RG.2.2.18030.48967).
2023 164 Manuscript

By SuperHyperColoring As Hyper Categories On Super Neighbors”, ResearchGate 2023, (doi:
10.13140/RG.2.2.13973.81121).
2023 163 Manuscript

9303
Henry Garrett, “New Ideas On Super Relations By Hyper Identifications Of
SuperHyperColoring In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”,
2023 162 Manuscript
Henry Garrett, “New Ideas On Super Contradiction By Hyper Detection

of SuperHyperDefensive In Cancer’s Neutrosophic Recognition and Neutrosophic
SuperHyperGraph”, ResearchGate 2023, (doi: 10.13140/RG.2.2.13397.09446).
2023 161 Manuscript

By SuperHyperDimension As Hyper Distinguishing On Super Distances”, ResearchGate 2023,
(doi: 10.13140/RG.2.2.31956.88961).
2023 160 Manuscript
Henry Garrett, “New Ideas On Super Locations By Hyper Differing Of SuperHyperDimension

10.13140/RG.2.2.15179.67361).
2023 159 Manuscript

By SuperHyperDominating As Hyper Closing On Super Messy”, ResearchGate 2023, (doi:
10.13140/RG.2.2.21510.45125).
2023 158 Manuscript
Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDominating

10.13140/RG.2.2.13121.84321).
9304
2023 157 Manuscript

By SuperHyperConnected As Hyper Group On Super Surge”, ResearchGate 2023, (doi:
10.13140/RG.2.2.11758.69441).
2023 156 Manuscript
Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of

SuperHyperConnected In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”,
2023 155 Manuscript

By SuperHyperTotal As Hyper Covering On Super Infections”, ResearchGate 2023, (doi:
10.13140/RG.2.2.19360.87048).
2023 154 Manuscript
Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal

In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi:
10.13140/RG.2.2.32363.21286).
2023 153 Manuscript
Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect

In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi:
10.13140/RG.2.2.23266.81602).
2023 152 Manuscript

By SuperHyperPerfect As Hyper Idealism On Super Vacancy”, ResearchGate 2023, (doi:
10.13140/RG.2.2.19911.37285).
@Scribd: https://www.researchgate.net/publication/368537004
2023 151 Manuscript

9305

By SuperHyperJoin As Hyper Separations On Super Sorts”, ResearchGate 2023, (doi:
10.13140/RG.2.2.11050.90569).
2023 150 Manuscript
Henry Garrett, “New Ideas On Super connections By Hyper disconnections

Of SuperHyperJoin In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”,
2023 149 Manuscript
Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions

Of SuperHyperDuality In Cancer’s Neutrosophic Recognition and Neutrosophic
2023 148 Manuscript
Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph

By SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchGate
2023, (doi: 10.13140/RG.2.2.33275.80161).
2023 147 Manuscript
Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph

By Path SuperHyperColoring As Hyper Correction On Super Faults”, ResearchGate 2023, (doi:
10.13140/RG.2.2.30182.50241).
2023 146 Manuscript
Henry Garrett, “New Ideas On Super Reflections By Hyper Rotations Of

Path SuperHyperColoring In Cancer’s Neutrosophic Recognition and Neutrosophic
2023 145 Manuscript

9306
Henry Garrett, “New Ideas As Hyper Deformations On Super Chains In Cancer’s
Neutrosophic Recognition and Neutrosophic SuperHyperGraph By SuperHyperDensity”,
2023 144 Manuscript
Henry Garrett, “New Ideas As Hyper Ignorance By SuperHyperDensity On Super Resistances

In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, ResearchGate
2023, (doi:10.13140/RG.2.2.16800.05123).
2023 143 Manuscript
Henry Garrett, “New Research On Cancer’s Recognition and Neutrosophic SuperHyperGraph

By Eulerian SuperHyperCycles and Hamiltonian Sets As Hyper Covering Versus Super
separations-VI”, ResearchGate 2023, (doi: 10.13140/RG.2.2.29913.80482).
@WordPress: -
2023 142 Manuscript

separations-V”, ResearchGate 2023, (doi: 10.13140/RG.2.2.33269.24809).
@WordPress: -
@Scribd:https://www.scribd.com/document/624023778
2023 141 Manuscript

separations-IV”, ResearchGate 2023, (doi: 10.13140/RG.2.2.34946.96960).
@WordPress: -
2023 140 Manuscript
Henry Garrett, “A Research On Cancer’s Recognition and Neutrosophic SuperHyperGraph

separations-III”, ResearchGate 2023, (doi: 10.13140/RG.2.2.14814.31040).
@WordPress: -
2023 139 Manuscript

9307

separations-II”, ResearchGate 2023, (doi: 10.13140/RG.2.2.15653.17125).
@WordPress: -
2023 138 Manuscript

separations-I”, ResearchGate 2023, (doi: 10.13140/RG.2.2.25719.50089).
@WordPress: -
2023 137 Manuscript
Henry Garrett, “New Ideas On Super Disruptions In Cancer’s Extreme Recognition

As Neutrosophic SuperHyperGraph By Hyper Plans Called SuperHyperConnectivities”,
@WordPress: -
2023 136 Manuscript
Henry Garrett, “Cancer’s Neutrosophic Recognition As Neutrosophic SuperHyperGraph

By SuperHyperConnectivities As Hyper Diagnosis On Super Mechanism”, ResearchGate 2023,
(doi: 10.13140/RG.2.2.17252.24968).
@WordPress: -
2023 135 Manuscript
Henry Garrett,“Cancer’s Recognition and (Neutrosophic) SuperHyperGraph By the

Criteria of Eulerian and Hamiltonian Type-Sets As Hyper Modified Cycles On Super Mess”,
ResearchGate 2023,(doi: 10.13140/RG.2.2.16652.59525).
@WordPress: -
2023 134 Manuscript
Henry Garrett,“Eulerian and Hamiltonian In Cancer’s Neutrosophic Recognition and

Neutrosophic SuperHyperGraph On Super Interactions By Hyper Extensions of Cycles”,
ResearchGate 2023,(doi: 10.13140/RG.2.2.34583.24485).
@WordPress: -
9308
2023 Article133 (JMTCM) Article
Henry Garrett, “Some Super Hyper Degrees and Co-Super Hyper Degrees on Neutrosophic
Super Hyper Graphs And Super Hyper Graphs Alongside Applications in Cancer’s
Treatments”, J Math Techniques Comput Math 2(1) (2023) 35-47.
(https://www.opastpublishers.com/open-access-articles/some-super-hyper-degrees-
and-cosuper-hyper-degrees-on-neutrosophic-super-hyper-graphs-and-super-hyper-graphs-
alongside-a.pdf)
The links to PDF, its abstract, its citation and the volume are as follows.
PDF:https://www.opastpublishers.com/open-access-articles/some-super-hyper-degrees-
and-cosuper-hyper-degrees-on-neutrosophic-super-hyper-graphs-and-super-hyper-graphs-
alongside-a.pdf
Abstract:https://www.opastpublishers.com/peer-review/some-super-hyper-degrees-and-
cosuper-hyper-degrees-on-neutrosophic-super-hyper-graphs-and-super-hyper-graphs-
alongside-a-5009.html
Citation:https://www.opastpublishers.com/citation/some-super-hyper-degrees-and-cosuper-
hyper-degrees-on-neutrosophic-super-hyper-graphs-and-super-hyper-graphs-alongside-a-
5009.html
Volume:https://www.opastpublishers.com/table-contents/jmtcm-volume-2-issue-1-year-2023
2023 132 Manuscript
Henry Garrett,“SuperHyperGirth Type-Results on extreme SuperHyperGirth theory and

(Neutrosophic) SuperHyperGraphs Toward Cancer’s extreme Recognition”, Preprints 2023,
2023010396 (doi: 10.20944/preprints202301.0396.v1).
@WordPress: -
@PrePrints_ORG: https://www.preprints.org/manuscript/202301.0396/v1
@ZENODO_ORG:https://zenodo.org/record/7559540
2023 131 Manuscript
Henry Garrett,“Neutrosophic SuperHyperGraphs Warns Hyper Landmark of neutrosophic

SuperHyperGirth In Super Type-Versions of Cancer’s neutrosophic Recognition”, Preprints
2023, 2023010395 (doi: 10.20944/preprints202301.0395.v1).
@WordPress: -
@PrePrints_ORG: https://www.preprints.org/manuscript/202301.0395/v1
2023 130 Manuscript
Henry Garrett,“The Constructions of (Neutrosophic) SuperHyperGraphs on the Cancer’s

Recognition in The Confrontation With Super Attacks In Hyper Situations By Implementing
(Neutrosophic) 1-Failed SuperHyperForcing in The Technical Approaches to Neutralize
SuperHyperViews”, ResearchGate 2023, (doi: 10.13140/RG.2.2.26240.51204).
@WordPress: -
2023 129 Manuscript

9309
Henry Garrett,“(Neutrosophic) 1-Failed SuperHyperForcing As the Entrepreneurs on
Cancer’s Recognitions To Fail Forcing Style As the Super Classes With Hyper Effects In The
Background of the Framework is So-Called (Neutrosophic) SuperHyperGraphs”, ResearchGate
2023, (doi: 10.13140/RG.2.2.12818.73925).
@WordPress: -
2023 128 Manuscript
Henry Garrett,“Super Actions On The Types of Hyper Levels In The Sensible

Neutrosophic SuperHyperGirth On Cancer’s Neutrosophic Recognition and Neutrosophic
SuperHyperGraph”, ResearchGate 2023,(doi: 10.13140/RG.2.2.26836.88960).
@WordPress: -
2023 127 Manuscript
Henry Garrett,“SuperHyperGirth Approaches on the Super Challenges on the Cancer’s

Recognition In the Hyper Model of (Neutrosophic) SuperHyperGraph”, ResearchGate
2023,(doi: 10.13140/RG.2.2.36745.93289).
@WordPress: -
@ResearchGate:https://www.researchgate.net/publication/367336398
2023 0126 | Extreme SuperHyperClique as the Firm Scheme of Confrontation under Cancer’s Recognition Manuscript
as the Model in The Setting of (Neutrosophic) SuperHyperGraphs
Henry Garrett,“Extreme SuperHyperClique as the Firm Scheme of Confrontation under
Cancer’s Recognition as the Model in The Setting of (Neutrosophic) SuperHyperGraphs”,
Preprints 2023, 2023010308 (doi: 10.20944/preprints202301.0308.v1).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn
2023 0125 | Uncertainty On The Act And Effect Of Cancer Alongside The Foggy Positions Of Cells Manuscript
Toward Neutrosophic Failed SuperHyperClique inside Neutrosophic SuperHyperGraphs Titled Cancer’s
Recognition
Henry Garrett,“Uncertainty On The Act And Effect Of Cancer Alongside The Foggy
Positions Of Cells Toward Neutrosophic Failed SuperHyperClique inside Neutrosophic
SuperHyperGraphs Titled Cancer’s Recognition”, Preprints 2023, 2023010282 (doi:
10.20944/preprints202301.0282.v1).
2023 0124 | Neutrosophic Version Of Separates Groups Of Cells In Cancer’s Recognition On Neutrosophic Manuscript
SuperHyperGraphs
Henry Garrett,“Neutrosophic Version Of Separates Groups Of Cells In Cancer’s
Recognition On Neutrosophic SuperHyperGraphs”, Preprints 2023, 2023010267 (doi:
10.20944/preprints202301.0267.v1).).
2023 0123 | The Shift Paradigm To Classify Separately The Cells and Affected Cells Toward The Totality Manuscript
Under Cancer’s Recognition By New Multiple Definitions On the Sets Polynomials Alongside Numbers
In The (Neutrosophic) SuperHyperMatching Theory Based on SuperHyperGraph and Neutrosophic
SuperHyperGraph
Henry Garrett, “The Shift Paradigm To Classify Separately The Cells and Affected Cells
Toward The Totality Under Cancer’s Recognition By New Multiple Definitions On the Sets
Polynomials Alongside Numbers In The (Neutrosophic) SuperHyperMatching Theory Based
on SuperHyperGraph and Neutrosophic SuperHyperGraph”, Preprints 2023, 2023010265 (doi:
10.20944/preprints202301.0265.v1).
9310
2023 0122 | Breaking the Continuity and Uniformity of Cancer In The Worst Case of Full Manuscript
Connections With Extreme Failed SuperHyperClique In Cancer’s Recognition Applied in (Neutrosophic)
SuperHyperGraphs
Henry Garrett,“Breaking the Continuity and Uniformity of Cancer In The
Worst Case of Full Connections With Extreme Failed SuperHyperClique In Cancer’s
Recognition Applied in (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010262,(doi:
10.20944/preprints202301.0262.v1).
2023 0121 | Neutrosophic Failed SuperHyperStable as the Survivors on the Cancer’s Neutrosophic Manuscript
Recognition Based on Uncertainty to All Modes in Neutrosophic SuperHyperGraphs
Henry Garrett, “Neutrosophic Failed SuperHyperStable as the Survivors on the
Cancer’s Neutrosophic Recognition Based on Uncertainty to All Modes in Neutrosophic
SuperHyperGraphs”, Preprints 2023, 2023010240 (doi: 10.20944/preprints202301.0240.v1).
2023 0120 | Extremism of the Attacked Body Under the Cancer’s Circumstances Where Cancer’s Manuscript
Recognition Titled (Neutrosophic) SuperHyperGraphs
Henry Garrett, “Extremism of the Attacked Body Under the Cancer’s Circumstances Where
Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010224,
(doi: 10.20944/preprints202301.0224.v1).
2023 0119 | SuperHyperMatching By (R-)Definitions And Polynomials To Monitor Cancer’s Recognition Manuscript
In Neutrosophic SuperHyperGraphs
Henry Garrett,“SuperHyperMatching By (R-)Definitions And Polynomials To Monitor
Cancer’s Recognition In Neutrosophic SuperHyperGraphs”, ResearchGate 2023,(doi:
10.13140/RG.2.2.35061.65767).
2023 0118 | The Focus on The Partitions Obtained By Parallel Moves In The Cancer’s Extreme Recognition Manuscript
With Different Types of Extreme SuperHyperMatching Set and Polynomial on (Neutrosophic)
SuperHyperGraphs
Henry Garrett,“The Focus on The Partitions Obtained By Parallel Moves In The
Cancer’s Extreme Recognition With Different Types of Extreme SuperHyperMatching
Set and Polynomial on (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023,(doi:
10.13140/RG.2.2.18494.15680).
2023 0117 | Indeterminacy On The All Possible Connections of Cells In Front of Cancer’s Attacks In Manuscript
The Terms of Neutrosophic Failed SuperHyperClique on Cancer’s Recognition called Neutrosophic
SuperHyperGraphs
Henry Garrett,“Extreme Failed SuperHyperClique Decides the Failures on the Cancer’s
Recognition in the Perfect Connections of Cancer’s Attacks By SuperHyperModels Named
(Neutrosophic) SuperHyperGraphs”, ResearchGate 2023,(doi: 10.13140/RG.2.2.15897.70243).
2023 0116 | Extreme Failed SuperHyperClique Decides the Failures on the Cancer’s Recognition Manuscript
in the Perfect Connections of Cancer’s Attacks By SuperHyperModels Named (Neutrosophic)
SuperHyperGraphs
Henry Garrett,“Extreme Failed SuperHyperClique Decides the Failures on the Cancer’s
Recognition in the Perfect Connections of Cancer’s Attacks By SuperHyperModels Named
(Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 10.13140/RG.2.2.32530.73922).
2023 0115 | (Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Recognitions And (Neutrosophic) Manuscript
SuperHyperGraphs
Henry Garrett, “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s
Recognitions And (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010105 (doi:
10.20944/preprints202301.0105.v1).
2023 0114 | Perfect Directions Toward Idealism in Cancer’s Neutrosophic Recognition Forwarding Manuscript
Neutrosophic SuperHyperClique on Neutrosophic SuperHyperGraphs
9311
Henry Garrett,“Perfect Directions Toward Idealism in Cancer’s Neutrosophic Recognition

Forwarding Neutrosophic SuperHyperClique on Neutrosophic SuperHyperGraphs”,
2023 0113 | Demonstrating Complete Connections in Every Embedded Regions and Sub-Regions in Manuscript
the Terms of Cancer’s Recognition and (Neutrosophic) SuperHyperGraphs With (Neutrosophic)
SuperHyperClique
Henry Garrett,“Demonstrating Complete Connections in Every Embedded Regions and Sub-
Regions in the Terms of Cancer’s Recognition and (Neutrosophic) SuperHyperGraphs With
(Neutrosophic) SuperHyperClique”, ResearchGate 2023, (doi: 10.13140/RG.2.2.23172.19849).
2023 0112 | Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic) SuperHyperModeling Manuscript
in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs
Henry Garrett, “Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic)
SuperHyperModeling in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs”,
2023 0111 | Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic SuperHyperStable To Manuscript

Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints
Henry Garrett, “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic
SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints”,
2023 0110 | Different Neutrosophic Types of Neutrosophic Regions titled neutrosophic Failed Manuscript
SuperHyperStable in Cancer’s Neutrosophic Recognition modeled in the Form of Neutrosophic
SuperHyperGraphs
Henry Garrett,“Different Neutrosophic Types of Neutrosophic Regions titled neutrosophic
Failed SuperHyperStable in Cancer’s Neutrosophic Recognition modeled in the Form of
Neutrosophic SuperHyperGraphs”, ResearchGate 2023, (doi: 10.13140/RG.2.2.17385.36968).
2022 0109 | 0039 | Closing Numbers and Super-Closing Numbers as (Dual)Resolving and (Dual)Coloring Manuscript
alongside (Dual)Dominating in (Neutrosophic)n-SuperHyperGraph
Garrett, Henry. “0039 | Closing Numbers and Super-Closing Numbers as (Dual)Resolving and
(Dual)Coloring alongside (Dual)Dominating in (Neutrosophic)n-SuperHyperGraph.” CERN
European Organization for Nuclear Research - Zenodo, Nov. 2022. CERN European
Organization for Nuclear Research, https://doi.org/10.5281/zenodo.6319942.
https://oa.mg/work/10.5281/zenodo.6319942
2022 0108 | 0049 | (Failed)1-Zero-Forcing Number in Neutrosophic Graphs Manuscript
Garrett, Henry. “0049 | (Failed)1-Zero-Forcing Number in Neutrosophic Graphs.” CERN

European Organization for Nuclear Research - Zenodo, Feb. 2022. CERN European
Organization for Nuclear Research, https://doi.org/10.13140/rg.2.2.35241.26724.
https://oa.mg/work/10.13140/rg.2.2.35241.26724
2023 0107 | Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To Use Neutrosophic Manuscript
SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond
Henry Garrett, “Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To
Use Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond”,
Preprints 2023, 2023010044
2023 0106 | (Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well-SuperHyperModelled Manuscript

(Neutrosophic) SuperHyperGraphs
9312
Henry Garrett, “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well-

SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010043 (doi:
10.20944/preprints202301.0043.v1).
2022 Article105 (JMTCM) Article
Henry Garrett, “Super Hyper Dominating and Super Hyper Resolving on Neutrosophic Super
Hyper Graphs and Their Directions in Game Theory and Neutrosophic Super Hyper Classes”,
J Math Techniques Comput Math 1(3) (2022) 242-263. (doi: 10.33140/JMTCM.01.03.09).
2023 0104 | Using the Tool As (Neutrosophic) Failed SuperHyperStable To SuperHyperModel Cancer’s Manuscript
Recognition Titled (Neutrosophic) SuperHyperGraphs
Henry Garrett,“Using the Tool As (Neutrosophic) Failed SuperHyperStable To
SuperHyperModel Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs”,
2023 0103 | Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic SuperHyperStable To Manuscript

Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints
Henry Garrett,“Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic
SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints”,
2023 0102 | (Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well-SuperHyperModelled Manuscript

(Neutrosophic) SuperHyperGraphs
Henry Garrett,“(Neutrosophic) SuperHyperStable on Cancer’s Recognition by
Well-SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi:
10.13140/RG.2.2.35774.77123).
2022 0101 | Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To Use Neutrosophic Manuscript
SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond
Henry Garrett,“Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To
Use Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond”,
2022 0100 | (Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Recognitions And (Neutrosophic) Manuscript
SuperHyperGraphs
Henry Garrett,“(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Recognitions And
(Neutrosophic) SuperHyperGraphs”, ResearchGate 2022, (doi: 10.13140/RG.2.2.29430.88642).
2022 0099 | Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic) SuperHyperModeling Manuscript
in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs
Henry Garrett,“Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic)
SuperHyperModeling in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs”,
2022 0098 | (Neutrosophic) SuperHyperModeling of Cancer’s Recognitions Featuring (Neutrosophic) Manuscript

SuperHyperDefensive SuperHyperAlliances
Henry Garrett, “(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions Featuring
(Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, Preprints 2022, 2022120549 (doi:
10.20944/preprints202212.0549.v1).
2022 0098 | (Neutrosophic) SuperHyperModeling of Cancer’s Recognitions Featuring (Neutrosophic) Manuscript

SuperHyperDefensive SuperHyperAlliances
9313
Henry Garrett, “(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions

Featuring (Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, ResearchGate 2022,
(doi: 10.13140/RG.2.2.19380.94084).
2022 0097 | (Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and SuperHyperOffensive Manuscript

Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With (Neutrosophic) SuperHyperModeling
of Cancer’s Recognitions And Related (Neutrosophic) SuperHyperClasses

Henry Garrett, “(Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and
SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With
(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions And Related (Neutrosophic)
SuperHyperClasses”, Preprints 2022, 2022120540 (doi: 10.20944/preprints202212.0540.v1).
2022 0097 | (Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and SuperHyperOffensive Manuscript

Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With (Neutrosophic) SuperHyperModeling
of Cancer’s Recognitions And Related (Neutrosophic) SuperHyperClasses

Henry Garrett, “(Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and
SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With
(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions And Related (Neutrosophic)
SuperHyperClasses”, ResearchGate 2022, (doi: 10.13140/RG.2.2.14426.41923).
2022 0096 | SuperHyperGirth on SuperHyperGraph and Neutrosophic SuperHyperGraph With Manuscript

SuperHyperModeling of Cancer’s Recognitions
Henry Garrett, “SuperHyperGirth on SuperHyperGraph and Neutrosophic
SuperHyperGraph With SuperHyperModeling of Cancer’s Recognitions”, Preprints 2022,
2022120500 (doi: 10.20944/preprints202212.0500.v1).
2022 0096 | SuperHyperGirth on SuperHyperGraph and Neutrosophic SuperHyperGraph With Manuscript

SuperHyperModeling of Cancer’s Recognitions
Henry Garrett, “SuperHyperGirth on SuperHyperGraph and Neutrosophic
SuperHyperGraph With SuperHyperModeling of Cancer’s Recognitions”, ResearchGate
2022 (doi: 10.13140/RG.2.2.20993.12640).
2022 0095 | Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic SuperHyperGraphs Manuscript

and SuperHyperGraphs Alongside Applications in Cancer’s Treatments
Henry Garrett,“Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic
SuperHyperGraphs and SuperHyperGraphs Alongside Applications in Cancer’s Treatments”,
2022 0095 | Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic SuperHyperGraphs Manuscript

And SuperHyperGraphs Alongside Applications in Cancer’s Treatments
Henry Garrett, “Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic
SuperHyperGraphs And SuperHyperGraphs Alongside Applications in Cancer’s Treatments”,
ResearchGate 2022 (doi: 10.13140/RG.2.2.23123.04641).
2022 0094 | SuperHyperDominating and SuperHyperResolving on Neutrosophic SuperHyperGraphs And Manuscript

Their Directions in Game Theory and Neutrosophic SuperHyperClasses
Henry Garrett, “SuperHyperDominating and SuperHyperResolving on Neutrosophic
SuperHyperGraphs And Their Directions in Game Theory and Neutrosophic
SuperHyperClasses”, Preprints 2022, 2022110576 (doi: 10.20944/preprints202211.0576.v1).
2022 0094 | SuperHyperDominating and SuperHyperResolving on Neutrosophic SuperHyperGraphs And Manuscript

Their Directions in Game Theory and Neutrosophic SuperHyperClasses
Henry Garrett, “SuperHyperDominating and SuperHyperResolving on Neutrosophic
SuperHyperGraphs And Their Directions in Game Theory and Neutrosophic
SuperHyperClasses”, ResearchGate 2022 (doi: 10.13140/RG.2.2.23324.56966).
9314
2022 0093 | Neutrosophic Co-degree and Neutrosophic Degree alongside Chromatic Numbers in the Setting Article
of Some Classes Related to Neutrosophic Hypergraphs
Henry Garrett, “Neutrosophic Co-degree and Neutrosophic Degree alongside Chromatic
Numbers in the Setting of Some Classes Related to Neutrosophic Hypergraphs”, J Curr Trends
Comp Sci Res 1(1) (2022) 06-14.
PDF,Abstract,Issue.
2022 0092 | Recognition of the Pattern for Vertices to Make Dimension by Resolving in some Classes of Manuscript
Neutrosophic Graphs
Henry Garrett, “Recognition of the Pattern for Vertices to Make Dimension
by Resolving in some Classes of Neutrosophic Graphs”, ResearchGate 2022 (doi:
10.13140/RG.2.2.27281.51046).
2022 0091 | Regularity of Every Element to Function in the Type of Domination in Neutrosophic Graphs Manuscript
Henry Garrett, “Regularity of Every Element to Function in the Type of Domination in

Neutrosophic Graphs”, ResearchGate 2022 (doi: 10.13140/RG.2.2.22861.10727).
2022 0090 | Initial Material of Neutrosophic Preliminaries to Study Some Neutrosophic Notions Based on Manuscript
Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic SuperHyperGraph (NSHG)
Henry Garrett, “Initial Material of Neutrosophic Preliminaries to Study Some Neutrosophic
Notions Based on Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic SuperHyperGraph
(NSHG)”, ResearchGate 2022 (doi: 10.13140/RG.2.2.25385.88160).
2022 0089 | Basic Neutrosophic Notions Concerning Neutrosophic SuperHyperDominating and Manuscript
Neutrosophic SuperHyperResolving in Neutrosophic SuperHyperGraph
Henry Garrett, “Basic Neutrosophic Notions Concerning Neutrosophic
SuperHyperDominating and Neutrosophic SuperHyperResolving in Neutrosophic
SuperHyperGraph”, ResearchGate 2022 (doi: 10.13140/RG.2.2.29173.86244).
2022 0088 | Seeking Empty Subgraphs To Determine Different Measurements in Some Classes of Manuscript
Neutrosophic Graphs
Henry Garrett, “Seeking Empty Subgraphs To Determine Different Measurements in Some
Classes of Neutrosophic Graphs”, ResearchGate 2022 (doi: 10.13140/RG.2.2.30448.53766).
2022 0087 | Impacts of Isolated Vertices To Cover Other Vertices in Neutrosophic Graphs Manuscript
Henry Garrett, “Impacts of Isolated Vertices To Cover Other Vertices in Neutrosophic

Graphs”, ResearchGate 2022 (doi: 10.13140/RG.2.2.16185.44647).
2022 0086 | Perfect Locating of All Vertices in Some Classes of Neutrosophic Graphs Manuscript
Henry Garrett, “Perfect Locating of All Vertices in Some Classes of Neutrosophic Graphs”,
2022 0085 | Complete Connections Between Vertices in Neutrosophic Graphs Manuscript
Henry Garrett, “Complete Connections Between Vertices in Neutrosophic Graphs”,

2022 0084 | Unique Distance Differentiation By Collection of Vertices in Neutrosophic Graphs Manuscript
Henry Garrett, “Unique Distance Differentiation By Collection of Vertices in Neutrosophic

9315
2022 0083 | Single Connection Amid Vertices From Two Given Sets Partitioning Vertex Set in Some Classes Manuscript
of Neutrosophic Graphs
Henry Garrett, “Single Connection Amid Vertices From Two Given Sets Partitioning
Vertex Set in Some Classes of Neutrosophic Graphs”, ResearchGate 2022 (doi:
10.13140/RG.2.2.32189.33764).
2022 0082 | Separate Joint-Sets Representing Separate Numbers Where Classes of Neutrosophic Graphs Manuscript
and Applications are Cases of Study
Henry Garrett, “Separate Joint-Sets Representing Separate Numbers Where Classes
of Neutrosophic Graphs and Applications are Cases of Study”, ResearchGate 2022 (doi:
10.13140/RG.2.2.22666.95686).
2022 0081 | Repetitive Joint-Sets Featuring Multiple Numbers For Neutrosophic Graphs Manuscript
Henry Garrett, “Repetitive Joint-Sets Featuring Multiple Numbers For Neutrosophic

2022 0080 | Dual-Resolving Numbers Excerpt from Some Classes of Neutrosophic Graphs With Some Manuscript
Applications
Henry Garrett, “Dual-Resolving Numbers Excerpt from Some Classes of Neutrosophic
Graphs With Some Applications”, ResearchGate 2022 (doi: 10.13140/RG.2.2.14971.39200).
2022 0079 | Dual-Dominating Numbers in Neutrosophic Setting and Crisp Setting Obtained From Classes Manuscript
of Neutrosophic Graphs
Henry Garrett, “Dual-Dominating Numbers in Neutrosophic Setting and Crisp
Setting Obtained From Classes of Neutrosophic Graphs”, ResearchGate 2022 (doi:
10.13140/RG.2.2.19925.91361).
2022 0078 | Neutrosophic Path-Coloring Numbers BasedOn Endpoints In Neutrosophic Graphs Manuscript
Henry Garrett, “Neutrosophic Path-Coloring Numbers BasedOn Endpoints In Neutrosophic

2022 0077 | Neutrosophic Dominating Path-Coloring Numbers in New Visions of Classes of Neutrosophic Manuscript
Graphs
Henry Garrett, “Neutrosophic Dominating Path-Coloring Numbers in New Visions of Classes
of Neutrosophic Graphs”, ResearchGate 2022 (doi: 10.13140/RG.2.2.32151.65445).
2022 0076 | Path Coloring Numbers of Neutrosophic Graphs Based on Shared Edges and Neutrosophic Manuscript
Cardinality of Edges With Some Applications from Real-World Problems
Henry Garrett, “Path Coloring Numbers of Neutrosophic Graphs Based on Shared Edges
and Neutrosophic Cardinality of Edges With Some Applications from Real-World Problems”,
2022 0075 | Neutrosophic Collapsed Numbers in the Viewpoint of Neutrosophic Graphs Manuscript
Henry Garrett, “Neutrosophic Collapsed Numbers in the Viewpoint of Neutrosophic Graphs”,

2022 0074 | Bulky Numbers of Classes of Neutrosophic Graphs Based on Neutrosophic Edges Manuscript
Henry Garrett, “Bulky Numbers of Classes of Neutrosophic Graphs Based on Neutrosophic

Edges”, ResearchGate 2022 (doi: 10.13140/RG.2.2.24204.18564).
9316
2022 0073 | Dense Numbers and Minimal Dense Sets of Neutrosophic Graphs Manuscript
Henry Garrett, “Dense Numbers and Minimal Dense Sets of Neutrosophic Graphs”,
2022 0072 | Connectivities of Neutrosophic Graphs in the terms of Crisp Cycles Manuscript
Henry Garrett, “Connectivities of Neutrosophic Graphs in the terms of Crisp Cycles”,

2022 0071 | Strong Paths Defining Connectivities in Neutrosophic Graphs Manuscript
Henry Garrett, “Strong Paths Defining Connectivities in Neutrosophic Graphs”,

2022 0070 | Finding Longest Weakest Paths assigning numbers to some Classes of Neutrosophic Graphs Manuscript
Henry Garrett, “Finding Longest Weakest Paths assigning numbers to some Classes of
Neutrosophic Graphs”, ResearchGate 2022 (doi: 10.13140/RG.2.2.35579.59689).
2022 0068 | Relations and Notions amid Hamiltonicity and Eulerian Notions in Some Classes of Manuscript
Neutrosophic Graphs
Henry Garrett, “Relations and Notions amid Hamiltonicity and Eulerian Notions in Some
Classes of Neutrosophic Graphs”, ResearchGate 2022 (doi: 10.13140/RG.2.2.35579.59689).
2022 0067 | Eulerian Results In Neutrosophic Graphs With Applications Manuscript
Henry Garrett, “Eulerian Results In Neutrosophic Graphs With Applic- ations”,

2022 0066 | Finding Hamiltonian Neutrosophic Cycles in Classes of Neutrosophic Graphs Manuscript
Henry Garrett, “Finding Hamiltonian Neutrosophic Cycles in Classes of Neutrosophic

2022 0065 | Extending Sets Type-Results in Neutrosophic Graphs Manuscript
Henry Garrett, “Extending Sets Type-Results in Neutrosophic Graphs”, ResearchGate 2022

(doi: 10.13140/RG.2.2.13317.01767).
2022 0064 | Some Polynomials Related to Numbers in Classes of (Strong) Neutrosophic Graphs Manuscript
Henry Garrett, “Some Polynomials Related to Numbers in Classes of (Strong) Neutrosophic

2022 0063 | Finding Shortest Sequences of Consecutive Vertices in Neutrosophic Graphs Manuscript
Henry Garrett, “Finding Shortest Sequences of Consecutive Vertices in Neutrosophic

2022 0062 | Neutrosophic Girth Based On Crisp Cycle in Neutrosophic Graphs Manuscript
Henry Garrett, “Neutrosophic Girth Based On Crisp Cycle in Neutrosophic Graphs”,

9317
2022 0061 | e-Matching Number and e-Matching Polynomials in Neutrosophic Graphs Manuscript
Henry Garrett, “e-Matching Number and e-Matching Polynomials in Neutrosophic Graphs”,

2022 0060 | Matching Polynomials in Neutrosophic Graphs Manuscript
Henry Garrett, “Matching Polynomials in Neutrosophic Graphs”, ResearchGate 2022 (doi:

10.13140/RG.2.2.33630.72002).
2022 0059 | Some Results in Classes Of Neutrosophic Graphs Manuscript
Henry Garrett, “Some Results in Classes Of Neutrosophic Graphs”, Preprints 2022,

2022030248 (doi: 10.20944/preprints202203.0248.v1).
2022 0058 | Matching Number in Neutrosophic Graphs Manuscript
Henry Garrett, “Matching Number in Neutrosophic Graphs”, ResearchGate 2022 (doi:

10.13140/RG.2.2.18609.86882).
2022 0055 | (Failed) 1-clique Number in Neutrosophic Graphs Manuscript
Henry Garrett, “(Failed) 1-Clique Number in Neutrosophic Graphs”, ResearchGate 2022

(doi: 10.13140/RG.2.2.14241.89449).
2022 0054 | Failed Clique Number in Neutrosophic Graphs Manuscript
Henry Garrett, “Failed Clique Number in Neutrosophic Graphs”, ResearchGate 2022 (doi:
10.13140/RG.2.2.36039.16800).
2022 0053 | Clique Number in Neutrosophic Graphs Manuscript
Henry Garrett, “Clique Number in Neutrosophic Graphs”, ResearchGate 2022 (doi:

10.13140/RG.2.2.28338.68800).
2022 0052 | (Failed) 1-independent Number in Neutrosophic Graphs Manuscript
Henry Garrett, “(Failed) 1-Independent Number in Neutrosophic Graphs”, ResearchGate

2022 (doi: 10.13140/RG.2.2.30593.12643).
2022 0051 | Failed Independent Number in Neutrosophic Graphs Manuscript
Henry Garrett, “Failed Independent Number in Neutrosophic Graphs”, Preprints 2022,

2022020334 (doi: 10.20944/preprints202202.0334.v2)
2022 0051 | Failed Independent Number in Neutrosophic Graphs Manuscript
Henry Garrett, “Failed Independent Number in Neutrosophic Graphs”, ResearchGate 2022

(doi: 10.13140/RG.2.2.31196.05768).
2022 0050 | Independent Set in Neutrosophic Graphs Manuscript
Henry Garrett, “Independent Set in Neutrosophic Graphs”, Preprints 2022, 2022020334 (doi:
10.20944/preprints202202.0334.v1).
9318
2022 0050 | Independent Set in Neutrosophic Graphs Manuscript
Henry Garrett, “Independent Set in Neutrosophic Graphs”, ResearchGate 2022 (doi:

10.13140/RG.2.2.17472.81925).
2022 0049 | (Failed)1-Zero-Forcing Number in Neutrosophic Graphs Manuscript
Henry Garrett, “(Failed)1-Zero-Forcing Number in Neutrosophic Graphs”, ResearchGate

2022 (doi: 10.13140/RG.2.2.35241.26724).
2022 0048 | Failed Zero-Forcing Number in Neutrosophic Graphs Manuscript
Henry Garrett, “Failed Zero-Forcing Number in Neutrosophic Graphs”, Preprints 2022,

2022020343 (doi: 10.20944/preprints202202.0343.v1).
2022 0048 | Failed Zero-Forcing Number in Neutrosophic Graphs Manuscript
Henry Garrett, “Failed Zero-Forcing Number in Neutrosophic Graphs”, ResearchGate 2022

(doi: 10.13140/RG.2.2.24873.47209).
2022 0047 | Zero Forcing Number in Neutrosophic Graphs Manuscript
Henry Garrett, “Zero Forcing Number in Neutrosophic Graphs”, ResearchGate 2022 (doi:
10.13140/RG.2.2.32265.93286).
2022 0046 | Quasi-Number in Neutrosophic Graphs Manuscript
Henry Garrett, “Quasi-Number in Neutrosophic Graphs”, ResearchGate 2022 (doi:

10.13140/RG.2.2.18470.60488).
2022 0045 | Quasi-Degree in Neutrosophic Graphs Manuscript
Henry Garrett, “Quasi-Degree in Neutrosophic Graphs”, Preprints 2022, 2022020100 (doi:

10.20944/preprints202202.0100.v1).
2022 0045 | Quasi-Degree in Neutrosophic Graphs Manuscript
Henry Garrett, “Quasi-Degree in ResearchGate 2022 (doi: 10.13140/RG.2.2.25460.01927).

2022 0044 | Co-Neighborhood in Neutrosophic Graphs Manuscript
Henry Garrett, “Co-Neighborhood in Neutrosophic Graphs”, ResearchGate 2022 (doi:

10.13140/RG.2.2.17687.44964).
2022 0043 | Global Powerful Alliance in Strong Neutrosophic Graphs Manuscript
Henry Garrett, “Global Powerful Alliance in Strong Neutrosophic Graphs”, Preprints 2022,
2022010429 (doi: 10.20944/preprints202201.0429.v1).
2022 0043 | Global Powerful Alliance in Strong Neutrosophic Graphs Manuscript
Henry Garrett, “Global Powerful Alliance in Strong Neutrosophic Graphs”, ResearchGate

2022 (doi: 10.13140/RG.2.2.31784.24322).
9319
2022 0042 | Global Offensive Alliance in Strong Neutrosophic Graphs Manuscript
Henry Garrett, “Global Offensive Alliance in Strong Neutrosophic Graphs”, Preprints 2022,
2022010429 (doi: 10.20944/preprints202201.0429.v1).
2022 0042 | Global Offensive Alliance in Strong Neutrosophic Graphs Manuscript
Henry Garrett, “Global Offensive Alliance in Strong Neutrosophic Graphs”, ResearchGate

2022 (doi: 10.13140/RG.2.2.26541.20961).
2022 0041 | Three Types of Neutrosophic Alliances based on Connectedness and (Strong) Edges Manuscript
Henry Garrett, “Three Types of Neutrosophic Alliances based on Connectedness and (Strong)
Edges”, Preprints 2022, 2022010239 (doi: 10.20944/preprints202201.0239.v1).
2022 0041 | Three Types of Neutrosophic Alliances based on Connectedness and (Strong) Edges Manuscript
Henry Garrett, “Three Types of Neutrosophic Alliances based on Connectedness and (Strong)
Edges”, ResearchGate 2022 (doi: 10.13140/RG.2.2.18486.83521).
2022 0040 | Three types of neutrosophic alliances based of connectedness and (strong) edges (In-Progress) Manuscript
Henry Garrett, “Three types of neutrosophic alliances based of connectedness and (strong)
edges (In-Progress)”, ResearchGate 2022 (doi: 10.13140/RG.2.2.27570.12480).
2022 0039 | Closing Numbers and Super-Closing Numbers as (Dual)Resolving and (Dual)Coloring Manuscript
Henry Garrett, “Closing Numbers and Super-Closing Numbers as (Dual)Resolving and
(Dual)Coloring alongside (Dual)Dominating in (Neutrosophic)n-SuperHyperGraph”, Preprints
2022, 2022010145 (doi: 10.20944/preprints202201.0145.v1).
2022 0039 | Closing Numbers and Super-Closing Numbers as (Dual)Resolving and (Dual)Coloring Manuscript
Henry Garrett, “Closing Numbers and Super-Closing Numbers as (Dual)Resolving
and (Dual)Coloring alongside (Dual)Dominating in (Neutrosophic)n-SuperHyperGraph”,
ResearchGate 2022 (doi: 10.13140/RG.2.2.18909.54244/1).
2022 0038 | Co-degree and Degree of classes of Neutrosophic Hypergraphs Manuscript
Henry Garrett, “Co-degree and Degree of classes of Neutrosophic Hypergraphs”, Preprints

2022, 2022010027 (doi: 10.20944/preprints202201.0027.v1).
2022 0038 | Co-degree and Degree of classes of Neutrosophic Hypergraphs Manuscript
Henry Garrett, “Co-degree and Degree of classes of Neutrosophic Hypergraphs”,

2021 0037 | Dimension and Coloring alongside Domination in Neutrosophic Hypergraphs Manuscript
Henry Garrett, “Dimension and Coloring alongside Domination in Neutrosophic

Hypergraphs”, Preprints 2021, 2021120448 (doi: 10.20944/preprints202112.0448.v1).
2021 0037 | Dimension and Coloring alongside Domination in Neutrosophic Hypergraphs Manuscript
9320
Henry Garrett, “Dimension and Coloring alongside Domination in Neutrosophic

Hypergraphs”, ResearchGate 2021 (doi: 10.13140/RG.2.2.13070.28483).
2021 0036 | Different Types of Neutrosophic Chromatic Number Manuscript
Henry Garrett, “Different Types of Neutrosophic Chromatic Number”, Preprints 2021,

2021120335 (doi: 10.20944/preprints202112.0335.v1).
2021 0036 | Different Types of Neutrosophic Chromatic Number Manuscript
Henry Garrett, “Different Types of Neutrosophic Chromatic Number”, ResearchGate 2021

(doi: 10.13140/RG.2.2.19068.46723).
2021 0035 | Neutrosophic Chromatic Number Based on Connectedness Manuscript
Henry Garrett, “Neutrosophic Chromatic Number Based on Connectedness”, Preprints 2021,

2021120226 (doi: 10.20944/preprints202112.0226.v1).
2021 0035 | Neutrosophic Chromatic Number Based on Connectedness Manuscript
Henry Garrett, “Neutrosophic Chromatic Number Based on Connectedness”, ResearchGate

2021 (doi: 10.13140/RG.2.2.18563.84001).
2021 0034 | Chromatic Number and Neutrosophic Chromatic Number Manuscript
Henry Garrett, “Chromatic Number and Neutrosophic Chromatic Number”, Preprints 2021,
2021120177 (doi: 10.20944/preprints202112.0177.v1).
2021 0034 | Chromatic Number and Neutrosophic Chromatic Number Manuscript
Henry Garrett, “Chromatic Number and Neutrosophic Chromatic Number”, ResearchGate

2021 (doi: 10.13140/RG.2.2.36035.73766).
2021 0033 | Metric Dimension in fuzzy(neutrosophic) Graphs #12 Manuscript
Henry Garrett, “Metric Dimension in fuzzy(neutrosophic) Graphs #12”, ResearchGate 2021

(doi: 10.13140/RG.2.2.20690.48322).

(doi: 10.13140/RG.2.2.29308.46725).

(doi: 10.13140/RG.2.2.21614.54085).

(doi: 10.13140/RG.2.2.34040.16648).
9321

(doi: 10.13140/RG.2.2.19464.96007).
2021 0028 | Metric Dimension in fuzzy(neutrosophic) Graphs-VII Manuscript
Henry Garrett, “Metric Dimension in fuzzy(neutrosophic) Graphs-VII”, ResearchGate 2021

(doi: 10.13140/RG.2.2.14667.72481).
2021 0028 | Metric Dimension in fuzzy(neutrosophic) Graphs-VII Manuscript
Henry Garrett, “Metric Dimension in fuzzy(neutrosophic) Graphs-VII”, Preprints 2021,

2021110142 (doi: 10.20944/preprints202111.0142.v7).
2021 0027 | Metric Dimension in fuzzy(neutrosophic) Graphs-VI Manuscript
Henry Garrett, “Metric Dimension in fuzzy(neutrosophic) Graphs-VI”, Preprints 2021,

2021110142 (doi: 10.20944/preprints202111.0142.v6).
2021 0026 | Metric Dimension in fuzzy(neutrosophic) Graphs-V Manuscript
Henry Garrett, “Metric Dimension in fuzzy(neutrosophic) Graphs-V”, Preprints 2021,

2021110142 (doi: 10.20944/preprints202111.0142.v5).
2021 0025 | Metric Dimension in fuzzy(neutrosophic) Graphs-IV Manuscript
Henry Garrett, “Metric Dimension in fuzzy(neutrosophic) Graphs-IV”, Preprints 2021,

2021110142 (doi: 10.20944/preprints202111.0142.v4).
2021 0024 | Metric Dimension in fuzzy(neutrosophic) Graphs-III Manuscript
Henry Garrett, “Metric Dimension in fuzzy(neutrosophic) Graphs-III”, Preprints 2021,

2021110142 (doi: 10.20944/preprints202111.0142.v3).
2021 0023 | Metric Dimension in fuzzy(neutrosophic) Graphs-II Manuscript
Henry Garrett, “Metric Dimension in fuzzy(neutrosophic) Graphs-II”, Preprints 2021,

2021110142 (doi: 10.20944/preprints202111.0142.v2).
2021 0022 | Metric Dimension in Fuzzy Graphs and Neutrosophic Graphs Manuscript
Henry Garrett, “Metric Dimension in Fuzzy Graphs and Neutrosophic Graphs”, Preprints
2021, 2021110142 (doi: 10.20944/preprints202111.0142.v1)
2021 0021 | Valued Number And Set Manuscript
Henry Garrett, “Valued Number And Set”, Preprints 2021, 2021080229 (doi:
10.20944/preprints202108.0229.v1).
2021 0020 | Notion of Valued Set Manuscript
Henry Garrett, “Notion of Valued Set”, Preprints 2021, 2021070410 (doi:

10.20944/preprints202107.0410.v1).
9322
2021 0019 | Set And Its Operations Manuscript
Henry Garrett, “Set And Its Operations”, Preprints 2021, 2021060508 (doi:
10.20944/preprints202106.0508.v1).
2021 0018 | Metric Dimensions Of Graphs Manuscript
Henry Garrett, “Metric Dimensions Of Graphs”, Preprints 2021, 2021060392 (doi:

10.20944/preprints202106.0392.v1).
2021 0017 | New Graph Of Graph Manuscript
Henry Garrett, “New Graph Of Graph”, Preprints 2021, 2021060323 (doi:

10.20944/preprints202106.0323.v1).
2021 0016 | Numbers Based On Edges Manuscript
Henry Garrett, “Numbers Based On Edges”, Preprints 2021, 2021060315 (doi:

10.20944/preprints202106.0315.v1).
2021 0015 | Locating And Location Number Manuscript
Henry Garrett, “Locating And Location Number”, Preprints 2021, 2021060206 (doi:
10.20944/preprints202106.0206.v1).
2021 0014 | Big Sets Of Vertices Manuscript
Henry Garrett, “Big Sets Of Vertices”, Preprints 2021, 2021060189 (doi:

10.20944/preprints202106.0189.v1).
2021 0013 | Matroid And Its Outlines Manuscript
Henry Garrett, “Matroid And Its Outlines”, Preprints 2021, 2021060146 (doi:
10.20944/preprints202106.0146.v1).
2021 0012 | Matroid And Its Relations Manuscript
Henry Garrett, “Matroid And Its Relations”, Preprints 2021, 2021060080 (doi:
10.20944/preprints202106.0080.v1).
2021 0011 | Metric Number in Dimension Manuscript
Henry Garrett, “Metric Number in Dimension”, Preprints 2021, 2021060004 (doi:

10.20944/preprints202106.0004.v1).
9323
Publications: Books
2023 161 | Eulerian-Path-Neighbor In SuperHyperGraphs Amazon
[ADDRESSED CITATION]
[HG161b] Henry Garrett, “Eulerian-Path-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett,
2023 (doi: 10.5281/zenodo.7826705).
@googlebooks:https://books.google.com/books/about?id=7165EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=7165EAAAQBAJ
@ResearchGate: https://www.researchgate.net/publication/7165EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Eulerian-Path-Neighbor-In-
SuperHyperGraphs/
@academia:https://www.academia.edu/100157960
(Paperback): https://www.amazon.com/dp/B0C1JGPMNW
(Hardcover): https://www.amazon.com/dp/B0C1JK3LLJ
(Kindle Edition): https://www.amazon.com/dp/B0C2FRDG48
ISBN
(Paperback): 9798391250159
(Hardcover): 9798391250234
(Kindle Edition): CC BY-NC-ND 4.0
Other Publishers: @googlebooks @GooglePlay @AmazonKindle
Available at @WordPress @ResearchGate @Scribd @academia @ZENODO_ORG @Twitter
@facebook @LinkedIn @Amazon @googlebooks @GooglePlay @AmazonKindle
2023 160 | Eulerian-Path-Decomposition In SuperHyperGraphs Amazon
[HG160b] Henry Garrett, “Eulerian-Path-Decomposition In SuperHyperGraphs”. Dr. Henry
Garrett, 2023 (doi: 10.5281/zenodo.7820680).
@googlebooks:https://books.google.com/books/about?id=v624EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=v624EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Eulerian-Path-
Decomposition-In-SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0C1J2GSGV
(Hardcover): https://www.amazon.com/dp/B0C1J3J883
(Kindle Edition): https://www.amazon.com/dp/B0C285TBWX
ISBN
(Paperback): 9798391056140
(Hardcover): 9798391056164
2023 159 | Eulerian-Path-Cut In SuperHyperGraphs Amazon

9324
[HG159b] Henry Garrett, “Eulerian-Path-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023
(doi: 10.5281/zenodo.7812750).
@googlebooks:https://books.google.com/books/about?id=kju4EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=kju4EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Eulerian-Path-Cut-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0C1J1MWPX
(Hardcover): https://www.amazon.com/dp/B0C1J3D9N8
(Kindle Edition): https://www.amazon.com/dp/B0C24LRF5P
ISBN
(Paperback): 9798390777978
(Hardcover): 9798390778005
2023 158 | Hamiltonian-Type-Cycle-Neighbor In SuperHyperGraphs Amazon
[HG158b] Henry Garrett, “Hamiltonian-Type-Cycle-Neighbor In SuperHyperGraphs”. Dr.
Henry Garrett, 2023 (doi: 10.5281/zenodo.7812142).
@googlebooks:https://books.google.com/books/about?id=CDW4EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=CDW4EAAAQBAJ
@WordPress:https://drhenrygarrett.wordpress.com/2023/04/22/Hamiltonian-Type-Cycle-
Neighbor-In-SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0C1J1XL69
(Hardcover): https://www.amazon.com/dp/B0C1JCTBCM
(Kindle Edition): https://www.amazon.com/dp/B0C1XWFPFS
ISBN
(Paperback): 9798390730676
(Hardcover): 9798390730690
2023 157 | Hamiltonian-Type-Cycle-Decomposition In SuperHyperGraphs Amazon

9325
[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

9326
[HG155b] Henry Garrett, “Hamiltonian-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry
@googlebooks:https://books.google.com/books/about?id=u7u3EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=u7u3EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Hamiltonian-Cycle-
Neighbor-In-SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0C1JGKRC1
(Hardcover): https://www.amazon.com/dp/B0C1JK3J6K
(Kindle Edition): https://www.amazon.com/dp/B0C1SNGH8L
ISBN
(Paperback): 9798390457139
(Hardcover): 9798390460924
2023 154 | Hamiltonian-Cycle-Decomposition In SuperHyperGraphs Amazon
[HG154b] Henry Garrett, “Hamiltonian-Cycle-Decomposition In SuperHyperGraphs”. Dr.
@googlebooks:https://books.google.com/books/about?id=Xy23EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=Xy23EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Hamiltonian-Cycle-
(Paperback): https://www.amazon.com/dp/B0C123F3F3
(Hardcover): https://www.amazon.com/dp/B0C12773L1
(Kindle Edition): https://www.amazon.com/dp/B0C1BZYCGW
ISBN
(Paperback): 9798389932234
(Hardcover): 9798389932319

9327
[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

9328
[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

9329
[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

9330
[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

9331
[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

9332
[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

9333
[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

9334
[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

9335
[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

9336
[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

9337
[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

9338
[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

9339
[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

9340
[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

9341
[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

9342
[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

9343
[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

9344
[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

9345
[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

9346
[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

9347
[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

9348
[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

9349
[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
9350
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

9351
[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

9352
[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

9353
[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

9354
[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

9355
[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
9356
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

9357
“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

9358
[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
9359
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

9360
[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

9361
[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

9362
[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

9363
[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

9364
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

9365
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
9366
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
9367
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

9368
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

9369
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
-
9370
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

9371
Анализ моделей и руководство за пределами Подход и проблемы в двух моде-

лях 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

9372
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
9373
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
9374
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

9375
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
9376
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
...
9377
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/
9378
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
9379
9380
9381
Henry Garrett
01/23/2022
9382
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
9383
View publication stats

Eulerian-Type-Path-Neighbor 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

Eulerian-Type-Path-Neighbor in SuperHyperGraphs

Uploaded by

Copyright:

Available Formats

See discussions, stats, and author profiles for this publication at: https://www.researchgate.

Book · April 2023

454 PUBLICATIONS 13,432 CITATIONS

Featured Articles View project

Neutrosophic Graphs View project

The user has requested enhancement of the downloaded file.

Dr. Henry Garrett

4 Cancer In Extreme SuperHyperGraph 43

6 New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Type-

8 Applied Notions Under The Scrutiny Of The Motivation Of This

9 Extreme Preliminaries Of This Scientific Research On the Redeemed Ways 61

10 Extreme SuperHyperEulerian-Type-Path-Neighbor 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 137

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 145

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 245

25 Neutrosophic Eulerian-Type-Path-Neighbor 249

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 SuperHyperEulerian-Type-Path-Neighbor 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 341

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 349

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 449

45 “SuperHyperGraph-Based Books”: | Featured Tweets 457

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

14.1 an Extreme SuperHyperBipartite Associated to the Notions of Extreme

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

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

Henry Garrett · Independent Researcher · Department of Mathematics ·

45.2 “SuperHyperGraph-Based Books”: | Featured Tweets . . . . . . . . . . . . . . . . 459

Henry Garrett · Independent Researcher · Department of Mathematics ·