You are on page 1of 127

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

net/publication/368686241

New Ideas In Cancer's Recognition And Neutrosophic SuperHyperGraph By


SuperHyperColoring As Hyper Categories On Super Neighbors

Preprint · February 2023


DOI: 10.13140/RG.2.2.13973.81121

CITATIONS

1 author:

Henry Garrett

326 PUBLICATIONS   4,091 CITATIONS   

SEE PROFILE

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

On Algebraic Structures and Algebraic Hyperstructures View project

Featured Articles View project

All content following this page was uploaded by Henry Garrett on 21 February 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 Cancer’s Recognition And Neutrosophic 2

SuperHyperGraph By SuperHyperColoring As Hyper 3

Categories On Super Neighbors 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

SuperHyperColoring). Assume a Neutrosophic SuperHyperGraph (NSHG) S is an 10

ordered pair S = (V, E). Consider a Neutrosophic SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } 11

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

e-SuperHyperColoring if Vc ∈ Ea , Eb ∈ E 0 such that d(Ea ) 6= d(Eb ); Neutrosophic 13

re-SuperHyperColoring if Vc ∈ Ea , Eb ∈ E 0 such that d(Ea ) 6= d(Eb ); and 14

|Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; Neutrosophic 15

v-SuperHyperColoring if Va , Vb ∈ V 0 , Va , Vb ∈ Ec such that d(Va ) 6= V (Eb ); 16

Neutrosophic rv-SuperHyperColoring if Va , Vb ∈ V 0 , Va , Vb ∈ Ec such that 17

d(Va ) 6= V (Eb ); and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; 18

Neutrosophic SuperHyperColoring if it’s either of Neutrosophic e-SuperHyperColoring, 19

Neutrosophic re-SuperHyperColoring, Neutrosophic v-SuperHyperColoring, and 20

Neutrosophic rv-SuperHyperColoring. ((Neutrosophic) SuperHyperColoring). Assume a 21

Neutrosophic SuperHyperGraph (NSHG) S is an ordered pair S = (V, E). Consider a 22

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

Extreme SuperHyperColoring if it’s either of Neutrosophic e-SuperHyperColoring, 24

Neutrosophic re-SuperHyperColoring, Neutrosophic v-SuperHyperColoring, and 25

Neutrosophic rv-SuperHyperColoring and C(N SHG) for an Extreme SuperHyperGraph 26

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

of high Extreme cardinality of the Extreme SuperHyperEdges in the consecutive 28

Extreme sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such 29

that they form the Extreme SuperHyperColoring; a Neutrosophic SuperHyperColoring 30

if it’s either of Neutrosophic e-SuperHyperColoring, Neutrosophic 31

re-SuperHyperColoring, Neutrosophic v-SuperHyperColoring, and Neutrosophic 32

rv-SuperHyperColoring and C(N SHG) for a Neutrosophic SuperHyperGraph 33

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

SuperHyperEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 35

consecutive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such 36

that they form the Neutrosophic SuperHyperColoring; an Extreme SuperHyperColoring 37

SuperHyperPolynomial if it’s either of Neutrosophic e-SuperHyperColoring, 38

Neutrosophic re-SuperHyperColoring, Neutrosophic v-SuperHyperColoring, and 39

Neutrosophic rv-SuperHyperColoring and C(N SHG) for an Extreme SuperHyperGraph 40

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

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

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

consecutive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 44

form the Extreme SuperHyperColoring; and the Extreme power is corresponded to its 45

Extreme coefficient; a Neutrosophic SuperHyperColoring SuperHyperPolynomial if it’s 46

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

either of Neutrosophic e-SuperHyperColoring, Neutrosophic re-SuperHyperColoring, 47

Neutrosophic v-SuperHyperColoring, and Neutrosophic rv-SuperHyperColoring and 48

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

SuperHyperPolynomial contains the Neutrosophic coefficients defined as the 50

Neutrosophic number of the maximum Neutrosophic cardinality of the Neutrosophic 51

SuperHyperEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 52

consecutive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such 53

that they form the Neutrosophic SuperHyperColoring; and the Neutrosophic power is 54

corresponded to its Neutrosophic coefficient; an Extreme V-SuperHyperColoring if it’s 55

either of Neutrosophic e-SuperHyperColoring, Neutrosophic re-SuperHyperColoring, 56

Neutrosophic v-SuperHyperColoring, and Neutrosophic rv-SuperHyperColoring and 57

C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme 58

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

SuperHyperVertices in the consecutive Extreme sequence of Extreme SuperHyperEdges 60

and Extreme SuperHyperVertices such that they form the Extreme 61

SuperHyperColoring; a Neutrosophic V-SuperHyperColoring if it’s either of 62

Neutrosophic e-SuperHyperColoring, Neutrosophic re-SuperHyperColoring, 63

Neutrosophic v-SuperHyperColoring, and Neutrosophic rv-SuperHyperColoring and 64

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

Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic 66

SuperHyperSet S of high Neutrosophic cardinality consecutive Neutrosophic 67

SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the 68

Neutrosophic SuperHyperColoring; an Extreme V-SuperHyperColoring 69

SuperHyperPolynomial if it’s either of Neutrosophic e-SuperHyperColoring, 70

Neutrosophic re-SuperHyperColoring, Neutrosophic v-SuperHyperColoring, and 71

Neutrosophic rv-SuperHyperColoring and C(N SHG) for an Extreme SuperHyperGraph 72

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

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

Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme 75

cardinality consecutive Extreme SuperHyperEdges and Extreme SuperHyperVertices 76

such that they form the Extreme SuperHyperColoring; and the Extreme power is 77

corresponded to its Extreme coefficient; a Neutrosophic SuperHyperColoring 78

SuperHyperPolynomial if it’s either of Neutrosophic e-SuperHyperColoring, 79

Neutrosophic re-SuperHyperColoring, Neutrosophic v-SuperHyperColoring, and 80

Neutrosophic rv-SuperHyperColoring and C(N SHG) for a Neutrosophic 81

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

the Neutrosophic coefficients defined as the Neutrosophic number of the maximum 83

Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic 84

SuperHyperSet S of high Neutrosophic cardinality consecutive Neutrosophic 85

SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the 86

Neutrosophic SuperHyperColoring; and the Neutrosophic power is corresponded to its 87

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

SuperHyperNotions, namely, a SuperHyperColoring and Neutrosophic 89

SuperHyperColoring. Two different types of SuperHyperDefinitions are debut for them 90

but the research goes further and the SuperHyperNotion, SuperHyperUniform, and 91

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

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

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

SuperHyperNotions and fundamental SuperHyperNumbers are featured. The definitions 95

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

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

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

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

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

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

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

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

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

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

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

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

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

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

δ−SuperHyperColoring is a maximal of SuperHyperVertices with a maximum 109

cardinality such that either of the following expressions hold for the (Neutrosophic) 110

cardinalities of SuperHyperNeighbors of s ∈ S : there are 111

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

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

if S is an δ−SuperHyperDefensive; a Neutrosophic δ−SuperHyperColoring is a maximal 114

Neutrosophic of SuperHyperVertices with maximum Neutrosophic cardinality such 115

that either of the following expressions hold for the Neutrosophic cardinalities of 116

SuperHyperNeighbors of s ∈ S there are: 117

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

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

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

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

version of a SuperHyperColoring . Since there’s more ways to get type-results to make a 122

SuperHyperColoring more understandable. For the sake of having Neutrosophic 123

SuperHyperColoring, there’s a need to “redefine” the notion of a “SuperHyperColoring 124

”. The SuperHyperVertices and the SuperHyperEdges are assigned by the labels from 125

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

to assign to the values. Assume a SuperHyperColoring . It’s redefined a Neutrosophic 127

SuperHyperColoring if the mentioned Table holds, concerning, “The Values of Vertices, 128

SuperVertices, Edges, HyperEdges, and SuperHyperEdges Belong to The Neutrosophic 129

SuperHyperGraph” with the key points, “The Values of The Vertices & The Number 130

of Position in Alphabet”, “The Values of The SuperVertices&The maximum Values of 131

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

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

SuperHyperEdges&The maximum Values of Its Endpoints”. To get structural examples 134

and instances, I’m going to introduce the next SuperHyperClass of SuperHyperGraph 135

based on a SuperHyperColoring . It’s the main. It’ll be disciplinary to have the 136

foundation of previous definition in the kind of SuperHyperClass. If there’s a need to 137

have all SuperHyperColoring until the SuperHyperColoring, then it’s officially called a 138

“SuperHyperColoring” but otherwise, it isn’t a SuperHyperColoring . There are some 139

instances about the clarifications for the main definition titled a “SuperHyperColoring ”. 140

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

the disciplinary ways of the SuperHyperClass based on a SuperHyperColoring . For the 142

sake of having a Neutrosophic SuperHyperColoring, there’s a need to “redefine” the 143

notion of a “Neutrosophic SuperHyperColoring” and a “Neutrosophic 144

SuperHyperColoring ”. The SuperHyperVertices and the SuperHyperEdges are assigned 145

by the labels from the letters of the alphabets. In this procedure, there’s the usage of 146

the position of labels to assign to the values. Assume a Neutrosophic SuperHyperGraph. 147

It’s redefined “Neutrosophic SuperHyperGraph” if the intended Table holds. And a 148

SuperHyperColoring are redefined to a “Neutrosophic SuperHyperColoring” if the 149

intended Table holds. It’s useful to define “Neutrosophic” version of SuperHyperClasses. 150

Since there’s more ways to get Neutrosophic type-results to make a Neutrosophic 151

SuperHyperColoring more understandable. Assume a Neutrosophic SuperHyperGraph. 152

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 some Neutrosophic SuperHyperClasses if the intended Table holds. Thus 153

SuperHyperPath, SuperHyperColoring, SuperHyperStar, SuperHyperBipartite, 154

SuperHyperMultiPartite, and SuperHyperWheel, are “Neutrosophic 155

SuperHyperPath”, “Neutrosophic SuperHyperColoring”, “Neutrosophic 156

SuperHyperStar”, “Neutrosophic SuperHyperBipartite”, “Neutrosophic 157

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

holds. A SuperHyperGraph has a “Neutrosophic SuperHyperColoring” where it’s the 159

strongest [the maximum Neutrosophic value from all the SuperHyperColoring amid the 160

maximum value amid all SuperHyperVertices from a SuperHyperColoring .] 161

SuperHyperColoring . A graph is a SuperHyperUniform if it’s a SuperHyperGraph and 162

the number of elements of SuperHyperEdges are the same. Assume a Neutrosophic 163

SuperHyperGraph. There are some SuperHyperClasses as follows. It’s SuperHyperPath 164

if it’s only one SuperVertex as intersection amid two given SuperHyperEdges with two 165

exceptions; it’s SuperHyperColoring if it’s only one SuperVertex as intersection amid 166

two given SuperHyperEdges; it’s SuperHyperStar it’s only one SuperVertex as 167

intersection amid all SuperHyperEdges; it’s SuperHyperBipartite it’s only one 168

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

forming two separate sets, has no SuperHyperEdge in common; it’s 170

SuperHyperMultiPartite it’s only one SuperVertex as intersection amid two given 171

SuperHyperEdges and these SuperVertices, forming multi separate sets, has no 172

SuperHyperEdge in common; it’s a SuperHyperWheel if it’s only one SuperVertex as 173

intersection amid two given SuperHyperEdges and one SuperVertex has one 174

SuperHyperEdge with any common SuperVertex. The SuperHyperModel proposes the 175

specific designs and the specific architectures. The SuperHyperModel is officially called 176

“SuperHyperGraph” and “Neutrosophic SuperHyperGraph”. In this SuperHyperModel, 177

The “specific” cells and “specific group” of cells are SuperHyperModeled as 178

“SuperHyperVertices” and the common and intended properties between “specific” cells 179

and “specific group” of cells are SuperHyperModeled as “SuperHyperEdges”. 180

Sometimes, it’s useful to have some degrees of determinacy, indeterminacy, and 181

neutrality to have more precise SuperHyperModel which in this case the 182

SuperHyperModel is called “Neutrosophic”. In the future research, the foundation will 183

be based on the “Cancer’s Recognition” and the results and the definitions will be 184

introduced in redeemed ways. The recognition of the cancer in the long-term function. 185

The specific region has been assigned by the model [it’s called SuperHyperGraph] and 186

the long cycle of the move from the cancer is identified by this research. Sometimes the 187

move of the cancer hasn’t be easily identified since there are some determinacy, 188

indeterminacy and neutrality about the moves and the effects of the cancer on that 189

region; this event leads us to choose another model [it’s said to be Neutrosophic 190

SuperHyperGraph] to have convenient perception on what’s happened and what’s done. 191

There are some specific models, which are well-known and they’ve got the names, and 192

some SuperHyperGeneral SuperHyperModels. The moves and the traces of the cancer 193

on the complex tracks and between complicated groups of cells could be fantasized by a 194

Neutrosophic SuperHyperPath(-/SuperHyperColoring, SuperHyperStar, 195

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

either the longest SuperHyperColoring or the strongest SuperHyperColoring in those 197

Neutrosophic SuperHyperModels. For the longest SuperHyperColoring, called 198

SuperHyperColoring, and the strongest SuperHyperColoring, called Neutrosophic 199

SuperHyperColoring, some general results are introduced. Beyond that in 200

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

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

of a SuperHyperColoring. There isn’t any formation of any SuperHyperColoring but 203

literarily, it’s the deformation of any SuperHyperColoring. It, literarily, deforms and it 204

doesn’t form. A basic familiarity with Neutrosophic SuperHyperColoring theory, 205

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

SuperHyperGraphs, and Neutrosophic SuperHyperGraphs theory are proposed. 206

Keywords: Neutrosophic SuperHyperGraph, SuperHyperColoring, Cancer’s 207

Neutrosophic Recognition 208

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

2 Applied Notions Under The Scrutiny Of The 210

Motivation Of This Scientific Research 211

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

this disease. The SuperHyperGraph and Neutrosophic SuperHyperGraph are the 236

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

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

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

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

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

formally called “ SuperHyperColoring” in the themes of jargons and buzzwords. The 242

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

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

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

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

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

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

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

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

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

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

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

Neutrosophic SuperHyperPath (-/SuperHyperColoring, SuperHyperStar, 254

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

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

either the optimal SuperHyperColoring or the Neutrosophic SuperHyperColoring in 256

those Neutrosophic SuperHyperModels. Some general results are introduced. Beyond 257

that in SuperHyperStar, all possible Neutrosophic SuperHyperPath s have only two 258

SuperHyperEdges but it’s not enough since it’s essential to have at least three 259

SuperHyperEdges to form any style of a SuperHyperColoring. There isn’t any 260

formation of any SuperHyperColoring but literarily, it’s the deformation of any 261

SuperHyperColoring. It, literarily, deforms and it doesn’t form. 262

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

find the “ amount of SuperHyperColoring” of either individual of cells or the groups of 264

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

SuperHyperColoring” based on the fixed groups of cells or the fixed groups of group of 266

cells? 267

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

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

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

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

SuperHyperColoring” and “Neutrosophic SuperHyperColoring” on “SuperHyperGraph” 272

and “Neutrosophic SuperHyperGraph”. Then the research has taken more motivations 273

to define SuperHyperClasses and to find some connections amid this SuperHyperNotion 274

with other SuperHyperNotions. It motivates us to get some instances and examples to 275

make clarifications about the framework of this research. The general results and some 276

results about some connections are some avenues to make key point of this research, 277

“Cancer’s Recognition”, more understandable and more clear. 278

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

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

definitions about SuperHyperGraphs and Neutrosophic SuperHyperGraph are 281

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

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

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

clarifications alongside some results about new notions, SuperHyperColoring and 285

Neutrosophic SuperHyperColoring, are figured out in sections “ SuperHyperColoring” 286

and “Neutrosophic SuperHyperColoring”. In the sense of tackling on getting results and 287

in order to make sense about continuing the research, the ideas of SuperHyperUniform 288

and Neutrosophic SuperHyperUniform are introduced and as their consequences, 289

corresponded SuperHyperClasses are figured out to debut what’s done in this section, 290

titled “Results on SuperHyperClasses” and “Results on Neutrosophic 291

SuperHyperClasses”. As going back to origin of the notions, there are some smart steps 292

toward the common notions to extend the new notions in new frameworks, 293

SuperHyperGraph and Neutrosophic SuperHyperGraph, in the sections “Results on 294

SuperHyperClasses” and “Results on Neutrosophic SuperHyperClasses”. The starter 295

research about the general SuperHyperRelations and as concluding and closing section 296

of theoretical research are contained in the section “General Results”. Some general 297

SuperHyperRelations are fundamental and they are well-known as fundamental 298

SuperHyperNotions as elicited and discussed in the sections, “General Results”, “ 299

SuperHyperColoring”, “Neutrosophic SuperHyperColoring”, “Results on 300

SuperHyperClasses” and “Results on Neutrosophic SuperHyperClasses”. There are 301

curious questions about what’s done about the SuperHyperNotions to make sense about 302

excellency of this research and going to figure out the word “best” as the description 303

and adjective for this research as presented in section, “ SuperHyperColoring”. The 304

keyword of this research debut in the section “Applications in Cancer’s Recognition” 305

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

with two cases and subsections “Case 1: The Initial Steps Toward SuperHyperBipartite 306

as SuperHyperModel” and “Case 2: The Increasing Steps Toward 307

SuperHyperMultipartite as SuperHyperModel”. In the section, “Open Problems”, there 308

are some scrutiny and discernment on what’s done and what’s happened in this research 309

in the terms of “questions” and “problems” to make sense to figure out this research in 310

featured style. The advantages and the limitations of this research alongside about 311

what’s done in this research to make sense and to get sense about what’s figured out are 312

included in the section, “Conclusion and Closing Remarks”. 313

3 Neutrosophic Preliminaries Of This Scientific 314

Research On the Redeemed Ways 315

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

Neutrosophic Set](Ref. [96],Definition 2.2,p.2), [Neutrosophic Set](Ref. [96],Definition 317

2.1,p.1), [Neutrosophic SuperHyperGraph (NSHG)](Ref. [96],Definition 2.5,p.2), 318

[Characterization of the Neutrosophic SuperHyperGraph (NSHG)](Ref. [96],Definition 319

2.7,p.3), [t-norm](Ref. [96], Definition 2.7, p.3), and [Characterization of the 320

Neutrosophic SuperHyperGraph (NSHG)](Ref. [96],Definition 2.7,p.3), [Neutrosophic 321

Strength of the Neutrosophic SuperHyperPaths] (Ref. [96],Definition 5.3,p.7), and 322

[Different Neutrosophic Types of Neutrosophic SuperHyperEdges (NSHE)] 323

(Ref. [96],Definition 5.4,p.7). Also, the new ideas and their clarifications are addressed 324

to Ref. [96]. 325

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

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

Definition 3.1 (Neutrosophic Set). (Ref. [96],Definition 2.1,p.1). 328

Let X be a space 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 329
+
]− 0, 1 [. 330

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

Let X be a space 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 .

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.4. The support of X ⊂ A of the single valued Neutrosophic set


A = {< x : TA (x), IA (x), FA (x) >, x ∈ X}:

supp(X) = {x ∈ X : TA (x), IA (x), FA (x) > 0}.

Definition 3.5 (Neutrosophic SuperHyperGraph (NSHG)). (Ref. [96],Definition 332

2.5,p.2). 333

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

ordered pair S = (V, E), where 335

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

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

1, 2, . . . , n); 338

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

V; 340

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

1, 2, . . . , n0 ); 342

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

(Ref. [96],Definition 2.7,p.3). 359

Assume a Neutrosophic SuperHyperGraph (NSHG) S is an ordered pair S = (V, E). 360

The Neutrosophic SuperHyperEdges (NSHE) Ei0 and the Neutrosophic 361

SuperHyperVertices (NSHV) Vi of Neutrosophic SuperHyperGraph (NSHG) S = (V, E) 362

could be characterized as follow-up items. 363

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

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) if |Vi | ≥ 1, then Vi is called SuperVertex; 365

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

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

HyperEdge; 368

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

SuperEdge; 370

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

SuperHyperEdge. 372

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

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

Definition 3.7 (t-norm). (Ref. [96], Definition 2.7, p.3). 375

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

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

(i) 1 ⊗ x = x; 378

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

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

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

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

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

ordered pair S = (V, E), where 384

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

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

1, 2, . . . , n); 387

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

V; 389

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

1, 2, . . . , n0 ); 391

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

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

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

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

supp(Ei0 ) = V, (i0 = 1, 2, . . . , n0 ).
P
(viii) i0 395

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

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

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

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

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

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

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

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

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

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

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

(Ref. [96],Definition 2.7,p.3). 407

Assume a Neutrosophic SuperHyperGraph (NSHG) S is an ordered pair S = (V, E). 408

The Neutrosophic SuperHyperEdges (NSHE) Ei0 and the Neutrosophic 409

SuperHyperVertices (NSHV) Vi of Neutrosophic SuperHyperGraph (NSHG) S = (V, E) 410

could be characterized as follow-up items. 411

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

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

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

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

HyperEdge; 416

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

SuperEdge; 418

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

SuperHyperEdge. 420

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

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

SuperHyperGraph makes the patterns and regularities. 423

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

number of elements of SuperHyperEdges are the same. 425

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

introduced. It makes to have SuperHyperUniform more understandable. 427

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

SuperHyperClasses as follows. 429

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

intersection amid two given SuperHyperEdges with two exceptions; 431

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

given SuperHyperEdges; 433

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

SuperHyperEdges; 435

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). it’s SuperHyperBipartite it’s only one SuperVertex as intersection amid two 436

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

no SuperHyperEdge in common; 438

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

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

has no SuperHyperEdge in common; 441

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

given SuperHyperEdges and one SuperVertex has one SuperHyperEdge with any 443

common SuperVertex. 444

Definition 3.14. Let an ordered 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 445

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

of following conditions hold: 447

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

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

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

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

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

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

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

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

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


0
∈ Vi+1 such that 456
0 0
Vi , Vi+1 ∈ Ei0 . 457

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

Assume a Neutrosophic SuperHyperGraph (NSHG) S is an ordered 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. 459

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

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

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

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

SuperHyperPath . 464

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

(Ref. [96],Definition 5.3,p.7). 466

Assume a Neutrosophic SuperHyperGraph (NSHG) S is an ordered 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 467

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

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

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

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

Definition 3.17 (Different Neutrosophic Types of Neutrosophic SuperHyperEdges 472

(NSHE)). (Ref. [96],Definition 5.4,p.7). 473

Assume a Neutrosophic SuperHyperGraph (NSHG) S is an ordered pair S = (V, E). 474

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

called 476

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

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

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

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

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

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

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

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

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

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

Neutrosophic strength of SuperHyperPath (NSHP) from Neutrosophic 487

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

where 1 ≤ i, j ≤ s. 489

Definition 3.18. (Different Neutrosophic Types of Neutrosophic SuperHyperColoring). 490

Assume a Neutrosophic SuperHyperGraph (NSHG) S is an ordered pair S = (V, E). 491

Consider a Neutrosophic SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and 492

E 0 = {E1 , E2 , . . . , Ez }. Then either V 0 or E 0 is called 493

(i) Neutrosophic e-SuperHyperColoring if Vc ∈ Ea , Eb ∈ E 0 such that 494

d(Ea ) 6= d(Eb ); 495

(ii) Neutrosophic re-SuperHyperColoring if Vc ∈ Ea , Eb ∈ E 0 such that 496

d(Ea ) 6= d(Eb ); and 497

|Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 498

(iii) Neutrosophic v-SuperHyperColoring if Va , Vb ∈ V 0 , Va , Vb ∈ Ec such that 499

d(Va ) 6= V (Eb ); 500

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) Neutrosophic rv-SuperHyperColoring if Va , Vb ∈ V 0 , Va , Vb ∈ Ec such that 501

d(Va ) 6= V (Eb ); and 502

|Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; 503

(v) Neutrosophic SuperHyperColoring if it’s either of Neutrosophic 504

e-SuperHyperColoring, Neutrosophic re-SuperHyperColoring, Neutrosophic 505

v-SuperHyperColoring, and Neutrosophic rv-SuperHyperColoring. 506

Definition 3.19. ((Neutrosophic) SuperHyperColoring). 507

Assume a Neutrosophic SuperHyperGraph (NSHG) S is an ordered pair S = (V, E). 508

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

called 510

(i) an Extreme SuperHyperColoring if it’s either of Neutrosophic 511

e-SuperHyperColoring, Neutrosophic re-SuperHyperColoring, Neutrosophic 512

v-SuperHyperColoring, and Neutrosophic rv-SuperHyperColoring and C(N SHG) 513

for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme 514

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

Extreme SuperHyperEdges in the consecutive Extreme sequence of Extreme 516

SuperHyperEdges and Extreme SuperHyperVertices such that they form the 517

Extreme SuperHyperColoring; 518

(ii) a Neutrosophic SuperHyperColoring if it’s either of Neutrosophic 519

e-SuperHyperColoring, Neutrosophic re-SuperHyperColoring, Neutrosophic 520

v-SuperHyperColoring, and Neutrosophic rv-SuperHyperColoring and C(N SHG) 521

for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum 522

Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic 523

SuperHyperSet S of high Neutrosophic cardinality consecutive Neutrosophic 524

SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the 525

Neutrosophic SuperHyperColoring; 526

(iii) an Extreme SuperHyperColoring SuperHyperPolynomial if it’s either of 527

Neutrosophic e-SuperHyperColoring, Neutrosophic re-SuperHyperColoring, 528

Neutrosophic v-SuperHyperColoring, and Neutrosophic rv-SuperHyperColoring 529

and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme 530

SuperHyperPolynomial contains the Extreme coefficients defined as the Extreme 531

number of the maximum Extreme cardinality of the Extreme SuperHyperEdges of 532

an Extreme SuperHyperSet S of high Extreme cardinality consecutive Extreme 533

SuperHyperEdges and Extreme SuperHyperVertices such that they form the 534

Extreme SuperHyperColoring; and the Extreme power is corresponded to its 535

Extreme coefficient; 536

(iv) a Neutrosophic SuperHyperColoring SuperHyperPolynomial if it’s 537

either of Neutrosophic e-SuperHyperColoring, Neutrosophic 538

re-SuperHyperColoring, Neutrosophic v-SuperHyperColoring, and Neutrosophic 539

rv-SuperHyperColoring and C(N SHG) for a Neutrosophic SuperHyperGraph 540

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

Neutrosophic coefficients defined as the Neutrosophic number of the maximum 542

Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic 543

SuperHyperSet S of high Neutrosophic cardinality consecutive Neutrosophic 544

SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the 545

Neutrosophic SuperHyperColoring; and the Neutrosophic power is corresponded 546

to its Neutrosophic coefficient; 547

(v) an Extreme V-SuperHyperColoring if it’s either of Neutrosophic 548

e-SuperHyperColoring, Neutrosophic re-SuperHyperColoring, Neutrosophic 549

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-SuperHyperColoring, and Neutrosophic rv-SuperHyperColoring and C(N SHG) 550

for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme 551

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

Extreme SuperHyperVertices in the consecutive Extreme sequence of Extreme 553

SuperHyperEdges and Extreme SuperHyperVertices such that they form the 554

Extreme SuperHyperColoring; 555

(vi) a Neutrosophic V-SuperHyperColoring if it’s either of Neutrosophic 556

e-SuperHyperColoring, Neutrosophic re-SuperHyperColoring, Neutrosophic 557

v-SuperHyperColoring, and Neutrosophic rv-SuperHyperColoring and C(N SHG) 558

for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum 559

Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a 560

Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive 561

Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that 562

they form the Neutrosophic SuperHyperColoring; 563

(vii) an Extreme V-SuperHyperColoring SuperHyperPolynomial if it’s either 564

of Neutrosophic e-SuperHyperColoring, Neutrosophic re-SuperHyperColoring, 565

Neutrosophic v-SuperHyperColoring, and Neutrosophic rv-SuperHyperColoring 566

and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme 567

SuperHyperPolynomial contains the Extreme coefficients defined as the Extreme 568

number of the maximum Extreme cardinality of the Extreme SuperHyperVertices 569

of an Extreme SuperHyperSet S of high Extreme cardinality consecutive Extreme 570

SuperHyperEdges and Extreme SuperHyperVertices such that they form the 571

Extreme SuperHyperColoring; and the Extreme power is corresponded to its 572

Extreme coefficient; 573

(viii) a Neutrosophic SuperHyperColoring SuperHyperPolynomial if it’s 574

either of Neutrosophic e-SuperHyperColoring, Neutrosophic 575

re-SuperHyperColoring, Neutrosophic v-SuperHyperColoring, and Neutrosophic 576

rv-SuperHyperColoring and C(N SHG) for a Neutrosophic SuperHyperGraph 577

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

Neutrosophic coefficients defined as the Neutrosophic number of the maximum 579

Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a 580

Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive 581

Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that 582

they form the Neutrosophic SuperHyperColoring; and the Neutrosophic power is 583

corresponded to its Neutrosophic coefficient. 584

Definition 3.20. ((Extreme/Neutrosophic)δ−SuperHyperColoring). 585

Assume a Neutrosophic SuperHyperGraph (NSHG) S is an ordered pair S = (V, E). 586

Then 587

(i) an δ−SuperHyperColoring is a Neutrosophic kind of Neutrosophic 588

SuperHyperColoring such that either of the following expressions hold for the 589

Neutrosophic cardinalities of SuperHyperNeighbors of s ∈ S : 590

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

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

(ii) a Neutrosophic δ−SuperHyperColoring is a Neutrosophic kind of 593

Neutrosophic SuperHyperColoring such that either of the following Neutrosophic 594

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

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

expressions hold for the Neutrosophic cardinalities of SuperHyperNeighbors of 595

s∈S: 596

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

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

δ−SuperHyperDefensive. 599

For the sake of having a Neutrosophic SuperHyperColoring, there’s a need to 600

“redefine” the notion of “Neutrosophic SuperHyperGraph”. The SuperHyperVertices 601

and the SuperHyperEdges are assigned by the labels from the letters of the alphabets. 602

In this procedure, there’s the usage of the position of labels to assign to the values. 603

Definition 3.21. Assume a Neutrosophic SuperHyperGraph (NSHG) S is an ordered 604

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

holds. 606

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

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

understandable. 609

Definition 3.22. Assume a Neutrosophic SuperHyperGraph (NSHG) S is an ordered 610

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

holds. Thus Neutrosophic SuperHyperPath , SuperHyperColoring, SuperHyperStar, 612

SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, are 613

Neutrosophic SuperHyperPath, Neutrosophic SuperHyperCycle, 614

Neutrosophic SuperHyperStar, Neutrosophic SuperHyperBipartite, 615

Neutrosophic SuperHyperMultiPartite, and Neutrosophic 616

SuperHyperWheel if the Table (2) holds. 617

It’s useful to define a “Neutrosophic” version of a Neutrosophic SuperHyperColoring. 618

Since there’s more ways to get type-results to make a Neutrosophic SuperHyperColoring 619

more Neutrosophicly understandable. 620

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

For the sake of having a Neutrosophic SuperHyperColoring, there’s a need to 621

“redefine” the Neutrosophic notion of “Neutrosophic SuperHyperColoring”. The 622

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

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

assign to the values. 625

Definition 3.23. Assume a SuperHyperColoring. It’s redefined a Neutrosophic 626

SuperHyperColoring if the Table (3) holds. 627

4 Neutrosophic SuperHyperColoring But As The 628

Extensions Excerpt From Dense And Super 629

Forms 630

Example 4.1. Assume a Neutrosophic SuperHyperGraph (NSHG) S is an ordered pair 631

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

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

SuperHyperColoring, is up. The Neutrosophic Algorithm is Neutrosophicly 634

straightforward. E1 and E3 are some empty Neutrosophic SuperHyperEdges but 635

E2 is a loop Neutrosophic SuperHyperEdge and E4 is a Neutrosophic 636

SuperHyperEdge. Thus in the terms of Neutrosophic SuperHyperNeighbor, 637

there’s only one Neutrosophic SuperHyperEdge, namely, E4 . The Neutrosophic 638

SuperHyperVertex, V3 is Neutrosophic isolated means that there’s no 639

Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. Thus the 640

Neutrosophic SuperHyperVertex, V3 , is excluded in every given Neutrosophic 641

SuperHyperColoring. 642

C(N SHG)Neutrosophic SuperHyperColoring = {E4 }.


C(N SHG)Neutrosophic SuperHyperColoring SuperHyperPolynomial = z.
C(N SHG)Neutrosophic V-SuperHyperColoring = {Vi }i6=4 .
C(N SHG)Neutrosophic V-SuperHyperColoring SuperHyperPolynomial = z 3 .

643

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

SuperHyperColoring, is up. The Neutrosophic Algorithm is Neutrosophicly 645

straightforward. E1 , E2 and E3 are some empty Neutrosophic SuperHyperEdges 646

but E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of Neutrosophic 647

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

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

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

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 SuperHyperColoring in the Neutrosophic Example (16.3)

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

SuperHyperColoring. 652

C(N SHG)Neutrosophic SuperHyperColoring = {E4 }.


C(N SHG)Neutrosophic SuperHyperColoring SuperHyperPolynomial = z.
C(N SHG)Neutrosophic V-SuperHyperColoring = {Vi }i6=4 .
C(N SHG)Neutrosophic V-SuperHyperColoring SuperHyperPolynomial = z 3 .

653

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

SuperHyperColoring, is up. The Neutrosophic Algorithm is Neutrosophicly 655

straightforward. 656

C(N SHG)Neutrosophic SuperHyperColoring = {E4 }.


C(N SHG)Neutrosophic SuperHyperColoring SuperHyperPolynomial = z.
C(N SHG)Neutrosophic V-SuperHyperColoring = {Vi }3i=1 .
C(N SHG)Neutrosophic V-SuperHyperColoring SuperHyperPolynomial = z 3 .

657

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

SuperHyperColoring, is up. The Neutrosophic Algorithm is Neutrosophicly 659

straightforward. 660

C(N SHG)Neutrosophic SuperHyperColoring = {Ei }i6=1,2 .


C(N SHG)Neutrosophic SuperHyperColoring SuperHyperPolynomial = 3z 3 .
C(N SHG)Neutrosophic V-SuperHyperColoring = {Vi }Vi 6=H,V4 ,O .
C(N SHG)Neutrosophic V-SuperHyperColoring SuperHyperPolynomial
= 3 × 4z 5 .

661

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 SuperHyperColoring in the Neutrosophic Example (16.3)

Figure 3. The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions


of Neutrosophic SuperHyperColoring 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 SuperHyperColoring in the Neutrosophic Example (16.3)

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

SuperHyperColoring, is up. The Neutrosophic Algorithm is Neutrosophicly 663

straightforward. 664

C(N SHG)Neutrosophic SuperHyperColoring = {Ei }4i=1 .


C(N SHG)Neutrosophic SuperHyperColoring SuperHyperPolynomial = z 4 .
C(N SHG)Neutrosophic V-SuperHyperColoring = {Vi }8i=5 .
C(N SHG)Neutrosophic V-SuperHyperColoring SuperHyperPolynomial
= sz 5 .

665

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

SuperHyperColoring, is up. The Neutrosophic Algorithm is Neutrosophicly 667

straightforward. 668

C(N SHG)Neutrosophic SuperHyperColoring = {Ei }i=1,2,3 .


C(N SHG)Neutrosophic SuperHyperColoring SuperHyperPolynomial = az 3 .
C(N SHG)Neutrosophic V-SuperHyperColoring = {Vi }i=1,2,3 .
C(N SHG)Neutrosophic V-Quasi-SuperHyperColoring SuperHyperPolynomial = bz 3 .

669

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

SuperHyperColoring, is up. The Neutrosophic Algorithm is Neutrosophicly 671

straightforward. 672

C(N SHG)Neutrosophic SuperHyperColoring =


{Ei , E12 , E14 , E17 }11
i=7 .
C(N SHG)Neutrosophic SuperHyperColoring SuperHyperPolynomial = 2z 8 .
C(N SHG)Neutrosophic V-SuperHyperColoring = {Vi }i=8,9,10,11,14 .
C(N SHG)Neutrosophic V-SuperHyperColoring SuperHyperPolynomial = 3z 5 .

673

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 SuperHyperColoring in the Neutrosophic Example (16.3)

Figure 6. The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions


of Neutrosophic SuperHyperColoring 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 7. The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions


of Neutrosophic SuperHyperColoring in the Neutrosophic Example (16.3)

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

SuperHyperColoring, is up. The Neutrosophic Algorithm is Neutrosophicly 675

straightforward. 676

C(N SHG)Neutrosophic SuperHyperColoring = {Ei }i=1,4 .


C(N SHG)Neutrosophic SuperHyperColoring SuperHyperPolynomial = 3z 2 .
C(N SHG)Neutrosophic V-SuperHyperColoring = {Vi , V14 }11
i=8 .
C(N SHG)Neutrosophic V-SuperHyperColoring SuperHyperPolynomial = 2z 5 .
677

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

SuperHyperColoring, is up. The Neutrosophic Algorithm is Neutrosophicly 679

straightforward. 680

C(N SHG)Neutrosophic SuperHyperColoring = {Ei }i=1,2,13 .


C(N SHG)Neutrosophic SuperHyperColoring SuperHyperPolynomial = az 3 .
C(N SHG)Neutrosophic V-SuperHyperColoring = {Vi }22
i=11 .
C(N SHG)Neutrosophic V-Quasi-SuperHyperColoring SuperHyperPolynomial = z 11 .
681

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

SuperHyperColoring, is up. The Neutrosophic Algorithm is Neutrosophicly 683

straightforward. 684

C(N SHG)Neutrosophic SuperHyperColoring = {Ei }i=1,4,5,6 .


C(N SHG)Neutrosophic SuperHyperColoring SuperHyperPolynomial = 3z 3 .
C(N SHG)Neutrosophic V-SuperHyperColoring = {Vi , V14 }11
i=8 .
C(N SHG)Neutrosophic V-SuperHyperColoring SuperHyperPolynomial = 2z 5 .
685

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 SuperHyperColoring in the Neutrosophic Example (16.3)

Figure 9. The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions


of Neutrosophic SuperHyperColoring 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 10. The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic


Notions of Neutrosophic SuperHyperColoring in the Neutrosophic Example (16.3)

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

SuperHyperColoring, is up. The Neutrosophic Algorithm is Neutrosophicly 687

straightforward. 688

C(N SHG)Neutrosophic SuperHyperColoring = {Ei }i=1,6,7,8 .


C(N SHG)Neutrosophic SuperHyperColoring SuperHyperPolynomial = z 4 .
C(N SHG)Neutrosophic V-SuperHyperColoring = {Vi }i6=4,5,6 .
C(N SHG)Neutrosophic V-SuperHyperColoring SuperHyperPolynomial = 4z 3 .

689

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

SuperHyperColoring, is up. The Neutrosophic Algorithm is Neutrosophicly 691

straightforward. 692

C(N SHG)Extreme SuperHyperColoring = {Ei }6i=1 .


C(N SHG)Extreme SuperHyperColoring SuperHyperPolynomial = z 6 .
C(N SHG)Extreme V-SuperHyperColoring = {Vi }i6=4,5,6,9,10 .
C(N SHG)Extreme V-SuperHyperColoring SuperHyperPolynomial =
= 5z 6 .

693

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

SuperHyperColoring, is up. The Neutrosophic Algorithm is Neutrosophicly 695

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 11. The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic


Notions of Neutrosophic SuperHyperColoring in the Neutrosophic Example (16.3)

Figure 12. The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic


Notions of Neutrosophic SuperHyperColoring 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 13. The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic


Notions of Neutrosophic SuperHyperColoring in the Neutrosophic Example (16.3)

straightforward. 696

C(N SHG)Neutrosophic SuperHyperColoring = {Ei }i6=1,9,10 .


C(N SHG)Neutrosophic SuperHyperColoring SuperHyperPolynomial = z 7 .
C(N SHG)Neutrosophic V-SuperHyperColoring = {Vi }i6=4,6 .
C(N SHG)Neutrosophic V-SuperHyperColoring SuperHyperPolynomial
= 6z 4 .

697

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

SuperHyperColoring, is up. The Neutrosophic Algorithm is Neutrosophicly 699

straightforward. 700

C(N SHG)Extreme SuperHyperColoring = {E1 , E2 }.


C(N SHG)Extreme SuperHyperColoring SuperHyperPolynomial = z 2 .
C(N SHG)Extreme V-SuperHyperColoring = {V1 , V2 }.
C(N SHG)Extreme V-SuperHyperColoring SuperHyperPolynomial = z 2 .

701

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

SuperHyperColoring, is up. The Neutrosophic Algorithm is Neutrosophicly 703

straightforward. 704

C(N SHG)Extreme SuperHyperColoring = {E1 , E2 }.


C(N SHG)Extreme SuperHyperColoring SuperHyperPolynomial = 4z 2 .
C(N SHG)Extreme V-SuperHyperColoring = {V1 , V2 }.
C(N SHG)Extreme V-SuperHyperColoring SuperHyperPolynomial = 5z 2 .

705

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 SuperHyperColoring in the Neutrosophic Example (16.3)

Figure 15. The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic


Notions of Neutrosophic SuperHyperColoring 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 16. The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic


Notions of Neutrosophic SuperHyperColoring in the Neutrosophic Example (16.3)

• On the Figure (16), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 706

SuperHyperColoring, is up. The Neutrosophic Algorithm is Neutrosophicly 707

straightforward. 708

C(N SHG)Extreme SuperHyperColoring = {E1 , E2 }.


C(N SHG)Extreme SuperHyperColoring SuperHyperPolynomial = 4z 2 .
C(N SHG)Extreme V-SuperHyperColoring = {V1 , Vi }17
i=8 .
C(N SHG)Extreme V-SuperHyperColoring SuperHyperPolynomial = az 10 .

709

• On the Figure (17), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 710

SuperHyperColoring, is up. The Neutrosophic Algorithm is Neutrosophicly 711

straightforward. 712

C(N SHG)Extreme SuperHyperColoring = {E1 , E2 }.


C(N SHG)Extreme SuperHyperColoring SuperHyperPolynomial = 5z 2 .
C(N SHG)Extreme V-SuperHyperColoring = {V1 , Vi }17
i=8 .
C(N SHG)Extreme V-SuperHyperColoring SuperHyperPolynomial = az 10 .

713

• On the Figure (18), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 714

SuperHyperColoring, is up. The Neutrosophic Algorithm is Neutrosophicly 715

straightforward. 716

C(N SHG)Extreme SuperHyperColoring = {E1 , E2 }.


C(N SHG)Extreme SuperHyperColoring SuperHyperPolynomial = 5z 2 .
C(N SHG)Extreme V-SuperHyperColoring = {V1 , Vi }17
i=8 .
C(N SHG)Extreme V-SuperHyperColoring SuperHyperPolynomial = az 10 .

717

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 SuperHyperColoring in the Neutrosophic Example (16.3)

Figure 18. The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic


Notions of Neutrosophic SuperHyperColoring 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 SuperHyperColoring in the Neutrosophic Example (16.3)

• On the Figure (19), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 718

SuperHyperColoring, is up. The Neutrosophic Algorithm is Neutrosophicly 719

straightforward. 720

C(N SHG)Extreme SuperHyperColoring = {E1 , E2 }.


C(N SHG)Extreme SuperHyperColoring SuperHyperPolynomial = 12z 2 .
C(N SHG)Extreme V-SuperHyperColoring = {Vi }Vi ∈E8 .
C(N SHG)Extreme V-SuperHyperColoring SuperHyperPolynomial = az 8 .
721

• On the Figure (20), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 722

SuperHyperColoring, is up. The Neutrosophic Algorithm is Neutrosophicly 723

straightforward. 724

C(N SHG)Extreme SuperHyperColoring = {E1 , E2 }.


C(N SHG)Extreme SuperHyperColoring SuperHyperPolynomial
= ten choose two z 2 .
C(N SHG)Extreme V-SuperHyperColoring = {Vi }Vi ∈E8 .
C(N SHG)Extreme V-SuperHyperColoring SuperHyperPolynomial = az |E8 | .
725

• On the Figure (21), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 726

SuperHyperColoring, is up. The Neutrosophic Algorithm is Neutrosophicly 727

straightforward. 728

C(N SHG)Neutrosophic SuperHyperColoring = {E1 , E2 }.


C(N SHG)Neutrosophic SuperHyperColoring SuperHyperPolynomial = z 2 .
C(N SHG)Neutrosophic V-SuperHyperColoring = {Vi }ViN SHG .
C(N SHG)Neutrosophic V-SuperHyperColoring SuperHyperPolynomial = z 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

Figure 20. The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic


Notions of Neutrosophic SuperHyperColoring in the Neutrosophic Example (16.3)

729

• On the Figure (22), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 730

SuperHyperColoring, is up. The Neutrosophic Algorithm is Neutrosophicly 731

straightforward. 732

C(N SHG)Extreme SuperHyperColoring = {E1 , E2 }.


C(N SHG)Extreme SuperHyperColoring SuperHyperPolynomial = 4z 2 .
C(N SHG)Extreme V-SuperHyperColoring
= {Vi }Vi ∈E3 .
C(N SHG)Extreme V-SuperHyperColoring SuperHyperPolynomial
= az 12 .

733

5 The Neutrosophic Departures on The Theoretical 734

Results Toward Theoretical Motivations 735

The previous Neutrosophic approach apply on the upcoming Neutrosophic results on 736

Neutrosophic SuperHyperClasses. 737

Proposition 5.1. Assume a connected Neutrosophic SuperHyperPath ESHP : (V, E). 738

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 SuperHyperColoring in the Neutrosophic Example (16.3)

Figure 22. The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic


Notions of Neutrosophic SuperHyperColoring 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

Then 739

C(N SHG)Neutrosophic SuperHyperColoring = {Ei , Ei+1 }.


C(N SHG)Neutrosophic SuperHyperColoring SuperHyperPolynomial
= (|EN SHG | − 1)z 2 .
C(N SHG)Neutrosophic V-SuperHyperColoring
= {Vi }Vi ∈Ei ||Ei |=maxEj ∈EN SHG |Ej | .
C(N SHG)Neutrosophic V-SuperHyperColoring SuperHyperPolynomial
= az |Ei |=maxEj ∈EN SHG |Ej | .

Proof. Let 740

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 .
741

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E1 ,
...,
EXT ERN AL
V|E i |=maxE ∈E |Ej | , E1 ,
j N SHG

be a longest path taken from a connected Neutrosophic SuperHyperPath 742

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

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 744

corresponded to ViEXT ERN AL in the literatures of SuperHyperColoring. The latter is 745

straightforward. 746

Example 5.2. In the Figure (23), the connected Neutrosophic SuperHyperPath 747

ESHP : (V, E), is highlighted and featured. The Neutrosophic SuperHyperSet, in the 748

Neutrosophic SuperHyperModel (23), is the SuperHyperColoring. 749

There are two notions on SuperHyperColoring in SuperHyperCycle. Twin and 750

antipodal. The first is about having the same SuperHyperNeighborhoods and the latter 751

is having the same SuperHyperDistance but both could not be out of the any given 752

SuperHyperColoring easily. All Twin SuperHyperVertices could not be out of the any 753

given SuperHyperColoring and one of them could be out but the latter have to be 754

inside. All Antipodal SuperHyperVertices could not be out of the any given 755

SuperHyperColoring and one of them could be out but the latter have to be inside. and 756

one of them could be out but the latter have to be inside. The proof for both of the is 757

straightforward. 758

Proposition 5.3. Assume a connected Neutrosophic SuperHyperCycle ESHC : (V, E). 759

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


SuperHyperColoring in the Example (16.5)

Then 760

C(N SHG)Neutrosophic SuperHyperColoring = {Ei , Ei+1 }.


C(N SHG)Neutrosophic SuperHyperColoring SuperHyperPolynomial
= (|EN SHG |)z 2 .
C(N SHG)Neutrosophic V-SuperHyperColoring
= {Vi }Vi ∈Ei ||Ei |=maxEj ∈EN SHG |Ej | .
C(N SHG)Neutrosophic V-SuperHyperColoring SuperHyperPolynomial
= az |Ei |=maxEj ∈EN SHG |Ej | .
Proof. Let 761

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 .
762

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E1 ,
...,
EXT ERN AL
V|E i |=maxE ∈E |Ej | , E1 ,
j N SHG

be a longest path taken from a connected Neutrosophic SuperHyperCycle 763

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

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

Figure 24. a Neutrosophic SuperHyperCycle Associated to the Neutrosophic Notions


of Neutrosophic SuperHyperColoring in the Neutrosophic Example (16.7)

The term “EXTERNAL” implies |N (ViEXT ERN AL )| ≥ |N (Vj )| where Vj is 765

corresponded to ViEXT ERN AL in the literatures of SuperHyperColoring. The latter is 766

straightforward. 767

Example 5.4. In the Figure (24), the connected Neutrosophic SuperHyperCycle 768

N SHC : (V, E), is highlighted and featured. The obtained Neutrosophic 769

SuperHyperSet, in the Neutrosophic SuperHyperModel (24), is the Neutrosophic 770

SuperHyperColoring. 771

Proposition 5.5. Assume a connected Neutrosophic SuperHyperStar ESHS : (V, E). 772

Then 773

C(N SHG)Neutrosophic SuperHyperColoring = {Ei , Ei+1 }.


C(N SHG)Neutrosophic SuperHyperColoring SuperHyperPolynomial
= |EN SHG | choose twoz 2 .
C(N SHG)Neutrosophic V-SuperHyperColoring
= {Vi }Vi ∈Ei ||Ei |=maxEj ∈EN SHG |Ej | .
C(N SHG)Neutrosophic V-SuperHyperColoring SuperHyperPolynomial
= az |Ei |=maxEj ∈EN SHG |Ej | .

Proof. Let 774

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

Figure 25. a Neutrosophic SuperHyperStar Associated to the Neutrosophic Notions of


Neutrosophic SuperHyperColoring in the Neutrosophic Example (16.9)

775

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E1 ,
...,
EXT ERN AL
V|E i |=maxE ∈E |Ej | , E1 ,
j N SHG

be a longest path taken a connected Neutrosophic SuperHyperStar ESHS : (V, E). 776

There’s a new way to redefine as 777

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 778

corresponded to ViEXT ERN AL in the literatures of SuperHyperColoring. The latter is 779

straightforward. 780

Example 5.6. In the Figure (25), the connected Neutrosophic SuperHyperStar 781

ESHS : (V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, 782

by the Algorithm in previous Neutrosophic result, of the Neutrosophic 783

SuperHyperVertices of the connected Neutrosophic SuperHyperStar ESHS : (V, E), in 784

the Neutrosophic SuperHyperModel (25), is the Neutrosophic SuperHyperColoring. 785

Proposition 5.7. Assume a connected Neutrosophic SuperHyperBipartite 786

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

ESHB : (V, E). Then 787

C(N SHG)Neutrosophic SuperHyperColoring = {Ei , Ei+1 }.


C(N SHG)Neutrosophic SuperHyperColoring SuperHyperPolynomial
∗ s
= |EN SHG | choose sz .
C(N SHG)Neutrosophic V-SuperHyperColoring
= {Vi }Vi ∈Ei ||Ei |=maxEj ∈EN SHG |Ej | .
C(N SHG)Neutrosophic V-SuperHyperColoring SuperHyperPolynomial
= az |Ei |=maxEj ∈EN SHG |Ej | .

Proof. Let 788

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 .
789

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E1 ,
...,
EXT ERN AL
V|E i |=maxE ∈E |Ej | , E1 ,
j N SHG

is a longest path taken from a connected Neutrosophic SuperHyperBipartite 790

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

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 792

corresponded to ViEXT ERN AL in the literatures of SuperHyperColoring. The latter is 793

straightforward. Then there’s no at least one SuperHyperColoring. Thus the notion of 794

quasi may be up but the SuperHyperNotions based on SuperHyperColoring could be 795

applied. There are only two SuperHyperParts. Thus every SuperHyperPart could have 796

one SuperHyperVertex as the representative in the 797

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

is a longest SuperHyperColoring taken from a connected Neutrosophic 798

SuperHyperBipartite ESHB : (V, E). Thus only some SuperHyperVertices and only 799

minimum-Neutrosophic-of-SuperHyperPart SuperHyperEdges are attained in any 800

solution 801

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

The latter is straightforward. 802

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 SuperHyperColoring in the Example (16.11)

Example 5.8. In the Neutrosophic Figure (26), the connected Neutrosophic 803

SuperHyperBipartite ESHB : (V, E), is Neutrosophic highlighted and Neutrosophic 804

featured. The obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in 805

previous Neutrosophic result, of the Neutrosophic SuperHyperVertices of the connected 806

Neutrosophic SuperHyperBipartite ESHB : (V, E), in the Neutrosophic 807

SuperHyperModel (26), is the Neutrosophic SuperHyperColoring. 808

Proposition 5.9. Assume a connected Neutrosophic SuperHyperMultipartite 809

ESHM : (V, E). Then 810

C(N SHG)Neutrosophic SuperHyperColoring = {Ei , Ei+1 }.


C(N SHG)Neutrosophic SuperHyperColoring SuperHyperPolynomial
∗ s
= |EN SHG | choose sz .
C(N SHG)Neutrosophic V-SuperHyperColoring
= {Vi }Vi ∈Ei ||Ei |=maxEj ∈EN SHG |Ej | .
C(N SHG)Neutrosophic V-SuperHyperColoring SuperHyperPolynomial
= az |Ei |=maxEj ∈EN SHG |Ej | .
Proof. Let 811

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 .
812

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E1 ,
...,
EXT ERN AL
V|E i |=maxE ∈E |Ej | , E1
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 SuperHyperColoring taken from a connected Neutrosophic 813

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

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 815

corresponded to ViEXT ERN AL in the literatures of SuperHyperColoring. The latter is 816

straightforward. Then there’s no at least one SuperHyperColoring. Thus the notion of 817

quasi may be up but the SuperHyperNotions based on SuperHyperColoring could be 818

applied. There are only z 0 SuperHyperParts. Thus every SuperHyperPart could have 819

one SuperHyperVertex as the representative in the 820

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest path taken from a connected Neutrosophic SuperHyperMultipartite 821

ESHM : (V, E). Thus only some SuperHyperVertices and only 822

minimum-Neutrosophic-of-SuperHyperPart SuperHyperEdges are attained in any 823

solution 824

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest path taken from a connected Neutrosophic SuperHyperMultipartite 825

ESHM : (V, E). The latter is straightforward. 826

Example 5.10. In the Figure (27), the connected Neutrosophic 827

SuperHyperMultipartite ESHM : (V, E), is highlighted and Neutrosophic featured. 828

The obtained Neutrosophic SuperHyperSet, by the Algorithm in previous Neutrosophic 829

result, of the Neutrosophic SuperHyperVertices of the connected Neutrosophic 830

SuperHyperMultipartite ESHM : (V, E), in the Neutrosophic SuperHyperModel (27), 831

is the Neutrosophic SuperHyperColoring. 832

Proposition 5.11. Assume a connected Neutrosophic SuperHyperWheel 833

ESHW : (V, E). Then, 834

C(N SHG)Neutrosophic SuperHyperColoring = {Ei , Ei+1 }.


C(N SHG)Neutrosophic SuperHyperColoring SuperHyperPolynomial
∗ 2
= |EN SHG | choose twoz .
C(N SHG)Neutrosophic V-SuperHyperColoring
= {Vi }Vi ∈Ei ||Ei |=maxEj ∈EN SHG |Ej | .
C(N SHG)Neutrosophic V-SuperHyperColoring SuperHyperPolynomial
= az |Ei |=maxEj ∈EN SHG |Ej | .
Proof. Let 835

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

Figure 27. a Neutrosophic SuperHyperMultipartite Associated to the Notions of


Neutrosophic SuperHyperColoring in the Example (16.13)

836

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E1 ,
...,
EXT ERN AL
V|E i |=maxE ∈E |Ej | , E1
j N SHG

is a longest SuperHyperColoring taken from a connected Neutrosophic 837

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

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 839

corresponded to ViEXT ERN AL in the literatures of SuperHyperColoring. The latter is 840

straightforward. Then there’s at least one SuperHyperColoring. Thus the notion of 841

quasi isn’t up and the SuperHyperNotions based on SuperHyperColoring could be 842

applied. The unique embedded SuperHyperColoring proposes some longest 843

SuperHyperColoring excerpt from some representatives. The latter is 844

straightforward. 845

Example 5.12. In the Neutrosophic Figure (28), the connected Neutrosophic 846

SuperHyperWheel N SHW : (V, E), is Neutrosophic highlighted and featured. The 847

obtained Neutrosophic SuperHyperSet, by the Algorithm in previous result, of the 848

Neutrosophic SuperHyperVertices of the connected Neutrosophic SuperHyperWheel 849

ESHW : (V, E), in the Neutrosophic SuperHyperModel (28), is the Neutrosophic 850

SuperHyperColoring. 851

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 SuperHyperColoring in the Neutrosophic Example
(16.15)

6 The Surveys of Mathematical Sets On The 852

Results But As The Initial Motivation 853

For the SuperHyperColoring, Neutrosophic SuperHyperColoring, and the Neutrosophic 854

SuperHyperColoring, some general results are introduced. 855

Remark 6.1. Let remind that the Neutrosophic SuperHyperColoring is “redefined” on 856

the positions of the alphabets. 857

Corollary 6.2. Assume Neutrosophic SuperHyperColoring. Then 858

N eutrosophic SuperHyperColoring =
{theSuperHyperColoringof theSuperHyperV ertices |
max |SuperHyperOf f ensive
SuperHyperColoring
|N eutrosophiccardinalityamidthoseSuperHyperColoring. }

plus one Neutrosophic SuperHypeNeighbor to one. Where σi is the unary operation on 859

the SuperHyperVertices of the SuperHyperGraph to assign the determinacy, the 860

indeterminacy and the neutrality, for i = 1, 2, 3, respectively. 861

Corollary 6.3. Assume a Neutrosophic SuperHyperGraph on the same identical letter 862

of the alphabet. Then the notion of Neutrosophic SuperHyperColoring and 863

SuperHyperColoring coincide. 864

Corollary 6.4. Assume a Neutrosophic SuperHyperGraph on the same identical letter 865

of the alphabet. Then a consecutive sequence of the SuperHyperVertices is a 866

Neutrosophic SuperHyperColoring if and only if it’s a SuperHyperColoring. 867

Corollary 6.5. Assume a Neutrosophic SuperHyperGraph on the same identical letter 868

of the alphabet. Then a consecutive sequence of the SuperHyperVertices is a strongest 869

SuperHyperColoring if and only if it’s a longest SuperHyperColoring. 870

Corollary 6.6. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph on the 871

same identical letter of the alphabet. Then its Neutrosophic SuperHyperColoring is its 872

SuperHyperColoring and reversely. 873

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.7. Assume a Neutrosophic SuperHyperPath(-/SuperHyperColoring, 874

SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel) on 875

the same identical letter of the alphabet. Then its Neutrosophic SuperHyperColoring is 876

its SuperHyperColoring and reversely. 877

Corollary 6.8. Assume a Neutrosophic SuperHyperGraph. Then its Neutrosophic 878

SuperHyperColoring isn’t well-defined if and only if its SuperHyperColoring isn’t 879

well-defined. 880

Corollary 6.9. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph. Then 881

its Neutrosophic SuperHyperColoring isn’t well-defined if and only if its 882

SuperHyperColoring isn’t well-defined. 883

Corollary 6.10. Assume a Neutrosophic SuperHyperPath(-/SuperHyperColoring, 884

SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). 885

Then its Neutrosophic SuperHyperColoring isn’t well-defined if and only if its 886

SuperHyperColoring isn’t well-defined. 887

Corollary 6.11. Assume a Neutrosophic SuperHyperGraph. Then its Neutrosophic 888

SuperHyperColoring is well-defined if and only if its SuperHyperColoring is well-defined. 889

Corollary 6.12. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph. 890

Then its Neutrosophic SuperHyperColoring is well-defined if and only if its 891

SuperHyperColoring is well-defined. 892

Corollary 6.13. Assume a Neutrosophic SuperHyperPath(-/SuperHyperColoring, 893

SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). 894

Then its Neutrosophic SuperHyperColoring is well-defined if and only if its 895

SuperHyperColoring is well-defined. 896

Proposition 6.14. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. Then V 897

is 898

(i) : the dual SuperHyperDefensive SuperHyperColoring; 899

(ii) : the strong dual SuperHyperDefensive SuperHyperColoring; 900

(iii) : the connected dual SuperHyperDefensive SuperHyperColoring; 901

(iv) : the δ-dual SuperHyperDefensive SuperHyperColoring; 902

(v) : the strong δ-dual SuperHyperDefensive SuperHyperColoring; 903

(vi) : the connected δ-dual SuperHyperDefensive SuperHyperColoring. 904

Proposition 6.15. Let N T G : (V, E, σ, µ) be a Neutrosophic SuperHyperGraph. Then 905

∅ is 906

(i) : the SuperHyperDefensive SuperHyperColoring; 907

(ii) : the strong SuperHyperDefensive SuperHyperColoring; 908

(iii) : the connected defensive SuperHyperDefensive SuperHyperColoring; 909

(iv) : the δ-SuperHyperDefensive SuperHyperColoring; 910

(v) : the strong δ-SuperHyperDefensive SuperHyperColoring; 911

(vi) : the connected δ-SuperHyperDefensive SuperHyperColoring. 912

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.16. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. Then an 913

independent SuperHyperSet is 914

(i) : the SuperHyperDefensive SuperHyperColoring; 915

(ii) : the strong SuperHyperDefensive SuperHyperColoring; 916

(iii) : the connected SuperHyperDefensive SuperHyperColoring; 917

(iv) : the δ-SuperHyperDefensive SuperHyperColoring; 918

(v) : the strong δ-SuperHyperDefensive SuperHyperColoring; 919

(vi) : the connected δ-SuperHyperDefensive SuperHyperColoring. 920

Proposition 6.17. Let ESHG : (V, E) be a Neutrosophic SuperHyperUniform 921

SuperHyperGraph which is a SuperHyperColoring/SuperHyperPath. Then V is a 922

maximal 923

(i) : SuperHyperDefensive SuperHyperColoring; 924

(ii) : strong SuperHyperDefensive SuperHyperColoring; 925

(iii) : connected SuperHyperDefensive SuperHyperColoring; 926

(iv) : O(ESHG)-SuperHyperDefensive SuperHyperColoring; 927

(v) : strong O(ESHG)-SuperHyperDefensive SuperHyperColoring; 928

(vi) : connected O(ESHG)-SuperHyperDefensive SuperHyperColoring; 929

Where the exterior SuperHyperVertices and the interior SuperHyperVertices coincide. 930

Proposition 6.18. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is a 931

SuperHyperUniform SuperHyperWheel. Then V is a maximal 932

(i) : dual SuperHyperDefensive SuperHyperColoring; 933

(ii) : strong dual SuperHyperDefensive SuperHyperColoring; 934

(iii) : connected dual SuperHyperDefensive SuperHyperColoring; 935

(iv) : O(ESHG)-dual SuperHyperDefensive SuperHyperColoring; 936

(v) : strong O(ESHG)-dual SuperHyperDefensive SuperHyperColoring; 937

(vi) : connected O(ESHG)-dual SuperHyperDefensive SuperHyperColoring; 938

Where the exterior SuperHyperVertices and the interior SuperHyperVertices coincide. 939

Proposition 6.19. Let ESHG : (V, E) be a Neutrosophic SuperHyperUniform 940

SuperHyperGraph which is a SuperHyperColoring/SuperHyperPath. Then the number of 941

(i) : the SuperHyperColoring; 942

(ii) : the SuperHyperColoring; 943

(iii) : the connected SuperHyperColoring; 944

(iv) : the O(ESHG)-SuperHyperColoring; 945

(v) : the strong O(ESHG)-SuperHyperColoring; 946

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

(vi) : the connected O(ESHG)-SuperHyperColoring. 947

is one and it’s only V. Where the exterior SuperHyperVertices and the interior 948

SuperHyperVertices coincide. 949

Proposition 6.20. Let ESHG : (V, E) be a Neutrosophic SuperHyperUniform 950

SuperHyperGraph which is a SuperHyperWheel. Then the number of 951

(i) : the dual SuperHyperColoring; 952

(ii) : the dual SuperHyperColoring; 953

(iii) : the dual connected SuperHyperColoring; 954

(iv) : the dual O(ESHG)-SuperHyperColoring; 955

(v) : the strong dual O(ESHG)-SuperHyperColoring; 956

(vi) : the connected dual O(ESHG)-SuperHyperColoring. 957

is one and it’s only V. Where the exterior SuperHyperVertices and the interior 958

SuperHyperVertices coincide. 959

Proposition 6.21. Let ESHG : (V, E) be a Neutrosophic SuperHyperUniform 960

SuperHyperGraph which is a SuperHyperStar/SuperHyperComplete 961

SuperHyperBipartite/SuperHyperComplete SuperHyperMultipartite. Then a 962

SuperHyperSet contains [the SuperHyperCenter and] the half of multiplying r with the 963

number of all the SuperHyperEdges plus one of all the SuperHyperVertices is a 964

(i) : dual SuperHyperDefensive SuperHyperColoring; 965

(ii) : strong dual SuperHyperDefensive SuperHyperColoring; 966

(iii) : connected dual SuperHyperDefensive SuperHyperColoring; 967

O(ESHG)
(iv) : 2 + 1-dual SuperHyperDefensive SuperHyperColoring; 968

O(ESHG)
(v) : strong 2 + 1-dual SuperHyperDefensive SuperHyperColoring; 969

O(ESHG)
(vi) : connected 2 + 1-dual SuperHyperDefensive SuperHyperColoring. 970

Proposition 6.22. Let ESHG : (V, E) be a Neutrosophic SuperHyperUniform 971

SuperHyperGraph which is a SuperHyperStar/SuperHyperComplete 972

SuperHyperBipartite/SuperHyperComplete SuperHyperMultipartite. Then a 973

SuperHyperSet contains the half of multiplying r with the number of all the 974

SuperHyperEdges plus one of all the SuperHyperVertices in the biggest SuperHyperPart 975

is a 976

(i) : SuperHyperDefensive SuperHyperColoring; 977

(ii) : strong SuperHyperDefensive SuperHyperColoring; 978

(iii) : connected SuperHyperDefensive SuperHyperColoring; 979

(iv) : δ-SuperHyperDefensive SuperHyperColoring; 980

(v) : strong δ-SuperHyperDefensive SuperHyperColoring; 981

(vi) : connected δ-SuperHyperDefensive SuperHyperColoring. 982

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.23. Let ESHG : (V, E) be a Neutrosophic SuperHyperUniform 983

SuperHyperGraph which is a SuperHyperStar/SuperHyperComplete 984

SuperHyperBipartite/SuperHyperComplete SuperHyperMultipartite. Then Then the 985

number of 986

(i) : dual SuperHyperDefensive SuperHyperColoring; 987

(ii) : strong dual SuperHyperDefensive SuperHyperColoring; 988

(iii) : connected dual SuperHyperDefensive SuperHyperColoring; 989

O(ESHG)
(iv) : 2 + 1-dual SuperHyperDefensive SuperHyperColoring; 990

O(ESHG)
(v) : strong 2 + 1-dual SuperHyperDefensive SuperHyperColoring; 991

O(ESHG)
(vi) : connected 2 + 1-dual SuperHyperDefensive SuperHyperColoring. 992

is one and it’s only S, a SuperHyperSet contains [the SuperHyperCenter and] the half of 993

multiplying r with the number of all the SuperHyperEdges plus one of all the 994

SuperHyperVertices. Where the exterior SuperHyperVertices and the interior 995

SuperHyperVertices coincide. 996

Proposition 6.24. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. The 997

number of connected component is |V − S| if there’s a SuperHyperSet which is a dual 998

(i) : SuperHyperDefensive SuperHyperColoring; 999

(ii) : strong SuperHyperDefensive SuperHyperColoring; 1000

(iii) : connected SuperHyperDefensive SuperHyperColoring; 1001

(iv) : SuperHyperColoring; 1002

(v) : strong 1-SuperHyperDefensive SuperHyperColoring; 1003

(vi) : connected 1-SuperHyperDefensive SuperHyperColoring. 1004

Proposition 6.25. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. Then the 1005

number is at most O(ESHG) and the Neutrosophic number is at most On (ESHG). 1006

Proposition 6.26. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is 1007

SuperHyperComplete. The number is O(ESHG:(V,E)) 2 + 1 and the Neutrosophic number is 1008

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

(i) : SuperHyperDefensive SuperHyperColoring; 1010

(ii) : strong SuperHyperDefensive SuperHyperColoring; 1011

(iii) : connected SuperHyperDefensive SuperHyperColoring; 1012

(iv) : ( O(ESHG:(V,E))
2 + 1)-SuperHyperDefensive SuperHyperColoring; 1013

(v) : strong ( O(ESHG:(V,E))


2 + 1)-SuperHyperDefensive SuperHyperColoring; 1014

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


2 + 1)-SuperHyperDefensive SuperHyperColoring. 1015

Proposition 6.27. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is 1016

∅. The number is 0 and the Neutrosophic number is 0, for an independent 1017

SuperHyperSet in the setting of dual 1018

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) : SuperHyperDefensive SuperHyperColoring; 1019

(ii) : strong SuperHyperDefensive SuperHyperColoring; 1020

(iii) : connected SuperHyperDefensive SuperHyperColoring; 1021

(iv) : 0-SuperHyperDefensive SuperHyperColoring; 1022

(v) : strong 0-SuperHyperDefensive SuperHyperColoring; 1023

(vi) : connected 0-SuperHyperDefensive SuperHyperColoring. 1024

Proposition 6.28. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is 1025

SuperHyperComplete. Then there’s no independent SuperHyperSet. 1026

Proposition 6.29. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is 1027

SuperHyperColoring/SuperHyperPath/SuperHyperWheel. The number is 1028

O(ESHG : (V, E)) and the Neutrosophic number is On (ESHG : (V, E)), in the setting 1029

of a dual 1030

(i) : SuperHyperDefensive SuperHyperColoring; 1031

(ii) : strong SuperHyperDefensive SuperHyperColoring; 1032

(iii) : connected SuperHyperDefensive SuperHyperColoring; 1033

(iv) : O(ESHG : (V, E))-SuperHyperDefensive SuperHyperColoring; 1034

(v) : strong O(ESHG : (V, E))-SuperHyperDefensive SuperHyperColoring; 1035

(vi) : connected O(ESHG : (V, E))-SuperHyperDefensive SuperHyperColoring. 1036

Proposition 6.30. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is 1037

SuperHyperStar/complete SuperHyperBipartite/complete SuperHyperMultiPartite. The 1038

number is O(ESHG:(V,E))
2 + 1 and the Neutrosophic number is 1039

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

(i) : SuperHyperDefensive SuperHyperColoring; 1041

(ii) : strong SuperHyperDefensive SuperHyperColoring; 1042

(iii) : connected SuperHyperDefensive SuperHyperColoring; 1043

(iv) : ( O(ESHG:(V,E))
2 + 1)-SuperHyperDefensive SuperHyperColoring; 1044

(v) : strong ( O(ESHG:(V,E))


2 + 1)-SuperHyperDefensive SuperHyperColoring; 1045

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


2 + 1)-SuperHyperDefensive SuperHyperColoring. 1046

Proposition 6.31. Let N SHF : (V, E) be a SuperHyperFamily of the ESHGs : (V, E) 1047

Neutrosophic SuperHyperGraphs which are from one-type SuperHyperClass which the 1048

result is obtained for the individuals. Then the results also hold for the 1049

SuperHyperFamily N SHF : (V, E) of these specific SuperHyperClasses of the 1050

Neutrosophic SuperHyperGraphs. 1051

Proposition 6.32. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph. If 1052

S is a dual SuperHyperDefensive SuperHyperColoring, then ∀v ∈ V \ S, ∃x ∈ S such 1053

that 1054

(i) v ∈ Ns (x); 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

(ii) vx ∈ E. 1056

Proposition 6.33. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph. If 1057

S is a dual SuperHyperDefensive SuperHyperColoring, then 1058

(i) S is SuperHyperColoring set; 1059

(ii) there’s S ⊆ S 0 such that |S 0 | is SuperHyperChromatic number. 1060

Proposition 6.34. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph. 1061

Then 1062

(i) Γ ≤ O; 1063

(ii) Γs ≤ On . 1064

Proposition 6.35. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph 1065

which is connected. Then 1066

(i) Γ ≤ O − 1; 1067

(ii) Γs ≤ On − Σ3i=1 σi (x). 1068

Proposition 6.36. Let ESHG : (V, E) be an odd SuperHyperPath. Then 1069

(i) the SuperHyperSet S = {v2 , v4 , · · · , vn−1 } is a dual SuperHyperDefensive 1070

SuperHyperColoring; 1071

(ii) Γ = b n2 c + 1 and corresponded SuperHyperSet is S = {v2 , v4 , · · · , vn−1 }; 1072

(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· ,vn−1 } Σ3i=1 σi (s)}; 1073

(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn−1 } and S2 = {v1 , v3 , · · · , vn−1 } are only 1074

a dual SuperHyperColoring. 1075

Proposition 6.37. Let ESHG : (V, E) be an even SuperHyperPath. Then 1076

(i) the set S = {v2 , v4 , · · · .vn } is a dual SuperHyperDefensive SuperHyperColoring; 1077

(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · .vn } and 1078

{v1 , v3 , · · · .vn−1 }; 1079

(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 1080

(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn } and S2 = {v1 , v3 , · · · .vn−1 } are only 1081

dual SuperHyperColoring. 1082

Proposition 6.38. Let ESHG : (V, E) be an even SuperHyperColoring. Then 1083

(i) the SuperHyperSet S = {v2 , v4 , · · · , vn } is a dual SuperHyperDefensive 1084

SuperHyperColoring; 1085

(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · , vn } and 1086

{v1 , v3 , · · · , vn−1 }; 1087

(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } σ(s), Σs∈S={v1 ,v3 ,··· ,vn−1 } σ(s)}; 1088

(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn } and S2 = {v1 , v3 , · · · , vn−1 } are only 1089

dual SuperHyperColoring. 1090

Proposition 6.39. Let ESHG : (V, E) be an odd SuperHyperColoring. Then 1091

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) the SuperHyperSet S = {v2 , v4 , · · · , vn−1 } is a dual SuperHyperDefensive 1092

SuperHyperColoring; 1093

(ii) Γ = b n2 c + 1 and corresponded SuperHyperSet is S = {v2 , v4 , · · · , vn−1 }; 1094

(iii) Γs = min{Σs∈S={v2 ,v4 ,··· .vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 1095

(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn−1 } and S2 = {v1 , v3 , · · · .vn−1 } are only 1096

dual SuperHyperColoring. 1097

Proposition 6.40. Let ESHG : (V, E) be SuperHyperStar. Then 1098

(i) the SuperHyperSet S = {c} is a dual maximal SuperHyperColoring; 1099

(ii) Γ = 1; 1100

(iii) Γs = Σ3i=1 σi (c); 1101

(iv) the SuperHyperSets S = {c} and S ⊂ S 0 are only dual SuperHyperColoring. 1102

Proposition 6.41. Let ESHG : (V, E) be SuperHyperWheel. Then 1103

6+3(i−1)≤n
(i) the SuperHyperSet S = {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is a dual 1104

maximal SuperHyperDefensive SuperHyperColoring; 1105

6+3(i−1)≤n
(ii) Γ = |{v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 |; 1106

(iii) Γs = Σ{v1 ,v3 }∪{v6 ,v9 ··· ,vi+6 ,··· ,vn }6+3(i−1)≤n Σ3i=1 σi (s); 1107
i=1

6+3(i−1)≤n
(iv) the SuperHyperSet {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is only a dual 1108

maximal SuperHyperDefensive SuperHyperColoring. 1109

Proposition 6.42. Let ESHG : (V, E) be an odd SuperHyperComplete. Then 1110

b n c+1
(i) the SuperHyperSet S = {vi }i=1
2
is a dual SuperHyperDefensive 1111

SuperHyperColoring; 1112

(ii) Γ = b n2 c + 1; 1113

(iii) Γs = min{Σs∈S Σ3i=1 σi (s)} 2


b n c+1 ; 1114
S={vi }i=1

b n c+1
(iv) the SuperHyperSet S = {vi }i=1
2
is only a dual SuperHyperDefensive 1115

SuperHyperColoring. 1116

Proposition 6.43. Let ESHG : (V, E) be an even SuperHyperComplete. Then 1117

bn
2c
(i) the SuperHyperSet S = {vi }i=1 is a dual SuperHyperDefensive 1118

SuperHyperColoring; 1119

(ii) Γ = b n2 c; 1120

(iii) Γs = min{Σs∈S Σ3i=1 σi (s)} 2


bnc ; 1121
S={vi }i=1

bnc
(iv) the SuperHyperSet S = {vi }i=1
2
is only a dual maximal SuperHyperDefensive 1122

SuperHyperColoring. 1123

Proposition 6.44. Let N SHF : (V, E) be a m-SuperHyperFamily of Neutrosophic 1124

SuperHyperStars with common Neutrosophic SuperHyperVertex SuperHyperSet. Then 1125

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) the SuperHyperSet S = {c1 , c2 , · · · , cm } is a dual SuperHyperDefensive 1126

SuperHyperColoring for N SHF; 1127

(ii) Γ = m for N SHF : (V, E); 1128

(iii) Γs = Σm 3
i=1 Σj=1 σj (ci ) for N SHF : (V, E); 1129

(iv) the SuperHyperSets S = {c1 , c2 , · · · , cm } and S ⊂ S 0 are only dual 1130

SuperHyperColoring for N SHF : (V, E). 1131

Proposition 6.45. Let N SHF : (V, E) be an m-SuperHyperFamily of odd 1132

SuperHyperComplete SuperHyperGraphs with common Neutrosophic SuperHyperVertex 1133

SuperHyperSet. Then 1134

b n c+1
(i) the SuperHyperSet S = {vi }i=1
2
is a dual maximal SuperHyperDefensive 1135

SuperHyperColoring for N SHF; 1136

(ii) Γ = b n2 c + 1 for N SHF : (V, E); 1137

(iii) Γs = min{Σs∈S Σ3i=1 σi (s)} b n c+1


2
for N SHF : (V, E); 1138
S={vi }i=1

b n c+1
(iv) the SuperHyperSets S = {vi }i=1
2
are only a dual maximal SuperHyperColoring 1139

for N SHF : (V, E). 1140

Proposition 6.46. Let N SHF : (V, E) be a m-SuperHyperFamily of even 1141

SuperHyperComplete SuperHyperGraphs with common Neutrosophic SuperHyperVertex 1142

SuperHyperSet. Then 1143

bn
2c
(i) the SuperHyperSet S = {vi }i=1 is a dual SuperHyperDefensive 1144

SuperHyperColoring for N SHF : (V, E); 1145

(ii) Γ = b n2 c for N SHF : (V, E); 1146

(iii) Γs = min{Σs∈S Σ3i=1 σi (s)} 2


bnc for N SHF : (V, E); 1147
S={vi }i=1

bnc
(iv) the SuperHyperSets S = {vi }i=1
2
are only dual maximal SuperHyperColoring for 1148

N SHF : (V, E). 1149

Proposition 6.47. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph. 1150

Then following statements hold; 1151

(i) if s ≥ t and a SuperHyperSet S of SuperHyperVertices is an 1152

t-SuperHyperDefensive SuperHyperColoring, then S is an s-SuperHyperDefensive 1153

SuperHyperColoring; 1154

(ii) if s ≤ t and a SuperHyperSet S of SuperHyperVertices is a dual 1155

t-SuperHyperDefensive SuperHyperColoring, then S is a dual 1156

s-SuperHyperDefensive SuperHyperColoring. 1157

Proposition 6.48. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph. 1158

Then following statements hold; 1159

(i) if s ≥ t + 2 and a SuperHyperSet S of SuperHyperVertices is an 1160

t-SuperHyperDefensive SuperHyperColoring, then S is an s-SuperHyperPowerful 1161

SuperHyperColoring; 1162

(ii) if s ≤ t and a SuperHyperSet S of SuperHyperVertices is a dual 1163

t-SuperHyperDefensive SuperHyperColoring, then S is a dual 1164

s-SuperHyperPowerful SuperHyperColoring. 1165

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.49. Let ESHG : (V, E) be a[an] 1166

[V-]SuperHyperUniform-strong-Neutrosophic SuperHyperGraph. Then following 1167

statements hold; 1168

(i) if ∀a ∈ S, |Ns (a) ∩ S| < b 2r c + 1, then ESHG : (V, E) is an 1169

2-SuperHyperDefensive SuperHyperColoring; 1170

(ii) if ∀a ∈ V \ S, |Ns (a) ∩ S| > b 2r c + 1, then ESHG : (V, E) is a dual 1171

2-SuperHyperDefensive SuperHyperColoring; 1172

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

SuperHyperColoring; 1174

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

V-SuperHyperDefensive SuperHyperColoring. 1176

Proposition 6.50. Let ESHG : (V, E) is a[an] 1177

[V-]SuperHyperUniform-strong-Neutrosophic SuperHyperGraph. Then following 1178

statements hold; 1179

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

SuperHyperColoring; 1181

(ii) ∀a ∈ V \ S, |Ns (a) ∩ S| > b 2r c + 1 if ESHG : (V, E) is a dual 1182

2-SuperHyperDefensive SuperHyperColoring; 1183

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

SuperHyperColoring; 1185

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

V-SuperHyperDefensive SuperHyperColoring. 1187

Proposition 6.51. Let ESHG : (V, E) is a[an] 1188

[V-]SuperHyperUniform-strong-Neutrosophic SuperHyperGraph which is a 1189

SuperHyperComplete. Then following statements hold; 1190

(i) ∀a ∈ S, |Ns (a) ∩ S| < b O−1


2 c + 1 if ESHG : (V, E) is an 2-SuperHyperDefensive 1191

SuperHyperColoring; 1192

(ii) ∀a ∈ V \ S, |Ns (a) ∩ S| > b O−1


2 c + 1 if ESHG : (V, E) is a dual 1193

2-SuperHyperDefensive SuperHyperColoring; 1194

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

SuperHyperColoring; 1196

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

(O − 1)-SuperHyperDefensive SuperHyperColoring. 1198

Proposition 6.52. Let ESHG : (V, E) is a[an] 1199

[V-]SuperHyperUniform-strong-Neutrosophic SuperHyperGraph which is a 1200

SuperHyperComplete. Then following statements hold; 1201

(i) if ∀a ∈ S, |Ns (a) ∩ S| <b O−1


2 c
+ 1, then ESHG : (V, E) is an 1202

2-SuperHyperDefensive SuperHyperColoring; 1203

(ii) if ∀a ∈ V \ S, |Ns (a) ∩ S| > b O−1


2 c + 1, then ESHG : (V, E) is a dual 1204

2-SuperHyperDefensive SuperHyperColoring; 1205

(iii) if ∀a ∈ S, |Ns (a) ∩ V \ S| = 0, then ESHG : (V, E) is 1206

(O − 1)-SuperHyperDefensive SuperHyperColoring; 1207

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) if ∀a ∈ V \ S, |Ns (a) ∩ V \ S| = 0, then ESHG : (V, E) is a dual 1208

(O − 1)-SuperHyperDefensive SuperHyperColoring. 1209

Proposition 6.53. Let ESHG : (V, E) is a[an] 1210

[V-]SuperHyperUniform-strong-Neutrosophic SuperHyperGraph which is 1211

SuperHyperColoring. Then following statements hold; 1212

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

SuperHyperColoring; 1214

(ii) ∀a ∈ V \ S, |Ns (a) ∩ S| > 2 if ESHG : (V, E) is a dual 2-SuperHyperDefensive 1215

SuperHyperColoring; 1216

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

SuperHyperColoring; 1218

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

2-SuperHyperDefensive SuperHyperColoring. 1220

Proposition 6.54. Let ESHG : (V, E) is a[an] 1221

[V-]SuperHyperUniform-strong-Neutrosophic SuperHyperGraph which is 1222

SuperHyperColoring. Then following statements hold; 1223

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

SuperHyperColoring; 1225

(ii) if ∀a ∈ V \ S, |Ns (a) ∩ S| > 2, then ESHG : (V, E) is a dual 1226

2-SuperHyperDefensive SuperHyperColoring; 1227

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

SuperHyperColoring; 1229

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

2-SuperHyperDefensive SuperHyperColoring. 1231

7 Neutrosophic Applications in Cancer’s 1232

Neutrosophic Recognition 1233

The cancer is the Neutrosophic disease but the Neutrosophic model is going to figure 1234

out what’s going on this Neutrosophic phenomenon. The special Neutrosophic case of 1235

this Neutrosophic disease is considered and as the consequences of the model, some 1236

parameters are used. The cells are under attack of this disease but the moves of the 1237

cancer in the special region are the matter of mind. The Neutrosophic recognition of the 1238

cancer could help to find some Neutrosophic treatments for this Neutrosophic disease. 1239

In the following, some Neutrosophic steps are Neutrosophic devised on this disease. 1240

Step 1. (Neutrosophic Definition) The Neutrosophic recognition of the cancer in 1241

the long-term Neutrosophic function. 1242

Step 2. (Neutrosophic Issue) The specific region has been assigned by the 1243

Neutrosophic model [it’s called Neutrosophic SuperHyperGraph] and the long 1244

Neutrosophic cycle of the move from the cancer is identified by this research. 1245

Sometimes the move of the cancer hasn’t be easily identified since there are some 1246

determinacy, indeterminacy and neutrality about the moves and the effects of the 1247

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

Neutrosophic SuperHyperGraph] to have convenient perception on what’s 1249

happened and what’s done. 1250

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 SuperHyperColoring

Step 3. (Neutrosophic Model) There are some specific Neutrosophic models, 1251

which are well-known and they’ve got the names, and some general Neutrosophic 1252

models. The moves and the Neutrosophic traces of the cancer on the complex 1253

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

Neutrosophic SuperHyperPath(-/SuperHyperColoring, SuperHyperStar, 1255

SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to 1256

find either the Neutrosophic SuperHyperColoring or the Neutrosophic 1257

SuperHyperColoring in those Neutrosophic Neutrosophic SuperHyperModels. 1258

8 Case 1: The Initial Neutrosophic Steps 1259

Toward Neutrosophic SuperHyperBipartite as 1260

Neutrosophic SuperHyperModel 1261

Step 4. (Neutrosophic Solution) In the Neutrosophic Figure (29), the 1262

Neutrosophic SuperHyperBipartite is Neutrosophic highlighted and Neutrosophic 1263

featured. 1264

By using the Neutrosophic Figure (29) and the Table (4), the Neutrosophic 1265

SuperHyperBipartite is obtained. 1266

The obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in 1267

previous Neutrosophic result, of the Neutrosophic SuperHyperVertices of the 1268

connected Neutrosophic SuperHyperBipartite ESHB : (V, E), in the 1269

Neutrosophic SuperHyperModel (29), is the Neutrosophic SuperHyperColoring. 1270

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 SuperHyperColoring

9 Case 2: The Increasing Neutrosophic Steps 1271

Toward Neutrosophic SuperHyperMultipartite as 1272

Neutrosophic SuperHyperModel 1273

Step 4. (Neutrosophic Solution) In the Neutrosophic Figure (30), the 1274

Neutrosophic SuperHyperMultipartite is Neutrosophic highlighted and 1275

Neutrosophic featured. 1276

By using the Neutrosophic Figure (30) and the Table (5), the Neutrosophic 1277

SuperHyperMultipartite is obtained. 1278

The obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in 1279

previous result, of the Neutrosophic SuperHyperVertices of the connected 1280

Neutrosophic SuperHyperMultipartite ESHM : (V, E), in the Neutrosophic 1281

SuperHyperModel (30), is the Neutrosophic SuperHyperColoring. 1282

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 1283

Directions To Forming The Motivations 1284

In what follows, some “problems” and some “questions” are proposed. 1285

The SuperHyperColoring and the Neutrosophic SuperHyperColoring are defined on 1286

a real-world application, titled “Cancer’s Recognitions”. 1287

Question 10.1. Which the else SuperHyperModels could be defined based on Cancer’s 1288

recognitions? 1289

Question 10.2. Are there some SuperHyperNotions related to SuperHyperColoring and 1290

the Neutrosophic SuperHyperColoring? 1291

Question 10.3. Are there some Algorithms to be defined on the SuperHyperModels to 1292

compute them? 1293

Question 10.4. Which the SuperHyperNotions are related to beyond the 1294

SuperHyperColoring and the Neutrosophic SuperHyperColoring? 1295

Problem 10.5. The SuperHyperColoring and the Neutrosophic SuperHyperColoring do 1296

a SuperHyperModel for the Cancer’s recognitions and they’re based on 1297

SuperHyperColoring, are there else? 1298

Problem 10.6. Which the fundamental SuperHyperNumbers are related to these 1299

SuperHyperNumbers types-results? 1300

Problem 10.7. What’s the independent research based on Cancer’s recognitions 1301

concerning the multiple types of SuperHyperNotions? 1302

11 Conclusion and Closing Remarks 1303

In this section, concluding remarks and closing remarks are represented. The drawbacks 1304

of this research are illustrated. Some benefits and some advantages of this research are 1305

highlighted. 1306

This research uses some approaches to make Neutrosophic SuperHyperGraphs more 1307

understandable. In this endeavor, two SuperHyperNotions are defined on the 1308

SuperHyperColoring. For that sake in the second definition, the main definition of the 1309

Neutrosophic SuperHyperGraph is redefined on the position of the alphabets. Based on 1310

the new definition for the Neutrosophic SuperHyperGraph, the new SuperHyperNotion, 1311

Neutrosophic SuperHyperColoring, finds the convenient background to implement some 1312

results based on that. Some SuperHyperClasses and some Neutrosophic 1313

SuperHyperClasses are the cases of this research on the modeling of the regions where 1314

are under the attacks of the cancer to recognize this disease as it’s mentioned on the 1315

title “Cancer’s Recognitions”. To formalize the instances on the SuperHyperNotion, 1316

SuperHyperColoring, the new SuperHyperClasses and SuperHyperClasses, are 1317

introduced. Some general results are gathered in the section on the SuperHyperColoring 1318

and the Neutrosophic SuperHyperColoring. The clarifications, instances and literature 1319

reviews have taken the whole way through. In this research, the literature reviews have 1320

fulfilled the lines containing the notions and the results. The SuperHyperGraph and 1321

Neutrosophic SuperHyperGraph are the SuperHyperModels on the “Cancer’s 1322

Recognitions” and both bases are the background of this research. Sometimes the 1323

cancer has been happened on the region, full of cells, groups of cells and embedded 1324

styles. In this segment, the SuperHyperModel proposes some SuperHyperNotions based 1325

on the connectivities of the moves of the cancer in the longest and strongest styles with 1326

the formation of the design and the architecture are formally called “ 1327

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

SuperHyperColoring” in the themes of jargons and buzzwords. The prefix “SuperHyper” 1328

refers to the theme of the embedded styles to figure out the background for the 1329

SuperHyperNotions. In the Table (6), benefits and avenues for this research are, figured

Table 6. An Overlook On This Research And Beyond


Advantages Limitations
1. Redefining Neutrosophic SuperHyperGraph 1. General Results

2. SuperHyperColoring

3. Neutrosophic SuperHyperColoring 2. Other SuperHyperNumbers

4. Modeling of Cancer’s Recognitions

5. SuperHyperClasses 3. SuperHyperFamilies
1330
out, pointed out and spoken out. 1331

12 Neutrosophic SuperHyperDuality But As The 1332

Extensions Excerpt From Dense And Super 1333

Forms 1334

Definition 12.1. (Different Neutrosophic Types of Neutrosophic SuperHyperDuality). 1335

Assume a Neutrosophic SuperHyperGraph (NSHG) S is an ordered pair S = (V, E). 1336

Consider a Neutrosophic SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and 1337

E 0 = {E1 , E2 , . . . , Ez }. Then either V 0 or E 0 is called 1338

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

such that Va ∈ Ei , Ej ; 1340

(ii) Neutrosophic re-SuperHyperDuality if ∀Ei ∈ E 0 , ∃Ej ∈ EESHG:(V,E) \ E 0 1341

such that Va ∈ Ei , Ej and 1342

|Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 1343

(iii) Neutrosophic v-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 1344

such that Vi , Vj ∈ Ea ; 1345

(iv) Neutrosophic rv-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 1346

such that Vi , Vj ∈ Ea and 1347

|Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; 1348

(v) Neutrosophic SuperHyperDuality if it’s either of Neutrosophic 1349

e-SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic 1350

v-SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality. 1351

Definition 12.2. ((Neutrosophic) SuperHyperDuality). 1352

Assume a Neutrosophic SuperHyperGraph (NSHG) S is an ordered pair S = (V, E). 1353

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

called 1355

(i) an Extreme SuperHyperDuality if it’s either of Neutrosophic 1356

e-SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic 1357

v-SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for 1358

an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme 1359

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 1360

Extreme SuperHyperEdges in the consecutive Extreme sequence of Extreme 1361

SuperHyperEdges and Extreme SuperHyperVertices such that they form the 1362

Extreme SuperHyperDuality; 1363

(ii) a Neutrosophic SuperHyperDuality if it’s either of Neutrosophic 1364

e-SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic 1365

v-SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for 1366

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

cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic 1368

SuperHyperSet S of high Neutrosophic cardinality consecutive Neutrosophic 1369

SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the 1370

Neutrosophic SuperHyperDuality; 1371

(iii) an Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of 1372

Neutrosophic e-SuperHyperDuality, Neutrosophic re-SuperHyperDuality, 1373

Neutrosophic v-SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and 1374

C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme 1375

SuperHyperPolynomial contains the Extreme coefficients defined as the Extreme 1376

number of the maximum Extreme cardinality of the Extreme SuperHyperEdges of 1377

an Extreme SuperHyperSet S of high Extreme cardinality consecutive Extreme 1378

SuperHyperEdges and Extreme SuperHyperVertices such that they form the 1379

Extreme SuperHyperDuality; and the Extreme power is corresponded to its 1380

Extreme coefficient; 1381

(iv) a Neutrosophic SuperHyperDuality SuperHyperPolynomial if it’s either 1382

of Neutrosophic e-SuperHyperDuality, Neutrosophic re-SuperHyperDuality, 1383

Neutrosophic v-SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and 1384

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

Neutrosophic SuperHyperPolynomial contains the Neutrosophic coefficients 1386

defined as the Neutrosophic number of the maximum Neutrosophic cardinality of 1387

the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of high 1388

Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and 1389

Neutrosophic SuperHyperVertices such that they form the Neutrosophic 1390

SuperHyperDuality; and the Neutrosophic power is corresponded to its 1391

Neutrosophic coefficient; 1392

(v) an Extreme R-SuperHyperDuality if it’s either of Neutrosophic 1393

e-SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic 1394

v-SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for 1395

an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme 1396

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

Extreme SuperHyperVertices in the consecutive Extreme sequence of Extreme 1398

SuperHyperEdges and Extreme SuperHyperVertices such that they form the 1399

Extreme SuperHyperDuality; 1400

(vi) a Neutrosophic R-SuperHyperDuality if it’s either of Neutrosophic 1401

e-SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic 1402

v-SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for 1403

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

cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic 1405

SuperHyperSet S of high Neutrosophic cardinality consecutive Neutrosophic 1406

SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the 1407

Neutrosophic SuperHyperDuality; 1408

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 1409

of Neutrosophic e-SuperHyperDuality, Neutrosophic re-SuperHyperDuality, 1410

Neutrosophic v-SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and 1411

C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme 1412

SuperHyperPolynomial contains the Extreme coefficients defined as the Extreme 1413

number of the maximum Extreme cardinality of the Extreme SuperHyperVertices 1414

of an Extreme SuperHyperSet S of high Extreme cardinality consecutive Extreme 1415

SuperHyperEdges and Extreme SuperHyperVertices such that they form the 1416

Extreme SuperHyperDuality; and the Extreme power is corresponded to its 1417

Extreme coefficient; 1418

(viii) a Neutrosophic SuperHyperDuality SuperHyperPolynomial if it’s either 1419

of Neutrosophic e-SuperHyperDuality, Neutrosophic re-SuperHyperDuality, 1420

Neutrosophic v-SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and 1421

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

Neutrosophic SuperHyperPolynomial contains the Neutrosophic coefficients 1423

defined as the Neutrosophic number of the maximum Neutrosophic cardinality of 1424

the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S of high 1425

Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and 1426

Neutrosophic SuperHyperVertices such that they form the Neutrosophic 1427

SuperHyperDuality; and the Neutrosophic power is corresponded to its 1428

Neutrosophic coefficient. 1429

Example 12.3. Assume a Neutrosophic SuperHyperGraph (NSHG) S is an ordered 1430

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

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

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly 1433

straightforward. E1 and E3 are some empty Extreme SuperHyperEdges but E2 is 1434

a loop Neutrosophic SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. 1435

Thus in the terms of Neutrosophic SuperHyperNeighbor, there’s only one 1436

Neutrosophic SuperHyperEdge, namely, E4 . The Neutrosophic SuperHyperVertex, 1437

V3 is Neutrosophic isolated means that there’s no Neutrosophic SuperHyperEdge 1438

has it as a Neutrosophic endpoint. Thus the Neutrosophic SuperHyperVertex, V3 , 1439

is excluded in every given Neutrosophic SuperHyperDuality. 1440

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 1441

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly 1442

straightforward. E1 , E2 and E3 are some empty Neutrosophic SuperHyperEdges 1443

but E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of Neutrosophic 1444

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

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

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

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

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

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 1450

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly 1451

straightforward. 1452

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 1453

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly 1454

straightforward. 1455

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 1456

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly 1457

straightforward. 1458

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 1459

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly 1460

straightforward. 1461

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 1462

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly 1463

straightforward. 1464

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 1465

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly 1466

straightforward. 1467

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 1468

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly 1469

straightforward. 1470

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 1471

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly 1472

straightforward. 1473

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 1474

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly 1475

straightforward. 1476

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 1477

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly 1478

straightforward. 1479

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 1480

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly 1481

straightforward. 1482

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 1483

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly 1484

straightforward. 1485

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 1486

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly 1487

straightforward. 1488

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 1489

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly 1490

straightforward. 1491

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 1492

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly 1493

straightforward. 1494

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 1495

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly 1496

straightforward. 1497

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 1498

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly 1499

straightforward. 1500

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 1501

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly 1502

straightforward. 1503

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 1504

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly 1505

straightforward. 1506

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 1507

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly 1508

straightforward. 1509

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 1510

Neutrosophic SuperHyperClasses. 1511

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 1512

ESHP : (V, E). Then 1513

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 1514

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 1515

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

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 1517

corresponded to ViEXT ERN AL in the literatures of SuperHyperDuality. The latter is 1518

straightforward. 1519

Example 12.5. In the Figure (23), the connected Neutrosophic SuperHyperPath 1520

ESHP : (V, E), is highlighted and featured. The Neutrosophic SuperHyperSet, in the 1521

Neutrosophic SuperHyperModel (23), is the SuperHyperDuality. 1522

Proposition 12.6. Assume a connected Neutrosophic SuperHyperCycle 1523

ESHC : (V, E). Then 1524

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 1525

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 1526

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

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 1528

corresponded to ViEXT ERN AL in the literatures of SuperHyperDuality. The latter is 1529

straightforward. 1530

Example 12.7. In the Figure (24), the connected Neutrosophic SuperHyperCycle 1531

N SHC : (V, E), is highlighted and featured. The obtained Neutrosophic 1532

SuperHyperSet, in the Neutrosophic SuperHyperModel (24), is the Neutrosophic 1533

SuperHyperDuality. 1534

Proposition 12.8. Assume a connected Neutrosophic SuperHyperStar ESHS : (V, E). 1535

Then 1536

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 1537

P : ViEXT ERN AL , Ei , CEN T ER, VjEXT ERN AL .

be a longest path taken a connected Neutrosophic SuperHyperStar ESHS : (V, E). 1538

There’s a new way to redefine as 1539

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 1540

corresponded to ViEXT ERN AL in the literatures of SuperHyperDuality. The latter is 1541

straightforward. 1542

Example 12.9. In the Figure (25), the connected Neutrosophic SuperHyperStar 1543

ESHS : (V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, 1544

by the Algorithm in previous Neutrosophic result, of the Neutrosophic 1545

SuperHyperVertices of the connected Neutrosophic SuperHyperStar ESHS : (V, E), in 1546

the Neutrosophic SuperHyperModel (25), is the Neutrosophic SuperHyperDuality. 1547

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 1548

ESHB : (V, E). Then 1549

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 1550

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 1551

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

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 1553

corresponded to ViEXT ERN AL in the literatures of SuperHyperDuality. The latter is 1554

straightforward. Then there’s at least one SuperHyperDuality. Thus the notion of quasi 1555

isn’t up and the SuperHyperNotions based on SuperHyperDuality could be applied. 1556

There are only two SuperHyperParts. Thus every SuperHyperPart could have one 1557

SuperHyperVertex as the representative in the 1558

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 1559

SuperHyperBipartite ESHB : (V, E). Thus only some SuperHyperVertices and only 1560

minimum-Neutrosophic-of-SuperHyperPart SuperHyperEdges are attained in any 1561

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 1562

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

Example 12.11. In the Neutrosophic Figure (26), the connected Neutrosophic 1564

SuperHyperBipartite ESHB : (V, E), is Neutrosophic highlighted and Neutrosophic 1565

featured. The obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in 1566

previous Neutrosophic result, of the Neutrosophic SuperHyperVertices of the connected 1567

Neutrosophic SuperHyperBipartite ESHB : (V, E), in the Neutrosophic 1568

SuperHyperModel (26), is the Neutrosophic SuperHyperDuality. 1569

Proposition 12.12. Assume a connected Neutrosophic SuperHyperMultipartite 1570

ESHM : (V, E). Then 1571

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 1572

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 1573

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

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 1575

corresponded to ViEXT ERN AL in the literatures of SuperHyperDuality. The latter is 1576

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 1577

isn’t up and the SuperHyperNotions based on SuperHyperDuality could be applied. 1578

There are only z 0 SuperHyperParts. Thus every SuperHyperPart could have one 1579

SuperHyperVertex as the representative in the 1580

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 1581

ESHM : (V, E). Thus only some SuperHyperVertices and only 1582

minimum-Neutrosophic-of-SuperHyperPart SuperHyperEdges are attained in any 1583

solution 1584

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 1585

ESHM : (V, E). The latter is straightforward. 1586

Example 12.13. In the Figure (27), the connected Neutrosophic 1587

SuperHyperMultipartite ESHM : (V, E), is highlighted and Neutrosophic featured. 1588

The obtained Neutrosophic SuperHyperSet, by the Algorithm in previous Neutrosophic 1589

result, of the Neutrosophic SuperHyperVertices of the connected Neutrosophic 1590

SuperHyperMultipartite ESHM : (V, E), in the Neutrosophic SuperHyperModel (27), 1591

is the Neutrosophic SuperHyperDuality. 1592

Proposition 12.14. Assume a connected Neutrosophic SuperHyperWheel 1593

ESHW : (V, E). Then, 1594

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 1595

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 1596

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

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 1598

corresponded to ViEXT ERN AL in the literatures of SuperHyperDuality. The latter is 1599

straightforward. Then there’s at least one SuperHyperDuality. Thus the notion of quasi 1600

isn’t up and the SuperHyperNotions based on SuperHyperDuality could be applied. 1601

The unique embedded SuperHyperDuality proposes some longest SuperHyperDuality 1602

excerpt from some representatives. The latter is straightforward. 1603

Example 12.15. In the Neutrosophic Figure (28), the connected Neutrosophic 1604

SuperHyperWheel N SHW : (V, E), is Neutrosophic highlighted and featured. The 1605

obtained Neutrosophic SuperHyperSet, by the Algorithm in previous result, of the 1606

Neutrosophic SuperHyperVertices of the connected Neutrosophic SuperHyperWheel 1607

ESHW : (V, E), in the Neutrosophic SuperHyperModel (28), is the Neutrosophic 1608

SuperHyperDuality. 1609

13 Neutrosophic SuperHyperJoin But As The 1610

Extensions Excerpt From Dense And Super 1611

Forms 1612

Definition 13.1. (Different Neutrosophic Types of Neutrosophic SuperHyperJoin). 1613

Assume a Neutrosophic SuperHyperGraph (NSHG) S is an ordered pair S = (V, E). 1614

Consider a Neutrosophic SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and 1615

E 0 = {E1 , E2 , . . . , Ez }. Then either V 0 or E 0 is called 1616

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

that Va ∈ Ei , Ej ; and ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; 1618

(ii) Neutrosophic re-SuperHyperJoin if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , 1619

such that Va ∈ Ei , Ej ; ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; and 1620

|Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 1621

(iii) Neutrosophic v-SuperHyperJoin if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such 1622

that Vi , Vj 6∈ Ea ; and ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; 1623

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

that Vi , Vj ∈ Ea ; ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; and 1625

|Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; 1626

(v) Neutrosophic SuperHyperJoin if it’s either of Neutrosophic 1627

e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic 1628

v-SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin. 1629

Definition 13.2. ((Neutrosophic) SuperHyperJoin). 1630

Assume a Neutrosophic SuperHyperGraph (NSHG) S is an ordered pair S = (V, E). 1631

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

called 1633

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, 1634

Neutrosophic re-SuperHyperJoin, Neutrosophic v-SuperHyperJoin, and 1635

Neutrosophic rv-SuperHyperJoin and C(N SHG) for an Extreme 1636

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

Extreme SuperHyperSet S of high Extreme cardinality of the Extreme 1638

SuperHyperEdges in the consecutive Extreme sequence of Extreme 1639

SuperHyperEdges and Extreme SuperHyperVertices such that they form the 1640

Extreme SuperHyperJoin; 1641

(ii) a Neutrosophic SuperHyperJoin if it’s either of Neutrosophic 1642

e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic 1643

v-SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for a 1644

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

cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic 1646

SuperHyperSet S of high Neutrosophic cardinality consecutive Neutrosophic 1647

SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the 1648

Neutrosophic SuperHyperJoin; 1649

(iii) an Extreme SuperHyperJoin SuperHyperPolynomial if it’s either of 1650

Neutrosophic e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic 1651

v-SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for an 1652

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

SuperHyperPolynomial contains the Extreme coefficients defined as the Extreme 1654

number of the maximum Extreme cardinality of the Extreme SuperHyperEdges of 1655

an Extreme SuperHyperSet S of high Extreme cardinality consecutive Extreme 1656

SuperHyperEdges and Extreme SuperHyperVertices such that they form the 1657

Extreme SuperHyperJoin; and the Extreme power is corresponded to its Extreme 1658

coefficient; 1659

(iv) a Neutrosophic SuperHyperJoin SuperHyperPolynomial if it’s either of 1660

Neutrosophic e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic 1661

v-SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for a 1662

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

SuperHyperPolynomial contains the Neutrosophic coefficients defined as the 1664

Neutrosophic number of the maximum Neutrosophic cardinality of the 1665

Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of high 1666

Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and 1667

Neutrosophic SuperHyperVertices such that they form the Neutrosophic 1668

SuperHyperJoin; and the Neutrosophic power is corresponded to its Neutrosophic 1669

coefficient; 1670

(v) an Extreme R-SuperHyperJoin if it’s either of Neutrosophic 1671

e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic 1672

v-SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for an 1673

Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme cardinality 1674

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

SuperHyperVertices in the consecutive Extreme sequence of Extreme 1676

SuperHyperEdges and Extreme SuperHyperVertices such that they form the 1677

Extreme SuperHyperJoin; 1678

(vi) a Neutrosophic R-SuperHyperJoin if it’s either of Neutrosophic 1679

e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic 1680

v-SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for a 1681

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

cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic 1683

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 consecutive Neutrosophic 1684

SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the 1685

Neutrosophic SuperHyperJoin; 1686

(vii) an Extreme R-SuperHyperJoin SuperHyperPolynomial if it’s either of 1687

Neutrosophic e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic 1688

v-SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for an 1689

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

SuperHyperPolynomial contains the Extreme coefficients defined as the Extreme 1691

number of the maximum Extreme cardinality of the Extreme SuperHyperVertices 1692

of an Extreme SuperHyperSet S of high Extreme cardinality consecutive Extreme 1693

SuperHyperEdges and Extreme SuperHyperVertices such that they form the 1694

Extreme SuperHyperJoin; and the Extreme power is corresponded to its Extreme 1695

coefficient; 1696

(viii) a Neutrosophic SuperHyperJoin SuperHyperPolynomial if it’s either of 1697

Neutrosophic e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic 1698

v-SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for a 1699

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

SuperHyperPolynomial contains the Neutrosophic coefficients defined as the 1701

Neutrosophic number of the maximum Neutrosophic cardinality of the 1702

Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S of high 1703

Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and 1704

Neutrosophic SuperHyperVertices such that they form the Neutrosophic 1705

SuperHyperJoin; and the Neutrosophic power is corresponded to its Neutrosophic 1706

coefficient. 1707

Example 13.3. Assume a Neutrosophic SuperHyperGraph (NSHG) S is an ordered 1708

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

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

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly 1711

straightforward. E1 and E3 are some empty Neutrosophic SuperHyperEdges but 1712

E2 is a loop Neutrosophic SuperHyperEdge and E4 is a Neutrosophic 1713

SuperHyperEdge. Thus in the terms of Neutrosophic SuperHyperNeighbor, 1714

there’s only one Neutrosophic SuperHyperEdge, namely, E4 . The Neutrosophic 1715

SuperHyperVertex, V3 is Neutrosophic isolated means that there’s no 1716

Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. Thus the 1717

Neutrosophic SuperHyperVertex, V3 , is excluded in every given Neutrosophic 1718

SuperHyperJoin. 1719

C(N SHG)Neutrosophic SuperHyperJoin = {E4 }.


C(N SHG)Neutrosophic SuperHyperJoin SuperHyperPolynomial = z.
C(N SHG)Neutrosophic R-SuperHyperJoin = {V4 }.
C(N SHG)Neutrosophic R-SuperHyperJoin SuperHyperPolynomial = 3z.

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

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly 1721

straightforward. E1 , E2 and E3 are some empty Neutrosophic SuperHyperEdges 1722

but E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of Neutrosophic 1723

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

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

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

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 1727

SuperHyperJoin. 1728

C(N SHG)Neutrosophic SuperHyperJoin = {E4 }.


C(N SHG)Neutrosophic SuperHyperJoin SuperHyperPolynomial = z.
C(N SHG)Neutrosophic R-SuperHyperJoin = {V4 }.
C(N SHG)Neutrosophic R-SuperHyperJoin SuperHyperPolynomial = 3z.

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

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly 1730

straightforward. 1731

C(N SHG)Neutrosophic SuperHyperJoin = {E4 }.


C(N SHG)Neutrosophic SuperHyperJoin SuperHyperPolynomial = z.
C(N SHG)Neutrosophic R-SuperHyperJoin = {V4 }.
C(N SHG)Neutrosophic R-SuperHyperJoin SuperHyperPolynomial = 3z.

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

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly 1733

straightforward. 1734

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 1735

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly 1736

straightforward. 1737

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 1738

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly 1739

straightforward. 1740

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 1741

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly 1742

straightforward. 1743

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 1744

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly 1745

straightforward. 1746

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 1747

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly 1748

straightforward. 1749

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 1750

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly 1751

straightforward. 1752

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 1753

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly 1754

straightforward. 1755

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 1756

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly 1757

straightforward. 1758

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 1759

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly 1760

straightforward. 1761

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 1762

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly 1763

straightforward. 1764

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 1765

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly 1766

straightforward. 1767

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 1768

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly 1769

straightforward. 1770

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 1771

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly 1772

straightforward. 1773

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 1774

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly 1775

straightforward. 1776

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 1777

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly 1778

straightforward. 1779

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 1780

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly 1781

straightforward. 1782

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 1783

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly 1784

straightforward. 1785

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 1786

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly 1787

straightforward. 1788

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 1789

Neutrosophic SuperHyperClasses. 1790

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 1791

ESHP : (V, E). Then 1792

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 1793

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 1794

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

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 1796

corresponded to ViEXT ERN AL in the literatures of SuperHyperJoin. The latter is 1797

straightforward. 1798

Example 13.5. In the Figure (23), the connected Neutrosophic SuperHyperPath 1799

ESHP : (V, E), is highlighted and featured. The Neutrosophic SuperHyperSet, in the 1800

Neutrosophic SuperHyperModel (23), is the SuperHyperJoin. 1801

Proposition 13.6. Assume a connected Neutrosophic SuperHyperCycle 1802

ESHC : (V, E). Then 1803

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 1804

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 1805

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

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 1807

corresponded to ViEXT ERN AL in the literatures of SuperHyperJoin. The latter is 1808

straightforward. 1809

Example 13.7. In the Figure (24), the connected Neutrosophic SuperHyperCycle 1810

N SHC : (V, E), is highlighted and featured. The obtained Neutrosophic 1811

SuperHyperSet, in the Neutrosophic SuperHyperModel (24), is the Neutrosophic 1812

SuperHyperJoin. 1813

Proposition 13.8. Assume a connected Neutrosophic SuperHyperStar ESHS : (V, E). 1814

Then 1815

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 1816

P : ViEXT ERN AL , Ei , CEN T ER, VjEXT ERN AL .

be a longest path taken a connected Neutrosophic SuperHyperStar ESHS : (V, E). 1817

There’s a new way to redefine as 1818

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 1819

corresponded to ViEXT ERN AL in the literatures of SuperHyperJoin. The latter is 1820

straightforward. 1821

Example 13.9. In the Figure (25), the connected Neutrosophic SuperHyperStar 1822

ESHS : (V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, 1823

by the Algorithm in previous Neutrosophic result, of the Neutrosophic 1824

SuperHyperVertices of the connected Neutrosophic SuperHyperStar ESHS : (V, E), in 1825

the Neutrosophic SuperHyperModel (25), is the Neutrosophic SuperHyperJoin. 1826

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 1827

ESHB : (V, E). Then 1828

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 1829

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 1830

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

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 1832

corresponded to ViEXT ERN AL in the literatures of SuperHyperJoin. The latter is 1833

straightforward. Then there’s no at least one SuperHyperJoin. Thus the notion of quasi 1834

may be up but the SuperHyperNotions based on SuperHyperJoin could be applied. 1835

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 1836

SuperHyperVertex as the representative in the 1837

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 1838

ESHB : (V, E). Thus only some SuperHyperVertices and only 1839

minimum-Neutrosophic-of-SuperHyperPart SuperHyperEdges are attained in any 1840

solution 1841

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

Example 13.11. In the Neutrosophic Figure (26), the connected Neutrosophic 1843

SuperHyperBipartite ESHB : (V, E), is Neutrosophic highlighted and Neutrosophic 1844

featured. The obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in 1845

previous Neutrosophic result, of the Neutrosophic SuperHyperVertices of the connected 1846

Neutrosophic SuperHyperBipartite ESHB : (V, E), in the Neutrosophic 1847

SuperHyperModel (26), is the Neutrosophic SuperHyperJoin. 1848

Proposition 13.12. Assume a connected Neutrosophic SuperHyperMultipartite 1849

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 1850

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 1851

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 1852

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

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 1854

corresponded to ViEXT ERN AL in the literatures of SuperHyperJoin. The latter is 1855

straightforward. Then there’s no at least one SuperHyperJoin. Thus the notion of quasi 1856

may be up but the SuperHyperNotions based on SuperHyperJoin could be applied. 1857

There are only z 0 SuperHyperParts. Thus every SuperHyperPart could have one 1858

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 1859

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 1860

ESHM : (V, E). Thus only some SuperHyperVertices and only 1861

minimum-Neutrosophic-of-SuperHyperPart SuperHyperEdges are attained in any 1862

solution 1863

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 1864

ESHM : (V, E). The latter is straightforward. 1865

Example 13.13. In the Figure (27), the connected Neutrosophic 1866

SuperHyperMultipartite ESHM : (V, E), is highlighted and Neutrosophic featured. 1867

The obtained Neutrosophic SuperHyperSet, by the Algorithm in previous Neutrosophic 1868

result, of the Neutrosophic SuperHyperVertices of the connected Neutrosophic 1869

SuperHyperMultipartite ESHM : (V, E), in the Neutrosophic SuperHyperModel (27), 1870

is the Neutrosophic SuperHyperJoin. 1871

Proposition 13.14. Assume a connected Neutrosophic SuperHyperWheel 1872

ESHW : (V, E). Then, 1873

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 1874

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 1875

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

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 1877

corresponded to ViEXT ERN AL in the literatures of SuperHyperJoin. The latter is 1878

straightforward. Then there’s at least one SuperHyperJoin. Thus the notion of quasi 1879

isn’t up and the SuperHyperNotions based on SuperHyperJoin could be applied. The 1880

unique embedded SuperHyperJoin proposes some longest SuperHyperJoin excerpt from 1881

some representatives. The latter is straightforward. 1882

Example 13.15. In the Neutrosophic Figure (28), the connected Neutrosophic 1883

SuperHyperWheel N SHW : (V, E), is Neutrosophic highlighted and featured. The 1884

obtained Neutrosophic SuperHyperSet, by the Algorithm in previous result, of the 1885

Neutrosophic SuperHyperVertices of the connected Neutrosophic SuperHyperWheel 1886

ESHW : (V, E), in the Neutrosophic SuperHyperModel (28), is the Neutrosophic 1887

SuperHyperJoin. 1888

14 Neutrosophic SuperHyperPerfect But As The 1889

Extensions Excerpt From Dense And Super 1890

Forms 1891

Definition 14.1. (Different Neutrosophic Types of Neutrosophic SuperHyperPerfect). 1892

Assume a Neutrosophic SuperHyperGraph (NSHG) S is an ordered pair S = (V, E). 1893

Consider a Neutrosophic SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and 1894

E 0 = {E1 , E2 , . . . , Ez }. Then either V 0 or E 0 is called 1895

(i) Neutrosophic e-SuperHyperPerfect if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃!Ej ∈ E 0 , 1896

such that Va ∈ Ei , Ej ; 1897

(ii) Neutrosophic re-SuperHyperPerfect if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃!Ej ∈ E 0 , 1898

such that Va ∈ Ei , Ej ; and 1899

|Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 1900

(iii) Neutrosophic v-SuperHyperPerfect if ∀Vi ∈ VESHG:(V,E) \ V 0 , ∃!Vj ∈ V 0 , 1901

such that Vi , Vj ∈ Ea ; 1902

(iv) Neutrosophic rv-SuperHyperPerfect if ∀Vi ∈ VESHG:(V,E) \ V 0 , ∃!Vj ∈ V 0 , 1903

such that Vi , Vj ∈ Ea ; and 1904

|Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; 1905

(v) Neutrosophic SuperHyperPerfect if it’s either of Neutrosophic 1906

e-SuperHyperPerfect, Neutrosophic re-SuperHyperPerfect, Neutrosophic 1907

v-SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect. 1908

Definition 14.2. ((Neutrosophic) SuperHyperPerfect). 1909

Assume a Neutrosophic SuperHyperGraph (NSHG) S is an ordered pair S = (V, E). 1910

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

called 1912

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 1913

e-SuperHyperPerfect, Neutrosophic re-SuperHyperPerfect, Neutrosophic 1914

v-SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for 1915

an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme 1916

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

Extreme SuperHyperEdges in the consecutive Extreme sequence of Extreme 1918

SuperHyperEdges and Extreme SuperHyperVertices such that they form the 1919

Extreme SuperHyperPerfect; 1920

(ii) a Neutrosophic SuperHyperPerfect if it’s either of Neutrosophic 1921

e-SuperHyperPerfect, Neutrosophic re-SuperHyperPerfect, Neutrosophic 1922

v-SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for 1923

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

cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic 1925

SuperHyperSet S of high Neutrosophic cardinality consecutive Neutrosophic 1926

SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the 1927

Neutrosophic SuperHyperPerfect; 1928

(iii) an Extreme SuperHyperPerfect SuperHyperPolynomial if it’s either of 1929

Neutrosophic e-SuperHyperPerfect, Neutrosophic re-SuperHyperPerfect, 1930

Neutrosophic v-SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and 1931

C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme 1932

SuperHyperPolynomial contains the Extreme coefficients defined as the Extreme 1933

number of the maximum Extreme cardinality of the Extreme SuperHyperEdges of 1934

an Extreme SuperHyperSet S of high Extreme cardinality consecutive Extreme 1935

SuperHyperEdges and Extreme SuperHyperVertices such that they form the 1936

Extreme SuperHyperPerfect; and the Extreme power is corresponded to its 1937

Extreme coefficient; 1938

(iv) a Neutrosophic SuperHyperPerfect SuperHyperPolynomial if it’s either 1939

of Neutrosophic e-SuperHyperPerfect, Neutrosophic re-SuperHyperPerfect, 1940

Neutrosophic v-SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and 1941

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

Neutrosophic SuperHyperPolynomial contains the Neutrosophic coefficients 1943

defined as the Neutrosophic number of the maximum Neutrosophic cardinality of 1944

the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of high 1945

Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and 1946

Neutrosophic SuperHyperVertices such that they form the Neutrosophic 1947

SuperHyperPerfect; and the Neutrosophic power is corresponded to its 1948

Neutrosophic coefficient; 1949

(v) an Extreme R-SuperHyperPerfect if it’s either of Neutrosophic 1950

e-SuperHyperPerfect, Neutrosophic re-SuperHyperPerfect, Neutrosophic 1951

v-SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for 1952

an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme 1953

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

Extreme SuperHyperVertices in the consecutive Extreme sequence of Extreme 1955

SuperHyperEdges and Extreme SuperHyperVertices such that they form the 1956

Extreme SuperHyperPerfect; 1957

(vi) a Neutrosophic R-SuperHyperPerfect if it’s either of Neutrosophic 1958

e-SuperHyperPerfect, Neutrosophic re-SuperHyperPerfect, Neutrosophic 1959

v-SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for 1960

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

cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic 1962

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 consecutive Neutrosophic 1963

SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the 1964

Neutrosophic SuperHyperPerfect; 1965

(vii) an Extreme R-SuperHyperPerfect SuperHyperPolynomial if it’s either 1966

of Neutrosophic e-SuperHyperPerfect, Neutrosophic re-SuperHyperPerfect, 1967

Neutrosophic v-SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and 1968

C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme 1969

SuperHyperPolynomial contains the Extreme coefficients defined as the Extreme 1970

number of the maximum Extreme cardinality of the Extreme SuperHyperVertices 1971

of an Extreme SuperHyperSet S of high Extreme cardinality consecutive Extreme 1972

SuperHyperEdges and Extreme SuperHyperVertices such that they form the 1973

Extreme SuperHyperPerfect; and the Extreme power is corresponded to its 1974

Extreme coefficient; 1975

(viii) a Neutrosophic SuperHyperPerfect SuperHyperPolynomial if it’s either 1976

of Neutrosophic e-SuperHyperPerfect, Neutrosophic re-SuperHyperPerfect, 1977

Neutrosophic v-SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and 1978

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

Neutrosophic SuperHyperPolynomial contains the Neutrosophic coefficients 1980

defined as the Neutrosophic number of the maximum Neutrosophic cardinality of 1981

the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S of high 1982

Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and 1983

Neutrosophic SuperHyperVertices such that they form the Neutrosophic 1984

SuperHyperPerfect; and the Neutrosophic power is corresponded to its 1985

Neutrosophic coefficient. 1986

Example 14.3. Assume a Neutrosophic SuperHyperGraph (NSHG) S is an ordered 1987

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

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

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly 1990

straightforward. E1 and E3 are some empty Neutrosophic SuperHyperEdges but 1991

E2 is a loop Neutrosophic SuperHyperEdge and E4 is a Neutrosophic 1992

SuperHyperEdge. Thus in the terms of Neutrosophic SuperHyperNeighbor, 1993

there’s only one Neutrosophic SuperHyperEdge, namely, E4 . The Neutrosophic 1994

SuperHyperVertex, V3 is Neutrosophic isolated means that there’s no 1995

Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. Thus the 1996

Neutrosophic SuperHyperVertex, V3 , is excluded in every given Neutrosophic 1997

SuperHyperPerfect. 1998

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 1999

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly 2000

straightforward. E1 , E2 and E3 are some empty Neutrosophic SuperHyperEdges 2001

but E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of Neutrosophic 2002

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

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

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

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 2006

SuperHyperPerfect. 2007

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 2008

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly 2009

straightforward. 2010

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 2011

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly 2012

straightforward. 2013

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 2014

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly 2015

straightforward. 2016

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 2017

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly 2018

straightforward. 2019

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 2020

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly 2021

straightforward. 2022

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 2023

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly 2024

straightforward. 2025

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 2026

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly 2027

straightforward. 2028

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 2029

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly 2030

straightforward. 2031

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 2032

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly 2033

straightforward. 2034

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 2035

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly 2036

straightforward. 2037

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 2038

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly 2039

straightforward. 2040

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 2041

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly 2042

straightforward. 2043

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 2044

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly 2045

straightforward. 2046

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 2047

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly 2048

straightforward. 2049

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 2050

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly 2051

straightforward. 2052

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 2053

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly 2054

straightforward. 2055

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 2056

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly 2057

straightforward. 2058

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 2059

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly 2060

straightforward. 2061

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 2062

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly 2063

straightforward. 2064

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 2065

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly 2066

straightforward. 2067

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 2068

Neutrosophic SuperHyperClasses. 2069

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 2070

ESHP : (V, E). Then 2071

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 2072

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 2073

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

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 2075

corresponded to ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is 2076

straightforward. 2077

Example 14.5. In the Figure (23), the connected Neutrosophic SuperHyperPath 2078

ESHP : (V, E), is highlighted and featured. The Neutrosophic SuperHyperSet, in the 2079

Neutrosophic SuperHyperModel (23), is the SuperHyperPerfect. 2080

Proposition 14.6. Assume a connected Neutrosophic SuperHyperCycle 2081

ESHC : (V, E). Then 2082

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 2083

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 2084

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

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 2086

corresponded to ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is 2087

straightforward. 2088

Example 14.7. In the Figure (24), the connected Neutrosophic SuperHyperCycle 2089

N SHC : (V, E), is highlighted and featured. The obtained Neutrosophic 2090

SuperHyperSet, in the Neutrosophic SuperHyperModel (24), is the Neutrosophic 2091

SuperHyperPerfect. 2092

Proposition 14.8. Assume a connected Neutrosophic SuperHyperStar ESHS : (V, E). 2093

Then 2094

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 2095

P : ViEXT ERN AL , Ei , CEN T ER, VjEXT ERN AL .

be a longest path taken a connected Neutrosophic SuperHyperStar ESHS : (V, E). 2096

There’s a new way to redefine as 2097

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 2098

corresponded to ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is 2099

straightforward. 2100

Example 14.9. In the Figure (25), the connected Neutrosophic SuperHyperStar 2101

ESHS : (V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, 2102

by the Algorithm in previous Neutrosophic result, of the Neutrosophic 2103

SuperHyperVertices of the connected Neutrosophic SuperHyperStar ESHS : (V, E), in 2104

the Neutrosophic SuperHyperModel (25), is the Neutrosophic SuperHyperPerfect. 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

Proposition 14.10. Assume a connected Neutrosophic SuperHyperBipartite 2106

ESHB : (V, E). Then 2107

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 2108

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 2109

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

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 2111

corresponded to ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is 2112

straightforward. Then there’s no at least one SuperHyperPerfect. Thus the notion of 2113

quasi may be up but the SuperHyperNotions based on SuperHyperPerfect could be 2114

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 2115

one SuperHyperVertex as the representative in the 2116

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 2117

SuperHyperBipartite ESHB : (V, E). Thus only some SuperHyperVertices and only 2118

minimum-Neutrosophic-of-SuperHyperPart SuperHyperEdges are attained in any 2119

solution 2120

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

Example 14.11. In the Neutrosophic Figure (26), the connected Neutrosophic 2122

SuperHyperBipartite ESHB : (V, E), is Neutrosophic highlighted and Neutrosophic 2123

featured. The obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in 2124

previous Neutrosophic result, of the Neutrosophic SuperHyperVertices of the connected 2125

Neutrosophic SuperHyperBipartite ESHB : (V, E), in the Neutrosophic 2126

SuperHyperModel (26), is the Neutrosophic SuperHyperPerfect. 2127

Proposition 14.12. Assume a connected Neutrosophic SuperHyperMultipartite 2128

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 2129

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 2130

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 2131

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

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 2133

corresponded to ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is 2134

straightforward. Then there’s no at least one SuperHyperPerfect. Thus the notion of 2135

quasi may be up but the SuperHyperNotions based on SuperHyperPerfect could be 2136

applied. There are only z 0 SuperHyperParts. Thus every SuperHyperPart could have 2137

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 2138

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 2139

ESHM : (V, E). Thus only some SuperHyperVertices and only 2140

minimum-Neutrosophic-of-SuperHyperPart SuperHyperEdges are attained in any 2141

solution 2142

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 2143

ESHM : (V, E). The latter is straightforward. 2144

Example 14.13. In the Figure (27), the connected Neutrosophic 2145

SuperHyperMultipartite ESHM : (V, E), is highlighted and Neutrosophic featured. 2146

The obtained Neutrosophic SuperHyperSet, by the Algorithm in previous Neutrosophic 2147

result, of the Neutrosophic SuperHyperVertices of the connected Neutrosophic 2148

SuperHyperMultipartite ESHM : (V, E), in the Neutrosophic SuperHyperModel (27), 2149

is the Neutrosophic SuperHyperPerfect. 2150

Proposition 14.14. Assume a connected Neutrosophic SuperHyperWheel 2151

ESHW : (V, E). Then, 2152

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 2153

P : ViEXT ERN AL , Ei , CEN T ER, VjEXT ERN AL .


is a longest SuperHyperPerfect taken from a connected Neutrosophic SuperHyperWheel 2154

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

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 2156

corresponded to ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is 2157

straightforward. Then there’s at least one SuperHyperPerfect. Thus the notion of quasi 2158

isn’t up and the SuperHyperNotions based on SuperHyperPerfect could be applied. The 2159

unique embedded SuperHyperPerfect proposes some longest SuperHyperPerfect excerpt 2160

from some representatives. The latter is straightforward. 2161

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 2162

SuperHyperWheel N SHW : (V, E), is Neutrosophic highlighted and featured. The 2163

obtained Neutrosophic SuperHyperSet, by the Algorithm in previous result, of the 2164

Neutrosophic SuperHyperVertices of the connected Neutrosophic SuperHyperWheel 2165

ESHW : (V, E), in the Neutrosophic SuperHyperModel (28), is the Neutrosophic 2166

SuperHyperPerfect. 2167

15 Neutrosophic SuperHyperTotal But As The 2168

Extensions Excerpt From Dense And Super 2169

Forms 2170

Definition 15.1. (Different Neutrosophic Types of Neutrosophic SuperHyperTotal). 2171

Assume a Neutrosophic SuperHyperGraph (NSHG) S is an ordered pair S = (V, E). 2172

Consider a Neutrosophic SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and 2173

E 0 = {E1 , E2 , . . . , Ez }. Then either V 0 or E 0 is called 2174

(i) Neutrosophic e-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such 2175

that Va ∈ Ei , Ej ; 2176

(ii) Neutrosophic re-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such 2177

that Va ∈ Ei , Ej ; and 2178

|Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 2179

(iii) Neutrosophic v-SuperHyperTotal if ∀Vi ∈ VESHG:(V,E) , ∃!Vj ∈ V 0 , such 2180

that Vi , Vj ∈ Ea ; 2181

(iv) Neutrosophic rv-SuperHyperTotal if ∀Vi ∈ VESHG:(V,E) , ∃!Vj ∈ V 0 , such 2182

that Vi , Vj ∈ Ea ; and 2183

|Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; 2184

(v) Neutrosophic SuperHyperTotal if it’s either of Neutrosophic 2185

e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic 2186

v-SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal. 2187

Definition 15.2. ((Neutrosophic) SuperHyperTotal). 2188

Assume a Neutrosophic SuperHyperGraph (NSHG) S is an ordered pair S = (V, E). 2189

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

called 2191

(i) an Extreme SuperHyperTotal if it’s either of Neutrosophic 2192

e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic 2193

v-SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for an 2194

Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme cardinality 2195

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

SuperHyperEdges in the consecutive Extreme sequence of Extreme 2197

SuperHyperEdges and Extreme SuperHyperVertices such that they form the 2198

Extreme SuperHyperTotal; 2199

(ii) a Neutrosophic SuperHyperTotal if it’s either of Neutrosophic 2200

e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic 2201

v-SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for a 2202

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

cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic 2204

SuperHyperSet S of high Neutrosophic cardinality consecutive Neutrosophic 2205

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

SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the 2206

Neutrosophic SuperHyperTotal; 2207

(iii) an Extreme SuperHyperTotal SuperHyperPolynomial if it’s either of 2208

Neutrosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic 2209

v-SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for an 2210

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

SuperHyperPolynomial contains the Extreme coefficients defined as the Extreme 2212

number of the maximum Extreme cardinality of the Extreme SuperHyperEdges of 2213

an Extreme SuperHyperSet S of high Extreme cardinality consecutive Extreme 2214

SuperHyperEdges and Extreme SuperHyperVertices such that they form the 2215

Extreme SuperHyperTotal; and the Extreme power is corresponded to its Extreme 2216

coefficient; 2217

(iv) a Neutrosophic SuperHyperTotal SuperHyperPolynomial if it’s either of 2218

Neutrosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic 2219

v-SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for a 2220

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

SuperHyperPolynomial contains the Neutrosophic coefficients defined as the 2222

Neutrosophic number of the maximum Neutrosophic cardinality of the 2223

Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of high 2224

Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and 2225

Neutrosophic SuperHyperVertices such that they form the Neutrosophic 2226

SuperHyperTotal; and the Neutrosophic power is corresponded to its 2227

Neutrosophic coefficient; 2228

(v) an Extreme R-SuperHyperTotal if it’s either of Neutrosophic 2229

e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic 2230

v-SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for an 2231

Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme cardinality 2232

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

SuperHyperVertices in the consecutive Extreme sequence of Extreme 2234

SuperHyperEdges and Extreme SuperHyperVertices such that they form the 2235

Extreme SuperHyperTotal; 2236

(vi) a Neutrosophic R-SuperHyperTotal if it’s either of Neutrosophic 2237

e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic 2238

v-SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for a 2239

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

cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic 2241

SuperHyperSet S of high Neutrosophic cardinality consecutive Neutrosophic 2242

SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the 2243

Neutrosophic SuperHyperTotal; 2244

(vii) an Extreme R-SuperHyperTotal SuperHyperPolynomial if it’s either of 2245

Neutrosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic 2246

v-SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for an 2247

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

SuperHyperPolynomial contains the Extreme coefficients defined as the Extreme 2249

number of the maximum Extreme cardinality of the Extreme SuperHyperVertices 2250

of an Extreme SuperHyperSet S of high Extreme cardinality consecutive Extreme 2251

SuperHyperEdges and Extreme SuperHyperVertices such that they form the 2252

Extreme SuperHyperTotal; and the Extreme power is corresponded to its Extreme 2253

coefficient; 2254

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

(viii) a Neutrosophic SuperHyperTotal SuperHyperPolynomial if it’s either of 2255

Neutrosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic 2256

v-SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for a 2257

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

SuperHyperPolynomial contains the Neutrosophic coefficients defined as the 2259

Neutrosophic number of the maximum Neutrosophic cardinality of the 2260

Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S of high 2261

Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and 2262

Neutrosophic SuperHyperVertices such that they form the Neutrosophic 2263

SuperHyperTotal; and the Neutrosophic power is corresponded to its 2264

Neutrosophic coefficient. 2265

Example 15.3. Assume a Neutrosophic SuperHyperGraph (NSHG) S is an ordered 2266

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

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

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly 2269

straightforward. E1 and E3 are some empty Neutrosophic SuperHyperEdges but 2270

E2 is a loop Neutrosophic SuperHyperEdge and E4 is a Neutrosophic 2271

SuperHyperEdge. Thus in the terms of Neutrosophic SuperHyperNeighbor, 2272

there’s only one Neutrosophic SuperHyperEdge, namely, E4 . The Neutrosophic 2273

SuperHyperVertex, V3 is Neutrosophic isolated means that there’s no 2274

Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. Thus the 2275

Neutrosophic SuperHyperVertex, V3 , is excluded in every given Neutrosophic 2276

SuperHyperTotal. 2277

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 2278

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly 2279

straightforward. E1 , E2 and E3 are some empty Neutrosophic SuperHyperEdges 2280

but E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of Neutrosophic 2281

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

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

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

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

SuperHyperTotal. 2286

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 2287

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly 2288

straightforward. 2289

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 2290

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly 2291

straightforward. 2292

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 2293

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly 2294

straightforward. 2295

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 2296

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly 2297

straightforward. 2298

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 2299

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly 2300

straightforward. 2301

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 2302

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly 2303

straightforward. 2304

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 2305

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly 2306

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

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 2308

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly 2309

straightforward. 2310

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 2311

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly 2312

straightforward. 2313

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 2314

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly 2315

straightforward. 2316

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 2317

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly 2318

straightforward. 2319

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 2320

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly 2321

straightforward. 2322

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 2323

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly 2324

straightforward. 2325

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 2326

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly 2327

straightforward. 2328

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 2329

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly 2330

straightforward. 2331

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 2332

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly 2333

straightforward. 2334

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 2335

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly 2336

straightforward. 2337

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 2338

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly 2339

straightforward. 2340

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 2341

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly 2342

straightforward. 2343

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 2344

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly 2345

straightforward. 2346

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 2347

Neutrosophic SuperHyperClasses. 2348

Proposition 15.4. Assume a connected Neutrosophic SuperHyperPath 2349

ESHP : (V, E). Then 2350

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 2351

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 2352

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

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 2354

corresponded to ViEXT ERN AL in the literatures of SuperHyperTotal. The latter is 2355

straightforward. 2356

Example 15.5. In the Figure (23), the connected Neutrosophic SuperHyperPath 2357

ESHP : (V, E), is highlighted and featured. The Neutrosophic SuperHyperSet, in the 2358

Neutrosophic SuperHyperModel (23), is the SuperHyperTotal. 2359

Proposition 15.6. Assume a connected Neutrosophic SuperHyperCycle 2360

ESHC : (V, E). Then 2361

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 2362

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 2363

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

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 2365

corresponded to ViEXT ERN AL in the literatures of SuperHyperTotal. The latter is 2366

straightforward. 2367

Example 15.7. In the Figure (24), the connected Neutrosophic SuperHyperCycle 2368

N SHC : (V, E), is highlighted and featured. The obtained Neutrosophic 2369

SuperHyperSet, in the Neutrosophic SuperHyperModel (24), is the Neutrosophic 2370

SuperHyperTotal. 2371

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

Then 2373

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 2374

P : ViEXT ERN AL , Ei , CEN T ER, Ej .

be a longest path taken a connected Neutrosophic SuperHyperStar ESHS : (V, E). 2375

There’s a new way to redefine as 2376

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 2377

corresponded to ViEXT ERN AL in the literatures of SuperHyperTotal. The latter is 2378

straightforward. 2379

Example 15.9. In the Figure (25), the connected Neutrosophic SuperHyperStar 2380

ESHS : (V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, 2381

by the Algorithm in previous Neutrosophic result, of the Neutrosophic 2382

SuperHyperVertices of the connected Neutrosophic SuperHyperStar ESHS : (V, E), in 2383

the Neutrosophic SuperHyperModel (25), is the Neutrosophic SuperHyperTotal. 2384

Proposition 15.10. Assume a connected Neutrosophic SuperHyperBipartite 2385

ESHB : (V, E). Then 2386

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 2387

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

is a longest path taken from a connected Neutrosophic SuperHyperBipartite 2388

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

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 2390

corresponded to ViEXT ERN AL in the literatures of SuperHyperTotal. The latter is 2391

straightforward. Then there’s no at least one SuperHyperTotal. Thus the notion of 2392

quasi may be up but the SuperHyperNotions based on SuperHyperTotal could be 2393

applied. There are only two SuperHyperParts. Thus every SuperHyperPart could have 2394

one SuperHyperVertex as the representative in the 2395

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

is a longest SuperHyperTotal taken from a connected Neutrosophic 2396

SuperHyperBipartite ESHB : (V, E). Thus only some SuperHyperVertices and only 2397

minimum-Neutrosophic-of-SuperHyperPart SuperHyperEdges are attained in any 2398

solution 2399

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

The latter is straightforward. 2400

Example 15.11. In the Neutrosophic Figure (26), the connected Neutrosophic 2401

SuperHyperBipartite ESHB : (V, E), is Neutrosophic highlighted and Neutrosophic 2402

featured. The obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in 2403

previous Neutrosophic result, of the Neutrosophic SuperHyperVertices of the connected 2404

Neutrosophic SuperHyperBipartite ESHB : (V, E), in the Neutrosophic 2405

SuperHyperModel (26), is the Neutrosophic SuperHyperTotal. 2406

Proposition 15.12. Assume a connected Neutrosophic SuperHyperMultipartite 2407

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 2408

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 2409

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperTotal taken from a connected Neutrosophic 2410

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

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 2412

corresponded to ViEXT ERN AL in the literatures of SuperHyperTotal. The latter is 2413

straightforward. Then there’s no at least one SuperHyperTotal. Thus the notion of 2414

quasi may be up but the SuperHyperNotions based on SuperHyperTotal could be 2415

applied. There are only z 0 SuperHyperParts. Thus every SuperHyperPart could have 2416

one SuperHyperVertex as the representative in the 2417

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest path taken from a connected Neutrosophic SuperHyperMultipartite 2418

ESHM : (V, E). Thus only some SuperHyperVertices and only 2419

minimum-Neutrosophic-of-SuperHyperPart SuperHyperEdges are attained in any 2420

solution 2421

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest path taken from a connected Neutrosophic SuperHyperMultipartite 2422

ESHM : (V, E). The latter is straightforward. 2423

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 2424

SuperHyperMultipartite ESHM : (V, E), is highlighted and Neutrosophic featured. 2425

The obtained Neutrosophic SuperHyperSet, by the Algorithm in previous Neutrosophic 2426

result, of the Neutrosophic SuperHyperVertices of the connected Neutrosophic 2427

SuperHyperMultipartite ESHM : (V, E), in the Neutrosophic SuperHyperModel (27), 2428

is the Neutrosophic SuperHyperTotal. 2429

Proposition 15.14. Assume a connected Neutrosophic SuperHyperWheel 2430

ESHW : (V, E). Then, 2431


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 2432

P : ViEXT ERN AL , Ei∗ , CEN T ER, Ej .


is a longest SuperHyperTotal taken from a connected Neutrosophic SuperHyperWheel 2433

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

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 2435

corresponded to ViEXT ERN AL in the literatures of SuperHyperTotal. The latter is 2436

straightforward. Then there’s at least one SuperHyperTotal. Thus the notion of quasi 2437

isn’t up and the SuperHyperNotions based on SuperHyperTotal could be applied. The 2438

unique embedded SuperHyperTotal proposes some longest SuperHyperTotal excerpt 2439

from some representatives. The latter is straightforward. 2440

Example 15.15. In the Neutrosophic Figure (28), the connected Neutrosophic 2441

SuperHyperWheel N SHW : (V, E), is Neutrosophic highlighted and featured. The 2442

obtained Neutrosophic SuperHyperSet, by the Algorithm in previous result, of the 2443

Neutrosophic SuperHyperVertices of the connected Neutrosophic SuperHyperWheel 2444

ESHW : (V, E), in the Neutrosophic SuperHyperModel (28), is the Neutrosophic 2445

SuperHyperTotal. 2446

16 Neutrosophic SuperHyperConnected But As 2447

The Extensions Excerpt From Dense And Super 2448

Forms 2449

Definition 16.1. (Different Neutrosophic Types of Neutrosophic 2450

SuperHyperConnected). 2451

Assume a Neutrosophic SuperHyperGraph (NSHG) S is an ordered pair S = (V, E). 2452

Consider a Neutrosophic SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and 2453

E 0 = {E1 , E2 , . . . , Ez }. Then either V 0 or E 0 is called 2454

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 2455

∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such that Va ∈ Ei , Ej ; and ∀Ei , Ej ∈ E 0 , such 2456

that Va 6∈ Ei , Ej ; 2457

(ii) Neutrosophic re-SuperHyperConnected if 2458

∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such that Va ∈ Ei , Ej ; ∀Ei , Ej ∈ E 0 , such 2459

that Va 6∈ Ei , Ej ; and 2460

|Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 2461

(iii) Neutrosophic v-SuperHyperConnected if 2462

∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; and ∀Vi , Vj ∈ V 0 , such 2463

that Vi , Vj 6∈ Ea ; 2464

(iv) Neutrosophic rv-SuperHyperConnected if 2465

∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such that Vi , Vj ∈ Ea ; ∀Vi , Vj ∈ V 0 , such that 2466

Vi , Vj 6∈ Ea ; and 2467

|Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; 2468

(v) Neutrosophic SuperHyperConnected if it’s either of Neutrosophic 2469

e-SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neutrosophic 2470

v-SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected. 2471

Definition 16.2. ((Neutrosophic) SuperHyperConnected). 2472

Assume a Neutrosophic SuperHyperGraph (NSHG) S is an ordered pair S = (V, E). 2473

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

called 2475

(i) an Extreme SuperHyperConnected if it’s either of Neutrosophic 2476

e-SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neutrosophic 2477

v-SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and 2478

C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum 2479

Extreme cardinality of an Extreme SuperHyperSet S of high Extreme cardinality 2480

of the Extreme SuperHyperEdges in the consecutive Extreme sequence of Extreme 2481

SuperHyperEdges and Extreme SuperHyperVertices such that they form the 2482

Extreme SuperHyperConnected; 2483

(ii) a Neutrosophic SuperHyperConnected if it’s either of Neutrosophic 2484

e-SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neutrosophic 2485

v-SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and 2486

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

Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic 2488

SuperHyperSet S of high Neutrosophic cardinality consecutive Neutrosophic 2489

SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the 2490

Neutrosophic SuperHyperConnected; 2491

(iii) an Extreme SuperHyperConnected SuperHyperPolynomial if it’s either 2492

of Neutrosophic e-SuperHyperConnected, Neutrosophic re-SuperHyperConnected, 2493

Neutrosophic v-SuperHyperConnected, and Neutrosophic 2494

rv-SuperHyperConnected and C(N SHG) for an Extreme SuperHyperGraph 2495

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

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

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

Extreme cardinality consecutive Extreme SuperHyperEdges and Extreme 2499

SuperHyperVertices such that they form the Extreme SuperHyperConnected; and 2500

the Extreme power is corresponded to its Extreme coefficient; 2501

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 2502

either of Neutrosophic e-SuperHyperConnected, Neutrosophic 2503

re-SuperHyperConnected, Neutrosophic v-SuperHyperConnected, and 2504

Neutrosophic rv-SuperHyperConnected and C(N SHG) for a Neutrosophic 2505

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

contains the Neutrosophic coefficients defined as the Neutrosophic number of the 2507

maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a 2508

Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive 2509

Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that 2510

they form the Neutrosophic SuperHyperConnected; and the Neutrosophic power is 2511

corresponded to its Neutrosophic coefficient; 2512

(v) an Extreme R-SuperHyperConnected if it’s either of Neutrosophic 2513

e-SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neutrosophic 2514

v-SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and 2515

C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum 2516

Extreme cardinality of an Extreme SuperHyperSet S of high Extreme cardinality 2517

of the Extreme SuperHyperVertices in the consecutive Extreme sequence of 2518

Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form 2519

the Extreme SuperHyperConnected; 2520

(vi) a Neutrosophic R-SuperHyperConnected if it’s either of Neutrosophic 2521

e-SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neutrosophic 2522

v-SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and 2523

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

Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a 2525

Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive 2526

Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that 2527

they form the Neutrosophic SuperHyperConnected; 2528

(vii) an Extreme R-SuperHyperConnected SuperHyperPolynomial if it’s 2529

either of Neutrosophic e-SuperHyperConnected, Neutrosophic 2530

re-SuperHyperConnected, Neutrosophic v-SuperHyperConnected, and 2531

Neutrosophic rv-SuperHyperConnected and C(N SHG) for an Extreme 2532

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

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

Extreme cardinality of the Extreme SuperHyperVertices of an Extreme 2535

SuperHyperSet S of high Extreme cardinality consecutive Extreme 2536

SuperHyperEdges and Extreme SuperHyperVertices such that they form the 2537

Extreme SuperHyperConnected; and the Extreme power is corresponded to its 2538

Extreme coefficient; 2539

(viii) a Neutrosophic SuperHyperConnected SuperHyperPolynomial if it’s 2540

either of Neutrosophic e-SuperHyperConnected, Neutrosophic 2541

re-SuperHyperConnected, Neutrosophic v-SuperHyperConnected, and 2542

Neutrosophic rv-SuperHyperConnected and C(N SHG) for a Neutrosophic 2543

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

contains the Neutrosophic coefficients defined as the Neutrosophic number of the 2545

maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a 2546

Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive 2547

Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that 2548

they form the Neutrosophic SuperHyperConnected; and the Neutrosophic power is 2549

corresponded to its Neutrosophic coefficient. 2550

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 an ordered 2551

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

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

SuperHyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly 2554

straightforward. E1 and E3 are some empty Neutrosophic SuperHyperEdges but 2555

E2 is a loop Neutrosophic SuperHyperEdge and E4 is a Neutrosophic 2556

SuperHyperEdge. Thus in the terms of Neutrosophic SuperHyperNeighbor, 2557

there’s only one Neutrosophic SuperHyperEdge, namely, E4 . The Neutrosophic 2558

SuperHyperVertex, V3 is Neutrosophic isolated means that there’s no 2559

Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. Thus the 2560

Neutrosophic SuperHyperVertex, V3 , is excluded in every given Neutrosophic 2561

SuperHyperConnected. 2562

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 2563

SuperHyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly 2564

straightforward. E1 , E2 and E3 are some empty Neutrosophic SuperHyperEdges 2565

but E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of Neutrosophic 2566

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

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

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

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

SuperHyperConnected. 2571

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 2572

SuperHyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly 2573

straightforward. 2574

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 2575

SuperHyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly 2576

straightforward. 2577

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 2578

SuperHyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly 2579

straightforward. 2580

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 2581

SuperHyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly 2582

straightforward. 2583

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 2584

SuperHyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly 2585

straightforward. 2586

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 2587

SuperHyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly 2588

straightforward. 2589

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 2590

SuperHyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly 2591

straightforward. 2592

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 2593

SuperHyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly 2594

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

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 2596

SuperHyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly 2597

straightforward. 2598

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 2599

SuperHyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly 2600

straightforward. 2601

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 2602

SuperHyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly 2603

straightforward. 2604

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 2605

SuperHyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly 2606

straightforward. 2607

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 2608

SuperHyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly 2609

straightforward. 2610

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 2611

SuperHyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly 2612

straightforward. 2613

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 2614

SuperHyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly 2615

straightforward. 2616

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 2617

SuperHyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly 2618

straightforward. 2619

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 2620

SuperHyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly 2621

straightforward. 2622

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 2623

SuperHyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly 2624

straightforward. 2625

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 2626

SuperHyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly 2627

straightforward. 2628

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 2629

SuperHyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly 2630

straightforward. 2631

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 2632

Neutrosophic SuperHyperClasses. 2633

Proposition 16.4. Assume a connected Neutrosophic SuperHyperPath 2634

ESHP : (V, E). Then 2635

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 2636

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 2637

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

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 2639

corresponded to ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is 2640

straightforward. 2641

Example 16.5. In the Figure (23), the connected Neutrosophic SuperHyperPath 2642

ESHP : (V, E), is highlighted and featured. The Neutrosophic SuperHyperSet, in the 2643

Neutrosophic SuperHyperModel (23), is the SuperHyperConnected. 2644

Proposition 16.6. Assume a connected Neutrosophic SuperHyperCycle 2645

ESHC : (V, E). Then 2646

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 2647

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 2648

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

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 2650

corresponded to ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is 2651

straightforward. 2652

Example 16.7. In the Figure (24), the connected Neutrosophic SuperHyperCycle 2653

N SHC : (V, E), is highlighted and featured. The obtained Neutrosophic 2654

SuperHyperSet, in the Neutrosophic SuperHyperModel (24), is the Neutrosophic 2655

SuperHyperConnected. 2656

Proposition 16.8. Assume a connected Neutrosophic SuperHyperStar ESHS : (V, E). 2657

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 2658

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 2659

P : ViEXT ERN AL , Ei , CEN T ER, Ej .

be a longest path taken a connected Neutrosophic SuperHyperStar ESHS : (V, E). 2660

There’s a new way to redefine as 2661

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 2662

corresponded to ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is 2663

straightforward. 2664

Example 16.9. In the Figure (25), the connected Neutrosophic SuperHyperStar 2665

ESHS : (V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, 2666

by the Algorithm in previous Neutrosophic result, of the Neutrosophic 2667

SuperHyperVertices of the connected Neutrosophic SuperHyperStar ESHS : (V, E), in 2668

the Neutrosophic SuperHyperModel (25), is the Neutrosophic SuperHyperConnected. 2669

Proposition 16.10. Assume a connected Neutrosophic SuperHyperBipartite 2670

ESHB : (V, E). Then 2671

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 2672

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 2673

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

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 2675

corresponded to ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is 2676

straightforward. Then there’s no at least one SuperHyperConnected. Thus the notion of 2677

quasi may be up but the SuperHyperNotions based on SuperHyperConnected could be 2678

applied. There are only two SuperHyperParts. Thus every SuperHyperPart could have 2679

one SuperHyperVertex as the representative in the 2680

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperConnected taken from a connected Neutrosophic 2681

SuperHyperBipartite ESHB : (V, E). Thus only some SuperHyperVertices and only 2682

minimum-Neutrosophic-of-SuperHyperPart SuperHyperEdges are attained in any 2683

solution 2684

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
The latter is straightforward. 2685

Example 16.11. In the Neutrosophic Figure (26), the connected Neutrosophic 2686

SuperHyperBipartite ESHB : (V, E), is Neutrosophic highlighted and Neutrosophic 2687

featured. The obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in 2688

previous Neutrosophic result, of the Neutrosophic SuperHyperVertices of the connected 2689

Neutrosophic SuperHyperBipartite ESHB : (V, E), in the Neutrosophic 2690

SuperHyperModel (26), is the Neutrosophic SuperHyperConnected. 2691

Proposition 16.12. Assume a connected Neutrosophic SuperHyperMultipartite 2692

ESHM : (V, E). Then 2693

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 2694

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

is a longest SuperHyperConnected taken from a connected Neutrosophic 2695

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

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 2697

corresponded to ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is 2698

straightforward. Then there’s no at least one SuperHyperConnected. Thus the notion of 2699

quasi may be up but the SuperHyperNotions based on SuperHyperConnected could be 2700

applied. There are only z 0 SuperHyperParts. Thus every SuperHyperPart could have 2701

one SuperHyperVertex as the representative in the 2702

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

is a longest path taken from a connected Neutrosophic SuperHyperMultipartite 2703

ESHM : (V, E). Thus only some SuperHyperVertices and only 2704

minimum-Neutrosophic-of-SuperHyperPart SuperHyperEdges are attained in any 2705

solution 2706

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

is a longest path taken from a connected Neutrosophic SuperHyperMultipartite 2707

ESHM : (V, E). The latter is straightforward. 2708

Example 16.13. In the Figure (27), the connected Neutrosophic 2709

SuperHyperMultipartite ESHM : (V, E), is highlighted and Neutrosophic featured. 2710

The obtained Neutrosophic SuperHyperSet, by the Algorithm in previous Neutrosophic 2711

result, of the Neutrosophic SuperHyperVertices of the connected Neutrosophic 2712

SuperHyperMultipartite ESHM : (V, E), in the Neutrosophic SuperHyperModel (27), 2713

is the Neutrosophic SuperHyperConnected. 2714

Proposition 16.14. Assume a connected Neutrosophic SuperHyperWheel 2715

ESHW : (V, E). Then, 2716


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 2717

P : V EXT ERN AL i , E ∗ i , CEN T ER, Ej .

is a longest SuperHyperConnected taken from a connected Neutrosophic 2718

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

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 2720

corresponded to ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is 2721

straightforward. Then there’s at least one SuperHyperConnected. Thus the notion of 2722

quasi isn’t up and the SuperHyperNotions based on SuperHyperConnected could be 2723

applied. The unique embedded SuperHyperConnected proposes some longest 2724

SuperHyperConnected excerpt from some representatives. The latter is 2725

straightforward. 2726

Example 16.15. In the Neutrosophic Figure (28), the connected Neutrosophic 2727

SuperHyperWheel N SHW : (V, E), is Neutrosophic highlighted and featured. The 2728

obtained Neutrosophic SuperHyperSet, by the Algorithm in previous result, of the 2729

Neutrosophic SuperHyperVertices of the connected Neutrosophic SuperHyperWheel 2730

ESHW : (V, E), in the Neutrosophic SuperHyperModel (28), is the Neutrosophic 2731

SuperHyperConnected. 2732

17 Background 2733

There are some scientific researches covering the topic of this research. In what follows, 2734

there are some discussion and literature reviews about them date back on February 19, 2735

2023. 2736

First article is titled “properties of SuperHyperGraph and neutrosophic 2737

SuperHyperGraph” in Ref. [1] by Henry Garrett (2022). It’s first step toward the 2738

research on neutrosophic SuperHyperGraphs. This research article is published on the 2739

journal “Neutrosophic Sets and Systems” in issue 49 and the pages 531-561. In this 2740

research article, different types of notions like dominating, resolving, coloring, 2741

Eulerian(Hamiltonian) neutrosophic path, n-Eulerian(Hamiltonian) neutrosophic path, 2742

zero forcing number, zero forcing neutrosophic- number, independent number, 2743

independent neutrosophic-number, clique number, clique neutrosophic-number, 2744

matching number, matching neutrosophic-number, girth, neutrosophic girth, 2745

1-zero-forcing number, 1-zero- forcing neutrosophic-number, failed 1-zero-forcing 2746

number, failed 1-zero-forcing neutrosophic-number, global- offensive alliance, t-offensive 2747

alliance, t-defensive alliance, t-powerful alliance, and global-powerful alliance are defined 2748

in SuperHyperGraph and neutrosophic SuperHyperGraph. Some Classes of 2749

SuperHyperGraph and Neutrosophic SuperHyperGraph are cases of research. Some 2750

results are applied in family of SuperHyperGraph and neutrosophic SuperHyperGraph. 2751

Thus this research article has concentrated on the vast notions and introducing the 2752

majority of notions. 2753

The seminal paper and groundbreaking article is titled “neutrosophic co-degree and 2754

neutrosophic degree alongside chromatic numbers in the setting of some classes related 2755

to neutrosophic hypergraphs” in Ref. [2] by Henry Garrett (2022). In this research 2756

article, a novel approach is implemented on SuperHyperGraph and neutrosophic 2757

SuperHyperGraph based on general forms without using neutrosophic classes of 2758

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. It’s published in prestigious and fancy journal is 2759

entitled “Journal of Current Trends in Computer Science Research (JCTCSR)” with 2760

ISO abbreviation “J Curr Trends Comp Sci Res” in volume 1 and issue 1 with pages 2761

06-14. The research article studies deeply with choosing neutrosophic hypergraphs 2762

instead of neutrosophic SuperHyperGraph. It’s the breakthrough toward independent 2763

results based on initial background. 2764

The seminal paper and groundbreaking article is titled “Super Hyper Dominating 2765

and Super Hyper Resolving on Neutrosophic Super Hyper Graphs and Their Directions 2766

in Game Theory and Neutrosophic Super Hyper Classes” in Ref. [3] by Henry Garrett 2767

(2022). In this research article, a novel approach is implemented on SuperHyperGraph 2768

and neutrosophic SuperHyperGraph based on fundamental SuperHyperNumber and 2769

using neutrosophic SuperHyperClasses of neutrosophic SuperHyperGraph. It’s 2770

published in prestigious and fancy journal is entitled “Journal of Mathematical 2771

Techniques and Computational Mathematics(JMTCM)” with ISO abbreviation “J Math 2772

Techniques Comput Math” in volume 1 and issue 3 with pages 242-263. The research 2773

article studies deeply with choosing directly neutrosophic SuperHyperGraph and 2774

SuperHyperGraph. It’s the breakthrough toward independent results based on initial 2775

background and fundamental SuperHyperNumbers. 2776

The seminal paper and groundbreaking article is titled “Some Super Hyper Degrees 2777

and Co-Super Hyper Degrees on Neutrosophic Super Hyper Graphs And Super Hyper 2778

Graphs Alongside Applications in Cancer’s Treatments” in Ref. [52] by Henry Garrett 2779

(2023). In this research article, a novel approach is implemented on SuperHyperGraph 2780

and neutrosophic SuperHyperGraph based on fundamental notions and using vital tools 2781

in Cancer’s Treatments. It’s published in prestigious and fancy journal is entitled 2782

“Journal of Mathematical Techniques and Computational Mathematics(JMTCM)” with 2783

ISO abbreviation “J Math Techniques Comput Math” in volume 2 and issue 1 with 2784

pages 35-47. The research article studies deeply with choosing directly neutrosophic 2785

SuperHyperGraph and SuperHyperGraph. It’s the breakthrough toward independent 2786

results based on initial background and fundamental SuperHyperNumbers. 2787

In some articles are titled “0039 — Closing Numbers and Super-Closing Numbers as 2788

(Dual)Resolving and (Dual)Coloring alongside (Dual)Dominating in 2789

(Neutrosophic)n-SuperHyperGraph” in Ref. [5] by Henry Garrett (2022), “0049 — 2790

(Failed)1-Zero-Forcing Number in Neutrosophic Graphs” in Ref. [6] by Henry Garrett 2791

(2022), “Extreme SuperHyperClique as the Firm Scheme of Confrontation under 2792

Cancer’s Recognition as the Model in The Setting of (Neutrosophic) SuperHyperGraphs” 2793

in Ref. [7] by Henry Garrett (2022), “Uncertainty On The Act And Effect Of Cancer 2794

Alongside The Foggy Positions Of Cells Toward Neutrosophic Failed SuperHyperClique 2795

inside Neutrosophic SuperHyperGraphs Titled Cancer’s Recognition” in Ref. [8] by 2796

Henry Garrett (2022), “Neutrosophic Version Of Separates Groups Of Cells In Cancer’s 2797

Recognition On Neutrosophic SuperHyperGraphs” in Ref. [9] by Henry Garrett (2022), 2798

“The Shift Paradigm To Classify Separately The Cells and Affected Cells Toward The 2799

Totality Under Cancer’s Recognition By New Multiple Definitions On the Sets 2800

Polynomials Alongside Numbers In The (Neutrosophic) SuperHyperMatching Theory 2801

Based on SuperHyperGraph and Neutrosophic SuperHyperGraph” in Ref. [10] by 2802

Henry Garrett (2022), “Breaking the Continuity and Uniformity of Cancer In The 2803

Worst Case of Full Connections With Extreme Failed SuperHyperClique In Cancer’s 2804

Recognition Applied in (Neutrosophic) SuperHyperGraphs” in Ref. [11] by Henry 2805

Garrett (2022), “Neutrosophic Failed SuperHyperStable as the Survivors on the 2806

Cancer’s Neutrosophic Recognition Based on Uncertainty to All Modes in Neutrosophic 2807

SuperHyperGraphs” in Ref. [12] by Henry Garrett (2022), “Extremism of the Attacked 2808

Body Under the Cancer’s Circumstances Where Cancer’s Recognition Titled 2809

(Neutrosophic) SuperHyperGraphs” in Ref. [13] by Henry Garrett (2022), 2810

“(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Recognitions And 2811

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) SuperHyperGraphs” in Ref. [14] by Henry Garrett (2022), 2812

“Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic SuperHyperStable 2813

To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints” in Ref. [15] by 2814

Henry Garrett (2022), “Neutrosophic 1-Failed SuperHyperForcing in the 2815

SuperHyperFunction To Use Neutrosophic SuperHyperGraphs on Cancer’s 2816

Neutrosophic Recognition And Beyond” in Ref. [16] by Henry Garrett (2022), 2817

“(Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well- 2818

SuperHyperModelled (Neutrosophic) SuperHyperGraphs ” in Ref. [17] by Henry 2819

Garrett (2022), “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic 2820

SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints” 2821

in Ref. [13] by Henry Garrett (2022), “Basic Notions on (Neutrosophic) 2822

SuperHyperForcing And (Neutrosophic) SuperHyperModeling in Cancer’s Recognitions 2823

And (Neutrosophic) SuperHyperGraphs” in Ref. [18] by Henry Garrett (2022), 2824

“Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic SuperHyperStable 2825

To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints” in Ref. [19] by 2826

Henry Garrett (2022),“(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions 2827

Featuring (Neutrosophic) SuperHyperDefensive SuperHyperAlliances” in Ref. [20] by 2828

Henry Garrett (2022), “(Neutrosophic) SuperHyperAlliances With 2829

SuperHyperDefensive and SuperHyperOffensive Type-SuperHyperSet On 2830

(Neutrosophic) SuperHyperGraph With (Neutrosophic) SuperHyperModeling of 2831

Cancer’s Recognitions And Related (Neutrosophic) SuperHyperClasses” in Ref. [21] by 2832

Henry Garrett (2022), “SuperHyperGirth on SuperHyperGraph and Neutrosophic 2833

SuperHyperGraph With SuperHyperModeling of Cancer’s Recognitions” in Ref. [22] by 2834

Henry Garrett (2022), “Some SuperHyperDegrees and Co-SuperHyperDegrees on 2835

Neutrosophic SuperHyperGraphs and SuperHyperGraphs Alongside Applications in 2836

Cancer’s Treatments” in Ref. [23] by Henry Garrett (2022), “SuperHyperDominating 2837

and SuperHyperResolving on Neutrosophic SuperHyperGraphs And Their Directions in 2838

Game Theory and Neutrosophic SuperHyperClasses” in Ref. [24] by Henry Garrett 2839

(2022), “SuperHyperMatching By (R-)Definitions And Polynomials To Monitor 2840

Cancer’s Recognition In Neutrosophic SuperHyperGraphs” in Ref. [66] by Henry 2841

Garrett (2023), “The Focus on The Partitions Obtained By Parallel Moves In The 2842

Cancer’s Extreme Recognition With Different Types of Extreme SuperHyperMatching 2843

Set and Polynomial on (Neutrosophic) SuperHyperGraphs” in Ref. [67] by Henry 2844

Garrett (2023), “Extreme Failed SuperHyperClique Decides the Failures on the 2845

Cancer’s Recognition in the Perfect Connections of Cancer’s Attacks By 2846

SuperHyperModels Named (Neutrosophic) SuperHyperGraphs” in Ref. [68] by Henry 2847

Garrett (2023), “Indeterminacy On The All Possible Connections of Cells In Front of 2848

Cancer’s Attacks In The Terms of Neutrosophic Failed SuperHyperClique on Cancer’s 2849

Recognition called Neutrosophic SuperHyperGraphs” in Ref. [69] by Henry Garrett 2850

(2023), “Perfect Directions Toward Idealism in Cancer’s Neutrosophic Recognition 2851

Forwarding Neutrosophic SuperHyperClique on Neutrosophic SuperHyperGraphs” in 2852

Ref. [72] by Henry Garrett (2023), “Demonstrating Complete Connections in Every 2853

Embedded Regions and Sub-Regions in the Terms of Cancer’s Recognition and 2854

(Neutrosophic) SuperHyperGraphs With (Neutrosophic) SuperHyperClique” in 2855

Ref. [73] by Henry Garrett (2023), “Different Neutrosophic Types of Neutrosophic 2856

Regions titled neutrosophic Failed SuperHyperStable in Cancer’s Neutrosophic 2857

Recognition modeled in the Form of Neutrosophic SuperHyperGraphs” in Ref. [76] by 2858

Henry Garrett (2023), “Using the Tool As (Neutrosophic) Failed SuperHyperStable To 2859

SuperHyperModel Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs” in 2860

Ref. [79] by Henry Garrett (2023), “Neutrosophic Messy-Style SuperHyperGraphs To 2861

Form Neutrosophic SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In 2862

Special ViewPoints” in Ref. [80] by Henry Garrett (2023), “(Neutrosophic) 2863

SuperHyperStable on Cancer’s Recognition by Well-SuperHyperModelled 2864

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) SuperHyperGraphs” in Ref. [81] by Henry Garrett (2023), 2865

“Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To Use 2866

Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond” 2867

in Ref. [82] by Henry Garrett (2022), “(Neutrosophic) 1-Failed SuperHyperForcing in 2868

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

Garrett (2022), “Basic Notions on (Neutrosophic) SuperHyperForcing And 2870

(Neutrosophic) SuperHyperModeling in Cancer’s Recognitions And (Neutrosophic) 2871

SuperHyperGraphs” in Ref. [84] by Henry Garrett (2022), “Basic Neutrosophic Notions 2872

Concerning SuperHyperDominating and Neutrosophic SuperHyperResolving in 2873

SuperHyperGraph” in Ref. [95] by Henry Garrett (2022), “Initial Material of 2874

Neutrosophic Preliminaries to Study Some Neutrosophic Notions Based on 2875

Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic SuperHyperGraph (NSHG)” in 2876

Ref. [96] by Henry Garrett (2022), there are some endeavors to formalize the basic 2877

SuperHyperNotions about neutrosophic SuperHyperGraph and SuperHyperGraph. 2878

Some scientific studies and scientific researches about neutrosophic graphs, are 2879

proposed as book in Ref. [97] by Henry Garrett (2022) which is indexed by Google 2880

Scholar and has more than 3230 readers in Scribd. It’s titled “Beyond Neutrosophic 2881

Graphs” and published by Ohio: E-publishing: Educational Publisher 1091 West 1st 2882

Ave Grandview Heights, Ohio 43212 United State. This research book covers different 2883

types of notions and settings in neutrosophic graph theory and neutrosophic 2884

SuperHyperGraph theory. 2885

Also, some scientific studies and scientific researches about neutrosophic graphs, are 2886

proposed as book in Ref. [98] by Henry Garrett (2022) which is indexed by Google 2887

Scholar and has more than 4117 readers in Scribd. It’s titled “Neutrosophic Duality” 2888

and published by Florida: GLOBAL KNOWLEDGE - Publishing House 848 Brickell 2889

Ave Ste 950 Miami, Florida 33131 United States. This research book presents different 2890

types of notions SuperHyperResolving and SuperHyperDominating in the setting of 2891

duality in neutrosophic graph theory and neutrosophic SuperHyperGraph theory. This 2892

research book has scrutiny on the complement of the intended set and the intended set, 2893

simultaneously. It’s smart to consider a set but acting on its complement that what’s 2894

done in this research book which is popular in the terms of high readers in Scribd. 2895

See the seminal scientific researches [1–3]. The formalization of the notions on the 2896

framework of Extreme SuperHyperDominating, Neutrosophic SuperHyperDominating 2897

theory, and (Neutrosophic) SuperHyperGraphs theory at [5–96]. Two popular scientific 2898

research books in Scribd in the terms of high readers, 3230 and 4117 respectively, on 2899

neutrosophic science is on [97, 98]. 2900

– 2901

References 2902

1. Henry Garrett, “Properties of SuperHyperGraph and Neutrosophic 2903

SuperHyperGraph”, Neutrosophic Sets and Systems 49 (2022) 531-561 (doi: 2904

10.5281/zenodo.6456413). 2905

(http://fs.unm.edu/NSS/NeutrosophicSuperHyperGraph34.pdf). 2906

(https://digitalrepository.unm.edu/nss journal/vol49/iss1/34). 2907

2. Henry Garrett, “Neutrosophic Co-degree and Neutrosophic Degree alongside 2908

Chromatic Numbers in the Setting of Some Classes Related to Neutrosophic 2909

Hypergraphs”, J Curr Trends Comp Sci Res 1(1) (2022) 06-14. 2910

3. Henry Garrett, “Super Hyper Dominating and Super Hyper Resolving on 2911

Neutrosophic Super Hyper Graphs and Their Directions in Game Theory and 2912

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 Super Hyper Classes”, J Math Techniques Comput Math 1(3) 2913

(2022) 242-263. (doi: 10.33140/JMTCM.01.03.09) 2914

4. Henry Garrett, “Some Super Hyper Degrees and Co-Super Hyper Degrees on 2915

Neutrosophic Super Hyper Graphs And Super Hyper Graphs Alongside 2916

Applications in Cancer’s Treatments”, J Math Techniques Comput Math 2(1) 2917

(2023) 35-47. (https://www.opastpublishers.com/open-access-articles/some- 2918

super-hyper-degrees-and-cosuper-hyper-degrees-on-neutrosophic-super-hyper- 2919

graphs-and-super-hyper-graphs-alongside-a.pdf) 2920

5. Garrett, Henry. “0039 — Closing Numbers and Super-Closing Numbers as 2921

(Dual)Resolving and (Dual)Coloring alongside (Dual)Dominating in 2922

(Neutrosophic)n-SuperHyperGraph.” CERN European Organization for Nuclear 2923

Research - Zenodo, Nov. 2022. CERN European Organization for Nuclear 2924

Research, https://doi.org/10.5281/zenodo.6319942. 2925

https://oa.mg/work/10.5281/zenodo.6319942 2926

6. Garrett, Henry. “0049 — (Failed)1-Zero-Forcing Number in Neutrosophic 2927

Graphs.” CERN European Organization for Nuclear Research - Zenodo, Feb. 2928

2022. CERN European Organization for Nuclear Research, 2929

https://doi.org/10.13140/rg.2.2.35241.26724. 2930

https://oa.mg/work/10.13140/rg.2.2.35241.26724 2931

7. Henry Garrett, “Extreme SuperHyperClique as the Firm Scheme of 2932

Confrontation under Cancer’s Recognition as the Model in The Setting of 2933

(Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010308 (doi: 2934

10.20944/preprints202301.0308.v1). 2935

8. Henry Garrett, “Uncertainty On The Act And Effect Of Cancer Alongside The 2936

Foggy Positions Of Cells Toward Neutrosophic Failed SuperHyperClique inside 2937

Neutrosophic SuperHyperGraphs Titled Cancer’s Recognition”, Preprints 2023, 2938

2023010282 (doi: 10.20944/preprints202301.0282.v1). 2939

9. Henry Garrett, “Neutrosophic Version Of Separates Groups Of Cells In 2940

Cancer’s Recognition On Neutrosophic SuperHyperGraphs”, Preprints 2023, 2941

2023010267 (doi: 10.20944/preprints202301.0267.v1). 2942

10. Henry Garrett, “The Shift Paradigm To Classify Separately The Cells and 2943

Affected Cells Toward The Totality Under Cancer’s Recognition By New 2944

Multiple Definitions On the Sets Polynomials Alongside Numbers In The 2945

(Neutrosophic) SuperHyperMatching Theory Based on SuperHyperGraph and 2946

Neutrosophic SuperHyperGraph”, Preprints 2023, 2023010265 (doi: 2947

10.20944/preprints202301.0265.v1). 2948

11. Henry Garrett, “Breaking the Continuity and Uniformity of Cancer In The 2949

Worst Case of Full Connections With Extreme Failed SuperHyperClique In 2950

Cancer’s Recognition Applied in (Neutrosophic) SuperHyperGraphs”, Preprints 2951

2023, 2023010262,(doi: 10.20944/preprints202301.0262.v1). 2952

12. Henry Garrett, “Neutrosophic Failed SuperHyperStable as the Survivors on the 2953

Cancer’s Neutrosophic Recognition Based on Uncertainty to All Modes in 2954

Neutrosophic SuperHyperGraphs”, Preprints 2023, 2023010240 (doi: 2955

10.20944/preprints202301.0240.v1). 2956

13. Henry Garrett, “Extremism of the Attacked Body Under the Cancer’s 2957

Circumstances Where Cancer’s Recognition Titled (Neutrosophic) 2958

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

SuperHyperGraphs”, Preprints 2023, 2023010224, (doi: 2959

10.20944/preprints202301.0224.v1). 2960

14. Henry Garrett, “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s 2961

Recognitions And (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2962

2023010105 (doi: 10.20944/preprints202301.0105.v1). 2963

15. Henry Garrett, “Neutrosophic Messy-Style SuperHyperGraphs To Form 2964

Neutrosophic SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions 2965

In Special ViewPoints”, Preprints 2023, 2023010088 (doi: 2966

10.20944/preprints202301.0088.v1). 2967

16. Henry Garrett, “Neutrosophic 1-Failed SuperHyperForcing in the 2968

SuperHyperFunction To Use Neutrosophic SuperHyperGraphs on Cancer’s 2969

Neutrosophic Recognition And Beyond ”, Preprints 2023, 2023010044 2970

17. Henry Garrett, “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by 2971

Well- SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2972

2023010043 (doi: 10.20944/preprints202301.0043.v1). 2973

18. Henry Garrett, “Basic Notions on (Neutrosophic) SuperHyperForcing And 2974

(Neutrosophic) SuperHyperModeling in Cancer’s Recognitions And 2975

(Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010105 (doi: 2976

10.20944/preprints202301.0105.v1). 2977

19. Henry Garrett, “Neutrosophic Messy-Style SuperHyperGraphs To Form 2978

Neutrosophic SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions 2979

In Special ViewPoints”, Preprints 2023, 2023010088 (doi: 2980

10.20944/preprints202301.0088.v1). 2981

20. Henry Garrett, “(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions 2982

Featuring (Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, Preprints 2983

2022, 2022120549 (doi: 10.20944/preprints202212.0549.v1). 2984

21. Henry Garrett, “(Neutrosophic) SuperHyperAlliances With SuperHyperDefensive 2985

and SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) 2986

SuperHyperGraph With (Neutrosophic) SuperHyperModeling of Cancer’s 2987

Recognitions And Related (Neutrosophic) SuperHyperClasses”, Preprints 2022, 2988

2022120540 (doi: 10.20944/preprints202212.0540.v1). 2989

22. Henry Garrett, “SuperHyperGirth on SuperHyperGraph and Neutrosophic 2990

SuperHyperGraph With SuperHyperModeling of Cancer’s Recognitions”, 2991

Preprints 2022, 2022120500 (doi: 10.20944/preprints202212.0500.v1). 2992

23. Henry Garrett, “Some SuperHyperDegrees and Co-SuperHyperDegrees on 2993

Neutrosophic SuperHyperGraphs and SuperHyperGraphs Alongside Applications 2994

in Cancer’s Treatments”, Preprints 2022, 2022120324 (doi: 2995

10.20944/preprints202212.0324.v1). 2996

24. Henry Garrett, “SuperHyperDominating and SuperHyperResolving on 2997

Neutrosophic SuperHyperGraphs And Their Directions in Game Theory and 2998

Neutrosophic SuperHyperClasses”, Preprints 2022, 2022110576 (doi: 2999

10.20944/preprints202211.0576.v1). 3000

25. Henry Garrett, “New Ideas On Super Contradiction By Hyper Detection of 3001

SuperHyperDefensive In Cancer’s Neutrosophic Recognition and Neutrosophic 3002

SuperHyperGraph”, ResearchGate 2023, (doi: 10.13140/RG.2.2.13397.09446). 3003

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

26. Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic 3004

SuperHyperGraph By SuperHyperDominating As Hyper Closing On Super 3005

Messy”, ResearchGate 2023, (doi: 10.13140/RG.2.2.21510.45125). 3006

27. Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of 3007

SuperHyperDominating In Cancer’s Recognition With (Neutrosophic) 3008

SuperHyperGraph”, ResearchGate 2023, (doi: 10.13140/RG.2.2.13121.84321). 3009

28. Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic 3010

SuperHyperGraph By SuperHyperConnected As Hyper Group On Super Surge”, 3011

ResearchGate 2023, (doi: 10.13140/RG.2.2.11758.69441). 3012

29. Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of 3013

SuperHyperConnected In Cancer’s Recognition With (Neutrosophic) 3014

SuperHyperGraph”, ResearchGate 2023, (doi: 10.13140/RG.2.2.31891.35367). 3015

30. Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic 3016

SuperHyperGraph By SuperHyperTotal As Hyper Covering On Super 3017

Infections”, ResearchGate 2023, (doi: 10.13140/RG.2.2.19360.87048). 3018

31. Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of 3019

SuperHyperTotal In Cancer’s Recognition with (Neutrosophic) 3020

SuperHyperGraph”, ResearchGate 2023, (doi: 10.13140/RG.2.2.32363.21286). 3021

32. Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of 3022

SuperHyperPerfect In Cancer’s Recognition with (Neutrosophic) 3023

SuperHyperGraph”, ResearchGate 2023, (doi: 10.13140/RG.2.2.23266.81602). 3024

33. Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic 3025

SuperHyperGraph By SuperHyperPerfect As Hyper Idealism On Super 3026

Vacancy”, ResearchGate 2023, (doi: 10.13140/RG.2.2.19911.37285). 3027

34. Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic 3028

SuperHyperGraph By SuperHyperJoin As Hyper Separations On Super Sorts”, 3029

ResearchGate 2023, (doi: 10.13140/RG.2.2.11050.90569). 3030

35. Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of 3031

SuperHyperJoin In Cancer’s Recognition with (Neutrosophic) 3032

SuperHyperGraph”, ResearchGate 2023, (doi: 10.13140/RG.2.2.17761.79206). 3033

36. Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions 3034

Of SuperHyperDuality In Cancer’s Neutrosophic Recognition and Neutrosophic 3035

SuperHyperGraph”, ResearchGate 2023, (doi: 10.13140/RG.2.2.34953.52320). 3036

37. Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) 3037

SuperHyperGraph By SuperHyperDuality As Hyper Imaginations On Super 3038

Mixed-Illustrations”, ResearchGate 2023, (doi: 10.13140/RG.2.2.33275.80161). 3039

38. Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) 3040

SuperHyperGraph By Path SuperHyperColoring As Hyper Correction On Super 3041

Faults”, ResearchGate 2023, (doi: 10.13140/RG.2.2.30182.50241). 3042

39. Henry Garrett, “New Ideas On Super Reflections By Hyper Rotations Of Path 3043

SuperHyperColoring In Cancer’s Neutrosophic Recognition and Neutrosophic 3044

SuperHyperGraph”, ResearchGate 2023, (doi: 10.13140/RG.2.2.33459.30243). 3045

40. Henry Garrett, “New Ideas As Hyper Deformations On Super Chains In 3046

Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph By 3047

SuperHyperDensity”, ResearchGate 2023, (doi: 10.13140/RG.2.2.13444.60806). 3048

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

41. Henry Garrett, “New Ideas As Hyper Ignorance By SuperHyperDensity On 3049

Super Resistances In Cancer’s Neutrosophic Recognition and Neutrosophic 3050

SuperHyperGraph”, ResearchGate 2023, (doi:10.13140/RG.2.2.16800.05123). 3051

42. Henry Garrett, “New Research On Cancer’s Recognition and Neutrosophic 3052

SuperHyperGraph By Eulerian SuperHyperCycles and Hamiltonian Sets As 3053

Hyper Covering Versus Super separations-VI”, ResearchGate 2023, (doi: 3054

10.13140/RG.2.2.29913.80482). 3055

43. Henry Garrett, “New Research On Cancer’s Recognition and Neutrosophic 3056

SuperHyperGraph By Eulerian SuperHyperCycles and Hamiltonian Sets As 3057

Hyper Covering Versus Super separations-V”, ResearchGate 2023, (doi: 3058

10.13140/RG.2.2.33269.24809). 3059

44. Henry Garrett, “New Research On Cancer’s Recognition and Neutrosophic 3060

SuperHyperGraph By Eulerian SuperHyperCycles and Hamiltonian Sets As 3061

Hyper Covering Versus Super separations-IV”, ResearchGate 2023, (doi: 3062

10.13140/RG.2.2.34946.96960). 3063

45. Henry Garrett, “A Research On Cancer’s Recognition and Neutrosophic 3064

SuperHyperGraph By Eulerian SuperHyperCycles and Hamiltonian Sets As 3065

Hyper Covering Versus Super separations-III”, ResearchGate 2023, (doi: 3066

10.13140/RG.2.2.14814.31040). 3067

46. Henry Garrett, “A Research On Cancer’s Recognition and Neutrosophic 3068

SuperHyperGraph By Eulerian SuperHyperCycles and Hamiltonian Sets As 3069

Hyper Covering Versus Super separations-II”, ResearchGate 2023, (doi: 3070

10.13140/RG.2.2.15653.17125). 3071

47. Henry Garrett, “A Research On Cancer’s Recognition and Neutrosophic 3072

SuperHyperGraph By Eulerian SuperHyperCycles and Hamiltonian Sets As 3073

Hyper Covering Versus Super separations-I”, ResearchGate 2023, (doi: 3074

10.13140/RG.2.2.25719.50089). 3075

48. Henry Garrett, “New Ideas On Super Disruptions In Cancer’s Extreme 3076

Recognition As Neutrosophic SuperHyperGraph By Hyper Plans Called 3077

SuperHyperConnectivities”, ResearchGate 2023, (doi: 3078

10.13140/RG.2.2.29441.94562). 3079

49. Henry Garrett, “Cancer’s Neutrosophic Recognition As Neutrosophic 3080

SuperHyperGraph By SuperHyperConnectivities As Hyper Diagnosis On Super 3081

Mechanism”, ResearchGate 2023, (doi: 10.13140/RG.2.2.17252.24968). 3082

50. Henry Garrett,“Cancer’s Recognition and (Neutrosophic) SuperHyperGraph By 3083

the Criteria of Eulerian and Hamiltonian Type-Sets As Hyper Modified Cycles 3084

On Super Mess”, ResearchGate 2023,(doi: 10.13140/RG.2.2.16652.59525). 3085

51. Henry Garrett,“Eulerian and Hamiltonian In Cancer’s Neutrosophic Recognition 3086

and Neutrosophic SuperHyperGraph On Super Interactions By Hyper 3087

Extensions of Cycles”, ResearchGate 2023,(doi: 10.13140/RG.2.2.34583.24485). 3088

52. Henry Garrett, “Some Super Hyper Degrees and Co-Super Hyper Degrees on 3089

Neutrosophic Super Hyper Graphs And Super Hyper Graphs Alongside 3090

Applications in Cancer’s Treatments”, J Math Techniques Comput Math 2(1) 3091

(2023) 35-47. 3092

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

53. Henry Garrett,“SuperHyperGirth Type-Results on extreme SuperHyperGirth 3093

theory and (Neutrosophic) SuperHyperGraphs Toward Cancer’s extreme 3094

Recognition”, Preprints 2023, 2023010396 (doi: 3095

10.20944/preprints202301.0396.v1). 3096

54. Henry Garrett,“Neutrosophic SuperHyperGraphs Warns Hyper Landmark of 3097

neutrosophic SuperHyperGirth In Super Type-Versions of Cancer’s neutrosophic 3098

Recognition”, Preprints 2023, 2023010395 (doi: 3099

10.20944/preprints202301.0395.v1). 3100

55. Henry Garrett,“The Constructions of (Neutrosophic) SuperHyperGraphs on the 3101

Cancer’s Recognition in The Confrontation With Super Attacks In Hyper 3102

Situations By Implementing (Neutrosophic) 1-Failed SuperHyperForcing in The 3103

Technical Approaches to Neutralize SuperHyperViews”, ResearchGate 2023, 3104

(doi: 10.13140/RG.2.2.26240.51204). 3105

56. Henry Garrett,“(Neutrosophic) 1-Failed SuperHyperForcing As the 3106

Entrepreneurs on Cancer’s Recognitions To Fail Forcing Style As the Super 3107

Classes With Hyper Effects In The Background of the Framework is So-Called 3108

(Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 3109

10.13140/RG.2.2.12818.73925). 3110

57. Henry Garrett,“Super Actions On The Types of Hyper Levels In The Sensible 3111

Neutrosophic SuperHyperGirth On Cancer’s Neutrosophic Recognition and 3112

Neutrosophic SuperHyperGraph”, ResearchGate 2023,(doi: 3113

10.13140/RG.2.2.26836.88960). 3114

58. Henry Garrett,“SuperHyperGirth Approaches on the Super Challenges on the 3115

Cancer’s Recognition In the Hyper Model of (Neutrosophic) SuperHyperGraph”, 3116

ResearchGate 2023,(doi: 10.13140/RG.2.2.36745.93289). 3117

59. Henry Garrett,“Extreme SuperHyperClique as the Firm Scheme of 3118

Confrontation under Cancer’s Recognition as the Model in The Setting of 3119

(Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010308 (doi: 3120

10.20944/preprints202301.0308.v1). 3121

60. Henry Garrett,“Uncertainty On The Act And Effect Of Cancer Alongside The 3122

Foggy Positions Of Cells Toward Neutrosophic Failed SuperHyperClique inside 3123

Neutrosophic SuperHyperGraphs Titled Cancer’s Recognition”, Preprints 2023, 3124

2023010282 (doi: 10.20944/preprints202301.0282.v1). 3125

61. Henry Garrett,“Neutrosophic Version Of Separates Groups Of Cells In Cancer’s 3126

Recognition On Neutrosophic SuperHyperGraphs”, Preprints 2023, 2023010267 3127

(doi: 10.20944/preprints202301.0267.v1).). 3128

62. Henry Garrett, “The Shift Paradigm To Classify Separately The Cells and 3129

Affected Cells Toward The Totality Under Cancer’s Recognition By New 3130

Multiple Definitions On the Sets Polynomials Alongside Numbers In The 3131

(Neutrosophic) SuperHyperMatching Theory Based on SuperHyperGraph and 3132

Neutrosophic SuperHyperGraph”, Preprints 2023, 2023010265 (doi: 3133

10.20944/preprints202301.0265.v1). 3134

63. Henry Garrett,“Breaking the Continuity and Uniformity of Cancer In The 3135

Worst Case of Full Connections With Extreme Failed SuperHyperClique In 3136

Cancer’s Recognition Applied in (Neutrosophic) SuperHyperGraphs”, Preprints 3137

2023, 2023010262,(doi: 10.20944/preprints202301.0262.v1). 3138

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

64. Henry Garrett, “Neutrosophic Failed SuperHyperStable as the Survivors on the 3139

Cancer’s Neutrosophic Recognition Based on Uncertainty to All Modes in 3140

Neutrosophic SuperHyperGraphs”, Preprints 2023, 2023010240 (doi: 3141

10.20944/preprints202301.0240.v1). 3142

65. Henry Garrett, “Extremism of the Attacked Body Under the Cancer’s 3143

Circumstances Where Cancer’s Recognition Titled (Neutrosophic) 3144

SuperHyperGraphs”, Preprints 2023, 2023010224, (doi: 3145

10.20944/preprints202301.0224.v1). 3146

66. Henry Garrett,“SuperHyperMatching By (R-)Definitions And Polynomials To 3147

Monitor Cancer’s Recognition In Neutrosophic SuperHyperGraphs”, 3148

ResearchGate 2023,(doi: 10.13140/RG.2.2.35061.65767). 3149

67. Henry Garrett,“The Focus on The Partitions Obtained By Parallel Moves In 3150

The Cancer’s Extreme Recognition With Different Types of Extreme 3151

SuperHyperMatching Set and Polynomial on (Neutrosophic) SuperHyperGraphs”, 3152

ResearchGate 2023, (doi: 10.13140/RG.2.2.18494.15680). 3153

68. Henry Garrett,“Extreme Failed SuperHyperClique Decides the Failures on the 3154

Cancer’s Recognition in the Perfect Connections of Cancer’s Attacks By 3155

SuperHyperModels Named (Neutrosophic) SuperHyperGraphs”, ResearchGate 3156

2023, (doi: 10.13140/RG.2.2.32530.73922). 3157

69. Henry Garrett,“Indeterminacy On The All Possible Connections of Cells In 3158

Front of Cancer’s Attacks In The Terms of Neutrosophic Failed 3159

SuperHyperClique on Cancer’s Recognition called Neutrosophic 3160

SuperHyperGraphs”, ResearchGate 2023, (doi: 10.13140/RG.2.2.15897.70243). 3161

70. Henry Garrett,“Extreme Failed SuperHyperClique Decides the Failures on the 3162

Cancer’s Recognition in the Perfect Connections of Cancer’s Attacks By 3163

SuperHyperModels Named (Neutrosophic) SuperHyperGraphs”, ResearchGate 3164

2023, (doi: 10.13140/RG.2.2.32530.73922). 3165

71. Henry Garrett, “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s 3166

Recognitions And (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 3167

2023010105 (doi: 10.20944/preprints202301.0105.v1). 3168

72. Henry Garrett,“Perfect Directions Toward Idealism in Cancer’s Neutrosophic 3169

Recognition Forwarding Neutrosophic SuperHyperClique on Neutrosophic 3170

SuperHyperGraphs”, ResearchGate 2023, (doi: 10.13140/RG.2.2.30092.80004). 3171

73. Henry Garrett,“Demonstrating Complete Connections in Every Embedded 3172

Regions and Sub-Regions in the Terms of Cancer’s Recognition and 3173

(Neutrosophic) SuperHyperGraphs With (Neutrosophic) SuperHyperClique”, 3174

ResearchGate 2023, (doi: 10.13140/RG.2.2.23172.19849). 3175

74. Henry Garrett, “Basic Notions on (Neutrosophic) SuperHyperForcing And 3176

(Neutrosophic) SuperHyperModeling in Cancer’s Recognitions And 3177

(Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010105 (doi: 3178

10.20944/preprints202301.0105.v1). 3179

75. Henry Garrett, “Neutrosophic Messy-Style SuperHyperGraphs To Form 3180

Neutrosophic SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions 3181

In Special ViewPoints”, Preprints 2023, 2023010088 (doi: 3182

10.20944/preprints202301.0088.v1). 3183

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

76. Henry Garrett,“Different Neutrosophic Types of Neutrosophic Regions titled 3184

neutrosophic Failed SuperHyperStable in Cancer’s Neutrosophic Recognition 3185

modeled in the Form of Neutrosophic SuperHyperGraphs”, ResearchGate 2023, 3186

(doi: 10.13140/RG.2.2.17385.36968). 3187

77. Henry Garrett, “Neutrosophic 1-Failed SuperHyperForcing in the 3188

SuperHyperFunction To Use Neutrosophic SuperHyperGraphs on Cancer’s 3189

Neutrosophic Recognition And Beyond”, Preprints 2023, 2023010044 3190

78. Henry Garrett, “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by 3191

Well- SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 3192

2023010043 (doi: 10.20944/preprints202301.0043.v1). 3193

79. Henry Garrett, “Using the Tool As (Neutrosophic) Failed SuperHyperStable To 3194

SuperHyperModel Cancer’s Recognition Titled (Neutrosophic) 3195

SuperHyperGraphs”, ResearchGate 2023, (doi: 10.13140/RG.2.2.28945.92007). 3196

80. Henry Garrett, “Neutrosophic Messy-Style SuperHyperGraphs To Form 3197

Neutrosophic SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In 3198

Special ViewPoints”, ResearchGate 2023, (doi: 10.13140/RG.2.2.11447.80803). 3199

81. Henry Garrett, “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by 3200

Well-SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, ResearchGate 3201

2023, (doi: 10.13140/RG.2.2.35774.77123). 3202

82. Henry Garrett, “Neutrosophic 1-Failed SuperHyperForcing in the 3203

SuperHyperFunction To Use Neutrosophic SuperHyperGraphs on Cancer’s 3204

Neutrosophic Recognition And Beyond ”, ResearchGate 2022, (doi: 3205

10.13140/RG.2.2.36141.77287). 3206

83. Henry Garrett, “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s 3207

Recognitions And (Neutrosophic) SuperHyperGraphs”, ResearchGate 2022, (doi: 3208

10.13140/RG.2.2.29430.88642). 3209

84. Henry Garrett, “Basic Notions on (Neutrosophic) SuperHyperForcing And 3210

(Neutrosophic) SuperHyperModeling in Cancer’s Recognitions And 3211

(Neutrosophic) SuperHyperGraphs”, ResearchGate 2022, (doi: 3212

10.13140/RG.2.2.11369.16487). 3213

85. Henry Garrett, “(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions 3214

Featuring (Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, Preprints 3215

2022, 2022120549 (doi: 10.20944/preprints202212.0549.v1). 3216

86. Henry Garrett, “(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions 3217

Featuring (Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, 3218

ResearchGate 2022, (doi: 10.13140/RG.2.2.19380.94084). 3219

87. Henry Garrett, “(Neutrosophic) SuperHyperAlliances With 3220

SuperHyperDefensive and SuperHyperOffensive Type-SuperHyperSet On 3221

(Neutrosophic) SuperHyperGraph With (Neutrosophic) SuperHyperModeling of 3222

Cancer’s Recognitions And Related (Neutrosophic) SuperHyperClasses”, 3223

Preprints 2022, 2022120540 (doi: 10.20944/preprints202212.0540.v1). 3224

88. Henry Garrett, “(Neutrosophic) SuperHyperAlliances With 3225

SuperHyperDefensive and SuperHyperOffensive Type-SuperHyperSet On 3226

(Neutrosophic) SuperHyperGraph With (Neutrosophic) SuperHyperModeling of 3227

Cancer’s Recognitions And Related (Neutrosophic) SuperHyperClasses”, 3228

ResearchGate 2022, (doi: 10.13140/RG.2.2.14426.41923). 3229

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

89. Henry Garrett, “SuperHyperGirth on SuperHyperGraph and Neutrosophic 3230

SuperHyperGraph With SuperHyperModeling of Cancer’s Recognitions”, 3231

Preprints 2022, 2022120500 (doi: 10.20944/preprints202212.0500.v1). 3232

90. Henry Garrett, “SuperHyperGirth on SuperHyperGraph and Neutrosophic 3233

SuperHyperGraph With SuperHyperModeling of Cancer’s Recognitions”, 3234

ResearchGate 2022 (doi: 10.13140/RG.2.2.20993.12640). 3235

91. Henry Garrett,“Some SuperHyperDegrees and Co-SuperHyperDegrees on 3236

Neutrosophic SuperHyperGraphs and SuperHyperGraphs Alongside 3237

Applications in Cancer’s Treatments”, Preprints 2022, 2022120324 (doi: 3238

10.20944/preprints202212.0324.v1). 3239

92. Henry Garrett, “Some SuperHyperDegrees and Co-SuperHyperDegrees on 3240

Neutrosophic SuperHyperGraphs And SuperHyperGraphs Alongside 3241

Applications in Cancer’s Treatments”, ResearchGate 2022 (doi: 3242

10.13140/RG.2.2.23123.04641). 3243

93. Henry Garrett, “SuperHyperDominating and SuperHyperResolving on 3244

Neutrosophic SuperHyperGraphs And Their Directions in Game Theory and 3245

Neutrosophic SuperHyperClasses”, Preprints 2022, 2022110576 (doi: 3246

10.20944/preprints202211.0576.v1). 3247

94. Henry Garrett, “SuperHyperDominating and SuperHyperResolving on 3248

Neutrosophic SuperHyperGraphs And Their Directions in Game Theory and 3249

Neutrosophic SuperHyperClasses”, ResearchGate 2022 (doi: 3250

10.13140/RG.2.2.23324.56966). 3251

95. Henry Garrett, “Basic Neutrosophic Notions Concerning SuperHyperDominating 3252

and Neutrosophic SuperHyperResolving in SuperHyperGraph”, ResearchGate 3253

2022 (doi: 10.13140/RG.2.2.29173.86244). 3254

96. Henry Garrett, “Initial Material of Neutrosophic Preliminaries to Study Some 3255

Neutrosophic Notions Based on Neutrosophic SuperHyperEdge (NSHE) in 3256

Neutrosophic SuperHyperGraph (NSHG)”, ResearchGate 2022 (doi: 3257

10.13140/RG.2.2.25385.88160). 3258

97. Henry Garrett, (2022). “Beyond Neutrosophic Graphs”, Ohio: E-publishing: 3259

Educational Publisher 1091 West 1st Ave Grandview Heights, Ohio 43212 3260

United States. ISBN: 979-1-59973-725-6 3261

(http://fs.unm.edu/BeyondNeutrosophicGraphs.pdf). 3262

98. Henry Garrett, (2022). “Neutrosophic Duality”, Florida: GLOBAL 3263

KNOWLEDGE - Publishing House 848 Brickell Ave Ste 950 Miami, Florida 3264

33131 United States. ISBN: 978-1-59973-743-0 3265

(http://fs.unm.edu/NeutrosophicDuality.pdf). 3266

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

View publication stats

You might also like