You are on page 1of 165

See discussions, stats, and author profiles for this publication at: https://www.researchgate.

net/publication/370305837

New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph By


Eulerian-Type-Cycle-Cut As Hyper Nebbish On Super Nebulous

Preprint · April 2023


DOI: 10.5281/zenodo.7871026

CITATIONS

1 author:

Henry Garrett

464 PUBLICATIONS   14,993 CITATIONS   

SEE PROFILE

Some of the authors of this publication are also working on these related projects:

Number Graphs And Numbers View project

Neutrosophic Graphs View project

All content following this page was uploaded by Henry Garrett on 27 April 2023.

The user has requested enhancement of the downloaded file.


Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

New Ideas In Recognition of Cancer And Neutrosophic 2

SuperHyperGraph By Eulerian-Type-Cycle-Cut As Hyper 3

Nebbish On Super Nebulous 4

Henry Garrett · Independent Researcher · Department of Mathematics · 6

DrHenryGarrett@gmail.com · Manhattan, NY, USA 7

1 ABSTRACT 8

In this scientific research, (Different Neutrosophic Types of Neutrosophic 9

SuperHyperEulerian-Type-Cycle-Cut). Assume a Neutrosophic SuperHyperGraph (NSHG) S is 10

a Eulerian-Type-Cycle-Cut pair S = (V, E). Consider a Neutrosophic SuperHyperSet 11

V 0 = {V1 , V2 , . . . , Vs } and E 0 = {E1 , E2 , . . . , Ez }. Then either V 0 or E 0 is called 12

Neutrosophic e-SuperHyperEulerian-Type-Cycle-Cut if the following expression is called 13

Neutrosophic e-SuperHyperEulerian-Type-Cycle-Cut criteria holds 14

∀E 0 ∈ C : C is
a SuperHyperCycle and it has
the maximum number of SuperHyperEdges;

Neutrosophic re-SuperHyperEulerian-Type-Cycle-Cut if the following expression is called 15

Neutrosophic e-SuperHyperEulerian-Type-Cycle-Cut criteria holds 16

∀E 0 ∈ C : C is
a SuperHyperCycle and it has
the maximum number of SuperHyperEdges;

and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; Neutrosophic 17

v-SuperHyperEulerian-Type-Cycle-Cut if the following expression is called Neutrosophic 18

v-SuperHyperEulerian-Type-Cycle-Cut criteria holds 19

∀V 0 ∈ C : C is
a SuperHyperCycle and it has
the maximum number of SuperHyperEdges;

Neutrosophic rv-SuperHyperEulerian-Type-Cycle-Cut if the following expression is called 20

Neutrosophic v-SuperHyperEulerian-Type-Cycle-Cut criteria holds 21

∀V 0 ∈ C : C is
a SuperHyperCycle and it has
the maximum number of SuperHyperEdges;

and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; Neutrosophic 22

SuperHyperEulerian-Type-Cycle-Cut if it’s either of Neutrosophic 23

e-SuperHyperEulerian-Type-Cycle-Cut, Neutrosophic re-SuperHyperEulerian-Type-Cycle-Cut, 24

Neutrosophic v-SuperHyperEulerian-Type-Cycle-Cut, and Neutrosophic 25

rv-SuperHyperEulerian-Type-Cycle-Cut. ((Neutrosophic) SuperHyperEulerian-Type-Cycle-Cut). 26

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider a 27

Neutrosophic SuperHyperEdge (NSHE) E = {V1 , V2 , . . . , Vs }. Then E is called an 28

Extreme SuperHyperEulerian-Type-Cycle-Cut if it’s either of Neutrosophic 29

e-SuperHyperEulerian-Type-Cycle-Cut, Neutrosophic re-SuperHyperEulerian-Type-Cycle-Cut, 30

Neutrosophic v-SuperHyperEulerian-Type-Cycle-Cut, and Neutrosophic 31

rv-SuperHyperEulerian-Type-Cycle-Cut and C(N SHG) for an Extreme SuperHyperGraph 32

N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S 33

of high Extreme cardinality of the Extreme SuperHyperEdges in the conseNeighborive 34

Extreme sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such 35

that they form the Extreme SuperHyperEulerian-Type-Cycle-Cut; a Neutrosophic 36

SuperHyperEulerian-Type-Cycle-Cut if it’s either of Neutrosophic 37

e-SuperHyperEulerian-Type-Cycle-Cut, Neutrosophic re-SuperHyperEulerian-Type-Cycle-Cut, 38

Neutrosophic v-SuperHyperEulerian-Type-Cycle-Cut, and Neutrosophic 39

rv-SuperHyperEulerian-Type-Cycle-Cut and C(N SHG) for a Neutrosophic SuperHyperGraph 40

N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic 41

SuperHyperEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 42

conseNeighborive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices 43

such that they form the Neutrosophic SuperHyperEulerian-Type-Cycle-Cut; an Extreme 44

SuperHyperEulerian-Type-Cycle-Cut SuperHyperPolynomial if it’s either of Neutrosophic 45

e-SuperHyperEulerian-Type-Cycle-Cut, Neutrosophic re-SuperHyperEulerian-Type-Cycle-Cut, 46

Neutrosophic v-SuperHyperEulerian-Type-Cycle-Cut, and Neutrosophic 47

rv-SuperHyperEulerian-Type-Cycle-Cut and C(N SHG) for an Extreme SuperHyperGraph 48

N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme 49

coefficients defined as the Extreme number of the maximum Extreme cardinality of the 50

Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme cardinality 51

conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVertices such 52

that they form the Extreme SuperHyperEulerian-Type-Cycle-Cut; and the Extreme power is 53

corresponded to its Extreme coefficient; a Neutrosophic SuperHyperEulerian-Type-Cycle-Cut 54

SuperHyperPolynomial if it’s either of Neutrosophic e-SuperHyperEulerian-Type-Cycle-Cut, 55

Neutrosophic re-SuperHyperEulerian-Type-Cycle-Cut, Neutrosophic 56

v-SuperHyperEulerian-Type-Cycle-Cut, and Neutrosophic rv-SuperHyperEulerian-Type-Cycle-Cut and 57

C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic 58

SuperHyperPolynomial contains the Neutrosophic coefficients defined as the 59

Neutrosophic number of the maximum Neutrosophic cardinality of the Neutrosophic 60

SuperHyperEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 61

conseNeighborive Neutrosophic SuperHyperEdges and Neutrosophic 62

SuperHyperVertices such that they form the Neutrosophic 63

SuperHyperEulerian-Type-Cycle-Cut; and the Neutrosophic power is corresponded to its 64

Neutrosophic coefficient; an Extreme V-SuperHyperEulerian-Type-Cycle-Cut if it’s either of 65

Neutrosophic e-SuperHyperEulerian-Type-Cycle-Cut, Neutrosophic 66

re-SuperHyperEulerian-Type-Cycle-Cut, Neutrosophic v-SuperHyperEulerian-Type-Cycle-Cut, and 67

Neutrosophic rv-SuperHyperEulerian-Type-Cycle-Cut and C(N SHG) for an Extreme 68

SuperHyperGraph N SHG : (V, E) is the maximum Extreme cardinality of an Extreme 69

SuperHyperSet S of high Extreme cardinality of the Extreme SuperHyperVertices in the 70

conseNeighborive Extreme sequence of Extreme SuperHyperEdges and Extreme 71

SuperHyperVertices such that they form the Extreme SuperHyperEulerian-Type-Cycle-Cut; a 72

Neutrosophic V-SuperHyperEulerian-Type-Cycle-Cut if it’s either of Neutrosophic 73

e-SuperHyperEulerian-Type-Cycle-Cut, Neutrosophic re-SuperHyperEulerian-Type-Cycle-Cut, 74

Neutrosophic v-SuperHyperEulerian-Type-Cycle-Cut, and Neutrosophic 75

rv-SuperHyperEulerian-Type-Cycle-Cut and C(N SHG) for a Neutrosophic SuperHyperGraph 76

N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic 77

SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic 78

cardinality conseNeighborive Neutrosophic SuperHyperEdges and Neutrosophic 79

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

SuperHyperVertices such that they form the Neutrosophic SuperHyperEulerian-Type-Cycle-Cut; 80

an Extreme V-SuperHyperEulerian-Type-Cycle-Cut SuperHyperPolynomial if it’s either of 81

Neutrosophic e-SuperHyperEulerian-Type-Cycle-Cut, Neutrosophic 82

re-SuperHyperEulerian-Type-Cycle-Cut, Neutrosophic v-SuperHyperEulerian-Type-Cycle-Cut, and 83

Neutrosophic rv-SuperHyperEulerian-Type-Cycle-Cut and C(N SHG) for an Extreme 84

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

Extreme coefficients defined as the Extreme number of the maximum Extreme 86

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

Extreme cardinality conseNeighborive Extreme SuperHyperEdges and Extreme 88

SuperHyperVertices such that they form the Extreme SuperHyperEulerian-Type-Cycle-Cut; 89

and the Extreme power is corresponded to its Extreme coefficient; a Neutrosophic 90

SuperHyperEulerian-Type-Cycle-Cut SuperHyperPolynomial if it’s either of Neutrosophic 91

e-SuperHyperEulerian-Type-Cycle-Cut, Neutrosophic re-SuperHyperEulerian-Type-Cycle-Cut, 92

Neutrosophic v-SuperHyperEulerian-Type-Cycle-Cut, and Neutrosophic 93

rv-SuperHyperEulerian-Type-Cycle-Cut and C(N SHG) for a Neutrosophic SuperHyperGraph 94

N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains the Neutrosophic 95

coefficients defined as the Neutrosophic number of the maximum Neutrosophic 96

cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S 97

of high Neutrosophic cardinality conseNeighborive Neutrosophic SuperHyperEdges and 98

Neutrosophic SuperHyperVertices such that they form the Neutrosophic 99

SuperHyperEulerian-Type-Cycle-Cut; and the Neutrosophic power is corresponded to its 100

Neutrosophic coefficient. In this scientific research, new setting is introduced for new 101

SuperHyperNotions, namely, a SuperHyperEulerian-Type-Cycle-Cut and Neutrosophic 102

SuperHyperEulerian-Type-Cycle-Cut. Two different types of SuperHyperDefinitions are debut 103

for them but the research goes further and the SuperHyperNotion, SuperHyperUniform, 104

and SuperHyperClass based on that are well-defined and well-reviewed. The literature 105

review is implemented in the whole of this research. For shining the elegancy and the 106

significancy of this research, the comparison between this SuperHyperNotion with other 107

SuperHyperNotions and fundamental SuperHyperNumbers are featured. The definitions 108

are followed by the examples and the instances thus the clarifications are driven with 109

different tools. The applications are figured out to make sense about the theoretical 110

aspect of this ongoing research. The “Cancer’s Recognition” are the under research to 111

figure out the challenges make sense about ongoing and upcoming research. The special 112

case is up. The cells are viewed in the deemed ways. There are different types of them. 113

Some of them are individuals and some of them are well-modeled by the group of cells. 114

These types are all officially called “SuperHyperVertex” but the relations amid them all 115

officially called “SuperHyperEdge”. The frameworks “SuperHyperGraph” and 116

“Neutrosophic SuperHyperGraph” are chosen and elected to research about “Cancer’s 117

Recognition”. Thus these complex and dense SuperHyperModels open up some avenues 118

to research on theoretical segments and “Cancer’s Recognition”. Some avenues are 119

posed to pursue this research. It’s also officially collected in the form of some questions 120

and some problems. Assume a SuperHyperGraph. Assume a SuperHyperGraph. Then 121

δ−SuperHyperEulerian-Type-Cycle-Cut is a maximal of SuperHyperVertices with a 122

maximum cardinality such that either of the following expressions hold for the 123

(Neutrosophic) cardinalities of SuperHyperNeighbors of s ∈ S : there are 124

|S ∩ N (s)| > |S ∩ (V \ N (s))| + δ; and |S ∩ N (s)| < |S ∩ (V \ N (s))| + δ. The first 125

Expression, holds if S is an δ−SuperHyperOffensive. And the second Expression, holds 126

if S is an δ−SuperHyperDefensive; a Neutrosophic δ−SuperHyperEulerian-Type-Cycle-Cut is a 127

maximal Neutrosophic of SuperHyperVertices with maximum Neutrosophic 128

cardinality such that either of the following expressions hold for the Neutrosophic 129

cardinalities of SuperHyperNeighbors of s ∈ S there are: 130

|S ∩ N (s)|N eutrosophic > |S ∩ (V \ N (s))|N eutrosophic + δ; 131

and |S ∩ N (s)|N eutrosophic < |S ∩ (V \ N (s))|N eutrosophic + δ. The first Expression, 132

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

holds if S is a Neutrosophic δ−SuperHyperOffensive. And the second Expression, holds 133

if S is a Neutrosophic δ−SuperHyperDefensive It’s useful to define a “Neutrosophic” 134

version of a SuperHyperEulerian-Type-Cycle-Cut . Since there’s more ways to get type-results 135

to make a SuperHyperEulerian-Type-Cycle-Cut more understandable. For the sake of having 136

Neutrosophic SuperHyperEulerian-Type-Cycle-Cut, there’s a need to “redefine” the notion of a 137

“SuperHyperEulerian-Type-Cycle-Cut ”. The SuperHyperVertices and the SuperHyperEdges are 138

assigned by the labels from the letters of the alphabets. In this procedure, there’s the 139

usage of the position of labels to assign to the values. Assume a 140

SuperHyperEulerian-Type-Cycle-Cut . It’s redefined a Neutrosophic 141

SuperHyperEulerian-Type-Cycle-Cut if the mentioned Table holds, concerning, “The Values of 142

Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges Belong to The 143

Neutrosophic SuperHyperGraph” with the key points, “The Values of The Vertices & 144

The Number of Position in Alphabet”, “The Values of The SuperVertices&The 145

maximum Values of Its Vertices”, “The Values of The Edges&The maximum Values of 146

Its Vertices”, “The Values of The HyperEdges&The maximum Values of Its Vertices”, 147

“The Values of The SuperHyperEdges&The maximum Values of Its Endpoints”. To get 148

structural examples and instances, I’m going to introduce the next SuperHyperClass of 149

SuperHyperGraph based on a SuperHyperEulerian-Type-Cycle-Cut . It’s the main. It’ll be 150

disciplinary to have the foundation of previous definition in the kind of 151

SuperHyperClass. If there’s a need to have all SuperHyperEulerian-Type-Cycle-Cut until the 152

SuperHyperEulerian-Type-Cycle-Cut, then it’s officially called a “SuperHyperEulerian-Type-Cycle-Cut” 153

but otherwise, it isn’t a SuperHyperEulerian-Type-Cycle-Cut . There are some instances about 154

the clarifications for the main definition titled a “SuperHyperEulerian-Type-Cycle-Cut ”. 155

These two examples get more scrutiny and discernment since there are characterized in 156

the disciplinary ways of the SuperHyperClass based on a SuperHyperEulerian-Type-Cycle-Cut . 157

For the sake of having a Neutrosophic SuperHyperEulerian-Type-Cycle-Cut, there’s a need to 158

“redefine” the notion of a “Neutrosophic SuperHyperEulerian-Type-Cycle-Cut” and a 159

“Neutrosophic SuperHyperEulerian-Type-Cycle-Cut ”. The SuperHyperVertices and the 160

SuperHyperEdges are assigned by the labels from the letters of the alphabets. In this 161

procedure, there’s the usage of the position of labels to assign to the values. Assume a 162

Neutrosophic SuperHyperGraph. It’s redefined “Neutrosophic SuperHyperGraph” if the 163

intended Table holds. And a SuperHyperEulerian-Type-Cycle-Cut are redefined to a 164

“Neutrosophic SuperHyperEulerian-Type-Cycle-Cut” if the intended Table holds. It’s useful to 165

define “Neutrosophic” version of SuperHyperClasses. Since there’s more ways to get 166

Neutrosophic type-results to make a Neutrosophic SuperHyperEulerian-Type-Cycle-Cut more 167

understandable. Assume a Neutrosophic SuperHyperGraph. There are some 168

Neutrosophic SuperHyperClasses if the intended Table holds. Thus SuperHyperPath, 169

SuperHyperEulerian-Type-Cycle-Cut, SuperHyperStar, SuperHyperBipartite, 170

SuperHyperMultiPartite, and SuperHyperWheel, are “Neutrosophic 171

SuperHyperPath”, “Neutrosophic SuperHyperEulerian-Type-Cycle-Cut”, “Neutrosophic 172

SuperHyperStar”, “Neutrosophic SuperHyperBipartite”, “Neutrosophic 173

SuperHyperMultiPartite”, and “Neutrosophic SuperHyperWheel” if the intended Table 174

holds. A SuperHyperGraph has a “Neutrosophic SuperHyperEulerian-Type-Cycle-Cut” where 175

it’s the strongest [the maximum Neutrosophic value from all the 176

SuperHyperEulerian-Type-Cycle-Cut amid the maximum value amid all SuperHyperVertices 177

from a SuperHyperEulerian-Type-Cycle-Cut .] SuperHyperEulerian-Type-Cycle-Cut . A graph is a 178

SuperHyperUniform if it’s a SuperHyperGraph and the number of elements of 179

SuperHyperEdges are the same. Assume a Neutrosophic SuperHyperGraph. There are 180

some SuperHyperClasses as follows. It’s SuperHyperPath if it’s only one SuperVertex as 181

intersection amid two given SuperHyperEdges with two exceptions; it’s 182

SuperHyperEulerian-Type-Cycle-Cut if it’s only one SuperVertex as intersection amid two given 183

SuperHyperEdges; it’s SuperHyperStar it’s only one SuperVertex as intersection amid 184

all SuperHyperEdges; it’s SuperHyperBipartite it’s only one SuperVertex as intersection 185

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

amid two given SuperHyperEdges and these SuperVertices, forming two separate sets, 186

has no SuperHyperEdge in common; it’s SuperHyperMultiPartite it’s only one 187

SuperVertex as intersection amid two given SuperHyperEdges and these SuperVertices, 188

forming multi separate sets, has no SuperHyperEdge in common; it’s a 189

SuperHyperWheel if it’s only one SuperVertex as intersection amid two given 190

SuperHyperEdges and one SuperVertex has one SuperHyperEdge with any common 191

SuperVertex. The SuperHyperModel proposes the specific designs and the specific 192

architectures. The SuperHyperModel is officially called “SuperHyperGraph” and 193

“Neutrosophic SuperHyperGraph”. In this SuperHyperModel, The “specific” cells and 194

“specific group” of cells are SuperHyperModeled as “SuperHyperVertices” and the 195

common and intended properties between “specific” cells and “specific group” of cells 196

are SuperHyperModeled as “SuperHyperEdges”. Sometimes, it’s useful to have some 197

degrees of determinacy, indeterminacy, and neutrality to have more precise 198

SuperHyperModel which in this case the SuperHyperModel is called “Neutrosophic”. In 199

the future research, the foundation will be based on the “Cancer’s Recognition” and the 200

results and the definitions will be introduced in redeemed ways. The recognition of the 201

cancer in the long-term function. The specific region has been assigned by the model 202

[it’s called SuperHyperGraph] and the long cycle of the move from the cancer is 203

identified by this research. Sometimes the move of the cancer hasn’t be easily identified 204

since there are some determinacy, indeterminacy and neutrality about the moves and 205

the effects of the cancer on that region; this event leads us to choose another model [it’s 206

said to be Neutrosophic SuperHyperGraph] to have convenient perception on what’s 207

happened and what’s done. There are some specific models, which are well-known and 208

they’ve got the names, and some SuperHyperGeneral SuperHyperModels. The moves 209

and the traces of the cancer on the complex tracks and between complicated groups of 210

cells could be fantasized by a Neutrosophic 211

SuperHyperPath(-/SuperHyperEulerian-Type-Cycle-Cut, SuperHyperStar, 212

SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find 213

either the longest SuperHyperEulerian-Type-Cycle-Cut or the strongest 214

SuperHyperEulerian-Type-Cycle-Cut in those Neutrosophic SuperHyperModels. For the 215

longest SuperHyperEulerian-Type-Cycle-Cut, called SuperHyperEulerian-Type-Cycle-Cut, and the 216

strongest SuperHyperEulerian-Type-Cycle-Cut, called Neutrosophic 217

SuperHyperEulerian-Type-Cycle-Cut, some general results are introduced. Beyond that in 218

SuperHyperStar, all possible SuperHyperPaths have only two SuperHyperEdges but it’s 219

not enough since it’s essential to have at least three SuperHyperEdges to form any style 220

of a SuperHyperEulerian-Type-Cycle-Cut. There isn’t any formation of any 221

SuperHyperEulerian-Type-Cycle-Cut but literarily, it’s the deformation of any 222

SuperHyperEulerian-Type-Cycle-Cut. It, literarily, deforms and it doesn’t form. A basic 223

familiarity with Neutrosophic SuperHyperEulerian-Type-Cycle-Cut theory, SuperHyperGraphs, 224

and Neutrosophic SuperHyperGraphs theory are proposed. 225

Keywords: Neutrosophic SuperHyperGraph, SuperHyperEulerian-Type-Cycle-Cut, 226

Cancer’s Neutrosophic Recognition 227

AMS Subject Classification: 05C17, 05C22, 05E45 228

2 Applied Notions Under The Scrutiny Of The 229

Motivation Of This Scientific Research 230

In this scientific research, there are some ideas in the featured frameworks of 231

motivations. I try to bring the motivations in the narrative ways. Some cells have been 232

faced with some attacks from the situation which is caused by the cancer’s attacks. In 233

this case, there are some embedded analysis on the ongoing situations which in that, the 234

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

cells could be labelled as some groups and some groups or individuals have excessive 235

labels which all are raised from the behaviors to overcome the cancer’s attacks. In the 236

embedded situations, the individuals of cells and the groups of cells could be considered 237

as “new groups”. Thus it motivates us to find the proper SuperHyperModels for getting 238

more proper analysis on this messy story. I’ve found the SuperHyperModels which are 239

officially called “SuperHyperGraphs” and “Neutrosophic SuperHyperGraphs”. In this 240

SuperHyperModel, the cells and the groups of cells are defined as “SuperHyperVertices” 241

and the relations between the individuals of cells and the groups of cells are defined as 242

“SuperHyperEdges”. Thus it’s another motivation for us to do research on this 243

SuperHyperModel based on the “Cancer’s Recognition”. Sometimes, the situations get 244

worst. The situation is passed from the certainty and precise style. Thus it’s the beyond 245

them. There are three descriptions, namely, the degrees of determinacy, indeterminacy 246

and neutrality, for any object based on vague forms, namely, incomplete data, imprecise 247

data, and uncertain analysis. The latter model could be considered on the previous 248

SuperHyperModel. It’s SuperHyperModel. It’s SuperHyperGraph but it’s officially 249

called “Neutrosophic SuperHyperGraphs”. The cancer is the disease but the model is 250

going to figure out what’s going on this phenomenon. The special case of this disease is 251

considered and as the consequences of the model, some parameters are used. The cells 252

are under attack of this disease but the moves of the cancer in the special region are the 253

matter of mind. The recognition of the cancer could help to find some treatments for 254

this disease. The SuperHyperGraph and Neutrosophic SuperHyperGraph are the 255

SuperHyperModels on the “Cancer’s Recognition” and both bases are the background 256

of this research. Sometimes the cancer has been happened on the region, full of cells, 257

groups of cells and embedded styles. In this segment, the SuperHyperModel proposes 258

some SuperHyperNotions based on the connectivities of the moves of the cancer in the 259

forms of alliances’ styles with the formation of the design and the architecture are 260

formally called “ SuperHyperEulerian-Type-Cycle-Cut” in the themes of jargons and buzzwords. 261

The prefix “SuperHyper” refers to the theme of the embedded styles to figure out the 262

background for the SuperHyperNotions. The recognition of the cancer in the long-term 263

function. The specific region has been assigned by the model [it’s called 264

SuperHyperGraph] and the long cycle of the move from the cancer is identified by this 265

research. Sometimes the move of the cancer hasn’t be easily identified since there are 266

some determinacy, indeterminacy and neutrality about the moves and the effects of the 267

cancer on that region; this event leads us to choose another model [it’s said to be 268

Neutrosophic SuperHyperGraph] to have convenient perception on what’s happened and 269

what’s done. There are some specific models, which are well-known and they’ve got the 270

names, and some general models. The moves and the traces of the cancer on the 271

complex tracks and between complicated groups of cells could be fantasized by a 272

Neutrosophic SuperHyperPath (-/SuperHyperEulerian-Type-Cycle-Cut, SuperHyperStar, 273

SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find 274

either the optimal SuperHyperEulerian-Type-Cycle-Cut or the Neutrosophic 275

SuperHyperEulerian-Type-Cycle-Cut in those Neutrosophic SuperHyperModels. Some general 276

results are introduced. Beyond that in SuperHyperStar, all possible Neutrosophic 277

SuperHyperPath s have only two SuperHyperEdges but it’s not enough since it’s 278

essential to have at least three SuperHyperEdges to form any style of a 279

SuperHyperEulerian-Type-Cycle-Cut. There isn’t any formation of any 280

SuperHyperEulerian-Type-Cycle-Cut but literarily, it’s the deformation of any 281

SuperHyperEulerian-Type-Cycle-Cut. It, literarily, deforms and it doesn’t form. 282

Question 2.1. How to define the SuperHyperNotions and to do research on them to 283

find the “ amount of SuperHyperEulerian-Type-Cycle-Cut” of either individual of cells or the 284

groups of cells based on the fixed cell or the fixed group of cells, extensively, the “amount 285

of SuperHyperEulerian-Type-Cycle-Cut” based on the fixed groups of cells or the fixed groups of 286

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

group of cells? 287

Question 2.2. What are the best descriptions for the “Cancer’s Recognition” in terms 288

of these messy and dense SuperHyperModels where embedded notions are illustrated? 289

It’s motivation to find notions to use in this dense model is titled 290

“SuperHyperGraphs”. Thus it motivates us to define different types of “ 291

SuperHyperEulerian-Type-Cycle-Cut” and “Neutrosophic SuperHyperEulerian-Type-Cycle-Cut” on 292

“SuperHyperGraph” and “Neutrosophic SuperHyperGraph”. Then the research has 293

taken more motivations to define SuperHyperClasses and to find some connections amid 294

this SuperHyperNotion with other SuperHyperNotions. It motivates us to get some 295

instances and examples to make clarifications about the framework of this research. The 296

general results and some results about some connections are some avenues to make key 297

point of this research, “Cancer’s Recognition”, more understandable and more clear. 298

The framework of this research is as follows. In the beginning, I introduce basic 299

definitions to clarify about preliminaries. In the subsection “Preliminaries”, initial 300

definitions about SuperHyperGraphs and Neutrosophic SuperHyperGraph are 301

deeply-introduced and in-depth-discussed. The elementary concepts are clarified and 302

illustrated completely and sometimes review literature are applied to make sense about 303

what’s going to figure out about the upcoming sections. The main definitions and their 304

clarifications alongside some results about new notions, SuperHyperEulerian-Type-Cycle-Cut 305

and Neutrosophic SuperHyperEulerian-Type-Cycle-Cut, are figured out in sections “ 306

SuperHyperEulerian-Type-Cycle-Cut” and “Neutrosophic SuperHyperEulerian-Type-Cycle-Cut”. In 307

the sense of tackling on getting results and in Eulerian-Type-Cycle-Cut to make sense about 308

continuing the research, the ideas of SuperHyperUniform and Neutrosophic 309

SuperHyperUniform are introduced and as their consequences, corresponded 310

SuperHyperClasses are figured out to debut what’s done in this section, titled “Results 311

on SuperHyperClasses” and “Results on Neutrosophic SuperHyperClasses”. As going 312

back to origin of the notions, there are some smart steps toward the common notions to 313

extend the new notions in new frameworks, SuperHyperGraph and Neutrosophic 314

SuperHyperGraph, in the sections “Results on SuperHyperClasses” and “Results on 315

Neutrosophic SuperHyperClasses”. The starter research about the general 316

SuperHyperRelations and as concluding and closing section of theoretical research are 317

contained in the section “General Results”. Some general SuperHyperRelations are 318

fundamental and they are well-known as fundamental SuperHyperNotions as elicited 319

and discussed in the sections, “General Results”, “ SuperHyperEulerian-Type-Cycle-Cut”, 320

“Neutrosophic SuperHyperEulerian-Type-Cycle-Cut”, “Results on SuperHyperClasses” and 321

“Results on Neutrosophic SuperHyperClasses”. There are curious questions about what’s 322

done about the SuperHyperNotions to make sense about excellency of this research and 323

going to figure out the word “best” as the description and adjective for this research as 324

presented in section, “ SuperHyperEulerian-Type-Cycle-Cut”. The keyword of this research 325

debut in the section “Applications in Cancer’s Recognition” with two cases and 326

subsections “Case 1: The Initial Steps Toward SuperHyperBipartite as 327

SuperHyperModel” and “Case 2: The Increasing Steps Toward SuperHyperMultipartite 328

as SuperHyperModel”. In the section, “Open Problems”, there are some scrutiny and 329

discernment on what’s done and what’s happened in this research in the terms of 330

“questions” and “problems” to make sense to figure out this research in featured style. 331

The advantages and the limitations of this research alongside about what’s done in this 332

research to make sense and to get sense about what’s figured out are included in the 333

section, “Conclusion and Closing Remarks”. 334

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

3 Neutrosophic Preliminaries Of This Scientific 335

Research On the Redeemed Ways 336

In this section, the basic material in this scientific research, is referred to [Single Valued 337

Neutrosophic Set](Ref. [189],Definition 2.2,p.2), [Neutrosophic 338

Set](Ref. [189],Definition 2.1,p.1), [Neutrosophic SuperHyperGraph 339

(NSHG)](Ref. [189],Definition 2.5,p.2), [Characterization of the Neutrosophic 340

SuperHyperGraph (NSHG)](Ref. [189],Definition 2.7,p.3), [t-norm](Ref. [189], 341

Definition 2.7, p.3), and [Characterization of the Neutrosophic SuperHyperGraph 342

(NSHG)](Ref. [189],Definition 2.7,p.3), [Neutrosophic Strength of the Neutrosophic 343

SuperHyperPaths] (Ref. [189],Definition 5.3,p.7), and [Different Neutrosophic Types of 344

Neutrosophic SuperHyperEdges (NSHE)] (Ref. [189],Definition 5.4,p.7). Also, the new 345

ideas and their clarifications are addressed to Ref. [189]. 346

In this subsection, the basic material which is used in this scientific research, is 347

presented. Also, the new ideas and their clarifications are elicited. 348

Definition 3.1 (Neutrosophic Set). (Ref. [189],Definition 2.1,p.1). 349

Let X be a Eulerian-Type-Cycle-Cut 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 350
+
]− 0, 1 [. 351

Definition 3.2 (Single Valued Neutrosophic Set). (Ref. [189],Definition 2.2,p.2). 352

Let X be a Eulerian-Type-Cycle-Cut 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}.

Definition 3.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 3.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}.

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

Definition 3.5 (Neutrosophic SuperHyperGraph (NSHG)). (Ref. [189],Definition 353

2.5,p.2). 354

Assume V 0 is a given set. a Neutrosophic SuperHyperGraph (NSHG) S is a 355

pair S = (V, E), where 356

(i) V = {V1 , V2 , . . . , Vn } a finite set of finite single valued Neutrosophic subsets of V 0 ; 357

(ii) V = {(Vi , TV 0 (Vi ), IV 0 (Vi ), FV 0 (Vi )) : TV 0 (Vi ), IV 0 (Vi ), FV 0 (Vi ) ≥ 0}, (i = 358

1, 2, . . . , n); 359

(iii) E = {E1 , E2 , . . . , En0 } a finite set of finite single valued Neutrosophic subsets of 360

V; 361

(iv) E = {(Ei0 , TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 )) : TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 ) ≥ 0}, (i0 = 362

1, 2, . . . , n0 ); 363

(v) Vi 6= ∅, (i = 1, 2, . . . , n); 364

(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 365

P
(vii) i supp(Vi ) = V, (i = 1, 2, . . . , n); 366

0 0
P
(viii) i0 supp(Ei ) = V, (i = 1, 2, . . . , n );
0 367

(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 . 368

Here the Neutrosophic SuperHyperEdges (NSHE) Ej 0 and the Neutrosophic 369

SuperHyperVertices (NSHV) Vj are single valued Neutrosophic sets. TV 0 (Vi ), IV 0 (Vi ), 370

and FV 0 (Vi ) denote the degree of truth-membership, the degree of 371

indeterminacy-membership and the degree of falsity-membership the Neutrosophic 372

SuperHyperVertex (NSHV) Vi to the Neutrosophic SuperHyperVertex (NSHV) V. 373

TV0 (Ei0 ), TV0 (Ei0 ), and TV0 (Ei0 ) denote the degree of truth-membership, the degree of 374

indeterminacy-membership and the degree of falsity-membership of the Neutrosophic 375

SuperHyperEdge (NSHE) Ei0 to the Neutrosophic SuperHyperEdge (NSHE) E. Thus, 376

the ii0 th element of the incidence matrix of Neutrosophic SuperHyperGraph (NSHG) 377

are of the form (Vi , TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 )), the sets V and E are crisp sets. 378

Definition 3.6 (Characterization of the Neutrosophic SuperHyperGraph (NSHG)). 379

(Ref. [189],Definition 2.7,p.3). 380

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). The 381

Neutrosophic SuperHyperEdges (NSHE) Ei0 and the Neutrosophic SuperHyperVertices 382

(NSHV) Vi of Neutrosophic SuperHyperGraph (NSHG) S = (V, E) could be 383

characterized as follow-up items. 384

(i) If |Vi | = 1, then Vi is called vertex; 385

(ii) if |Vi | ≥ 1, then Vi is called SuperVertex; 386

(iii) if for all Vi s are incident in Ei0 , |Vi | = 1, and |Ei0 | = 2, then Ei0 is called edge; 387

(iv) if for all Vi s are incident in Ei0 , |Vi | = 1, and |Ei0 | ≥ 2, then Ei0 is called 388

HyperEdge; 389

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

(v) if there’s a Vi is incident in Ei0 such that |Vi | ≥ 1, and |Ei0 | = 2, then Ei0 is called 390

SuperEdge; 391

(vi) if there’s a Vi is incident in Ei0 such that |Vi | ≥ 1, and |Ei0 | ≥ 2, then Ei0 is called 392

SuperHyperEdge. 393

If we choose different types of binary operations, then we could get hugely diverse 394

types of general forms of Neutrosophic SuperHyperGraph (NSHG). 395

Definition 3.7 (t-norm). (Ref. [189], Definition 2.7, p.3). 396

A binary operation ⊗ : [0, 1] × [0, 1] → [0, 1] is a t-norm if it satisfies the following 397

for x, y, z, w ∈ [0, 1]: 398

(i) 1 ⊗ x = x; 399

(ii) x ⊗ y = y ⊗ x; 400

(iii) x ⊗ (y ⊗ z) = (x ⊗ y) ⊗ z; 401

(iv) If w ≤ x and y ≤ z then w ⊗ y ≤ x ⊗ z. 402

Definition 3.8. 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} (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 .
Definition 3.9. 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 3.10. (General Forms of Neutrosophic SuperHyperGraph (NSHG)). 403

Assume V 0 is a given set. a Neutrosophic SuperHyperGraph (NSHG) S is a 404

pair S = (V, E), where 405

(i) V = {V1 , V2 , . . . , Vn } a finite set of finite single valued Neutrosophic subsets of V 0 ; 406

(ii) V = {(Vi , TV 0 (Vi ), IV 0 (Vi ), FV 0 (Vi )) : TV 0 (Vi ), IV 0 (Vi ), FV 0 (Vi ) ≥ 0}, (i = 407

1, 2, . . . , n); 408

(iii) E = {E1 , E2 , . . . , En0 } a finite set of finite single valued Neutrosophic subsets of 409

V; 410

(iv) E = {(Ei0 , TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 )) : TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 ) ≥ 0}, (i0 = 411

1, 2, . . . , n0 ); 412

(v) Vi 6= ∅, (i = 1, 2, . . . , n); 413

(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 414

P
(vii) i supp(Vi ) = V, (i = 1, 2, . . . , n); 415

0 0
P
(viii) i0 supp(Ei ) = V, (i = 1, 2, . . . , n ).
0 416

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

Here the Neutrosophic SuperHyperEdges (NSHE) Ej 0 and the Neutrosophic 417

SuperHyperVertices (NSHV) Vj are single valued Neutrosophic sets. TV 0 (Vi ), IV 0 (Vi ), 418

and FV 0 (Vi ) denote the degree of truth-membership, the degree of 419

indeterminacy-membership and the degree of falsity-membership the Neutrosophic 420

SuperHyperVertex (NSHV) Vi to the Neutrosophic SuperHyperVertex (NSHV) V. 421

TV0 (Ei0 ), TV0 (Ei0 ), and TV0 (Ei0 ) denote the degree of truth-membership, the degree of 422

indeterminacy-membership and the degree of falsity-membership of the Neutrosophic 423

SuperHyperEdge (NSHE) Ei0 to the Neutrosophic SuperHyperEdge (NSHE) E. Thus, 424

the ii0 th element of the incidence matrix of Neutrosophic SuperHyperGraph (NSHG) 425

are of the form (Vi , TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 )), the sets V and E are crisp sets. 426

Definition 3.11 (Characterization of the Neutrosophic SuperHyperGraph (NSHG)). 427

(Ref. [189],Definition 2.7,p.3). 428

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). The 429

Neutrosophic SuperHyperEdges (NSHE) Ei0 and the Neutrosophic SuperHyperVertices 430

(NSHV) Vi of Neutrosophic SuperHyperGraph (NSHG) S = (V, E) could be 431

characterized as follow-up items. 432

(i) If |Vi | = 1, then Vi is called vertex; 433

(ii) if |Vi | ≥ 1, then Vi is called SuperVertex; 434

(iii) if for all Vi s are incident in Ei0 , |Vi | = 1, and |Ei0 | = 2, then Ei0 is called edge; 435

(iv) if for all Vi s are incident in Ei0 , |Vi | = 1, and |Ei0 | ≥ 2, then Ei0 is called 436

HyperEdge; 437

(v) if there’s a Vi is incident in Ei0 such that |Vi | ≥ 1, and |Ei0 | = 2, then Ei0 is called 438

SuperEdge; 439

(vi) if there’s a Vi is incident in Ei0 such that |Vi | ≥ 1, and |Ei0 | ≥ 2, then Ei0 is called 440

SuperHyperEdge. 441

This SuperHyperModel is too messy and too dense. Thus there’s a need to have 442

some restrictions and conditions on SuperHyperGraph. The special case of this 443

SuperHyperGraph makes the patterns and regularities. 444

Definition 3.12. A graph is SuperHyperUniform if it’s SuperHyperGraph and the 445

number of elements of SuperHyperEdges are the same. 446

To get more visions on SuperHyperUniform, the some SuperHyperClasses are 447

introduced. It makes to have SuperHyperUniform more understandable. 448

Definition 3.13. Assume a Neutrosophic SuperHyperGraph. There are some 449

SuperHyperClasses as follows. 450

(i). It’s Neutrosophic SuperHyperPath if it’s only one SuperVertex as 451

intersection amid two given SuperHyperEdges with two exceptions; 452

(ii). it’s SuperHyperCycle if it’s only one SuperVertex as intersection amid two 453

given SuperHyperEdges; 454

(iii). it’s SuperHyperStar it’s only one SuperVertex as intersection amid all 455

SuperHyperEdges; 456

(iv). it’s SuperHyperBipartite it’s only one SuperVertex as intersection amid two 457

given SuperHyperEdges and these SuperVertices, forming two separate sets, has 458

no SuperHyperEdge in common; 459

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

(v). it’s SuperHyperMultiPartite it’s only one SuperVertex as intersection amid 460

two given SuperHyperEdges and these SuperVertices, forming multi separate sets, 461

has no SuperHyperEdge in common; 462

(vi). it’s SuperHyperWheel if it’s only one SuperVertex as intersection amid two 463

given SuperHyperEdges and one SuperVertex has one SuperHyperEdge with any 464

common SuperVertex. 465

Definition 3.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 466

SuperHyperVertex (NSHV) V1 to Neutrosophic SuperHyperVertex (NSHV) Vs if either 467

of following conditions hold: 468

(i) Vi , Vi+1 ∈ Ei0 ; 469

(ii) there’s a vertex vi ∈ Vi such that vi , Vi+1 ∈ Ei0 ; 470

(iii) there’s a SuperVertex Vi0 ∈ Vi such that Vi0 , Vi+1 ∈ Ei0 ; 471

(iv) there’s a vertex vi+1 ∈ Vi+1 such that Vi , vi+1 ∈ Ei0 ; 472

0 0
(v) there’s a SuperVertex Vi+1 ∈ Vi+1 such that Vi , Vi+1 ∈ Ei0 ; 473

(vi) there are a vertex vi ∈ Vi and a vertex vi+1 ∈ Vi+1 such that vi , vi+1 ∈ Ei0 ; 474

0 0
(vii) there are a vertex vi ∈ Vi and a SuperVertex Vi+1 ∈ Vi+1 such that vi , Vi+1 ∈ Ei0 ; 475

(viii) there are a SuperVertex Vi0 ∈ Vi and a vertex vi+1 ∈ Vi+1 such that Vi0 , vi+1 ∈ Ei0 ; 476

(ix) there are a SuperVertex Vi0 ∈ Vi and a SuperVertex Vi+1


0
∈ Vi+1 such that 477
0 0
Vi , Vi+1 ∈ Ei0 . 478

Definition 3.15. (Characterization of the Neutrosophic SuperHyperPaths). 479

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

(i) If for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | = 2, then NSHP is called path; 481

(ii) if for all Ej 0 , |Ej 0 | = 2, and there’s Vi , |Vi | ≥ 1, then NSHP is called SuperPath; 482

(iii) if for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | ≥ 2, then NSHP is called HyperPath; 483

(iv) if there are Vi , Ej 0 , |Vi | ≥ 1, |Ej 0 | ≥ 2, then NSHP is called Neutrosophic 484

SuperHyperPath . 485

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

Definition 3.16 (Neutrosophic Strength of the Neutrosophic SuperHyperPaths). 486

(Ref. [189],Definition 5.3,p.7). 487

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 ,
have 488

(i) Neutrosophic t-strength (min{T (Vi )}, m, n)si=1 ; 489

(ii) Neutrosophic i-strength (m, min{I(Vi )}, n)si=1 ; 490

(iii) Neutrosophic f-strength (m, n, min{F (Vi )})si=1 ; 491

(iv) Neutrosophic strength (min{T (Vi )}, min{I(Vi )}, min{F (Vi )})si=1 . 492

Definition 3.17 (Different Neutrosophic Types of Neutrosophic SuperHyperEdges 493

(NSHE)). (Ref. [189],Definition 5.4,p.7). 494

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 495

a Neutrosophic SuperHyperEdge (NSHE) E = {V1 , V2 , . . . , Vs }. Then E is called 496

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

t-strength of SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex 498

(NSHV) Vi to Neutrosophic SuperHyperVertex (NSHV) Vj where 1 ≤ i, j ≤ s; 499

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

i-strength of SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex 501

(NSHV) Vi to Neutrosophic SuperHyperVertex (NSHV) Vj where 1 ≤ i, j ≤ s; 502

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

f-strength of SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex 504

(NSHV) Vi to Neutrosophic SuperHyperVertex (NSHV) Vj where 1 ≤ i, j ≤ s; 505

(xii) Neutrosophic connective if (T (E), I(E), F (E)) ≥ maximum number of 506

Neutrosophic strength of SuperHyperPath (NSHP) from Neutrosophic 507

SuperHyperVertex (NSHV) Vi to Neutrosophic SuperHyperVertex (NSHV) Vj 508

where 1 ≤ i, j ≤ s. 509

Definition 3.18. (Different Neutrosophic Types of Neutrosophic 510

SuperHyperEulerian-Type-Cycle-Cut). 511

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 512

a Neutrosophic SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and E 0 = {E1 , E2 , . . . , Ez }. Then 513

either V 0 or E 0 is called 514

(i) Neutrosophic e-SuperHyperEulerian-Type-Cycle-Cut if the following expression is 515

called Neutrosophic e-SuperHyperEulerian-Type-Cycle-Cut criteria holds 516

0
∀E ∈ C : C is
a SuperHyperCycle and it has
the maximum number of SuperHyperEdges;

(ii) Neutrosophic re-SuperHyperEulerian-Type-Cycle-Cut if the following expression is 517

called Neutrosophic re-SuperHyperEulerian-Type-Cycle-Cut criteria holds 518

∀E 0 ∈ C : C is
a SuperHyperCycle and it has
the maximum number of SuperHyperEdges;

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 519

(iii) Neutrosophic v-SuperHyperEulerian-Type-Cycle-Cut if the following expression is 520

called Neutrosophic v-SuperHyperEulerian-Type-Cycle-Cut criteria holds 521

∀V 0 ∈ C : C is
a SuperHyperCycle and it has
the maximum number of SuperHyperEdges;

(iv) Neutrosophic rv-SuperHyperEulerian-Type-Cycle-Cut if the following expression is 522

called Neutrosophic v-SuperHyperEulerian-Type-Cycle-Cut criteria holds 523

∀V 0 ∈ C : C is
a SuperHyperCycle and it has
the maximum number of SuperHyperEdges;

and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; 524

(v) Neutrosophic SuperHyperEulerian-Type-Cycle-Cut if it’s either of Neutrosophic 525

e-SuperHyperEulerian-Type-Cycle-Cut, Neutrosophic re-SuperHyperEulerian-Type-Cycle-Cut, 526

Neutrosophic v-SuperHyperEulerian-Type-Cycle-Cut, and Neutrosophic 527

rv-SuperHyperEulerian-Type-Cycle-Cut. 528

Definition 3.19. ((Neutrosophic) SuperHyperEulerian-Type-Cycle-Cut). 529

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 530

a Neutrosophic SuperHyperEdge (NSHE) E = {V1 , V2 , . . . , Vs }. Then E is called 531

(i) an Extreme SuperHyperEulerian-Type-Cycle-Cut if it’s either of Neutrosophic 532

e-SuperHyperEulerian-Type-Cycle-Cut, Neutrosophic re-SuperHyperEulerian-Type-Cycle-Cut, 533

Neutrosophic v-SuperHyperEulerian-Type-Cycle-Cut, and Neutrosophic 534

rv-SuperHyperEulerian-Type-Cycle-Cut and C(N SHG) for an Extreme 535

SuperHyperGraph N SHG : (V, E) is the maximum Extreme cardinality of an 536

Extreme SuperHyperSet S of high Extreme cardinality of the Extreme 537

SuperHyperEdges in the conseNeighborive Extreme sequence of Extreme 538

SuperHyperEdges and Extreme SuperHyperVertices such that they form the 539

Extreme SuperHyperEulerian-Type-Cycle-Cut; 540

(ii) a Neutrosophic SuperHyperEulerian-Type-Cycle-Cut if it’s either of Neutrosophic 541

e-SuperHyperEulerian-Type-Cycle-Cut, Neutrosophic re-SuperHyperEulerian-Type-Cycle-Cut, 542

Neutrosophic v-SuperHyperEulerian-Type-Cycle-Cut, and Neutrosophic 543

rv-SuperHyperEulerian-Type-Cycle-Cut and C(N SHG) for a Neutrosophic 544

SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic cardinality of 545

the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of high 546

Neutrosophic cardinality conseNeighborive Neutrosophic SuperHyperEdges and 547

Neutrosophic SuperHyperVertices such that they form the Neutrosophic 548

SuperHyperEulerian-Type-Cycle-Cut; 549

(iii) an Extreme SuperHyperEulerian-Type-Cycle-Cut SuperHyperPolynomial if it’s 550

either of Neutrosophic e-SuperHyperEulerian-Type-Cycle-Cut, Neutrosophic 551

re-SuperHyperEulerian-Type-Cycle-Cut, Neutrosophic v-SuperHyperEulerian-Type-Cycle-Cut, 552

and Neutrosophic rv-SuperHyperEulerian-Type-Cycle-Cut and C(N SHG) for an Extreme 553

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

contains the Extreme coefficients defined as the Extreme number of the maximum 555

Extreme cardinality of the Extreme SuperHyperEdges of an Extreme 556

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

SuperHyperSet S of high Extreme cardinality conseNeighborive Extreme 557

SuperHyperEdges and Extreme SuperHyperVertices such that they form the 558

Extreme SuperHyperEulerian-Type-Cycle-Cut; and the Extreme power is corresponded to 559

its Extreme coefficient; 560

(iv) a Neutrosophic SuperHyperEulerian-Type-Cycle-Cut SuperHyperPolynomial if 561

it’s either of Neutrosophic e-SuperHyperEulerian-Type-Cycle-Cut, Neutrosophic 562

re-SuperHyperEulerian-Type-Cycle-Cut, Neutrosophic v-SuperHyperEulerian-Type-Cycle-Cut, 563

and Neutrosophic rv-SuperHyperEulerian-Type-Cycle-Cut and C(N SHG) for a 564

Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic 565

SuperHyperPolynomial contains the Neutrosophic coefficients defined as the 566

Neutrosophic number of the maximum Neutrosophic cardinality of the 567

Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of high 568

Neutrosophic cardinality conseNeighborive Neutrosophic SuperHyperEdges and 569

Neutrosophic SuperHyperVertices such that they form the Neutrosophic 570

SuperHyperEulerian-Type-Cycle-Cut; and the Neutrosophic power is corresponded to its 571

Neutrosophic coefficient; 572

(v) an Extreme V-SuperHyperEulerian-Type-Cycle-Cut if it’s either of Neutrosophic 573

e-SuperHyperEulerian-Type-Cycle-Cut, Neutrosophic re-SuperHyperEulerian-Type-Cycle-Cut, 574

Neutrosophic v-SuperHyperEulerian-Type-Cycle-Cut, and Neutrosophic 575

rv-SuperHyperEulerian-Type-Cycle-Cut and C(N SHG) for an Extreme 576

SuperHyperGraph N SHG : (V, E) is the maximum Extreme cardinality of an 577

Extreme SuperHyperSet S of high Extreme cardinality of the Extreme 578

SuperHyperVertices in the conseNeighborive Extreme sequence of Extreme 579

SuperHyperEdges and Extreme SuperHyperVertices such that they form the 580

Extreme SuperHyperEulerian-Type-Cycle-Cut; 581

(vi) a Neutrosophic V-SuperHyperEulerian-Type-Cycle-Cut if it’s either of 582

Neutrosophic e-SuperHyperEulerian-Type-Cycle-Cut, Neutrosophic 583

re-SuperHyperEulerian-Type-Cycle-Cut, Neutrosophic v-SuperHyperEulerian-Type-Cycle-Cut, 584

and Neutrosophic rv-SuperHyperEulerian-Type-Cycle-Cut and C(N SHG) for a 585

Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic 586

cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic 587

SuperHyperSet S of high Neutrosophic cardinality conseNeighborive Neutrosophic 588

SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the 589

Neutrosophic SuperHyperEulerian-Type-Cycle-Cut; 590

(vii) an Extreme V-SuperHyperEulerian-Type-Cycle-Cut SuperHyperPolynomial if 591

it’s either of Neutrosophic e-SuperHyperEulerian-Type-Cycle-Cut, Neutrosophic 592

re-SuperHyperEulerian-Type-Cycle-Cut, Neutrosophic v-SuperHyperEulerian-Type-Cycle-Cut, 593

and Neutrosophic rv-SuperHyperEulerian-Type-Cycle-Cut and C(N SHG) for an Extreme 594

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

contains the Extreme coefficients defined as the Extreme number of the maximum 596

Extreme cardinality of the Extreme SuperHyperVertices of an Extreme 597

SuperHyperSet S of high Extreme cardinality conseNeighborive Extreme 598

SuperHyperEdges and Extreme SuperHyperVertices such that they form the 599

Extreme SuperHyperEulerian-Type-Cycle-Cut; and the Extreme power is corresponded to 600

its Extreme coefficient; 601

(viii) a Neutrosophic SuperHyperEulerian-Type-Cycle-Cut SuperHyperPolynomial if 602

it’s either of Neutrosophic e-SuperHyperEulerian-Type-Cycle-Cut, Neutrosophic 603

re-SuperHyperEulerian-Type-Cycle-Cut, Neutrosophic v-SuperHyperEulerian-Type-Cycle-Cut, 604

and Neutrosophic rv-SuperHyperEulerian-Type-Cycle-Cut and C(N SHG) for a 605

Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic 606

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

Table 1. The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHy-


perEdges Belong to The Neutrosophic SuperHyperGraph Mentioned in the Definition
(3.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
The Values of The SuperHyperEdges The maximum Values of Its Endpoints

SuperHyperPolynomial contains the Neutrosophic coefficients defined as the 607

Neutrosophic number of the maximum Neutrosophic cardinality of the 608

Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S of high 609

Neutrosophic cardinality conseNeighborive Neutrosophic SuperHyperEdges and 610

Neutrosophic SuperHyperVertices such that they form the Neutrosophic 611

SuperHyperEulerian-Type-Cycle-Cut; and the Neutrosophic power is corresponded to its 612

Neutrosophic coefficient. 613

Definition 3.20. ((Extreme/Neutrosophic)δ−SuperHyperEulerian-Type-Cycle-Cut). 614

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Then 615

(i) an δ−SuperHyperEulerian-Type-Cycle-Cut is a Neutrosophic kind of Neutrosophic 616

SuperHyperEulerian-Type-Cycle-Cut such that either of the following expressions hold for 617

the Neutrosophic cardinalities of SuperHyperNeighbors of s ∈ S : 618

|S ∩ N (s)| > |S ∩ (V \ N (s))| + δ;


|S ∩ N (s)| < |S ∩ (V \ N (s))| + δ.

The Expression (3.1), holds if S is an δ−SuperHyperOffensive. And the 619

Expression (3.1), holds if S is an δ−SuperHyperDefensive; 620

(ii) a Neutrosophic δ−SuperHyperEulerian-Type-Cycle-Cut is a Neutrosophic kind of 621

Neutrosophic SuperHyperEulerian-Type-Cycle-Cut such that either of the following 622

Neutrosophic expressions hold for the Neutrosophic cardinalities of 623

SuperHyperNeighbors of s ∈ S : 624

|S ∩ N (s)|N eutrosophic > |S ∩ (V \ N (s))|N eutrosophic + δ;


|S ∩ N (s)|N eutrosophic < |S ∩ (V \ N (s))|N eutrosophic + δ.

The Expression (3.1), holds if S is a Neutrosophic δ−SuperHyperOffensive. 625

And the Expression (3.1), holds if S is a Neutrosophic 626

δ−SuperHyperDefensive. 627

For the sake of having a Neutrosophic SuperHyperEulerian-Type-Cycle-Cut, there’s a need 628

to “redefine” the notion of “Neutrosophic SuperHyperGraph”. The 629

SuperHyperVertices and the SuperHyperEdges are assigned by the labels from the 630

letters of the alphabets. In this procedure, there’s the usage of the position of labels to 631

assign to the values. 632

Definition 3.21. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair 633

S = (V, E). It’s redefined Neutrosophic SuperHyperGraph if the Table (1) holds. 634

It’s useful to define a “Neutrosophic” version of SuperHyperClasses. Since there’s 635

more ways to get Neutrosophic type-results to make a Neutrosophic more 636

understandable. 637

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

Table 2. The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHy-


perEdges Belong to The Neutrosophic SuperHyperGraph, Mentioned in the Definition
(3.22)
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
The Values of The SuperHyperEdges The maximum Values of Its Endpoints

Table 3. The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHy-


perEdges Belong to The Neutrosophic SuperHyperGraph Mentioned in the Definition
(3.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
The Values of The SuperHyperEdges The maximum Values of Its Endpoints

Definition 3.22. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair 638

S = (V, E). There are some Neutrosophic SuperHyperClasses if the Table (2) 639

holds. Thus Neutrosophic SuperHyperPath , SuperHyperEulerian-Type-Cycle-Cut, 640

SuperHyperStar, SuperHyperBipartite, SuperHyperMultiPartite, and 641

SuperHyperWheel, are Neutrosophic SuperHyperPath, Neutrosophic 642

SuperHyperCycle, Neutrosophic SuperHyperStar, Neutrosophic 643

SuperHyperBipartite, Neutrosophic SuperHyperMultiPartite, and 644

Neutrosophic SuperHyperWheel if the Table (2) holds. 645

It’s useful to define a “Neutrosophic” version of a Neutrosophic 646

SuperHyperEulerian-Type-Cycle-Cut. Since there’s more ways to get type-results to make a 647

Neutrosophic SuperHyperEulerian-Type-Cycle-Cut more Neutrosophicly understandable. 648

For the sake of having a Neutrosophic SuperHyperEulerian-Type-Cycle-Cut, there’s a need 649

to “redefine” the Neutrosophic notion of “Neutrosophic SuperHyperEulerian-Type-Cycle-Cut”. 650

The SuperHyperVertices and the SuperHyperEdges are assigned by the labels from the 651

letters of the alphabets. In this procedure, there’s the usage of the position of labels to 652

assign to the values. 653

Definition 3.23. Assume a SuperHyperEulerian-Type-Cycle-Cut. It’s redefined a 654

Neutrosophic SuperHyperEulerian-Type-Cycle-Cut if the Table (3) holds. 655

4 Neutrosophic SuperHyper But As Eulerian-Type-Cycle-Cut 656

The Extensions Excerpt From Dense And Super 657

Forms 658

Definition 4.1. (Neutrosophic event). 659

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 660

S = (V, E) is a probability Eulerian-Type-Cycle-Cut. Any Neutrosophic k-subset of A of V is 661

called Neutrosophic k-event and if k = 2, then Neutrosophic subset of A of V is 662

called Neutrosophic event. The following expression is called Neutrosophic 663

probability of A. 664

X
E(A) = E(a). (4.1)
a∈A

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

Definition 4.2. (Neutrosophic Independent). 665

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 666

S = (V, E) is a probability Eulerian-Type-Cycle-Cut. s Neutrosophic k-events Ai , i ∈ I is 667

called Neutrosophic s-independent if the following expression is called 668

Neutrosophic s-independent criteria 669

Y
E(∩i∈I Ai ) = P (Ai ).
i∈I

And if s = 2, then Neutrosophic k-events of A and B is called Neutrosophic 670

independent. The following expression is called Neutrosophic independent 671

criteria 672

E(A ∩ B) = P (A)P (B). (4.2)


Definition 4.3. (Neutrosophic Variable). 673

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 674

S = (V, E) is a probability Eulerian-Type-Cycle-Cut. Any k-function Eulerian-Type-Cycle-Cut like E 675

is called Neutrosophic k-Variable. If k = 2, then any 2-function Eulerian-Type-Cycle-Cut 676

like E is called Neutrosophic Variable. 677

The notion of independent on Neutrosophic Variable is likewise. 678

Definition 4.4. (Neutrosophic Expectation). 679

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 680

S = (V, E) is a probability Eulerian-Type-Cycle-Cut. A Neutrosophic k-Variable E has a 681

number is called Neutrosophic Expectation if the following expression is called 682

Neutrosophic Expectation criteria 683

X
Ex(E) = E(α)P (α).
α∈V

Definition 4.5. (Neutrosophic Crossing). 684

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 685

S = (V, E) is a probability Eulerian-Type-Cycle-Cut. A Neutrosophic number is called 686

Neutrosophic Crossing if the following expression is called Neutrosophic 687

Crossing criteria 688

Cr(S) = min{Number of Crossing in a Plane Embedding of S}.


Lemma 4.6. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair 689

S = (V, E). Consider S = (V, E) is a probability Eulerian-Type-Cycle-Cut. Let m and n propose 690

special Eulerian-Type-Cycle-Cut. Then with m ≥ 4n, 691

Proof. Consider a planar embedding G of G with cr(G) crossings. Let S be a 692

Neutrosophic random k-subset of V obtained by choosing each SuperHyperVertex of G 693

Neutrosophic independently with probability Eulerian-Type-Cycle-Cut p := 4n/m, and set 694

H := G[S] and H := G[S]. 695

Define random variables X, Y, Z on V as follows: X is the Neutrosophic number of


SuperHyperVertices, Y the Neutrosophic number of SuperHyperEdges, and Z the
Neutrosophic number of crossings of H. The trivial bound noted above, when applied to
H, yields the inequality Z ≥ cr(H) ≥ Y − 3X. By linearity of Neutrosophic Expectation,
E(Z) ≥ E(Y ) − 3E(X).
Now E(X) = pn, E(Y ) = p2 m (each SuperHyperEdge having some SuperHyperEnds)
and E(Z) = p4 cr(G) (each crossing being defined by some SuperHyperVertices). Hence
p4 cr(G) ≥ p2 m − 3pn.

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

Dividing both sides by p4 , we have: 696

pm − 3n n 1 3 2
cr(G) ≥ = 3 = 64 m n .
p3 (4n/m)
697

Theorem 4.7. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair 698

S = (V, E). Consider S = (V, E) is a probability Eulerian-Type-Cycle-Cut. Let P be a 699

SuperHyperSet of n points in the plane, and let l be the Neutrosophic number of 700

SuperHyperLines
√ in the plane passing through at least k + 1 of these points, where 701

1 ≤ k ≤ 2 2n. Then l < 32n2 /k 3 . 702

Proof. Form a Neutrosophic SuperHyperGraph G with SuperHyperVertex 703

SuperHyperSet P whose SuperHyperEdge are the segments between conseNeighborive 704

points on the SuperHyperLines which pass through at least k + 1 points of P. This 705

Neutrosophic SuperHyperGraph has at least kl SuperHyperEdges and Neutrosophic 706

crossing at most l choose two. Thus either kl < 4n, in which case l < 4n/k ≤ 32n2 /k 3 , 707
3
or l2 /2 > l choose 2 ≥ cr(G) ≥ (kl) /64n2 by the Neutrosophic Crossing Lemma, and 708
2 3
again l < 32n /k . 709

Theorem 4.8. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair 710

S = (V, E). Consider S = (V, E) is a probability Eulerian-Type-Cycle-Cut. Let P be a 711

SuperHyperSet of n points in the plane, and let k be the number of pairs of points of P 712

at unit SuperHyperDistance. Then k < 5n4/3 . 713

Proof. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 714

Consider S = (V, E) is a probability Eulerian-Type-Cycle-Cut. Draw a SuperHyperUnit 715

SuperHyperCircle around each SuperHyperPoint of P. Let ni be the Neutrosophic 716

number of these SuperHyperCircles passing through exactly i points of P. Then 717

i = 0n−1 ni = n and k = 21 i = 0n−1 ini . Now form a Neutrosophic


P P
718

SuperHyperGraph H with SuperHyperVertex SuperHyperSet P whose 719

SuperHyperEdges are the SuperHyperArcs between conseNeighborive SuperHyperPoints 720

on the SuperHyperCircles that pass through at least three SuperHyperPoints of P. Then 721

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 722

SuperHyperEdges. Delete from H one of each SuperHyperPair of parallel 723

SuperHyperEdges, so as to obtain a simple Neutrosophic SuperHyperGraph G with 724

e(G) ≥ k − n. Now cr(G) ≤ n(n − 1) because G is formed from at most n 725

SuperHyperCircles, and any two SuperHyperCircles cross at most twice. Thus either 726
3
e(G) < 4n, in which case k < 5n < 5n4/3 , or n2 > n(n − 1) ≥ cr(G) ≥ (k − n) /64n2 727

by the Neutrosophic Crossing Lemma, and k < 4n4/3 + n < 5n4/3 . 728

Proposition 4.9. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair 729

S = (V, E). Consider S = (V, E) is a probability Eulerian-Type-Cycle-Cut. Let X be a 730

nonnegative Neutrosophic Variable and t a positive real number. Then 731

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

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

Dividing the first and last members by t yields the asserted inequality. 732

Corollary 4.10. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair 733

S = (V, E). Consider S = (V, E) is a probability Eulerian-Type-Cycle-Cut. Let Xn be a 734

nonnegative integer-valued variable in a prob- ability Eulerian-Type-Cycle-Cut (Vn , En ), n ≥ 1. If 735

E(Xn ) → 0 as n → ∞, then P (Xn = 0) → 1 as n → ∞. 736

Proof. 737

Theorem 4.11. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair 738

S = (V, E). Consider S = (V, E) is a probability Eulerian-Type-Cycle-Cut. A special 739

SuperHyperGraph in Gn,p almost surely has stability number at most d2p−1 log ne. 740

Proof. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 741

Consider S = (V, E) is a probability Eulerian-Type-Cycle-Cut. A special SuperHyperGraph in 742

Gn,p is up. Let G ∈ Gn,p and let S be a given SuperHyperSet of k + 1 743

SuperHyperVertices of G, where k ∈ N. The probability that S is a stable 744

SuperHyperSet of G is (1 − p)(k+1)choose2 , this being the probability that none of the 745

(k + 1)choose2 pairs of SuperHyperVertices of S is a SuperHyperEdge of the 746

Neutrosophic SuperHyperGraph G. 747

Let AS denote the event that S is a stable SuperHyperSet of G, and let XS denote 748

the indicator Neutrosophic Variable for this Neutrosophic Event. By equation, we have 749

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 750

X
X= {XS : S ⊆ V, |S| = k + 1}

and so, by those, 751

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: 752

nk+1
(n choose k+1) ≤ and1 − p ≤ e−p .
(k + 1)!

This yields the following upper bound on E(X). 753

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 754

grows at least as fast as the logarithm of n, implies that E(X) → 0 as n → ∞. Because 755

X is integer-valued and nonnegative, we deduce from Corollary that P (X = 0) → 1 as 756

n → ∞. Consequently, a Neutrosophic SuperHyperGraph in Gn,p almost surely has 757

stability number at most k. 758

Definition 4.12. (Neutrosophic Variance). 759

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 760

S = (V, E) is a probability Eulerian-Type-Cycle-Cut. A Neutrosophic k-Variable E has a 761

number is called Neutrosophic Variance if the following expression is called 762

Neutrosophic Variance criteria 763

2
V x(E) = Ex((X − Ex(X)) ).

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

Theorem 4.13. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair 764

S = (V, E). Consider S = (V, E) is a probability Eulerian-Type-Cycle-Cut. Let X be a 765

Neutrosophic Variable and let t be a positive real number. Then 766

V (X)
E(|X − Ex(X)| ≥ t) ≤ .
t2
Proof. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 767

Consider S = (V, E) is a probability Eulerian-Type-Cycle-Cut. Let X be a Neutrosophic 768

Variable and let t be a positive real number. Then 769

2
2 Ex((X − Ex(X)) ) V (X)
E(|X − Ex(X)| ≥ t) = E((X − Ex(X)) ≥ t2 ) ≤ = .
t2 t2
770

Corollary 4.14. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair 771

S = (V, E). Consider S = (V, E) is a probability Eulerian-Type-Cycle-Cut. Let Xn be a 772

Neutrosophic Variable in a probability Eulerian-Type-Cycle-Cut (Vn , En ), n ≥ 1. If Ex(Xn ) 6= 0 773

and V (Xn ) << E 2 (Xn ), then 774

E(Xn = 0) → 0 as n → ∞

Proof. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 775

Consider S = (V, E) is a probability Eulerian-Type-Cycle-Cut. Set X := Xn and t := |Ex(Xn )| 776

in Chebyshev’s Inequality, and observe that 777

E(Xn = 0) ≤ E(|Xn − Ex(Xn )| ≥ |Ex(Xn )|) because |Xn − Ex(Xn )| = |Ex(Xn )| 778

when Xn = 0. 779

Theorem 4.15. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair 780

S = (V, E). Consider S = (V, E) is a probability Eulerian-Type-Cycle-Cut. Let G ∈ Gn,1/2 . For 781

0 ≤ k ≤ n, set f (k) := (n choose k)2−(k choose 2) and let k ∗ be the least value of k for 782

which f (k) is less than one. Then almost surely α(G) takes one of the three values 783

k ∗ − 2, k ∗ − 1, k ∗ . 784

Proof. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 785

Consider S = (V, E) is a probability Eulerian-Type-Cycle-Cut. As in the proof of related 786

Theorem, the result is straightforward. 787

Corollary 4.16. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair 788

S = (V, E). Consider S = (V, E) is a probability Eulerian-Type-Cycle-Cut. Let G ∈ Gn,1/2 and let 789

f and k ∗ be as defined in previous Theorem. Then either: 790

(i). f (k ∗ ) << 1, in which case almost surely α(G) is equal to either k ∗ − 2 or k ∗ − 1, 791

or 792

(ii). f (k ∗ − 1) >> 1, in which case almost surely α(G) is equal to either k ∗ − 1 or k ∗ . 793

Proof. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 794

Consider S = (V, E) is a probability Eulerian-Type-Cycle-Cut. The latter is 795

straightforward. 796

Definition 4.17. (Neutrosophic Threshold). 797

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 798

S = (V, E) is a probability Eulerian-Type-Cycle-Cut. Let P be a monotone property of 799

SuperHyperGraphs (one which is preserved when SuperHyperEdges are added). Then a 800

Neutrosophic Threshold for P is a function f (n) such that: 801

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

(i). if p << f (n), then G ∈ Gn,p almost surely does not have P, 802

(ii). if p >> f (n), then G ∈ Gn,p almost surely has P. 803

Definition 4.18. (Neutrosophic Balanced). 804

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 805

S = (V, E) is a probability Eulerian-Type-Cycle-Cut. Let F be a fixed Neutrosophic 806

SuperHyperGraph. Then there is a threshold function for the property of containing a 807

copy of F as a Neutrosophic SubSuperHyperGraph is called Neutrosophic Balanced. 808

Theorem 4.19. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair 809

S = (V, E). Consider S = (V, E) is a probability Eulerian-Type-Cycle-Cut. Let F be a nonempty 810

balanced Neutrosophic SubSuperHyperGraph with k SuperHyperVertices and l 811

SuperHyperEdges. Then n−k/l is a threshold function for the property of containing F 812

as a Neutrosophic SubSuperHyperGraph. 813

Proof. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 814

Consider S = (V, E) is a probability Eulerian-Type-Cycle-Cut. The latter is 815

straightforward. 816

Example 4.20. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair 817

S = (V, E) in the mentioned Neutrosophic Figures in every Neutrosophic items. 818

• On the Figure (1), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 819

SuperHyperEulerian-Type-Cycle-Cut, is up. The Neutrosophic Algorithm is 820

Neutrosophicly straightforward. E1 and E3 are some empty Neutrosophic 821

SuperHyperEdges but E2 is a loop Neutrosophic SuperHyperEdge and E4 is a 822

Neutrosophic SuperHyperEdge. Thus in the terms of Neutrosophic 823

SuperHyperNeighbor, there’s only one Neutrosophic SuperHyperEdge, namely, 824

E4 . The Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means that 825

there’s no Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. Thus 826

the Neutrosophic SuperHyperVertex, V3 , is excluded in every given Neutrosophic 827

SuperHyperEulerian-Type-Cycle-Cut. 828

C(N SHG)Neutrosophic Eulerian-Type-Cycle-Cut


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

829

• On the Figure (2), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 830

SuperHyperEulerian-Type-Cycle-Cut, is up. The Neutrosophic Algorithm is 831

Neutrosophicly straightforward. E1 , E2 and E3 are some empty Neutrosophic 832

SuperHyperEdges but E4 is a Neutrosophic SuperHyperEdge. Thus in the terms 833

of Neutrosophic SuperHyperNeighbor, there’s only one Neutrosophic 834

SuperHyperEdge, namely, E4 . The Neutrosophic SuperHyperVertex, V3 is 835

Neutrosophic isolated means that there’s no Neutrosophic SuperHyperEdge has it 836

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

Figure 1. The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions


of Neutrosophic SuperHyperEulerian-Type-Cycle-Cut in the Neutrosophic Example (16.3)

as a Neutrosophic endpoint. Thus the Neutrosophic SuperHyperVertex, V3 , is 837

excluded in every given Neutrosophic SuperHyperEulerian-Type-Cycle-Cut. 838

C(N SHG)Neutrosophic Eulerian-Type-Cycle-Cut


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

839

• On the Figure (3), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 840

SuperHyperEulerian-Type-Cycle-Cut, is up. The Neutrosophic Algorithm is 841

Neutrosophicly straightforward. 842

C(N SHG)Neutrosophic Eulerian-Type-Cycle-Cut


= {E4 }.
C(N SHG)Neutrosophic Eulerian-Type-Cycle-Cut SuperHyperPolynomial
= z3.
C(N SHG)Neutrosophic V-Eulerian-Type-Cycle-Cut
= {V1 , V2 , V3 }.
C(N SHG)Neutrosophic V-Eulerian-Type-Cycle-Cut SuperHyperPolynomial
= z8 + z4 + z3.

843

• On the Figure (4), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 844

SuperHyperEulerian-Type-Cycle-Cut, is up. The Neutrosophic Algorithm is 845

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

Figure 2. The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions


of Neutrosophic SuperHyperEulerian-Type-Cycle-Cut in the Neutrosophic Example (16.3)

Figure 3. The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions


of Neutrosophic SuperHyperEulerian-Type-Cycle-Cut in the Neutrosophic Example (16.3)

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

Figure 4. The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions


of Neutrosophic SuperHyperEulerian-Type-Cycle-Cut in the Neutrosophic Example (16.3)

Neutrosophicly straightforward. 846

C(N SHG)Neutrosophic Eulerian-Type-Cycle-Cut


= {E4 , E1 , E5 , E4 }.
C(N SHG)Neutrosophic Eulerian-Type-Cycle-Cut SuperHyperPolynomial
= 3z 5 + z 3 .
C(N SHG)Neutrosophic V-Eulerian-Type-Cycle-Cut
= {V1 , V2 , {N }, {F }, V3 , {H}, V4 , V1 }.
C(N SHG)Neutrosophic V-Eulerian-Type-Cycle-Cut SuperHyperPolynomial
= 2z 4 + 2z 3 + 3z 2 + 5z.

847

• On the Figure (5), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 848

SuperHyperEulerian-Type-Cycle-Cut, is up. The Neutrosophic Algorithm is 849

Neutrosophicly straightforward. 850

C(N SHG)Neutrosophic Eulerian-Type-Cycle-Cut


= {E1 }.
C(N SHG)Neutrosophic Eulerian-Type-Cycle-Cut SuperHyperPolynomial
= z5.
C(N SHG)Neutrosophic V-Eulerian-Type-Cycle-Cut
= {Vi=15 }.
C(N SHG)Neutrosophic V-Eulerian-Type-Cycle-Cut SuperHyperPolynomial
= z 7 + 2z 4 + z 3 + z 2 .

851

• On the Figure (6), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 852

SuperHyperEulerian-Type-Cycle-Cut, is up. The Neutrosophic Algorithm is 853

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

Figure 5. The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions


of Neutrosophic SuperHyperEulerian-Type-Cycle-Cut in the Neutrosophic Example (16.3)

Neutrosophicly straightforward. 854

C(N SHG)Neutrosophic Eulerian-Type-Cycle-Cut


= {Ei=110 ,Ei=2332 ,E
12 ,E22 }.

C(N SHG)Neutrosophic Eulerian-Type-Cycle-Cut SuperHyperPolynomial


= 22z 2 .
C(N SHG)Neutrosophic V-Eulerian-Type-Cycle-Cut
= {Vi ∈ VN SHG }.
C(N SHG)Neutrosophic V-Eulerian-Type-Cycle-Cut SuperHyperPolynomial
X
= z |Vi ∈VN SHG | .

855

• On the Figure (7), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 856

SuperHyperEulerian-Type-Cycle-Cut, is up. The Neutrosophic Algorithm is 857

Neutrosophicly straightforward. 858

C(N SHG)Neutrosophic Eulerian-Type-Cycle-Cut


= {Ei=110 ,E17 ,E14 ,E13 ,E15 }.
C(N SHG)Neutrosophic Eulerian-Type-Cycle-Cut SuperHyperPolynomial
= z 5 + z 4 + 12z 2 .
C(N SHG)Neutrosophic V-Eulerian-Type-Cycle-Cut
= {Vi ∈ VN SHG }.
C(N SHG)Neutrosophic V-Eulerian-Type-Cycle-Cut SuperHyperPolynomial
X
= z |Vi ∈VN SHG | .

859

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

Figure 6. The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions


of Neutrosophic SuperHyperEulerian-Type-Cycle-Cut in the Neutrosophic Example (16.3)

Figure 7. The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions


of Neutrosophic SuperHyperEulerian-Type-Cycle-Cut in the Neutrosophic Example (16.3)

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

Figure 8. The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions


of Neutrosophic SuperHyperEulerian-Type-Cycle-Cut in the Neutrosophic Example (16.3)

• On the Figure (8), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 860

SuperHyperEulerian-Type-Cycle-Cut, is up. The Neutrosophic Algorithm is 861

Neutrosophicly straightforward. 862

C(N SHG)Neutrosophic Eulerian-Type-Cycle-Cut


= {E3 }.
C(N SHG)Neutrosophic Eulerian-Type-Cycle-Cut SuperHyperPolynomial
= z5.
C(N SHG)Neutrosophic V-Eulerian-Type-Cycle-Cut
= {}.
C(N SHG)Neutrosophic V-Eulerian-Type-Cycle-Cut SuperHyperPolynomial
= 2z 6 + 2z 5 + z 4 .
863

• On the Figure (9), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 864

SuperHyperEulerian-Type-Cycle-Cut, is up. The Neutrosophic Algorithm is 865

Neutrosophicly straightforward. 866

C(N SHG)Neutrosophic Eulerian-Type-Cycle-Cut


= {Ei=110 ,E23 ,E12 ,E22 }.
C(N SHG)Neutrosophic Eulerian-Type-Cycle-Cut SuperHyperPolynomial
= z 11 + 12z 2 .
C(N SHG)Neutrosophic V-Eulerian-Type-Cycle-Cut
= {Vi ∈ VN SHG }.
C(N SHG)Neutrosophic V-Eulerian-Type-Cycle-Cut SuperHyperPolynomial
X
= z |Vi ∈VN SHG | .
867

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

Figure 9. The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions


of Neutrosophic SuperHyperEulerian-Type-Cycle-Cut in the Neutrosophic Example (16.3)

• On the Figure (10), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 868

SuperHyperEulerian-Type-Cycle-Cut, is up. The Neutrosophic Algorithm is 869

Neutrosophicly straightforward. 870

C(N SHG)Neutrosophic Eulerian-Type-Cycle-Cut


= {E4 , E7 , E6 }.
C(N SHG)Neutrosophic Eulerian-Type-Cycle-Cut SuperHyperPolynomial
= 3z 2 .
C(N SHG)Neutrosophic V-Eulerian-Type-Cycle-Cut
= {V12 , V13 , V14 }.
C(N SHG)Neutrosophic V-Eulerian-Type-Cycle-Cut SuperHyperPolynomial
= 2z 5 + z 3 .

871

• On the Figure (11), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 872

SuperHyperEulerian-Type-Cycle-Cut, is up. The Neutrosophic Algorithm is 873

Neutrosophicly straightforward. 874

C(N SHG)Neutrosophic Eulerian-Type-Cycle-Cut


= {E1 , E6 , E5 , E4 , E7 }.
C(N SHG)Neutrosophic Eulerian-Type-Cycle-Cut SuperHyperPolynomial
= z 3 + 4z 2 .
C(N SHG)Neutrosophic V-Eulerian-Type-Cycle-Cut
= {Vi ∈ VN SHG }.
C(N SHG)Neutrosophic V-Eulerian-Type-Cycle-Cut SuperHyperPolynomial
X
= z |Vi ∈VN SHG | .

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

Figure 10. The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic


Notions of Neutrosophic SuperHyperEulerian-Type-Cycle-Cut in the Neutrosophic Example
(16.3)

Figure 11. The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic


Notions of Neutrosophic SuperHyperEulerian-Type-Cycle-Cut in the Neutrosophic Example
(16.3)

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

Figure 12. The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic


Notions of Neutrosophic SuperHyperEulerian-Type-Cycle-Cut in the Neutrosophic Example
(16.3)

875

• On the Figure (12), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 876

SuperHyperEulerian-Type-Cycle-Cut, is up. The Neutrosophic Algorithm is 877

Neutrosophicly straightforward. 878

C(N SHG)Neutrosophic Eulerian-Type-Cycle-Cut


= {E1 }.
C(N SHG)Neutrosophic Eulerian-Type-Cycle-Cut SuperHyperPolynomial
= z5.
C(N SHG)Neutrosophic V-Eulerian-Type-Cycle-Cut
= {V1 , V2 , V3 , V7 , V8 }.
C(N SHG)Neutrosophic V-Eulerian-Type-Cycle-Cut SuperHyperPolynomial
= z 8 + z 7 + 3z 5 .

879

• On the Figure (13), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 880

SuperHyperEulerian-Type-Cycle-Cut, is up. The Neutrosophic Algorithm is 881

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

Figure 13. The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic


Notions of Neutrosophic SuperHyperEulerian-Type-Cycle-Cut in the Neutrosophic Example
(16.3)

Neutrosophicly straightforward. 882

C(N SHG)Neutrosophic Eulerian-Type-Cycle-Cut


= {E1 , E10 , E8 , E4 , E2 , E6 }.
C(N SHG)Neutrosophic Eulerian-Type-Cycle-Cut SuperHyperPolynomial
= 6z 2 .
C(N SHG)Neutrosophic V-Eulerian-Type-Cycle-Cut
= {Vi ∈ VN SHG }.
C(N SHG)Neutrosophic V-Eulerian-Type-Cycle-Cut SuperHyperPolynomial
= 3z 5 + z 4 + 2z 3 .

883

• On the Figure (14), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 884

SuperHyperEulerian-Type-Cycle-Cut, is up. The Neutrosophic Algorithm is 885

Neutrosophicly straightforward. 886

C(N SHG)Neutrosophic Eulerian-Type-Cycle-Cut


= {E1 }.
C(N SHG)Neutrosophic Eulerian-Type-Cycle-Cut SuperHyperPolynomial
= z2.
C(N SHG)Neutrosophic V-Eulerian-Type-Cycle-Cut
= {V1 , V3 }.
C(N SHG)Neutrosophic V-Eulerian-Type-Cycle-Cut SuperHyperPolynomial
= 2z 5 .

887

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

Figure 14. The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic


Notions of Neutrosophic SuperHyperEulerian-Type-Cycle-Cut in the Neutrosophic Example
(16.3)

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

Figure 15. The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic


Notions of Neutrosophic SuperHyperEulerian-Type-Cycle-Cut in the Neutrosophic Example
(16.3)

• On the Figure (15), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 888

SuperHyperEulerian-Type-Cycle-Cut, is up. The Neutrosophic Algorithm is 889

Neutrosophicly straightforward. 890

C(N SHG)Neutrosophic Eulerian-Type-Cycle-Cut


= {E1 }.
C(N SHG)Neutrosophic Eulerian-Type-Cycle-Cut SuperHyperPolynomial
= z2.
C(N SHG)Neutrosophic V-Eulerian-Type-Cycle-Cut
= {V1 , V5 }.
C(N SHG)Neutrosophic V-Eulerian-Type-Cycle-Cut SuperHyperPolynomial
= 2z 5 .

891

• On the Figure (16), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 892

SuperHyperEulerian-Type-Cycle-Cut, is up. The Neutrosophic Algorithm is 893

Neutrosophicly straightforward. 894

C(N SHG)Neutrosophic Eulerian-Type-Cycle-Cut


= {E4 }.
C(N SHG)Neutrosophic Eulerian-Type-Cycle-Cut SuperHyperPolynomial
= z 10 .
C(N SHG)Neutrosophic V-Eulerian-Type-Cycle-Cut
= {Vi=817 }.
C(N SHG)Neutrosophic V-Eulerian-Type-Cycle-Cut SuperHyperPolynomial
X
= z |Vi ∈VN SHG | .

895

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

Figure 16. The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic


Notions of Neutrosophic SuperHyperEulerian-Type-Cycle-Cut in the Neutrosophic Example
(16.3)

• On the Figure (17), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 896

SuperHyperEulerian-Type-Cycle-Cut, is up. The Neutrosophic Algorithm is 897

Neutrosophicly straightforward. 898

C(N SHG)Neutrosophic Eulerian-Type-Cycle-Cut


= {E4 }.
C(N SHG)Neutrosophic Eulerian-Type-Cycle-Cut SuperHyperPolynomial
= z 10 .
C(N SHG)Neutrosophic V-Eulerian-Type-Cycle-Cut
= {Vi=817 }.
C(N SHG)Neutrosophic V-Eulerian-Type-Cycle-Cut SuperHyperPolynomial
X
= z |Vi ∈VN SHG | .

899

• On the Figure (18), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 900

SuperHyperEulerian-Type-Cycle-Cut, is up. The Neutrosophic Algorithm is 901

Neutrosophicly straightforward. 902

C(N SHG)Neutrosophic Eulerian-Type-Cycle-Cut


= {E4 }.
C(N SHG)Neutrosophic Eulerian-Type-Cycle-Cut SuperHyperPolynomial
= z 10 .
C(N SHG)Neutrosophic V-Eulerian-Type-Cycle-Cut
= {Vi=817 }.
C(N SHG)Neutrosophic V-Eulerian-Type-Cycle-Cut SuperHyperPolynomial
X
= z |Vi ∈VN SHG | .

903

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

Figure 17. The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic


Notions of Neutrosophic SuperHyperEulerian-Type-Cycle-Cut in the Neutrosophic Example
(16.3)

Figure 18. The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic


Notions of Neutrosophic SuperHyperEulerian-Type-Cycle-Cut in the Neutrosophic Example
(16.3)

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

Figure 19. The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic


Notions of Neutrosophic SuperHyperEulerian-Type-Cycle-Cut in the Neutrosophic Example
(16.3)

• On the Figure (19), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 904

SuperHyperEulerian-Type-Cycle-Cut, is up. The Neutrosophic Algorithm is 905

Neutrosophicly straightforward. 906

C(N SHG)Neutrosophic Eulerian-Type-Cycle-Cut


= {Ei=112 }.
C(N SHG)Neutrosophic Eulerian-Type-Cycle-Cut SuperHyperPolynomial
X
= z |Ei ∈EN SHG | .
C(N SHG)Neutrosophic V-Eulerian-Type-Cycle-Cut
= {|Vi ∈ VN SHG }.
C(N SHG)Neutrosophic V-Eulerian-Type-Cycle-Cut SuperHyperPolynomial
X
= z |Vi ∈VN SHG | .

907

• On the Figure (20), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 908

SuperHyperEulerian-Type-Cycle-Cut, is up. The Neutrosophic Algorithm is 909

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

Figure 20. The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic


Notions of Neutrosophic SuperHyperEulerian-Type-Cycle-Cut in the Neutrosophic Example
(16.3)

Neutrosophicly straightforward. 910

C(N SHG)Neutrosophic Eulerian-Type-Cycle-Cut


= {E6 }.
C(N SHG)Neutrosophic Eulerian-Type-Cycle-Cut SuperHyperPolynomial
= z |E6 | .
C(N SHG)Neutrosophic V-Eulerian-Type-Cycle-Cut
= {VE6 }.
C(N SHG)Neutrosophic V-Eulerian-Type-Cycle-Cut SuperHyperPolynomial
X
= z |VE6 |.

911

(4.4)

912

• On the Figure (21), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 913

SuperHyperEulerian-Type-Cycle-Cut, is up. The Neutrosophic Algorithm is 914

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

Figure 21. The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic


Notions of Neutrosophic SuperHyperEulerian-Type-Cycle-Cut in the Neutrosophic Example
(16.3)

Neutrosophicly straightforward. 915

C(N SHG)Neutrosophic Eulerian-Type-Cycle-Cut


= {E2 }.
C(N SHG)Neutrosophic Eulerian-Type-Cycle-Cut SuperHyperPolynomial
= z |E2 | .
C(N SHG)Neutrosophic V-Eulerian-Type-Cycle-Cut
= {VE2 }.
C(N SHG)Neutrosophic V-Eulerian-Type-Cycle-Cut SuperHyperPolynomial
X
= z |VE2 |.

916

(4.6)

917

• On the Figure (22), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 918

SuperHyperEulerian-Type-Cycle-Cut, is up. The Neutrosophic Algorithm is 919

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

Figure 22. The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic


Notions of Neutrosophic SuperHyperEulerian-Type-Cycle-Cut in the Neutrosophic Example
(16.3)

Neutrosophicly straightforward. 920

C(N SHG)Neutrosophic Eulerian-Type-Cycle-Cut


= {E4 }.
C(N SHG)Neutrosophic Eulerian-Type-Cycle-Cut SuperHyperPolynomial
= z |E4 | .
C(N SHG)Neutrosophic V-Eulerian-Type-Cycle-Cut
= {VE4 }.
C(N SHG)Neutrosophic V-Eulerian-Type-Cycle-Cut SuperHyperPolynomial
X
= z |VE4 |.

921

(4.8)

922

Proposition 4.21. Assume a connected Neutrosophic SuperHyperGraph 923

ESHG : (V, E). The all interior Neutrosophic SuperHyperVertices belong to any 924

Neutrosophic quasi-R-Eulerian-Type-Cycle-Cut if for any of them, and any of other corresponded 925

Neutrosophic SuperHyperVertex, some interior Neutrosophic SuperHyperVertices are 926

mutually Neutrosophic SuperHyperNeighbors with no Neutrosophic exception at all 927

minus all Neutrosophic SuperHypeNeighbors to any amount of them. 928

Proposition 4.22. Assume a connected non-obvious Neutrosophic SuperHyperGraph 929

ESHG : (V, E). There’s only one Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) has 930

only the maximum possibilities of the distinct interior Neutrosophic SuperHyperVertices 931

inside of any given Neutrosophic quasi-R-Eulerian-Type-Cycle-Cut minus all Neutrosophic 932

SuperHypeNeighbor to some of them but not all of them. In other words, there’s only an 933

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

unique Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) has only two distinct 934

Neutrosophic SuperHyperVertices in an Neutrosophic quasi-R-Eulerian-Type-Cycle-Cut, minus all 935

Neutrosophic SuperHypeNeighbor to some of them but not all of them. 936

Proposition 4.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-Cycle-Cut is at least

V \ (V \ {aE , bE , cE , . . . , zE }).

It’s straightforward that the Neutrosophic cardinality of the Neutrosophic 937

R-Eulerian-Type-Cycle-Cut is at least the maximum Neutrosophic number of Neutrosophic 938

SuperHyperVertices of the Neutrosophic SuperHyperEdges with the maximum number of 939

the Neutrosophic SuperHyperEdges. In other words, the maximum number of the 940

Neutrosophic SuperHyperEdges contains the maximum Neutrosophic number of 941

Neutrosophic SuperHyperVertices are renamed to Neutrosophic Eulerian-Type-Cycle-Cut in some 942

cases but the maximum number of the Neutrosophic SuperHyperEdge with the maximum 943

Neutrosophic number of Neutrosophic SuperHyperVertices, has the Neutrosophic 944

SuperHyperVertices are contained in a Neutrosophic R-Eulerian-Type-Cycle-Cut. 945

Proposition 4.24. Assume a simple Neutrosophic SuperHyperGraph ESHG : (V, E).


Then the Neutrosophic number of type-result-R-Eulerian-Type-Cycle-Cut 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-Cycle-Cut with the least Neutrosophic 946

cardinality, the lower sharp Neutrosophic bound for cardinality. 947

Proposition 4.25. Assume a connected loopless Neutrosophic SuperHyperGraph 948

ESHG : (V, E). Then in the worst case, literally, 949

C(N SHG)N eutrosophicQuasi−Eulerian−T ype−Cycle−Cut


= {V1 , E1 , V2 , E2 , V3 , E3 , V4 , E4 , V1 }.
C(N SHG)N eutrosophicQuasi−Eulerian−T ype−Cycle−CutSuperHyperP olynomial = z 4 .
C(N SHG)N eutrosophicQuasi−Eulerian−T ype−Cycle−Cut = {V1 , V2 , V3 , V4 , V1 }.
C(N SHG)N eutrosophicR−Quasi−Eulerian−T ype−Cycle−CutSuperHyperP olynomial = z 5 .

Is a Neutrosophic type-result-Eulerian-Type-Cycle-Cut. In other words, the least cardinality, the 950

lower sharp bound for the cardinality, of a Neutrosophic type-result-Eulerian-Type-Cycle-Cut is 951

the cardinality of 952

C(N SHG)N eutrosophicQuasi−Eulerian−T ype−Cycle−Cut


= {V1 , E1 , V2 , E2 , V3 , E3 , V4 , E4 , V1 }.
C(N SHG)N eutrosophicQuasi−Eulerian−T ype−Cycle−CutSuperHyperP olynomial = z 4 .
C(N SHG)N eutrosophicQuasi−Eulerian−T ype−Cycle−Cut = {V1 , V2 , V3 , V4 , V1 }.
C(N SHG)N eutrosophicR−Quasi−Eulerian−T ype−Cycle−CutSuperHyperP 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-Cycle-Cut since neither amount of Neutrosophic SuperHyperEdges nor

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

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 Neutrosophic type-SuperHyperSets
couldn’t give us the Neutrosophic lower bound in the term of Neutrosophic sharpness.
In other words, 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) }}

of the Neutrosophic SuperHyperVertices implies at least on-quasi-triangle style is up but


sometimes 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) }}

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,

V \ V \ {aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .

Is a quasi-R-Eulerian-Type-Cycle-Cut. In other words, the least cardinality, the lower sharp


bound for the cardinality, of a quasi-R-Eulerian-Type-Cycle-Cut is the cardinality of

V \ V \ {aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .

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-Cycle-Cut.
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

V \ V \ {aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .

Let V \ V \ {z} in mind. There’s no necessity on the SuperHyperEdge since we need at 953

least two SuperHyperVertices to form a SuperHyperEdge. It doesn’t withdraw the 954

principles of the main definition since there’s no condition to be satisfied but the 955

condition is on the existence of the SuperHyperEdge instead of acting on the 956

SuperHyperVertices. In other words, if there’s a SuperHyperEdge, then the 957

Neutrosophic SuperHyperSet has the necessary condition for the intended definition to 958

be applied. Thus the V \ V \ {z} is withdrawn not by the conditions of the main 959

definition but by the necessity of the pre-condition on the usage of the main definition. 960

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

The Neutrosophic structure of the Neutrosophic R-Eulerian-Type-Cycle-Cut 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-Cycle-Cut. 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-Cycle-Cut has the Neutrosophic cardinality of a Neutrosophic
SuperHyperEdge. Thus, a Neutrosophic R-Eulerian-Type-Cycle-Cut 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-Cycle-Cut 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-Cycle-Cut” 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
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) }}

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-Cycle-Cut 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
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) }}

Is the maximum in comparison to the Neutrosophic SuperHyperSet


V \ V \ {aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

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 SuperHyperGraph 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 SuperHyperVertices. 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

V \ V \ {aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .

Has the maximum Neutrosophic cardinality such that

V \ V \ {aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .

Contains some Neutrosophic SuperHyperVertices such that there’s


distinct-covers-order-amount Neutrosophic SuperHyperEdges for amount of
Neutrosophic SuperHyperVertices taken from the Neutrosophic SuperHyperSet

V \ V \ {aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .

It means that the Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices

V \ V \ {aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .

Is a Neutrosophic R-Eulerian-Type-Cycle-Cut for the Neutrosophic SuperHyperGraph as used 961

Neutrosophic background in the Neutrosophic terms of worst Neutrosophic case and the 962

common theme of the lower Neutrosophic bound occurred in the specific Neutrosophic 963

SuperHyperClasses of the Neutrosophic SuperHyperGraphs which are Neutrosophic 964

free-quasi-triangle. 965

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-Cycle-Cut. Those Neutrosophic
SuperHyperVertices are potentially included in a Neutrosophic
style-R-Eulerian-Type-Cycle-Cut. 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

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

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-Cycle-Cut is

{aE , bE , cE , . . . , zE } .

This definition coincides with the definition of the Neutrosophic R-Eulerian-Type-Cycle-Cut


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

V \ V \ {aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .

is formalized with mathematical literatures on the Neutrosophic R-Eulerian-Type-Cycle-Cut.


E
Let Zi ∼ Zj , be defined as Zi and Zj are the Neutrosophic SuperHyperVertices belong
to the Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) . Thus,
E
E = {Z1 , Z2 , . . . , Zz | Zi ∼ Zj , i 6= j, i, j = 1, 2, . . . , z}.

Or
{aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .
But with the slightly differences, 966

Neutrosophic R-Eulerian-Type-Cycle-Cut =
E
{Z1 , Z2 , . . . , Zz | ∀i 6= j, i, j = 1, 2, . . . , z, ∃Ex , Zi ∼x Zj , }.
967

Neutrosophic R-Eulerian-Type-Cycle-Cut =
V \ V \ {aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .

Thus E ∈ EESHG:(V,E) is a Neutrosophic quasi-R-Eulerian-Type-Cycle-Cut 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-Cycle-Cut,
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-Cycle-Cut is at least

V \ (V \ {aE , bE , cE , . . . , zE }).

It’s straightforward that the Neutrosophic cardinality of the Neutrosophic 968

R-Eulerian-Type-Cycle-Cut is at least the maximum Neutrosophic number of Neutrosophic 969

SuperHyperVertices of the Neutrosophic SuperHyperEdges with the maximum number 970

of the Neutrosophic SuperHyperEdges. In other words, the maximum number of the 971

Neutrosophic SuperHyperEdges contains the maximum Neutrosophic number of 972

Neutrosophic SuperHyperVertices are renamed to Neutrosophic Eulerian-Type-Cycle-Cut in 973

some cases but the maximum number of the Neutrosophic SuperHyperEdge with the 974

maximum Neutrosophic number of Neutrosophic SuperHyperVertices, has the 975

Neutrosophic SuperHyperVertices are contained in a Neutrosophic R-Eulerian-Type-Cycle-Cut. 976

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

The obvious SuperHyperGraph has no Neutrosophic SuperHyperEdges. But the 977

non-obvious Neutrosophic SuperHyperModel is up. The quasi-SuperHyperModel 978

addresses some issues about the Neutrosophic optimal SuperHyperObject. It specially 979

delivers some remarks on the Neutrosophic SuperHyperSet of the Neutrosophic 980

SuperHyperVertices such that there’s distinct amount of Neutrosophic 981

SuperHyperEdges for distinct amount of Neutrosophic SuperHyperVertices up to all 982

taken from that Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices 983

but this Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices is either 984

has the maximum Neutrosophic SuperHyperCardinality or it doesn’t have maximum 985

Neutrosophic SuperHyperCardinality. In a non-obvious SuperHyperModel, there’s at 986

least one Neutrosophic SuperHyperEdge containing at least all Neutrosophic 987

SuperHyperVertices. Thus it forms a Neutrosophic quasi-R-Eulerian-Type-Cycle-Cut where the 988

Neutrosophic completion of the Neutrosophic incidence is up in that. Thus it’s, literarily, 989

a Neutrosophic embedded R-Eulerian-Type-Cycle-Cut. The SuperHyperNotions of embedded 990

SuperHyperSet and quasi-SuperHyperSet coincide. In the original setting, these types of 991

SuperHyperSets only don’t satisfy on the maximum SuperHyperCardinality. Thus the 992

embedded setting is elected such that those SuperHyperSets have the maximum 993

Neutrosophic SuperHyperCardinality and they’re Neutrosophic SuperHyperOptimal. 994

The less than two distinct types of Neutrosophic SuperHyperVertices are included in the 995

minimum Neutrosophic style of the embedded Neutrosophic R-Eulerian-Type-Cycle-Cut. The 996

interior types of the Neutrosophic SuperHyperVertices are deciders. Since the 997

Neutrosophic number of SuperHyperNeighbors are only affected by the interior 998

Neutrosophic SuperHyperVertices. The common connections, more precise and more 999

formal, the perfect unique connections inside the Neutrosophic SuperHyperSet for any 1000

distinct types of Neutrosophic SuperHyperVertices pose the Neutrosophic 1001

R-Eulerian-Type-Cycle-Cut. Thus Neutrosophic exterior SuperHyperVertices could be used 1002

only in one Neutrosophic SuperHyperEdge and in Neutrosophic SuperHyperRelation 1003

with the interior Neutrosophic SuperHyperVertices in that Neutrosophic 1004

SuperHyperEdge. In the embedded Neutrosophic Eulerian-Type-Cycle-Cut, there’s the usage of 1005

exterior Neutrosophic SuperHyperVertices since they’ve more connections inside more 1006

than outside. Thus the title “exterior” is more relevant than the title “interior”. One 1007

Neutrosophic SuperHyperVertex has no connection, inside. Thus, the Neutrosophic 1008

SuperHyperSet of the Neutrosophic SuperHyperVertices with one SuperHyperElement 1009

has been ignored in the exploring to lead on the optimal case implying the Neutrosophic 1010

R-Eulerian-Type-Cycle-Cut. The Neutrosophic R-Eulerian-Type-Cycle-Cut with the exclusion of the 1011

exclusion of all Neutrosophic SuperHyperVertices in one Neutrosophic SuperHyperEdge 1012

and with other terms, the Neutrosophic R-Eulerian-Type-Cycle-Cut with the inclusion of all 1013

Neutrosophic SuperHyperVertices in one Neutrosophic SuperHyperEdge, is a 1014

Neutrosophic quasi-R-Eulerian-Type-Cycle-Cut. To sum them up, in a connected non-obvious 1015

Neutrosophic SuperHyperGraph ESHG : (V, E). There’s only one Neutrosophic 1016

SuperHyperEdge E ∈ EESHG:(V,E) has only the maximum possibilities of the distinct 1017

interior Neutrosophic SuperHyperVertices inside of any given Neutrosophic 1018

quasi-R-Eulerian-Type-Cycle-Cut minus all Neutrosophic SuperHypeNeighbor to some of them 1019

but not all of them. In other words, there’s only an unique Neutrosophic 1020

SuperHyperEdge E ∈ EESHG:(V,E) has only two distinct Neutrosophic 1021

SuperHyperVertices in an Neutrosophic quasi-R-Eulerian-Type-Cycle-Cut, minus all 1022

Neutrosophic SuperHypeNeighbor to some of them but not all of them. 1023

The main definition of the Neutrosophic R-Eulerian-Type-Cycle-Cut has two titles. a 1024

Neutrosophic quasi-R-Eulerian-Type-Cycle-Cut and its corresponded quasi-maximum 1025

Neutrosophic R-SuperHyperCardinality are two titles in the terms of quasi-R-styles. For 1026

any Neutrosophic number, there’s a Neutrosophic quasi-R-Eulerian-Type-Cycle-Cut with that 1027

quasi-maximum Neutrosophic SuperHyperCardinality in the terms of the embedded 1028

Neutrosophic SuperHyperGraph. If there’s an embedded Neutrosophic 1029

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

SuperHyperGraph, then the Neutrosophic quasi-SuperHyperNotions lead us to take the 1030

collection of all the Neutrosophic quasi-R-Eulerian-Type-Cycle-Cuts for all Neutrosophic 1031

numbers less than its Neutrosophic corresponded maximum number. The essence of the 1032

Neutrosophic Eulerian-Type-Cycle-Cut ends up but this essence starts up in the terms of the 1033

Neutrosophic quasi-R-Eulerian-Type-Cycle-Cut, again and more in the operations of collecting 1034

all the Neutrosophic quasi-R-Eulerian-Type-Cycle-Cuts acted on the all possible used 1035

formations of the Neutrosophic SuperHyperGraph to achieve one Neutrosophic number. 1036

This Neutrosophic number is 1037

considered as the equivalence class for all corresponded quasi-R-Eulerian-Type-Cycle-Cuts. 1038

Let zNeutrosophic Number , SNeutrosophic SuperHyperSet and GNeutrosophic Eulerian-Type-Cycle-Cut be 1039

a Neutrosophic number, a Neutrosophic SuperHyperSet and a Neutrosophic 1040

Eulerian-Type-Cycle-Cut. Then 1041

[zNeutrosophic Number ]Neutrosophic Class = {SNeutrosophic SuperHyperSet |


SNeutrosophic SuperHyperSet = GNeutrosophic Eulerian-Type-Cycle-Cut ,
|SNeutrosophic SuperHyperSet |Neutrosophic Cardinality
= zNeutrosophic Number }.

As its consequences, the formal definition of the Neutrosophic Eulerian-Type-Cycle-Cut is 1042

re-formalized and redefined as follows. 1043

GNeutrosophic Eulerian-Type-Cycle-Cut ∈ ∪zNeutrosophic Number


[zNeutrosophic Number ]Neutrosophic Class =
∪zNeutrosophic Number
{SNeutrosophic SuperHyperSet |
SNeutrosophic SuperHyperSet = GNeutrosophic Eulerian-Type-Cycle-Cut ,
|SNeutrosophic SuperHyperSet |Neutrosophic Cardinality
= zNeutrosophic Number }.

To get more precise perceptions, the follow-up expressions propose another formal 1044

technical definition for the Neutrosophic Eulerian-Type-Cycle-Cut. 1045

GNeutrosophic Eulerian-Type-Cycle-Cut =
{S ∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class =
∪zNeutrosophic Number {SNeutrosophic SuperHyperSet |
SNeutrosophic SuperHyperSet = GNeutrosophic Eulerian-Type-Cycle-Cut ,
|SNeutrosophic SuperHyperSet |Neutrosophic Cardinality
= zNeutrosophic Number |
|SNeutrosophic SuperHyperSet |Neutrosophic Cardinality
= max zNeutrosophic Number }.
[zNeutrosophic Number ]Neutrosophic Class

In more concise and more convenient ways, the modified definition for the Neutrosophic 1046

Eulerian-Type-Cycle-Cut poses the upcoming expressions. 1047

GNeutrosophic Eulerian-Type-Cycle-Cut =
{S ∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class |
|SNeutrosophic SuperHyperSet |Neutrosophic Cardinality
= max zNeutrosophic Number }.
[zNeutrosophic Number ]Neutrosophic Class

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

To translate the statement to this mathematical literature, the formulae will be revised. 1048

GNeutrosophic Eulerian-Type-Cycle-Cut =
{S ∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class |
|SNeutrosophic SuperHyperSet |Neutrosophic Cardinality
= max zNeutrosophic Number
[zNeutrosophic
Number ]Neutrosophic Class

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

And then, 1049

GNeutrosophic Eulerian-Type-Cycle-Cut =
{S ∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class |
|SNeutrosophic SuperHyperSet |Neutrosophic Cardinality

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

To get more visions in the closer look-up, there’s an overall overlook. 1050

GNeutrosophic Eulerian-Type-Cycle-Cut ∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class =


∪zNeutrosophic Number {SNeutrosophic SuperHyperSet |
SNeutrosophic SuperHyperSet = GNeutrosophic Eulerian-Type-Cycle-Cut ,
|SNeutrosophic SuperHyperSet |Neutrosophic Cardinality

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

GNeutrosophic Eulerian-Type-Cycle-Cut =
{S ∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class =
∪zNeutrosophic Number {SNeutrosophic SuperHyperSet |
SNeutrosophic SuperHyperSet = GNeutrosophic Eulerian-Type-Cycle-Cut ,
|SNeutrosophic SuperHyperSet |Neutrosophic Cardinality
= zNeutrosophic Number |
|SNeutrosophic SuperHyperSet |Neutrosophic Cardinality

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

GNeutrosophic Eulerian-Type-Cycle-Cut =
{S ∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class |
|SNeutrosophic SuperHyperSet |Neutrosophic Cardinality
= max zNeutrosophic Number
[zNeutrosophic Number ]Neutrosophic Class

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

GNeutrosophic Eulerian-Type-Cycle-Cut =
{S ∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class |
|SNeutrosophic SuperHyperSet |Neutrosophic Cardinality

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

Now, the extension of these types of approaches is up. Since the new term, 1054

“Neutrosophic SuperHyperNeighborhood”, could be redefined as the collection of the 1055

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

Neutrosophic SuperHyperVertices such that any amount of its Neutrosophic 1056

SuperHyperVertices are incident to a Neutrosophic SuperHyperEdge. It’s, literarily, 1057

another name for “Neutrosophic Quasi-Eulerian-Type-Cycle-Cut” but, precisely, it’s the 1058

generalization of “Neutrosophic Quasi-Eulerian-Type-Cycle-Cut” since “Neutrosophic 1059

Quasi-Eulerian-Type-Cycle-Cut” happens “Neutrosophic Eulerian-Type-Cycle-Cut” in a Neutrosophic 1060

SuperHyperGraph as initial framework and background but “Neutrosophic 1061

SuperHyperNeighborhood” may not happens “Neutrosophic Eulerian-Type-Cycle-Cut” in a 1062

Neutrosophic SuperHyperGraph as initial framework and preliminarily background 1063

since there are some ambiguities about the Neutrosophic SuperHyperCardinality arise 1064

from it. To get orderly keywords, the terms, “Neutrosophic SuperHyperNeighborhood”, 1065

“Neutrosophic Quasi-Eulerian-Type-Cycle-Cut”, and “Neutrosophic Eulerian-Type-Cycle-Cut” are up. 1066

Thus, let 1067

zNeutrosophic Number , NNeutrosophic SuperHyperNeighborhood and 1068

GNeutrosophic Eulerian-Type-Cycle-Cut be a Neutrosophic number, a Neutrosophic 1069

SuperHyperNeighborhood and a Neutrosophic Eulerian-Type-Cycle-Cut and the new terms are 1070

up. 1071

GNeutrosophic Eulerian-Type-Cycle-Cut ∈ ∪zNeutrosophic Number


[zNeutrosophic Number ]Neutrosophic Class =
∪zNeutrosophic Number {NNeutrosophic SuperHyperNeighborhood |
|NNeutrosophic SuperHyperNeighborhood |Neutrosophic Cardinality
= max zNeutrosophic Number }.
[zNeutrosophic Number ]Neutrosophic Class

1072

GNeutrosophic Eulerian-Type-Cycle-Cut =
{NNeutrosophic SuperHyperNeighborhood
∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class =
∪zNeutrosophic Number {NNeutrosophic SuperHyperNeighborhood |
|NNeutrosophic SuperHyperSet |Neutrosophic Cardinality
= zNeutrosophic Number |
|NNeutrosophic SuperHyperNeighborhood |Neutrosophic Cardinality
= max zNeutrosophic Number }.
[zNeutrosophic Number ]Neutrosophic Class

1073

GNeutrosophic Eulerian-Type-Cycle-Cut =
{NNeutrosophic SuperHyperNeighborhood
∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class |
|NNeutrosophic SuperHyperNeighborhood |Neutrosophic Cardinality
= max zNeutrosophic Number }.
[zNeutrosophic Number ]Neutrosophic Class

1074

GNeutrosophic Eulerian-Type-Cycle-Cut =
{NNeutrosophic SuperHyperNeighborhood
∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class |
|NNeutrosophic SuperHyperSet |Neutrosophic Cardinality
= max zNeutrosophic Number }.
[zNeutrosophic Number ]Neutrosophic Class

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

And with go back to initial structure, 1075

GNeutrosophic Eulerian-Type-Cycle-Cut ∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class =


∪zNeutrosophic Number {NNeutrosophic SuperHyperNeighborhood |
|NNeutrosophic SuperHyperNeighborhood |Neutrosophic Cardinality

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

GNeutrosophic Eulerian-Type-Cycle-Cut =
{NNeutrosophic SuperHyperNeighborhood
∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class =
∪zNeutrosophic Number {NNeutrosophic SuperHyperNeighborhood |
|NNeutrosophic SuperHyperSet |Neutrosophic Cardinality
= zNeutrosophic Number |
|NNeutrosophic SuperHyperNeighborhood |Neutrosophic Cardinality

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

GNeutrosophic Eulerian-Type-Cycle-Cut =
{NNeutrosophic SuperHyperNeighborhood
∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class |
|NNeutrosophic SuperHyperNeighborhood |Neutrosophic Cardinality
= max zNeutrosophic Number
[zNeutrosophic Number ]Neutrosophic Class

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

GNeutrosophic Eulerian-Type-Cycle-Cut =
{NNeutrosophic SuperHyperNeighborhood
∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class |
|NNeutrosophic SuperHyperSet |Neutrosophic Cardinality

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

Thus, in a connected Neutrosophic SuperHyperGraph ESHG : (V, E). The all interior 1079

Neutrosophic SuperHyperVertices belong to any Neutrosophic 1080

quasi-R-Eulerian-Type-Cycle-Cut if for any of them, and any of other corresponded 1081

Neutrosophic SuperHyperVertex, some interior Neutrosophic SuperHyperVertices are 1082

mutually Neutrosophic SuperHyperNeighbors with no Neutrosophic exception at all 1083

minus all Neutrosophic SuperHypeNeighbors to any amount of them. 1084

To make sense with the precise words in the terms of “R-’, the follow-up illustrations 1085

are coming up. 1086

The following Neutrosophic SuperHyperSet of Neutrosophic SuperHyperVertices is


the simple Neutrosophic type-SuperHyperSet of the Neutrosophic R-Eulerian-Type-Cycle-Cut.

V \ V \ {aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .

The Neutrosophic SuperHyperSet of Neutrosophic SuperHyperVertices,

V \ V \ {aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

Is the simple Neutrosophic type-SuperHyperSet of the Neutrosophic


R-Eulerian-Type-Cycle-Cut. The Neutrosophic SuperHyperSet of the Neutrosophic
SuperHyperVertices,

V \ V \ {aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .

Is an Neutrosophic R-Eulerian-Type-Cycle-Cut C(ESHG) for an Neutrosophic 1087

SuperHyperGraph ESHG : (V, E) is a Neutrosophic type-SuperHyperSet with 1088

the maximum Neutrosophic cardinality of a Neutrosophic SuperHyperSet S 1089

of Neutrosophic SuperHyperVertices such that there’s no a Neutrosophic 1090

SuperHyperEdge amid some Neutrosophic SuperHyperVertices instead of all given by 1091

Neutrosophic Eulerian-Type-Cycle-Cut is related to the Neutrosophic SuperHyperSet of


the Neutrosophic SuperHyperVertices,

V \ V \ {aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .

There’s not only one Neutrosophic SuperHyperVertex inside the intended


Neutrosophic SuperHyperSet. Thus the non-obvious Neutrosophic Eulerian-Type-Cycle-Cut is
up. The obvious simple Neutrosophic type-SuperHyperSet called the Neutrosophic
Eulerian-Type-Cycle-Cut is a Neutrosophic SuperHyperSet includes only one Neutrosophic

SuperHyperVertex. But the Neutrosophic SuperHyperSet of Neutrosophic


SuperHyperVertices,

V \ V \ {aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .

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-Cycle-Cut is up. To sum them up, the Neutrosophic SuperHyperSet of
Neutrosophic SuperHyperVertices,

V \ V \ {aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .

Is the non-obvious simple Neutrosophic type-SuperHyperSet of the Neutrosophic


R-Eulerian-Type-Cycle-Cut. Since the Neutrosophic SuperHyperSet of the Neutrosophic
SuperHyperVertices,
(V \ V \ {x, z}) ∪ {xy}
or
(V \ V \ {x, z}) ∪ {zy}
is an Neutrosophic R-Eulerian-Type-Cycle-Cut C(ESHG) for an Neutrosophic 1092

SuperHyperGraph ESHG : (V, E) is the Neutrosophic SuperHyperSet S of 1093

Neutrosophic SuperHyperVertices such that there’s no a Neutrosophic SuperHyperEdge 1094

for some Neutrosophic SuperHyperVertices instead of all given by that Neutrosophic 1095

type-SuperHyperSet called the Neutrosophic Eulerian-Type-Cycle-Cut and it’s an 1096

Neutrosophic Eulerian-Type-Cycle-Cut. Since it’s 1097

the maximum Neutrosophic cardinality of a Neutrosophic SuperHyperSet S


of Neutrosophic 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-Cycle-Cut.
There isn’t only less than two Neutrosophic SuperHyperVertices inside the intended
Neutrosophic SuperHyperSet,

V \ V \ {aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

Thus the non-obvious Neutrosophic R-Eulerian-Type-Cycle-Cut,

V \ V \ {aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .

is up. The non-obvious simple Neutrosophic type-SuperHyperSet of the Neutrosophic


Eulerian-Type-Cycle-Cut, not:

V \ V \ {aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .

Is the Neutrosophic SuperHyperSet, not:

V \ V \ {aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .

does includes only less than two SuperHyperVertices in a connected Neutrosophic 1098

SuperHyperGraph ESHG : (V, E) but it’s impossible in the case, they’ve corresponded 1099

to an SuperHyperEdge. It’s interesting to mention that the only non-obvious simple 1100

Neutrosophic type-SuperHyperSet called the 1101

“Neutrosophic R-Eulerian-Type-Cycle-Cut” 1102

amid those obvious[non-obvious] simple Neutrosophic type-SuperHyperSets called the 1103

Neutrosophic R-Eulerian-Type-Cycle-Cut, 1104

is only and only

V \ V \ {aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .

In a connected Neutrosophic SuperHyperGraph ESHG : (V, E) with a illustrated


SuperHyperModeling. 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 embedded SuperHyperModel. But all only non-obvious simple
Neutrosophic type-SuperHyperSets of the Neutrosophic R-Eulerian-Type-Cycle-Cut amid those
obvious simple Neutrosophic type-SuperHyperSets of the Neutrosophic
Eulerian-Type-Cycle-Cut, are

V \ V \ {aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .

In a connected Neutrosophic SuperHyperGraph ESHG : (V, E). 1105

To sum them up, assume a connected loopless Neutrosophic SuperHyperGraph


ESHG : (V, E). Then in the worst case, literally,

V \ V \ {aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .

is a Neutrosophic R-Eulerian-Type-Cycle-Cut. In other words, the least cardinality, the lower


sharp bound for the cardinality, of a Neutrosophic R-Eulerian-Type-Cycle-Cut is the cardinality
of
V \ V \ {aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .

To sum them up, in a connected Neutrosophic SuperHyperGraph ESHG : (V, E). 1106

The all interior Neutrosophic SuperHyperVertices belong to any Neutrosophic 1107

quasi-R-Eulerian-Type-Cycle-Cut if for any of them, and any of other corresponded 1108

Neutrosophic SuperHyperVertex, some interior Neutrosophic SuperHyperVertices are 1109

mutually Neutrosophic SuperHyperNeighbors with no Neutrosophic exception at all 1110

minus all Neutrosophic SuperHypeNeighbors to any amount of them. 1111

Assume a connected Neutrosophic SuperHyperGraph ESHG : (V, E). Let a 1112

Neutrosophic SuperHyperEdge ESHE : E ∈ EESHG:(V,E) has some Neutrosophic 1113

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

SuperHyperVertices r. Consider all Neutrosophic numbers of those Neutrosophic 1114

SuperHyperVertices from that Neutrosophic SuperHyperEdge excluding excluding more 1115

than r distinct Neutrosophic SuperHyperVertices, exclude to any given Neutrosophic 1116

SuperHyperSet of the Neutrosophic SuperHyperVertices. Consider there’s a 1117

Neutrosophic R-Eulerian-Type-Cycle-Cut with the least cardinality, the lower sharp 1118

Neutrosophic bound for Neutrosophic cardinality. Assume a connected Neutrosophic 1119

SuperHyperGraph ESHG : (V, E). The Neutrosophic SuperHyperSet of the 1120

Neutrosophic SuperHyperVertices VESHE \ {z} is a Neutrosophic SuperHyperSet S of 1121

the Neutrosophic SuperHyperVertices such that there’s a Neutrosophic SuperHyperEdge 1122

to have some Neutrosophic SuperHyperVertices uniquely but it isn’t a Neutrosophic 1123

R-Eulerian-Type-Cycle-Cut. Since it doesn’t have 1124

the maximum Neutrosophic cardinality of a Neutrosophic SuperHyperSet S 1125

of Neutrosophic SuperHyperVertices such that there’s a Neutrosophic SuperHyperEdge 1126

to have some SuperHyperVertices uniquely. The Neutrosophic SuperHyperSet of the 1127

Neutrosophic SuperHyperVertices VESHE ∪ {z} is the maximum Neutrosophic 1128

cardinality of a Neutrosophic SuperHyperSet S of Neutrosophic SuperHyperVertices but 1129

it isn’t a Neutrosophic R-Eulerian-Type-Cycle-Cut. Since it doesn’t do the Neutrosophic 1130

procedure such that such that there’s a Neutrosophic SuperHyperEdge to have some 1131

Neutrosophic SuperHyperVertices uniquely [there are at least one Neutrosophic 1132

SuperHyperVertex outside implying there’s, sometimes in the connected Neutrosophic 1133

SuperHyperGraph ESHG : (V, E), a Neutrosophic SuperHyperVertex, titled its 1134

Neutrosophic SuperHyperNeighbor, to that Neutrosophic SuperHyperVertex in the 1135

Neutrosophic SuperHyperSet S so as S doesn’t do “the Neutrosophic procedure”.]. 1136

There’s only one Neutrosophic SuperHyperVertex outside the intended Neutrosophic 1137

SuperHyperSet, VESHE ∪ {z}, in the terms of Neutrosophic SuperHyperNeighborhood. 1138

Thus the obvious Neutrosophic R-Eulerian-Type-Cycle-Cut, VESHE is up. The obvious simple 1139

Neutrosophic type-SuperHyperSet of the Neutrosophic R-Eulerian-Type-Cycle-Cut, VESHE , is 1140

a Neutrosophic SuperHyperSet, VESHE , includes only all Neutrosophic 1141

SuperHyperVertices does forms any kind of Neutrosophic pairs are titled 1142

Neutrosophic SuperHyperNeighbors in a connected Neutrosophic SuperHyperGraph 1143

ESHG : (V, E). Since the Neutrosophic SuperHyperSet of the Neutrosophic 1144

SuperHyperVertices VESHE , is the 1145

maximum Neutrosophic SuperHyperCardinality of a Neutrosophic 1146

SuperHyperSet S of Neutrosophic SuperHyperVertices such that there’s a 1147

Neutrosophic SuperHyperEdge to have some Neutrosophic SuperHyperVertices uniquely. 1148

Thus, in a connected Neutrosophic SuperHyperGraph ESHG : (V, E). Any 1149

Neutrosophic R-Eulerian-Type-Cycle-Cut only contains all interior Neutrosophic 1150

SuperHyperVertices and all exterior Neutrosophic SuperHyperVertices from the unique 1151

Neutrosophic SuperHyperEdge where there’s any of them has all possible Neutrosophic 1152

SuperHyperNeighbors in and there’s all Neutrosophic SuperHyperNeighborhoods in 1153

with no exception minus all Neutrosophic SuperHypeNeighbors to some of them not all 1154

of them but everything is possible about Neutrosophic SuperHyperNeighborhoods and 1155

Neutrosophic SuperHyperNeighbors out. 1156

The SuperHyperNotion, namely, Eulerian-Type-Cycle-Cut, is up. There’s neither empty 1157

SuperHyperEdge nor loop SuperHyperEdge. The following Neutrosophic 1158

SuperHyperSet of Neutrosophic SuperHyperEdges[SuperHyperVertices] is the simple 1159

Neutrosophic type-SuperHyperSet of the Neutrosophic Eulerian-Type-Cycle-Cut. The 1160

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

Neutrosophic SuperHyperSet of Neutrosophic SuperHyperEdges[SuperHyperVertices], 1161

C(N SHG)N eutrosophicQuasi−Eulerian−T ype−Cycle−Cut


|EESHG:(V,E) |Neutrosophic Cardinality
b c
= {E2i−1 }i=1 2
.
C(N SHG)N eutrosophicQuasi−Eulerian−T ype−Cycle−CutSuperHyperP olynomial
|EESHG:(V,E) |Neutrosophic Cardinality
= 2z b 2 c
.
C(N SHG)N eutrosophicR−Quasi−Eulerian−T ype−Cycle−Cut = {Vi }si=1 , {Vj }tj=1 .
C(N SHG)N eutrosophicR−Quasi−Eulerian−T ype−Cycle−CutSuperHyperP olynomial
= az s + bz t .

is the simple Neutrosophic type-SuperHyperSet of the Neutrosophic Eulerian-Type-Cycle-Cut . 1162

The Neutrosophic SuperHyperSet of the Neutrosophic 1163

SuperHyperEdges[SuperHyperVertices], 1164

C(N SHG)N eutrosophicQuasi−Eulerian−T ype−Cycle−Cut


|EESHG:(V,E) |Neutrosophic Cardinality
b c
= {E2i−1 }i=1 2
.
C(N SHG)N eutrosophicQuasi−Eulerian−T ype−Cycle−CutSuperHyperP olynomial
|EESHG:(V,E) |Neutrosophic Cardinality
= 2z b 2 c
.
C(N SHG)N eutrosophicR−Quasi−Eulerian−T ype−Cycle−Cut = {Vi }si=1 , {Vj }tj=1 .
C(N SHG)N eutrosophicR−Quasi−Eulerian−T ype−Cycle−CutSuperHyperP olynomial
= az s + bz t .

Is an Neutrosophic Eulerian-Type-Cycle-Cut C(ESHG) for an Neutrosophic 1165

SuperHyperGraph ESHG : (V, E) is a Neutrosophic type-SuperHyperSet with 1166

the maximum Neutrosophic cardinality of a Neutrosophic SuperHyperSet S 1167

of Neutrosophic SuperHyperEdges[SuperHyperVertices] such that there’s no 1168

Neutrosophic SuperHyperVertex of a Neutrosophic SuperHyperEdge is common and 1169

there’s an Neutrosophic SuperHyperEdge for all Neutrosophic SuperHyperVertices. 1170

There are not only two Neutrosophic SuperHyperVertices inside the intended 1171

Neutrosophic SuperHyperSet. Thus the non-obvious Neutrosophic Eulerian-Type-Cycle-Cut is 1172

up. The obvious simple Neutrosophic type-SuperHyperSet called the Neutrosophic 1173

Eulerian-Type-Cycle-Cut is a Neutrosophic SuperHyperSet includes only two Neutrosophic 1174

SuperHyperVertices. But the Neutrosophic SuperHyperSet of the Neutrosophic 1175

SuperHyperEdges[SuperHyperVertices], 1176

C(N SHG)N eutrosophicQuasi−Eulerian−T ype−Cycle−Cut


|EESHG:(V,E) |Neutrosophic Cardinality
b c
= {E2i−1 }i=1 2
.
C(N SHG)N eutrosophicQuasi−Eulerian−T ype−Cycle−CutSuperHyperP olynomial
|EESHG:(V,E) |Neutrosophic Cardinality
= 2z b 2 c
.
C(N SHG)N eutrosophicR−Quasi−Eulerian−T ype−Cycle−Cut = {Vi }si=1 , {Vj }tj=1 .
C(N SHG)N eutrosophicR−Quasi−Eulerian−T ype−Cycle−CutSuperHyperP olynomial
= az s + bz t .

Doesn’t have less than three SuperHyperVertices inside the intended Neutrosophic 1177

SuperHyperSet. Thus the non-obvious simple Neutrosophic type-SuperHyperSet of the 1178

Neutrosophic Eulerian-Type-Cycle-Cut is up. To sum them up, the Neutrosophic 1179

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

SuperHyperSet of the Neutrosophic SuperHyperEdges[SuperHyperVertices], 1180

C(N SHG)N eutrosophicQuasi−Eulerian−T ype−Cycle−Cut


|EESHG:(V,E) |Neutrosophic Cardinality
b c
= {E2i−1 }i=1 2
.
C(N SHG)N eutrosophicQuasi−Eulerian−T ype−Cycle−CutSuperHyperP olynomial
|EESHG:(V,E) |Neutrosophic Cardinality
= 2z b 2 c
.
C(N SHG)N eutrosophicR−Quasi−Eulerian−T ype−Cycle−Cut = {Vi }si=1 , {Vj }tj=1 .
C(N SHG)N eutrosophicR−Quasi−Eulerian−T ype−Cycle−CutSuperHyperP olynomial
= az s + bz t .

Is the non-obvious simple Neutrosophic type-SuperHyperSet of the Neutrosophic 1181

Eulerian-Type-Cycle-Cut. Since the Neutrosophic SuperHyperSet of the Neutrosophic 1182

SuperHyperEdges[SuperHyperVertices], 1183

C(N SHG)N eutrosophicQuasi−Eulerian−T ype−Cycle−Cut


|EESHG:(V,E) |Neutrosophic Cardinality
b c
= {E2i−1 }i=1 2
.
C(N SHG)N eutrosophicQuasi−Eulerian−T ype−Cycle−CutSuperHyperP olynomial
|EESHG:(V,E) |Neutrosophic Cardinality
= 2z b 2 c
.
C(N SHG)N eutrosophicR−Quasi−Eulerian−T ype−Cycle−Cut = {Vi }si=1 , {Vj }tj=1 .
C(N SHG)N eutrosophicR−Quasi−Eulerian−T ype−Cycle−CutSuperHyperP olynomial
= az s + bz t .

Is an Neutrosophic Eulerian-Type-Cycle-Cut C(ESHG) for an Neutrosophic SuperHyperGraph 1184

ESHG : (V, E) is the Neutrosophic SuperHyperSet S of Neutrosophic 1185

SuperHyperVertices such that there’s no a Neutrosophic SuperHyperEdge for some 1186

Neutrosophic SuperHyperVertices given by that Neutrosophic type-SuperHyperSet 1187

called the Neutrosophic Eulerian-Type-Cycle-Cut and it’s an Neutrosophic 1188

Eulerian-Type-Cycle-Cut. Since it’s 1189

the maximum Neutrosophic cardinality of a Neutrosophic SuperHyperSet S 1190

of Neutrosophic SuperHyperEdges[SuperHyperVertices] such that there’s no 1191

Neutrosophic SuperHyperVertex of a Neutrosophic SuperHyperEdge is common and 1192

there’s an Neutrosophic SuperHyperEdge for all Neutrosophic SuperHyperVertices. 1193

There aren’t only less than three Neutrosophic SuperHyperVertices inside the intended 1194

Neutrosophic SuperHyperSet, 1195

C(N SHG)N eutrosophicQuasi−Eulerian−T ype−Cycle−Cut


|EESHG:(V,E) |Neutrosophic Cardinality
b c
= {E2i−1 }i=1 2
.
C(N SHG)N eutrosophicQuasi−Eulerian−T ype−Cycle−CutSuperHyperP olynomial
|EESHG:(V,E) |Neutrosophic Cardinality
= 2z b 2 c
.
C(N SHG)N eutrosophicR−Quasi−Eulerian−T ype−Cycle−Cut = {Vi }si=1 , {Vj }tj=1 .
C(N SHG)N eutrosophicR−Quasi−Eulerian−T ype−Cycle−CutSuperHyperP olynomial
= az s + bz t .

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

Thus the non-obvious Neutrosophic Eulerian-Type-Cycle-Cut , 1196

C(N SHG)N eutrosophicQuasi−Eulerian−T ype−Cycle−Cut


|EESHG:(V,E) |Neutrosophic Cardinality
b c
= {E2i−1 }i=1 2
.
C(N SHG)N eutrosophicQuasi−Eulerian−T ype−Cycle−CutSuperHyperP olynomial
|EESHG:(V,E) |Neutrosophic Cardinality
= 2z b 2 c
.
C(N SHG)N eutrosophicR−Quasi−Eulerian−T ype−Cycle−Cut = {Vi }si=1 , {Vj }tj=1 .
C(N SHG)N eutrosophicR−Quasi−Eulerian−T ype−Cycle−CutSuperHyperP olynomial
= az s + bz t .

Is up. The obvious simple Neutrosophic type-SuperHyperSet of the Neutrosophic 1197

, not:
Eulerian-Type-Cycle-Cut 1198

C(N SHG)N eutrosophicQuasi−Eulerian−T ype−Cycle−Cut


|EESHG:(V,E) |Neutrosophic Cardinality
b c
= {E2i−1 }i=1 2
.
C(N SHG)N eutrosophicQuasi−Eulerian−T ype−Cycle−CutSuperHyperP olynomial
|EESHG:(V,E) |Neutrosophic Cardinality
= 2z b 2 c
.
C(N SHG)N eutrosophicR−Quasi−Eulerian−T ype−Cycle−Cut = {Vi }si=1 , {Vj }tj=1 .
C(N SHG)N eutrosophicR−Quasi−Eulerian−T ype−Cycle−CutSuperHyperP olynomial
= az s + bz t .

Is the Neutrosophic SuperHyperSet, not: 1199

C(N SHG)N eutrosophicQuasi−Eulerian−T ype−Cycle−Cut


|EESHG:(V,E) |Neutrosophic Cardinality
b c
= {E2i−1 }i=1 2
.
C(N SHG)N eutrosophicQuasi−Eulerian−T ype−Cycle−CutSuperHyperP olynomial
|EESHG:(V,E) |Neutrosophic Cardinality
= 2z b 2 c
.
C(N SHG)N eutrosophicR−Quasi−Eulerian−T ype−Cycle−Cut = {Vi }si=1 , {Vj }tj=1 .
C(N SHG)N eutrosophicR−Quasi−Eulerian−T ype−Cycle−CutSuperHyperP olynomial
= az s + bz t .

Does includes only less than three SuperHyperVertices in a connected Neutrosophic 1200

SuperHyperGraph ESHG : (V, E). It’s interesting to mention that the only non-obvious 1201

simple Neutrosophic type-SuperHyperSet called the 1202

“Neutrosophic Eulerian-Type-Cycle-Cut ” 1203

amid those obvious[non-obvious] simple Neutrosophic type-SuperHyperSets called the 1204

Neutrosophic Eulerian-Type-Cycle-Cut , 1205

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

is only and only 1206

C(N SHG)N eutrosophicQuasi−Eulerian−T ype−Cycle−Cut


|EESHG:(V,E) |Neutrosophic Cardinality
b c
= {E2i−1 }i=1 2
.
C(N SHG)N eutrosophicQuasi−Eulerian−T ype−Cycle−CutSuperHyperP olynomial
|EESHG:(V,E) |Neutrosophic Cardinality
= 2z b 2 c
.
C(N SHG)N eutrosophicR−Quasi−Eulerian−T ype−Cycle−Cut = {Vi }si=1 , {Vj }tj=1 .
C(N SHG)N eutrosophicR−Quasi−Eulerian−T ype−Cycle−CutSuperHyperP olynomial
= az s + bz t .

In a connected Neutrosophic SuperHyperGraph ESHG : (V, E). 1207

5 The Neutrosophic Departures on The Theoretical 1208

Results Toward Theoretical Motivations 1209

The previous Neutrosophic approach apply on the upcoming Neutrosophic results on 1210

Neutrosophic SuperHyperClasses. 1211

Proposition 5.1. Assume a connected Neutrosophic SuperHyperPath ESHP : (V, E). 1212

Then 1213

C(N SHG)Neutrosophic Eulerian-Type-Cycle-Cut


= {Ei }|Ei |=maxEj ∈EN SHG |Ej | .
C(N SHG)Neutrosophic Eulerian-Type-Cycle-Cut SuperHyperPolynomial
{Ei }|Ei |=maxE |Ej |
=z j ∈EN SHG

C(N SHG)Neutrosophic V-Eulerian-Type-Cycle-Cut


= {V{Ei }|Ei |=maxE |Ej |
}.
j ∈EN SHG

C(N SHG)Neutrosophic V-Eulerian-Type-Cycle-Cut SuperHyperPolynomial


X |{V{Ei }|E |=max }|
i Ej ∈EN SHG |Ej |
= z .

Proof. Let 1214

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V |EN SHG |
, E |EN SHG |
3 3

1215

P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
...,
EXT ERN AL
E |EN SHG | , V |EN SHG |
3 3

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

Figure 23. a Neutrosophic SuperHyperPath Associated to the Notions of Neutrosophic


SuperHyperEulerian-Type-Cycle-Cut in the Example (16.5)

be a longest path taken from a connected Neutrosophic SuperHyperPath 1216

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

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 1218

corresponded to ViEXT ERN AL in the literatures of SuperHyperEulerian-Type-Cycle-Cut. The 1219

latter is straightforward. 1220

Example 5.2. In the Figure (23), the connected Neutrosophic SuperHyperPath 1221

ESHP : (V, E), is highlighted and featured. The Neutrosophic SuperHyperSet, in the 1222

Neutrosophic SuperHyperModel (23), is the SuperHyperEulerian-Type-Cycle-Cut. 1223

Proposition 5.3. Assume a connected Neutrosophic SuperHyperCycle ESHC : (V, E). 1224

Then 1225

C(N SHG)Neutrosophic Eulerian-Type-Cycle-Cut


|E |
= {Ei }i=1N SHG .
C(N SHG)Neutrosophic Eulerian-Type-Cycle-Cut SuperHyperPolynomial
X
= z |Ei | .
Ei ∈EN SHG
C(N SHG)Neutrosophic V-Eulerian-Type-Cycle-Cut
|V
N SHG |
= {Vi }i=1 .
C(N SHG)Neutrosophic V-Eulerian-Type-Cycle-Cut SuperHyperPolynomial
X
= z |Vi | .
Vi ∈VN SHG

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

Proof. Let 1226

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V |EN SHG |
, E |EN SHG |
3 3

1227

P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
...,
EXT ERN AL
E |EN SHG | , V |EN SHG |
3 3

be a longest path taken from a connected Neutrosophic SuperHyperCycle 1228

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

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 1230

corresponded to ViEXT ERN AL in the literatures of SuperHyperEulerian-Type-Cycle-Cut. The 1231

latter is straightforward. 1232

Example 5.4. In the Figure (24), the connected Neutrosophic SuperHyperCycle 1233

N SHC : (V, E), is highlighted and featured. The obtained Neutrosophic 1234

SuperHyperSet, in the Neutrosophic SuperHyperModel (24), is the Neutrosophic 1235

SuperHyperEulerian-Type-Cycle-Cut. 1236

Proposition 5.5. Assume a connected Neutrosophic SuperHyperStar ESHS : (V, E). 1237

Then 1238

C(N SHG)Neutrosophic Eulerian-Type-Cycle-Cut


= {Ei }|Ei |=maxEj ∈EN SHG |Ej | .
C(N SHG)Neutrosophic Eulerian-Type-Cycle-Cut SuperHyperPolynomial
{Ei }|Ei |=maxE |Ej |
=z j ∈EN SHG

C(N SHG)Neutrosophic V-Eulerian-Type-Cycle-Cut


= {V{Ei }|Ei |=maxE |Ej |
}.
j ∈EN SHG

C(N SHG)Neutrosophic V-Eulerian-Type-Cycle-Cut SuperHyperPolynomial


X |{V{Ei }|E |=max }|
i Ej ∈EN SHG |Ej |
= z .

Proof. Let 1239

P :
V1EXT ERN AL , E1 ,
CEN T ER, E2

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

Figure 24. a Neutrosophic SuperHyperCycle Associated to the Neutrosophic Notions


of Neutrosophic SuperHyperEulerian-Type-Cycle-Cut in the Neutrosophic Example (16.7)

1240

P :
E1 , V1EXT ERN AL ,
E2 , CEN T ER

be a longest path taken a connected Neutrosophic SuperHyperStar ESHS : (V, E). 1241

There’s a new way to redefine as 1242

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 1243

corresponded to ViEXT ERN AL in the literatures of SuperHyperEulerian-Type-Cycle-Cut. The 1244

latter is straightforward. 1245

Example 5.6. In the Figure (25), the connected Neutrosophic SuperHyperStar 1246

ESHS : (V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, 1247

by the Algorithm in previous Neutrosophic result, of the Neutrosophic 1248

SuperHyperVertices of the connected Neutrosophic SuperHyperStar ESHS : (V, E), in 1249

the Neutrosophic SuperHyperModel (25), is the Neutrosophic 1250

SuperHyperEulerian-Type-Cycle-Cut. 1251

Proposition 5.7. Assume a connected Neutrosophic SuperHyperBipartite 1252

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

Figure 25. a Neutrosophic SuperHyperStar Associated to the Neutrosophic Notions of


Neutrosophic SuperHyperEulerian-Type-Cycle-Cut in the Neutrosophic Example (16.9)

ESHB : (V, E). Then 1253

C(N SHG)Neutrosophic Eulerian-Type-Cycle-Cut


= {Ei , Ej }Ei ∩Ej 6=∅ .
C(N SHG)Neutrosophic Eulerian-Type-Cycle-Cut SuperHyperPolynomial
X
=
{Ei ,Ej }Ei ∩Ej 6=∅ z |Ei | .

C(N SHG)Neutrosophic V-Eulerian-Type-Cycle-Cut


= {Vi , Vj }Vi ∈PNr SHG ,Vj ∈PNs SHG ,r6=s .
C(N SHG)Neutrosophic V-Eulerian-Type-Cycle-Cut SuperHyperPolynomial
X
= z |Vi | .
{Vi ,Vj }Vi ∈P r ,Vj ∈P s ,r6=s
N SHG N SHG

Proof. Let 1254

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V|P i |=minP ∈E |Pj | , E|Pi |=minPj ∈EN SHG |Pj | .
j N SHG
1255

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

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

is a longest path taken from a connected Neutrosophic SuperHyperBipartite 1256

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

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 1258

corresponded to ViEXT ERN AL in the literatures of SuperHyperEulerian-Type-Cycle-Cut. The 1259

latter is straightforward. Then there’s no at least one SuperHyperEulerian-Type-Cycle-Cut. 1260

Thus the notion of quasi may be up but the SuperHyperNotions based on 1261

SuperHyperEulerian-Type-Cycle-Cut could be applied. There are only two SuperHyperParts. 1262

Thus every SuperHyperPart could have one SuperHyperVertex as the representative in 1263

the 1264

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

is a longest SuperHyperEulerian-Type-Cycle-Cut taken from a connected Neutrosophic 1265

SuperHyperBipartite ESHB : (V, E). Thus only some SuperHyperVertices and only 1266

minimum-Neutrosophic-of-SuperHyperPart SuperHyperEdges are attained in any 1267

solution 1268

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

The latter is straightforward. 1269

Example 5.8. In the Neutrosophic Figure (26), the connected Neutrosophic 1270

SuperHyperBipartite ESHB : (V, E), is Neutrosophic highlighted and Neutrosophic 1271

featured. The obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in 1272

previous Neutrosophic result, of the Neutrosophic SuperHyperVertices of the connected 1273

Neutrosophic SuperHyperBipartite ESHB : (V, E), in the Neutrosophic 1274

SuperHyperModel (26), is the Neutrosophic SuperHyperEulerian-Type-Cycle-Cut. 1275

Proposition 5.9. Assume a connected Neutrosophic SuperHyperMultipartite 1276

ESHM : (V, E). Then 1277

C(N SHG)Neutrosophic Eulerian-Type-Cycle-Cut


= {Ei , Ej }Ei ∩Ej 6=∅ .
C(N SHG)Neutrosophic Eulerian-Type-Cycle-Cut SuperHyperPolynomial
X
=
{Ei ,Ej }Ei ∩Ej 6=∅ z |Ei | .

C(N SHG)Neutrosophic V-Eulerian-Type-Cycle-Cut


= {Vi , Vj }Vi ∈PNr SHG ,Vj ∈PNs SHG ,r6=s .
C(N SHG)Neutrosophic V-Eulerian-Type-Cycle-Cut SuperHyperPolynomial
X
= z |Vi | .
{Vi ,Vj }Vi ∈P r ,Vj ∈P s ,r6=s
N SHG N SHG

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

Figure 26. Neutrosophic SuperHyperBipartite Neutrosophic Associated to the Neutro-


sophic Notions of Neutrosophic SuperHyperEulerian-Type-Cycle-Cut in the Example (16.11)

Proof. Let 1278

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

1279

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 SuperHyperEulerian-Type-Cycle-Cut taken from a connected Neutrosophic 1280

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

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 1282

corresponded to ViEXT ERN AL in the literatures of SuperHyperEulerian-Type-Cycle-Cut. The 1283

latter is straightforward. Then there’s no at least one SuperHyperEulerian-Type-Cycle-Cut. 1284

Thus the notion of quasi may be up but the SuperHyperNotions based on 1285

SuperHyperEulerian-Type-Cycle-Cut could be applied. There are only z 0 SuperHyperParts. 1286

Thus every SuperHyperPart could have one SuperHyperVertex as the representative in 1287

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

Figure 27. a Neutrosophic SuperHyperMultipartite Associated to the Notions of


Neutrosophic SuperHyperEulerian-Type-Cycle-Cut in the Example (16.13)

the 1288

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

is a longest path taken from a connected Neutrosophic SuperHyperMultipartite 1289

ESHM : (V, E). Thus only some SuperHyperVertices and only 1290

minimum-Neutrosophic-of-SuperHyperPart SuperHyperEdges are attained in any 1291

solution 1292

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

is a longest path taken from a connected Neutrosophic SuperHyperMultipartite 1293

ESHM : (V, E). The latter is straightforward. 1294

Example 5.10. In the Figure (27), the connected Neutrosophic 1295

SuperHyperMultipartite ESHM : (V, E), is highlighted and Neutrosophic featured. 1296

The obtained Neutrosophic SuperHyperSet, by the Algorithm in previous Neutrosophic 1297

result, of the Neutrosophic SuperHyperVertices of the connected Neutrosophic 1298

SuperHyperMultipartite ESHM : (V, E), in the Neutrosophic SuperHyperModel (27), 1299

is the Neutrosophic SuperHyperEulerian-Type-Cycle-Cut. 1300

Proposition 5.11. Assume a connected Neutrosophic SuperHyperWheel 1301

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

ESHW : (V, E ∪ E ∗ ). Then, 1302

C(N SHG)Neutrosophic Eulerian-Type-Cycle-Cut


|E |
= {Ei }i=1N SHG .
C(N SHG)Neutrosophic Eulerian-Type-Cycle-Cut SuperHyperPolynomial
X
= z |Ei | .
Ei ∈EN SHG
C(N SHG)Neutrosophic V-Eulerian-Type-Cycle-Cut
|V
N SHG |
= {Vi }i=1 .
C(N SHG)Neutrosophic V-Eulerian-Type-Cycle-Cut SuperHyperPolynomial
X
= z |Vi | .
Vi ∈VN SHG

Proof. Let 1303

P :
V1EXT ERN AL , E1∗ ,
CEN T ER, E2∗
1304

P :
E1∗ , V1EXT ERN AL ,
E2∗ , CEN T ER
is a longest SuperHyperEulerian-Type-Cycle-Cut taken from a connected Neutrosophic 1305

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

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 1307

corresponded to ViEXT ERN AL in the literatures of SuperHyperEulerian-Type-Cycle-Cut. The 1308

latter is straightforward. Then there’s at least one SuperHyperEulerian-Type-Cycle-Cut. Thus 1309

the notion of quasi isn’t up and the SuperHyperNotions based on 1310

SuperHyperEulerian-Type-Cycle-Cut could be applied. The unique embedded 1311

SuperHyperEulerian-Type-Cycle-Cut proposes some longest SuperHyperEulerian-Type-Cycle-Cut 1312

excerpt from some representatives. The latter is straightforward. 1313

Example 5.12. In the Neutrosophic Figure (28), the connected Neutrosophic 1314

SuperHyperWheel N SHW : (V, E), is Neutrosophic highlighted and featured. The 1315

obtained Neutrosophic SuperHyperSet, by the Algorithm in previous result, of the 1316

Neutrosophic SuperHyperVertices of the connected Neutrosophic SuperHyperWheel 1317

ESHW : (V, E), in the Neutrosophic SuperHyperModel (28), is the Neutrosophic 1318

SuperHyperEulerian-Type-Cycle-Cut. 1319

6 The Surveys of Mathematical Sets On The 1320

Results But As The Initial Motivation 1321

For the SuperHyperEulerian-Type-Cycle-Cut, Neutrosophic SuperHyperEulerian-Type-Cycle-Cut, and 1322

the Neutrosophic SuperHyperEulerian-Type-Cycle-Cut, some general results are introduced. 1323

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

Figure 28. a Neutrosophic SuperHyperWheel Neutrosophic Associated to the Neu-


trosophic Notions of Neutrosophic SuperHyperEulerian-Type-Cycle-Cut in the Neutrosophic
Example (16.15)

Remark 6.1. Let remind that the Neutrosophic SuperHyperEulerian-Type-Cycle-Cut is 1324

“redefined” on the positions of the alphabets. 1325

Corollary 6.2. Assume Neutrosophic SuperHyperEulerian-Type-Cycle-Cut. Then 1326

N eutrosophic SuperHyperEulerian − T ype − Cycle − Cut =


{theSuperHyperEulerian − T ype − Cycle − Cutof theSuperHyperV ertices |
max |SuperHyperOf f ensive
SuperHyperEulerian − T ype − Cycle − Cut
|N eutrosophiccardinalityamidthoseSuperHyperEulerian−T ype−Cycle−Cut. }

plus one Neutrosophic SuperHypeNeighbor to one. Where σi is the unary operation on 1327

the SuperHyperVertices of the SuperHyperGraph to assign the determinacy, the 1328

indeterminacy and the neutrality, for i = 1, 2, 3, respectively. 1329

Corollary 6.3. Assume a Neutrosophic SuperHyperGraph on the same identical letter 1330

of the alphabet. Then the notion of Neutrosophic SuperHyperEulerian-Type-Cycle-Cut and 1331

SuperHyperEulerian-Type-Cycle-Cut coincide. 1332

Corollary 6.4. Assume a Neutrosophic SuperHyperGraph on the same identical letter 1333

of the alphabet. Then a conseNeighborive sequence of the SuperHyperVertices is a 1334

Neutrosophic SuperHyperEulerian-Type-Cycle-Cut if and only if it’s a SuperHyperEulerian-Type-Cycle-Cut. 1335

Corollary 6.5. Assume a Neutrosophic SuperHyperGraph on the same identical letter 1336

of the alphabet. Then a conseNeighborive sequence of the SuperHyperVertices is a 1337

strongest SuperHyperEulerian-Type-Cycle-Cut if and only if it’s a longest 1338

SuperHyperEulerian-Type-Cycle-Cut. 1339

Corollary 6.6. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph on the 1340

same identical letter of the alphabet. Then its Neutrosophic SuperHyperEulerian-Type-Cycle-Cut 1341

is its SuperHyperEulerian-Type-Cycle-Cut and reversely. 1342

Corollary 6.7. Assume a Neutrosophic SuperHyperPath(-/SuperHyperEulerian-Type-Cycle-Cut, 1343

SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel) on 1344

the same identical letter of the alphabet. Then its Neutrosophic 1345

SuperHyperEulerian-Type-Cycle-Cut is its SuperHyperEulerian-Type-Cycle-Cut and reversely. 1346

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

Corollary 6.8. Assume a Neutrosophic SuperHyperGraph. Then its Neutrosophic 1347

SuperHyperEulerian-Type-Cycle-Cut isn’t well-defined if and only if its SuperHyperEulerian-Type-Cycle-Cut 1348

isn’t well-defined. 1349

Corollary 6.9. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph. Then 1350

its Neutrosophic SuperHyperEulerian-Type-Cycle-Cut isn’t well-defined if and only if its 1351

SuperHyperEulerian-Type-Cycle-Cut isn’t well-defined. 1352

Corollary 6.10. Assume a Neutrosophic SuperHyperPath(-/SuperHyperEulerian-Type-Cycle-Cut, 1353

SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). 1354

Then its Neutrosophic SuperHyperEulerian-Type-Cycle-Cut isn’t well-defined if and only if its 1355

SuperHyperEulerian-Type-Cycle-Cut isn’t well-defined. 1356

Corollary 6.11. Assume a Neutrosophic SuperHyperGraph. Then its Neutrosophic 1357

SuperHyperEulerian-Type-Cycle-Cut is well-defined if and only if its SuperHyperEulerian-Type-Cycle-Cut is 1358

well-defined. 1359

Corollary 6.12. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph. 1360

Then its Neutrosophic SuperHyperEulerian-Type-Cycle-Cut is well-defined if and only if its 1361

SuperHyperEulerian-Type-Cycle-Cut is well-defined. 1362

Corollary 6.13. Assume a Neutrosophic SuperHyperPath(-/SuperHyperEulerian-Type-Cycle-Cut, 1363

SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). 1364

Then its Neutrosophic SuperHyperEulerian-Type-Cycle-Cut is well-defined if and only if its 1365

SuperHyperEulerian-Type-Cycle-Cut is well-defined. 1366

Proposition 6.14. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. Then V 1367

is 1368

(i) : the dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1369

(ii) : the strong dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1370

(iii) : the connected dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1371

(iv) : the δ-dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1372

(v) : the strong δ-dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1373

(vi) : the connected δ-dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut. 1374

Proposition 6.15. Let N T G : (V, E, σ, µ) be a Neutrosophic SuperHyperGraph. Then 1375

∅ is 1376

(i) : the SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1377

(ii) : the strong SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1378

(iii) : the connected defensive SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1379

(iv) : the δ-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1380

(v) : the strong δ-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1381

(vi) : the connected δ-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut. 1382

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

independent SuperHyperSet is 1384

(i) : the SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1385

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

(ii) : the strong SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1386

(iii) : the connected SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1387

(iv) : the δ-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1388

(v) : the strong δ-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1389

(vi) : the connected δ-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut. 1390

Proposition 6.17. Let ESHG : (V, E) be a Neutrosophic SuperHyperUniform 1391

SuperHyperGraph which is a SuperHyperEulerian-Type-Cycle-Cut/SuperHyperPath. Then V is a 1392

maximal 1393

(i) : SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1394

(ii) : strong SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1395

(iii) : connected SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1396

(iv) : O(ESHG)-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1397

(v) : strong O(ESHG)-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1398

(vi) : connected O(ESHG)-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1399

Where the exterior SuperHyperVertices and the interior SuperHyperVertices coincide. 1400

Proposition 6.18. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is a 1401

SuperHyperUniform SuperHyperWheel. Then V is a maximal 1402

(i) : dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1403

(ii) : strong dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1404

(iii) : connected dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1405

(iv) : O(ESHG)-dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1406

(v) : strong O(ESHG)-dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1407

(vi) : connected O(ESHG)-dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1408

Where the exterior SuperHyperVertices and the interior SuperHyperVertices coincide. 1409

Proposition 6.19. Let ESHG : (V, E) be a Neutrosophic SuperHyperUniform 1410

SuperHyperGraph which is a SuperHyperEulerian-Type-Cycle-Cut/SuperHyperPath. Then the 1411

number of 1412

(i) : the SuperHyperEulerian-Type-Cycle-Cut; 1413

(ii) : the SuperHyperEulerian-Type-Cycle-Cut; 1414

(iii) : the connected SuperHyperEulerian-Type-Cycle-Cut; 1415

(iv) : the O(ESHG)-SuperHyperEulerian-Type-Cycle-Cut; 1416

(v) : the strong O(ESHG)-SuperHyperEulerian-Type-Cycle-Cut; 1417

(vi) : the connected O(ESHG)-SuperHyperEulerian-Type-Cycle-Cut. 1418

is one and it’s only V. Where the exterior SuperHyperVertices and the interior 1419

SuperHyperVertices coincide. 1420

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

Proposition 6.20. Let ESHG : (V, E) be a Neutrosophic SuperHyperUniform 1421

SuperHyperGraph which is a SuperHyperWheel. Then the number of 1422

(i) : the dual SuperHyperEulerian-Type-Cycle-Cut; 1423

(ii) : the dual SuperHyperEulerian-Type-Cycle-Cut; 1424

(iii) : the dual connected SuperHyperEulerian-Type-Cycle-Cut; 1425

(iv) : the dual O(ESHG)-SuperHyperEulerian-Type-Cycle-Cut; 1426

(v) : the strong dual O(ESHG)-SuperHyperEulerian-Type-Cycle-Cut; 1427

(vi) : the connected dual O(ESHG)-SuperHyperEulerian-Type-Cycle-Cut. 1428

is one and it’s only V. Where the exterior SuperHyperVertices and the interior 1429

SuperHyperVertices coincide. 1430

Proposition 6.21. Let ESHG : (V, E) be a Neutrosophic SuperHyperUniform 1431

SuperHyperGraph which is a SuperHyperStar/SuperHyperComplete 1432

SuperHyperBipartite/SuperHyperComplete SuperHyperMultipartite. Then a 1433

SuperHyperSet contains [the SuperHyperCenter and] the half of multiplying r with the 1434

number of all the SuperHyperEdges plus one of all the SuperHyperVertices is a 1435

(i) : dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1436

(ii) : strong dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1437

(iii) : connected dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1438

O(ESHG)
(iv) : 2 + 1-dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1439

O(ESHG)
(v) : strong 2 + 1-dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1440

O(ESHG)
(vi) : connected 2 + 1-dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut. 1441

Proposition 6.22. Let ESHG : (V, E) be a Neutrosophic SuperHyperUniform 1442

SuperHyperGraph which is a SuperHyperStar/SuperHyperComplete 1443

SuperHyperBipartite/SuperHyperComplete SuperHyperMultipartite. Then a 1444

SuperHyperSet contains the half of multiplying r with the number of all the 1445

SuperHyperEdges plus one of all the SuperHyperVertices in the biggest SuperHyperPart 1446

is a 1447

(i) : SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1448

(ii) : strong SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1449

(iii) : connected SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1450

(iv) : δ-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1451

(v) : strong δ-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1452

(vi) : connected δ-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut. 1453

Proposition 6.23. Let ESHG : (V, E) be a Neutrosophic SuperHyperUniform 1454

SuperHyperGraph which is a SuperHyperStar/SuperHyperComplete 1455

SuperHyperBipartite/SuperHyperComplete SuperHyperMultipartite. Then Then the 1456

number of 1457

(i) : dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1458

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

(ii) : strong dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1459

(iii) : connected dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1460

O(ESHG)
(iv) : 2 + 1-dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1461

O(ESHG)
(v) : strong 2 + 1-dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1462

O(ESHG)
(vi) : connected 2 + 1-dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut. 1463

is one and it’s only S, a SuperHyperSet contains [the SuperHyperCenter and] the half of 1464

multiplying r with the number of all the SuperHyperEdges plus one of all the 1465

SuperHyperVertices. Where the exterior SuperHyperVertices and the interior 1466

SuperHyperVertices coincide. 1467

Proposition 6.24. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. The 1468

number of connected component is |V − S| if there’s a SuperHyperSet which is a dual 1469

(i) : SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1470

(ii) : strong SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1471

(iii) : connected SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1472

(iv) : SuperHyperEulerian-Type-Cycle-Cut; 1473

(v) : strong 1-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1474

(vi) : connected 1-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut. 1475

Proposition 6.25. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. Then the 1476

number is at most O(ESHG) and the Neutrosophic number is at most On (ESHG). 1477

Proposition 6.26. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is 1478

SuperHyperComplete. The number is O(ESHG:(V,E)) 2 + 1 and the Neutrosophic number is 1479

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

(i) : SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1481

(ii) : strong SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1482

(iii) : connected SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1483

(iv) : ( O(ESHG:(V,E))
2 + 1)-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1484

(v) : strong ( O(ESHG:(V,E))


2 + 1)-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1485

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


2 + 1)-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut. 1486

Proposition 6.27. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is 1487

∅. The number is 0 and the Neutrosophic number is 0, for an independent 1488

SuperHyperSet in the setting of dual 1489

(i) : SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1490

(ii) : strong SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1491

(iii) : connected SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1492

(iv) : 0-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1493

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

(v) : strong 0-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1494

(vi) : connected 0-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut. 1495

Proposition 6.28. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is 1496

SuperHyperComplete. Then there’s no independent SuperHyperSet. 1497

Proposition 6.29. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is 1498

SuperHyperEulerian-Type-Cycle-Cut/SuperHyperPath/SuperHyperWheel. The number is 1499

O(ESHG : (V, E)) and the Neutrosophic number is On (ESHG : (V, E)), in the setting 1500

of a dual 1501

(i) : SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1502

(ii) : strong SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1503

(iii) : connected SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1504

(iv) : O(ESHG : (V, E))-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1505

(v) : strong O(ESHG : (V, E))-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1506

(vi) : connected O(ESHG : (V, E))-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut. 1507

Proposition 6.30. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is 1508

SuperHyperStar/complete SuperHyperBipartite/complete SuperHyperMultiPartite. The 1509

number is O(ESHG:(V,E))
2 + 1 and the Neutrosophic number is 1510

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

(i) : SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1512

(ii) : strong SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1513

(iii) : connected SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1514

(iv) : ( O(ESHG:(V,E))
2 + 1)-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1515

(v) : strong ( O(ESHG:(V,E))


2 + 1)-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1516

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


2 + 1)-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut. 1517

Proposition 6.31. Let N SHF : (V, E) be a SuperHyperFamily of the ESHGs : (V, E) 1518

Neutrosophic SuperHyperGraphs which are from one-type SuperHyperClass which the 1519

result is obtained for the individuals. Then the results also hold for the 1520

SuperHyperFamily N SHF : (V, E) of these specific SuperHyperClasses of the 1521

Neutrosophic SuperHyperGraphs. 1522

Proposition 6.32. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph. If 1523

S is a dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut, then ∀v ∈ V \ S, ∃x ∈ S 1524

such that 1525

(i) v ∈ Ns (x); 1526

(ii) vx ∈ E. 1527

Proposition 6.33. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph. If 1528

S is a dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut, then 1529

(i) S is SuperHyperEulerian-Type-Cycle-Cut set; 1530

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

(ii) there’s S ⊆ S 0 such that |S 0 | is SuperHyperChromatic number. 1531

Proposition 6.34. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph. 1532

Then 1533

(i) Γ ≤ O; 1534

(ii) Γs ≤ On . 1535

Proposition 6.35. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph 1536

which is connected. Then 1537

(i) Γ ≤ O − 1; 1538

(ii) Γs ≤ On − Σ3i=1 σi (x). 1539

Proposition 6.36. Let ESHG : (V, E) be an odd SuperHyperPath. Then 1540

(i) the SuperHyperSet S = {v2 , v4 , · · · , vn−1 } is a dual SuperHyperDefensive 1541

SuperHyperEulerian-Type-Cycle-Cut; 1542

(ii) Γ = b n2 c + 1 and corresponded SuperHyperSet is S = {v2 , v4 , · · · , vn−1 }; 1543

(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· ,vn−1 } Σ3i=1 σi (s)}; 1544

(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn−1 } and S2 = {v1 , v3 , · · · , vn−1 } are only 1545

a dual SuperHyperEulerian-Type-Cycle-Cut. 1546

Proposition 6.37. Let ESHG : (V, E) be an even SuperHyperPath. Then 1547

(i) the set S = {v2 , v4 , · · · .vn } is a dual SuperHyperDefensive 1548

SuperHyperEulerian-Type-Cycle-Cut; 1549

(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · .vn } and 1550

{v1 , v3 , · · · .vn−1 }; 1551

(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 1552

(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn } and S2 = {v1 , v3 , · · · .vn−1 } are only 1553

dual SuperHyperEulerian-Type-Cycle-Cut. 1554

Proposition 6.38. Let ESHG : (V, E) be an even SuperHyperEulerian-Type-Cycle-Cut. Then 1555

(i) the SuperHyperSet S = {v2 , v4 , · · · , vn } is a dual SuperHyperDefensive 1556

SuperHyperEulerian-Type-Cycle-Cut; 1557

(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · , vn } and 1558

{v1 , v3 , · · · , vn−1 }; 1559

(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } σ(s), Σs∈S={v1 ,v3 ,··· ,vn−1 } σ(s)}; 1560

(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn } and S2 = {v1 , v3 , · · · , vn−1 } are only 1561

dual SuperHyperEulerian-Type-Cycle-Cut. 1562

Proposition 6.39. Let ESHG : (V, E) be an odd SuperHyperEulerian-Type-Cycle-Cut. Then 1563

(i) the SuperHyperSet S = {v2 , v4 , · · · , vn−1 } is a dual SuperHyperDefensive 1564

SuperHyperEulerian-Type-Cycle-Cut; 1565

(ii) Γ = b n2 c + 1 and corresponded SuperHyperSet is S = {v2 , v4 , · · · , vn−1 }; 1566

(iii) Γs = min{Σs∈S={v2 ,v4 ,··· .vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 1567

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn−1 } and S2 = {v1 , v3 , · · · .vn−1 } are only 1568

dual SuperHyperEulerian-Type-Cycle-Cut. 1569

Proposition 6.40. Let ESHG : (V, E) be SuperHyperStar. Then 1570

(i) the SuperHyperSet S = {c} is a dual maximal SuperHyperEulerian-Type-Cycle-Cut; 1571

(ii) Γ = 1; 1572

(iii) Γs = Σ3i=1 σi (c); 1573

(iv) the SuperHyperSets S = {c} and S ⊂ S 0 are only dual SuperHyperEulerian-Type-Cycle-Cut. 1574

Proposition 6.41. Let ESHG : (V, E) be SuperHyperWheel. Then 1575

6+3(i−1)≤n
(i) the SuperHyperSet S = {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is a dual 1576

maximal SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1577

6+3(i−1)≤n
(ii) Γ = |{v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 |; 1578

(iii) Γs = Σ{v1 ,v3 }∪{v6 ,v9 ··· ,vi+6 ,··· ,vn }6+3(i−1)≤n Σ3i=1 σi (s); 1579
i=1

6+3(i−1)≤n
(iv) the SuperHyperSet {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is only a dual 1580

maximal SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut. 1581

Proposition 6.42. Let ESHG : (V, E) be an odd SuperHyperComplete. Then 1582

b n c+1
(i) the SuperHyperSet S = {vi }i=1 2
is a dual SuperHyperDefensive 1583

SuperHyperEulerian-Type-Cycle-Cut; 1584

(ii) Γ = b n2 c + 1; 1585

(iii) Γs = min{Σs∈S Σ3i=1 σi (s)} 2


b n c+1 ; 1586
S={vi }i=1

b n c+1
(iv) the SuperHyperSet S = {vi }i=1 2
is only a dual SuperHyperDefensive 1587

SuperHyperEulerian-Type-Cycle-Cut. 1588

Proposition 6.43. Let ESHG : (V, E) be an even SuperHyperComplete. Then 1589

bn
2c
(i) the SuperHyperSet S = {vi }i=1 is a dual SuperHyperDefensive 1590

SuperHyperEulerian-Type-Cycle-Cut; 1591

(ii) Γ = b n2 c; 1592

(iii) Γs = min{Σs∈S Σ3i=1 σi (s)} 2


bnc ; 1593
S={vi }i=1

bnc
(iv) the SuperHyperSet S = {vi }i=1 2
is only a dual maximal SuperHyperDefensive 1594

SuperHyperEulerian-Type-Cycle-Cut. 1595

Proposition 6.44. Let N SHF : (V, E) be a m-SuperHyperFamily of Neutrosophic 1596

SuperHyperStars with common Neutrosophic SuperHyperVertex SuperHyperSet. Then 1597

(i) the SuperHyperSet S = {c1 , c2 , · · · , cm } is a dual SuperHyperDefensive 1598

SuperHyperEulerian-Type-Cycle-Cut for N SHF; 1599

(ii) Γ = m for N SHF : (V, E); 1600

(iii) Γs = Σm 3
i=1 Σj=1 σj (ci ) for N SHF : (V, E); 1601

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

(iv) the SuperHyperSets S = {c1 , c2 , · · · , cm } and S ⊂ S 0 are only dual 1602

SuperHyperEulerian-Type-Cycle-Cut for N SHF : (V, E). 1603

Proposition 6.45. Let N SHF : (V, E) be an m-SuperHyperFamily of odd 1604

SuperHyperComplete SuperHyperGraphs with common Neutrosophic SuperHyperVertex 1605

SuperHyperSet. Then 1606

b n c+1
(i) the SuperHyperSet S = {vi }i=1 2
is a dual maximal SuperHyperDefensive 1607

SuperHyperEulerian-Type-Cycle-Cut for N SHF; 1608

(ii) Γ = b n2 c + 1 for N SHF : (V, E); 1609

(iii) Γs = min{Σs∈S Σ3i=1 σi (s)} 2


b n c+1 for N SHF : (V, E); 1610
S={vi }i=1

b n c+1
(iv) the SuperHyperSets S = {vi }i=1 2
are only a dual maximal 1611

SuperHyperEulerian-Type-Cycle-Cut for N SHF : (V, E). 1612

Proposition 6.46. Let N SHF : (V, E) be a m-SuperHyperFamily of even 1613

SuperHyperComplete SuperHyperGraphs with common Neutrosophic SuperHyperVertex 1614

SuperHyperSet. Then 1615

bn
2c
(i) the SuperHyperSet S = {vi }i=1 is a dual SuperHyperDefensive 1616

SuperHyperEulerian-Type-Cycle-Cut for N SHF : (V, E); 1617

(ii) Γ = b n2 c for N SHF : (V, E); 1618

(iii) Γs = min{Σs∈S Σ3i=1 σi (s)} 2


bnc for N SHF : (V, E); 1619
S={vi }i=1

bnc
(iv) the SuperHyperSets S = {vi }i=1
2
are only dual maximal SuperHyperEulerian-Type-Cycle-Cut 1620

for N SHF : (V, E). 1621

Proposition 6.47. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph. 1622

Then following statements hold; 1623

(i) if s ≥ t and a SuperHyperSet S of SuperHyperVertices is an 1624

t-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut, then S is an 1625

s-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1626

(ii) if s ≤ t and a SuperHyperSet S of SuperHyperVertices is a dual 1627

t-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut, then S is a dual 1628

s-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut. 1629

Proposition 6.48. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph. 1630

Then following statements hold; 1631

(i) if s ≥ t + 2 and a SuperHyperSet S of SuperHyperVertices is an 1632

t-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut, then S is an 1633

s-SuperHyperPowerful SuperHyperEulerian-Type-Cycle-Cut; 1634

(ii) if s ≤ t and a SuperHyperSet S of SuperHyperVertices is a dual 1635

t-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut, then S is a dual 1636

s-SuperHyperPowerful SuperHyperEulerian-Type-Cycle-Cut. 1637

Proposition 6.49. Let ESHG : (V, E) be a[an] 1638

[V-]SuperHyperUniform-strong-Neutrosophic SuperHyperGraph. Then following 1639

statements hold; 1640

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

(i) if ∀a ∈ S, |Ns (a) ∩ S| < b 2r c + 1, then ESHG : (V, E) is an 1641

2-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1642

(ii) if ∀a ∈ V \ S, |Ns (a) ∩ S| > b 2r c + 1, then ESHG : (V, E) is a dual 1643

2-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1644

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

SuperHyperEulerian-Type-Cycle-Cut; 1646

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

V-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut. 1648

Proposition 6.50. Let ESHG : (V, E) is a[an] 1649

[V-]SuperHyperUniform-strong-Neutrosophic SuperHyperGraph. Then following 1650

statements hold; 1651

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

SuperHyperEulerian-Type-Cycle-Cut; 1653

(ii) ∀a ∈ V \ S, |Ns (a) ∩ S| > b 2r c + 1 if ESHG : (V, E) is a dual 1654

2-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1655

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

SuperHyperEulerian-Type-Cycle-Cut; 1657

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

V-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut. 1659

Proposition 6.51. Let ESHG : (V, E) is a[an] 1660

[V-]SuperHyperUniform-strong-Neutrosophic SuperHyperGraph which is a 1661

SuperHyperComplete. Then following statements hold; 1662

(i) ∀a ∈ S, |Ns (a) ∩ S| < b O−1 2 c + 1 if ESHG : (V, E) is an 2-SuperHyperDefensive 1663

SuperHyperEulerian-Type-Cycle-Cut; 1664

(ii) ∀a ∈ V \ S, |Ns (a) ∩ S| > b O−1


2 c + 1 if ESHG : (V, E) is a dual 1665

2-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1666

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

SuperHyperEulerian-Type-Cycle-Cut; 1668

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

(O − 1)-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut. 1670

Proposition 6.52. Let ESHG : (V, E) is a[an] 1671

[V-]SuperHyperUniform-strong-Neutrosophic SuperHyperGraph which is a 1672

SuperHyperComplete. Then following statements hold; 1673

(i) if ∀a ∈ S, |Ns (a) ∩ S| < b O−1


2 c + 1, then ESHG : (V, E) is an 1674

2-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1675

(ii) if ∀a ∈ V \ S, |Ns (a) ∩ S| > b O−1


2 c + 1, then ESHG : (V, E) is a dual 1676

2-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1677

(iii) if ∀a ∈ S, |Ns (a) ∩ V \ S| = 0, then ESHG : (V, E) is 1678

(O − 1)-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1679

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

(O − 1)-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut. 1681

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

Proposition 6.53. Let ESHG : (V, E) is a[an] 1682

[V-]SuperHyperUniform-strong-Neutrosophic SuperHyperGraph which is 1683

SuperHyperEulerian-Type-Cycle-Cut. Then following statements hold; 1684

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

SuperHyperEulerian-Type-Cycle-Cut; 1686

(ii) ∀a ∈ V \ S, |Ns (a) ∩ S| > 2 if ESHG : (V, E) is a dual 2-SuperHyperDefensive 1687

SuperHyperEulerian-Type-Cycle-Cut; 1688

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

SuperHyperEulerian-Type-Cycle-Cut; 1690

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

2-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut. 1692

Proposition 6.54. Let ESHG : (V, E) is a[an] 1693

[V-]SuperHyperUniform-strong-Neutrosophic SuperHyperGraph which is 1694

SuperHyperEulerian-Type-Cycle-Cut. Then following statements hold; 1695

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

SuperHyperEulerian-Type-Cycle-Cut; 1697

(ii) if ∀a ∈ V \ S, |Ns (a) ∩ S| > 2, then ESHG : (V, E) is a dual 1698

2-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 1699

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

SuperHyperEulerian-Type-Cycle-Cut; 1701

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

2-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut. 1703

7 Neutrosophic Applications in Cancer’s 1704

Neutrosophic Recognition 1705

The cancer is the Neutrosophic disease but the Neutrosophic model is going to figure 1706

out what’s going on this Neutrosophic phenomenon. The special Neutrosophic case of 1707

this Neutrosophic disease is considered and as the consequences of the model, some 1708

parameters are used. The cells are under attack of this disease but the moves of the 1709

cancer in the special region are the matter of mind. The Neutrosophic recognition of the 1710

cancer could help to find some Neutrosophic treatments for this Neutrosophic disease. 1711

In the following, some Neutrosophic steps are Neutrosophic devised on this disease. 1712

Step 1. (Neutrosophic Definition) The Neutrosophic recognition of the cancer in 1713

the long-term Neutrosophic function. 1714

Step 2. (Neutrosophic Issue) The specific region has been assigned by the 1715

Neutrosophic model [it’s called Neutrosophic SuperHyperGraph] and the long 1716

Neutrosophic cycle of the move from the cancer is identified by this research. 1717

Sometimes the move of the cancer hasn’t be easily identified since there are some 1718

determinacy, indeterminacy and neutrality about the moves and the effects of the 1719

cancer on that region; this event leads us to choose another model [it’s said to be 1720

Neutrosophic SuperHyperGraph] to have convenient perception on what’s 1721

happened and what’s done. 1722

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

Figure 29. a Neutrosophic SuperHyperBipartite Associated to the Notions of Neutro-


sophic SuperHyperEulerian-Type-Cycle-Cut

Step 3. (Neutrosophic Model) There are some specific Neutrosophic models, 1723

which are well-known and they’ve got the names, and some general Neutrosophic 1724

models. The moves and the Neutrosophic traces of the cancer on the complex 1725

tracks and between complicated groups of cells could be fantasized by a 1726

Neutrosophic SuperHyperPath(-/SuperHyperEulerian-Type-Cycle-Cut, SuperHyperStar, 1727

SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to 1728

find either the Neutrosophic SuperHyperEulerian-Type-Cycle-Cut or the Neutrosophic 1729

SuperHyperEulerian-Type-Cycle-Cut in those Neutrosophic Neutrosophic 1730

SuperHyperModels. 1731

8 Case 1: The Initial Neutrosophic Steps 1732

Toward Neutrosophic SuperHyperBipartite as 1733

Neutrosophic SuperHyperModel 1734

Step 4. (Neutrosophic Solution) In the Neutrosophic Figure (29), the 1735

Neutrosophic SuperHyperBipartite is Neutrosophic highlighted and Neutrosophic 1736

featured. 1737

By using the Neutrosophic Figure (29) and the Table (4), the Neutrosophic 1738

SuperHyperBipartite is obtained. 1739

The obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in 1740

previous Neutrosophic result, of the Neutrosophic SuperHyperVertices of the 1741

connected Neutrosophic SuperHyperBipartite ESHB : (V, E), in the Neutrosophic 1742

SuperHyperModel (29), is the Neutrosophic SuperHyperEulerian-Type-Cycle-Cut. 1743

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

Table 4. The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyper-


Edges Belong to The Neutrosophic SuperHyperBipartite
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
The Values of The SuperHyperEdges The maximum Values of Its Endpoints

Figure 30. a Neutrosophic SuperHyperMultipartite Associated to the Notions of


Neutrosophic SuperHyperEulerian-Type-Cycle-Cut

9 Case 2: The Increasing Neutrosophic Steps 1744

Toward Neutrosophic SuperHyperMultipartite as 1745

Neutrosophic SuperHyperModel 1746

Step 4. (Neutrosophic Solution) In the Neutrosophic Figure (30), the 1747

Neutrosophic SuperHyperMultipartite is Neutrosophic highlighted and 1748

Neutrosophic featured. 1749

By using the Neutrosophic Figure (30) and the Table (5), the Neutrosophic 1750

SuperHyperMultipartite is obtained. 1751

The obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in 1752

previous result, of the Neutrosophic SuperHyperVertices of the connected 1753

Neutrosophic SuperHyperMultipartite ESHM : (V, E), in the Neutrosophic 1754

SuperHyperModel (30), is the Neutrosophic SuperHyperEulerian-Type-Cycle-Cut. 1755

Table 5. The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyper-


Edges Belong to The Neutrosophic SuperHyperMultipartite
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
The Values of The SuperHyperEdges The maximum Values of Its Endpoints

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

10 Wondering Open Problems But As The 1756

Directions To Forming The Motivations 1757

In what follows, some “problems” and some “questions” are proposed. 1758

The SuperHyperEulerian-Type-Cycle-Cut and the Neutrosophic 1759

SuperHyperEulerian-Type-Cycle-Cut are defined on a real-world application, titled “Cancer’s 1760

Recognitions”. 1761

Question 10.1. Which the else SuperHyperModels could be defined based on Cancer’s 1762

recognitions? 1763

Question 10.2. Are there some SuperHyperNotions related to 1764

SuperHyperEulerian-Type-Cycle-Cut and the Neutrosophic SuperHyperEulerian-Type-Cycle-Cut? 1765

Question 10.3. Are there some Algorithms to be defined on the SuperHyperModels to 1766

compute them? 1767

Question 10.4. Which the SuperHyperNotions are related to beyond the 1768

SuperHyperEulerian-Type-Cycle-Cut and the Neutrosophic SuperHyperEulerian-Type-Cycle-Cut? 1769

Problem 10.5. The SuperHyperEulerian-Type-Cycle-Cut and the Neutrosophic 1770

SuperHyperEulerian-Type-Cycle-Cut do a SuperHyperModel for the Cancer’s recognitions and 1771

they’re based on SuperHyperEulerian-Type-Cycle-Cut, are there else? 1772

Problem 10.6. Which the fundamental SuperHyperNumbers are related to these 1773

SuperHyperNumbers types-results? 1774

Problem 10.7. What’s the independent research based on Cancer’s recognitions 1775

concerning the multiple types of SuperHyperNotions? 1776

11 Conclusion and Closing Remarks 1777

In this section, concluding remarks and closing remarks are represented. The drawbacks 1778

of this research are illustrated. Some benefits and some advantages of this research are 1779

highlighted. 1780

This research uses some approaches to make Neutrosophic SuperHyperGraphs more 1781

understandable. In this endeavor, two SuperHyperNotions are defined on the 1782

SuperHyperEulerian-Type-Cycle-Cut. For that sake in the second definition, the main 1783

definition of the Neutrosophic SuperHyperGraph is redefined on the position of the 1784

alphabets. Based on the new definition for the Neutrosophic SuperHyperGraph, the 1785

new SuperHyperNotion, Neutrosophic SuperHyperEulerian-Type-Cycle-Cut, finds the 1786

convenient background to implement some results based on that. Some 1787

SuperHyperClasses and some Neutrosophic SuperHyperClasses are the cases of this 1788

research on the modeling of the regions where are under the attacks of the cancer to 1789

recognize this disease as it’s mentioned on the title “Cancer’s Recognitions”. To 1790

formalize the instances on the SuperHyperNotion, SuperHyperEulerian-Type-Cycle-Cut, the 1791

new SuperHyperClasses and SuperHyperClasses, are introduced. Some general results 1792

are gathered in the section on the SuperHyperEulerian-Type-Cycle-Cut and the Neutrosophic 1793

SuperHyperEulerian-Type-Cycle-Cut. The clarifications, instances and literature reviews have 1794

taken the whole way through. In this research, the literature reviews have fulfilled the 1795

lines containing the notions and the results. The SuperHyperGraph and Neutrosophic 1796

SuperHyperGraph are the SuperHyperModels on the “Cancer’s Recognitions” and both 1797

bases are the background of this research. Sometimes the cancer has been happened on 1798

the region, full of cells, groups of cells and embedded styles. In this segment, the 1799

SuperHyperModel proposes some SuperHyperNotions based on the connectivities of the 1800

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

moves of the cancer in the longest and strongest styles with the formation of the design 1801

and the architecture are formally called “ SuperHyperEulerian-Type-Cycle-Cut” in the themes 1802

of jargons and buzzwords. The prefix “SuperHyper” refers to the theme of the 1803

embedded styles to figure out the background for the SuperHyperNotions. In the Table

Table 6. An Overlook On This Research And Beyond


Advantages Limitations
1. Redefining Neutrosophic SuperHyperGraph 1. General Results

2. SuperHyperEulerian-Type-Cycle-Cut

3. Neutrosophic SuperHyperEulerian-Type-Cycle-Cut 2. Other SuperHyperNumbers

4. Modeling of Cancer’s Recognitions

5. SuperHyperClasses 3. SuperHyperFamilies
1804

(6), benefits and avenues for this research are, figured out, pointed out and spoken out. 1805

12 Neutrosophic SuperHyperDuality But As The 1806

Extensions Excerpt From Dense And Super 1807

Forms 1808

Definition 12.1. (Different Neutrosophic Types of Neutrosophic SuperHyperDuality). 1809

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 1810

a Neutrosophic SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and E 0 = {E1 , E2 , . . . , Ez }. Then 1811

either V 0 or E 0 is called 1812

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

such that Va ∈ Ei , Ej ; 1814

(ii) Neutrosophic re-SuperHyperDuality if ∀Ei ∈ E 0 , ∃Ej ∈ EESHG:(V,E) \ E 0 1815

such that Va ∈ Ei , Ej and 1816

|Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 1817

(iii) Neutrosophic v-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 1818

such that Vi , Vj ∈ Ea ; 1819

(iv) Neutrosophic rv-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 1820

such that Vi , Vj ∈ Ea and 1821

|Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; 1822

(v) Neutrosophic SuperHyperDuality if it’s either of Neutrosophic 1823

e-SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic 1824

v-SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality. 1825

Definition 12.2. ((Neutrosophic) SuperHyperDuality). 1826

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 1827

a Neutrosophic SuperHyperEdge (NSHE) E = {V1 , V2 , . . . , Vs }. Then E is called 1828

(i) an Extreme SuperHyperDuality if it’s either of Neutrosophic 1829

e-SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic 1830

v-SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for 1831

an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme 1832

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

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

Extreme SuperHyperEdges in the conseNeighborive Extreme sequence of Extreme 1834

SuperHyperEdges and Extreme SuperHyperVertices such that they form the 1835

Extreme SuperHyperDuality; 1836

(ii) a Neutrosophic SuperHyperDuality if it’s either of Neutrosophic 1837

e-SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic 1838

v-SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for 1839

a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic 1840

cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic 1841

SuperHyperSet S of high Neutrosophic cardinality conseNeighborive Neutrosophic 1842

SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the 1843

Neutrosophic SuperHyperDuality; 1844

(iii) an Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of 1845

Neutrosophic e-SuperHyperDuality, Neutrosophic re-SuperHyperDuality, 1846

Neutrosophic v-SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and 1847

C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme 1848

SuperHyperPolynomial contains the Extreme coefficients defined as the Extreme 1849

number of the maximum Extreme cardinality of the Extreme SuperHyperEdges of 1850

an Extreme SuperHyperSet S of high Extreme cardinality conseNeighborive 1851

Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form 1852

the Extreme SuperHyperDuality; and the Extreme power is corresponded to its 1853

Extreme coefficient; 1854

(iv) a Neutrosophic SuperHyperDuality SuperHyperPolynomial if it’s either 1855

of Neutrosophic e-SuperHyperDuality, Neutrosophic re-SuperHyperDuality, 1856

Neutrosophic v-SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and 1857

C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the 1858

Neutrosophic SuperHyperPolynomial contains the Neutrosophic coefficients 1859

defined as the Neutrosophic number of the maximum Neutrosophic cardinality of 1860

the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of high 1861

Neutrosophic cardinality conseNeighborive Neutrosophic SuperHyperEdges and 1862

Neutrosophic SuperHyperVertices such that they form the Neutrosophic 1863

SuperHyperDuality; and the Neutrosophic power is corresponded to its 1864

Neutrosophic coefficient; 1865

(v) an Extreme R-SuperHyperDuality if it’s either of Neutrosophic 1866

e-SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic 1867

v-SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for 1868

an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme 1869

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

Extreme SuperHyperVertices in the conseNeighborive Extreme sequence of 1871

Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form 1872

the Extreme SuperHyperDuality; 1873

(vi) a Neutrosophic R-SuperHyperDuality if it’s either of Neutrosophic 1874

e-SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic 1875

v-SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for 1876

a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic 1877

cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic 1878

SuperHyperSet S of high Neutrosophic cardinality conseNeighborive Neutrosophic 1879

SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the 1880

Neutrosophic SuperHyperDuality; 1881

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

(vii) an Extreme R-SuperHyperDuality SuperHyperPolynomial if it’s either 1882

of Neutrosophic e-SuperHyperDuality, Neutrosophic re-SuperHyperDuality, 1883

Neutrosophic v-SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and 1884

C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme 1885

SuperHyperPolynomial contains the Extreme coefficients defined as the Extreme 1886

number of the maximum Extreme cardinality of the Extreme SuperHyperVertices 1887

of an Extreme SuperHyperSet S of high Extreme cardinality conseNeighborive 1888

Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form 1889

the Extreme SuperHyperDuality; and the Extreme power is corresponded to its 1890

Extreme coefficient; 1891

(viii) a Neutrosophic SuperHyperDuality SuperHyperPolynomial if it’s either 1892

of Neutrosophic e-SuperHyperDuality, Neutrosophic re-SuperHyperDuality, 1893

Neutrosophic v-SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and 1894

C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the 1895

Neutrosophic SuperHyperPolynomial contains the Neutrosophic coefficients 1896

defined as the Neutrosophic number of the maximum Neutrosophic cardinality of 1897

the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S of high 1898

Neutrosophic cardinality conseNeighborive Neutrosophic SuperHyperEdges and 1899

Neutrosophic SuperHyperVertices such that they form the Neutrosophic 1900

SuperHyperDuality; and the Neutrosophic power is corresponded to its 1901

Neutrosophic coefficient. 1902

Example 12.3. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair 1903

S = (V, E) in the mentioned Neutrosophic Figures in every Neutrosophic items. 1904

• On the Figure (1), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 1905

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly 1906

straightforward. E1 and E3 are some empty Extreme SuperHyperEdges but E2 is 1907

a loop Neutrosophic SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. 1908

Thus in the terms of Neutrosophic SuperHyperNeighbor, there’s only one 1909

Neutrosophic SuperHyperEdge, namely, E4 . The Neutrosophic SuperHyperVertex, 1910

V3 is Neutrosophic isolated means that there’s no Neutrosophic SuperHyperEdge 1911

has it as a Neutrosophic endpoint. Thus the Neutrosophic SuperHyperVertex, V3 , 1912

is excluded in every given Neutrosophic SuperHyperDuality. 1913

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.

• On the Figure (2), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 1914

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly 1915

straightforward. E1 , E2 and E3 are some empty Neutrosophic SuperHyperEdges 1916

but E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of Neutrosophic 1917

SuperHyperNeighbor, there’s only one Neutrosophic SuperHyperEdge, namely, 1918

E4 . The Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means that 1919

there’s no Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. Thus 1920

the Neutrosophic SuperHyperVertex, V3 , is excluded in every given Neutrosophic 1921

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

SuperHyperDuality. 1922

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.

• On the Figure (3), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 1923

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly 1924

straightforward. 1925

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.

• On the Figure (4), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 1926

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly 1927

straightforward. 1928

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 .

• On the Figure (5), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 1929

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly 1930

straightforward. 1931

C(N SHG)Neutrosophic SuperHyperDuality = {E3 }.


C(N SHG)Neutrosophic SuperHyperDuality SuperHyperPolynomial = 4z.
C(N SHG)Neutrosophic R-SuperHyperDuality = {V5 }.
C(N SHG)Neutrosophic R-SuperHyperDuality SuperHyperPolynomial = z.

• On the Figure (6), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 1932

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly 1933

straightforward. 1934

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 R-SuperHyperDuality SuperHyperPolynomial = 6z 8 .

• On the Figure (7), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 1935

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly 1936

straightforward. 1937

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 .

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

• On the Figure (8), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 1938

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly 1939

straightforward. 1940

C(N SHG)Neutrosophic SuperHyperDuality = {E4 }.


C(N SHG)Neutrosophic SuperHyperDuality SuperHyperPolynomial = z.
C(N SHG)Neutrosophic R-SuperHyperDuality = {V3 , V13 , V8 }.
C(N SHG)Neutrosophic R-SuperHyperDuality SuperHyperPolynomial =
4 × 5 × 5z 3 .

• On the Figure (9), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 1941

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly 1942

straightforward. 1943

C(N SHG)Neutrosophic SuperHyperDuality = {E3i+13i=0 , E23 }.


C(N SHG)Neutrosophic SuperHyperDuality SuperHyperPolynomial = 3z 5 .
C(N SHG)Neutrosophic R-SuperHyperDuality = {V3i+13i=0 , V15 }.
C(N SHG)Neutrosophic R-SuperHyperDuality SuperHyperPolynomial = 3z 5 .

• On the Figure (10), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 1944

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly 1945

straightforward. 1946

C(N SHG)Neutrosophic SuperHyperDuality = {E5 }.


C(N SHG)Neutrosophic SuperHyperDuality SuperHyperPolynomial = z.
C(N SHG)Neutrosophic R-SuperHyperDuality = {V3 , V13 , V8 }.
C(N SHG)Neutrosophic R-SuperHyperDuality SuperHyperPolynomial =
4 × 5 × 5z 3 .

• On the Figure (11), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 1947

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly 1948

straightforward. 1949

C(N SHG)Neutrosophic SuperHyperDuality = {E1 , E3 }.


C(N SHG)Neutrosophic SuperHyperDuality SuperHyperPolynomial = z 2 .
C(N SHG)Neutrosophic R-SuperHyperDuality = {V6 , V1 }.
C(N SHG)Neutrosophic R-SuperHyperDuality SuperHyperPolynomial =
3 × 3z 2 .

• On the Figure (12), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 1950

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly 1951

straightforward. 1952

C(N SHG)Neutrosophic SuperHyperDuality = {E1 }.


C(N SHG)Neutrosophic SuperHyperDuality SuperHyperPolynomial = z.
C(N SHG)Neutrosophic R-SuperHyperDuality = {V1 , Vii610=5,7,8 }.
i=4

C(N SHG)Neutrosophic R-SuperHyperDuality SuperHyperPolynomial = 5z 5 .

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

• On the Figure (13), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 1953

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly 1954

straightforward. 1955

C(N SHG)Neutrosophic SuperHyperDuality = {E5 , E9 }.


C(N SHG)Neutrosophic SuperHyperDuality SuperHyperPolynomial = z 2 .
C(N SHG)Neutrosophic R-SuperHyperDuality = {V1 , V6 }.
C(N SHG)Neutrosophic R-SuperHyperDuality SuperHyperPolynomial =
3 × 3z 2 .

• On the Figure (14), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 1956

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly 1957

straightforward. 1958

C(N SHG)Neutrosophic SuperHyperDuality = {E1 }.


C(N SHG)Neutrosophic SuperHyperDuality SuperHyperPolynomial = 2z.
C(N SHG)Neutrosophic R-SuperHyperDuality = {V1 }.
C(N SHG)Neutrosophic R-SuperHyperDuality SuperHyperPolynomial = z.

• On the Figure (15), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 1959

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly 1960

straightforward. 1961

C(N SHG)Neutrosophic SuperHyperDuality = {E2 , E5 }.


C(N SHG)Neutrosophic SuperHyperDuality SuperHyperPolynomial = 3z 2 .
C(N SHG)Neutrosophic R-SuperHyperDuality = {V1 , V4 }.
C(N SHG)Neutrosophic R-SuperHyperDuality SuperHyperPolynomial = z.

• On the Figure (16), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 1962

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly 1963

straightforward. 1964

C(N SHG)Neutrosophic SuperHyperDuality = {E2 , E5 }.


C(N SHG)Neutrosophic SuperHyperDuality SuperHyperPolynomial = 3z 2 .
C(N SHG)Neutrosophic R-SuperHyperDuality = {V1 , V4 }.
C(N SHG)Neutrosophic R-SuperHyperDuality SuperHyperPolynomial =
(2 × 1 × 2) + (2 × 4 × 5)z.

• On the Figure (17), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 1965

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly 1966

straightforward. 1967

C(N SHG)Neutrosophic SuperHyperDuality = {E2 , E5 }.


C(N SHG)Neutrosophic SuperHyperDuality SuperHyperPolynomial = 3z 2 .
C(N SHG)Neutrosophic R-SuperHyperDuality = {V1 , V4 }.
C(N SHG)Neutrosophic R-SuperHyperDuality SuperHyperPolynomial =
(1 × 1 × 2)z.

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

• On the Figure (18), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 1968

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly 1969

straightforward. 1970

C(N SHG)Neutrosophic SuperHyperDuality = {E2 , E5 }.


C(N SHG)Neutrosophic SuperHyperDuality SuperHyperPolynomial = 3z 2 .
C(N SHG)Neutrosophic R-SuperHyperDuality = {V1 , V4 }.
C(N SHG)Neutrosophic R-SuperHyperDuality SuperHyperPolynomial =
(2 × 2 × 2)z.

• On the Figure (19), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 1971

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly 1972

straightforward. 1973

C(N SHG)Neutrosophic SuperHyperDuality = {E3i+1i=03 }.


C(N SHG)Neutrosophic SuperHyperDuality SuperHyperPolynomial = 3z 4 .
C(N SHG)Neutrosophic R-SuperHyperDuality = {V2i+1i=05 }.
C(N SHG)Neutrosophic R-SuperHyperDuality SuperHyperPolynomial = 2z 6 .

• On the Figure (20), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 1974

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly 1975

straightforward. 1976

C(N SHG)Neutrosophic SuperHyperDuality = {E6 }.


C(N SHG)Neutrosophic SuperHyperDuality SuperHyperPolynomial = 10z.
C(N SHG)Neutrosophic R-SuperHyperDuality = {V1 }.
C(N SHG)Neutrosophic R-SuperHyperDuality SuperHyperPolynomial = z.

• On the Figure (21), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 1977

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly 1978

straightforward. 1979

C(N SHG)Neutrosophic SuperHyperDuality = {E2 }.


C(N SHG)Neutrosophic SuperHyperDuality SuperHyperPolynomial = 2z.
C(N SHG)Neutrosophic R-SuperHyperDuality = {V1 }.
C(N SHG)Neutrosophic R-SuperHyperDuality SuperHyperPolynomial = 10z.

• On the Figure (22), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 1980

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly 1981

straightforward. 1982

C(N SHG)Neutrosophic SuperHyperDuality = {E3 , E4 }.


C(N SHG)Neutrosophic SuperHyperDuality SuperHyperPolynomial = 4z 2 .
C(N SHG)Neutrosophic R-SuperHyperDuality = {V3 , V6 }.
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 1983

Neutrosophic SuperHyperClasses. 1984

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

Proposition 12.4. Assume a connected Neutrosophic SuperHyperPath 1985

ESHP : (V, E). Then 1986

C(N SHG)Neutrosophic SuperHyperDuality =


|EESHG:(V,E) |Neutrosophic Cardinality

= {Ei }i=1 3
.
C(N SHG)Neutrosophic SuperHyperDuality SuperHyperPolynomial
|EESHG:(V,E) |Neutrosophic Cardinality
= 3z 3 .
C(N SHG)Neutrosophic R-SuperHyperDuality
|EESHG:(V,E) |Neutrosophic Cardinality

= {ViEXT ERN AL }i=1 3


.
C(N SHG)Neutrosophic R-SuperHyperDuality SuperHyperPolynomial
Y |EESHG:(V,E) |Neutrosophic Cardinality
= |V EXT ERN AL ESHG:(V,E) |Neutrosophic Cardinality z 3 .

Proof. Let 1987

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

be a longest path taken from a connected Neutrosophic SuperHyperPath 1988

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

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 1990

corresponded to ViEXT ERN AL in the literatures of SuperHyperDuality. The latter is 1991

straightforward. 1992

Example 12.5. In the Figure (23), the connected Neutrosophic SuperHyperPath 1993

ESHP : (V, E), is highlighted and featured. The Neutrosophic SuperHyperSet, in the 1994

Neutrosophic SuperHyperModel (23), is the SuperHyperDuality. 1995

Proposition 12.6. Assume a connected Neutrosophic SuperHyperCycle 1996

ESHC : (V, E). Then 1997

C(N SHG)Neutrosophic SuperHyperDuality =


|EESHG:(V,E) |Neutrosophic Cardinality

= {Ei }i=1 3
.
C(N SHG)Neutrosophic SuperHyperDuality SuperHyperPolynomial
|EESHG:(V,E) |Neutrosophic Cardinality
= 3z 3 .
C(N SHG)Neutrosophic R-SuperHyperDuality
|EESHG:(V,E) |Neutrosophic Cardinality

= {ViEXT ERN AL }i=1 3


.
C(N SHG)Neutrosophic R-SuperHyperDuality SuperHyperPolynomial
Y |EESHG:(V,E) |Neutrosophic Cardinality
= |V EXT ERN AL ESHG:(V,E) |Neutrosophic Cardinality z 3 .

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

Proof. Let 1998

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

be a longest path taken from a connected Neutrosophic SuperHyperCycle 1999

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

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 2001

corresponded to ViEXT ERN AL in the literatures of SuperHyperDuality. The latter is 2002

straightforward. 2003

Example 12.7. In the Figure (24), the connected Neutrosophic SuperHyperCycle 2004

N SHC : (V, E), is highlighted and featured. The obtained Neutrosophic 2005

SuperHyperSet, in the Neutrosophic SuperHyperModel (24), is the Neutrosophic 2006

SuperHyperDuality. 2007

Proposition 12.8. Assume a connected Neutrosophic SuperHyperStar ESHS : (V, E). 2008

Then 2009

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 2010

P : ViEXT ERN AL , Ei , CEN T ER, VjEXT ERN AL .

be a longest path taken a connected Neutrosophic SuperHyperStar ESHS : (V, E). 2011

There’s a new way to redefine as 2012

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 2013

corresponded to ViEXT ERN AL in the literatures of SuperHyperDuality. The latter is 2014

straightforward. 2015

Example 12.9. In the Figure (25), the connected Neutrosophic SuperHyperStar 2016

ESHS : (V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, 2017

by the Algorithm in previous Neutrosophic result, of the Neutrosophic 2018

SuperHyperVertices of the connected Neutrosophic SuperHyperStar ESHS : (V, E), in 2019

the Neutrosophic SuperHyperModel (25), is the Neutrosophic SuperHyperDuality. 2020

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

Proposition 12.10. Assume a connected Neutrosophic SuperHyperBipartite 2021

ESHB : (V, E). Then 2022

C(N SHG)Neutrosophic Quasi-SuperHyperDuality


= {Ei ∈ EPi ESHG:(V,E) , |Pi ESHG:(V,E) | = min |Pi ESHG:(V,E) ∈ P ESHG:(V,E) |}.
i
C(N SHG)Neutrosophic Quasi-SuperHyperDuality SuperHyperPolynomial
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
C(N SHG)Neutrosophic Quasi-SuperHyperDuality
= {ViEXT ERN AL ∈ VPEXT
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-SuperHyperDuality SuperHyperPolynomial


X X
= =( (|Pi ESHG:(V,E) |choose 2) = z 2 .
EXT ERN AL |
|VESHG:(V,E) i=|P ESHG:(V,E) |
Neutrosophic Cardinality

Proof. Let 2023

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

is a longest path taken from a connected Neutrosophic SuperHyperBipartite 2024

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

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 2026

corresponded to ViEXT ERN AL in the literatures of SuperHyperDuality. The latter is 2027

straightforward. Then there’s at least one SuperHyperDuality. Thus the notion of quasi 2028

isn’t up and the SuperHyperNotions based on SuperHyperDuality could be applied. 2029

There are only two SuperHyperParts. Thus every SuperHyperPart could have one 2030

SuperHyperVertex as the representative in the 2031

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

is a longest SuperHyperDuality taken from a connected Neutrosophic 2032

SuperHyperBipartite ESHB : (V, E). Thus only some SuperHyperVertices and only 2033

minimum-Neutrosophic-of-SuperHyperPart SuperHyperEdges are attained in any 2034

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

solution 2035

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

The latter is straightforward. 2036

Example 12.11. In the Neutrosophic Figure (26), the connected Neutrosophic 2037

SuperHyperBipartite ESHB : (V, E), is Neutrosophic highlighted and Neutrosophic 2038

featured. The obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in 2039

previous Neutrosophic result, of the Neutrosophic SuperHyperVertices of the connected 2040

Neutrosophic SuperHyperBipartite ESHB : (V, E), in the Neutrosophic 2041

SuperHyperModel (26), is the Neutrosophic SuperHyperDuality. 2042

Proposition 12.12. Assume a connected Neutrosophic SuperHyperMultipartite 2043

ESHM : (V, E). Then 2044

C(N SHG)Neutrosophic Quasi-SuperHyperDuality


= {Ei ∈ EPi ESHG:(V,E) , |Pi ESHG:(V,E) | = min |Pi ESHG:(V,E) ∈ P ESHG:(V,E) |}.
i
C(N SHG)Neutrosophic Quasi-SuperHyperDuality SuperHyperPolynomial
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
C(N SHG)Neutrosophic Quasi-SuperHyperDuality
= {ViEXT ERN AL ∈ VPEXT
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-SuperHyperDuality SuperHyperPolynomial


X X
= =( (|Pi ESHG:(V,E) |choose 2) = z 2 .
EXT ERN AL |
|VESHG:(V,E) i=|P ESHG:(V,E) |
Neutrosophic Cardinality

Proof. Let 2045

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

is a longest SuperHyperDuality taken from a connected Neutrosophic 2046

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

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 2048

corresponded to ViEXT ERN AL in the literatures of SuperHyperDuality. The latter is 2049

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

straightforward. Then there’s at least one SuperHyperDuality. Thus the notion of quasi 2050

isn’t up and the SuperHyperNotions based on SuperHyperDuality could be applied. 2051

There are only z 0 SuperHyperParts. Thus every SuperHyperPart could have one 2052

SuperHyperVertex as the representative in the 2053

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

is a longest path taken from a connected Neutrosophic SuperHyperMultipartite 2054

ESHM : (V, E). Thus only some SuperHyperVertices and only 2055

minimum-Neutrosophic-of-SuperHyperPart SuperHyperEdges are attained in any 2056

solution 2057

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

is a longest path taken from a connected Neutrosophic SuperHyperMultipartite 2058

ESHM : (V, E). The latter is straightforward. 2059

Example 12.13. In the Figure (27), the connected Neutrosophic 2060

SuperHyperMultipartite ESHM : (V, E), is highlighted and Neutrosophic featured. 2061

The obtained Neutrosophic SuperHyperSet, by the Algorithm in previous Neutrosophic 2062

result, of the Neutrosophic SuperHyperVertices of the connected Neutrosophic 2063

SuperHyperMultipartite ESHM : (V, E), in the Neutrosophic SuperHyperModel (27), 2064

is the Neutrosophic SuperHyperDuality. 2065

Proposition 12.14. Assume a connected Neutrosophic SuperHyperWheel 2066

ESHW : (V, E). Then, 2067

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 2068

P :
V1EXT ERN AL , E1∗ ,
V2EXT ERN AL , E2∗ ,
...,
∗ EXT ERN AL
E|E ∗ | , V|E ∗ |Neutrosophic Cardinality +1
ESHG:(V,E) Neutrosophic Cardinality ESHG:(V,E)

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

is a longest SuperHyperDuality taken from a connected Neutrosophic SuperHyperWheel 2069

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

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 2071

corresponded to ViEXT ERN AL in the literatures of SuperHyperDuality. The latter is 2072

straightforward. Then there’s at least one SuperHyperDuality. Thus the notion of quasi 2073

isn’t up and the SuperHyperNotions based on SuperHyperDuality could be applied. 2074

The unique embedded SuperHyperDuality proposes some longest SuperHyperDuality 2075

excerpt from some representatives. The latter is straightforward. 2076

Example 12.15. In the Neutrosophic Figure (28), the connected Neutrosophic 2077

SuperHyperWheel N SHW : (V, E), is Neutrosophic highlighted and featured. The 2078

obtained Neutrosophic SuperHyperSet, by the Algorithm in previous result, of the 2079

Neutrosophic SuperHyperVertices of the connected Neutrosophic SuperHyperWheel 2080

ESHW : (V, E), in the Neutrosophic SuperHyperModel (28), is the Neutrosophic 2081

SuperHyperDuality. 2082

13 Neutrosophic SuperHyperJoin But As The 2083

Extensions Excerpt From Dense And Super 2084

Forms 2085

Definition 13.1. (Different Neutrosophic Types of Neutrosophic SuperHyperJoin). 2086

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 2087

a Neutrosophic SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and E 0 = {E1 , E2 , . . . , Ez }. Then 2088

either V 0 or E 0 is called 2089

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

that Va ∈ Ei , Ej ; and ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; 2091

(ii) Neutrosophic re-SuperHyperJoin if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , 2092

such that Va ∈ Ei , Ej ; ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; and 2093

|Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 2094

(iii) Neutrosophic v-SuperHyperJoin if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such 2095

that Vi , Vj 6∈ Ea ; and ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; 2096

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

that Vi , Vj ∈ Ea ; ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; and 2098

|Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; 2099

(v) Neutrosophic SuperHyperJoin if it’s either of Neutrosophic 2100

e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic 2101

v-SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin. 2102

Definition 13.2. ((Neutrosophic) SuperHyperJoin). 2103

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 2104

a Neutrosophic SuperHyperEdge (NSHE) E = {V1 , V2 , . . . , Vs }. Then E is called 2105

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

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

Neutrosophic re-SuperHyperJoin, Neutrosophic v-SuperHyperJoin, and 2107

Neutrosophic rv-SuperHyperJoin and C(N SHG) for an Extreme 2108

SuperHyperGraph N SHG : (V, E) is the maximum Extreme cardinality of an 2109

Extreme SuperHyperSet S of high Extreme cardinality of the Extreme 2110

SuperHyperEdges in the conseNeighborive Extreme sequence of Extreme 2111

SuperHyperEdges and Extreme SuperHyperVertices such that they form the 2112

Extreme SuperHyperJoin; 2113

(ii) a Neutrosophic SuperHyperJoin if it’s either of Neutrosophic 2114

e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic 2115

v-SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for a 2116

Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic 2117

cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic 2118

SuperHyperSet S of high Neutrosophic cardinality conseNeighborive Neutrosophic 2119

SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the 2120

Neutrosophic SuperHyperJoin; 2121

(iii) an Extreme SuperHyperJoin SuperHyperPolynomial if it’s either of 2122

Neutrosophic e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic 2123

v-SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for an 2124

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

SuperHyperPolynomial contains the Extreme coefficients defined as the Extreme 2126

number of the maximum Extreme cardinality of the Extreme SuperHyperEdges of 2127

an Extreme SuperHyperSet S of high Extreme cardinality conseNeighborive 2128

Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form 2129

the Extreme SuperHyperJoin; and the Extreme power is corresponded to its 2130

Extreme coefficient; 2131

(iv) a Neutrosophic SuperHyperJoin SuperHyperPolynomial if it’s either of 2132

Neutrosophic e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic 2133

v-SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for a 2134

Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic 2135

SuperHyperPolynomial contains the Neutrosophic coefficients defined as the 2136

Neutrosophic number of the maximum Neutrosophic cardinality of the 2137

Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of high 2138

Neutrosophic cardinality conseNeighborive Neutrosophic SuperHyperEdges and 2139

Neutrosophic SuperHyperVertices such that they form the Neutrosophic 2140

SuperHyperJoin; and the Neutrosophic power is corresponded to its Neutrosophic 2141

coefficient; 2142

(v) an Extreme R-SuperHyperJoin if it’s either of Neutrosophic 2143

e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic 2144

v-SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for an 2145

Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme cardinality 2146

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

SuperHyperVertices in the conseNeighborive Extreme sequence of Extreme 2148

SuperHyperEdges and Extreme SuperHyperVertices such that they form the 2149

Extreme SuperHyperJoin; 2150

(vi) a Neutrosophic R-SuperHyperJoin if it’s either of Neutrosophic 2151

e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic 2152

v-SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for a 2153

Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic 2154

cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic 2155

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

SuperHyperSet S of high Neutrosophic cardinality conseNeighborive Neutrosophic 2156

SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the 2157

Neutrosophic SuperHyperJoin; 2158

(vii) an Extreme R-SuperHyperJoin SuperHyperPolynomial if it’s either of 2159

Neutrosophic e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic 2160

v-SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for an 2161

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

SuperHyperPolynomial contains the Extreme coefficients defined as the Extreme 2163

number of the maximum Extreme cardinality of the Extreme SuperHyperVertices 2164

of an Extreme SuperHyperSet S of high Extreme cardinality conseNeighborive 2165

Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form 2166

the Extreme SuperHyperJoin; and the Extreme power is corresponded to its 2167

Extreme coefficient; 2168

(viii) a Neutrosophic SuperHyperJoin SuperHyperPolynomial if it’s either of 2169

Neutrosophic e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic 2170

v-SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for a 2171

Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic 2172

SuperHyperPolynomial contains the Neutrosophic coefficients defined as the 2173

Neutrosophic number of the maximum Neutrosophic cardinality of the 2174

Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S of high 2175

Neutrosophic cardinality conseNeighborive Neutrosophic SuperHyperEdges and 2176

Neutrosophic SuperHyperVertices such that they form the Neutrosophic 2177

SuperHyperJoin; and the Neutrosophic power is corresponded to its Neutrosophic 2178

coefficient. 2179

Example 13.3. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair 2180

S = (V, E) in the mentioned Neutrosophic Figures in every Neutrosophic items. 2181

• On the Figure (1), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 2182

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly 2183

straightforward. E1 and E3 are some empty Neutrosophic SuperHyperEdges but 2184

E2 is a loop Neutrosophic SuperHyperEdge and E4 is a Neutrosophic 2185

SuperHyperEdge. Thus in the terms of Neutrosophic SuperHyperNeighbor, 2186

there’s only one Neutrosophic SuperHyperEdge, namely, E4 . The Neutrosophic 2187

SuperHyperVertex, V3 is Neutrosophic isolated means that there’s no 2188

Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. Thus the 2189

Neutrosophic SuperHyperVertex, V3 , is excluded in every given Neutrosophic 2190

SuperHyperJoin. 2191

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 .

• On the Figure (2), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 2192

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly 2193

straightforward. E1 , E2 and E3 are some empty Neutrosophic SuperHyperEdges 2194

but E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of Neutrosophic 2195

SuperHyperNeighbor, there’s only one Neutrosophic SuperHyperEdge, namely, 2196

E4 . The Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means that 2197

there’s no Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. Thus 2198

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

the Neutrosophic SuperHyperVertex, V3 , is excluded in every given Neutrosophic 2199

SuperHyperJoin. 2200

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 .

• On the Figure (3), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 2201

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly 2202

straightforward. 2203

C(N SHG)Neutrosophic SuperHyperJoin = {E4 }.


C(N SHG)Neutrosophic SuperHyperJoin SuperHyperPolynomial = z.
C(N SHG)Neutrosophic R-SuperHyperJoin = {V1 , V2 , V3 }.
C(N SHG)Neutrosophic R-SuperHyperJoin SuperHyperPolynomial = z 3 .

• On the Figure (4), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 2204

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly 2205

straightforward. 2206

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 .

• On the Figure (5), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 2207

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly 2208

straightforward. 2209

C(N SHG)Neutrosophic SuperHyperJoin = {E3 }.


C(N SHG)Neutrosophic SuperHyperJoin SuperHyperPolynomial = 4z.
C(N SHG)Neutrosophic R-SuperHyperJoin = {V5 }.
C(N SHG)Neutrosophic R-SuperHyperJoin SuperHyperPolynomial = z.

• On the Figure (6), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 2210

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly 2211

straightforward. 2212

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 R-SuperHyperJoin SuperHyperPolynomial = 6z 8 .

• On the Figure (7), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 2213

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly 2214

straightforward. 2215

C(N SHG)Neutrosophic SuperHyperJoin = {E15 , E16 , E17 }.


C(N SHG)Neutrosophic SuperHyperJoin SuperHyperPolynomial = z 3 .
C(N SHG)Neutrosophic R-SuperHyperJoin = {V3 , V13 , V8 }.
C(N SHG)Neutrosophic R-SuperHyperJoin SuperHyperPolynomial =
4 × 5 × 5z 3 .

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

• On the Figure (8), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 2216

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly 2217

straightforward. 2218

C(N SHG)Neutrosophic SuperHyperJoin = {E4 }.


C(N SHG)Neutrosophic SuperHyperJoin SuperHyperPolynomial = z.
C(N SHG)Neutrosophic R-SuperHyperJoin = {V3 , V13 , V8 }.
C(N SHG)Neutrosophic R-SuperHyperJoin SuperHyperPolynomial =
4 × 5 × 5z 3 .

• On the Figure (9), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 2219

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly 2220

straightforward. 2221

C(N SHG)Neutrosophic SuperHyperJoin = {E3i+13i=0 , E23 }.


C(N SHG)Neutrosophic SuperHyperJoin SuperHyperPolynomial = 3z 5 .
C(N SHG)Neutrosophic R-SuperHyperJoin = {V3i+13i=0 , V15 }.
C(N SHG)Neutrosophic R-SuperHyperJoin SuperHyperPolynomial = 3z 5 .

• On the Figure (10), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 2222

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly 2223

straightforward. 2224

C(N SHG)Neutrosophic SuperHyperJoin = {E5 }.


C(N SHG)Neutrosophic SuperHyperJoin SuperHyperPolynomial = z.
C(N SHG)Neutrosophic R-SuperHyperJoin = {V3 , V13 , V8 }.
C(N SHG)Neutrosophic R-SuperHyperJoin SuperHyperPolynomial =
4 × 5 × 5z 3 .

• On the Figure (11), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 2225

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly 2226

straightforward. 2227

C(N SHG)Neutrosophic SuperHyperJoin = {E1 , E3 }.


C(N SHG)Neutrosophic SuperHyperJoin SuperHyperPolynomial = z 2 .
C(N SHG)Neutrosophic R-SuperHyperJoin = {V6 , V1 }.
C(N SHG)Neutrosophic R-SuperHyperJoin SuperHyperPolynomial =
3 × 3z 2 .

• On the Figure (12), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 2228

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly 2229

straightforward. 2230

C(N SHG)Neutrosophic SuperHyperJoin = {E1 }.


C(N SHG)Neutrosophic SuperHyperJoin SuperHyperPolynomial = z.
C(N SHG)Neutrosophic R-SuperHyperJoin = {V1 , Vii610=5,7,8 }.
i=4

C(N SHG)Neutrosophic R-SuperHyperJoin SuperHyperPolynomial = 5z 5 .

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

• On the Figure (13), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 2231

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly 2232

straightforward. 2233

C(N SHG)Neutrosophic SuperHyperJoin = {E3 , E9 }.


C(N SHG)Neutrosophic SuperHyperJoin SuperHyperPolynomial = z 2 .
C(N SHG)Neutrosophic R-SuperHyperJoin = {V1 , V6 }.
C(N SHG)Neutrosophic R-SuperHyperJoin SuperHyperPolynomial =
3 × 3z 2 .

• On the Figure (14), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 2234

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly 2235

straightforward. 2236

C(N SHG)Neutrosophic SuperHyperJoin = {E1 }.


C(N SHG)Neutrosophic SuperHyperJoin SuperHyperPolynomial = 2z.
C(N SHG)Neutrosophic R-SuperHyperJoin = {V1 }.
C(N SHG)Neutrosophic R-SuperHyperJoin SuperHyperPolynomial = z.

• On the Figure (15), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 2237

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly 2238

straightforward. 2239

C(N SHG)Neutrosophic SuperHyperJoin = {E2 , E5 }.


C(N SHG)Neutrosophic SuperHyperJoin SuperHyperPolynomial = 3z 2 .
C(N SHG)Neutrosophic R-SuperHyperJoin = {V1 , V4 }.
C(N SHG)Neutrosophic R-SuperHyperJoin SuperHyperPolynomial = z.

• On the Figure (16), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 2240

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly 2241

straightforward. 2242

C(N SHG)Neutrosophic SuperHyperJoin = {E2 , E5 }.


C(N SHG)Neutrosophic SuperHyperJoin SuperHyperPolynomial = 3z 2 .
C(N SHG)Neutrosophic R-SuperHyperJoin = {V2 , V7 , V17 }.
C(N SHG)Neutrosophic R-SuperHyperJoin SuperHyperPolynomial =
(1 × 5 × 5) + (1 × 2 + 1)z 3 .

• On the Figure (17), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 2243

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly 2244

straightforward. 2245

C(N SHG)Neutrosophic SuperHyperJoin = {E2 , E5 }.


C(N SHG)Neutrosophic SuperHyperJoin SuperHyperPolynomial = 3z 2 .
C(N SHG)Neutrosophic R-SuperHyperJoin = {V27 , V2 , V7 , V17 }.
C(N SHG)Neutrosophic R-SuperHyperJoin SuperHyperPolynomial =
(1 × 1 × 2 + 1)z 4 .

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

• On the Figure (18), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 2246

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly 2247

straightforward. 2248

C(N SHG)Neutrosophic SuperHyperJoin = {E2 , E5 }.


C(N SHG)Neutrosophic SuperHyperJoin SuperHyperPolynomial = 3z 2 .
C(N SHG)Neutrosophic R-SuperHyperJoin = {V27 , V2 , V7 , V17 }.
C(N SHG)Neutrosophic R-SuperHyperJoin SuperHyperPolynomial =
(1 × 1 × 2 + 1)z 4 .

• On the Figure (19), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 2249

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly 2250

straightforward. 2251

C(N SHG)Neutrosophic SuperHyperJoin = {E3i+1i=03 }.


C(N SHG)Neutrosophic SuperHyperJoin SuperHyperPolynomial = 3z 4 .
C(N SHG)Neutrosophic R-SuperHyperJoin = {V2i+1i=05 }.
C(N SHG)Neutrosophic R-SuperHyperJoin SuperHyperPolynomial = 2z 6 .

• On the Figure (20), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 2252

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly 2253

straightforward. 2254

C(N SHG)Neutrosophic SuperHyperJoin = {E6 }.


C(N SHG)Neutrosophic SuperHyperJoin SuperHyperPolynomial = 10z.
C(N SHG)Neutrosophic R-SuperHyperJoin = {V1 }.
C(N SHG)Neutrosophic R-SuperHyperJoin SuperHyperPolynomial = z.

• On the Figure (21), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 2255

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly 2256

straightforward. 2257

C(N SHG)Neutrosophic SuperHyperJoin = {E2 }.


C(N SHG)Neutrosophic SuperHyperJoin SuperHyperPolynomial = 2z.
C(N SHG)Neutrosophic R-SuperHyperJoin = {V1 }.
C(N SHG)Neutrosophic R-SuperHyperJoin SuperHyperPolynomial = 10z.

• On the Figure (22), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 2258

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly 2259

straightforward. 2260

C(N SHG)Neutrosophic SuperHyperJoin = {E2 , E4 }.


C(N SHG)Neutrosophic SuperHyperJoin SuperHyperPolynomial = 3z 2 .
C(N SHG)Neutrosophic R-SuperHyperJoin = {V3 , V6 }.
C(N SHG)Neutrosophic R-SuperHyperJoin SuperHyperPolynomial
= 10 × 6 + 10 × 6 + 12 × 6 + 12 × 6z 2 .

The previous Neutrosophic approach apply on the upcoming Neutrosophic results on 2261

Neutrosophic SuperHyperClasses. 2262

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

Proposition 13.4. Assume a connected Neutrosophic SuperHyperPath 2263

ESHP : (V, E). Then 2264

C(N SHG)Neutrosophic SuperHyperJoin =


|EESHG:(V,E) |Neutrosophic Cardinality

= {Ei }i=1 3
.
C(N SHG)Neutrosophic SuperHyperJoin SuperHyperPolynomial
|EESHG:(V,E) |Neutrosophic Cardinality
= 3z 3 .
C(N SHG)Neutrosophic R-SuperHyperJoin
|EESHG:(V,E) |Neutrosophic Cardinality

= {ViEXT ERN AL }i=1 3


.
C(N SHG)Neutrosophic R-SuperHyperJoin SuperHyperPolynomial
Y |EESHG:(V,E) |Neutrosophic Cardinality
= |V EXT ERN AL ESHG:(V,E) |Neutrosophic Cardinality z 3 .

Proof. Let 2265

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

be a longest path taken from a connected Neutrosophic SuperHyperPath 2266

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

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 2268

corresponded to ViEXT ERN AL in the literatures of SuperHyperJoin. The latter is 2269

straightforward. 2270

Example 13.5. In the Figure (23), the connected Neutrosophic SuperHyperPath 2271

ESHP : (V, E), is highlighted and featured. The Neutrosophic SuperHyperSet, in the 2272

Neutrosophic SuperHyperModel (23), is the SuperHyperJoin. 2273

Proposition 13.6. Assume a connected Neutrosophic SuperHyperCycle 2274

ESHC : (V, E). Then 2275

C(N SHG)Neutrosophic SuperHyperJoin =


|EESHG:(V,E) |Neutrosophic Cardinality

= {Ei }i=1 3
.
C(N SHG)Neutrosophic SuperHyperJoin SuperHyperPolynomial
|EESHG:(V,E) |Neutrosophic Cardinality
= 3z 3 .
C(N SHG)Neutrosophic R-SuperHyperJoin
|EESHG:(V,E) |Neutrosophic Cardinality

= {ViEXT ERN AL }i=1 3


.
C(N SHG)Neutrosophic R-SuperHyperJoin SuperHyperPolynomial
Y |EESHG:(V,E) |Neutrosophic Cardinality
= |V EXT ERN AL ESHG:(V,E) |Neutrosophic Cardinality z 3 .

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

Proof. Let 2276

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

be a longest path taken from a connected Neutrosophic SuperHyperCycle 2277

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

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 2279

corresponded to ViEXT ERN AL in the literatures of SuperHyperJoin. The latter is 2280

straightforward. 2281

Example 13.7. In the Figure (24), the connected Neutrosophic SuperHyperCycle 2282

N SHC : (V, E), is highlighted and featured. The obtained Neutrosophic 2283

SuperHyperSet, in the Neutrosophic SuperHyperModel (24), is the Neutrosophic 2284

SuperHyperJoin. 2285

Proposition 13.8. Assume a connected Neutrosophic SuperHyperStar ESHS : (V, E). 2286

Then 2287

C(N SHG)Neutrosophic Quasi-SuperHyperJoin = {E ∈ EESHG:(V,E) }.


C(N SHG)Neutrosophic Quasi-SuperHyperJoin SuperHyperPolynomial
= |i | Ei ∈ EESHG:(V,E)|Neutrosophic Cardinality |z.
C(N SHG)Neutrosophic R-Quasi-SuperHyperJoin = {CEN T ER ∈ VESHG:(V,E) }.
C(N SHG)Neutrosophic R-Quasi-SuperHyperJoin SuperHyperPolynomial = z.

Proof. Let 2288

P : ViEXT ERN AL , Ei , CEN T ER, VjEXT ERN AL .

be a longest path taken a connected Neutrosophic SuperHyperStar ESHS : (V, E). 2289

There’s a new way to redefine as 2290

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 2291

corresponded to ViEXT ERN AL in the literatures of SuperHyperJoin. The latter is 2292

straightforward. 2293

Example 13.9. In the Figure (25), the connected Neutrosophic SuperHyperStar 2294

ESHS : (V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, 2295

by the Algorithm in previous Neutrosophic result, of the Neutrosophic 2296

SuperHyperVertices of the connected Neutrosophic SuperHyperStar ESHS : (V, E), in 2297

the Neutrosophic SuperHyperModel (25), is the Neutrosophic SuperHyperJoin. 2298

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

Proposition 13.10. Assume a connected Neutrosophic SuperHyperBipartite 2299

ESHB : (V, E). Then 2300

C(N SHG)Neutrosophic 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
C(N SHG)Neutrosophic Quasi-SuperHyperJoin
= (OTHERWISE).
{},
If ∃Pi ESHG:(V,E) , |Pi ESHG:(V,E) | =
6 min |Pi ESHG:(V,E) ∈ P ESHG:(V,E) |.
i
C(N SHG)Neutrosophic SuperHyperJoin SuperHyperPolynomial
= (PERFECT MATCHING).
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
where ∀Pi ESHG:(V,E) , |Pi ESHG:(V,E) |
= min |Pi ESHG:(V,E) ∈ P ESHG:(V,E) |}.
i
C(N SHG)Neutrosophic SuperHyperJoin SuperHyperPolynomial
= (OTHERWISE)0.
C(N SHG)Neutrosophic Quasi-SuperHyperJoin
= {ViEXT ERN AL ∈ VPEXT
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-SuperHyperJoin SuperHyperPolynomial


X X
= =( (|Pi ESHG:(V,E) |choose 2) = z 2 .
EXT ERN AL |
|VESHG:(V,E) i=|P ESHG:(V,E) |
Neutrosophic Cardinality

Proof. Let 2301

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

is a longest path taken from a connected Neutrosophic SuperHyperBipartite 2302

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

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 2304

corresponded to ViEXT ERN AL in the literatures of SuperHyperJoin. The latter is 2305

straightforward. Then there’s no at least one SuperHyperJoin. Thus the notion of quasi 2306

may be up but the SuperHyperNotions based on SuperHyperJoin could be applied. 2307

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

There are only two SuperHyperParts. Thus every SuperHyperPart could have one 2308

SuperHyperVertex as the representative in the 2309

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

is a longest SuperHyperJoin taken from a connected Neutrosophic SuperHyperBipartite 2310

ESHB : (V, E). Thus only some SuperHyperVertices and only 2311

minimum-Neutrosophic-of-SuperHyperPart SuperHyperEdges are attained in any 2312

solution 2313

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

The latter is straightforward. 2314

Example 13.11. In the Neutrosophic Figure (26), the connected Neutrosophic 2315

SuperHyperBipartite ESHB : (V, E), is Neutrosophic highlighted and Neutrosophic 2316

featured. The obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in 2317

previous Neutrosophic result, of the Neutrosophic SuperHyperVertices of the connected 2318

Neutrosophic SuperHyperBipartite ESHB : (V, E), in the Neutrosophic 2319

SuperHyperModel (26), is the Neutrosophic SuperHyperJoin. 2320

Proposition 13.12. Assume a connected Neutrosophic SuperHyperMultipartite 2321

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

ESHM : (V, E). Then 2322

C(N SHG)Neutrosophic 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
C(N SHG)Neutrosophic Quasi-SuperHyperJoin
= (OTHERWISE).
{},
If ∃Pi ESHG:(V,E) , |Pi ESHG:(V,E) | =
6 min |Pi ESHG:(V,E) ∈ P ESHG:(V,E) |.
i
C(N SHG)Neutrosophic SuperHyperJoin SuperHyperPolynomial
= (PERFECT MATCHING).
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
where ∀Pi ESHG:(V,E) , |Pi ESHG:(V,E) |
= min |Pi ESHG:(V,E) ∈ P ESHG:(V,E) |}.
i
C(N SHG)Neutrosophic SuperHyperJoin SuperHyperPolynomial
= (OTHERWISE)0.
C(N SHG)Neutrosophic Quasi-SuperHyperJoin
= {ViEXT ERN AL ∈ VPEXT
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-SuperHyperJoin SuperHyperPolynomial


X X
= =( (|Pi ESHG:(V,E) |choose 2) = z 2 .
EXT ERN AL |
|VESHG:(V,E) i=|P ESHG:(V,E) |
Neutrosophic Cardinality

Proof. Let 2323

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

is a longest SuperHyperJoin taken from a connected Neutrosophic 2324

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

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 2326

corresponded to ViEXT ERN AL in the literatures of SuperHyperJoin. The latter is 2327

straightforward. Then there’s no at least one SuperHyperJoin. Thus the notion of quasi 2328

may be up but the SuperHyperNotions based on SuperHyperJoin could be applied. 2329

There are only z 0 SuperHyperParts. Thus every SuperHyperPart could have one 2330

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

SuperHyperVertex as the representative in the 2331

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

is a longest path taken from a connected Neutrosophic SuperHyperMultipartite 2332

ESHM : (V, E). Thus only some SuperHyperVertices and only 2333

minimum-Neutrosophic-of-SuperHyperPart SuperHyperEdges are attained in any 2334

solution 2335

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

is a longest path taken from a connected Neutrosophic SuperHyperMultipartite 2336

ESHM : (V, E). The latter is straightforward. 2337

Example 13.13. In the Figure (27), the connected Neutrosophic 2338

SuperHyperMultipartite ESHM : (V, E), is highlighted and Neutrosophic featured. 2339

The obtained Neutrosophic SuperHyperSet, by the Algorithm in previous Neutrosophic 2340

result, of the Neutrosophic SuperHyperVertices of the connected Neutrosophic 2341

SuperHyperMultipartite ESHM : (V, E), in the Neutrosophic SuperHyperModel (27), 2342

is the Neutrosophic SuperHyperJoin. 2343

Proposition 13.14. Assume a connected Neutrosophic SuperHyperWheel 2344

ESHW : (V, E). Then, 2345

C(N SHG)Neutrosophic SuperHyperJoin =


|EESHG:(V,E) |Neutrosophic Cardinality

= {Ei }i=1 3
.
C(N SHG)Neutrosophic SuperHyperJoin SuperHyperPolynomial
|EESHG:(V,E) |Neutrosophic Cardinality
= 3z 3 .
C(N SHG)Neutrosophic R-SuperHyperJoin
|EESHG:(V,E) |Neutrosophic Cardinality

= {ViEXT ERN AL }i=1 3


.
C(N SHG)Neutrosophic R-SuperHyperJoin SuperHyperPolynomial
Y |EESHG:(V,E) |Neutrosophic Cardinality
= |V EXT ERN AL ESHG:(V,E) |Neutrosophic Cardinality z 3 .

Proof. Let 2346

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

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

is a longest SuperHyperJoin taken from a connected Neutrosophic SuperHyperWheel 2347

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

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 2349

corresponded to ViEXT ERN AL in the literatures of SuperHyperJoin. The latter is 2350

straightforward. Then there’s at least one SuperHyperJoin. Thus the notion of quasi 2351

isn’t up and the SuperHyperNotions based on SuperHyperJoin could be applied. The 2352

unique embedded SuperHyperJoin proposes some longest SuperHyperJoin excerpt from 2353

some representatives. The latter is straightforward. 2354

Example 13.15. In the Neutrosophic Figure (28), the connected Neutrosophic 2355

SuperHyperWheel N SHW : (V, E), is Neutrosophic highlighted and featured. The 2356

obtained Neutrosophic SuperHyperSet, by the Algorithm in previous result, of the 2357

Neutrosophic SuperHyperVertices of the connected Neutrosophic SuperHyperWheel 2358

ESHW : (V, E), in the Neutrosophic SuperHyperModel (28), is the Neutrosophic 2359

SuperHyperJoin. 2360

14 Neutrosophic SuperHyperPerfect But As The 2361

Extensions Excerpt From Dense And Super 2362

Forms 2363

Definition 14.1. (Different Neutrosophic Types of Neutrosophic SuperHyperPerfect). 2364

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 2365

a Neutrosophic SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and E 0 = {E1 , E2 , . . . , Ez }. Then 2366

either V 0 or E 0 is called 2367

(i) Neutrosophic e-SuperHyperPerfect if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃!Ej ∈ E 0 , 2368

such that Va ∈ Ei , Ej ; 2369

(ii) Neutrosophic re-SuperHyperPerfect if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃!Ej ∈ E 0 , 2370

such that Va ∈ Ei , Ej ; and 2371

|Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 2372

(iii) Neutrosophic v-SuperHyperPerfect if ∀Vi ∈ VESHG:(V,E) \ V 0 , ∃!Vj ∈ V 0 , 2373

such that Vi , Vj ∈ Ea ; 2374

(iv) Neutrosophic rv-SuperHyperPerfect if ∀Vi ∈ VESHG:(V,E) \ V 0 , ∃!Vj ∈ V 0 , 2375

such that Vi , Vj ∈ Ea ; and 2376

|Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; 2377

(v) Neutrosophic SuperHyperPerfect if it’s either of Neutrosophic 2378

e-SuperHyperPerfect, Neutrosophic re-SuperHyperPerfect, Neutrosophic 2379

v-SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect. 2380

Definition 14.2. ((Neutrosophic) SuperHyperPerfect). 2381

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 2382

a Neutrosophic SuperHyperEdge (NSHE) E = {V1 , V2 , . . . , Vs }. Then E is called 2383

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

(i) an Extreme SuperHyperPerfect if it’s either of Neutrosophic 2384

e-SuperHyperPerfect, Neutrosophic re-SuperHyperPerfect, Neutrosophic 2385

v-SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for 2386

an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme 2387

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

Extreme SuperHyperEdges in the conseNeighborive Extreme sequence of Extreme 2389

SuperHyperEdges and Extreme SuperHyperVertices such that they form the 2390

Extreme SuperHyperPerfect; 2391

(ii) a Neutrosophic SuperHyperPerfect if it’s either of Neutrosophic 2392

e-SuperHyperPerfect, Neutrosophic re-SuperHyperPerfect, Neutrosophic 2393

v-SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for 2394

a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic 2395

cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic 2396

SuperHyperSet S of high Neutrosophic cardinality conseNeighborive Neutrosophic 2397

SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the 2398

Neutrosophic SuperHyperPerfect; 2399

(iii) an Extreme SuperHyperPerfect SuperHyperPolynomial if it’s either of 2400

Neutrosophic e-SuperHyperPerfect, Neutrosophic re-SuperHyperPerfect, 2401

Neutrosophic v-SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and 2402

C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme 2403

SuperHyperPolynomial contains the Extreme coefficients defined as the Extreme 2404

number of the maximum Extreme cardinality of the Extreme SuperHyperEdges of 2405

an Extreme SuperHyperSet S of high Extreme cardinality conseNeighborive 2406

Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form 2407

the Extreme SuperHyperPerfect; and the Extreme power is corresponded to its 2408

Extreme coefficient; 2409

(iv) a Neutrosophic SuperHyperPerfect SuperHyperPolynomial if it’s either 2410

of Neutrosophic e-SuperHyperPerfect, Neutrosophic re-SuperHyperPerfect, 2411

Neutrosophic v-SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and 2412

C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the 2413

Neutrosophic SuperHyperPolynomial contains the Neutrosophic coefficients 2414

defined as the Neutrosophic number of the maximum Neutrosophic cardinality of 2415

the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of high 2416

Neutrosophic cardinality conseNeighborive Neutrosophic SuperHyperEdges and 2417

Neutrosophic SuperHyperVertices such that they form the Neutrosophic 2418

SuperHyperPerfect; and the Neutrosophic power is corresponded to its 2419

Neutrosophic coefficient; 2420

(v) an Extreme R-SuperHyperPerfect if it’s either of Neutrosophic 2421

e-SuperHyperPerfect, Neutrosophic re-SuperHyperPerfect, Neutrosophic 2422

v-SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for 2423

an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme 2424

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

Extreme SuperHyperVertices in the conseNeighborive Extreme sequence of 2426

Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form 2427

the Extreme SuperHyperPerfect; 2428

(vi) a Neutrosophic R-SuperHyperPerfect if it’s either of Neutrosophic 2429

e-SuperHyperPerfect, Neutrosophic re-SuperHyperPerfect, Neutrosophic 2430

v-SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for 2431

a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic 2432

cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic 2433

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

SuperHyperSet S of high Neutrosophic cardinality conseNeighborive Neutrosophic 2434

SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the 2435

Neutrosophic SuperHyperPerfect; 2436

(vii) an Extreme R-SuperHyperPerfect SuperHyperPolynomial if it’s either 2437

of Neutrosophic e-SuperHyperPerfect, Neutrosophic re-SuperHyperPerfect, 2438

Neutrosophic v-SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and 2439

C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme 2440

SuperHyperPolynomial contains the Extreme coefficients defined as the Extreme 2441

number of the maximum Extreme cardinality of the Extreme SuperHyperVertices 2442

of an Extreme SuperHyperSet S of high Extreme cardinality conseNeighborive 2443

Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form 2444

the Extreme SuperHyperPerfect; and the Extreme power is corresponded to its 2445

Extreme coefficient; 2446

(viii) a Neutrosophic SuperHyperPerfect SuperHyperPolynomial if it’s either 2447

of Neutrosophic e-SuperHyperPerfect, Neutrosophic re-SuperHyperPerfect, 2448

Neutrosophic v-SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and 2449

C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the 2450

Neutrosophic SuperHyperPolynomial contains the Neutrosophic coefficients 2451

defined as the Neutrosophic number of the maximum Neutrosophic cardinality of 2452

the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S of high 2453

Neutrosophic cardinality conseNeighborive Neutrosophic SuperHyperEdges and 2454

Neutrosophic SuperHyperVertices such that they form the Neutrosophic 2455

SuperHyperPerfect; and the Neutrosophic power is corresponded to its 2456

Neutrosophic coefficient. 2457

Example 14.3. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair 2458

S = (V, E) in the mentioned Neutrosophic Figures in every Neutrosophic items. 2459

• On the Figure (1), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 2460

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly 2461

straightforward. E1 and E3 are some empty Neutrosophic SuperHyperEdges but 2462

E2 is a loop Neutrosophic SuperHyperEdge and E4 is a Neutrosophic 2463

SuperHyperEdge. Thus in the terms of Neutrosophic SuperHyperNeighbor, 2464

there’s only one Neutrosophic SuperHyperEdge, namely, E4 . The Neutrosophic 2465

SuperHyperVertex, V3 is Neutrosophic isolated means that there’s no 2466

Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. Thus the 2467

Neutrosophic SuperHyperVertex, V3 , is excluded in every given Neutrosophic 2468

SuperHyperPerfect. 2469

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.

• On the Figure (2), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 2470

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly 2471

straightforward. E1 , E2 and E3 are some empty Neutrosophic SuperHyperEdges 2472

but E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of Neutrosophic 2473

SuperHyperNeighbor, there’s only one Neutrosophic SuperHyperEdge, namely, 2474

E4 . The Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means that 2475

there’s no Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. Thus 2476

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

the Neutrosophic SuperHyperVertex, V3 , is excluded in every given Neutrosophic 2477

SuperHyperPerfect. 2478

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.

• On the Figure (3), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 2479

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly 2480

straightforward. 2481

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.

• On the Figure (4), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 2482

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly 2483

straightforward. 2484

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 .

• On the Figure (5), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 2485

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly 2486

straightforward. 2487

C(N SHG)Neutrosophic SuperHyperPerfect = {E3 }.


C(N SHG)Neutrosophic SuperHyperPerfect SuperHyperPolynomial = 4z.
C(N SHG)Neutrosophic R-SuperHyperPerfect = {V5 }.
C(N SHG)Neutrosophic R-SuperHyperPerfect SuperHyperPolynomial = z.

• On the Figure (6), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 2488

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly 2489

straightforward. 2490

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 R-SuperHyperPerfect SuperHyperPolynomial = 6z 8 .

• On the Figure (7), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 2491

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly 2492

straightforward. 2493

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 .

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

• On the Figure (8), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 2494

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly 2495

straightforward. 2496

C(N SHG)Neutrosophic SuperHyperPerfect = {E4 }.


C(N SHG)Neutrosophic SuperHyperPerfect SuperHyperPolynomial = z.
C(N SHG)Neutrosophic R-SuperHyperPerfect = {V3 , V6 , V8 }.
C(N SHG)Neutrosophic R-SuperHyperPerfect SuperHyperPolynomial =
3 × 4 × 4z 3 .

• On the Figure (9), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 2497

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly 2498

straightforward. 2499

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 .

• On the Figure (10), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 2500

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly 2501

straightforward. 2502

C(N SHG)Neutrosophic SuperHyperPerfect = {E5 }.


C(N SHG)Neutrosophic SuperHyperPerfect SuperHyperPolynomial = z.
C(N SHG)Neutrosophic R-SuperHyperPerfect = {V3 , V6 , V8 }.
C(N SHG)Neutrosophic R-SuperHyperPerfect SuperHyperPolynomial =
3 × 4 × 4z 3 .

• On the Figure (11), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 2503

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly 2504

straightforward. 2505

C(N SHG)Neutrosophic SuperHyperPerfect = {E1 , E3 }.


C(N SHG)Neutrosophic SuperHyperPerfect SuperHyperPolynomial = z 2 .
C(N SHG)Neutrosophic R-SuperHyperPerfect = {V6 , V1 }.
C(N SHG)Neutrosophic R-SuperHyperPerfect SuperHyperPolynomial =
3 × 2z 2 .

• On the Figure (12), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 2506

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly 2507

straightforward. 2508

C(N SHG)Neutrosophic SuperHyperPerfect = {E1 }.


C(N SHG)Neutrosophic SuperHyperPerfect SuperHyperPolynomial = z.
C(N SHG)Neutrosophic R-SuperHyperPerfect = {V1 , Vii610=5,7,8 }.
i=4

C(N SHG)Neutrosophic R-SuperHyperPerfect SuperHyperPolynomial = 5z 5 .

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

• On the Figure (13), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 2509

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly 2510

straightforward. 2511

C(N SHG)Neutrosophic SuperHyperPerfect = {E3 , E9 }.


C(N SHG)Neutrosophic SuperHyperPerfect SuperHyperPolynomial = z 2 .
C(N SHG)Neutrosophic R-SuperHyperPerfect = {V1 , V6 }.
C(N SHG)Neutrosophic R-SuperHyperPerfect SuperHyperPolynomial =
3 × 3z 2 .

• On the Figure (14), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 2512

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly 2513

straightforward. 2514

C(N SHG)Neutrosophic SuperHyperPerfect = {E1 }.


C(N SHG)Neutrosophic SuperHyperPerfect SuperHyperPolynomial = 2z.
C(N SHG)Neutrosophic R-SuperHyperPerfect = {V1 }.
C(N SHG)Neutrosophic R-SuperHyperPerfect SuperHyperPolynomial = z.

• On the Figure (15), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 2515

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly 2516

straightforward. 2517

C(N SHG)Neutrosophic SuperHyperPerfect = {E2 , E5 }.


C(N SHG)Neutrosophic SuperHyperPerfect SuperHyperPolynomial = 3z 2 .
C(N SHG)Neutrosophic R-SuperHyperPerfect = {V1 , V4 }.
C(N SHG)Neutrosophic R-SuperHyperPerfect SuperHyperPolynomial = z.

• On the Figure (16), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 2518

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly 2519

straightforward. 2520

C(N SHG)Neutrosophic SuperHyperPerfect = {E2 , E5 }.


C(N SHG)Neutrosophic SuperHyperPerfect SuperHyperPolynomial = 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 .

• On the Figure (17), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 2521

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly 2522

straightforward. 2523

C(N SHG)Neutrosophic SuperHyperPerfect = {E2 , E5 }.


C(N SHG)Neutrosophic SuperHyperPerfect SuperHyperPolynomial = 3z 2 .
C(N SHG)Neutrosophic R-Quasi-SuperHyperPerfect = {V27 , V2 , V7 , V17 }.
C(N SHG)Neutrosophic R-Quasi-SuperHyperPerfect SuperHyperPolynomial =
(1 × 1 × 2 + 1)z 4 .

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

• On the Figure (18), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 2524

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly 2525

straightforward. 2526

C(N SHG)Neutrosophic SuperHyperPerfect = {E2 , E5 }.


C(N SHG)Neutrosophic SuperHyperPerfect SuperHyperPolynomial = 3z 2 .
C(N SHG)Neutrosophic R-Quasi-SuperHyperPerfect = {V27 , V2 , V7 , V17 }.
C(N SHG)Neutrosophic R-Quasi-SuperHyperPerfect SuperHyperPolynomial =
(1 × 1 × 2 + 1)z 4 .

• On the Figure (19), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 2527

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly 2528

straightforward. 2529

C(N SHG)Neutrosophic SuperHyperPerfect = {E3i+1i=03 }.


C(N SHG)Neutrosophic SuperHyperPerfect SuperHyperPolynomial = 3z 4 .
C(N SHG)Neutrosophic R-Quasi-SuperHyperPerfect = {V2i+1i=05 }.
C(N SHG)Neutrosophic R-Quasi-SuperHyperPerfect SuperHyperPolynomial = 2z 6 .

• On the Figure (20), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 2530

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly 2531

straightforward. 2532

C(N SHG)Neutrosophic SuperHyperPerfect = {E6 }.


C(N SHG)Neutrosophic SuperHyperPerfect SuperHyperPolynomial = 10z.
C(N SHG)Neutrosophic R-SuperHyperPerfect = {V1 }.
C(N SHG)Neutrosophic R-SuperHyperPerfect SuperHyperPolynomial = z.

• On the Figure (21), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 2533

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly 2534

straightforward. 2535

C(N SHG)Neutrosophic SuperHyperPerfect = {E2 }.


C(N SHG)Neutrosophic SuperHyperPerfect SuperHyperPolynomial = 2z.
C(N SHG)Neutrosophic R-SuperHyperPerfect = {V1 }.
C(N SHG)Neutrosophic R-SuperHyperPerfect SuperHyperPolynomial = 10z.

• On the Figure (22), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 2536

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly 2537

straightforward. 2538

C(N SHG)Neutrosophic SuperHyperPerfect = {E2 , E5 }.


C(N SHG)Neutrosophic SuperHyperPerfect SuperHyperPolynomial = z 2 .
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 .

The previous Neutrosophic approach apply on the upcoming Neutrosophic results on 2539

Neutrosophic SuperHyperClasses. 2540

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

Proposition 14.4. Assume a connected Neutrosophic SuperHyperPath 2541

ESHP : (V, E). Then 2542

C(N SHG)Neutrosophic SuperHyperPerfect =


|EESHG:(V,E) |Neutrosophic Cardinality

= {Ei }i=1 3
.
C(N SHG)Neutrosophic SuperHyperPerfect SuperHyperPolynomial
|EESHG:(V,E) |Neutrosophic Cardinality
= 3z 3 .
C(N SHG)Neutrosophic R-SuperHyperPerfect
|EESHG:(V,E) |Neutrosophic Cardinality

= {ViEXT ERN AL }i=1 3


.
C(N SHG)Neutrosophic R-SuperHyperPerfect SuperHyperPolynomial
Y |EESHG:(V,E) |Neutrosophic Cardinality
= |V EXT ERN AL ESHG:(V,E) |Neutrosophic Cardinality z 3 .

Proof. Let 2543

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

be a longest path taken from a connected Neutrosophic SuperHyperPath 2544

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

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 2546

corresponded to ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is 2547

straightforward. 2548

Example 14.5. In the Figure (23), the connected Neutrosophic SuperHyperPath 2549

ESHP : (V, E), is highlighted and featured. The Neutrosophic SuperHyperSet, in the 2550

Neutrosophic SuperHyperModel (23), is the SuperHyperPerfect. 2551

Proposition 14.6. Assume a connected Neutrosophic SuperHyperCycle 2552

ESHC : (V, E). Then 2553

C(N SHG)Neutrosophic SuperHyperPerfect =


|EESHG:(V,E) |Neutrosophic Cardinality

= {Ei }i=1 3
.
C(N SHG)Neutrosophic SuperHyperPerfect SuperHyperPolynomial
|EESHG:(V,E) |Neutrosophic Cardinality
= 3z 3 .
C(N SHG)Neutrosophic R-SuperHyperPerfect
|EESHG:(V,E) |Neutrosophic Cardinality

= {ViEXT ERN AL }i=1 3


.
C(N SHG)Neutrosophic R-SuperHyperPerfect SuperHyperPolynomial
Y |EESHG:(V,E) |Neutrosophic Cardinality
= |V EXT ERN AL ESHG:(V,E) |Neutrosophic Cardinality z 3 .

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

Proof. Let 2554

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

be a longest path taken from a connected Neutrosophic SuperHyperCycle 2555

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

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 2557

corresponded to ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is 2558

straightforward. 2559

Example 14.7. In the Figure (24), the connected Neutrosophic SuperHyperCycle 2560

N SHC : (V, E), is highlighted and featured. The obtained Neutrosophic 2561

SuperHyperSet, in the Neutrosophic SuperHyperModel (24), is the Neutrosophic 2562

SuperHyperPerfect. 2563

Proposition 14.8. Assume a connected Neutrosophic SuperHyperStar ESHS : (V, E). 2564

Then 2565

C(N SHG)Neutrosophic SuperHyperPerfect = {E ∈ EESHG:(V,E) }.


C(N SHG)Neutrosophic SuperHyperPerfect SuperHyperPolynomial
= |i | Ei ∈ EESHG:(V,E)|Neutrosophic Cardinality |z.
C(N SHG)Neutrosophic R-SuperHyperPerfect = {CEN T ER ∈ VESHG:(V,E) }.
C(N SHG)Neutrosophic R-SuperHyperPerfect SuperHyperPolynomial = z.

Proof. Let 2566

P : ViEXT ERN AL , Ei , CEN T ER, VjEXT ERN AL .

be a longest path taken a connected Neutrosophic SuperHyperStar ESHS : (V, E). 2567

There’s a new way to redefine as 2568

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 2569

corresponded to ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is 2570

straightforward. 2571

Example 14.9. In the Figure (25), the connected Neutrosophic SuperHyperStar 2572

ESHS : (V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, 2573

by the Algorithm in previous Neutrosophic result, of the Neutrosophic 2574

SuperHyperVertices of the connected Neutrosophic SuperHyperStar ESHS : (V, E), in 2575

the Neutrosophic SuperHyperModel (25), is the Neutrosophic SuperHyperPerfect. 2576

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

Proposition 14.10. Assume a connected Neutrosophic SuperHyperBipartite 2577

ESHB : (V, E). Then 2578

C(N SHG)Neutrosophic Quasi-SuperHyperPerfect


= (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
C(N SHG)Neutrosophic Quasi-SuperHyperPerfect
= (OTHERWISE).
{},
If ∃Pi ESHG:(V,E) , |Pi ESHG:(V,E) | =
6 min |Pi ESHG:(V,E) ∈ P ESHG:(V,E) |.
i
C(N SHG)Neutrosophic SuperHyperPerfect SuperHyperPolynomial
= (PERFECT MATCHING).
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
where ∀Pi ESHG:(V,E) , |Pi ESHG:(V,E) |
= min |Pi ESHG:(V,E) ∈ P ESHG:(V,E) |}.
i
C(N SHG)Neutrosophic SuperHyperPerfect SuperHyperPolynomial
= (OTHERWISE)0.
C(N SHG)Neutrosophic Quasi-SuperHyperPerfect
= {ViEXT ERN AL ∈ VPEXT
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
= =( (|Pi ESHG:(V,E) |choose 2) = z 2 .
EXT ERN AL |
|VESHG:(V,E) i=|P ESHG:(V,E) |
Neutrosophic Cardinality

Proof. Let 2579

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

is a longest path taken from a connected Neutrosophic SuperHyperBipartite 2580

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

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 2582

corresponded to ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is 2583

straightforward. Then there’s no at least one SuperHyperPerfect. Thus the notion of 2584

quasi may be up but the SuperHyperNotions based on SuperHyperPerfect could be 2585

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

applied. There are only two SuperHyperParts. Thus every SuperHyperPart could have 2586

one SuperHyperVertex as the representative in the 2587

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

is a longest SuperHyperPerfect taken from a connected Neutrosophic 2588

SuperHyperBipartite ESHB : (V, E). Thus only some SuperHyperVertices and only 2589

minimum-Neutrosophic-of-SuperHyperPart SuperHyperEdges are attained in any 2590

solution 2591

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

The latter is straightforward. 2592

Example 14.11. In the Neutrosophic Figure (26), the connected Neutrosophic 2593

SuperHyperBipartite ESHB : (V, E), is Neutrosophic highlighted and Neutrosophic 2594

featured. The obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in 2595

previous Neutrosophic result, of the Neutrosophic SuperHyperVertices of the connected 2596

Neutrosophic SuperHyperBipartite ESHB : (V, E), in the Neutrosophic 2597

SuperHyperModel (26), is the Neutrosophic SuperHyperPerfect. 2598

Proposition 14.12. Assume a connected Neutrosophic SuperHyperMultipartite 2599

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

ESHM : (V, E). Then 2600

C(N SHG)Neutrosophic Quasi-SuperHyperPerfect


= (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
C(N SHG)Neutrosophic Quasi-SuperHyperPerfect
= (OTHERWISE).
{},
If ∃Pi ESHG:(V,E) , |Pi ESHG:(V,E) | =
6 min |Pi ESHG:(V,E) ∈ P ESHG:(V,E) |.
i
C(N SHG)Neutrosophic SuperHyperPerfect SuperHyperPolynomial
= (PERFECT MATCHING).
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
where ∀Pi ESHG:(V,E) , |Pi ESHG:(V,E) |
= min |Pi ESHG:(V,E) ∈ P ESHG:(V,E) |}.
i
C(N SHG)Neutrosophic SuperHyperPerfect SuperHyperPolynomial
= (OTHERWISE)0.
C(N SHG)Neutrosophic Quasi-SuperHyperPerfect
= {ViEXT ERN AL ∈ VPEXT
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
= =( (|Pi ESHG:(V,E) |choose 2) = z 2 .
EXT ERN AL |
|VESHG:(V,E) i=|P ESHG:(V,E) |
Neutrosophic Cardinality

Proof. Let 2601

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

is a longest SuperHyperPerfect taken from a connected Neutrosophic 2602

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

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 2604

corresponded to ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is 2605

straightforward. Then there’s no at least one SuperHyperPerfect. Thus the notion of 2606

quasi may be up but the SuperHyperNotions based on SuperHyperPerfect could be 2607

applied. There are only z 0 SuperHyperParts. Thus every SuperHyperPart could have 2608

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

one SuperHyperVertex as the representative in the 2609

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

is a longest path taken from a connected Neutrosophic SuperHyperMultipartite 2610

ESHM : (V, E). Thus only some SuperHyperVertices and only 2611

minimum-Neutrosophic-of-SuperHyperPart SuperHyperEdges are attained in any 2612

solution 2613

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

is a longest path taken from a connected Neutrosophic SuperHyperMultipartite 2614

ESHM : (V, E). The latter is straightforward. 2615

Example 14.13. In the Figure (27), the connected Neutrosophic 2616

SuperHyperMultipartite ESHM : (V, E), is highlighted and Neutrosophic featured. 2617

The obtained Neutrosophic SuperHyperSet, by the Algorithm in previous Neutrosophic 2618

result, of the Neutrosophic SuperHyperVertices of the connected Neutrosophic 2619

SuperHyperMultipartite ESHM : (V, E), in the Neutrosophic SuperHyperModel (27), 2620

is the Neutrosophic SuperHyperPerfect. 2621

Proposition 14.14. Assume a connected Neutrosophic SuperHyperWheel 2622

ESHW : (V, E). Then, 2623

C(N SHG)Neutrosophic SuperHyperPerfect = {E ∈ EESHG:(V,E) }.


C(N SHG)Neutrosophic SuperHyperPerfect SuperHyperPolynomial
= |i | Ei ∈ EESHG:(V,E)|Neutrosophic Cardinality |z.
C(N SHG)Neutrosophic R-SuperHyperPerfect = {CEN T ER ∈ VESHG:(V,E) }.
C(N SHG)Neutrosophic R-SuperHyperPerfect SuperHyperPolynomial = z.
Proof. Let 2624

P : ViEXT ERN AL , Ei , CEN T ER, VjEXT ERN AL .


is a longest SuperHyperPerfect taken from a connected Neutrosophic SuperHyperWheel 2625

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

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 2627

corresponded to ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is 2628

straightforward. Then there’s at least one SuperHyperPerfect. Thus the notion of quasi 2629

isn’t up and the SuperHyperNotions based on SuperHyperPerfect could be applied. The 2630

unique embedded SuperHyperPerfect proposes some longest SuperHyperPerfect excerpt 2631

from some representatives. The latter is straightforward. 2632

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

Example 14.15. In the Neutrosophic Figure (28), the connected Neutrosophic 2633

SuperHyperWheel N SHW : (V, E), is Neutrosophic highlighted and featured. The 2634

obtained Neutrosophic SuperHyperSet, by the Algorithm in previous result, of the 2635

Neutrosophic SuperHyperVertices of the connected Neutrosophic SuperHyperWheel 2636

ESHW : (V, E), in the Neutrosophic SuperHyperModel (28), is the Neutrosophic 2637

SuperHyperPerfect. 2638

15 Neutrosophic SuperHyperTotal But As The 2639

Extensions Excerpt From Dense And Super 2640

Forms 2641

Definition 15.1. (Different Neutrosophic Types of Neutrosophic SuperHyperTotal). 2642

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 2643

a Neutrosophic SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and E 0 = {E1 , E2 , . . . , Ez }. Then 2644

either V 0 or E 0 is called 2645

(i) Neutrosophic e-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such 2646

that Va ∈ Ei , Ej ; 2647

(ii) Neutrosophic re-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such 2648

that Va ∈ Ei , Ej ; and 2649

|Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 2650

(iii) Neutrosophic v-SuperHyperTotal if ∀Vi ∈ VESHG:(V,E) , ∃!Vj ∈ V 0 , such 2651

that Vi , Vj ∈ Ea ; 2652

(iv) Neutrosophic rv-SuperHyperTotal if ∀Vi ∈ VESHG:(V,E) , ∃!Vj ∈ V 0 , such 2653

that Vi , Vj ∈ Ea ; and 2654

|Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; 2655

(v) Neutrosophic SuperHyperTotal if it’s either of Neutrosophic 2656

e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic 2657

v-SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal. 2658

Definition 15.2. ((Neutrosophic) SuperHyperTotal). 2659

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 2660

a Neutrosophic SuperHyperEdge (NSHE) E = {V1 , V2 , . . . , Vs }. Then E is called 2661

(i) an Extreme SuperHyperTotal if it’s either of Neutrosophic 2662

e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic 2663

v-SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for an 2664

Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme cardinality 2665

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

SuperHyperEdges in the conseNeighborive Extreme sequence of Extreme 2667

SuperHyperEdges and Extreme SuperHyperVertices such that they form the 2668

Extreme SuperHyperTotal; 2669

(ii) a Neutrosophic SuperHyperTotal if it’s either of Neutrosophic 2670

e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic 2671

v-SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for a 2672

Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic 2673

cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic 2674

SuperHyperSet S of high Neutrosophic cardinality conseNeighborive Neutrosophic 2675

SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the 2676

Neutrosophic SuperHyperTotal; 2677

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

(iii) an Extreme SuperHyperTotal SuperHyperPolynomial if it’s either of 2678

Neutrosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic 2679

v-SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for an 2680

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

SuperHyperPolynomial contains the Extreme coefficients defined as the Extreme 2682

number of the maximum Extreme cardinality of the Extreme SuperHyperEdges of 2683

an Extreme SuperHyperSet S of high Extreme cardinality conseNeighborive 2684

Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form 2685

the Extreme SuperHyperTotal; and the Extreme power is corresponded to its 2686

Extreme coefficient; 2687

(iv) a Neutrosophic SuperHyperTotal SuperHyperPolynomial if it’s either of 2688

Neutrosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic 2689

v-SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for a 2690

Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic 2691

SuperHyperPolynomial contains the Neutrosophic coefficients defined as the 2692

Neutrosophic number of the maximum Neutrosophic cardinality of the 2693

Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of high 2694

Neutrosophic cardinality conseNeighborive Neutrosophic SuperHyperEdges and 2695

Neutrosophic SuperHyperVertices such that they form the Neutrosophic 2696

SuperHyperTotal; and the Neutrosophic power is corresponded to its 2697

Neutrosophic coefficient; 2698

(v) an Extreme R-SuperHyperTotal if it’s either of Neutrosophic 2699

e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic 2700

v-SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for an 2701

Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme cardinality 2702

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

SuperHyperVertices in the conseNeighborive Extreme sequence of Extreme 2704

SuperHyperEdges and Extreme SuperHyperVertices such that they form the 2705

Extreme SuperHyperTotal; 2706

(vi) a Neutrosophic R-SuperHyperTotal if it’s either of Neutrosophic 2707

e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic 2708

v-SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for a 2709

Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic 2710

cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic 2711

SuperHyperSet S of high Neutrosophic cardinality conseNeighborive Neutrosophic 2712

SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the 2713

Neutrosophic SuperHyperTotal; 2714

(vii) an Extreme R-SuperHyperTotal SuperHyperPolynomial if it’s either of 2715

Neutrosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic 2716

v-SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for an 2717

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

SuperHyperPolynomial contains the Extreme coefficients defined as the Extreme 2719

number of the maximum Extreme cardinality of the Extreme SuperHyperVertices 2720

of an Extreme SuperHyperSet S of high Extreme cardinality conseNeighborive 2721

Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form 2722

the Extreme SuperHyperTotal; and the Extreme power is corresponded to its 2723

Extreme coefficient; 2724

(viii) a Neutrosophic SuperHyperTotal SuperHyperPolynomial if it’s either of 2725

Neutrosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic 2726

v-SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for a 2727

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic 2728

SuperHyperPolynomial contains the Neutrosophic coefficients defined as the 2729

Neutrosophic number of the maximum Neutrosophic cardinality of the 2730

Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S of high 2731

Neutrosophic cardinality conseNeighborive Neutrosophic SuperHyperEdges and 2732

Neutrosophic SuperHyperVertices such that they form the Neutrosophic 2733

SuperHyperTotal; and the Neutrosophic power is corresponded to its 2734

Neutrosophic coefficient. 2735

Example 15.3. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair 2736

S = (V, E) in the mentioned Neutrosophic Figures in every Neutrosophic items. 2737

• On the Figure (1), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 2738

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly 2739

straightforward. E1 and E3 are some empty Neutrosophic SuperHyperEdges but 2740

E2 is a loop Neutrosophic SuperHyperEdge and E4 is a Neutrosophic 2741

SuperHyperEdge. Thus in the terms of Neutrosophic SuperHyperNeighbor, 2742

there’s only one Neutrosophic SuperHyperEdge, namely, E4 . The Neutrosophic 2743

SuperHyperVertex, V3 is Neutrosophic isolated means that there’s no 2744

Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. Thus the 2745

Neutrosophic SuperHyperVertex, V3 , is excluded in every given Neutrosophic 2746

SuperHyperTotal. 2747

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.

• On the Figure (2), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 2748

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly 2749

straightforward. E1 , E2 and E3 are some empty Neutrosophic SuperHyperEdges 2750

but E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of Neutrosophic 2751

SuperHyperNeighbor, there’s only one Neutrosophic SuperHyperEdge, namely, 2752

E4 . The Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means that 2753

there’s no Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. Thus 2754

the Neutrosophic SuperHyperVertex, V3 , is excluded in every given Neutrosophic 2755

SuperHyperTotal. 2756

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.

• On the Figure (3), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 2757

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly 2758

straightforward. 2759

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.

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

• On the Figure (4), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 2760

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly 2761

straightforward. 2762

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 .

• On the Figure (5), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 2763

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly 2764

straightforward. 2765

C(N SHG)Neutrosophic Quasi-SuperHyperTotal = {E3 }.


C(N SHG)Neutrosophic Quasi-SuperHyperTotal SuperHyperPolynomial = 4z.
C(N SHG)Neutrosophic R-Quasi-SuperHyperTotal = {V5 }.
C(N SHG)Neutrosophic R-Quasi-SuperHyperTotal SuperHyperPolynomial = z.

• On the Figure (6), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 2766

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly 2767

straightforward. 2768

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 .

• On the Figure (7), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 2769

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly 2770

straightforward. 2771

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 .

• On the Figure (8), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 2772

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly 2773

straightforward. 2774

C(N SHG)Extreme Quasi-SuperHyperTotal = {E4 }.


C(N SHG)Extreme Quasi-SuperHyperTotal SuperHyperPolynomial = z.
C(N SHG)Extreme R-SuperHyperTotal = {V12 , V13 , V14 }.
C(N SHG)Extreme R-SuperHyperTotal SuperHyperPolynomial =
3 × 4 × 4z 3 .

• On the Figure (9), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 2775

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly 2776

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

straightforward. 2777

C(N SHG)Neutrosophic SuperHyperTotal = {Ei+19i=0 }.


C(N SHG)Neutrosophic SuperHyperTotal SuperHyperPolynomial 10z 10 .
C(N SHG)Neutrosophic R-SuperHyperTotal = {Vi+19i=0 }.
C(N SHG)Neutrosophic R-SuperHyperTotal SuperHyperPolynomial = 20z 10 .

• On the Figure (10), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 2778

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly 2779

straightforward. 2780

C(N SHG)Extreme Quasi-SuperHyperTotal = {E5 }.


C(N SHG)Extreme Quasi-SuperHyperTotal SuperHyperPolynomial = z.
C(N SHG)Extreme R-SuperHyperTotal = {V12 , V13 , V14 }.
C(N SHG)Extreme R-SuperHyperTotal SuperHyperPolynomial =
3 × 4 × 4z 3 .

• On the Figure (11), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 2781

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly 2782

straightforward. 2783

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 R-SuperHyperTotal SuperHyperPolynomial = 3z 2 .

• On the Figure (12), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 2784

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly 2785

straightforward. 2786

C(N SHG)Extreme SuperHyperTotal = {E1 , E2 }.


C(N SHG)Extreme SuperHyperTotal SuperHyperPolynomial = 5z 2 .
C(N SHG)Extreme R-SuperHyperTotal = {V1 , Vii68=4,5,6 }.
i=1

C(N SHG)Extreme R-SuperHyperTotal SuperHyperPolynomial = z 5 .

• On the Figure (13), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 2787

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly 2788

straightforward. 2789

C(N SHG)Extreme SuperHyperTotal = {E3 , E9 , E6 }.


C(N SHG)Extreme SuperHyperTotal SuperHyperPolynomial = 3z 3 .
C(N SHG)Extreme R-SuperHyperTotal = {V1 , V5 }.
C(N SHG)Extreme R-SuperHyperTotal SuperHyperPolynomial = 3z 2 .

• On the Figure (14), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 2790

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly 2791

straightforward. 2792

C(N SHG)Extreme SuperHyperTotal = {E1 , E2 }.


C(N SHG)Extreme SuperHyperTotal SuperHyperPolynomial = z 2 .
C(N SHG)Extreme R-SuperHyperTotal = {V1 , V3 }.
C(N SHG)Extreme R-SuperHyperTotal SuperHyperPolynomial = 2z 2 .

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

• On the Figure (15), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 2793

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly 2794

straightforward. 2795

C(N SHG)Extreme SuperHyperTotal = {E2 , E3 , E4 }.


C(N SHG)Extreme SuperHyperTotal SuperHyperPolynomial = z 3 .
C(N SHG)Extreme R-SuperHyperTotal = {V2 , V3 , V4 }.
C(N SHG)Extreme R-SuperHyperTotal SuperHyperPolynomial = z 3 .

• On the Figure (16), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 2796

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly 2797

straightforward. 2798

C(N SHG)Extreme SuperHyperTotal = {E2 , E3 , E4 }.


C(N SHG)Extreme SuperHyperTotal SuperHyperPolynomial = z 3 .
C(N SHG)Extreme R-SuperHyperTotal = {V2 , V6 , V17 }.
C(N SHG)Extreme R-SuperHyperTotal SuperHyperPolynomial =
4 × 3z 3 .

• On the Figure (17), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 2799

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly 2800

straightforward. 2801

C(N SHG)Extreme SuperHyperTotal = {E2 , E3 , E4 }.


C(N SHG)Extreme SuperHyperTotal SuperHyperPolynomial = z 3 .
C(N SHG)Extreme R-SuperHyperTotal = {V1 , V2 , V6 , V17 }.
C(N SHG)Extreme R-SuperHyperTotal SuperHyperPolynomial =
4 × 3z 4 .

• On the Figure (18), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 2802

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly 2803

straightforward. 2804

C(N SHG)Extreme SuperHyperTotal = {E2 , E3 , E4 }.


C(N SHG)Extreme SuperHyperTotal SuperHyperPolynomial = z 3 .
C(N SHG)Extreme R-SuperHyperTotal = {V1 , V2 , V6 , V17 }.
C(N SHG)Extreme R-SuperHyperTotal SuperHyperPolynomial =
2 × 4 × 3z 4 .

• On the Figure (19), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 2805

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly 2806

straightforward. 2807

C(N SHG)Neutrosophic SuperHyperTotal = {Ei+2i=011 }.


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 .

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

• On the Figure (20), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 2808

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly 2809

straightforward. 2810

C(N SHG)Extreme SuperHyperTotal = {E6 , E10 }.


C(N SHG)Extreme SuperHyperTotal SuperHyperPolynomial = 9z 2 .
C(N SHG)Extreme R-SuperHyperTotal = {V1 , V }.
C(N SHG)Extreme R-SuperHyperTotal SuperHyperPolynomial
= |(|V | − 1)z 2 .

• On the Figure (21), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 2811

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly 2812

straightforward. 2813

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)Neutrosophic R-SuperHyperTotal SuperHyperPolynomial = 9z 2 .

• On the Figure (22), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 2814

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly 2815

straightforward. 2816

C(N SHG)Extreme SuperHyperTotal = {E3 , E4 }.


C(N SHG)Extreme SuperHyperTotal SuperHyperPolynomial = z 2 .
C(N SHG)Extreme R-Quasi-SuperHyperTotal = {V3 , V10 , V6 }.
C(N SHG)Extreme R-Quasi-SuperHyperTotal SuperHyperPolynomial
= 3 × 6z 3 .

The previous Neutrosophic approach apply on the upcoming Neutrosophic results on 2817

Neutrosophic SuperHyperClasses. 2818

Proposition 15.4. Assume a connected Neutrosophic SuperHyperPath 2819

ESHP : (V, E). Then 2820

C(N SHG)Neutrosophic SuperHyperTotal =


|E | −2
= {Ei }i=1ESHG:(V,E) Neutrosophic Cardinality .
C(N SHG)Neutrosophic SuperHyperTotal SuperHyperPolynomial
= z |EESHG:(V,E) |Neutrosophic Cardinality −2 .
C(N SHG)Neutrosophic R-SuperHyperTotal
|E | −2
= {ViEXT ERN AL }i=1ESHG:(V,E) Neutrosophic Cardinality .
C(N SHG)Neutrosophic R-SuperHyperTotal SuperHyperPolynomial
Y
= |V EXT ERN AL ESHG:(V,E) |Neutrosophic Cardinality z |EESHG:(V,E) |Neutrosophic Cardinality −2

Proof. Let 2821

P :
V2EXT ERN AL , E2 ,
V3EXT ERN AL , E3 ,
...

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

be a longest path taken from a connected Neutrosophic SuperHyperPath 2822

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

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 2824

corresponded to ViEXT ERN AL in the literatures of SuperHyperTotal. The latter is 2825

straightforward. 2826

Example 15.5. In the Figure (23), the connected Neutrosophic SuperHyperPath 2827

ESHP : (V, E), is highlighted and featured. The Neutrosophic SuperHyperSet, in the 2828

Neutrosophic SuperHyperModel (23), is the SuperHyperTotal. 2829

Proposition 15.6. Assume a connected Neutrosophic SuperHyperCycle 2830

ESHC : (V, E). Then 2831

C(N SHG)Neutrosophic SuperHyperTotal =


|E | −2
= {Ei }i=1ESHG:(V,E) Neutrosophic Cardinality .
C(N SHG)Neutrosophic SuperHyperTotal SuperHyperPolynomial
= (|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 2832

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

be a longest path taken from a connected Neutrosophic SuperHyperCycle 2833

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

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 2835

corresponded to ViEXT ERN AL in the literatures of SuperHyperTotal. The latter is 2836

straightforward. 2837

Example 15.7. In the Figure (24), the connected Neutrosophic SuperHyperCycle 2838

N SHC : (V, E), is highlighted and featured. The obtained Neutrosophic 2839

SuperHyperSet, in the Neutrosophic SuperHyperModel (24), is the Neutrosophic 2840

SuperHyperTotal. 2841

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

Proposition 15.8. Assume a connected Neutrosophic SuperHyperStar ESHS : (V, E). 2842

Then 2843

C(N SHG)Neutrosophic SuperHyperTotal = {Ei , Ej ∈ EESHG:(V,E) }.


C(N SHG)Neutrosophic SuperHyperTotal SuperHyperPolynomial
= |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 2844

P : ViEXT ERN AL , Ei , CEN T ER, Ej .

be a longest path taken a connected Neutrosophic SuperHyperStar ESHS : (V, E). 2845

There’s a new way to redefine as 2846

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 2847

corresponded to ViEXT ERN AL in the literatures of SuperHyperTotal. The latter is 2848

straightforward. 2849

Example 15.9. In the Figure (25), the connected Neutrosophic SuperHyperStar 2850

ESHS : (V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, 2851

by the Algorithm in previous Neutrosophic result, of the Neutrosophic 2852

SuperHyperVertices of the connected Neutrosophic SuperHyperStar ESHS : (V, E), in 2853

the Neutrosophic SuperHyperModel (25), is the Neutrosophic SuperHyperTotal. 2854

Proposition 15.10. Assume a connected Neutrosophic SuperHyperBipartite 2855

ESHB : (V, E). Then 2856

C(N SHG)Neutrosophic SuperHyperTotal


= {Ea ∈ EPi ESHG:(V,E) ,
∀Pi ESHG:(V,E) , |Pi ESHG:(V,E) | = min |Pi ESHG:(V,E) ∈ P ESHG:(V,E) |}.
i
C(N SHG)Neutrosophic SuperHyperTotal
C(N SHG)Neutrosophic SuperHyperTotal SuperHyperPolynomial
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
C(N SHG)Neutrosophic SuperHyperTotal
= {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)Neutrosophic Quasi-SuperHyperTotal SuperHyperPolynomial


X X
= =( (|Pi ESHG:(V,E) |choose 2) = z 2 .
EXT ERN AL |
|VESHG:(V,E) i=|P ESHG:(V,E) |
Neutrosophic Cardinality

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

Proof. Let 2857

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

is a longest path taken from a connected Neutrosophic SuperHyperBipartite 2858

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

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 2860

corresponded to ViEXT ERN AL in the literatures of SuperHyperTotal. The latter is 2861

straightforward. Then there’s no at least one SuperHyperTotal. Thus the notion of 2862

quasi may be up but the SuperHyperNotions based on SuperHyperTotal could be 2863

applied. There are only two SuperHyperParts. Thus every SuperHyperPart could have 2864

one SuperHyperVertex as the representative in the 2865

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

is a longest SuperHyperTotal taken from a connected Neutrosophic 2866

SuperHyperBipartite ESHB : (V, E). Thus only some SuperHyperVertices and only 2867

minimum-Neutrosophic-of-SuperHyperPart SuperHyperEdges are attained in any 2868

solution 2869

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

The latter is straightforward. 2870

Example 15.11. In the Neutrosophic Figure (26), the connected Neutrosophic 2871

SuperHyperBipartite ESHB : (V, E), is Neutrosophic highlighted and Neutrosophic 2872

featured. The obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in 2873

previous Neutrosophic result, of the Neutrosophic SuperHyperVertices of the connected 2874

Neutrosophic SuperHyperBipartite ESHB : (V, E), in the Neutrosophic 2875

SuperHyperModel (26), is the Neutrosophic SuperHyperTotal. 2876

Proposition 15.12. Assume a connected Neutrosophic SuperHyperMultipartite 2877

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

ESHM : (V, E). Then 2878

C(N SHG)Neutrosophic SuperHyperTotal


= {Ea ∈ EPi ESHG:(V,E) ,
∀Pi ESHG:(V,E) , |Pi ESHG:(V,E) | = min |Pi ESHG:(V,E) ∈ P ESHG:(V,E) |}.
i
C(N SHG)Neutrosophic SuperHyperTotal
C(N SHG)Neutrosophic SuperHyperTotal SuperHyperPolynomial
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
C(N SHG)Neutrosophic SuperHyperTotal
= {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)Neutrosophic Quasi-SuperHyperTotal SuperHyperPolynomial


X X
= =( (|Pi ESHG:(V,E) |choose 2) = z 2 .
EXT ERN AL |
|VESHG:(V,E) i=|P ESHG:(V,E) |
Neutrosophic Cardinality

Proof. Let 2879

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperTotal taken from a connected Neutrosophic 2880

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

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 2882

corresponded to ViEXT ERN AL in the literatures of SuperHyperTotal. The latter is 2883

straightforward. Then there’s no at least one SuperHyperTotal. Thus the notion of 2884

quasi may be up but the SuperHyperNotions based on SuperHyperTotal could be 2885

applied. There are only z 0 SuperHyperParts. Thus every SuperHyperPart could have 2886

one SuperHyperVertex as the representative in the 2887

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest path taken from a connected Neutrosophic SuperHyperMultipartite 2888

ESHM : (V, E). Thus only some SuperHyperVertices and only 2889

minimum-Neutrosophic-of-SuperHyperPart SuperHyperEdges are attained in any 2890

solution 2891

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest path taken from a connected Neutrosophic SuperHyperMultipartite 2892

ESHM : (V, E). The latter is straightforward. 2893

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

Example 15.13. In the Figure (27), the connected Neutrosophic 2894

SuperHyperMultipartite ESHM : (V, E), is highlighted and Neutrosophic featured. 2895

The obtained Neutrosophic SuperHyperSet, by the Algorithm in previous Neutrosophic 2896

result, of the Neutrosophic SuperHyperVertices of the connected Neutrosophic 2897

SuperHyperMultipartite ESHM : (V, E), in the Neutrosophic SuperHyperModel (27), 2898

is the Neutrosophic SuperHyperTotal. 2899

Proposition 15.14. Assume a connected Neutrosophic SuperHyperWheel 2900

ESHW : (V, E). Then, 2901


C(N SHG)Neutrosophic SuperHyperTotal = {Ei , Ej ∈ EESHG:(V,E) }.
C(N SHG)Neutrosophic SuperHyperTotal SuperHyperPolynomial

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

P : ViEXT ERN AL , Ei∗ , CEN T ER, Ej .


is a longest SuperHyperTotal taken from a connected Neutrosophic SuperHyperWheel 2903

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

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 2905

corresponded to ViEXT ERN AL in the literatures of SuperHyperTotal. The latter is 2906

straightforward. Then there’s at least one SuperHyperTotal. Thus the notion of quasi 2907

isn’t up and the SuperHyperNotions based on SuperHyperTotal could be applied. The 2908

unique embedded SuperHyperTotal proposes some longest SuperHyperTotal excerpt 2909

from some representatives. The latter is straightforward. 2910

Example 15.15. In the Neutrosophic Figure (28), the connected Neutrosophic 2911

SuperHyperWheel N SHW : (V, E), is Neutrosophic highlighted and featured. The 2912

obtained Neutrosophic SuperHyperSet, by the Algorithm in previous result, of the 2913

Neutrosophic SuperHyperVertices of the connected Neutrosophic SuperHyperWheel 2914

ESHW : (V, E), in the Neutrosophic SuperHyperModel (28), is the Neutrosophic 2915

SuperHyperTotal. 2916

16 Neutrosophic SuperHyperConnected But As 2917

The Extensions Excerpt From Dense And Super 2918

Forms 2919

Definition 16.1. (Different Neutrosophic Types of Neutrosophic 2920

SuperHyperConnected). 2921

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 2922

a Neutrosophic SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and E 0 = {E1 , E2 , . . . , Ez }. Then 2923

either V 0 or E 0 is called 2924

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

(i) Neutrosophic e-SuperHyperConnected if 2925

∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such that Va ∈ Ei , Ej ; and ∀Ei , Ej ∈ E 0 , such 2926

that Va 6∈ Ei , Ej ; 2927

(ii) Neutrosophic re-SuperHyperConnected if 2928

∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such that Va ∈ Ei , Ej ; ∀Ei , Ej ∈ E 0 , such 2929

that Va 6∈ Ei , Ej ; and 2930

|Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 2931

(iii) Neutrosophic v-SuperHyperConnected if 2932

∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; and ∀Vi , Vj ∈ V 0 , such 2933

that Vi , Vj 6∈ Ea ; 2934

(iv) Neutrosophic rv-SuperHyperConnected if 2935

∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such that Vi , Vj ∈ Ea ; ∀Vi , Vj ∈ V 0 , such that 2936

Vi , Vj 6∈ Ea ; and 2937

|Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; 2938

(v) Neutrosophic SuperHyperConnected if it’s either of Neutrosophic 2939

e-SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neutrosophic 2940

v-SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected. 2941

Definition 16.2. ((Neutrosophic) SuperHyperConnected). 2942

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 2943

a Neutrosophic SuperHyperEdge (NSHE) E = {V1 , V2 , . . . , Vs }. Then E is called 2944

(i) an Extreme SuperHyperConnected if it’s either of Neutrosophic 2945

e-SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neutrosophic 2946

v-SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and 2947

C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum 2948

Extreme cardinality of an Extreme SuperHyperSet S of high Extreme cardinality 2949

of the Extreme SuperHyperEdges in the conseNeighborive Extreme sequence of 2950

Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form 2951

the Extreme SuperHyperConnected; 2952

(ii) a Neutrosophic SuperHyperConnected if it’s either of Neutrosophic 2953

e-SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neutrosophic 2954

v-SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and 2955

C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum 2956

Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic 2957

SuperHyperSet S of high Neutrosophic cardinality conseNeighborive Neutrosophic 2958

SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the 2959

Neutrosophic SuperHyperConnected; 2960

(iii) an Extreme SuperHyperConnected SuperHyperPolynomial if it’s either 2961

of Neutrosophic e-SuperHyperConnected, Neutrosophic re-SuperHyperConnected, 2962

Neutrosophic v-SuperHyperConnected, and Neutrosophic 2963

rv-SuperHyperConnected and C(N SHG) for an Extreme SuperHyperGraph 2964

N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme 2965

coefficients defined as the Extreme number of the maximum Extreme cardinality 2966

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

Extreme cardinality conseNeighborive Extreme SuperHyperEdges and Extreme 2968

SuperHyperVertices such that they form the Extreme SuperHyperConnected; and 2969

the Extreme power is corresponded to its Extreme coefficient; 2970

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

(iv) a Neutrosophic SuperHyperConnected SuperHyperPolynomial if it’s 2971

either of Neutrosophic e-SuperHyperConnected, Neutrosophic 2972

re-SuperHyperConnected, Neutrosophic v-SuperHyperConnected, and 2973

Neutrosophic rv-SuperHyperConnected and C(N SHG) for a Neutrosophic 2974

SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 2975

contains the Neutrosophic coefficients defined as the Neutrosophic number of the 2976

maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a 2977

Neutrosophic SuperHyperSet S of high Neutrosophic cardinality conseNeighborive 2978

Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that 2979

they form the Neutrosophic SuperHyperConnected; and the Neutrosophic power is 2980

corresponded to its Neutrosophic coefficient; 2981

(v) an Extreme R-SuperHyperConnected if it’s either of Neutrosophic 2982

e-SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neutrosophic 2983

v-SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and 2984

C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum 2985

Extreme cardinality of an Extreme SuperHyperSet S of high Extreme cardinality 2986

of the Extreme SuperHyperVertices in the conseNeighborive Extreme sequence of 2987

Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form 2988

the Extreme SuperHyperConnected; 2989

(vi) a Neutrosophic R-SuperHyperConnected if it’s either of Neutrosophic 2990

e-SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neutrosophic 2991

v-SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and 2992

C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum 2993

Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a 2994

Neutrosophic SuperHyperSet S of high Neutrosophic cardinality conseNeighborive 2995

Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that 2996

they form the Neutrosophic SuperHyperConnected; 2997

(vii) an Extreme R-SuperHyperConnected SuperHyperPolynomial if it’s 2998

either of Neutrosophic e-SuperHyperConnected, Neutrosophic 2999

re-SuperHyperConnected, Neutrosophic v-SuperHyperConnected, and 3000

Neutrosophic rv-SuperHyperConnected and C(N SHG) for an Extreme 3001

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

contains the Extreme coefficients defined as the Extreme number of the maximum 3003

Extreme cardinality of the Extreme SuperHyperVertices of an Extreme 3004

SuperHyperSet S of high Extreme cardinality conseNeighborive Extreme 3005

SuperHyperEdges and Extreme SuperHyperVertices such that they form the 3006

Extreme SuperHyperConnected; and the Extreme power is corresponded to its 3007

Extreme coefficient; 3008

(viii) a Neutrosophic SuperHyperConnected SuperHyperPolynomial if it’s 3009

either of Neutrosophic e-SuperHyperConnected, Neutrosophic 3010

re-SuperHyperConnected, Neutrosophic v-SuperHyperConnected, and 3011

Neutrosophic rv-SuperHyperConnected and C(N SHG) for a Neutrosophic 3012

SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 3013

contains the Neutrosophic coefficients defined as the Neutrosophic number of the 3014

maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a 3015

Neutrosophic SuperHyperSet S of high Neutrosophic cardinality conseNeighborive 3016

Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that 3017

they form the Neutrosophic SuperHyperConnected; and the Neutrosophic power is 3018

corresponded to its Neutrosophic coefficient. 3019

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

Example 16.3. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair 3020

S = (V, E) in the mentioned Neutrosophic Figures in every Neutrosophic items. 3021

• On the Figure (1), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 3022

SuperHyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly 3023

straightforward. E1 and E3 are some empty Neutrosophic SuperHyperEdges but 3024

E2 is a loop Neutrosophic SuperHyperEdge and E4 is a Neutrosophic 3025

SuperHyperEdge. Thus in the terms of Neutrosophic SuperHyperNeighbor, 3026

there’s only one Neutrosophic SuperHyperEdge, namely, E4 . The Neutrosophic 3027

SuperHyperVertex, V3 is Neutrosophic isolated means that there’s no 3028

Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. Thus the 3029

Neutrosophic SuperHyperVertex, V3 , is excluded in every given Neutrosophic 3030

SuperHyperConnected. 3031

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.

• On the Figure (2), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 3032

SuperHyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly 3033

straightforward. E1 , E2 and E3 are some empty Neutrosophic SuperHyperEdges 3034

but E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of Neutrosophic 3035

SuperHyperNeighbor, there’s only one Neutrosophic SuperHyperEdge, namely, 3036

E4 . The Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means that 3037

there’s no Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. Thus 3038

the Neutrosophic SuperHyperVertex, V3 , is excluded in every given Neutrosophic 3039

SuperHyperConnected. 3040

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.

• On the Figure (3), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 3041

SuperHyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly 3042

straightforward. 3043

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.

• On the Figure (4), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 3044

SuperHyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly 3045

straightforward. 3046

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 .

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

• On the Figure (5), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 3047

SuperHyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly 3048

straightforward. 3049

C(N SHG)Neutrosophic SuperHyperConnected = {E3 }.


C(N SHG)Neutrosophic SuperHyperConnected SuperHyperPolynomial = 4z.
C(N SHG)Neutrosophic R-SuperHyperConnected = {V5 }.
C(N SHG)Neutrosophic R-SuperHyperConnected SuperHyperPolynomial = z.

• On the Figure (6), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 3050

SuperHyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly 3051

straightforward. 3052

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)Neutrosophic R-Quasi-SuperHyperConnected SuperHyperPolynomial = 20z 10 .

• On the Figure (7), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 3053

SuperHyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly 3054

straightforward. 3055

C(N SHG)Extreme SuperHyperConnected = {E12 , E13 , E14 }.


C(N SHG)Extreme SuperHyperConnected SuperHyperPolynomial = z 3 .
C(N SHG)Extreme R-SuperHyperConnected = {V12 , V13 , V14 }.
C(N SHG)Extreme R-SuperHyperConnected SuperHyperPolynomial = z 3 .

• On the Figure (8), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 3056

SuperHyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly 3057

straightforward. 3058

C(N SHG)Extreme Quasi-SuperHyperConnected = {E4 }.


C(N SHG)Extreme Quasi-SuperHyperConnected SuperHyperPolynomial = z.
C(N SHG)Extreme R-SuperHyperConnected = {V12 , V13 , V14 }.
C(N SHG)Extreme R-SuperHyperConnected SuperHyperPolynomial =
3 × 4 × 4z 3 .

• On the Figure (9), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 3059

SuperHyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly 3060

straightforward. 3061

C(N SHG)Neutrosophic Quasi-SuperHyperConnected = {Ei+19i=0 }.


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 .

• On the Figure (10), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 3062

SuperHyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly 3063

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

straightforward. 3064

C(N SHG)Extreme SuperHyperConnected = {E5 }.


C(N SHG)Extreme SuperHyperConnected SuperHyperPolynomial = z.
C(N SHG)Extreme R-SuperHyperConnected = {V12 , V13 , V14 }.
C(N SHG)Extreme R-SuperHyperConnected SuperHyperPolynomial =
3 × 4 × 4z 3 .

• On the Figure (11), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 3065

SuperHyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly 3066

straightforward. 3067

C(N SHG)Extreme Quasi-SuperHyperConnected = {E1 , E6 , E7 , E8 }.


C(N SHG)Extreme Quasi-SuperHyperConnected SuperHyperPolynomial = 2z 4 .
C(N SHG)Extreme R-Quasi-SuperHyperConnected = {V1 , V5 }.
C(N SHG)Extreme R-Quasi-SuperHyperConnected SuperHyperPolynomial = 3z 2 .

• On the Figure (12), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 3068

SuperHyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly 3069

straightforward. 3070

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 .

• On the Figure (13), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 3071

SuperHyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly 3072

straightforward. 3073

C(N SHG)Extreme Quasi-SuperHyperConnected = {E3 , E9 , E6 }.


C(N SHG)Extreme Quasi-SuperHyperConnected SuperHyperPolynomial = 3z 3 .
C(N SHG)Extreme R-SuperHyperConnected = {V1 , V5 }.
C(N SHG)Extreme R-SuperHyperConnected SuperHyperPolynomial = 3z 2 .

• On the Figure (14), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 3074

SuperHyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly 3075

straightforward. 3076

C(N SHG)Extreme SuperHyperConnected = {E2 }.


C(N SHG)Extreme SuperHyperConnected SuperHyperPolynomial = z.
C(N SHG)Extreme R-SuperHyperConnected = {V1 }.
C(N SHG)Extreme R-SuperHyperConnected SuperHyperPolynomial = z.

• On the Figure (15), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 3077

SuperHyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly 3078

straightforward. 3079

C(N SHG)Extreme Quasi-SuperHyperConnected = {E2 , E3 , E4 }.


C(N SHG)Extreme Quasi-SuperHyperConnected SuperHyperPolynomial = z 3 .
C(N SHG)Extreme R-Quasi-SuperHyperConnected = {V2 , V3 , V4 }.
C(N SHG)Extreme R-Quasi-SuperHyperConnected SuperHyperPolynomial = z 3 .

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

• On the Figure (16), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 3080

SuperHyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly 3081

straightforward. 3082

C(N SHG)Extreme SuperHyperConnected = {E2 , E3 , E4 }.


C(N SHG)Extreme SuperHyperConnected SuperHyperPolynomial = z 3 .
C(N SHG)Extreme R-SuperHyperConnected = {V2 , V6 , V17 }.
C(N SHG)Extreme R-SuperHyperConnected SuperHyperPolynomial =
4 × 3z 3 .

• On the Figure (17), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 3083

SuperHyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly 3084

straightforward. 3085

C(N SHG)Extreme Quasi-SuperHyperConnected = {E2 , E3 , E4 }.


C(N SHG)Extreme Quasi-SuperHyperConnected SuperHyperPolynomial = z 3 .
C(N SHG)Extreme R-Quasi-SuperHyperConnected = {V1 , V2 , V6 , V17 }.
C(N SHG)Extreme R-Quasi-SuperHyperConnected SuperHyperPolynomial =
4 × 3z 4 .

• On the Figure (18), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 3086

SuperHyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly 3087

straightforward. 3088

C(N SHG)Extreme Quasi-SuperHyperConnected = {E2 , E3 , E4 }.


C(N SHG)Extreme Quasi-SuperHyperConnected SuperHyperPolynomial = z 3 .
C(N SHG)Extreme R-Quasi-SuperHyperConnected = {V1 , V2 , V6 , V17 }.
C(N SHG)Extreme R-Quasi-SuperHyperConnected SuperHyperPolynomial =
2 × 4 × 3z 4 .

• On the Figure (19), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 3089

SuperHyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly 3090

straightforward. 3091

C(N SHG)Neutrosophic Quasi-SuperHyperConnected = {Ei+2i=011 }.


C(N SHG)Neutrosophic Quasi-SuperHyperConnected SuperHyperPolynomial = 11z 10 .
C(N SHG)Neutrosophic R-Quasi-SuperHyperConnected = {Vi+2i=011 }.
C(N SHG)Neutrosophic R-Quasi-SuperHyperConnected SuperHyperPolynomial = 11z 10 .

• On the Figure (20), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 3092

SuperHyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly 3093

straightforward. 3094

C(N SHG)Extreme SuperHyperConnected = {E6 }.


C(N SHG)Extreme SuperHyperConnected SuperHyperPolynomial = 10z.
C(N SHG)Extreme R-SuperHyperConnected = {V1 }.
C(N SHG)Extreme R-SuperHyperConnected SuperHyperPolynomial = z.

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

• On the Figure (21), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 3095

SuperHyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly 3096

straightforward. 3097

C(N SHG)Neutrosophic SuperHyperConnected = {E2 }.


C(N SHG)Neutrosophic SuperHyperConnected SuperHyperPolynomial = z.
C(N SHG)Neutrosophic R-SuperHyperConnected = {V1 }.
C(N SHG)Neutrosophic R-SuperHyperConnected SuperHyperPolynomial = 10z.

• On the Figure (22), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 3098

SuperHyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly 3099

straightforward. 3100

C(N SHG)Extreme Quasi-SuperHyperConnected = {E3 , E4 }.


C(N SHG)Extreme Quasi-SuperHyperConnected SuperHyperPolynomial = z 2 .
C(N SHG)Extreme R-Quasi-SuperHyperConnected = {V3 , V10 , V6 }.
C(N SHG)Extreme R-Quasi-SuperHyperConnected SuperHyperPolynomial
= 3 × 6z 3 .

The previous Neutrosophic approach apply on the upcoming Neutrosophic results on 3101

Neutrosophic SuperHyperClasses. 3102

Proposition 16.4. Assume a connected Neutrosophic SuperHyperPath 3103

ESHP : (V, E). Then 3104

C(N SHG)Neutrosophic Quasi-SuperHyperConnected =


|EESHG:(V,E) |Neutrosophic Cardinality
−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
|EESHG:(V,E) |Neutrosophic −2
= {ViEXT ERN AL }i=1 Cardinality
.
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 3105

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 .

be a longest path taken from a connected Neutrosophic SuperHyperPath 3106

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

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 .

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

The term “EXTERNAL” implies |N (ViEXT ERN AL )| ≥ |N (Vj )| where Vj is 3108

corresponded to ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is 3109

straightforward. 3110

Example 16.5. In the Figure (23), the connected Neutrosophic SuperHyperPath 3111

ESHP : (V, E), is highlighted and featured. The Neutrosophic SuperHyperSet, in the 3112

Neutrosophic SuperHyperModel (23), is the SuperHyperConnected. 3113

Proposition 16.6. Assume a connected Neutrosophic SuperHyperCycle 3114

ESHC : (V, E). Then 3115

C(N SHG)Neutrosophic Quasi-SuperHyperConnected =


|EESHG:(V,E) |Neutrosophic Cardinality
−2
= {Ei }i=1 .
C(N SHG)Neutrosophic Quasi-SuperHyperConnected SuperHyperPolynomial
= (|EESHG:(V,E) |Neutrosophic Cardinality − 1)
|EESHG:(V,E) |Neutrosophic −2
z Cardinality .
C(N SHG)Neutrosophic R-Quasi-SuperHyperConnected
|EESHG:(V,E) |Neutrosophic −2
= {ViEXT ERN AL }i=1 Cardinality
.
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 3116

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 .

be a longest path taken from a connected Neutrosophic SuperHyperCycle 3117

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

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 3119

corresponded to ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is 3120

straightforward. 3121

Example 16.7. In the Figure (24), the connected Neutrosophic SuperHyperCycle 3122

N SHC : (V, E), is highlighted and featured. The obtained Neutrosophic 3123

SuperHyperSet, in the Neutrosophic SuperHyperModel (24), is the Neutrosophic 3124

SuperHyperConnected. 3125

Proposition 16.8. Assume a connected Neutrosophic SuperHyperStar ESHS : (V, E). 3126

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

Then 3127

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 3128

P : ViEXT ERN AL , Ei , CEN T ER, Ej .

be a longest path taken a connected Neutrosophic SuperHyperStar ESHS : (V, E). 3129

There’s a new way to redefine as 3130

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 3131

corresponded to ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is 3132

straightforward. 3133

Example 16.9. In the Figure (25), the connected Neutrosophic SuperHyperStar 3134

ESHS : (V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, 3135

by the Algorithm in previous Neutrosophic result, of the Neutrosophic 3136

SuperHyperVertices of the connected Neutrosophic SuperHyperStar ESHS : (V, E), in 3137

the Neutrosophic SuperHyperModel (25), is the Neutrosophic SuperHyperConnected. 3138

Proposition 16.10. Assume a connected Neutrosophic SuperHyperBipartite 3139

ESHB : (V, E). Then 3140

C(N SHG)Neutrosophic Quasi-SuperHyperConnected


= {Ea ∈ EPi ESHG:(V,E) ,
∀Pi ESHG:(V,E) , |Pi ESHG:(V,E) | = min |Pi ESHG:(V,E) ∈ P ESHG:(V,E) |}.
i
C(N SHG)Neutrosophic Quasi-SuperHyperConnected SuperHyperPolynomial
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
C(N SHG)Neutrosophic V-SuperHyperConnected
= {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)Neutrosophic V-SuperHyperConnected SuperHyperPolynomial


X X
= =( (|Pi ESHG:(V,E) |choose 2) = z 2 .
EXT ERN AL |
|VESHG:(V,E) i=|P ESHG:(V,E) |
Neutrosophic Cardinality

Proof. Let 3141

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

is a longest path taken from a connected Neutrosophic SuperHyperBipartite 3142

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

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 3144

corresponded to ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is 3145

straightforward. Then there’s no at least one SuperHyperConnected. Thus the notion of 3146

quasi may be up but the SuperHyperNotions based on SuperHyperConnected could be 3147

applied. There are only two SuperHyperParts. Thus every SuperHyperPart could have 3148

one SuperHyperVertex as the representative in the 3149

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperConnected taken from a connected Neutrosophic 3150

SuperHyperBipartite ESHB : (V, E). Thus only some SuperHyperVertices and only 3151

minimum-Neutrosophic-of-SuperHyperPart SuperHyperEdges are attained in any 3152

solution 3153

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
The latter is straightforward. 3154

Example 16.11. In the Neutrosophic Figure (26), the connected Neutrosophic 3155

SuperHyperBipartite ESHB : (V, E), is Neutrosophic highlighted and Neutrosophic 3156

featured. The obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in 3157

previous Neutrosophic result, of the Neutrosophic SuperHyperVertices of the connected 3158

Neutrosophic SuperHyperBipartite ESHB : (V, E), in the Neutrosophic 3159

SuperHyperModel (26), is the Neutrosophic SuperHyperConnected. 3160

Proposition 16.12. Assume a connected Neutrosophic SuperHyperMultipartite 3161

ESHM : (V, E). Then 3162

C(N SHG)Neutrosophic Quasi-SuperHyperConnected


= {Ea ∈ EPi ESHG:(V,E) ,
∀Pi ESHG:(V,E) , |Pi ESHG:(V,E) | = min |Pi ESHG:(V,E) ∈ P ESHG:(V,E) |}.
i
C(N SHG)Neutrosophic Quasi-SuperHyperConnected SuperHyperPolynomial
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
C(N SHG)Neutrosophic V-SuperHyperConnected
= {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)Neutrosophic V-SuperHyperConnected SuperHyperPolynomial


X X
= =( (|Pi ESHG:(V,E) |choose 2) = z 2 .
EXT ERN AL |
|VESHG:(V,E) i=|P ESHG:(V,E) |
Neutrosophic Cardinality

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

Proof. Let 3163

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

is a longest SuperHyperConnected taken from a connected Neutrosophic 3164

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

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 3166

corresponded to ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is 3167

straightforward. Then there’s no at least one SuperHyperConnected. Thus the notion of 3168

quasi may be up but the SuperHyperNotions based on SuperHyperConnected could be 3169

applied. There are only z 0 SuperHyperParts. Thus every SuperHyperPart could have 3170

one SuperHyperVertex as the representative in the 3171

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

is a longest path taken from a connected Neutrosophic SuperHyperMultipartite 3172

ESHM : (V, E). Thus only some SuperHyperVertices and only 3173

minimum-Neutrosophic-of-SuperHyperPart SuperHyperEdges are attained in any 3174

solution 3175

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

is a longest path taken from a connected Neutrosophic SuperHyperMultipartite 3176

ESHM : (V, E). The latter is straightforward. 3177

Example 16.13. In the Figure (27), the connected Neutrosophic 3178

SuperHyperMultipartite ESHM : (V, E), is highlighted and Neutrosophic featured. 3179

The obtained Neutrosophic SuperHyperSet, by the Algorithm in previous Neutrosophic 3180

result, of the Neutrosophic SuperHyperVertices of the connected Neutrosophic 3181

SuperHyperMultipartite ESHM : (V, E), in the Neutrosophic SuperHyperModel (27), 3182

is the Neutrosophic SuperHyperConnected. 3183

Proposition 16.14. Assume a connected Neutrosophic SuperHyperWheel 3184

ESHW : (V, E). Then, 3185


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.

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

Proof. Let 3186

P : V EXT ERN AL i , E ∗ i , CEN T ER, Ej .

is a longest SuperHyperConnected taken from a connected Neutrosophic 3187

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

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 3189

corresponded to ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is 3190

straightforward. Then there’s at least one SuperHyperConnected. Thus the notion of 3191

quasi isn’t up and the SuperHyperNotions based on SuperHyperConnected could be 3192

applied. The unique embedded SuperHyperConnected proposes some longest 3193

SuperHyperConnected excerpt from some representatives. The latter is 3194

straightforward. 3195

Example 16.15. In the Neutrosophic Figure (28), the connected Neutrosophic 3196

SuperHyperWheel N SHW : (V, E), is Neutrosophic highlighted and featured. The 3197

obtained Neutrosophic SuperHyperSet, by the Algorithm in previous result, of the 3198

Neutrosophic SuperHyperVertices of the connected Neutrosophic SuperHyperWheel 3199

ESHW : (V, E), in the Neutrosophic SuperHyperModel (28), is the Neutrosophic 3200

SuperHyperConnected. 3201

17 Background 3202

There are some scientific researches covering the topic of this research. In what follows, 3203

there are some discussion and literature reviews about them. 3204

The seminal paper and groundbreaking article is titled “Super Hyper Dominating 3205

and Super Hyper Resolving on Neutrosophic Super Hyper Graphs and Their Directions 3206

in Game Theory and Neutrosophic Super Hyper Classes” in Ref. [1] by Henry Garrett 3207

(2022). In this research article, a novel approach is implemented on SuperHyperGraph 3208

and neutrosophic SuperHyperGraph based on fundamental SuperHyperNumber and 3209

using neutrosophic SuperHyperClasses of neutrosophic SuperHyperGraph. It’s 3210

published in prestigious and fancy journal is entitled “Journal of Mathematical 3211

Techniques and Computational Mathematics(JMTCM)” with ISO abbreviation “J Math 3212

Techniques Comput Math” in volume 1 and issue 3 with pages 242-263. The research 3213

article studies deeply with choosing directly neutrosophic SuperHyperGraph and 3214

SuperHyperGraph. It’s the breakthrough toward independent results based on initial 3215

background and fundamental SuperHyperNumbers. 3216

The seminal paper and groundbreaking article is titled “Some Super Hyper Degrees 3217

and Co-Super Hyper Degrees on Neutrosophic Super Hyper Graphs And Super Hyper 3218

Graphs Alongside Applications in Cancer’s Treatments” in Ref. [2] by Henry Garrett 3219

(2023). In this research article, a novel approach is implemented on SuperHyperGraph 3220

and neutrosophic SuperHyperGraph based on fundamental notions and using vital tools 3221

in Cancer’s Treatments. It’s published in prestigious and fancy journal is entitled 3222

“Journal of Mathematical Techniques and Computational Mathematics(JMTCM)” with 3223

ISO abbreviation “J Math Techniques Comput Math” in volume 2 and issue 1 with 3224

pages 35-47. The research article studies deeply with choosing directly neutrosophic 3225

SuperHyperGraph and SuperHyperGraph. It’s the breakthrough toward independent 3226

results based on initial background and fundamental SuperHyperNumbers. 3227

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

The seminal paper and groundbreaking article is titled “A Research on Cancer’s 3228

Recognition and Neutrosophic Super Hypergraph by Eulerian Super Hyper Cycles and 3229

Hamiltonian Sets as Hyper Covering Versus Super separations” in Ref. [3] by Henry 3230

Garrett (2023). In this research article, a novel approach is implemented on 3231

SuperHyperGraph and neutrosophic SuperHyperGraph based on fundamental notions 3232

and using vital tools in Cancer’s Recognition. It’s published in prestigious and fancy 3233

journal is entitled “Journal of Mathematical Techniques and Computational 3234

Mathematics(JMTCM)” with ISO abbreviation “J Math Techniques Comput Math” in 3235

volume 2 and issue 3 with pages 136-148. The research article studies deeply with 3236

choosing directly neutrosophic SuperHyperGraph and SuperHyperGraph. It’s the 3237

breakthrough toward independent results based on initial background and fundamental 3238

SuperHyperNumbers. 3239

The seminal paper and groundbreaking article is titled “neutrosophic co-degree and 3240

neutrosophic degree alongside chromatic numbers in the setting of some classes related 3241

to neutrosophic hypergraphs” in Ref. [4] by Henry Garrett (2023). In this research 3242

article, a novel approach is implemented on SuperHyperGraph and neutrosophic 3243

SuperHyperGraph based on general forms without using neutrosophic classes of 3244

neutrosophic SuperHyperGraph. It’s published in prestigious and fancy journal is 3245

entitled “Journal of Current Trends in Computer Science Research (JCTCSR)” with 3246

ISO abbreviation “J Curr Trends Comp Sci Res” in volume 2 and issue 1 with pages 3247

16-24. The research article studies deeply with choosing neutrosophic hypergraphs 3248

instead of neutrosophic SuperHyperGraph. It’s the breakthrough toward independent 3249

results based on initial background. In some articles are titled “0039 — Closing 3250

Numbers and Super-Closing Numbers as (Dual)Resolving and (Dual)Coloring alongside 3251

(Dual)Dominating in (Neutrosophic)n-SuperHyperGraph” in Ref. [5] by Henry Garrett 3252

(2022), “0049 — (Failed)1-Zero-Forcing Number in Neutrosophic Graphs” in Ref. [6] by 3253

Henry Garrett (2022), “Extreme SuperHyperClique as the Firm Scheme of 3254

Confrontation under Cancer’s Recognition as the Model in The Setting of 3255

(Neutrosophic) SuperHyperGraphs” in Ref. [7] by Henry Garrett (2022), “Uncertainty 3256

On The Act And Effect Of Cancer Alongside The Foggy Positions Of Cells Toward 3257

Neutrosophic Failed SuperHyperClique inside Neutrosophic SuperHyperGraphs Titled 3258

Cancer’s Recognition” in Ref. [8] by Henry Garrett (2022), “Neutrosophic Version Of 3259

Separates Groups Of Cells In Cancer’s Recognition On Neutrosophic SuperHyperGraphs” 3260

in Ref. [9] by Henry Garrett (2022), “The Shift Paradigm To Classify Separately The 3261

Cells and Affected Cells Toward The Totality Under Cancer’s Recognition By New 3262

Multiple Definitions On the Sets Polynomials Alongside Numbers In The (Neutrosophic) 3263

SuperHyperMatching Theory Based on SuperHyperGraph and Neutrosophic 3264

SuperHyperGraph” in Ref. [10] by Henry Garrett (2022), “Breaking the Continuity and 3265

Uniformity of Cancer In The Worst Case of Full Connections With Extreme Failed 3266

SuperHyperClique In Cancer’s Recognition Applied in (Neutrosophic) SuperHyperGraphs” 3267

in Ref. [11] by Henry Garrett (2022), “Neutrosophic Failed SuperHyperStable as the 3268

Survivors on the Cancer’s Neutrosophic Recognition Based on Uncertainty to All Modes 3269

in Neutrosophic SuperHyperGraphs” in Ref. [12] by Henry Garrett (2022), “Extremism 3270

of the Attacked Body Under the Cancer’s Circumstances Where Cancer’s Recognition 3271

Titled (Neutrosophic) SuperHyperGraphs” in Ref. [13] by Henry Garrett (2022), 3272

“(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Recognitions And 3273

(Neutrosophic) SuperHyperGraphs” in Ref. [14] by Henry Garrett (2022), “Neutrosophic 3274

Messy-Style SuperHyperGraphs To Form Neutrosophic SuperHyperStable To Act on 3275

Cancer’s Neutrosophic Recognitions In Special ViewPoints” in Ref. [15] by Henry 3276

Garrett (2022), “Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction 3277

To Use Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition And 3278

Beyond ” in Ref. [16] by Henry Garrett (2022), “(Neutrosophic) SuperHyperStable on 3279

Cancer’s Recognition by Well- SuperHyperModelled (Neutrosophic) SuperHyperGraphs ” 3280

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

in Ref. [17] by Henry Garrett (2022), “Neutrosophic Messy-Style SuperHyperGraphs To 3281

Form Neutrosophic SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In 3282

Special ViewPoints” in Ref. [13] by Henry Garrett (2022), “Basic Notions on 3283

(Neutrosophic) SuperHyperForcing And (Neutrosophic) SuperHyperModeling in Cancer’s 3284

Recognitions And (Neutrosophic) SuperHyperGraphs” in Ref. [18] by Henry Garrett 3285

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

SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints” 3287

in Ref. [19] by Henry Garrett (2022),“(Neutrosophic) SuperHyperModeling of Cancer’s 3288

Recognitions Featuring (Neutrosophic) SuperHyperDefensive SuperHyperAlliances” in 3289

Ref. [20] by Henry Garrett (2022), “(Neutrosophic) SuperHyperAlliances With 3290

SuperHyperDefensive and SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) 3291

SuperHyperGraph With (Neutrosophic) SuperHyperModeling of Cancer’s Recognitions 3292

And Related (Neutrosophic) SuperHyperClasses” in Ref. [21] by Henry Garrett (2022), 3293

“SuperHyperGirth on SuperHyperGraph and Neutrosophic SuperHyperGraph With 3294

SuperHyperModeling of Cancer’s Recognitions” in Ref. [22] by Henry Garrett (2022), 3295

“Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic 3296

SuperHyperGraphs and SuperHyperGraphs Alongside Applications in Cancer’s 3297

Treatments” in Ref. [23] by Henry Garrett (2022), “SuperHyperDominating and 3298

SuperHyperResolving on Neutrosophic SuperHyperGraphs And Their Directions in 3299

Game Theory and Neutrosophic SuperHyperClasses” in Ref. [24] by Henry Garrett 3300

(2022), “SuperHyperMatching By (R-)Definitions And Polynomials To Monitor 3301

Cancer’s Recognition In Neutrosophic SuperHyperGraphs” in Ref. [159] by Henry 3302

Garrett (2023), “The Focus on The Partitions Obtained By Parallel Moves In The 3303

Cancer’s Extreme Recognition With Different Types of Extreme SuperHyperMatching Set 3304

and Polynomial on (Neutrosophic) SuperHyperGraphs” in Ref. [160] by Henry Garrett 3305

(2023), “Extreme Failed SuperHyperClique Decides the Failures on the Cancer’s 3306

Recognition in the Perfect Connections of Cancer’s Attacks By SuperHyperModels 3307

Named (Neutrosophic) SuperHyperGraphs” in Ref. [161] by Henry Garrett (2023), 3308

“Indeterminacy On The All Possible Connections of Cells In Front of Cancer’s Attacks 3309

In The Terms of Neutrosophic Failed SuperHyperClique on Cancer’s Recognition called 3310

Neutrosophic SuperHyperGraphs” in Ref. [162] by Henry Garrett (2023), “Perfect 3311

Directions Toward Idealism in Cancer’s Neutrosophic Recognition Forwarding 3312

Neutrosophic SuperHyperClique on Neutrosophic SuperHyperGraphs” in Ref. [165] by 3313

Henry Garrett (2023), “Demonstrating Complete Connections in Every Embedded 3314

Regions and Sub-Regions in the Terms of Cancer’s Recognition and (Neutrosophic) 3315

SuperHyperGraphs With (Neutrosophic) SuperHyperClique” in Ref. [166] by Henry 3316

Garrett (2023), “Different Neutrosophic Types of Neutrosophic Regions titled 3317

neutrosophic Failed SuperHyperStable in Cancer’s Neutrosophic Recognition modeled in 3318

the Form of Neutrosophic SuperHyperGraphs” in Ref. [169] by Henry Garrett (2023), 3319

“Using the Tool As (Neutrosophic) Failed SuperHyperStable To SuperHyperModel 3320

Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs” in Ref. [172] by Henry 3321

Garrett (2023), “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic 3322

SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints” 3323

in Ref. [173] by Henry Garrett (2023), “(Neutrosophic) SuperHyperStable on Cancer’s 3324

Recognition by Well-SuperHyperModelled (Neutrosophic) SuperHyperGraphs” in 3325

Ref. [174] by Henry Garrett (2023), “Neutrosophic 1-Failed SuperHyperForcing in the 3326

SuperHyperFunction To Use Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic 3327

Recognition And Beyond ” in Ref. [175] by Henry Garrett (2022), “(Neutrosophic) 3328

1-Failed SuperHyperForcing in Cancer’s Recognitions And (Neutrosophic) 3329

SuperHyperGraphs” in Ref. [176] by Henry Garrett (2022), “Basic Notions on 3330

(Neutrosophic) SuperHyperForcing And (Neutrosophic) SuperHyperModeling in Cancer’s 3331

Recognitions And (Neutrosophic) SuperHyperGraphs” in Ref. [177] by Henry Garrett 3332

(2022), “Basic Neutrosophic Notions Concerning SuperHyperDominating and 3333

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

Neutrosophic SuperHyperResolving in SuperHyperGraph” in Ref. [188] by Henry 3334

Garrett (2022), “Initial Material of Neutrosophic Preliminaries to Study Some 3335

Neutrosophic Notions Based on Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic 3336

SuperHyperGraph (NSHG)” in Ref. [189] by Henry Garrett (2022), and [4–189], there 3337

are some endeavors to formalize the basic SuperHyperNotions about neutrosophic 3338

SuperHyperGraph and SuperHyperGraph alongside scientific research books 3339

at [190–297]. Two popular scientific research books in Scribd in the terms of high 3340

readers, 4190 and 5189 respectively, on neutrosophic science is on [298, 299]. 3341

Some scientific studies and scientific researches about neutrosophic graphs, are 3342

proposed as book in Ref. [286] by Henry Garrett (2023) which is indexed by Google 3343

Scholar and has more than 4331 readers in Scribd. It’s titled “Beyond Neutrosophic 3344

Graphs” and published by Dr. Henry Garrett. This research book covers different types 3345

of notions and settings in neutrosophic graph theory and neutrosophic 3346

SuperHyperGraph theory. 3347

Also, some scientific studies and scientific researches about neutrosophic graphs, are 3348

proposed as book in Ref. [287] by Henry Garrett (2023) which is indexed by Google 3349

Scholar and has more than 5327 readers in Scribd. It’s titled “Neutrosophic Duality” 3350

and published by Dr. Henry Garrett. This research book presents different types of 3351

notions SuperHyperResolving and SuperHyperDominating in the setting of duality in 3352

neutrosophic graph theory and neutrosophic SuperHyperGraph theory. This research 3353

book has scrutiny on the complement of the intended set and the intended set, 3354

simultaneously. It’s smart to consider a set but acting on its complement that what’s 3355

done in this research book which is popular in the terms of high readers in Scribd. 3356

See the seminal scientific researches [1–3]. The formalization of the notions on the 3357

framework of notions in SuperHyperGraphs, Neutrosophic notions in 3358

SuperHyperGraphs theory, and (Neutrosophic) SuperHyperGraphs theory at [4–189] 3359

alongside scientific research books at [190–297]. Two popular scientific research books 3360

in Scribd in the terms of high readers, 4331 and 5327 respectively, on neutrosophic 3361

science is on [298, 299]. 3362

References 3363

1. Henry Garrett, “Super Hyper Dominating and Super Hyper Resolving on 3364

Neutrosophic Super Hyper Graphs and Their Directions in Game Theory and 3365

Neutrosophic Super Hyper Classes”, J Math Techniques Comput Math 1(3) 3366

(2022) 242-263. (doi: 10.33140/JMTCM.01.03.09) 3367

2. Henry Garrett, “Some Super Hyper Degrees and Co-Super Hyper Degrees on 3368

Neutrosophic Super Hyper Graphs And Super Hyper Graphs Alongside 3369

Applications in Cancer’s Treatments”, J Math Techniques Comput Math 2(1) 3370

(2023) 35-47. (https://www.opastpublishers.com/open-access-articles/some- 3371

super-hyper-degrees-and-cosuper-hyper-degrees-on-neutrosophic-super-hyper- 3372

graphs-and-super-hyper-graphs-alongside-a.pdf) 3373

3. Henry Garrett, “A Research on Cancer’s Recognition and Neutrosophic Super 3374

Hypergraph by Eulerian Super Hyper Cycles and Hamiltonian Sets as Hyper 3375

Covering Versus Super separations”, J Math Techniques Comput Math 2(3) 3376

(2023) 136-148. (https://www.opastpublishers.com/open-access-articles/a- 3377

research-on-cancers-recognition-and-neutrosophic-super-hypergraph-by- 3378

eulerian-super-hyper-cycles-and-hamiltonian-sets-.pdf) 3379

4. Henry Garrett, “Neutrosophic Co-degree and Neutrosophic Degree alongside 3380

Chromatic Numbers in the Setting of Some Classes Related to Neutrosophic 3381

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

Hypergraphs”, J Curr Trends Comp Sci Res 2(1) (2023) 16-24. 3382

(https://www.opastpublishers.com/open-access-articles/neutrosophic-codegree- 3383

and-neutrosophic-degree-alongside-chromatic-numbers-in-the-setting-of-some- 3384

classes-related-to-neut.pdf) 3385

5. Garrett, Henry. “0039 — Closing Numbers and Super-Closing Numbers as 3386

(Dual)Resolving and (Dual)Coloring alongside (Dual)Dominating in 3387

(Neutrosophic)n-SuperHyperGraph.” CERN European Organization for Nuclear 3388

Research - Zenodo, Nov. 2022. CERN European Organization for Nuclear 3389

Research, https://doi.org/10.5281/zenodo.6319942. 3390

https://oa.mg/work/10.5281/zenodo.6319942 3391

6. Garrett, Henry. “0049 — (Failed)1-Zero-Forcing Number in Neutrosophic 3392

Graphs.” CERN European Organization for Nuclear Research - Zenodo, Feb. 3393

2022. CERN European Organization for Nuclear Research, 3394

https://doi.org/10.13140/rg.2.2.35241.26724. 3395

https://oa.mg/work/10.13140/rg.2.2.35241.26724 3396

7. Henry Garrett, “Extreme SuperHyperClique as the Firm Scheme of 3397

Confrontation under Cancer’s Recognition as the Model in The Setting of 3398

(Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010308 (doi: 3399

10.20944/preprints202301.0308.v1). 3400

8. Henry Garrett, “Uncertainty On The Act And Effect Of Cancer Alongside The 3401

Foggy Positions Of Cells Toward Neutrosophic Failed SuperHyperClique inside 3402

Neutrosophic SuperHyperGraphs Titled Cancer’s Recognition”, Preprints 2023, 3403

2023010282 (doi: 10.20944/preprints202301.0282.v1). 3404

9. Henry Garrett, “Neutrosophic Version Of Separates Groups Of Cells In 3405

Cancer’s Recognition On Neutrosophic SuperHyperGraphs”, Preprints 2023, 3406

2023010267 (doi: 10.20944/preprints202301.0267.v1). 3407

10. Henry Garrett, “The Shift Paradigm To Classify Separately The Cells and 3408

Affected Cells Toward The Totality Under Cancer’s Recognition By New 3409

Multiple Definitions On the Sets Polynomials Alongside Numbers In The 3410

(Neutrosophic) SuperHyperMatching Theory Based on SuperHyperGraph and 3411

Neutrosophic SuperHyperGraph”, Preprints 2023, 2023010265 (doi: 3412

10.20944/preprints202301.0265.v1). 3413

11. Henry Garrett, “Breaking the Continuity and Uniformity of Cancer In The 3414

Worst Case of Full Connections With Extreme Failed SuperHyperClique In 3415

Cancer’s Recognition Applied in (Neutrosophic) SuperHyperGraphs”, Preprints 3416

2023, 2023010262,(doi: 10.20944/preprints202301.0262.v1). 3417

12. Henry Garrett, “Neutrosophic Failed SuperHyperStable as the Survivors on the 3418

Cancer’s Neutrosophic Recognition Based on Uncertainty to All Modes in 3419

Neutrosophic SuperHyperGraphs”, Preprints 2023, 2023010240 (doi: 3420

10.20944/preprints202301.0240.v1). 3421

13. Henry Garrett, “Extremism of the Attacked Body Under the Cancer’s 3422

Circumstances Where Cancer’s Recognition Titled (Neutrosophic) 3423

SuperHyperGraphs”, Preprints 2023, 2023010224, (doi: 3424

10.20944/preprints202301.0224.v1). 3425

14. Henry Garrett, “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s 3426

Recognitions And (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 3427

2023010105 (doi: 10.20944/preprints202301.0105.v1). 3428

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

15. Henry Garrett, “Neutrosophic Messy-Style SuperHyperGraphs To Form 3429

Neutrosophic SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions 3430

In Special ViewPoints”, Preprints 2023, 2023010088 (doi: 3431

10.20944/preprints202301.0088.v1). 3432

16. Henry Garrett, “Neutrosophic 1-Failed SuperHyperForcing in the 3433

SuperHyperFunction To Use Neutrosophic SuperHyperGraphs on Cancer’s 3434

Neutrosophic Recognition And Beyond ”, Preprints 2023, 2023010044 3435

17. Henry Garrett, “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by 3436

Well- SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 3437

2023010043 (doi: 10.20944/preprints202301.0043.v1). 3438

18. Henry Garrett, “Basic Notions on (Neutrosophic) SuperHyperForcing And 3439

(Neutrosophic) SuperHyperModeling in Cancer’s Recognitions And 3440

(Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010105 (doi: 3441

10.20944/preprints202301.0105.v1). 3442

19. Henry Garrett, “Neutrosophic Messy-Style SuperHyperGraphs To Form 3443

Neutrosophic SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions 3444

In Special ViewPoints”, Preprints 2023, 2023010088 (doi: 3445

10.20944/preprints202301.0088.v1). 3446

20. Henry Garrett, “(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions 3447

Featuring (Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, Preprints 3448

2022, 2022120549 (doi: 10.20944/preprints202212.0549.v1). 3449

21. Henry Garrett, “(Neutrosophic) SuperHyperAlliances With SuperHyperDefensive 3450

and SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) 3451

SuperHyperGraph With (Neutrosophic) SuperHyperModeling of Cancer’s 3452

Recognitions And Related (Neutrosophic) SuperHyperClasses”, Preprints 2022, 3453

2022120540 (doi: 10.20944/preprints202212.0540.v1). 3454

22. Henry Garrett, “SuperHyperGirth on SuperHyperGraph and Neutrosophic 3455

SuperHyperGraph With SuperHyperModeling of Cancer’s Recognitions”, 3456

Preprints 2022, 2022120500 (doi: 10.20944/preprints202212.0500.v1). 3457

23. Henry Garrett, “Some SuperHyperDegrees and Co-SuperHyperDegrees on 3458

Neutrosophic SuperHyperGraphs and SuperHyperGraphs Alongside Applications 3459

in Cancer’s Treatments”, Preprints 2022, 2022120324 (doi: 3460

10.20944/preprints202212.0324.v1). 3461

24. Henry Garrett, “SuperHyperDominating and SuperHyperResolving on 3462

Neutrosophic SuperHyperGraphs And Their Directions in Game Theory and 3463

Neutrosophic SuperHyperClasses”, Preprints 2022, 2022110576 (doi: 3464

10.20944/preprints202211.0576.v1). 3465

25. Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic 3466

SuperHyperGraph By Eulerian-Cycle-Neighbor As Hyper Nebbish On Super 3467

Nebulous”, Zenodo 2023, (doi: 10.5281/zenodo.7857856). 3468

26. Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of 3469

Eulerian-Cycle-Neighbor In Recognition of Cancer With (Neutrosophic) 3470

SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zenodo.7857841). 3471

27. Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic 3472

SuperHyperGraph By Eulerian-Cycle-Decomposition As Hyper Decompress On 3473

Super Decompensation”, Zenodo 2023, (doi: 10.5281/zenodo.7855661). 3474

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

28. Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of 3475

Eulerian-Cycle-Decomposition In Recognition of Cancer With (Neutrosophic) 3476

SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zenodo.7855637). 3477

29. Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic 3478

SuperHyperGraph By Eulerian-Cycle-Cut As Hyper Eulogy On Super EULA”, 3479

Zenodo 2023, (doi: 10.5281/zenodo.7853867). 3480

30. Henry Garrett, “New Ideas On Super EULA By Hyper Eulogy Of 3481

Eulerian-Cycle-Cut In Recognition of Cancer With (Neutrosophic) 3482

SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zenodo.7853922). 3483

31. Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic 3484

SuperHyperGraph By Eulerian-Type-Path-Neighbor As Hyper Nebbish On Super 3485

Nebulous”, Zenodo 2023, (doi: 10.5281/zenodo.7851519). 3486

32. Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of 3487

Eulerian-Type-Path-Neighbor In Cancer’s Recognition With (Neutrosophic) 3488

SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zenodo.7851550). 3489

33. Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic 3490

SuperHyperGraph By Eulerian-Type-Path-Decomposition As Hyper Decompress 3491

On Super Decompensation”, Zenodo 2023, (doi: 10.5281/zenodo.7839333). 3492

34. Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of 3493

Eulerian-Type-Path-Decomposition In Cancer’s Recognition With (Neutrosophic) 3494

SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zenodo.7840206). 3495

35. Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic 3496

SuperHyperGraph By Eulerian-Type-Path-Cut As Hyper Eulogy On Super 3497

EULA”, Zenodo 2023, (doi: 10.5281/zenodo.7834229). 3498

36. Henry Garrett, “New Ideas On Super EULA By Hyper Eulogy Of 3499

Eulerian-Type-Path-Cut In Cancer’s Recognition With (Neutrosophic) 3500

SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zenodo.7834261). 3501

37. Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic 3502

SuperHyperGraph By Eulerian-Path-Neighbor As Hyper Nebbish On Super 3503

Nebulous”, Zenodo 2023, (doi: 10.5281/zenodo.7824560). 3504

38. Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of 3505

Eulerian-Path-Neighbor In Cancer’s Recognition With (Neutrosophic) 3506

SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zenodo.7824623). 3507

39. Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic 3508

SuperHyperGraph By Eulerian-Path-Decomposition As Hyper Decompress On 3509

Super Decompensation”, Zenodo 2023, (doi: 10.5281/zenodo.7819531). 3510

40. Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of 3511

Eulerian-Path-Decomposition In Cancer’s Recognition With (Neutrosophic) 3512

SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zenodo.7819579). 3513

41. Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic 3514

SuperHyperGraph As Hyper Tool On Super Toot”, Zenodo 2023, (doi: 3515

10.5281/zenodo.7812236). 3516

42. Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic 3517

SuperHyperGraph By initial Eulerian-Path-Cut As Hyper initial Eulogy On 3518

Super initial EULA”, Zenodo 2023, (doi: 10.5281/zenodo.7809365). 3519

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

43. Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic 3520

SuperHyperGraph By Eulerian-Path-Cut As Hyper Eulogy-Path-Cut On Super 3521

EULA-Path-Cut”, Zenodo 2023, (doi: 10.5281/zenodo.7809358). 3522

44. Henry Garrett, “New Ideas On Super EULA By Hyper Eulogy Of 3523

Eulerian-Path-Cut In Cancer’s Recognition With (Neutrosophic) 3524

SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zenodo.7809219). 3525

45. Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic 3526

SuperHyperGraph By Eulerian-Path-Cut As Hyper Eulogy On Super EULA”, 3527

Zenodo 2023, (doi: 10.5281/zenodo.7809328). 3528

46. Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic 3529

SuperHyperGraph By Hamiltonian-Type-Cycle-Neighbor As Hyper Nebbish On 3530

Super Nebulous”, Zenodo 2023, (doi: 10.5281/zenodo.7806767). 3531

47. Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of 3532

Hamiltonian-Type-Cycle-Neighbor In Cancer’s Recognition With (Neutrosophic) 3533

SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zenodo.7806838). 3534

48. Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic 3535

SuperHyperGraph By Hamiltonian-Type-Cycle-Decomposition As Hyper 3536

Decompress On Super Decompensation”, Zenodo 2023, (doi: 3537

10.5281/zenodo.7804238). 3538

49. Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of 3539

Hamiltonian-Type-Cycle-Decomposition In Cancer’s Recognition With 3540

(Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zenodo.7804228). 3541

50. Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic 3542

SuperHyperGraph By Hamiltonian-Type-Cycle-Cut As Hyper Hamper On Super 3543

Hammy”, Zenodo 2023, (doi: 10.5281/zenodo.7799902). 3544

51. Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of 3545

Hamiltonian-Type-Cycle-Cut In Recognition of Cancer With (Neutrosophic) 3546

SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zenodo.7804218). 3547

52. Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic 3548

SuperHyperGraph By Hamiltonian-Cycle-Neighbor As Hyper Nebbish On Super 3549

Nebulous”, Zenodo 2023, (doi: 10.5281/zenodo.7796334). 3550

53. Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic 3551

SuperHyperGraph By Hamiltonian-Cycle-Decomposition As Hyper Decompress 3552

On Super Decompensation”, Zenodo 2023, (doi: 10.5281/zenodo.7793372). 3553

54. Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic 3554

SuperHyperGraph By Hamiltonian-Cycle-Cut As Hyper Hamper On Super 3555

Hammy”, Zenodo 2023, (doi: 10.5281/zenodo.7791952). 3556

55. Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of 3557

Hamiltonian-Cycle-Cut In Recognition of Cancer With (Neutrosophic) 3558

SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zenodo.7791982). 3559

56. Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic 3560

SuperHyperGraph By Hamiltonian-Neighbor As Hyper Nebbish On Super 3561

Nebulous”, Zenodo 2023, (doi: 10.5281/zenodo.7790026). 3562

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

57. Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of 3563

Hamiltonian-Neighbor In Recognition of Cancer With (Neutrosophic) 3564

SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zenodo.7790052). 3565

58. Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic 3566

SuperHyperGraph By Hamiltonian-Decomposition As Hyper Decompress On 3567

Super Decompensation”, Zenodo 2023, (doi: 10.5281/zenodo.7787066). 3568

59. Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of 3569

Hamiltonian-Decomposition In Recognition of Cancer With (Neutrosophic) 3570

SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zenodo.7787094). 3571

60. Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic 3572

SuperHyperGraph By Hamiltonian-Cut As Hyper Hamper On Super Hammy”, 3573

Zenodo 2023, (doi: 10.5281/zenodo.7781476). 3574

61. Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of 3575

Hamiltonian-Cut In Recognition of Cancer With (Neutrosophic) 3576

SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zenodo.7783082). 3577

62. Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic 3578

SuperHyperGraph By Trace-Neighbor As Hyper Nebbish On Super Nebulous”, 3579

Zenodo 2023, (doi: 10.5281/zenodo.7777857). 3580

63. Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of 3581

Trace-Neighbor In Recognition of Cancer With (Neutrosophic) 3582

SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zenodo.7779286). 3583

64. Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic 3584

SuperHyperGraph By Trace-Decomposition As Hyper Decompress On Super 3585

Decompensation”, Zenodo 2023, (doi: 10.5281/zenodo.7771831). 3586

65. Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of 3587

Trace-Decomposition In Cancer’s Recognition With (Neutrosophic) 3588

SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zenodo.7772468). 3589

66. Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic 3590

SuperHyperGraph By Trace-Cut As Hyper Nebbish On Super Nebulous”, 3591

ResearchGate 2023, (doi: 10.13140/RG.2.2.20913.25446). 3592

67. Henry Garrett, “New Ideas On Super Tract By Hyper Track Of Trace-Cut In 3593

Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, 3594

(doi: 10.5281/zenodo.7764916). 3595

68. Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic 3596

SuperHyperGraph By Edge-Neighbor As Hyper Nebbish On Super Nebulous”, 3597

ResearchGate 2023, (doi: 10.13140/RG.2.2.11770.98247). 3598

69. Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of 3599

Edge-Neighbor In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 3600

ResearchGate 2023, (doi: 10.13140/RG.2.2.12400.12808). 3601

70. Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic 3602

SuperHyperGraph By Edge-Decomposition As Hyper Decompress On Super 3603

Decompensation”, ResearchGate 2023, (doi: 10.13140/RG.2.2.22545.10089). 3604

71. Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of 3605

Edge-Decomposition In Cancer’s Recognition With (Neutrosophic) 3606

SuperHyperGraph”, ResearchGate 2023, (doi: 10.13140/RG.2.2.29544.34564). 3607

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

72. Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic 3608

SuperHyperGraph By Edge-Cut As Hyper Edify On Super Eddy”, ResearchGate 3609

2023, (doi: 10.13140/RG.2.2.11377.76644). 3610

73. Henry Garrett, “New Ideas On Super Eddy By Hyper Edify Of Edge-Cut In 3611

Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 3612

2023, (doi: 10.13140/RG.2.2.23750.96329). 3613

74. Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic 3614

SuperHyperGraph By Vertex-Neighbor As Hyper Nebbish On Super Nebulous”, 3615

ResearchGate 2023, (doi: 10.13140/RG.2.2.31366.24641). 3616

75. Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of 3617

Vertex-Neighbor In Cancer’s Recognition With (Neutrosophic) 3618

SuperHyperGraph”, ResearchGate 2023, (doi: 10.13140/RG.2.2.34721.68960). 3619

76. Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic 3620

SuperHyperGraph By Vertex-Decomposition As Hyper Decompress On Super 3621

Decompensation”, ResearchGate 2023, (doi: 10.13140/RG.2.2.30212.81289). 3622

77. Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of 3623

Vertex-Decomposition In Cancer’s Recognition With (Neutrosophic) 3624

SuperHyperGraph”, ResearchGate 2023, (doi: 10.13140/RG.2.2.18468.76169). 3625

78. Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic 3626

SuperHyperGraph By Vertex-Cut As Hyper Vertu On Super Vertigo”, 3627

ResearchGate 2023, (doi: 10.13140/RG.2.2.24288.35842). 3628

79. Henry Garrett, “New Ideas On Super Vertigo By Hyper Vertu Of Vertex-Cut In 3629

Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 3630

2023, (doi: 10.13140/RG.2.2.32467.25124). 3631

80. Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic 3632

SuperHyperGraph By Stable-Neighbor As Hyper Nebbish On Super Nebulous”, 3633

ResearchGate 2023, (doi: 10.13140/RG.2.2.31025.45925). 3634

81. Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of 3635

Stable-Neighbor In Cancer’s Recognition With (Neutrosophic) 3636

SuperHyperGraph”, ResearchGate 2023, (doi: 10.13140/RG.2.2.17184.25602). 3637

82. Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic 3638

SuperHyperGraph By Stable-Decompositions As Hyper Stain On Super Stagy”, 3639

ResearchGate 2023, (doi: 10.13140/RG.2.2.23423.28327). 3640

83. Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of 3641

Stable-Decompositions In Cancer’s Recognition With (Neutrosophic) 3642

SuperHyperGraph”, ResearchGate 2023, (doi: 10.13140/RG.2.2.28456.44805). 3643

84. Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic 3644

SuperHyperGraph By Stable-Cut As Hyper Stain On Super Stagy”, 3645

ResearchGate 2023, (doi: 10.13140/RG.2.2.23525.68320). 3646

85. Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Cut In 3647

Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 3648

2023, (doi: 10.13140/RG.2.2.20170.24000). 3649

86. Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic 3650

SuperHyperGraph By Clique-Neighbors As Hyper Nebbish On Super Nebulous”, 3651

ResearchGate 2023, (doi: 10.13140/RG.2.2.36475.59683). 3652

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

87. Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of 3653

Clique-Neighbors In Cancer’s Recognition With (Neutrosophic) 3654

SuperHyperGraph”, ResearchGate 2023, (doi: 10.13140/RG.2.2.29764.71046). 3655

88. Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic 3656

SuperHyperGraph By Clique-Decompositions As Hyper Decompile On Super 3657

Decommission”, ResearchGate 2023, (doi: 10.13140/RG.2.2.18780.87683). 3658

89. Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of 3659

Clique- Decompositions In Cancer’s Recognition With (Neutrosophic) 3660

SuperHyperGraph”, ResearchGate 2023, (doi: 10.13140/RG.2.2.27169.48487). 3661

90. Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic 3662

SuperHyperGraph By Clique-Cut As Hyper Click On Super Cliche”, 3663

ResearchGate 2023, (doi: 10.13140/RG.2.2.26134.01603). 3664

91. Henry Garrett, “New Ideas On Super Cliff By Hyper Cling Of Clique-Cut In 3665

Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 3666

2023, (doi: 10.13140/RG.2.2.27392.30721). 3667

92. Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic 3668

SuperHyperGraph By Space As Hyper Spin On Super Spacy”, ResearchGate 3669

2023, (doi: 10.13140/RG.2.2.33028.40321). 3670

93. Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic 3671

SuperHyperGraph By List- Coloring As Hyper List On Super Lisle”, 3672

ResearchGate 2023, (doi: 10.13140/RG.2.2.21389.20966). 3673

94. Henry Garrett, “New Ideas On Super Lith By Hyper Lite Of List-Coloring In 3674

Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 3675

2023, (doi: 10.13140/RG.2.2.16356.04489). 3676

95. Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic 3677

SuperHyperGraph By Space As Hyper Sparse On Super Spark ”, ResearchGate 3678

2023, (doi: 10.13140/RG.2.2.21756.21129). 3679

96. Henry Garrett, “New Ideas On Super Solidarity By Hyper Soul Of Space In 3680

Cancer’s Recognition With (Extreme) SuperHyperGraph”, ResearchGate 2023, 3681

(doi: 10.13140/RG.2.2.30983.68009). 3682

97. Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic 3683

SuperHyperGraph By Edge-Connectivity As Hyper Disclosure On Super 3684

Closure”, ResearchGate 2023, (doi: 10.13140/RG.2.2.28552.29445). 3685

98. Henry Garrett, “New Ideas On Super Uniform By Hyper Deformation Of 3686

Edge-Connectivity In Cancer’s Recognition With (Neutrosophic) 3687

SuperHyperGraph”, ResearchGate 2023, (doi: 10.13140/RG.2.2.10936.21761). 3688

99. Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic 3689

SuperHyperGraph By Vertex-Connectivity As Hyper Leak On Super Structure”, 3690

ResearchGate 2023, (doi: 10.13140/RG.2.2.35105.89447). 3691

100. Henry Garrett, “New Ideas On Super System By Hyper Explosions Of 3692

Vertex-Connectivity In Cancer’s Recognition With (Neutrosophic) 3693

SuperHyperGraph”, ResearchGate 2023, (doi: 10.13140/RG.2.2.30072.72960). 3694

101. Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic 3695

SuperHyperGraph By Tree-Decomposition As Hyper Forward On Super Returns”, 3696

ResearchGate 2023, (doi: 10.13140/RG.2.2.31147.52003). 3697

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

102. Henry Garrett, “New Ideas On Super Nodes By Hyper Moves Of 3698

Tree-Decomposition In Cancer’s Recognition With (Neutrosophic) 3699

SuperHyperGraph”, ResearchGate 2023, (doi: 10.13140/RG.2.2.32825.24163). 3700

103. Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic 3701

SuperHyperGraph By Chord As Hyper Excellence On Super Excess”, 3702

ResearchGate 2023, (doi: 10.13140/RG.2.2.13059.58401). 3703

104. Henry Garrett, “New Ideas On Super Gap By Hyper Navigations Of Chord In 3704

Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 3705

2023, (doi: 10.13140/RG.2.2.11172.14720). 3706

105. Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic 3707

SuperHyperGraph By SuperHyper(i,j)-Domination As Hyper Controller On 3708

Super Waves”, ResearchGate 2023, (doi: 10.13140/RG.2.2.22011.80165). 3709

106. Henry Garrett, “New Ideas On Super Coincidence By Hyper Routes Of 3710

SuperHyper(i,j)-Domination In Cancer’s Recognition With (Neutrosophic) 3711

SuperHyperGraph”, ResearchGate 2023, (doi: 10.13140/RG.2.2.30819.84003). 3712

107. Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic 3713

SuperHyperGraph By SuperHyperEdge-Domination As Hyper Reversion On 3714

Super Indirection”, ResearchGate 2023, (doi: 10.13140/RG.2.2.10493.84962). 3715

108. Henry Garrett, “New Ideas On Super Obstacles By Hyper Model Of 3716

SuperHyperEdge-Domination In Cancer’s Recognition With (Neutrosophic) 3717

SuperHyperGraph”, ResearchGate 2023, (doi: 10.13140/RG.2.2.13849.29280). 3718

109. Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic 3719

SuperHyperGraph By SuperHyperK-Domination As Hyper k-Actions On Super 3720

Patterns”, ResearchGate 2023, (doi: 10.13140/RG.2.2.19944.14086). 3721

110. Henry Garrett, “New Ideas On Super Harmony By Hyper k-Function Of 3722

SuperHyperK-Domination In Cancer’s Recognition With (Neutrosophic) 3723

SuperHyperGraph”, ResearchGate 2023, (doi: 10.13140/RG.2.2.23299.58404). 3724

111. Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic 3725

SuperHyperGraph By SuperHyperK-Number As Hyper k-Partition On Super 3726

Layers”, ResearchGate 2023, (doi: 10.13140/RG.2.2.33103.76968). 3727

112. Henry Garrett, “New Ideas On Super Gradient By Hyper k-Class Of 3728

SuperHyperK-Number In Cancer’s Recognition With (Neutrosophic) 3729

SuperHyperGraph”, ResearchGate 2023, (doi: 10.13140/RG.2.2.23037.44003). 3730

113. Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic 3731

SuperHyperGraph By SuperHyperOrder As Hyper Enumerations On Super 3732

Landmarks”, ResearchGate 2023, (doi: 10.13140/RG.2.2.35646.56641). 3733

114. Henry Garrett, “New Ideas On Super Analogous By Hyper Visions Of 3734

SuperHyperOrder In Cancer’s Recognition With (Neutrosophic) 3735

SuperHyperGraph”, ResearchGate 2023, (doi: 10.13140/RG.2.2.18030.48967). 3736

115. Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic 3737

SuperHyperGraph By SuperHyperColoring As Hyper Categories On Super 3738

Neighbors”, ResearchGate 2023, (doi: 10.13140/RG.2.2.13973.81121). 3739

116. Henry Garrett, “New Ideas On Super Relations By Hyper Identifications Of 3740

SuperHyperColoring In Cancer’s Recognition With (Neutrosophic) 3741

SuperHyperGraph”, ResearchGate 2023, (doi: 10.13140/RG.2.2.34106.47047). 3742

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

117. Henry Garrett, “New Ideas On Super Contradiction By Hyper Detection of 3743

SuperHyperDefensive In Cancer’s Neutrosophic Recognition and Neutrosophic 3744

SuperHyperGraph”, ResearchGate 2023, (doi: 10.13140/RG.2.2.13397.09446). 3745

118. Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic 3746

SuperHyperGraph By SuperHyperDimension As Hyper Distinguishing On Super 3747

Distances”, ResearchGate 2023, (doi: 10.13140/RG.2.2.31956.88961). 3748

119. Henry Garrett, “New Ideas On Super Locations By Hyper Differing Of 3749

SuperHyperDimension In Cancer’s Recognition With (Neutrosophic) 3750

SuperHyperGraph”, ResearchGate 2023, (doi: 10.13140/RG.2.2.15179.67361). 3751

120. Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic 3752

SuperHyperGraph By SuperHyperDominating As Hyper Closing On Super 3753

Messy”, ResearchGate 2023, (doi: 10.13140/RG.2.2.21510.45125). 3754

121. Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of 3755

SuperHyperDominating In Cancer’s Recognition With (Neutrosophic) 3756

SuperHyperGraph”, ResearchGate 2023, (doi: 10.13140/RG.2.2.13121.84321). 3757

122. Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic 3758

SuperHyperGraph By SuperHyperConnected As Hyper Group On Super Surge”, 3759

ResearchGate 2023, (doi: 10.13140/RG.2.2.11758.69441). 3760

123. Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of 3761

SuperHyperConnected In Cancer’s Recognition With (Neutrosophic) 3762

SuperHyperGraph”, ResearchGate 2023, (doi: 10.13140/RG.2.2.31891.35367). 3763

124. Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic 3764

SuperHyperGraph By SuperHyperTotal As Hyper Covering On Super Infections”, 3765

ResearchGate 2023, (doi: 10.13140/RG.2.2.19360.87048). 3766

125. Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of 3767

SuperHyperTotal In Cancer’s Recognition with (Neutrosophic) 3768

SuperHyperGraph”, ResearchGate 2023, (doi: 10.13140/RG.2.2.32363.21286). 3769

126. Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of 3770

SuperHyperPerfect In Cancer’s Recognition with (Neutrosophic) 3771

SuperHyperGraph”, ResearchGate 2023, (doi: 10.13140/RG.2.2.23266.81602). 3772

127. Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic 3773

SuperHyperGraph By SuperHyperPerfect As Hyper Idealism On Super Vacancy”, 3774

ResearchGate 2023, (doi: 10.13140/RG.2.2.19911.37285). 3775

128. Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic 3776

SuperHyperGraph By SuperHyperJoin As Hyper Separations On Super Sorts”, 3777

ResearchGate 2023, (doi: 10.13140/RG.2.2.11050.90569). 3778

129. Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of 3779

SuperHyperJoin In Cancer’s Recognition with (Neutrosophic) 3780

SuperHyperGraph”, ResearchGate 2023, (doi: 10.13140/RG.2.2.17761.79206). 3781

130. Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions 3782

Of SuperHyperDuality In Cancer’s Neutrosophic Recognition and Neutrosophic 3783

SuperHyperGraph”, ResearchGate 2023, (doi: 10.13140/RG.2.2.34953.52320). 3784

131. Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) 3785

SuperHyperGraph By SuperHyperDuality As Hyper Imaginations On Super 3786

Mixed-Illustrations”, ResearchGate 2023, (doi: 10.13140/RG.2.2.33275.80161). 3787

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

132. Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) 3788

SuperHyperGraph By Path SuperHyperColoring As Hyper Correction On Super 3789

Faults”, ResearchGate 2023, (doi: 10.13140/RG.2.2.30182.50241). 3790

133. Henry Garrett, “New Ideas On Super Reflections By Hyper Rotations Of Path 3791

SuperHyperColoring In Cancer’s Neutrosophic Recognition and Neutrosophic 3792

SuperHyperGraph”, ResearchGate 2023, (doi: 10.13140/RG.2.2.33459.30243). 3793

134. Henry Garrett, “New Ideas As Hyper Deformations On Super Chains In 3794

Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph By 3795

SuperHyperDensity”, ResearchGate 2023, (doi: 10.13140/RG.2.2.13444.60806). 3796

135. Henry Garrett, “New Ideas As Hyper Ignorance By SuperHyperDensity On 3797

Super Resistances In Cancer’s Neutrosophic Recognition and Neutrosophic 3798

SuperHyperGraph”, ResearchGate 2023, (doi:10.13140/RG.2.2.16800.05123). 3799

136. Henry Garrett, “New Research On Cancer’s Recognition and Neutrosophic 3800

SuperHyperGraph By Eulerian SuperHyperCycles and Hamiltonian Sets As 3801

Hyper Covering Versus Super separations-VI ”, ResearchGate 2023, (doi: 3802

10.13140/RG.2.2.29913.80482). 3803

137. Henry Garrett, “New Research On Cancer’s Recognition and Neutrosophic 3804

SuperHyperGraph By Eulerian SuperHyperCycles and Hamiltonian Sets As 3805

Hyper Covering Versus Super separations-V ”, ResearchGate 2023, (doi: 3806

10.13140/RG.2.2.33269.24809). 3807

138. Henry Garrett, “New Research On Cancer’s Recognition and Neutrosophic 3808

SuperHyperGraph By Eulerian SuperHyperCycles and Hamiltonian Sets As 3809

Hyper Covering Versus Super separations-IV ”, ResearchGate 2023, (doi: 3810

10.13140/RG.2.2.34946.96960). 3811

139. Henry Garrett, “A Research On Cancer’s Recognition and Neutrosophic 3812

SuperHyperGraph By Eulerian SuperHyperCycles and Hamiltonian Sets As 3813

Hyper Covering Versus Super separations-III ”, ResearchGate 2023, (doi: 3814

10.13140/RG.2.2.14814.31040). 3815

140. Henry Garrett, “A Research On Cancer’s Recognition and Neutrosophic 3816

SuperHyperGraph By Eulerian SuperHyperCycles and Hamiltonian Sets As 3817

Hyper Covering Versus Super separations-II ”, ResearchGate 2023, (doi: 3818

10.13140/RG.2.2.15653.17125). 3819

141. Henry Garrett, “A Research On Cancer’s Recognition and Neutrosophic 3820

SuperHyperGraph By Eulerian SuperHyperCycles and Hamiltonian Sets As 3821

Hyper Covering Versus Super separations-I ”, ResearchGate 2023, (doi: 3822

10.13140/RG.2.2.25719.50089). 3823

142. Henry Garrett, “New Ideas On Super Disruptions In Cancer’s Extreme 3824

Recognition As Neutrosophic SuperHyperGraph By Hyper Plans Called 3825

SuperHyperConnectivities”, ResearchGate 2023, (doi: 3826

10.13140/RG.2.2.29441.94562). 3827

143. Henry Garrett, “Cancer’s Neutrosophic Recognition As Neutrosophic 3828

SuperHyperGraph By SuperHyperConnectivities As Hyper Diagnosis On Super 3829

Mechanism”, ResearchGate 2023, (doi: 10.13140/RG.2.2.17252.24968). 3830

144. Henry Garrett,“Cancer’s Recognition and (Neutrosophic) SuperHyperGraph By 3831

the Criteria of Eulerian and Hamiltonian Type-Sets As Hyper Modified Cycles 3832

On Super Mess”, ResearchGate 2023,(doi: 10.13140/RG.2.2.16652.59525). 3833

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

145. Henry Garrett,“Eulerian and Hamiltonian In Cancer’s Neutrosophic Recognition 3834

and Neutrosophic SuperHyperGraph On Super Interactions By Hyper Extensions 3835

of Cycles”, ResearchGate 2023,(doi: 10.13140/RG.2.2.34583.24485). 3836

146. Henry Garrett,“SuperHyperGirth Type-Results on extreme SuperHyperGirth 3837

theory and (Neutrosophic) SuperHyperGraphs Toward Cancer’s extreme 3838

Recognition”, Preprints 2023, 2023010396 (doi: 3839

10.20944/preprints202301.0396.v1). 3840

147. Henry Garrett,“Neutrosophic SuperHyperGraphs Warns Hyper Landmark of 3841

neutrosophic SuperHyperGirth In Super Type-Versions of Cancer’s neutrosophic 3842

Recognition”, Preprints 2023, 2023010395 (doi: 3843

10.20944/preprints202301.0395.v1). 3844

148. Henry Garrett,“The Constructions of (Neutrosophic) SuperHyperGraphs on the 3845

Cancer’s Recognition in The Confrontation With Super Attacks In Hyper 3846

Situations By Implementing (Neutrosophic) 1-Failed SuperHyperForcing in The 3847

Technical Approaches to Neutralize SuperHyperViews”, ResearchGate 2023, (doi: 3848

10.13140/RG.2.2.26240.51204). 3849

149. Henry Garrett,“(Neutrosophic) 1-Failed SuperHyperForcing As the 3850

Entrepreneurs on Cancer’s Recognitions To Fail Forcing Style As the Super 3851

Classes With Hyper Effects In The Background of the Framework is So-Called 3852

(Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 3853

10.13140/RG.2.2.12818.73925). 3854

150. Henry Garrett,“Super Actions On The Types of Hyper Levels In The Sensible 3855

Neutrosophic SuperHyperGirth On Cancer’s Neutrosophic Recognition and 3856

Neutrosophic SuperHyperGraph”, ResearchGate 2023,(doi: 3857

10.13140/RG.2.2.26836.88960). 3858

151. Henry Garrett,“SuperHyperGirth Approaches on the Super Challenges on the 3859

Cancer’s Recognition In the Hyper Model of (Neutrosophic) SuperHyperGraph”, 3860

ResearchGate 2023,(doi: 10.13140/RG.2.2.36745.93289). 3861

152. Henry Garrett,“Extreme SuperHyperClique as the Firm Scheme of 3862

Confrontation under Cancer’s Recognition as the Model in The Setting of 3863

(Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010308 (doi: 3864

10.20944/preprints202301.0308.v1). 3865

153. Henry Garrett,“Uncertainty On The Act And Effect Of Cancer Alongside The 3866

Foggy Positions Of Cells Toward Neutrosophic Failed SuperHyperClique inside 3867

Neutrosophic SuperHyperGraphs Titled Cancer’s Recognition”, Preprints 2023, 3868

2023010282 (doi: 10.20944/preprints202301.0282.v1). 3869

154. Henry Garrett,“Neutrosophic Version Of Separates Groups Of Cells In Cancer’s 3870

Recognition On Neutrosophic SuperHyperGraphs”, Preprints 2023, 2023010267 3871

(doi: 10.20944/preprints202301.0267.v1).). 3872

155. Henry Garrett, “The Shift Paradigm To Classify Separately The Cells and 3873

Affected Cells Toward The Totality Under Cancer’s Recognition By New 3874

Multiple Definitions On the Sets Polynomials Alongside Numbers In The 3875

(Neutrosophic) SuperHyperMatching Theory Based on SuperHyperGraph and 3876

Neutrosophic SuperHyperGraph”, Preprints 2023, 2023010265 (doi: 3877

10.20944/preprints202301.0265.v1). 3878

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

156. Henry Garrett,“Breaking the Continuity and Uniformity of Cancer In The 3879

Worst Case of Full Connections With Extreme Failed SuperHyperClique In 3880

Cancer’s Recognition Applied in (Neutrosophic) SuperHyperGraphs”, Preprints 3881

2023, 2023010262,(doi: 10.20944/preprints202301.0262.v1). 3882

157. Henry Garrett, “Neutrosophic Failed SuperHyperStable as the Survivors on the 3883

Cancer’s Neutrosophic Recognition Based on Uncertainty to All Modes in 3884

Neutrosophic SuperHyperGraphs”, Preprints 2023, 2023010240 (doi: 3885

10.20944/preprints202301.0240.v1). 3886

158. Henry Garrett, “Extremism of the Attacked Body Under the Cancer’s 3887

Circumstances Where Cancer’s Recognition Titled (Neutrosophic) 3888

SuperHyperGraphs”, Preprints 2023, 2023010224, (doi: 3889

10.20944/preprints202301.0224.v1). 3890

159. Henry Garrett,“SuperHyperMatching By (R-)Definitions And Polynomials To 3891

Monitor Cancer’s Recognition In Neutrosophic SuperHyperGraphs”, 3892

ResearchGate 2023,(doi: 10.13140/RG.2.2.35061.65767). 3893

160. Henry Garrett,“The Focus on The Partitions Obtained By Parallel Moves In 3894

The Cancer’s Extreme Recognition With Different Types of Extreme 3895

SuperHyperMatching Set and Polynomial on (Neutrosophic) SuperHyperGraphs”, 3896

ResearchGate 2023, (doi: 10.13140/RG.2.2.18494.15680). 3897

161. Henry Garrett,“Extreme Failed SuperHyperClique Decides the Failures on the 3898

Cancer’s Recognition in the Perfect Connections of Cancer’s Attacks By 3899

SuperHyperModels Named (Neutrosophic) SuperHyperGraphs”, ResearchGate 3900

2023, (doi: 10.13140/RG.2.2.32530.73922). 3901

162. Henry Garrett,“Indeterminacy On The All Possible Connections of Cells In 3902

Front of Cancer’s Attacks In The Terms of Neutrosophic Failed 3903

SuperHyperClique on Cancer’s Recognition called Neutrosophic 3904

SuperHyperGraphs”, ResearchGate 2023, (doi: 10.13140/RG.2.2.15897.70243). 3905

163. Henry Garrett,“Extreme Failed SuperHyperClique Decides the Failures on the 3906

Cancer’s Recognition in the Perfect Connections of Cancer’s Attacks By 3907

SuperHyperModels Named (Neutrosophic) SuperHyperGraphs”, ResearchGate 3908

2023, (doi: 10.13140/RG.2.2.32530.73922). 3909

164. Henry Garrett, “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s 3910

Recognitions And (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 3911

2023010105 (doi: 10.20944/preprints202301.0105.v1). 3912

165. Henry Garrett,“Perfect Directions Toward Idealism in Cancer’s Neutrosophic 3913

Recognition Forwarding Neutrosophic SuperHyperClique on Neutrosophic 3914

SuperHyperGraphs”, ResearchGate 2023, (doi: 10.13140/RG.2.2.30092.80004). 3915

166. Henry Garrett,“Demonstrating Complete Connections in Every Embedded 3916

Regions and Sub-Regions in the Terms of Cancer’s Recognition and 3917

(Neutrosophic) SuperHyperGraphs With (Neutrosophic) SuperHyperClique”, 3918

ResearchGate 2023, (doi: 10.13140/RG.2.2.23172.19849). 3919

167. Henry Garrett, “Basic Notions on (Neutrosophic) SuperHyperForcing And 3920

(Neutrosophic) SuperHyperModeling in Cancer’s Recognitions And 3921

(Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010105 (doi: 3922

10.20944/preprints202301.0105.v1). 3923

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

168. Henry Garrett, “Neutrosophic Messy-Style SuperHyperGraphs To Form 3924

Neutrosophic SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions 3925

In Special ViewPoints”, Preprints 2023, 2023010088 (doi: 3926

10.20944/preprints202301.0088.v1). 3927

169. Henry Garrett,“Different Neutrosophic Types of Neutrosophic Regions titled 3928

neutrosophic Failed SuperHyperStable in Cancer’s Neutrosophic Recognition 3929

modeled in the Form of Neutrosophic SuperHyperGraphs”, ResearchGate 2023, 3930

(doi: 10.13140/RG.2.2.17385.36968). 3931

170. Henry Garrett, “Neutrosophic 1-Failed SuperHyperForcing in the 3932

SuperHyperFunction To Use Neutrosophic SuperHyperGraphs on Cancer’s 3933

Neutrosophic Recognition And Beyond ”, Preprints 2023, 2023010044 3934

171. Henry Garrett, “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by 3935

Well- SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 3936

2023010043 (doi: 10.20944/preprints202301.0043.v1). 3937

172. Henry Garrett, “Using the Tool As (Neutrosophic) Failed SuperHyperStable To 3938

SuperHyperModel Cancer’s Recognition Titled (Neutrosophic) 3939

SuperHyperGraphs”, ResearchGate 2023, (doi: 10.13140/RG.2.2.28945.92007). 3940

173. Henry Garrett, “Neutrosophic Messy-Style SuperHyperGraphs To Form 3941

Neutrosophic SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In 3942

Special ViewPoints”, ResearchGate 2023, (doi: 10.13140/RG.2.2.11447.80803). 3943

174. Henry Garrett, “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by 3944

Well-SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, ResearchGate 3945

2023, (doi: 10.13140/RG.2.2.35774.77123). 3946

175. Henry Garrett, “Neutrosophic 1-Failed SuperHyperForcing in the 3947

SuperHyperFunction To Use Neutrosophic SuperHyperGraphs on Cancer’s 3948

Neutrosophic Recognition And Beyond ”, ResearchGate 2022, (doi: 3949

10.13140/RG.2.2.36141.77287). 3950

176. Henry Garrett, “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s 3951

Recognitions And (Neutrosophic) SuperHyperGraphs”, ResearchGate 2022, (doi: 3952

10.13140/RG.2.2.29430.88642). 3953

177. Henry Garrett, “Basic Notions on (Neutrosophic) SuperHyperForcing And 3954

(Neutrosophic) SuperHyperModeling in Cancer’s Recognitions And 3955

(Neutrosophic) SuperHyperGraphs”, ResearchGate 2022, (doi: 3956

10.13140/RG.2.2.11369.16487). 3957

178. Henry Garrett, “(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions 3958

Featuring (Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, Preprints 3959

2022, 2022120549 (doi: 10.20944/preprints202212.0549.v1). 3960

179. Henry Garrett, “(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions 3961

Featuring (Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, 3962

ResearchGate 2022, (doi: 10.13140/RG.2.2.19380.94084). 3963

180. Henry Garrett, “(Neutrosophic) SuperHyperAlliances With SuperHyperDefensive 3964

and SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) 3965

SuperHyperGraph With (Neutrosophic) SuperHyperModeling of Cancer’s 3966

Recognitions And Related (Neutrosophic) SuperHyperClasses”, Preprints 2022, 3967

2022120540 (doi: 10.20944/preprints202212.0540.v1). 3968

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

181. Henry Garrett, “(Neutrosophic) SuperHyperAlliances With SuperHyperDefensive 3969

and SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) 3970

SuperHyperGraph With (Neutrosophic) SuperHyperModeling of Cancer’s 3971

Recognitions And Related (Neutrosophic) SuperHyperClasses”, ResearchGate 3972

2022, (doi: 10.13140/RG.2.2.14426.41923). 3973

182. Henry Garrett, “SuperHyperGirth on SuperHyperGraph and Neutrosophic 3974

SuperHyperGraph With SuperHyperModeling of Cancer’s Recognitions”, 3975

Preprints 2022, 2022120500 (doi: 10.20944/preprints202212.0500.v1). 3976

183. Henry Garrett, “SuperHyperGirth on SuperHyperGraph and Neutrosophic 3977

SuperHyperGraph With SuperHyperModeling of Cancer’s Recognitions”, 3978

ResearchGate 2022 (doi: 10.13140/RG.2.2.20993.12640). 3979

184. Henry Garrett,“Some SuperHyperDegrees and Co-SuperHyperDegrees on 3980

Neutrosophic SuperHyperGraphs and SuperHyperGraphs Alongside Applications 3981

in Cancer’s Treatments”, Preprints 2022, 2022120324 (doi: 3982

10.20944/preprints202212.0324.v1). 3983

185. Henry Garrett, “Some SuperHyperDegrees and Co-SuperHyperDegrees on 3984

Neutrosophic SuperHyperGraphs And SuperHyperGraphs Alongside Applications 3985

in Cancer’s Treatments”, ResearchGate 2022 (doi: 3986

10.13140/RG.2.2.23123.04641). 3987

186. Henry Garrett, “SuperHyperDominating and SuperHyperResolving on 3988

Neutrosophic SuperHyperGraphs And Their Directions in Game Theory and 3989

Neutrosophic SuperHyperClasses”, Preprints 2022, 2022110576 (doi: 3990

10.20944/preprints202211.0576.v1). 3991

187. Henry Garrett, “SuperHyperDominating and SuperHyperResolving on 3992

Neutrosophic SuperHyperGraphs And Their Directions in Game Theory and 3993

Neutrosophic SuperHyperClasses”, ResearchGate 2022 (doi: 3994

10.13140/RG.2.2.23324.56966). 3995

188. Henry Garrett, “Basic Neutrosophic Notions Concerning SuperHyperDominating 3996

and Neutrosophic SuperHyperResolving in SuperHyperGraph”, ResearchGate 3997

2022 (doi: 10.13140/RG.2.2.29173.86244). 3998

189. Henry Garrett, “Initial Material of Neutrosophic Preliminaries to Study Some 3999

Neutrosophic Notions Based on Neutrosophic SuperHyperEdge (NSHE) in 4000

Neutrosophic SuperHyperGraph (NSHG)”, ResearchGate 2022 (doi: 4001

10.13140/RG.2.2.25385.88160). 4002

190. Henry Garrett, “Eulerian-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry 4003

Garrett, 2023 (doi: 10.5281/zenodo.7857906). 4004

191. Henry Garrett, “Eulerian-Cycle-Decomposition In SuperHyperGraphs”. Dr. 4005

Henry Garrett, 2023 (doi: 10.5281/zenodo.7856329). 4006

192. Henry Garrett, “Eulerian-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 4007

2023 (doi: 10.5281/zenodo.7854561). 4008

193. Henry Garrett, “Eulerian-Type-Path-Neighbor In SuperHyperGraphs”. Dr. 4009

Henry Garrett, 2023 (doi: 10.5281/zenodo.7851893). 4010

194. Henry Garrett, “Eulerian-Type-Path-Decomposition In SuperHyperGraphs”. Dr. 4011

Henry Garrett, 2023 (doi: 10.5281/zenodo.7848019). 4012

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

195. Henry Garrett, “Eulerian-Type-Path-Cut In SuperHyperGraphs”. Dr. Henry 4013

Garrett, 2023 (doi: 10.5281/zenodo.7835063). 4014

196. Henry Garrett, “Eulerian-Path-Neighbor In SuperHyperGraphs”. Dr. Henry 4015

Garrett, 2023 (doi: 10.5281/zenodo.7826705). 4016

197. Henry Garrett, “Eulerian-Path-Decomposition In SuperHyperGraphs”. Dr. 4017

Henry Garrett, 2023 (doi: 10.5281/zenodo.7820680). 4018

198. Henry Garrett, “Eulerian-Path-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 4019

2023 (doi: 10.5281/zenodo.7812750). 4020

199. Henry Garrett, “Hamiltonian-Type-Cycle-Neighbor In SuperHyperGraphs”. Dr. 4021

Henry Garrett, 2023 (doi: 10.5281/zenodo.7812142). 4022

200. Henry Garrett, “Hamiltonian-Type-Cycle-Decomposition In SuperHyperGraphs”. 4023

Dr. Henry Garrett, 2023 (doi: 10.5281/zenodo.7810394). 4024

201. Henry Garrett, “Hamiltonian-Type-Cycle-Cut In SuperHyperGraphs”. Dr. Henry 4025

Garrett, 2023 (doi: 10.5281/zenodo.7807782). 4026

202. Henry Garrett, “Hamiltonian-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry 4027

Garrett, 2023 (doi: 10.5281/zenodo.7804449). 4028

203. Henry Garrett, “Hamiltonian-Cycle-Decomposition In SuperHyperGraphs”. Dr. 4029

Henry Garrett, 2023 (doi: 10.5281/zenodo.7793875). 4030

204. Henry Garrett, “Hamiltonian-Cycle-Cut In SuperHyperGraphs”. Dr. Henry 4031

Garrett, 2023 (doi: 10.5281/zenodo.7792307). 4032

205. Henry Garrett, “Hamiltonian-Neighbor In SuperHyperGraphs”. Dr. Henry 4033

Garrett, 2023 (doi: 10.5281/zenodo.7790728). 4034

206. Henry Garrett, “Hamiltonian-Decomposition In SuperHyperGraphs”. Dr. Henry 4035

Garrett, 2023 (doi: 10.5281/zenodo.7787712). 4036

207. Henry Garrett, “Hamiltonian-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 4037

2023 (doi: 10.5281/zenodo.7783791). 4038

208. Henry Garrett, “Trace-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 4039

2023 (doi: 10.5281/zenodo.7780123). 4040

209. Henry Garrett, “Trace-Decomposition In SuperHyperGraphs”. Dr. Henry 4041

Garrett, 2023 (doi: 10.5281/zenodo.7773119). 4042

210. Henry Garrett, “SuperHyperDuality”. Dr. Henry Garrett, 2023 (doi: 4043

10.5281/zenodo.7637762). 4044

211. Henry Garrett, “Trace-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 4045

(doi: 10.5281/zenodo.7766174). 4046

212. Henry Garrett, “Edge-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 4047

(doi: 10.5281/zenodo.7762232). 4048

213. Henry Garrett, “Edge-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 4049

2023 (doi: 10.5281/zenodo.7758601). 4050

214. Henry Garrett, “Edge-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 4051

10.5281/zenodo.7754661). 4052

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

215. Henry Garrett, “Vertex-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 4053

2023 (doi: 10.5281/zenodo.7750995) . 4054

216. Henry Garrett, “Vertex-Decomposition In SuperHyperGraphs”. Dr. Henry 4055

Garrett, 2023 (doi: 10.5281/zenodo.7749875). 4056

217. Henry Garrett, “Vertex-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 4057

(doi: 10.5281/zenodo.7747236). 4058

218. Henry Garrett, “Stable-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 4059

2023 (doi: 10.5281/zenodo.7742587). 4060

219. Henry Garrett, “Stable-Decompositions In SuperHyperGraphs”. Dr. Henry 4061

Garrett, 2023 (doi: 10.5281/zenodo.7738635). 4062

220. Henry Garrett, “Stable-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 4063

(doi: 10.5281/zenodo.7734719). 4064

221. Henry Garrett, “Clique-Neighbors In SuperHyperGraphs”. Dr. Henry Garrett, 4065

2023 (doi: 10.5281/zenodo.7730484). 4066

222. Henry Garrett, “Clique-Decompositions In SuperHyperGraphs”. Dr. Henry 4067

Garrett, 2023 (doi: 10.5281/zenodo.7730469). 4068

223. Henry Garrett, “Clique-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 4069

(doi: 10.5281/zenodo.7722865). 4070

224. Henry Garrett, “Space In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 4071

10.5281/zenodo.7713563). 4072

225. Henry Garrett, “Space In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 4073

10.5281/zenodo.7709116). 4074

226. Henry Garrett, “Edge-Connectivity In SuperHyperGraphs”. Dr. Henry Garrett, 4075

2023 (doi: 10.5281/zenodo.7706415). 4076

227. Henry Garrett, “Vertex-Connectivity In SuperHyperGraphs”. Dr. Henry Garrett, 4077

2023 (doi: 10.5281/zenodo.7706063). 4078

228. Henry Garrett, “Tree-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 4079

2023 (doi: 10.5281/zenodo.7701906). 4080

229. Henry Garrett, “Chord In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 4081

10.5281/zenodo.7700205). 4082

230. Henry Garrett, “(i,j)-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 4083

2023 (doi: 10.5281/zenodo.7694876). 4084

231. Henry Garrett, “Edge-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 4085

2023 (doi: 10.5281/zenodo.7679410). 4086

232. Henry Garrett, “K-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 4087

(doi: 10.5281/zenodo.7675982). 4088

233. Henry Garrett, “K-Number In SuperHyperGraphs”. Dr. Henry Garrett, 2023 4089

(doi: 10.5281/zenodo.7672388). 4090

234. Henry Garrett, “Order In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 4091

10.5281/zenodo.7668648). 4092

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

235. Henry Garrett, “Coloring In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 4093

10.5281/zenodo.7662810). 4094

236. Henry Garrett, “Dimension In SuperHyperGraphs”. Dr. Henry Garrett, 2023 4095

(doi: 10.5281/zenodo.7659162). 4096

237. Henry Garrett, “Cancer In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 4097

10.5281/zenodo.7653233). 4098

238. Henry Garrett, “SuperHyperWheel ”. Dr. Henry Garrett, 2023 (doi: 4099

10.5281/zenodo.7653204). 4100

239. Henry Garrett, “SuperHyperMultipartite”. Dr. Henry Garrett, 2023 (doi: 4101

10.5281/zenodo.7653142). 4102

240. Henry Garrett, “SuperHyperBipartite”. Dr. Henry Garrett, 2023 (doi: 4103

10.5281/zenodo.7653117). 4104

241. Henry Garrett, “SuperHyperStar ”. Dr. Henry Garrett, 2023 (doi: 4105

10.5281/zenodo.7653089). 4106

242. Henry Garrett, “SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 4107

10.5281/zenodo.7651687). 4108

243. Henry Garrett, “SuperHyperPath”. Dr. Henry Garrett, 2023 (doi: 4109

10.5281/zenodo.7651619). 4110

244. Henry Garrett, “SuperHyperDomination”. Dr. Henry Garrett, 2023 (doi: 4111

10.5281/zenodo.7651439). 4112

245. Henry Garrett, “SuperHyperDominating”. Dr. Henry Garrett, 2023 (doi: 4113

10.5281/zenodo.7650729). 4114

246. Henry Garrett, “SuperHyperConnected ”. Dr. Henry Garrett, 2023 (doi: 4115

10.5281/zenodo.7647868). 4116

247. Henry Garrett, “SuperHyperTotal ”. Dr. Henry Garrett, 2023 (doi: 4117

10.5281/zenodo.7647017). 4118

248. Henry Garrett, “SuperHyperPerfect”. Dr. Henry Garrett, 2023 (doi: 4119

10.5281/zenodo.7644894). 4120

249. Henry Garrett, “SuperHyperJoin”. Dr. Henry Garrett, 2023 (doi: 4121

10.5281/zenodo.7641880). 4122

250. Henry Garrett, “Path SuperHyperColoring”. Dr. Henry Garrett, 2023 (doi: 4123

10.5281/zenodo.7632923). 4124

251. Henry Garrett, “SuperHyperDensity”. Dr. Henry Garrett, 2023 (doi: 4125

10.5281/zenodo.7623459). 4126

252. Henry Garrett, “Neutrosophic SuperHyperConnectivities”. Dr. Henry Garrett, 4127

2023 (doi: 10.5281/zenodo.7606416). 4128

253. Henry Garrett, “Extreme SuperHyperConnectivities”. Dr. Henry Garrett, 2023 4129

(doi: 10.5281/zenodo.7606416). 4130

254. Henry Garrett, “SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 4131

10.5281/zenodo.7606404). 4132

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

255. Henry Garrett, “Neutrosophic SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 4133

10.5281/zenodo.7580018). 4134

256. Henry Garrett, “Extreme SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 4135

10.5281/zenodo.7580018). 4136

257. Henry Garrett, “Extreme SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 4137

10.5281/zenodo.7580018). 4138

258. Henry Garrett, “SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 4139

10.5281/zenodo.7579929). 4140

259. Henry Garrett, “Neutrosophic SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 4141

10.5281/zenodo.7563170). 4142

260. Henry Garrett, “Extreme SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 4143

10.5281/zenodo.7563164). 4144

261. Henry Garrett, “SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 4145

10.5281/zenodo.7563160). 4146

262. Henry Garrett, “Extreme SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 4147

10.5281/zenodo.7563160). 4148

263. Henry Garrett, “Overlook On SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 4149

10.5281/zenodo.7563160). 4150

264. Henry Garrett, “Neutrosophic SuperHyperMatching”. Dr. Henry Garrett, 2023 4151

(doi: 10.5281/zenodo.7557063). 4152

265. Henry Garrett, “Extreme SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 4153

10.5281/zenodo.7557009). 4154

266. Henry Garrett, “Overlook On SuperHyperMatching”. Dr. Henry Garrett, 2023 4155

(doi: 10.5281/zenodo.7539484). 4156

267. Henry Garrett, “Neutrosophic Failed SuperHyperClique”. Dr. Henry Garrett, 4157

2023 (doi: 10.5281/zenodo.7523390). 4158

268. Henry Garrett, “Extreme Failed SuperHyperClique”. Dr. Henry Garrett, 2023 4159

(doi: 10.5281/zenodo.7523390). 4160

269. Henry Garrett, “Overlook On Failed SuperHyperClique”. Dr. Henry Garrett, 4161

2023 (doi: 10.5281/zenodo.7523390). 4162

270. Henry Garrett, “Extreme SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 4163

10.5281/zenodo.7574952). 4164

271. Henry Garrett, “Neutrosophic SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 4165

10.5281/zenodo.7574992). 4166

272. Henry Garrett, “Extreme SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 4167

10.5281/zenodo.7523357). 4168

273. Henry Garrett, “Overlook On SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 4169

10.5281/zenodo.7523357). 4170

274. Henry Garrett, “Neutrosophic Failed SuperHyperStable”. Dr. Henry Garrett, 4171

2023 (doi: 10.5281/zenodo.7504782). 4172

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

275. Henry Garrett, “Extreme Failed SuperHyperStable”. Dr. Henry Garrett, 2023 4173

(doi: 10.5281/zenodo.7504782). 4174

276. Henry Garrett, “Overlook On Failed SuperHyperStable”. Dr. Henry Garrett, 4175

2023 (doi: 10.5281/zenodo.7504782). 4176

277. Henry Garrett, “Neutrosophic SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 4177

10.5281/zenodo.7499395). 4178

278. Henry Garrett, “Extreme SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 4179

10.5281/zenodo.7499395). 4180

279. Henry Garrett, “Overlook On SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 4181

10.5281/zenodo.7499395). 4182

280. Henry Garrett, “Neutrosophic Failed SuperHyperForcing”. Dr. Henry Garrett, 4183

2023 (doi: 10.5281/zenodo.7497450). 4184

281. Henry Garrett, “Extreme Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 4185

(doi: 10.5281/zenodo.7497450). 4186

282. Henry Garrett, “Neutrosophic SuperHyperForcing”. Dr. Henry Garrett, 2023 4187

(doi: 10.5281/zenodo.7494862). 4188

283. Henry Garrett, “Extreme SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 4189

10.5281/zenodo.7494862). 4190

284. Henry Garrett, “Overlook On SuperHyperForcing”. Dr. Henry Garrett, 2023 4191

(doi: 10.5281/zenodo.7494862). 4192

285. Henry Garrett, “Neutrosophic SuperHyperAlliances”. Dr. Henry Garrett, 2023 4193

(doi: 10.5281/zenodo.7493845). 4194

286. Henry Garrett, “Extreme SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 4195

10.5281/zenodo.7493845). 4196

287. Henry Garrett, “Overlook On SuperHyperAlliances”. Dr. Henry Garrett, 2023 4197

(doi: 10.5281/zenodo.7493845). 4198

288. Henry Garrett, “SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 4199

10.5281/zenodo.7539484). 4200

289. Henry Garrett, “Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 4201

10.5281/zenodo.7523390). 4202

290. Henry Garrett, “SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 4203

10.5281/zenodo.7523357). 4204

291. Henry Garrett, “Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 4205

10.5281/zenodo.7504782). 4206

292. Henry Garrett, “SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 4207

10.5281/zenodo.7499395). 4208

293. Henry Garrett, “Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 4209

10.5281/zenodo.7497450). 4210

294. Henry Garrett, “SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 4211

10.5281/zenodo.7494862). 4212

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

295. Henry Garrett, “SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 4213

10.5281/zenodo.7493845). 4214

296. Henry Garrett, “SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 4215

10.5281/zenodo.7480110). 4216

297. Henry Garrett, “Neut. SuperHyperEdges”. Dr. Henry Garrett, 2023 (doi: 4217

10.5281/zenodo.7378758). 4218

298. Henry Garrett, “Beyond Neutrosophic Graphs”. Dr. Henry Garrett, 2023 (doi: 4219

10.5281/zenodo.6320305). 4220

299. Henry Garrett, “Neutrosophic Duality”. Dr. Henry Garrett, 2023 (doi: 4221

10.5281/zenodo.6677173). 4222

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

View publication stats

You might also like