Hamiltonian-Type-Cycle-

Cut In
SuperHyperGraphs
Ideas | Approaches | Accessibility | Availability

Dr. Henry Garrett

Report | Exposition | References | Research #22 2023
 Contents

Contents iii

List of Figures iv

List of Tables v

1 ABSTRACT 1

2 Background 13

Bibliography 19

3 Acknowledgements 39

4 Cancer In Extreme SuperHyperGraph 41

5 Extreme Hamiltonian-Type-Cycle-Cut 45

6 New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Type-

Cycle-Cut In Recognition of Cancer With (Neutrosophic) SuperHyper-
Graph 47

7 ABSTRACT 49

8 Applied Notions Under The Scrutiny Of The Motivation Of This

Scientific Research 55

9 Extreme Preliminaries Of This Scientific Research On the Redeemed Ways 59

10 Extreme SuperHyperHamiltonian-Type-Cycle-Cut But As The Extensions

Excerpt From Dense And Super Forms 71

11 The Extreme Departures on The Theoretical Results Toward Theoretical

Motivations 113

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

12 The Surveys of Mathematical Sets On The Results But As The Initial

Motivation 123

13 Extreme Applications in Cancer’s Extreme Recognition 135

14 Case 1: The Initial Extreme Steps Toward Extreme SuperHyperBipart-

ite as Extreme SuperHyperModel 137

15 Case 2: The Increasing Extreme Steps Toward Extreme SuperHyper-

Multipartite as Extreme SuperHyperModel 139

16 Wondering Open Problems But As The Directions To Forming The

Motivations 141

17 Conclusion and Closing Remarks 143

18 Extreme SuperHyperDuality But As The Extensions Excerpt From

Dense And Super Forms 145

19 Extreme SuperHyperJoin But As The Extensions Excerpt From Dense

And Super Forms 159

20 Extreme SuperHyperPerfect But As The Extensions Excerpt From

Dense And Super Forms 173

21 Extreme SuperHyperTotal But As The Extensions Excerpt From Dense

And Super Forms 187

22 Extreme SuperHyperConnected But As The Extensions Excerpt From

Dense And Super Forms 201

23 Background 215

Bibliography 221

24 Cancer In Neutrosophic SuperHyperGraph 241

25 Neutrosophic Hamiltonian-Type-Cycle-Cut 245

26 New Ideas In Recognition of Cancer And Neutrosophic SuperHyper-

Graph By Hamiltonian-Type-Cycle-Cut As Hyper Hamper On Super
Hammy 247

27 ABSTRACT 249

28 Applied Notions Under The Scrutiny Of The Motivation Of This

Scientific Research 255

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

29 Neutrosophic Preliminaries Of This Scientific Research On the Re-

deemed Ways 259

30 Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut But As The Extensions

Excerpt From Dense And Super Forms 271

31 The Neutrosophic Departures on The Theoretical Results Toward

Theoretical Motivations 313

32 The Surveys of Mathematical Sets On The Results But As The Initial

Motivation 325

33 Neutrosophic Applications in Cancer’s Neutrosophic Recognition 337

34 Case 1: The Initial Neutrosophic Steps Toward Neutrosophic SuperHy-

perBipartite as Neutrosophic SuperHyperModel 339

35 Case 2: The Increasing Neutrosophic Steps Toward Neutrosophic

SuperHyperMultipartite as Neutrosophic SuperHyperModel 341

36 Wondering Open Problems But As The Directions To Forming The

Motivations 343

37 Conclusion and Closing Remarks 345

38 Neutrosophic SuperHyperDuality But As The Extensions Excerpt From

Dense And Super Forms 347

39 Neutrosophic SuperHyperJoin But As The Extensions Excerpt From

Dense And Super Forms 361

40 Neutrosophic SuperHyperPerfect But As The Extensions Excerpt From

Dense And Super Forms 375

41 Neutrosophic SuperHyperTotal But As The Extensions Excerpt From

Dense And Super Forms 389

42 Neutrosophic SuperHyperConnected But As The Extensions Excerpt

From Dense And Super Forms 403

43 Background 417

Bibliography 423

44 Books’ Contributions 443

45 “SuperHyperGraph-Based Books”: | Featured Tweets 451

46 CV 479

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 List of Figures

10.1 The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme

SuperHyperHamiltonian-Type-Cycle-Cut in the Extreme Example (42.0.3) . . . . . . . . 77
10.2 The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
SuperHyperHamiltonian-Type-Cycle-Cut in the Extreme Example (42.0.3) . . . . . . . . 78
10.3 The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
SuperHyperHamiltonian-Type-Cycle-Cut in the Extreme Example (42.0.3) . . . . . . . . 78
10.4 The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
SuperHyperHamiltonian-Type-Cycle-Cut in the Extreme Example (42.0.3) . . . . . . . . 79
10.5 The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
SuperHyperHamiltonian-Type-Cycle-Cut in the Extreme Example (42.0.3) . . . . . . . . 80
10.6 The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
SuperHyperHamiltonian-Type-Cycle-Cut in the Extreme Example (42.0.3) . . . . . . . . 81
10.7 The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
SuperHyperHamiltonian-Type-Cycle-Cut in the Extreme Example (42.0.3) . . . . . . . . 82
10.8 The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
SuperHyperHamiltonian-Type-Cycle-Cut in the Extreme Example (42.0.3) . . . . . . . . 83
10.9 The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
SuperHyperHamiltonian-Type-Cycle-Cut in the Extreme Example (42.0.3) . . . . . . . . 83
10.10The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
SuperHyperHamiltonian-Type-Cycle-Cut in the Extreme Example (42.0.3) . . . . . . . . 84
10.11The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
SuperHyperHamiltonian-Type-Cycle-Cut in the Extreme Example (42.0.3) . . . . . . . . 85
10.12The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
SuperHyperHamiltonian-Type-Cycle-Cut in the Extreme Example (42.0.3) . . . . . . . . 86
10.13The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
SuperHyperHamiltonian-Type-Cycle-Cut in the Extreme Example (42.0.3) . . . . . . . . 87
10.14The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
SuperHyperHamiltonian-Type-Cycle-Cut in the Extreme Example (42.0.3) . . . . . . . . 88
10.15The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
SuperHyperHamiltonian-Type-Cycle-Cut in the Extreme Example (42.0.3) . . . . . . . . 89
10.16The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
SuperHyperHamiltonian-Type-Cycle-Cut in the Extreme Example (42.0.3) . . . . . . . . 89

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

10.17The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme

SuperHyperHamiltonian-Type-Cycle-Cut in the Extreme Example (42.0.3) . . . . . . . . 90
10.18The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
SuperHyperHamiltonian-Type-Cycle-Cut in the Extreme Example (42.0.3) . . . . . . . . 91
10.19The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
SuperHyperHamiltonian-Type-Cycle-Cut in the Extreme Example (42.0.3) . . . . . . . . 92
10.20The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
SuperHyperHamiltonian-Type-Cycle-Cut in the Extreme Example (42.0.3) . . . . . . . . 93
10.21The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
SuperHyperHamiltonian-Type-Cycle-Cut in the Extreme Example (42.0.3) . . . . . . . . 94
10.22The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
SuperHyperHamiltonian-Type-Cycle-Cut in the Extreme Example (42.0.3) . . . . . . . . 95

11.1 an Extreme SuperHyperPath Associated to the Notions of Extreme

SuperHyperHamiltonian-Type-Cycle-Cut in the Example (42.0.5) . . . . . . . . . . . . . . 114
11.2 an Extreme SuperHyperCycle Associated to the Extreme Notions of Extreme
SuperHyperHamiltonian-Type-Cycle-Cut in the Extreme Example (42.0.7) . . . . . . . . . 116
11.3 an Extreme SuperHyperStar Associated to the Extreme Notions of Extreme
SuperHyperHamiltonian-Type-Cycle-Cut in the Extreme Example (42.0.9) . . . . . . . . . 117
11.4 Extreme SuperHyperBipartite Extreme Associated to the Extreme Notions of
Extreme SuperHyperHamiltonian-Type-Cycle-Cut in the Example (42.0.11) . . . . . . . . 119
11.5 an Extreme SuperHyperMultipartite Associated to the Notions of Extreme
SuperHyperHamiltonian-Type-Cycle-Cut in the Example (42.0.13) . . . . . . . . . . . . . 121
11.6 an Extreme SuperHyperWheel Extreme Associated to the Extreme Notions of
Extreme SuperHyperHamiltonian-Type-Cycle-Cut in the Extreme Example (42.0.15) . . . 122

14.1 an Extreme SuperHyperBipartite Associated to the Notions of Extreme

SuperHyperHamiltonian-Type-Cycle-Cut . . . . . . . . . . . . . . . . . . . . . . . . . . . . 137

15.1 an Extreme SuperHyperMultipartite Associated to the Notions of Extreme

SuperHyperHamiltonian-Type-Cycle-Cut . . . . . . . . . . . . . . . . . . . . . . . . . . . . 139

30.1 The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions

of Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut in the Neutrosophic Example
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 277
30.2 The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions
of Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut in the Neutrosophic Example
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 278
30.3 The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions
of Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut in the Neutrosophic Example
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 279
30.4 The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions
of Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut in the Neutrosophic Example
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 279
30.5 The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions
of Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut in the Neutrosophic Example
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 280

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

30.6 The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions

of Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut in the Neutrosophic Example
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 281
30.7 The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions
of Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut in the Neutrosophic Example
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 282
30.8 The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions
of Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut in the Neutrosophic Example
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 283
30.9 The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions
of Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut in the Neutrosophic Example
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 284
30.10The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions
of Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut in the Neutrosophic Example
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 284
30.11The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions
of Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut in the Neutrosophic Example
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 285
30.12The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions
of Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut in the Neutrosophic Example
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 286
30.13The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions
of Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut in the Neutrosophic Example
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 287
30.14The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions
of Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut in the Neutrosophic Example
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 288
30.15The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions
of Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut in the Neutrosophic Example
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 289
30.16The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions
of Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut in the Neutrosophic Example
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 290
30.17The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions
of Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut in the Neutrosophic Example
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 291
30.18The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions
of Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut in the Neutrosophic Example
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 291
30.19The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions
of Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut in the Neutrosophic Example
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 292
30.20The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions
of Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut in the Neutrosophic Example
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 293

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

30.21The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions

of Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut in the Neutrosophic Example
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 294
30.22The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions
of Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut in the Neutrosophic Example
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 295

31.1 a Neutrosophic SuperHyperPath Associated to the Notions of Neutrosophic

SuperHyperHamiltonian-Type-Cycle-Cut in the Example (42.0.5) . . . . . . . . . . . . . . 314
31.2 a Neutrosophic SuperHyperCycle Associated to the Neutrosophic Notions of
Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut in the Neutrosophic Example (42.0.7) 316
31.3 a Neutrosophic SuperHyperStar Associated to the Neutrosophic Notions of
Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut in the Neutrosophic Example (42.0.9) 317
31.4 Neutrosophic SuperHyperBipartite Neutrosophic Associated to the Neutrosophic
Notions of Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut in the Example (42.0.11) 319
31.5 a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic
SuperHyperHamiltonian-Type-Cycle-Cut in the Example (42.0.13) . . . . . . . . . . . . . 321
31.6 a Neutrosophic SuperHyperWheel Neutrosophic Associated to the Neutrosophic
Notions of Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut in the Neutrosophic
Example (42.0.15) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 323

34.1 a Neutrosophic SuperHyperBipartite Associated to the Notions of Neutrosophic

SuperHyperHamiltonian-Type-Cycle-Cut . . . . . . . . . . . . . . . . . . . . . . . . . . . . 339

35.1 a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic

SuperHyperHamiltonian-Type-Cycle-Cut . . . . . . . . . . . . . . . . . . . . . . . . . . . . 341

44.1 Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-
Type-Cycle-Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”,
Zenodo 2023, (doi: 10.5281/zenodo.7804218). . . . . . . . . . . . . . . . . . . . . . 444
44.2 Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-
Type-Cycle-Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”,
Zenodo 2023, (doi: 10.5281/zenodo.7804218). . . . . . . . . . . . . . . . . . . . . . 445
44.3 Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-
Type-Cycle-Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”,
Zenodo 2023, (doi: 10.5281/zenodo.7804218). . . . . . . . . . . . . . . . . . . . . . 445
44.4 Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHy-
perGraph By Hamiltonian-Type-Cycle-Cut As Hyper Hamper On Super Hammy”,
Zenodo 2023, (doi: 10.5281/zenodo.7799902). . . . . . . . . . . . . . . . . . . . . . 446
44.5 Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHy-
perGraph By Hamiltonian-Type-Cycle-Cut As Hyper Hamper On Super Hammy”,
Zenodo 2023, (doi: 10.5281/zenodo.7799902). . . . . . . . . . . . . . . . . . . . . . 447
44.6 Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHy-
perGraph By Hamiltonian-Type-Cycle-Cut As Hyper Hamper On Super Hammy”,
Zenodo 2023, (doi: 10.5281/zenodo.7799902). . . . . . . . . . . . . . . . . . . . . . 447

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

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

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

45.3 “SuperHyperGraph-Based Books”: | Featured Tweets #69 . . . . . . . . . . . . . . 454
45.4 “SuperHyperGraph-Based Books”: | Featured Tweets #69 . . . . . . . . . . . . . . 455
45.5 “SuperHyperGraph-Based Books”: | Featured Tweets #69 . . . . . . . . . . . . . . 456
45.6 “SuperHyperGraph-Based Books”: | Featured Tweets #68 . . . . . . . . . . . . . . 457
45.7 “SuperHyperGraph-Based Books”: | Featured Tweets #68 . . . . . . . . . . . . . . 458
45.8 “SuperHyperGraph-Based Books”: | Featured Tweets #68 . . . . . . . . . . . . . . 459
45.9 “SuperHyperGraph-Based Books”: | Featured Tweets #68 . . . . . . . . . . . . . . 460
45.10“SuperHyperGraph-Based Books”: | Featured Tweets #67 . . . . . . . . . . . . . . 460
45.11“SuperHyperGraph-Based Books”: | Featured Tweets #67 . . . . . . . . . . . . . . 461
45.12“SuperHyperGraph-Based Books”: | Featured Tweets #67 . . . . . . . . . . . . . . 462
45.13“SuperHyperGraph-Based Books”: | Featured Tweets #67 . . . . . . . . . . . . . . 463
45.14“SuperHyperGraph-Based Books”: | Featured Tweets #66 . . . . . . . . . . . . . . 463
45.15“SuperHyperGraph-Based Books”: | Featured Tweets #66 . . . . . . . . . . . . . . 464
45.16“SuperHyperGraph-Based Books”: | Featured Tweets #66 . . . . . . . . . . . . . . 465
45.17“SuperHyperGraph-Based Books”: | Featured Tweets #66 . . . . . . . . . . . . . . 466
45.18“SuperHyperGraph-Based Books”: | Featured Tweets #66 . . . . . . . . . . . . . . 466
45.19“SuperHyperGraph-Based Books”: | Featured Tweets #65 . . . . . . . . . . . . . . 467
45.20“SuperHyperGraph-Based Books”: | Featured Tweets #65 . . . . . . . . . . . . . . 468
45.21“SuperHyperGraph-Based Books”: | Featured Tweets #65 . . . . . . . . . . . . . . 469
45.22“SuperHyperGraph-Based Books”: | Featured Tweets #65 . . . . . . . . . . . . . . 470
45.23“SuperHyperGraph-Based Books”: | Featured Tweets #65 . . . . . . . . . . . . . . 471
45.24“SuperHyperGraph-Based Books”: | Featured Tweets #65 . . . . . . . . . . . . . . 472
45.25“SuperHyperGraph-Based Books”: | Featured Tweets #64 . . . . . . . . . . . . . . 473
45.26“SuperHyperGraph-Based Books”: | Featured Tweets #63 . . . . . . . . . . . . . . 474
45.27“SuperHyperGraph-Based Books”: | Featured Tweets #62 . . . . . . . . . . . . . . 475
45.28“SuperHyperGraph-Based Books”: | Featured Tweets #61 . . . . . . . . . . . . . . 476
45.29“SuperHyperGraph-Based Books”: | Featured Tweets #60 . . . . . . . . . . . . . . 477

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 List of Tables

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

Belong to The Neutrosophic SuperHyperGraph Mentioned in the Definition (29.0.23) 68
9.2 The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges
Belong to The Neutrosophic SuperHyperGraph, Mentioned in the Definition (29.0.22) 69
9.3 The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges
Belong to The Neutrosophic SuperHyperGraph Mentioned in the Definition (29.0.23) 69

14.1 The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges

Belong to The Extreme SuperHyperBipartite . . . . . . . . . . . . . . . . . . . . . 138

15.1 The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges

Belong to The Extreme SuperHyperMultipartite . . . . . . . . . . . . . . . . . . . 140

17.1 An Overlook On This Research And Beyond . . . . . . . . . . . . . . . . . . . . . 144

29.1 The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges

Belong to The Neutrosophic SuperHyperGraph Mentioned in the Definition (29.0.23) 268
29.2 The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges
Belong to The Neutrosophic SuperHyperGraph, Mentioned in the Definition (29.0.22) 269
29.3 The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges
Belong to The Neutrosophic SuperHyperGraph Mentioned in the Definition (29.0.23) 269

34.1 The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges

Belong to The Neutrosophic SuperHyperBipartite . . . . . . . . . . . . . . . . . . 340

35.1 The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges

Belong to The Neutrosophic SuperHyperMultipartite . . . . . . . . . . . . . . . . . 342

37.1 An Overlook On This Research And Beyond . . . . . . . . . . . . . . . . . . . . . 346

xi
 CHAPTER 1

ABSTRACT

In this scientific research book, there are some scientific research chapters on “Extreme 1
Hamiltonian-Type-Cycle-Cut In SuperHyperGraphs” and “Neutrosophic Hamiltonian-Type- 2

Cycle-Cut In SuperHyperGraphs” about some scientific research on Hamiltonian-Type-Cycle-Cut 3

In SuperHyperGraphs by two (Extreme/Neutrosophic) notions, namely, Extreme Hamiltonian- 4
Type-Cycle-Cut In SuperHyperGraphs and Neutrosophic Hamiltonian-Type-Cycle-Cut In 5
SuperHyperGraphs. With scientific research on the basic scientific research properties, the 6
scientific research book starts to make Extreme Hamiltonian-Type-Cycle-Cut In SuperHyper- 7
Graphs theory and Neutrosophic Hamiltonian-Type-Cycle-Cut In SuperHyperGraphs theory 8

more (Extremely/Neutrosophicly) understandable. 9

10
In the some chapters, in some researches, new setting is introduced for new SuperHyper- 11
Notions, namely, a Hamiltonian-Type-Cycle-Cut In SuperHyperGraphs and Neutrosophic 12
Hamiltonian-Type-Cycle-Cut In SuperHyperGraphs . Two different types of SuperHyperDefini- 13
tions are debut for them but the scientific research goes further and the SuperHyperNotion, 14

SuperHyperUniform, and SuperHyperClass based on that are well-defined and well-reviewed. 15

The literature review is implemented in the whole of this research. For shining the elegancy 16
and the significancy of this research, the comparison between this SuperHyperNotion with 17
other SuperHyperNotions and fundamental SuperHyperNumbers are featured. The definitions 18
are followed by the examples and the instances thus the clarifications are driven with different 19
tools. The applications are figured out to make sense about the theoretical aspect of this 20

ongoing research. The “Cancer’s Recognition” are the under scientific research to figure 21
out the challenges make sense about ongoing and upcoming research. The special case is 22
up. The cells are viewed in the deemed ways. There are different types of them. Some of 23
them are individuals and some of them are well-modeled by the group of cells. These types 24
are all officially called “SuperHyperVertex” but the relations amid them all officially called 25
“SuperHyperEdge”. The frameworks “SuperHyperGraph” and “Neutrosophic SuperHyper- 26

Graph” are chosen and elected to scientific research about “Cancer’s Recognition”. Thus 27
these complex and dense SuperHyperModels open up some avenues to scientific research 28
on theoretical segments and “Cancer’s Recognition”. Some avenues are posed to pursue 29
this research. It’s also officially collected in the form of some questions and some problems. 30
Assume a SuperHyperGraph. Then δ−Hamiltonian-Type-Cycle-Cut In SuperHyperGraphs 31
is a maximal of SuperHyperVertices with a maximum cardinality such that either of the 32

following expressions hold for the (Neutrosophic) cardinalities of SuperHyperNeighbors of s ∈ S : 33

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

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

and |S ∩ N (s)|N eutrosophic < |S ∩ (V \ N (s))|N eutrosophic + δ. The first Expression, holds 40
if S is a Neutrosophic δ−SuperHyperOffensive. And the second Expression, holds if S is 41
a Neutrosophic δ−SuperHyperDefensive It’s useful to define a “Neutrosophic” version of a 42
Hamiltonian-Type-Cycle-Cut In SuperHyperGraphs . Since there’s more ways to get type-results 43
to make a Hamiltonian-Type-Cycle-Cut In SuperHyperGraphs more understandable. For the 44
sake of having Neutrosophic Hamiltonian-Type-Cycle-Cut In SuperHyperGraphs, there’s a 45

need to “redefine” the notion of a “Hamiltonian-Type-Cycle-Cut In SuperHyperGraphs ”. The 46

SuperHyperVertices and the SuperHyperEdges are assigned by the labels from the letters of the 47
alphabets. In this procedure, there’s the usage of the position of labels to assign to the values. 48
Assume a Hamiltonian-Type-Cycle-Cut In SuperHyperGraphs . It’s redefined a Neutrosophic 49
Hamiltonian-Type-Cycle-Cut In SuperHyperGraphs if the mentioned Table holds, concerning, 50
“The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges Belong 51

to The Neutrosophic SuperHyperGraph” with the key points, “The Values of The Vertices 52
& The Number of Position in Alphabet”, “The Values of The SuperVertices&The maximum 53
Values of Its Vertices”, “The Values of The Edges&The maximum Values of Its Vertices”, 54
“The Values of The HyperEdges&The maximum Values of Its Vertices”, “The Values of The 55
SuperHyperEdges&The maximum Values of Its Endpoints”. To get structural examples and 56
instances, I’m going to introduce the next SuperHyperClass of SuperHyperGraph based on a 57

Hamiltonian-Type-Cycle-Cut In SuperHyperGraphs . It’s the main. It’ll be disciplinary to 58

have the foundation of previous definition in the kind of SuperHyperClass. If there’s a need 59
to have all Hamiltonian-Type-Cycle-Cut In SuperHyperGraphs until the Hamiltonian-Type- 60
Cycle-Cut In SuperHyperGraphs, then it’s officially called a “Hamiltonian-Type-Cycle-Cut 61
In SuperHyperGraphs” but otherwise, it isn’t a Hamiltonian-Type-Cycle-Cut In SuperHyper- 62
Graphs . There are some instances about the clarifications for the main definition titled a 63

“Hamiltonian-Type-Cycle-Cut In SuperHyperGraphs ”. These two examples get more scrutiny 64

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

“Neutrosophic Hamiltonian-Type-Cycle-Cut In SuperHyperGraphs ”. The SuperHyperVertices 69

and the SuperHyperEdges are assigned by the labels from the letters of the alphabets. In 70
this procedure, there’s the usage of the position of labels to assign to the values. Assume 71
a Neutrosophic SuperHyperGraph. It’s redefined “Neutrosophic SuperHyperGraph” if the 72
intended Table holds. And a Hamiltonian-Type-Cycle-Cut In SuperHyperGraphs are redefined 73
to a “Neutrosophic Hamiltonian-Type-Cycle-Cut In SuperHyperGraphs” if the intended Table 74

holds. It’s useful to define “Neutrosophic” version of SuperHyperClasses. Since there’s more 75
ways to get Neutrosophic type-results to make a Neutrosophic Hamiltonian-Type-Cycle-Cut In 76
SuperHyperGraphs more understandable. Assume a Neutrosophic SuperHyperGraph. There 77
are some Neutrosophic SuperHyperClasses if the intended Table holds. Thus SuperHyperPath, 78
Hamiltonian-Type-Cycle-Cut In SuperHyperGraphs, SuperHyperStar, SuperHyperBipart- 79

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

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

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

amid the maximum value amid all SuperHyperVertices from a Hamiltonian-Type-Cycle-Cut 86

In SuperHyperGraphs .] Hamiltonian-Type-Cycle-Cut In SuperHyperGraphs . A graph is a 87
SuperHyperUniform if it’s a SuperHyperGraph and the number of elements of SuperHyperEdges 88
are the same. Assume a Neutrosophic SuperHyperGraph. There are some SuperHyperClasses as 89
follows. It’s SuperHyperPath if it’s only one SuperVertex as intersection amid two given Super- 90
HyperEdges with two exceptions; it’s Hamiltonian-Type-Cycle-Cut In SuperHyperGraphs if it’s 91

only one SuperVertex as intersection amid two given SuperHyperEdges; it’s SuperHyperStar it’s 92
only one SuperVertex as intersection amid all SuperHyperEdges; it’s SuperHyperBipartite it’s 93
only one SuperVertex as intersection amid two given SuperHyperEdges and these SuperVertices, 94
forming two separate sets, has no SuperHyperEdge in common; it’s SuperHyperMultiPartite it’s 95
only one SuperVertex as intersection amid two given SuperHyperEdges and these SuperVertices, 96
forming multi separate sets, has no SuperHyperEdge in common; it’s a SuperHyperWheel if it’s 97

only one SuperVertex as intersection amid two given SuperHyperEdges and one SuperVertex 98
has one SuperHyperEdge with any common SuperVertex. The SuperHyperModel proposes 99
the specific designs and the specific architectures. The SuperHyperModel is officially called 100
“SuperHyperGraph” and “Neutrosophic SuperHyperGraph”. In this SuperHyperModel, The 101
“specific” cells and “specific group” of cells are SuperHyperModeled as “SuperHyperVertices” 102
and the common and intended properties between “specific” cells and “specific group” of cells 103

are SuperHyperModeled as “SuperHyperEdges”. Sometimes, it’s useful to have some degrees of 104
determinacy, indeterminacy, and neutrality to have more precise SuperHyperModel which in this 105
case the SuperHyperModel is called “Neutrosophic”. In the future research, the foundation will 106
be based on the “Cancer’s Recognition” and the results and the definitions will be introduced 107
in redeemed ways. The recognition of the cancer in the long-term function. The specific region 108
has been assigned by the model [it’s called SuperHyperGraph] and the long cycle of the move 109

from the cancer is identified by this research. Sometimes the move of the cancer hasn’t be easily 110
identified since there are some determinacy, indeterminacy and neutrality about the moves and 111
the effects of the cancer on that region; this event leads us to choose another model [it’s said to be 112
Neutrosophic SuperHyperGraph] to have convenient perception on what’s happened and what’s 113
done. There are some specific models, which are well-known and they’ve got the names, and 114

some SuperHyperGeneral SuperHyperModels. The moves and the traces of the cancer on the 115
complex tracks and between complicated groups of cells could be fantasized by a Neutrosophic 116
SuperHyperPath(-/Hamiltonian-Type-Cycle-Cut In SuperHyperGraphs, SuperHyperStar, Supe- 117
rHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find either the 118
longest Hamiltonian-Type-Cycle-Cut In SuperHyperGraphs or the strongest Hamiltonian-Type- 119
Cycle-Cut In SuperHyperGraphs in those Neutrosophic SuperHyperModels. For the longest 120

Hamiltonian-Type-Cycle-Cut In SuperHyperGraphs, called Hamiltonian-Type-Cycle-Cut In 121

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

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

to form any style of a Hamiltonian-Type-Cycle-Cut In SuperHyperGraphs. There isn’t any 126

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

Graphs, Cancer’s Recognition 132

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

134
In the some chapters, in some researches, new setting is introduced for new SuperHyper- 135
Notion, namely, Neutrosophic Hamiltonian-Type-Cycle-Cut In SuperHyperGraphs . Two 136
different types of SuperHyperDefinitions are debut for them but the scientific research goes 137
further and the SuperHyperNotion, SuperHyperUniform, and SuperHyperClass based on that 138
are well-defined and well-reviewed. The literature review is implemented in the whole of this 139

research. For shining the elegancy and the significancy of this research, the comparison between 140
this SuperHyperNotion with other SuperHyperNotions and fundamental SuperHyperNum- 141
bers are featured. The definitions are followed by the examples and the instances thus the 142
clarifications are driven with different tools. The applications are figured out to make sense 143
about the theoretical aspect of this ongoing research. The “Cancer’s Neutrosophic Recognition” 144
are the under scientific research to figure out the challenges make sense about ongoing and 145

upcoming research. The special case is up. The cells are viewed in the deemed ways. There are 146
different types of them. Some of them are individuals and some of them are well-modeled by 147
the group of cells. These types are all officially called “SuperHyperVertex” but the relations 148
amid them all officially called “SuperHyperEdge”. The frameworks “SuperHyperGraph” and 149
“Neutrosophic SuperHyperGraph” are chosen and elected to scientific research about “Can- 150
cer’s Neutrosophic Recognition”. Thus these complex and dense SuperHyperModels open 151

up some avenues to scientific research on theoretical segments and “Cancer’s Neutrosophic 152
Recognition”. Some avenues are posed to pursue this research. It’s also officially collected 153
in the form of some questions and some problems. Assume a SuperHyperGraph. Then an 154
“δ−Hamiltonian-Type-Cycle-Cut In SuperHyperGraphs” is a maximal Hamiltonian-Type-Cycle- 155
Cut In SuperHyperGraphs of SuperHyperVertices with maximum cardinality such that either 156
of the following expressions hold for the (Neutrosophic) cardinalities of SuperHyperNeighbors 157

of s ∈ S : |S ∩ N (s)| > |S ∩ (V \ N (s))| + δ, |S ∩ N (s)| < |S ∩ (V \ N (s))| + δ. The first 158

Expression, holds if S is an “δ−SuperHyperOffensive”. And the second Expression, holds 159
if S is an “δ−SuperHyperDefensive”; a“Neutrosophic δ−Hamiltonian-Type-Cycle-Cut In 160
SuperHyperGraphs” is a maximal Neutrosophic Hamiltonian-Type-Cycle-Cut In SuperHyper- 161
Graphs of SuperHyperVertices with maximum Neutrosophic cardinality such that either of 162
the following expressions hold for the Neutrosophic cardinalities of SuperHyperNeighbors of 163

s ∈ S : |S ∩ N (s)|N eutrosophic > |S ∩ (V \ N (s))|N eutrosophic + δ, |S ∩ N (s)|N eutrosophic < 164

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

having Neutrosophic Hamiltonian-Type-Cycle-Cut In SuperHyperGraphs, there’s a need to 170

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

“redefine” the notion of “Hamiltonian-Type-Cycle-Cut In SuperHyperGraphs ”. The Super- 171

HyperVertices and the SuperHyperEdges are assigned by the labels from the letters of the 172
alphabets. In this procedure, there’s the usage of the position of labels to assign to the 173
values. Assume a Hamiltonian-Type-Cycle-Cut In SuperHyperGraphs . It’s redefined Neut- 174
rosophic Hamiltonian-Type-Cycle-Cut In SuperHyperGraphs if the mentioned Table holds, 175
concerning, “The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges 176

Belong to The Neutrosophic SuperHyperGraph” with the key points, “The Values of The 177
Vertices & The Number of Position in Alphabet”, “The Values of The SuperVertices&The 178
maximum Values of Its Vertices”, “The Values of The Edges&The maximum Values of Its 179
Vertices”, “The Values of The HyperEdges&The maximum Values of Its Vertices”, “The 180
Values of The SuperHyperEdges&The maximum Values of Its Endpoints”. To get structural 181
examples and instances, I’m going to introduce the next SuperHyperClass of SuperHyper- 182

Graph based on Hamiltonian-Type-Cycle-Cut In SuperHyperGraphs . It’s the main. It’ll 183

be disciplinary to have the foundation of previous definition in the kind of SuperHyperClass. 184
If there’s a need to have all Hamiltonian-Type-Cycle-Cut In SuperHyperGraphs until the 185
Hamiltonian-Type-Cycle-Cut In SuperHyperGraphs, then it’s officially called “Hamiltonian- 186
Type-Cycle-Cut In SuperHyperGraphs” but otherwise, it isn’t Hamiltonian-Type-Cycle-Cut In 187
SuperHyperGraphs . There are some instances about the clarifications for the main definition 188

titled “Hamiltonian-Type-Cycle-Cut In SuperHyperGraphs ”. These two examples get more 189

scrutiny and discernment since there are characterized in the disciplinary ways of the Supe- 190
rHyperClass based on Hamiltonian-Type-Cycle-Cut In SuperHyperGraphs . For the sake of 191
having Neutrosophic Hamiltonian-Type-Cycle-Cut In SuperHyperGraphs, there’s a need to 192
“redefine” the notion of “Neutrosophic Hamiltonian-Type-Cycle-Cut In SuperHyperGraphs” and 193
“Neutrosophic Hamiltonian-Type-Cycle-Cut In SuperHyperGraphs ”. The SuperHyperVertices 194

and the SuperHyperEdges are assigned by the labels from the letters of the alphabets. In 195
this procedure, there’s the usage of the position of labels to assign to the values. Assume 196
a Neutrosophic SuperHyperGraph. It’s redefined “Neutrosophic SuperHyperGraph” if the 197
intended Table holds. And Hamiltonian-Type-Cycle-Cut In SuperHyperGraphs are redefined 198
“Neutrosophic Hamiltonian-Type-Cycle-Cut In SuperHyperGraphs” if the intended Table 199
holds. It’s useful to define “Neutrosophic” version of SuperHyperClasses. Since there’s more 200

ways to get Neutrosophic type-results to make Neutrosophic Hamiltonian-Type-Cycle-Cut In 201

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

“Neutrosophic Hamiltonian-Type-Cycle-Cut In SuperHyperGraphs”, “Neutrosophic Super- 206

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

In SuperHyperGraphs .] Hamiltonian-Type-Cycle-Cut In SuperHyperGraphs . A graph is 212

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

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

only one SuperVertex as intersection amid two given SuperHyperEdges; it’s SuperHyperStar it’s 217
only one SuperVertex as intersection amid all SuperHyperEdges; it’s SuperHyperBipartite it’s 218
only one SuperVertex as intersection amid two given SuperHyperEdges and these SuperVertices, 219
forming two separate sets, has no SuperHyperEdge in common; it’s SuperHyperMultiPartite it’s 220
only one SuperVertex as intersection amid two given SuperHyperEdges and these SuperVertices, 221
forming multi separate sets, has no SuperHyperEdge in common; it’s SuperHyperWheel if it’s 222

only one SuperVertex as intersection amid two given SuperHyperEdges and one SuperVertex 223
has one SuperHyperEdge with any common SuperVertex. The SuperHyperModel proposes 224
the specific designs and the specific architectures. The SuperHyperModel is officially called 225
“SuperHyperGraph” and “Neutrosophic SuperHyperGraph”. In this SuperHyperModel, The 226
“specific” cells and “specific group” of cells are SuperHyperModeled as “SuperHyperVertices” 227
and the common and intended properties between “specific” cells and “specific group” of 228

cells are SuperHyperModeled as “SuperHyperEdges”. Sometimes, it’s useful to have some 229
degrees of determinacy, indeterminacy, and neutrality to have more precise SuperHyperModel 230
which in this case the SuperHyperModel is called “Neutrosophic”. In the future research, 231
the foundation will be based on the “Cancer’s Neutrosophic Recognition” and the results 232
and the definitions will be introduced in redeemed ways. The Neutrosophic recognition of 233
the cancer in the long-term function. The specific region has been assigned by the model 234

[it’s called SuperHyperGraph] and the long cycle of the move from the cancer is identified 235
by this research. Sometimes the move of the cancer hasn’t be easily identified since there 236
are some determinacy, indeterminacy and neutrality about the moves and the effects of the 237
cancer on that region; this event leads us to choose another model [it’s said to be Neutro- 238
sophic SuperHyperGraph] to have convenient perception on what’s happened and what’s 239
done. There are some specific models, which are well-known and they’ve got the names, and 240

some SuperHyperGeneral SuperHyperModels. The moves and the traces of the cancer on the 241
complex tracks and between complicated groups of cells could be fantasized by a Neutrosophic 242
SuperHyperPath(-/Hamiltonian-Type-Cycle-Cut In SuperHyperGraphs, SuperHyperStar, Supe- 243
rHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find either the 244
longest Hamiltonian-Type-Cycle-Cut In SuperHyperGraphs or the strongest Hamiltonian-Type- 245
Cycle-Cut In SuperHyperGraphs in those Neutrosophic SuperHyperModels. For the longest 246

Hamiltonian-Type-Cycle-Cut In SuperHyperGraphs, called Hamiltonian-Type-Cycle-Cut In 247

SuperHyperGraphs, and the strongest Hamiltonian-Type-Cycle-Cut In SuperHyperGraphs, 248
called Neutrosophic Hamiltonian-Type-Cycle-Cut In SuperHyperGraphs, some general results 249
are introduced. Beyond that in SuperHyperStar, all possible SuperHyperPaths have only two 250
SuperHyperEdges but it’s not enough since it’s essential to have at least three SuperHyperEdges 251

to form any style of a Hamiltonian-Type-Cycle-Cut In SuperHyperGraphs. There isn’t any 252

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

SuperHyperGraphs, Cancer’s Neutrosophic Recognition 258

AMS Subject Classification: 05C17, 05C22, 05E45 259
260

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

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

as book in the following by Henry Garrett (2022) which is indexed by Google Scholar and has 262
more than 3181 readers in Scribd. It’s titled “Beyond Neutrosophic Graphs” and published by 263
Ohio: E-publishing: Educational Publisher 1091 West 1st Ave Grandview Heights, Ohio 43212 264
United State. This research book covers different types of notions and settings in neutrosophic 265
graph theory and neutrosophic SuperHyperGraph theory. 266

267
268
[Ref] Henry Garrett, (2022). “Beyond Neutrosophic Graphs”, Ohio: E-publishing: Edu- 269
cational Publisher 1091 West 1st Ave Grandview Heights, Ohio 43212 United States. ISBN: 270
978-1-59973-725-6 (http://fs.unm.edu/BeyondNeutrosophicGraphs.pdf). 271
[Ref] Henry Garrett, (2022). “Beyond Neutrosophic Graphs”, Ohio: E-publishing: Educational 272

Publisher 1091 West 1st Ave Grandview Heights, Ohio 43212 United States. ISBN: 978-1-59973- 273
725-6 (http://fs.unm.edu/BeyondNeutrosophicGraphs.pdf). 274
275
Also, some scientific studies and scientific researches about neutrosophic graphs, are pro- 276
posed as book in the following by Henry Garrett (2022) which is indexed by Google Scholar 277
and has more than 4060 readers in Scribd. It’s titled “Neutrosophic Duality” and published by 278

Florida: GLOBAL KNOWLEDGE - Publishing House 848 Brickell Ave Ste 950 Miami, Florida 279
33131 United States. This research book presents different types of notions SuperHyperResolving 280
and Hamiltonian-Type-Cycle-Cut In SuperHyperGraphs in the setting of duality in neutrosophic 281
graph theory and neutrosophic SuperHyperGraph theory. This research book has scrutiny on 282
the complement of the intended set and the intended set, simultaneously. It’s smart to consider 283
a set but acting on its complement that what’s done in this research book which is popular in 284

the terms of high readers in Scribd. 285

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

[Ref] Henry Garrett, (2022). “Neutrosophic Duality”, Florida: GLOBAL KNOWLEDGE 286

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

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 CHAPTER 2 292

Background 293

There are some scientific researches covering the topic of this research. In what follows, there 294
are some discussion and literature reviews about them. 295

The seminal paper and groundbreaking article is titled “neutrosophic co-degree and neutrosophic 296
degree alongside chromatic numbers in the setting of some classes related to neutrosophic 297
hypergraphs” in Ref. [HG1] by Henry Garrett (2022). In this research article, a novel approach 298
is implemented on SuperHyperGraph and neutrosophic SuperHyperGraph based on general 299
forms without using neutrosophic classes of neutrosophic SuperHyperGraph. It’s published in 300
prestigious and fancy journal is entitled “Journal of Current Trends in Computer Science Re- 301

search (JCTCSR)” with ISO abbreviation “J Curr Trends Comp Sci Res” in volume 1 and issue 302
1 with pages 06-14. The research article studies deeply with choosing neutrosophic hypergraphs 303
instead of neutrosophic SuperHyperGraph. It’s the breakthrough toward independent results 304
based on initial background. 305
The seminal paper and groundbreaking article is titled “Super Hyper Dominating and Super Hy- 306
per Resolving on Neutrosophic Super Hyper Graphs and Their Directions in Game Theory and 307

Neutrosophic Super Hyper Classes” in Ref. [HG2] by Henry Garrett (2022). In this research 308
article, a novel approach is implemented on SuperHyperGraph and neutrosophic SuperHyper- 309
Graph based on fundamental SuperHyperNumber and using neutrosophic SuperHyperClasses 310
of neutrosophic SuperHyperGraph. It’s published in prestigious and fancy journal is entitled 311
“Journal of Mathematical Techniques and Computational Mathematics(JMTCM)” with ISO 312
abbreviation “J Math Techniques Comput Math” in volume 1 and issue 3 with pages 242-263. 313

The research article studies deeply with choosing directly neutrosophic SuperHyperGraph 314
and SuperHyperGraph. It’s the breakthrough toward independent results based on initial 315
background and fundamental SuperHyperNumbers. 316
The seminal paper and groundbreaking article is titled “Some Super Hyper Degrees and 317
Co-Super Hyper Degrees on Neutrosophic Super Hyper Graphs And Super Hyper Graphs 318
Alongside Applications in Cancer’s Treatments” in Ref. [HG3] by Henry Garrett (2023). In 319

this research article, a novel approach is implemented on SuperHyperGraph and neutrosophic 320
SuperHyperGraph based on fundamental notions and using vital tools in Cancer’s Treatments. 321
It’s published in prestigious and fancy journal is entitled “Journal of Mathematical Techniques 322
and Computational Mathematics(JMTCM)” with ISO abbreviation “J Math Techniques Com- 323
put Math” in volume 2 and issue 1 with pages 35-47. The research article studies deeply with 324
choosing directly neutrosophic SuperHyperGraph and SuperHyperGraph. It’s the breakthrough 325

toward independent results based on initial background and fundamental SuperHyperNumbers. 326

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

In some articles are titled “0039 | Closing Numbers and Super-Closing Numbers as 327
(Dual)Resolving and (Dual)Coloring alongside (Dual)Dominating in (Neutrosophic)n- 328
SuperHyperGraph” in Ref. [HG4] by Henry Garrett (2022), “0049 | (Failed)1-Zero-Forcing 329
Number in Neutrosophic Graphs” in Ref. [HG5] by Henry Garrett (2022), “Extreme SuperHy- 330
perClique as the Firm Scheme of Confrontation under Cancer’s Recognition as the Model in 331
The Setting of (Neutrosophic) SuperHyperGraphs” in Ref. [HG6] by Henry Garrett (2022), 332

“Uncertainty On The Act And Effect Of Cancer Alongside The Foggy Positions Of Cells Toward 333
Neutrosophic Failed SuperHyperClique inside Neutrosophic SuperHyperGraphs Titled Cancer’s 334
Recognition” in Ref. [HG7] by Henry Garrett (2022), “Neutrosophic Version Of Separates 335
Groups Of Cells In Cancer’s Recognition On Neutrosophic SuperHyperGraphs” in Ref. [HG8] 336
by Henry Garrett (2022), “The Shift Paradigm To Classify Separately The Cells and Affected 337
Cells Toward The Totality Under Cancer’s Recognition By New Multiple Definitions On the 338

Sets Polynomials Alongside Numbers In The (Neutrosophic) SuperHyperMatching Theory 339

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

on Uncertainty to All Modes in Neutrosophic SuperHyperGraphs” in Ref. [HG11] by Henry 345

Garrett (2022), “Extremism of the Attacked Body Under the Cancer’s Circumstances Where 346
Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs” in Ref. [HG12] by Henry 347
Garrett (2022), “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Recognitions And 348
(Neutrosophic) SuperHyperGraphs” in Ref. [HG13] by Henry Garrett (2022), “Neutrosophic 349
Messy-Style SuperHyperGraphs To Form Neutrosophic SuperHyperStable To Act on Cancer’s 350

Neutrosophic Recognitions In Special ViewPoints” in Ref. [HG14] by Henry Garrett (2022), 351
“Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To Use Neutrosophic 352
SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond” in Ref. [HG15] 353
by Henry Garrett (2022), “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by 354
Well- SuperHyperModelled (Neutrosophic) SuperHyperGraphs ” in Ref. [HG16] by Henry 355
Garrett (2022), “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic Su- 356

perHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints” in 357

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

Recognitions In Special ViewPoints” in Ref. [HG18] by Henry Garrett (2022),“(Neutrosophic) 362

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

Garrett (2022), “SuperHyperGirth on SuperHyperGraph and Neutrosophic SuperHyperGraph 368

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

Henry Garrett · 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 Their Directions in Game Theory and Neutrosophic SuperHyperClasses” 373
in Ref. [HG23] by Henry Garrett (2022), “SuperHyperMatching By (R-)Definitions And 374
Polynomials To Monitor Cancer’s Recognition In Neutrosophic SuperHyperGraphs” in Ref. 375
[HG24] by Henry Garrett (2023), “The Focus on The Partitions Obtained By Parallel Moves 376
In The Cancer’s Extreme Recognition With Different Types of Extreme SuperHyperMatching 377
Set and Polynomial on (Neutrosophic) SuperHyperGraphs” in Ref. [HG25] by Henry Garrett 378

(2023), “Extreme Failed SuperHyperClique Decides the Failures on the Cancer’s Recognition 379
in the Perfect Connections of Cancer’s Attacks By SuperHyperModels Named (Neutrosophic) 380
SuperHyperGraphs” in Ref. [HG26] by Henry Garrett (2023), “Indeterminacy On The All 381
Possible Connections of Cells In Front of Cancer’s Attacks In The Terms of Neutrosophic 382
Failed SuperHyperClique on Cancer’s Recognition called Neutrosophic SuperHyperGraphs” 383
in Ref. [HG27] by Henry Garrett (2023), “Perfect Directions Toward Idealism in Can- 384

cer’s Neutrosophic Recognition Forwarding Neutrosophic SuperHyperClique on Neutrosophic 385

SuperHyperGraphs” in Ref. [HG28] by Henry Garrett (2023), “Demonstrating Complete 386
Connections in Every Embedded Regions and Sub-Regions in the Terms of Cancer’s Recognition 387
and (Neutrosophic) SuperHyperGraphs With (Neutrosophic) SuperHyperClique” in Ref. 388
[HG29] by Henry Garrett (2023), “Different Neutrosophic Types of Neutrosophic Regions 389
titled neutrosophic Failed SuperHyperStable in Cancer’s Neutrosophic Recognition modeled 390

in the Form of Neutrosophic SuperHyperGraphs” in Ref. [HG30] by Henry Garrett (2023), 391
“Using the Tool As (Neutrosophic) Failed SuperHyperStable To SuperHyperModel Cancer’s 392
Recognition Titled (Neutrosophic) SuperHyperGraphs” in Ref. [HG31] by Henry Garrett 393
(2023), “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic SuperHyperStable 394
To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints” in Ref. [HG32] 395
by Henry Garrett (2023), “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by 396

Well-SuperHyperModelled (Neutrosophic) SuperHyperGraphs” in Ref. [HG33] by Henry 397

Garrett (2023), “Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To Use 398
Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond” in Ref. 399
[HG34] by Henry Garrett (2022), “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s 400
Recognitions And (Neutrosophic) SuperHyperGraphs” in Ref. [HG35] by Henry Garrett 401
(2022), “Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic) SuperHyper- 402

Modeling in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs” in Ref. [HG36] 403

by Henry Garrett (2022), “Basic Neutrosophic Notions Concerning SuperHyperDominating and 404
Neutrosophic SuperHyperResolving in SuperHyperGraph” in Ref. [HG37] by Henry Garrett 405
(2022), “Initial Material of Neutrosophic Preliminaries to Study Some Neutrosophic Notions 406
Based on Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic SuperHyperGraph (NSHG)” 407

in Ref. [HG38] by Henry Garrett (2022), and [HG4; HG5; HG6; HG7; HG8; HG9; 408
HG10; HG11; HG12; HG13; HG14; HG15; HG16; HG17; HG18; HG19; HG20; 409
HG21; HG22; HG23; HG24; HG25; HG26; HG27; HG28; HG29; HG30; HG31; 410
HG32; HG33; HG34; HG35; HG36; HG37; HG38; HG94; HG942; HG95; HG952; 411
HG96; HG962; HG97; HG972; HG98; HG982; HG106; HG107; HG111; HG112; 412
HG115; HG116; HG120; HG121; HG122; HG123; HG124; HG125; HG126; HG127; 413

HG128; HG129; HG130; HG131; HG132; HG134; HG135; HG136; HG137; HG138; 414
HG139; HG140; HG141; HG142; HG143; HG144; HG145; HG146; HG147; HG148; 415
HG149; HG150; HG151; HG152; HG153; HG154; HG155; HG156; HG157; HG158; 416
HG159; HG160; HG161; HG162; HG163; HG164; HG165; HG166; HG167; HG168; 417
HG169; HG170; HG171; HG172; HG173; HG174; HG175; HG176; HG177; HG178; 418

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

HG179; HG180; HG181; HG182; HG183; HG184; HG185; HG186; HG187; HG188; 419
HG189; HG190; HG191; HG192; HG193; HG194; HG195; HG196; HG197; HG198; 420
HG199; HG200; HG201; HG202; HG203; HG204; HG205; HG206; HG207; HG208; 421
HG209; HG210; HG211; HG212; HG213; HG214; HG215; HG216; HG217; HG218; 422
HG219; HG220; HG221; HG222; HG223; HG224; HG225; HG226; HG228; HG230; 423
HG231; HG232; HG233; HG234; HG235; HG236], there are some endeavors to formalize 424

the basic SuperHyperNotions about neutrosophic SuperHyperGraph and SuperHyperGraph 425

alongside scientific research books at [HG60b; HG61b; HG62b; HG63b; HG64b; HG65b; 426
HG66b; HG67b; HG68b; HG69b; HG70b; HG71b; HG72b; HG73b; HG74b; HG75b; 427
HG76b; HG77b; HG78b; HG79b; HG80b; HG81b; HG82b; HG83b; HG84b; HG85b; 428
HG86b; HG87b; HG88b; HG89b; HG90b; HG91b; HG92b; HG93b; HG94b; HG95b; 429
HG96b; HG97b; HG98b; HG99b; HG100b; HG101b; HG102b; HG103b; HG104b; 430

HG105b; HG106b; HG107b; HG108b; HG109b; HG110b; HG111b; HG112b; 431

HG113b; HG114b; HG115b; HG116b; HG117b; HG118b; HG119b; HG120b; 432
HG121b; HG122b; HG123b; HG124b; HG125b; HG126b; HG127b; HG128b; 433
HG129b; HG130b; HG131b; HG132b; HG133b; HG134b; HG135b; HG136b; 434
HG137b; HG138b; HG139b; HG140b; HG141b; HG142b; HG143b; HG144b; 435
HG145b; HG146b; HG147b; HG148b; HG149b; HG150b; HG151b; HG152b; 436

HG153b; HG154b; HG155b]. Two popular scientific research books in Scribd in the 437
terms of high readers, 4190 and 5189 respectively, on neutrosophic science is on [HG32b; 438
HG44b]. 439
Some scientific studies and scientific researches about neutrosophic graphs, are proposed as 440
book in Ref. [HG71b] by Henry Garrett (2023) which is indexed by Google Scholar and has 441
more than 4216 readers in Scribd. It’s titled “Beyond Neutrosophic Graphs” and published 442

by Dr. Henry Garrett. This research book covers different types of notions and settings in 443
neutrosophic graph theory and neutrosophic SuperHyperGraph theory. 444
Also, some scientific studies and scientific researches about neutrosophic graphs, are proposed 445
as book in Ref. [HG70b] by Henry Garrett (2023) which is indexed by Google Scholar and 446
has more than 5214 readers in Scribd. It’s titled “Neutrosophic Duality” and published by Dr. 447
Henry Garrett. This research book presents different types of notions SuperHyperResolving and 448

SuperHyperDominating in the setting of duality in neutrosophic graph theory and neutrosophic 449
SuperHyperGraph theory. This research book has scrutiny on the complement of the intended 450
set and the intended set, simultaneously. It’s smart to consider a set but acting on its 451
complement that what’s done in this research book which is popular in the terms of high readers 452
in Scribd. 453

See the seminal scientific researches [HG1; HG2; HG3]. The formalization of the notions 454
on the framework of notions in SuperHyperGraphs, Neutrosophic notions in SuperHyper- 455
Graphs theory, and (Neutrosophic) SuperHyperGraphs theory at [HG4; HG5; HG6; HG7; 456
HG8; HG9; HG10; HG11; HG12; HG13; HG14; HG15; HG16; HG17; HG18; HG19; 457
HG20; HG21; HG22; HG23; HG24; HG25; HG26; HG27; HG28; HG29; HG30; 458
HG31; HG32; HG33; HG34; HG35; HG36; HG37; HG38; HG94; HG942; HG95; 459

HG952; HG96; HG962; HG97; HG972; HG98; HG982; HG106; HG107; HG111; 460
HG112; HG115; HG116; HG120; HG121; HG122; HG123; HG124; HG125; HG126; 461
HG127; HG128; HG129; HG130; HG131; HG132; HG134; HG135; HG136; HG137; 462
HG138; HG139; HG140; HG141; HG142; HG143; HG144; HG145; HG146; HG147; 463
HG148; HG149; HG150; HG151; HG152; HG153; HG154; HG155; HG156; HG157; 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

HG158; HG159; HG160; HG161; HG162; HG163; HG164; HG165; HG166; HG167; 465
HG168; HG169; HG170; HG171; HG172; HG173; HG174; HG175; HG176; HG177; 466
HG178; HG179; HG180; HG181; HG182; HG183; HG184; HG185; HG186; HG187; 467
HG188; HG189; HG190; HG191; HG192; HG193; HG194; HG195; HG196; HG197; 468
HG198; HG199; HG200; HG201; HG202; HG203; HG204; HG205; HG206; HG207; 469
HG208; HG209; HG210; HG211; HG212; HG213; HG214; HG215; HG216; HG217; 470

HG218; HG219; HG220; HG221; HG222; HG223; HG224; HG225; HG226; HG228; 471
HG230; HG231; HG232; HG233; HG234; HG235; HG236] alongside scientific re- 472
search books at [HG60b; HG61b; HG62b; HG63b; HG64b; HG65b; HG66b; HG67b; 473
HG68b; HG69b; HG70b; HG71b; HG72b; HG73b; HG74b; HG75b; HG76b; HG77b; 474
HG78b; HG79b; HG80b; HG81b; HG82b; HG83b; HG84b; HG85b; HG86b; HG87b; 475
HG88b; HG89b; HG90b; HG91b; HG92b; HG93b; HG94b; HG95b; HG96b; HG97b; 476

HG98b; HG99b; HG100b; HG101b; HG102b; HG103b; HG104b; HG105b; HG106b; 477
HG107b; HG108b; HG109b; HG110b; HG111b; HG112b; HG113b; HG114b; 478
HG115b; HG116b; HG117b; HG118b; HG119b; HG120b; HG121b; HG122b; 479
HG123b; HG124b; HG125b; HG126b; HG127b; HG128b; HG129b; HG130b; 480
HG131b; HG132b; HG133b; HG134b; HG135b; HG136b; HG137b; HG138b; 481
HG139b; HG140b; HG141b; HG142b; HG143b; HG144b; HG145b; HG146b; 482

HG147b; HG148b; HG149b; HG150b; HG151b; HG152b; HG153b; HG154b; 483

HG155b]. Two popular scientific research books in Scribd in the terms of high readers, 484
4216 and 5214 respectively, on neutrosophic science is on [HG32b; HG44b]. 485

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 Bibliography 486

HG1 [1] Henry Garrett, “Neutrosophic Co-degree and Neutrosophic Degree alongside Chromatic 487

Numbers in the Setting of Some Classes Related to Neutrosophic Hypergraphs”, J Curr 488
Trends Comp Sci Res 1(1) (2022) 06-14. 489

HG2 [2] Henry Garrett, “Super Hyper Dominating and Super Hyper Resolving on Neutro- 490

sophic Super Hyper Graphs and Their Directions in Game Theory and Neutrosophic 491
Super Hyper Classes”, J Math Techniques Comput Math 1(3) (2022) 242-263. (doi: 492
10.33140/JMTCM.01.03.09) 493

HG3 [3] Henry Garrett, “Some Super Hyper Degrees and Co-Super Hyper Degrees on Neut- 494
rosophic Super Hyper Graphs And Super Hyper Graphs Alongside Applications 495
in Cancer’s Treatments”, J Math Techniques Comput Math 2(1) (2023) 35-47. 496
(https://www.opastpublishers.com/open-access-articles/some-super-hyper-degrees-and- 497
cosuper-hyper-degrees-on-neutrosophic-super-hyper-graphs-and-super-hyper-graphs- 498

alongside-a.pdf) 499

HG216 [4] Henry Garrett, “A Research on Cancers Recognition and Neutrosophic Super 500
Hypergraph by Eulerian Super Hyper Cycles and Hamiltonian Sets as Hyper Cov- 501

ering Versus Super separations”, J Math Techniques Comput Math 2(3) (2023) 502
136-148. (https://www.opastpublishers.com/open-access-articles/a-research-on-cancers- 503
recognition-and-neutrosophic-super-hypergraph-by-eulerian-super-hyper-cycles-and- 504
hamiltonian-sets-.pdf) 505

HG4 [5] Garrett, Henry. “0039 | Closing Numbers and Super-Closing Numbers as (Dual)Resolving 506
and (Dual)Coloring alongside (Dual)Dominating in (Neutrosophic)n-SuperHyperGraph.” 507
CERN European Organization for Nuclear Research - Zenodo, Nov. 2022. CERN 508
European Organization for Nuclear Research, https://doi.org/10.5281/zenodo.6319942. 509
https://oa.mg/work/10.5281/zenodo.6319942 510

HG5 [6] Garrett, Henry. “0049 | (Failed)1-Zero-Forcing Number in Neutrosophic Graphs.” 511
CERN European Organization for Nuclear Research - Zenodo, Feb. 2022. CERN 512
European Organization for Nuclear Research, https://doi.org/10.13140/rg.2.2.35241.26724. 513

https://oa.mg/work/10.13140/rg.2.2.35241.26724 514

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

HG6 [7] Henry Garrett, “Extreme SuperHyperClique as the Firm Scheme of Confrontation under 515
Cancer’s Recognition as the Model in The Setting of (Neutrosophic) SuperHyperGraphs”, 516
Preprints 2023, 2023010308 (doi: 10.20944/preprints202301.0308.v1). 517

HG7 [8] Henry Garrett, “Uncertainty On The Act And Effect Of Cancer Alongside The Foggy 518
Positions Of Cells Toward Neutrosophic Failed SuperHyperClique inside Neutrosophic 519
SuperHyperGraphs Titled Cancer’s Recognition”, Preprints 2023, 2023010282 (doi: 520
10.20944/preprints202301.0282.v1). 521

HG8 [9] Henry Garrett, “Neutrosophic Version Of Separates Groups Of Cells In Cancer’s 522
Recognition On Neutrosophic SuperHyperGraphs”, Preprints 2023, 2023010267 (doi: 523
10.20944/preprints202301.0267.v1). 524

HG9 [10] Henry Garrett, “The Shift Paradigm To Classify Separately The Cells and Affected Cells 525
Toward The Totality Under Cancer’s Recognition By New Multiple Definitions On the Sets 526
Polynomials Alongside Numbers In The (Neutrosophic) SuperHyperMatching Theory Based 527

on SuperHyperGraph and Neutrosophic SuperHyperGraph”, Preprints 2023, 2023010265 528

(doi: 10.20944/preprints202301.0265.v1). 529

HG10 [11] Henry Garrett, “Breaking the Continuity and Uniformity of Cancer In The Worst Case of 530

Full Connections With Extreme Failed SuperHyperClique In Cancer’s Recognition Applied 531
in (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010262,(doi: 10.20944/pre- 532
prints202301.0262.v1). 533

HG11 [12] Henry Garrett, “Neutrosophic Failed SuperHyperStable as the Survivors on the Cancer’s 534
Neutrosophic Recognition Based on Uncertainty to All Modes in Neutrosophic SuperHy- 535
perGraphs”, Preprints 2023, 2023010240 (doi: 10.20944/preprints202301.0240.v1). 536

HG12 [13] Henry Garrett, “Extremism of the Attacked Body Under the Cancer’s Circumstances 537
Where Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 538
2023010224, (doi: 10.20944/preprints202301.0224.v1). 539

HG13 [14] Henry Garrett, “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Recognitions 540
And (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010105 (doi: 10.20944/pre- 541
prints202301.0105.v1). 542

HG14 [15] Henry Garrett, “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic 543
SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints”, 544
Preprints 2023, 2023010088 (doi: 10.20944/preprints202301.0088.v1). 545

HG15 [16] Henry Garrett, “Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To 546
Use Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond”, 547
Preprints 2023, 2023010044 548

HG16 [17] Henry Garrett, “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well- 549
SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010043 (doi: 550
10.20944/preprints202301.0043.v1). 551

HG17 [18] Henry Garrett, “Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic) 552
SuperHyperModeling in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs”, 553

Preprints 2023, 2023010105 (doi: 10.20944/preprints202301.0105.v1). 554

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

HG18 [19] Henry Garrett, “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic 555
SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints”, 556
Preprints 2023, 2023010088 (doi: 10.20944/preprints202301.0088.v1). 557

HG19 [20] Henry Garrett, “(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions Featuring 558
(Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, Preprints 2022, 2022120549 559

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

HG20 [21] Henry Garrett, “(Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and 561
SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With 562
(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions And Related (Neutrosophic) 563
SuperHyperClasses”, Preprints 2022, 2022120540 (doi: 10.20944/preprints202212.0540.v1). 564

HG21 [22] Henry Garrett, “SuperHyperGirth on SuperHyperGraph and Neutrosophic SuperHyper- 565
Graph With SuperHyperModeling of Cancer’s Recognitions”, Preprints 2022, 2022120500 566
(doi: 10.20944/preprints202212.0500.v1). 567

HG22 [23] Henry Garrett, “Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic 568
SuperHyperGraphs and SuperHyperGraphs Alongside Applications in Cancer’s Treatments”, 569
Preprints 2022, 2022120324 (doi: 10.20944/preprints202212.0324.v1). 570

HG23 [24] Henry Garrett, “SuperHyperDominating and SuperHyperResolving on Neutrosophic Super- 571
HyperGraphs And Their Directions in Game Theory and Neutrosophic SuperHyperClasses”, 572
Preprints 2022, 2022110576 (doi: 10.20944/preprints202211.0576.v1). 573

HG236 [25] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph 574
By Hamiltonian-Type-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 575

2023, (doi: 10.5281/zenodo.7806767). 576

HG235 [26] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Hamiltonian-Type- 577
Cycle-Neighbor In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 578
2023, (doi: 10.5281/zenodo.7806838). 579

HG234 [27] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph 580

By Hamiltonian-Type-Cycle-Decomposition As Hyper Decompress On Super Decompens- 581

ation”, Zenodo 2023, (doi: 10.5281/zenodo.7804238). 582

HG233 [28] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of 583
Hamiltonian-Type-Cycle-Decomposition In Cancer’s Recognition With (Neutrosophic) 584
SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zenodo.7804228). 585

HG232 [29] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph 586
By Hamiltonian-Type-Cycle-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, 587
(doi: 10.5281/zenodo.7799902). 588

HG231 [30] Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Type- 589
Cycle-Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 590

2023, (doi: 10.5281/zenodo.7804218). 591

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

HG230 [31] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph 592
By Hamiltonian-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, 593
(doi: 10.5281/zenodo.7796334). 594

HG228 [32] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph 595
By Hamiltonian-Cycle-Decomposition As Hyper Decompress On Super Decompensation”, 596
Zenodo 2023, (doi: 10.5281/zenodo.7793372). 597

HG226 [33] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph 598
By Hamiltonian-Cycle-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi: 599
10.5281/zenodo.7791952). 600

HG225 [34] Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Cycle- 601
Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, 602
(doi: 10.5281/zenodo.7791982). 603

HG224 [35] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph 604
By Hamiltonian-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 605
10.5281/zenodo.7790026). 606

HG223 [36] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Hamiltonian- 607
Neighbor In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 608
2023, (doi: 10.5281/zenodo.7790052). 609

HG222 [37] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph 610
By Hamiltonian-Decomposition As Hyper Decompress On Super Decompensation”, Zenodo 611
2023, (doi: 10.5281/zenodo.7787066). 612

HG221 [38] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of 613
Hamiltonian-Decomposition In Recognition of Cancer With (Neutrosophic) SuperHyper- 614
Graph”, Zenodo 2023, (doi: 10.5281/zenodo.7787094). 615

HG220 [39] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph 616
By Hamiltonian-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi: 617
10.5281/zenodo.7781476). 618

HG219 [40] Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Cut 619
In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 620
10.5281/zenodo.7783082). 621

HG218 [41] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph 622
By Trace-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 623
10.5281/zenodo.7777857). 624

HG217 [42] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Trace-Neighbor 625
In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 626
10.5281/zenodo.7779286). 627

HG215 [43] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 628
By Trace-Decomposition As Hyper Decompress On Super Decompensation”, Zenodo 2023, 629

(doi: 10.5281/zenodo.7771831). 630

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

HG214 [44] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of Trace- 631
Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 632
2023, (doi: 10.5281/zenodo.7772468). 633

HG213 [45] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 634
By Trace-Cut As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 635
10.13140/RG.2.2.20913.25446). 636

HG212 [46] Henry Garrett, “New Ideas On Super Tract By Hyper Track Of Trace-Cut In 637
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 638
10.5281/zenodo.7764916). 639

HG211 [47] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 640
By Edge-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 641
10.13140/RG.2.2.11770.98247). 642

HG210 [48] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Edge-Neighbor In 643
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 644
10.13140/RG.2.2.12400.12808). 645

HG209 [49] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 646
By Edge-Decomposition As Hyper Decompress On Super Decompensation”, ResearchGate 647
2023, (doi: 10.13140/RG.2.2.22545.10089). 648

HG208 [50] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of 649
Edge-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 650
ResearchGate 2023, (doi: 10.13140/RG.2.2.29544.34564). 651

HG207 [51] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyper- 652
Graph By Edge-Cut As Hyper Edify On Super Eddy”, ResearchGate 2023, (doi: 653
10.13140/RG.2.2.11377.76644). 654

HG206 [52] Henry Garrett, “New Ideas On Super Eddy By Hyper Edify Of Edge-Cut In Can- 655
cer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 656
10.13140/RG.2.2.23750.96329). 657

HG205 [53] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 658
By Vertex-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 659
10.13140/RG.2.2.31366.24641). 660

HG204 [54] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Vertex-Neighbor In 661
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 662
10.13140/RG.2.2.34721.68960). 663

HG203 [55] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyper- 664
Graph By Vertex-Decomposition As Hyper Decompress On Super Decompensation”, 665
ResearchGate 2023, (doi: 10.13140/RG.2.2.30212.81289). 666

HG202 [56] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of 667
Vertex-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 668

ResearchGate 2023, (doi: 10.13140/RG.2.2.18468.76169). 669

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

HG201 [57] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyper- 670
Graph By Vertex-Cut As Hyper Vertu On Super Vertigo”, ResearchGate 2023, (doi: 671
10.13140/RG.2.2.24288.35842). 672

HG200 [58] Henry Garrett, “New Ideas On Super Vertigo By Hyper Vertu Of Vertex-Cut In 673
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 674
10.13140/RG.2.2.32467.25124). 675

HG199 [59] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 676
By Stable-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 677
10.13140/RG.2.2.31025.45925). 678

HG198 [60] Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of Stable-Neighbor In 679
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 680
10.13140/RG.2.2.17184.25602). 681

HG197 [61] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 682
By Stable-Decompositions As Hyper Stain On Super Stagy”, ResearchGate 2023, (doi: 683
10.13140/RG.2.2.23423.28327). 684

HG196 [62] Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Decompositions In 685
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 686
10.13140/RG.2.2.28456.44805). 687

HG195 [63] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyper- 688
Graph By Stable-Cut As Hyper Stain On Super Stagy”, ResearchGate 2023, (doi: 689
10.13140/RG.2.2.23525.68320). 690

HG194 [64] Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Cut In 691
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 692
10.13140/RG.2.2.20170.24000). 693

HG193 [65] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 694
By Clique-Neighbors As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 695
10.13140/RG.2.2.36475.59683). 696

HG192 [66] Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of Clique-Neighbors In 697
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 698
10.13140/RG.2.2.29764.71046). 699

HG191 [67] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 700
By Clique-Decompositions As Hyper Decompile On Super Decommission”, ResearchGate 701
2023, (doi: 10.13140/RG.2.2.18780.87683). 702

HG190 [68] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of 703
Clique- Decompositions In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 704
ResearchGate 2023, (doi: 10.13140/RG.2.2.27169.48487). 705

HG189 [69] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyper- 706
Graph By Clique-Cut As Hyper Click On Super Cliche”, ResearchGate 2023, (doi: 707

10.13140/RG.2.2.26134.01603). 708

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

HG188 [70] Henry Garrett, “New Ideas On Super Cliff By Hyper Cling Of Clique-Cut In 709
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 710
10.13140/RG.2.2.27392.30721). 711

HG187 [71] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHy- 712
perGraph By Space As Hyper Spin On Super Spacy”, ResearchGate 2023, (doi: 713
10.13140/RG.2.2.33028.40321). 714

HG186 [72] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyper- 715
Graph By List- Coloring As Hyper List On Super Lisle”, ResearchGate 2023, (doi: 716
10.13140/RG.2.2.21389.20966). 717

HG185 [73] Henry Garrett, “New Ideas On Super Lith By Hyper Lite Of List-Coloring In 718
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 719
10.13140/RG.2.2.16356.04489). 720

HG184 [74] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHy- 721
perGraph By Space As Hyper Sparse On Super Spark”, ResearchGate 2023, (doi: 722
10.13140/RG.2.2.21756.21129). 723

HG183 [75] Henry Garrett, “New Ideas On Super Solidarity By Hyper Soul Of Space In Can- 724
cer’s Recognition With (Extreme) SuperHyperGraph”, ResearchGate 2023, (doi: 725
10.13140/RG.2.2.30983.68009). 726

HG182 [76] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 727
By Edge-Connectivity As Hyper Disclosure On Super Closure”, ResearchGate 2023, (doi: 728
10.13140/RG.2.2.28552.29445). 729

HG181 [77] Henry Garrett, “New Ideas On Super Uniform By Hyper Deformation Of Edge- 730
Connectivity In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Re- 731
searchGate 2023, (doi: 10.13140/RG.2.2.10936.21761). 732

HG180 [78] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 733
By Vertex-Connectivity As Hyper Leak On Super Structure”, ResearchGate 2023, (doi: 734
10.13140/RG.2.2.35105.89447). 735

HG179 [79] Henry Garrett, “New Ideas On Super System By Hyper Explosions Of Vertex-Connectivity 736
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, 737
(doi: 10.13140/RG.2.2.30072.72960). 738

HG178 [80] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 739
By Tree-Decomposition As Hyper Forward On Super Returns”, ResearchGate 2023, (doi: 740
10.13140/RG.2.2.31147.52003). 741

HG177 [81] Henry Garrett, “New Ideas On Super Nodes By Hyper Moves Of Tree-Decomposition In 742
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 743
10.13140/RG.2.2.32825.24163). 744

HG176 [82] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyper- 745
Graph By Chord As Hyper Excellence On Super Excess”, ResearchGate 2023, (doi: 746

10.13140/RG.2.2.13059.58401). 747

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

HG175 [83] Henry Garrett, “New Ideas On Super Gap By Hyper Navigations Of Chord In 748
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 749
10.13140/RG.2.2.11172.14720). 750

HG174 [84] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 751
By SuperHyper(i,j)-Domination As Hyper Controller On Super Waves”, ResearchGate 752
2023, (doi: 10.13140/RG.2.2.22011.80165). 753

HG173 [85] Henry Garrett, “New Ideas On Super Coincidence By Hyper Routes Of SuperHyper(i,j)- 754
Domination In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchG- 755
ate 2023, (doi: 10.13140/RG.2.2.30819.84003). 756

HG172 [86] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyper- 757
Graph By SuperHyperEdge-Domination As Hyper Reversion On Super Indirection”, 758
ResearchGate 2023, (doi: 10.13140/RG.2.2.10493.84962). 759

HG171 [87] Henry Garrett, “New Ideas On Super Obstacles By Hyper Model Of SuperHyperEdge- 760
Domination In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchG- 761
ate 2023, (doi: 10.13140/RG.2.2.13849.29280). 762

HG170 [88] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 763
By SuperHyperK-Domination As Hyper k-Actions On Super Patterns”, ResearchGate 764
2023, (doi: 10.13140/RG.2.2.19944.14086). 765

HG169 [89] Henry Garrett, “New Ideas On Super Harmony By Hyper k-Function Of SuperHyperK- 766
Domination In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchG- 767
ate 2023, (doi: 10.13140/RG.2.2.23299.58404). 768

HG168 [90] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 769
By SuperHyperK-Number As Hyper k-Partition On Super Layers”, ResearchGate 2023, 770
(doi: 10.13140/RG.2.2.33103.76968). 771

HG167 [91] Henry Garrett, “New Ideas On Super Gradient By Hyper k-Class Of SuperHyperK- 772
Number In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 773
2023, (doi: 10.13140/RG.2.2.23037.44003). 774

HG166 [92] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 775
By SuperHyperOrder As Hyper Enumerations On Super Landmarks”, ResearchGate 2023, 776
(doi: 10.13140/RG.2.2.35646.56641). 777

HG165 [93] Henry Garrett, “New Ideas On Super Analogous By Hyper Visions Of SuperHyperOrder 778
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, 779
(doi: 10.13140/RG.2.2.18030.48967). 780

HG164 [94] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 781
By SuperHyperColoring As Hyper Categories On Super Neighbors”, ResearchGate 2023, 782
(doi: 10.13140/RG.2.2.13973.81121). 783

HG163 [95] Henry Garrett, “New Ideas On Super Relations By Hyper Identifications Of SuperHyper- 784
Coloring In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 785

2023, (doi: 10.13140/RG.2.2.34106.47047). 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

HG162 [96] Henry Garrett, “New Ideas On Super Contradiction By Hyper Detection of SuperHyper- 787
Defensive In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 788
ResearchGate 2023, (doi: 10.13140/RG.2.2.13397.09446). 789

HG161 [97] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 790
By SuperHyperDimension As Hyper Distinguishing On Super Distances”, ResearchGate 791
2023, (doi: 10.13140/RG.2.2.31956.88961). 792

HG160 [98] Henry Garrett, “New Ideas On Super Locations By Hyper Differing Of SuperHyperDi- 793
mension In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 794
2023, (doi: 10.13140/RG.2.2.15179.67361). 795

HG159 [99] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 796
By SuperHyperDominating As Hyper Closing On Super Messy”, ResearchGate 2023, (doi: 797
10.13140/RG.2.2.21510.45125). 798

HG158 [100] Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDomin- 799
ating In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 800
2023, (doi: 10.13140/RG.2.2.13121.84321). 801

HG157 [101] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 802
By SuperHyperConnected As Hyper Group On Super Surge”, ResearchGate 2023, (doi: 803
10.13140/RG.2.2.11758.69441). 804

HG156 [102] Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of SuperHyperCon- 805
nected In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 806
2023, (doi: 10.13140/RG.2.2.31891.35367). 807

HG155 [103] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 808
By SuperHyperTotal As Hyper Covering On Super Infections”, ResearchGate 2023, (doi: 809
10.13140/RG.2.2.19360.87048). 810

HG154 [104] Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyper- 811
Total In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 812
2023, (doi: 10.13140/RG.2.2.32363.21286). 813

HG153 [105] Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect 814
In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, 815
(doi: 10.13140/RG.2.2.23266.81602). 816

HG152 [106] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 817
By SuperHyperPerfect As Hyper Idealism On Super Vacancy”, ResearchGate 2023, (doi: 818
10.13140/RG.2.2.19911.37285). 819

HG151 [107] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 820
By SuperHyperJoin As Hyper Separations On Super Sorts”, ResearchGate 2023, (doi: 821
10.13140/RG.2.2.11050.90569). 822

HG150 [108] Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of 823
SuperHyperJoin In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, 824

ResearchGate 2023, (doi: 10.13140/RG.2.2.17761.79206). 825

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

HG149 [109] Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of SuperHy- 826
perDuality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 827
ResearchGate 2023, (doi: 10.13140/RG.2.2.34953.52320). 828

HG148 [110] Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyper- 829
Graph By SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, 830
ResearchGate 2023, (doi: 10.13140/RG.2.2.33275.80161). 831

HG147 [111] Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph 832
By Path SuperHyperColoring As Hyper Correction On Super Faults”, ResearchGate 2023, 833
(doi: 10.13140/RG.2.2.30182.50241). 834

HG146 [112] Henry Garrett, “New Ideas On Super Reflections By Hyper Rotations Of Path SuperHy- 835
perColoring In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 836
ResearchGate 2023, (doi: 10.13140/RG.2.2.33459.30243). 837

HG145 [113] Henry Garrett, “New Ideas As Hyper Deformations On Super Chains In Cancer’s 838
Neutrosophic Recognition and Neutrosophic SuperHyperGraph By SuperHyperDensity”, 839
ResearchGate 2023, (doi: 10.13140/RG.2.2.13444.60806). 840

HG144 [114] Henry Garrett, “New Ideas As Hyper Ignorance By SuperHyperDensity On Super 841
Resistances In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 842
ResearchGate 2023, (doi:10.13140/RG.2.2.16800.05123). 843

HG143 [115] Henry Garrett, “New Research On Cancer’s Recognition and Neutrosophic SuperHyper- 844
Graph By Eulerian SuperHyperCycles and Hamiltonian Sets As Hyper Covering Versus 845
Super separations-VI”, ResearchGate 2023, (doi: 10.13140/RG.2.2.29913.80482). 846

HG142 [116] Henry Garrett, “New Research On Cancer’s Recognition and Neutrosophic SuperHyper- 847
Graph By Eulerian SuperHyperCycles and Hamiltonian Sets As Hyper Covering Versus 848
Super separations-V”, ResearchGate 2023, (doi: 10.13140/RG.2.2.33269.24809). 849

HG141 [117] Henry Garrett, “New Research On Cancer’s Recognition and Neutrosophic SuperHyper- 850
Graph By Eulerian SuperHyperCycles and Hamiltonian Sets As Hyper Covering Versus 851
Super separations-IV”, ResearchGate 2023, (doi: 10.13140/RG.2.2.34946.96960). 852

HG140 [118] Henry Garrett, “A Research On Cancer’s Recognition and Neutrosophic SuperHyperGraph 853
By Eulerian SuperHyperCycles and Hamiltonian Sets As Hyper Covering Versus Super 854
separations-III”, ResearchGate 2023, (doi: 10.13140/RG.2.2.14814.31040). 855

HG139 [119] Henry Garrett, “A Research On Cancer’s Recognition and Neutrosophic SuperHyperGraph 856
By Eulerian SuperHyperCycles and Hamiltonian Sets As Hyper Covering Versus Super 857
separations-II”, ResearchGate 2023, (doi: 10.13140/RG.2.2.15653.17125). 858

HG138 [120] Henry Garrett, “A Research On Cancer’s Recognition and Neutrosophic SuperHyperGraph 859
By Eulerian SuperHyperCycles and Hamiltonian Sets As Hyper Covering Versus Super 860
separations-I”, ResearchGate 2023, (doi: 10.13140/RG.2.2.25719.50089). 861

HG137 [121] Henry Garrett, “New Ideas On Super Disruptions In Cancer’s Extreme Recognition 862
As Neutrosophic SuperHyperGraph By Hyper Plans Called SuperHyperConnectivities”, 863

ResearchGate 2023, (doi: 10.13140/RG.2.2.29441.94562). 864

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

HG136 [122] Henry Garrett, “Cancer’s Neutrosophic Recognition As Neutrosophic SuperHyperGraph 865
By SuperHyperConnectivities As Hyper Diagnosis On Super Mechanism”, ResearchGate 866
2023, (doi: 10.13140/RG.2.2.17252.24968). 867

HG135 [123] Henry Garrett,“Cancer’s Recognition and (Neutrosophic) SuperHyperGraph By the 868
Criteria of Eulerian and Hamiltonian Type-Sets As Hyper Modified Cycles On Super 869
Mess”, ResearchGate 2023,(doi: 10.13140/RG.2.2.16652.59525). 870

HG134 [124] Henry Garrett,“Eulerian and Hamiltonian In Cancer’s Neutrosophic Recognition and 871

Neutrosophic SuperHyperGraph On Super Interactions By Hyper Extensions of Cycles”, 872

ResearchGate 2023,(doi: 10.13140/RG.2.2.34583.24485). 873

HG132 [125] Henry Garrett,“SuperHyperGirth Type-Results on extreme SuperHyperGirth theory and 874

(Neutrosophic) SuperHyperGraphs Toward Cancer’s extreme Recognition”, Preprints 875

2023, 2023010396 (doi: 10.20944/preprints202301.0396.v1). 876

HG131 [126] Henry Garrett,“Neutrosophic SuperHyperGraphs Warns Hyper Landmark of neutrosophic 877
SuperHyperGirth In Super Type-Versions of Cancer’s neutrosophic Recognition”, Preprints 878

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

HG130 [127] Henry Garrett,“The Constructions of (Neutrosophic) SuperHyperGraphs on the Cancer’s 880
Recognition in The Confrontation With Super Attacks In Hyper Situations By 881

Implementing (Neutrosophic) 1-Failed SuperHyperForcing in The Technical Approaches to 882

Neutralize SuperHyperViews”, ResearchGate 2023, (doi: 10.13140/RG.2.2.26240.51204). 883

HG129 [128] Henry Garrett,“(Neutrosophic) 1-Failed SuperHyperForcing As the Entrepreneurs on 884

Cancer’s Recognitions To Fail Forcing Style As the Super Classes With Hyper Effects 885

In The Background of the Framework is So-Called (Neutrosophic) SuperHyperGraphs”, 886

ResearchGate 2023, (doi: 10.13140/RG.2.2.12818.73925). 887

HG128 [129] Henry Garrett,“Super Actions On The Types of Hyper Levels In The Sensible 888

Neutrosophic SuperHyperGirth On Cancer’s Neutrosophic Recognition and Neutrosophic 889

SuperHyperGraph”, ResearchGate 2023,(doi: 10.13140/RG.2.2.26836.88960). 890

HG127 [130] Henry Garrett,“SuperHyperGirth Approaches on the Super Challenges on the Cancer’s 891
Recognition In the Hyper Model of (Neutrosophic) SuperHyperGraph”, ResearchGate 892

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

HG126 [131] Henry Garrett,“Extreme SuperHyperClique as the Firm Scheme of Confrontation under 894
Cancer’s Recognition as the Model in The Setting of (Neutrosophic) SuperHyperGraphs”, 895

Preprints 2023, 2023010308 (doi: 10.20944/preprints202301.0308.v1). 896

HG125 [132] Henry Garrett,“Uncertainty On The Act And Effect Of Cancer Alongside The Foggy 897
Positions Of Cells Toward Neutrosophic Failed SuperHyperClique inside Neutrosophic 898
SuperHyperGraphs Titled Cancer’s Recognition”, Preprints 2023, 2023010282 (doi: 899

10.20944/preprints202301.0282.v1). 900

HG124 [133] Henry Garrett,“Neutrosophic Version Of Separates Groups Of Cells In Cancer’s 901
Recognition On Neutrosophic SuperHyperGraphs”, Preprints 2023, 2023010267 (doi: 902

10.20944/preprints202301.0267.v1).). 903

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

HG123 [134] Henry Garrett, “The Shift Paradigm To Classify Separately The Cells and Affected 904
Cells Toward The Totality Under Cancer’s Recognition By New Multiple Definitions On 905
the Sets Polynomials Alongside Numbers In The (Neutrosophic) SuperHyperMatching 906
Theory Based on SuperHyperGraph and Neutrosophic SuperHyperGraph”, Preprints 907
2023, 2023010265 (doi: 10.20944/preprints202301.0265.v1). 908

HG122 [135] Henry Garrett,“Breaking the Continuity and Uniformity of Cancer In The Worst Case of 909
Full Connections With Extreme Failed SuperHyperClique In Cancer’s Recognition Applied 910
in (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010262,(doi: 10.20944/pre- 911
prints202301.0262.v1). 912

HG121 [136] Henry Garrett, “Neutrosophic Failed SuperHyperStable as the Survivors on the 913
Cancer’s Neutrosophic Recognition Based on Uncertainty to All Modes in Neutrosophic 914
SuperHyperGraphs”, Preprints 2023, 2023010240 (doi: 10.20944/preprints202301.0240.v1). 915

HG120 [137] Henry Garrett, “Extremism of the Attacked Body Under the Cancer’s Circumstances 916
Where Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 917
2023010224, (doi: 10.20944/preprints202301.0224.v1). 918

HG24 [138] Henry Garrett,“SuperHyperMatching By (R-)Definitions And Polynomials To Monitor 919

Cancer’s Recognition In Neutrosophic SuperHyperGraphs”, ResearchGate 2023,(doi: 920

10.13140/RG.2.2.35061.65767). 921

HG25 [139] Henry Garrett,“The Focus on The Partitions Obtained By Parallel Moves In The 922

Cancer’s Extreme Recognition With Different Types of Extreme SuperHyperMatching 923

Set and Polynomial on (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 924
10.13140/RG.2.2.18494.15680). 925

HG26 [140] Henry Garrett,“Extreme Failed SuperHyperClique Decides the Failures on the Can- 926

cer’s Recognition in the Perfect Connections of Cancer’s Attacks By SuperHy- 927

perModels Named (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 928
10.13140/RG.2.2.32530.73922). 929

HG27 [141] Henry Garrett,“Indeterminacy On The All Possible Connections of Cells In Front 930

of Cancer’s Attacks In The Terms of Neutrosophic Failed SuperHyperClique on Can- 931

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

HG116 [142] Henry Garrett,“Extreme Failed SuperHyperClique Decides the Failures on the Can- 934

cer’s Recognition in the Perfect Connections of Cancer’s Attacks By SuperHy- 935

perModels Named (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 936
10.13140/RG.2.2.32530.73922). 937

HG115 [143] Henry Garrett, “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Recognitions 938

And (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010105 (doi: 10.20944/pre- 939

prints202301.0105.v1). 940

HG28 [144] Henry Garrett,“Perfect Directions Toward Idealism in Cancer’s Neutrosophic Recogni- 941
tion Forwarding Neutrosophic SuperHyperClique on Neutrosophic SuperHyperGraphs”, 942

ResearchGate 2023, (doi: 10.13140/RG.2.2.30092.80004). 943

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

HG29 [145] Henry Garrett,“Demonstrating Complete Connections in Every Embedded Regions 944
and Sub-Regions in the Terms of Cancer’s Recognition and (Neutrosophic) Su- 945
perHyperGraphs With (Neutrosophic) SuperHyperClique”, ResearchGate 2023, (doi: 946
10.13140/RG.2.2.23172.19849). 947

HG112 [146] Henry Garrett, “Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic) 948
SuperHyperModeling in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs”, 949
Preprints 2023, 2023010105 (doi: 10.20944/preprints202301.0105.v1). 950

HG111 [147] Henry Garrett, “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic 951
SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints”, 952

Preprints 2023, 2023010088 (doi: 10.20944/preprints202301.0088.v1). 953

HG30 [148] Henry Garrett,“Different Neutrosophic Types of Neutrosophic Regions titled neut- 954
rosophic Failed SuperHyperStable in Cancer’s Neutrosophic Recognition modeled 955
in the Form of Neutrosophic SuperHyperGraphs”, ResearchGate 2023, (doi: 956

10.13140/RG.2.2.17385.36968). 957

HG107 [149] Henry Garrett, “Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction 958
To Use Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition And 959
Beyond”, Preprints 2023, 2023010044 960

HG106 [150] Henry Garrett, “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well- 961
SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010043 962
(doi: 10.20944/preprints202301.0043.v1). 963

HG31 [151] Henry Garrett, “Using the Tool As (Neutrosophic) Failed SuperHyperStable To SuperHy- 964

perModel Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs”, ResearchGate 965

2023, (doi: 10.13140/RG.2.2.28945.92007). 966

HG32 [152] Henry Garrett, “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic 967
SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints”, 968

ResearchGate 2023, (doi: 10.13140/RG.2.2.11447.80803). 969

HG33 [153] Henry Garrett, “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well- 970
SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 971
10.13140/RG.2.2.35774.77123). 972

HG34 [154] Henry Garrett, “Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To 973
Use Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond”, 974
ResearchGate 2022, (doi: 10.13140/RG.2.2.36141.77287). 975

HG35 [155] Henry Garrett, “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Re- 976

cognitions And (Neutrosophic) SuperHyperGraphs”, ResearchGate 2022, (doi: 977

10.13140/RG.2.2.29430.88642). 978

HG36 [156] Henry Garrett, “Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic) 979
SuperHyperModeling in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs”, 980

ResearchGate 2022, (doi: 10.13140/RG.2.2.11369.16487). 981

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

HG982 [157] Henry Garrett, “(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions Featuring 982
(Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, Preprints 2022, 2022120549 983
(doi: 10.20944/preprints202212.0549.v1). 984

HG98 [158] Henry Garrett, “(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions Featuring 985

(Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, ResearchGate 2022, (doi: 986

10.13140/RG.2.2.19380.94084). 987

HG972 [159] Henry Garrett, “(Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and 988
SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With 989
(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions And Related (Neutrosophic) 990

SuperHyperClasses”, Preprints 2022, 2022120540 (doi: 10.20944/preprints202212.0540.v1). 991

HG97 [160] Henry Garrett, “(Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and 992
SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With 993
(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions And Related (Neutrosophic) 994

SuperHyperClasses”, ResearchGate 2022, (doi: 10.13140/RG.2.2.14426.41923). 995

HG962 [161] Henry Garrett, “SuperHyperGirth on SuperHyperGraph and Neutrosophic SuperHyper- 996
Graph With SuperHyperModeling of Cancer’s Recognitions”, Preprints 2022, 2022120500 997
(doi: 10.20944/preprints202212.0500.v1). 998

HG96 [162] Henry Garrett, “SuperHyperGirth on SuperHyperGraph and Neutrosophic SuperHyper- 999
Graph With SuperHyperModeling of Cancer’s Recognitions”, ResearchGate 2022 (doi: 1000
10.13140/RG.2.2.20993.12640). 1001

HG952 [163] Henry Garrett,“Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic Su- 1002

perHyperGraphs and SuperHyperGraphs Alongside Applications in Cancer’s Treatments”, 1003

Preprints 2022, 2022120324 (doi: 10.20944/preprints202212.0324.v1). 1004

HG95 [164] Henry Garrett, “Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic 1005
SuperHyperGraphs And SuperHyperGraphs Alongside Applications in Cancer’s Treat- 1006

ments”, ResearchGate 2022 (doi: 10.13140/RG.2.2.23123.04641). 1007

HG942 [165] Henry Garrett, “SuperHyperDominating and SuperHyperResolving on Neutrosophic 1008

SuperHyperGraphs And Their Directions in Game Theory and Neutrosophic SuperHyper- 1009
Classes”, Preprints 2022, 2022110576 (doi: 10.20944/preprints202211.0576.v1). 1010

HG94 [166] Henry Garrett, “SuperHyperDominating and SuperHyperResolving on Neutrosophic 1011

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

HG37 [167] Henry Garrett, “Basic Neutrosophic Notions Concerning SuperHyperDominating and 1014

Neutrosophic SuperHyperResolving in SuperHyperGraph”, ResearchGate 2022 (doi: 1015

10.13140/RG.2.2.29173.86244). 1016

HG38 [168] Henry Garrett, “Initial Material of Neutrosophic Preliminaries to Study Some Neutrosophic 1017
Notions Based on Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic SuperHyper- 1018

Graph (NSHG)”, ResearchGate 2022 (doi: 10.13140/RG.2.2.25385.88160). 1019

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

HG155b [169] Henry Garrett, “Hamiltonian-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 1020
2023 (doi: 10.5281/zenodo.7804449). 1021

HG154b [170] Henry Garrett, “Hamiltonian-Cycle-Decomposition In SuperHyperGraphs”. Dr. Henry 1022

Garrett, 2023 (doi: 10.5281/zenodo.7793875). 1023

HG153b [171] Henry Garrett, “Hamiltonian-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1024
(doi: 10.5281/zenodo.7792307). 1025

HG152b [172] Henry Garrett, “Hamiltonian-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1026
(doi: 10.5281/zenodo.7790728). 1027

HG151b [173] Henry Garrett, “Hamiltonian-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 1028
2023 (doi: 10.5281/zenodo.7787712). 1029

HG150b [174] Henry Garrett, “Hamiltonian-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1030
10.5281/zenodo.7783791). 1031

HG149b [175] Henry Garrett, “Trace-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1032
10.5281/zenodo.7780123). 1033

HG148b [176] Henry Garrett, “Trace-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1034
(doi: 10.5281/zenodo.7773119). 1035

HG147b [177] Henry Garrett, “SuperHyperDuality”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1036

odo.7637762). 1037

HG146b [178] Henry Garrett, “Trace-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1038
10.5281/zenodo.7766174). 1039

HG145b [179] Henry Garrett, “Edge-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1040
10.5281/zenodo.7762232). 1041

HG144b [180] Henry Garrett, “Edge-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1042

(doi: 10.5281/zenodo.7758601). 1043

HG143b [181] Henry Garrett, “Edge-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1044
10.5281/zenodo.7754661). 1045

HG142b [182] Henry Garrett, “Vertex-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1046
10.5281/zenodo.7750995) . 1047

HG141b [183] Henry Garrett, “Vertex-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1048

(doi: 10.5281/zenodo.7749875). 1049

HG140b [184] Henry Garrett, “Vertex-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1050
10.5281/zenodo.7747236). 1051

HG139b [185] Henry Garrett, “Stable-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1052
10.5281/zenodo.7742587). 1053

HG138b [186] Henry Garrett, “Stable-Decompositions In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1054

(doi: 10.5281/zenodo.7738635). 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

HG137b [187] Henry Garrett, “Stable-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1056
10.5281/zenodo.7734719). 1057

HG136b [188] Henry Garrett, “Clique-Neighbors In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1058
10.5281/zenodo.7730484). 1059

HG135b [189] Henry Garrett, “Clique-Decompositions In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1060
(doi: 10.5281/zenodo.7730469). 1061

HG134b [190] Henry Garrett, “Clique-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1062
10.5281/zenodo.7722865). 1063

HG133b [191] Henry Garrett, “Space In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1064
odo.7713563). 1065

HG132b [192] Henry Garrett, “Space In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1066
odo.7709116). 1067

HG131b [193] Henry Garrett, “Edge-Connectivity In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1068
10.5281/zenodo.7706415). 1069

HG130b [194] Henry Garrett, “Vertex-Connectivity In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1070
(doi: 10.5281/zenodo.7706063). 1071

HG129b [195] Henry Garrett, “Tree-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1072

(doi: 10.5281/zenodo.7701906). 1073

HG128b [196] Henry Garrett, “Chord In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1074
odo.7700205). 1075

HG127b [197] Henry Garrett, “(i,j)-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1076
10.5281/zenodo.7694876). 1077

HG126b [198] Henry Garrett, “Edge-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1078

10.5281/zenodo.7679410). 1079

HG125b [199] Henry Garrett, “K-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1080
10.5281/zenodo.7675982). 1081

HG124b [200] Henry Garrett, “K-Number In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1082
10.5281/zenodo.7672388). 1083

HG123b [201] Henry Garrett, “Order In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1084

odo.7668648). 1085

HG122b [202] Henry Garrett, “Coloring In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1086
10.5281/zenodo.7662810). 1087

HG121b [203] Henry Garrett, “Dimension In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1088
10.5281/zenodo.7659162). 1089

HG120b [204] Henry Garrett, “Cancer In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1090

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

HG119b [205] Henry Garrett, “SuperHyperWheel”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1092
odo.7653204). 1093

HG118b [206] Henry Garrett, “SuperHyperMultipartite”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1094
odo.7653142). 1095

HG117b [207] Henry Garrett, “SuperHyperBipartite”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1096
odo.7653117). 1097

HG116b [208] Henry Garrett, “SuperHyperStar”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1098
odo.7653089). 1099

HG115b [209] Henry Garrett, “SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1100
odo.7651687). 1101

HG114b [210] Henry Garrett, “SuperHyperPath”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1102
odo.7651619). 1103

HG113b [211] Henry Garrett, “SuperHyperDomination”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1104
odo.7651439). 1105

HG112b [212] Henry Garrett, “SuperHyperDominating”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1106
odo.7650729). 1107

HG111b [213] Henry Garrett, “SuperHyperConnected”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1108

odo.7647868). 1109

HG110b [214] Henry Garrett, “SuperHyperTotal”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1110
odo.7647017). 1111

HG109b [215] Henry Garrett, “SuperHyperPerfect”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1112
odo.7644894). 1113

HG108b [216] Henry Garrett, “SuperHyperJoin”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1114

odo.7641880). 1115

HG107b [217] Henry Garrett, “Path SuperHyperColoring”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1116
odo.7632923). 1117

HG106b [218] Henry Garrett, “SuperHyperDensity”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1118
odo.7623459). 1119

HG105b [219] Henry Garrett, “Neutrosophic SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 1120

10.5281/zenodo.7606416). 1121

HG104b [220] Henry Garrett, “Extreme SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 1122
10.5281/zenodo.7606416). 1123

HG103b [221] Henry Garrett, “SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1124
odo.7606404). 1125

HG102b [222] Henry Garrett, “Neutrosophic SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 1126

10.5281/zenodo.7580018). 1127

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

HG101b [223] Henry Garrett, “Extreme SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1128
odo.7580018). 1129

HG100b [224] Henry Garrett, “Extreme SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1130
odo.7580018). 1131

HG99b [225] Henry Garrett, “SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1132
odo.7579929). 1133

HG98b [226] Henry Garrett, “Neutrosophic SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 1134
10.5281/zenodo.7563170). 1135

HG97b [227] Henry Garrett, “Extreme SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1136
odo.7563164). 1137

HG96b [228] Henry Garrett, “SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1138
odo.7563160). 1139

HG95b [229] Henry Garrett, “Extreme SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1140
odo.7563160). 1141

HG94b [230] Henry Garrett, “Overlook On SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 1142
10.5281/zenodo.7563160). 1143

HG93b [231] Henry Garrett, “Neutrosophic SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 1144

10.5281/zenodo.7557063). 1145

HG92b [232] Henry Garrett, “Extreme SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 1146
10.5281/zenodo.7557009). 1147

HG91b [233] Henry Garrett, “Overlook On SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 1148
10.5281/zenodo.7539484). 1149

HG90b [234] Henry Garrett, “Neutrosophic Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1150

10.5281/zenodo.7523390). 1151

HG89b [235] Henry Garrett, “Extreme Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1152
10.5281/zenodo.7523390). 1153

HG88b [236] Henry Garrett, “Overlook On Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1154
10.5281/zenodo.7523390). 1155

HG87b [237] Henry Garrett, “Extreme SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1156

odo.7574952). 1157

HG86b [238] Henry Garrett, “Neutrosophic SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1158
10.5281/zenodo.7574992). 1159

HG85b [239] Henry Garrett, “Extreme SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1160
odo.7523357). 1161

HG84b [240] Henry Garrett, “Overlook On SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1162

10.5281/zenodo.7523357). 1163

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

HG83b [241] Henry Garrett, “Neutrosophic Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1164
10.5281/zenodo.7504782). 1165

HG82b [242] Henry Garrett, “Extreme Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1166
10.5281/zenodo.7504782). 1167

HG81b [243] Henry Garrett, “Overlook On Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1168
10.5281/zenodo.7504782). 1169

HG80b [244] Henry Garrett, “Neutrosophic SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1170
10.5281/zenodo.7499395). 1171

HG79b [245] Henry Garrett, “Extreme SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1172
odo.7499395). 1173

HG78b [246] Henry Garrett, “Overlook On SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1174
10.5281/zenodo.7499395). 1175

HG77b [247] Henry Garrett, “Neutrosophic Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1176
10.5281/zenodo.7497450). 1177

HG76b [248] Henry Garrett, “Extreme Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1178
10.5281/zenodo.7497450). 1179

HG75b [249] Henry Garrett, “Neutrosophic SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1180

10.5281/zenodo.7494862). 1181

HG74b [250] Henry Garrett, “Extreme SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1182
odo.7494862). 1183

HG73b [251] Henry Garrett, “Overlook On SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1184
10.5281/zenodo.7494862). 1185

HG72b [252] Henry Garrett, “Neutrosophic SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 1186

10.5281/zenodo.7493845). 1187

HG71b [253] Henry Garrett, “Extreme SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 1188
10.5281/zenodo.7493845). 1189

HG70b [254] Henry Garrett, “Overlook On SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 1190
10.5281/zenodo.7493845). 1191

HG69b [255] Henry Garrett, “SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1192

odo.7539484). 1193

HG68b [256] Henry Garrett, “Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1194
odo.7523390). 1195

HG67b [257] Henry Garrett, “SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1196
odo.7523357). 1197

HG66b [258] Henry Garrett, “Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1198

odo.7504782). 1199

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

HG65b [259] Henry Garrett, “SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1200
odo.7499395). 1201

HG64b [260] Henry Garrett, “Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1202
odo.7497450). 1203

HG63b [261] Henry Garrett, “SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1204
odo.7494862). 1205

HG62b [262] Henry Garrett, “SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1206

odo.7493845). 1207

HG61b [263] Henry Garrett, “SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1208
odo.7480110). 1209

HG60b [264] Henry Garrett, “Neut. SuperHyperEdges”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1210
odo.7378758). 1211

HG32b [265] Henry Garrett, “Beyond Neutrosophic Graphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1212
odo.6320305). 1213

HG44b [266] Henry Garrett, “Neutrosophic Duality”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1214
odo.6677173). 1215

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 CHAPTER 3 1216

Acknowledgements 1217

The author is going to express his gratitude and his appreciation about the brains and their 1218
hands which are showing the importance of words in the framework of every wisdom, knowledge, 1219
arts, and emotions which are streaming in the lines from the words, notions, ideas and approaches The
1220 words of mind and th
to have the material and the contents which are only the way to flourish the minds, to grow minds of words, are too
1221
eligible to be in the stage
the notions, to advance the ways and to make the stable ways to be amid events and storms of 1222
of acknowledgements
minds for surviving from them and making the outstanding experiences about the tools and the 1223
ideas to be on the star lines of words and shining like stars, forever. 1224

39
 CHAPTER 4 1225

Cancer In Extreme SuperHyperGraph 1226

The cancer is the Extreme disease but the Extreme model is going to figure out what’s going on 1227
this Extreme phenomenon. The special Extreme case of this Extreme disease is considered and 1228

as the consequences of the model, some parameters are used. The cells are under attack of this 1229
disease but the moves of the cancer in the special region are the matter of mind. The Extreme 1230
recognition of the cancer could help to find some Extreme treatments for this Extreme disease. 1231
In the following, some Extreme steps are Extreme devised on this disease. 1232

Step 1. (Extreme Definition) The Extreme recognition of the cancer in the long-term Extreme 1233
function. 1234

Step 2. (Extreme Issue) The specific region has been assigned by the Extreme model [it’s 1235
called Extreme SuperHyperGraph] and the long Extreme cycle of the move from the cancer 1236

is identified by this research. Sometimes the move of the cancer hasn’t be easily identified 1237
since there are some determinacy, indeterminacy and neutrality about the moves and the 1238
effects of the cancer on that region; this event leads us to choose another model [it’s said 1239
to be Extreme SuperHyperGraph] to have convenient perception on what’s happened and 1240
what’s done. 1241

Step 3. (Extreme Model) There are some specific Extreme models, which are well-known and 1242
they’ve got the names, and some general Extreme models. The moves and the Extreme 1243

traces of the cancer on the complex tracks and between complicated groups of cells could be 1244
fantasized by an Extreme SuperHyperPath(-/SuperHyperK-Domination, SuperHyperStar, 1245
SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find 1246
either the Extreme SuperHyperK-Domination or the Extreme SuperHyperK-Domination 1247
in those Extreme Extreme SuperHyperModels. 1248

Some cells have been faced with some attacks from the situation which is caused by the 1249
cancer’s attacks. In this case, there are some embedded analysis on the ongoing situations 1250

which in that, the cells could be labelled as some groups and some groups or individuals have 1251
excessive labels which all are raised from the behaviors to overcome the cancer’s attacks. In 1252
the embedded situations, the individuals of cells and the groups of cells could be considered 1253
as “new groups”. Thus it motivates us to find the proper SuperHyperModels for getting more 1254
proper analysis on this messy story. I’ve found the SuperHyperModels which are officially 1255
called “SuperHyperGraphs” and “Extreme SuperHyperGraphs”. In this SuperHyperModel, the 1256

cells and the groups of cells are defined as “SuperHyperVertices” and the relations between 1257

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

the individuals of cells and the groups of cells are defined as “SuperHyperEdges”. Thus it’s 1258
another motivation for us to do research on this SuperHyperModel based on the “Cancer’s 1259
Recognition”. Sometimes, the situations get worst. The situation is passed from the certainty 1260
and precise style. Thus it’s the beyond them. There are three descriptions, namely, the 1261
degrees of determinacy, indeterminacy and neutrality, for any object based on vague forms, 1262
namely, incomplete data, imprecise data, and uncertain analysis. The latter model could be 1263

considered on the previous SuperHyperModel. It’s SuperHyperModel. It’s SuperHyperGraph 1264

but it’s officially called “Extreme SuperHyperGraphs”. The cancer is the disease but the model 1265
is going to figure out what’s going on this phenomenon. The special case of this disease is 1266
considered and as the consequences of the model, some parameters are used. The cells are 1267
under attack of this disease but the moves of the cancer in the special region are the matter of 1268
mind. The recognition of the cancer could help to find some treatments for this disease. The 1269

SuperHyperGraph and Extreme SuperHyperGraph are the SuperHyperModels on the “Cancer’s 1270
Recognition” and both bases are the background of this research. Sometimes the cancer has 1271
been happened on the region, full of cells, groups of cells and embedded styles. In this segment, 1272
the SuperHyperModel proposes some SuperHyperNotions based on the connectivities of the 1273
moves of the cancer in the forms of alliances’ styles with the formation of the design and the 1274
architecture are formally called “ SuperHyperK-Domination” in the themes of jargons and 1275

buzzwords. The prefix “SuperHyper” refers to the theme of the embedded styles to figure out 1276
the background for the SuperHyperNotions. The recognition of the cancer in the long-term 1277
function. The specific region has been assigned by the model [it’s called SuperHyperGraph] 1278
and the long cycle of the move from the cancer is identified by this research. Sometimes the 1279
move of the cancer hasn’t be easily identified since there are some determinacy, indeterminacy 1280
and neutrality about the moves and the effects of the cancer on that region; this event leads 1281

us to choose another model [it’s said to be Extreme SuperHyperGraph] to have convenient 1282
perception on what’s happened and what’s done. There are some specific models, which 1283
are well-known and they’ve got the names, and some general models. The moves and the 1284
traces of the cancer on the complex tracks and between complicated groups of cells could 1285
be fantasized by an Extreme SuperHyperPath (-/SuperHyperK-Domination, SuperHyperStar, 1286
SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find either the 1287

optimal SuperHyperK-Domination or the Extreme SuperHyperK-Domination in those Extreme 1288

SuperHyperModels. Some general results are introduced. Beyond that in SuperHyperStar, 1289
all possible Extreme SuperHyperPath s have only two SuperHyperEdges but it’s not enough 1290
since it’s essential to have at least three SuperHyperEdges to form any style of a SuperHyperK- 1291
Domination. There isn’t any formation of any SuperHyperK-Domination but literarily, it’s the 1292

deformation of any SuperHyperK-Domination. It, literarily, deforms and it doesn’t form. 1293

Question 4.0.1. How to define the SuperHyperNotions and to do research on them to find the “ 1294
amount of SuperHyperK-Domination” of either individual of cells or the groups of cells based on 1295
the fixed cell or the fixed group of cells, extensively, the “amount of SuperHyperK-Domination” 1296
based on the fixed groups of cells or the fixed groups of group of cells? 1297

Question 4.0.2. What are the best descriptions for the “Cancer’s Recognition” in terms of these 1298
messy and dense SuperHyperModels where embedded notions are illustrated? 1299

It’s motivation to find notions to use in this dense model is titled “SuperHyperGraphs”. 1300
Thus it motivates us to define different types of “ SuperHyperK-Domination” and “Extreme 1301

SuperHyperK-Domination” on “SuperHyperGraph” and “Extreme SuperHyperGraph”. Then the 1302

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

research has taken more motivations to define SuperHyperClasses and to find some connections 1303
amid this SuperHyperNotion with other SuperHyperNotions. It motivates us to get some 1304
instances and examples to make clarifications about the framework of this research. The general 1305
results and some results about some connections are some avenues to make key point of this 1306
research, “Cancer’s Recognition”, more understandable and more clear. 1307
Some SuperHyperClasses and some Extreme SuperHyperClasses are the cases of this research 1308

on the modeling of the regions where are under the attacks of the cancer to recognize 1309
this disease as it’s mentioned on the title “Cancer’s Recognitions”. To formalize the 1310
instances on the SuperHyperNotion, SuperHyperK-Domination, the new SuperHyperClasses 1311
and SuperHyperClasses, are introduced. Some general results are gathered in the section on 1312
the SuperHyperK-Domination and the Extreme SuperHyperK-Domination. The clarifications, 1313
instances and literature reviews have taken the whole way through. In this scientific research, 1314

the literature reviews have fulfilled the lines containing the notions and the results. The 1315
SuperHyperGraph and Extreme SuperHyperGraph are the SuperHyperModels on the “Cancer’s 1316
Recognitions” and both bases are the background of this research. Sometimes the cancer has 1317
been happened on the region, full of cells, groups of cells and embedded styles. In this scientific 1318
segment, the SuperHyperModel proposes some SuperHyperNotions based on the connectivities 1319
of the moves of the cancer in the longest and strongest styles with the formation of the design 1320

and the architecture are formally called “ SuperHyperK-Domination” in the themes of jargons 1321
and buzzwords. The prefix “SuperHyper” refers to the theme of the embedded styles to figure 1322
out the background for the SuperHyperNotions. 1323

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 CHAPTER 5 1324

Extreme Hamiltonian-Type-Cycle-Cut 1325

Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of SuperHyperDu- 1326
ality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, ResearchGate 1327

2023, (doi: 10.13140/RG.2.2.34953.52320). 1328

Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph By 1329
SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchGate 2023, 1330
(doi: 10.13140/RG.2.2.33275.80161). 1331
Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 1332
By SuperHyperJoin As Hyper Separations On Super Sorts”, ResearchGate 2023, (doi: 1333

10.13140/RG.2.2.11050.90569). 1334
Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of SuperHyperJoin 1335
In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 1336
10.13140/RG.2.2.17761.79206). 1337
Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 1338
By SuperHyperPerfect As Hyper Idealism On Super Vacancy”, ResearchGate 2023, (doi: 1339

10.13140/RG.2.2.19911.37285). 1340
Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect 1341
In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 1342
10.13140/RG.2.2.23266.81602). 1343
Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 1344
By SuperHyperTotal As Hyper Covering On Super Infections”, ResearchGate 2023, (doi: 1345

10.13140/RG.2.2.19360.87048). 1346
Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal 1347
In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 1348
10.13140/RG.2.2.32363.21286). 1349
Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 1350
By SuperHyperConnected As Hyper Group On Super Surge”, ResearchGate 2023, (doi: 1351

10.13140/RG.2.2.11758.69441). 1352
Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of SuperHyperConnected 1353
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 1354
10.13140/RG.2.2.31891.35367). 1355
Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 1356
By SuperHyperDominating As Hyper Closing On Super Messy”, ResearchGate 2023, (doi: 1357

10.13140/RG.2.2.21510.45125). 1358

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

Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDominating 1359
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 1360
10.13140/RG.2.2.13121.84321). 1361

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 CHAPTER 6 1362

New Ideas On Super Hammy By Hyper 1363

Hamper Of Hamiltonian-Type-Cycle-Cut 1364

In Recognition of Cancer With 1365

(Neutrosophic) SuperHyperGraph 1366

47
 CHAPTER 7 1367

ABSTRACT 1368

In this scientific research, (Different Neutrosophic Types of Neutrosophic SuperHyperHamiltonian- 1369

Type-Cycle-Cut). Assume a Neutrosophic SuperHyperGraph (NSHG) S is a Hamiltonian-Type-Cycle- 1370
0
Cut pair S = (V, E). Consider a Neutrosophic SuperHyperSet V = {V1 , V2 , . . . , Vs } and 1371
0 0 0
E = {E1 , E2 , . . . , Ez }. Then either V or E is called Neutrosophic e-SuperHyperHamiltonian-Type- 1372

Cycle-Cut if the following expression is called Neutrosophic e-SuperHyperHamiltonian-Type-Cycle-Cut 1373

criteria holds 1374

∀Ea ∈ C : C is
a SuperHyperCycle and it has
the maximum number of SuperHyperVertices;

Neutrosophic re-SuperHyperHamiltonian-Type-Cycle-Cut if the following expression is called Neutro- 1375

sophic e-SuperHyperHamiltonian-Type-Cycle-Cut criteria holds 1376

∀Ea ∈ C : C is
a SuperHyperCycle and it has
the maximum number of SuperHyperVertices;

and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; Neutrosophic v- 1377

SuperHyperHamiltonian-Type-Cycle-Cut if the following expression is called Neutrosophic v- 1378
SuperHyperHamiltonian-Type-Cycle-Cut criteria holds 1379

∀Va ∈ C : C is
a SuperHyperCycle and it has
the maximum number of SuperHyperVertices;

Neutrosophic rv-SuperHyperHamiltonian-Type-Cycle-Cut if the following expression is called Neutro- 1380

sophic v-SuperHyperHamiltonian-Type-Cycle-Cut criteria holds 1381

∀Va ∈ C : C is
a SuperHyperCycle and it has
the maximum number of SuperHyperVertices;

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

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

SuperHyperHamiltonian-Type-Cycle-Cut if it’s either of Neutrosophic e-SuperHyperHamiltonian-Type-Cycle- 1383
Cut, Neutrosophic re-SuperHyperHamiltonian-Type-Cycle-Cut, Neutrosophic v-SuperHyperHamiltonian- 1384
Type-Cycle-Cut, and Neutrosophic rv-SuperHyperHamiltonian-Type-Cycle-Cut. ((Neutrosophic) 1385
SuperHyperHamiltonian-Type-Cycle-Cut). Assume a Neutrosophic SuperHyperGraph (NSHG) S 1386
is a pair S = (V, E). Consider a Neutrosophic SuperHyperEdge (NSHE) E = {V1 , V2 , . . . , Vs }. 1387

Then E is called an Extreme SuperHyperHamiltonian-Type-Cycle-Cut if it’s either of Neutrosophic 1388

e-SuperHyperHamiltonian-Type-Cycle-Cut, Neutrosophic re-SuperHyperHamiltonian-Type-Cycle-Cut, Neut- 1389
rosophic v-SuperHyperHamiltonian-Type-Cycle-Cut, and Neutrosophic rv-SuperHyperHamiltonian-Type- 1390
Cycle-Cut and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum 1391
Extreme cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme 1392
SuperHyperEdges in the conseNeighborive Extreme sequence of Extreme SuperHyperEdges 1393

and Extreme SuperHyperVertices such that they form the Extreme SuperHyperHamiltonian- 1394
Type-Cycle-Cut; a Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut if it’s either of Neutrosophic 1395
e-SuperHyperHamiltonian-Type-Cycle-Cut, Neutrosophic re-SuperHyperHamiltonian-Type-Cycle-Cut, Neut- 1396
rosophic v-SuperHyperHamiltonian-Type-Cycle-Cut, and Neutrosophic rv-SuperHyperHamiltonian-Type- 1397
Cycle-Cut and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the max- 1398
imum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic 1399

SuperHyperSet S of high Neutrosophic cardinality conseNeighborive Neutrosophic Super- 1400

HyperEdges and Neutrosophic SuperHyperVertices such that they form the Neutrosophic 1401
SuperHyperHamiltonian-Type-Cycle-Cut; an Extreme SuperHyperHamiltonian-Type-Cycle-Cut SuperHyper- 1402
Polynomial if it’s either of Neutrosophic e-SuperHyperHamiltonian-Type-Cycle-Cut, Neutrosophic 1403
re-SuperHyperHamiltonian-Type-Cycle-Cut, Neutrosophic v-SuperHyperHamiltonian-Type-Cycle-Cut, and 1404
Neutrosophic rv-SuperHyperHamiltonian-Type-Cycle-Cut and C(N SHG) for an Extreme SuperHy- 1405

perGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme 1406
coefficients defined as the Extreme number of the maximum Extreme cardinality of the 1407
Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme cardinality 1408
conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 1409
form the Extreme SuperHyperHamiltonian-Type-Cycle-Cut; and the Extreme power is corresponded 1410
to its Extreme coefficient; a Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut SuperHyper- 1411

Polynomial if it’s either of Neutrosophic e-SuperHyperHamiltonian-Type-Cycle-Cut, Neutrosophic 1412

re-SuperHyperHamiltonian-Type-Cycle-Cut, Neutrosophic v-SuperHyperHamiltonian-Type-Cycle-Cut, and 1413
Neutrosophic rv-SuperHyperHamiltonian-Type-Cycle-Cut and C(N SHG) for a Neutrosophic SuperHy- 1414
perGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains the Neutrosophic 1415
coefficients defined as the Neutrosophic number of the maximum Neutrosophic cardinality of the 1416

Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic cardin- 1417

ality conseNeighborive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices 1418
such that they form the Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut; and the Neutrosophic 1419
power is corresponded to its Neutrosophic coefficient; an Extreme V-SuperHyperHamiltonian- 1420
Type-Cycle-Cut if it’s either of Neutrosophic e-SuperHyperHamiltonian-Type-Cycle-Cut, Neutrosophic 1421
re-SuperHyperHamiltonian-Type-Cycle-Cut, Neutrosophic v-SuperHyperHamiltonian-Type-Cycle-Cut, and 1422

Neutrosophic rv-SuperHyperHamiltonian-Type-Cycle-Cut and C(N SHG) for an Extreme SuperHyper- 1423

Graph N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of 1424
high Extreme cardinality of the Extreme SuperHyperVertices in the conseNeighborive Extreme 1425
sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 1426
form the Extreme SuperHyperHamiltonian-Type-Cycle-Cut; a Neutrosophic V-SuperHyperHamiltonian- 1427

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

Type-Cycle-Cut if it’s either of Neutrosophic e-SuperHyperHamiltonian-Type-Cycle-Cut, Neutrosophic 1428

re-SuperHyperHamiltonian-Type-Cycle-Cut, Neutrosophic v-SuperHyperHamiltonian-Type-Cycle-Cut, and 1429
Neutrosophic rv-SuperHyperHamiltonian-Type-Cycle-Cut and C(N SHG) for a Neutrosophic Su- 1430
perHyperGraph N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neut- 1431
rosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic 1432
cardinality conseNeighborive Neutrosophic SuperHyperEdges and Neutrosophic SuperHy- 1433

perVertices such that they form the Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut; an 1434

Extreme V-SuperHyperHamiltonian-Type-Cycle-Cut SuperHyperPolynomial if it’s either of Neutro- 1435
sophic e-SuperHyperHamiltonian-Type-Cycle-Cut, Neutrosophic re-SuperHyperHamiltonian-Type-Cycle-Cut, 1436
Neutrosophic v-SuperHyperHamiltonian-Type-Cycle-Cut, and Neutrosophic rv-SuperHyperHamiltonian- 1437
Type-Cycle-Cut and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme 1438
SuperHyperPolynomial contains the Extreme coefficients defined as the Extreme number 1439

of the maximum Extreme cardinality of the Extreme SuperHyperVertices of an Extreme 1440

SuperHyperSet S of high Extreme cardinality conseNeighborive Extreme SuperHyperEdges 1441
and Extreme SuperHyperVertices such that they form the Extreme SuperHyperHamiltonian- 1442
Type-Cycle-Cut; and the Extreme power is corresponded to its Extreme coefficient; a Neutro- 1443
sophic SuperHyperHamiltonian-Type-Cycle-Cut SuperHyperPolynomial if it’s either of Neutrosophic 1444
e-SuperHyperHamiltonian-Type-Cycle-Cut, Neutrosophic re-SuperHyperHamiltonian-Type-Cycle-Cut, Neutro- 1445

sophic v-SuperHyperHamiltonian-Type-Cycle-Cut, and Neutrosophic rv-SuperHyperHamiltonian-Type-Cycle- 1446

Cut and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic 1447
SuperHyperPolynomial contains the Neutrosophic coefficients defined as the Neutrosophic 1448
number of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices 1449
of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality conseNeighborive Neut- 1450
rosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the 1451

Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut; and the Neutrosophic power is correspon- 1452

ded to its Neutrosophic coefficient. In this scientific research, new setting is introduced 1453
for new SuperHyperNotions, namely, a SuperHyperHamiltonian-Type-Cycle-Cut and Neutrosophic 1454
SuperHyperHamiltonian-Type-Cycle-Cut. Two different types of SuperHyperDefinitions are debut 1455
for them but the research goes further and the SuperHyperNotion, SuperHyperUniform, and 1456
SuperHyperClass based on that are well-defined and well-reviewed. The literature review is 1457

implemented in the whole of this research. For shining the elegancy and the significancy of this 1458
research, the comparison between this SuperHyperNotion with other SuperHyperNotions and 1459
fundamental SuperHyperNumbers are featured. The definitions are followed by the examples 1460
and the instances thus the clarifications are driven with different tools. The applications are 1461
figured out to make sense about the theoretical aspect of this ongoing research. The “Cancer’s 1462

Recognition” are the under research to figure out the challenges make sense about ongoing and 1463
upcoming research. The special case is up. The cells are viewed in the deemed ways. There are 1464
different types of them. Some of them are individuals and some of them are well-modeled by 1465
the group of cells. These types are all officially called “SuperHyperVertex” but the relations 1466
amid them all officially called “SuperHyperEdge”. The frameworks “SuperHyperGraph” and 1467
“Neutrosophic SuperHyperGraph” are chosen and elected to research about “Cancer’s Recogni- 1468

tion”. Thus these complex and dense SuperHyperModels open up some avenues to research 1469
on theoretical segments and “Cancer’s Recognition”. Some avenues are posed to pursue this 1470
research. It’s also officially collected in the form of some questions and some problems. Assume 1471
a SuperHyperGraph. Assume a SuperHyperGraph. Then δ−SuperHyperHamiltonian-Type-Cycle-Cut 1472
is a maximal of SuperHyperVertices with a maximum cardinality such that either of the 1473

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

following expressions hold for the (Neutrosophic) cardinalities of SuperHyperNeighbors of 1474

s ∈ S : there are |S ∩ N (s)| > |S ∩ (V \ N (s))| + δ; and |S ∩ N (s)| < |S ∩ (V \ N (s))| + δ. The 1475
first Expression, holds if S is an δ−SuperHyperOffensive. And the second Expression, holds 1476
if S is an δ−SuperHyperDefensive; a Neutrosophic δ−SuperHyperHamiltonian-Type-Cycle-Cut is a 1477
maximal Neutrosophic of SuperHyperVertices with maximum Neutrosophic cardinality 1478
such that either of the following expressions hold for the Neutrosophic cardinalities of Super- 1479

HyperNeighbors of s ∈ S there are: |S ∩ N (s)|N eutrosophic > |S ∩ (V \ N (s))|N eutrosophic + δ; 1480

and |S ∩ N (s)|N eutrosophic < |S ∩ (V \ N (s))|N eutrosophic + δ. The first Expression, holds 1481
if S is a Neutrosophic δ−SuperHyperOffensive. And the second Expression, holds if S is 1482
a Neutrosophic δ−SuperHyperDefensive It’s useful to define a “Neutrosophic” version 1483
of a SuperHyperHamiltonian-Type-Cycle-Cut . Since there’s more ways to get type-results to 1484
make a SuperHyperHamiltonian-Type-Cycle-Cut more understandable. For the sake of having 1485

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

“SuperHyperHamiltonian-Type-Cycle-Cut ”. The SuperHyperVertices and the SuperHyperEdges are 1487
assigned by the labels from the letters of the alphabets. In this procedure, there’s the usage 1488
of the position of labels to assign to the values. Assume a SuperHyperHamiltonian-Type-Cycle-Cut . 1489
It’s redefined a Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut if the mentioned Table holds, 1490
concerning, “The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges 1491

Belong to The Neutrosophic SuperHyperGraph” with the key points, “The Values of The 1492
Vertices & The Number of Position in Alphabet”, “The Values of The SuperVertices&The 1493
maximum Values of Its Vertices”, “The Values of The Edges&The maximum Values of Its 1494
Vertices”, “The Values of The HyperEdges&The maximum Values of Its Vertices”, “The 1495
Values of The SuperHyperEdges&The maximum Values of Its Endpoints”. To get structural 1496
examples and instances, I’m going to introduce the next SuperHyperClass of SuperHyper- 1497

Graph based on a SuperHyperHamiltonian-Type-Cycle-Cut . It’s the main. It’ll be disciplinary 1498

to have the foundation of previous definition in the kind of SuperHyperClass. If there’s a 1499
need to have all SuperHyperHamiltonian-Type-Cycle-Cut until the SuperHyperHamiltonian-Type-Cycle- 1500
Cut, then it’s officially called a “SuperHyperHamiltonian-Type-Cycle-Cut” but otherwise, it isn’t a 1501
SuperHyperHamiltonian-Type-Cycle-Cut . There are some instances about the clarifications for the 1502
main definition titled a “SuperHyperHamiltonian-Type-Cycle-Cut ”. These two examples get more 1503

scrutiny and discernment since there are characterized in the disciplinary ways of the SuperHy- 1504
perClass based on a SuperHyperHamiltonian-Type-Cycle-Cut . For the sake of having a Neutrosophic 1505
SuperHyperHamiltonian-Type-Cycle-Cut, there’s a need to “redefine” the notion of a “Neutrosophic 1506
SuperHyperHamiltonian-Type-Cycle-Cut” and a “Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut ”. 1507
The SuperHyperVertices and the SuperHyperEdges are assigned by the labels from the letters of 1508

the alphabets. In this procedure, there’s the usage of the position of labels to assign to the values. 1509
Assume a Neutrosophic SuperHyperGraph. It’s redefined “Neutrosophic SuperHyperGraph” if 1510
the intended Table holds. And a SuperHyperHamiltonian-Type-Cycle-Cut are redefined to a “Neut- 1511
rosophic SuperHyperHamiltonian-Type-Cycle-Cut” if the intended Table holds. It’s useful to define 1512
“Neutrosophic” version of SuperHyperClasses. Since there’s more ways to get Neutrosophic type- 1513
results to make a Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut more understandable. Assume 1514

a Neutrosophic SuperHyperGraph. There are some Neutrosophic SuperHyperClasses if the inten- 1515
ded Table holds. Thus SuperHyperPath, SuperHyperHamiltonian-Type-Cycle-Cut, SuperHyperStar, 1516
SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, are “Neutrosophic 1517
SuperHyperPath”, “Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut”, “Neutrosophic SuperHy- 1518
perStar”, “Neutrosophic SuperHyperBipartite”, “Neutrosophic SuperHyperMultiPartite”, and 1519

Henry Garrett · 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 SuperHyperWheel” if the intended Table holds. A SuperHyperGraph has a 1520

“Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut” where it’s the strongest [the maximum Neutro- 1521
sophic value from all the SuperHyperHamiltonian-Type-Cycle-Cut amid the maximum value amid all 1522
SuperHyperVertices from a SuperHyperHamiltonian-Type-Cycle-Cut .] SuperHyperHamiltonian-Type-Cycle- 1523
Cut . A graph is a SuperHyperUniform if it’s a SuperHyperGraph and the number of elements 1524
of SuperHyperEdges are the same. Assume a Neutrosophic SuperHyperGraph. There are some 1525

SuperHyperClasses as follows. It’s SuperHyperPath if it’s only one SuperVertex as intersection 1526
amid two given SuperHyperEdges with two exceptions; it’s SuperHyperHamiltonian-Type-Cycle-Cut if 1527
it’s only one SuperVertex as intersection amid two given SuperHyperEdges; it’s SuperHyperStar 1528
it’s only one SuperVertex as intersection amid all SuperHyperEdges; it’s SuperHyperBipartite it’s 1529
only one SuperVertex as intersection amid two given SuperHyperEdges and these SuperVertices, 1530
forming two separate sets, has no SuperHyperEdge in common; it’s SuperHyperMultiPartite it’s 1531

only one SuperVertex as intersection amid two given SuperHyperEdges and these SuperVertices, 1532
forming multi separate sets, has no SuperHyperEdge in common; it’s a SuperHyperWheel if it’s 1533
only one SuperVertex as intersection amid two given SuperHyperEdges and one SuperVertex 1534
has one SuperHyperEdge with any common SuperVertex. The SuperHyperModel proposes 1535
the specific designs and the specific architectures. The SuperHyperModel is officially called 1536
“SuperHyperGraph” and “Neutrosophic SuperHyperGraph”. In this SuperHyperModel, The 1537

“specific” cells and “specific group” of cells are SuperHyperModeled as “SuperHyperVertices” 1538
and the common and intended properties between “specific” cells and “specific group” of 1539
cells are SuperHyperModeled as “SuperHyperEdges”. Sometimes, it’s useful to have some 1540
degrees of determinacy, indeterminacy, and neutrality to have more precise SuperHyperModel 1541
which in this case the SuperHyperModel is called “Neutrosophic”. In the future research, the 1542
foundation will be based on the “Cancer’s Recognition” and the results and the definitions 1543

will be introduced in redeemed ways. The recognition of the cancer in the long-term function. 1544
The specific region has been assigned by the model [it’s called SuperHyperGraph] and the 1545
long cycle of the move from the cancer is identified by this research. Sometimes the move of 1546
the cancer hasn’t be easily identified since there are some determinacy, indeterminacy and 1547
neutrality about the moves and the effects of the cancer on that region; this event leads us 1548
to choose another model [it’s said to be Neutrosophic SuperHyperGraph] to have convenient 1549

perception on what’s happened and what’s done. There are some specific models, which are 1550
well-known and they’ve got the names, and some SuperHyperGeneral SuperHyperModels. The 1551
moves and the traces of the cancer on the complex tracks and between complicated groups 1552
of cells could be fantasized by a Neutrosophic SuperHyperPath(-/SuperHyperHamiltonian-Type- 1553
Cycle-Cut, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). 1554

The aim is to find either the longest SuperHyperHamiltonian-Type-Cycle-Cut or the strongest 1555
SuperHyperHamiltonian-Type-Cycle-Cut in those Neutrosophic SuperHyperModels. For the longest 1556
SuperHyperHamiltonian-Type-Cycle-Cut, called SuperHyperHamiltonian-Type-Cycle-Cut, and the strongest 1557
SuperHyperHamiltonian-Type-Cycle-Cut, called Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut, some 1558
general results are introduced. Beyond that in SuperHyperStar, all possible SuperHyperPaths 1559
have only two SuperHyperEdges but it’s not enough since it’s essential to have at least 1560

three SuperHyperEdges to form any style of a SuperHyperHamiltonian-Type-Cycle-Cut. There isn’t 1561

any formation of any SuperHyperHamiltonian-Type-Cycle-Cut but literarily, it’s the deformation of 1562
any SuperHyperHamiltonian-Type-Cycle-Cut. It, literarily, deforms and it doesn’t form. A basic 1563
familiarity with Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut theory, SuperHyperGraphs, 1564
and Neutrosophic SuperHyperGraphs theory are proposed. 1565

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

Keywords: Neutrosophic SuperHyperGraph, SuperHyperHamiltonian-Type-Cycle-Cut, Cancer’s 1566

Neutrosophic Recognition 1567

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

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 CHAPTER 8 1569

Applied Notions Under The Scrutiny Of 1570

The Motivation Of This Scientific 1571

Research 1572

In this scientific research, there are some ideas in the featured frameworks of motivations. I 1573
try to bring the motivations in the narrative ways. Some cells have been faced with some 1574
attacks from the situation which is caused by the cancer’s attacks. In this case, there are 1575
some embedded analysis on the ongoing situations which in that, the cells could be labelled 1576

as some groups and some groups or individuals have excessive labels which all are raised from 1577
the behaviors to overcome the cancer’s attacks. In the embedded situations, the individuals 1578
of cells and the groups of cells could be considered as “new groups”. Thus it motivates us to 1579
find the proper SuperHyperModels for getting more proper analysis on this messy story. I’ve 1580
found the SuperHyperModels which are officially called “SuperHyperGraphs” and “Extreme 1581
SuperHyperGraphs”. In this SuperHyperModel, the cells and the groups of cells are defined 1582

as “SuperHyperVertices” and the relations between the individuals of cells and the groups of 1583
cells are defined as “SuperHyperEdges”. Thus it’s another motivation for us to do research 1584
on this SuperHyperModel based on the “Cancer’s Recognition”. Sometimes, the situations 1585
get worst. The situation is passed from the certainty and precise style. Thus it’s the beyond 1586
them. There are three descriptions, namely, the degrees of determinacy, indeterminacy and 1587
neutrality, for any object based on vague forms, namely, incomplete data, imprecise data, and 1588

uncertain analysis. The latter model could be considered on the previous SuperHyperModel. It’s 1589
SuperHyperModel. It’s SuperHyperGraph but it’s officially called “Extreme SuperHyperGraphs”. 1590
The cancer is the disease but the model is going to figure out what’s going on this phenomenon. 1591
The special case of this disease is considered and as the consequences of the model, some 1592
parameters are used. The cells are under attack of this disease but the moves of the cancer in 1593
the special region are the matter of mind. The recognition of the cancer could help to find some 1594

treatments for this disease. The SuperHyperGraph and Extreme SuperHyperGraph are the 1595
SuperHyperModels on the “Cancer’s Recognition” and both bases are the background of this 1596
research. Sometimes the cancer has been happened on the region, full of cells, groups of cells 1597
and embedded styles. In this segment, the SuperHyperModel proposes some SuperHyperNotions 1598
based on the connectivities of the moves of the cancer in the forms of alliances’ styles with 1599
the formation of the design and the architecture are formally called “ SuperHyperHamiltonian- 1600

Type-Cycle-Cut” in the themes of jargons and buzzwords. The prefix “SuperHyper” refers to the 1601

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

theme of the embedded styles to figure out the background for the SuperHyperNotions. The 1602
recognition of the cancer in the long-term function. The specific region has been assigned by 1603
the model [it’s called SuperHyperGraph] and the long cycle of the move from the cancer is 1604
identified by this research. Sometimes the move of the cancer hasn’t be easily identified since 1605
there are some determinacy, indeterminacy and neutrality about the moves and the effects of 1606
the cancer on that region; this event leads us to choose another model [it’s said to be Extreme 1607

SuperHyperGraph] to have convenient perception on what’s happened and what’s done. There 1608
are some specific models, which are well-known and they’ve got the names, and some general 1609
models. The moves and the traces of the cancer on the complex tracks and between complicated 1610
groups of cells could be fantasized by an Extreme SuperHyperPath (-/SuperHyperHamiltonian-Type- 1611
Cycle-Cut, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). 1612
The aim is to find either the optimal SuperHyperHamiltonian-Type-Cycle-Cut or the Extreme 1613

SuperHyperHamiltonian-Type-Cycle-Cut in those Extreme SuperHyperModels. Some general results 1614

are introduced. Beyond that in SuperHyperStar, all possible Extreme SuperHyperPath s 1615
have only two SuperHyperEdges but it’s not enough since it’s essential to have at least three 1616
SuperHyperEdges to form any style of a SuperHyperHamiltonian-Type-Cycle-Cut. There isn’t any 1617
formation of any SuperHyperHamiltonian-Type-Cycle-Cut but literarily, it’s the deformation of any 1618
SuperHyperHamiltonian-Type-Cycle-Cut. It, literarily, deforms and it doesn’t form. 1619

Question 8.0.1. How to define the SuperHyperNotions and to do research on them to find the “ 1620

amount of SuperHyperHamiltonian-Type-Cycle-Cut” of either individual of cells or the groups of cells 1621

based on the fixed cell or the fixed group of cells, extensively, the “amount of SuperHyperHamiltonian- 1622
Type-Cycle-Cut” based on the fixed groups of cells or the fixed groups of group of cells? 1623

Question 8.0.2. What are the best descriptions for the “Cancer’s Recognition” in terms of these 1624
messy and dense SuperHyperModels where embedded notions are illustrated? 1625

It’s motivation to find notions to use in this dense model is titled “SuperHyperGraphs”. Thus 1626
it motivates us to define different types of “ SuperHyperHamiltonian-Type-Cycle-Cut” and “Extreme 1627

SuperHyperHamiltonian-Type-Cycle-Cut” on “SuperHyperGraph” and “Extreme SuperHyperGraph”. 1628

Then the research has taken more motivations to define SuperHyperClasses and to find some 1629
connections amid this SuperHyperNotion with other SuperHyperNotions. It motivates us to get 1630
some instances and examples to make clarifications about the framework of this research. The 1631
general results and some results about some connections are some avenues to make key point of 1632
this research, “Cancer’s Recognition”, more understandable and more clear. 1633

The framework of this research is as follows. In the beginning, I introduce basic definitions 1634
to clarify about preliminaries. In the subsection “Preliminaries”, initial definitions about 1635
SuperHyperGraphs and Extreme SuperHyperGraph are deeply-introduced and in-depth- 1636
discussed. The elementary concepts are clarified and illustrated completely and sometimes 1637
review literature are applied to make sense about what’s going to figure out about the upcoming 1638
sections. The main definitions and their clarifications alongside some results about new 1639

notions, SuperHyperHamiltonian-Type-Cycle-Cut and Extreme SuperHyperHamiltonian-Type-Cycle-Cut, are 1640

figured out in sections “ SuperHyperHamiltonian-Type-Cycle-Cut” and “Extreme SuperHyperHamiltonian- 1641
Type-Cycle-Cut”. In the sense of tackling on getting results and in Hamiltonian-Type-Cycle-Cut to 1642
make sense about continuing the research, the ideas of SuperHyperUniform and Extreme 1643
SuperHyperUniform are introduced and as their consequences, corresponded SuperHyperClasses 1644
are figured out to debut what’s done in this section, titled “Results on SuperHyperClasses” 1645

and “Results on Extreme SuperHyperClasses”. As going back to origin of the notions, 1646

Henry Garrett · 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 smart steps toward the common notions to extend the new notions in new 1647
frameworks, SuperHyperGraph and Extreme SuperHyperGraph, in the sections “Results on 1648
SuperHyperClasses” and “Results on Extreme SuperHyperClasses”. The starter research 1649
about the general SuperHyperRelations and as concluding and closing section of theoretical 1650
research are contained in the section “General Results”. Some general SuperHyperRelations 1651
are fundamental and they are well-known as fundamental SuperHyperNotions as elicited 1652

and discussed in the sections, “General Results”, “ SuperHyperHamiltonian-Type-Cycle-Cut”, 1653

“Extreme SuperHyperHamiltonian-Type-Cycle-Cut”, “Results on SuperHyperClasses” and “Results 1654
on Extreme SuperHyperClasses”. There are curious questions about what’s done about the 1655
SuperHyperNotions to make sense about excellency of this research and going to figure out 1656
the word “best” as the description and adjective for this research as presented in section, 1657
“ SuperHyperHamiltonian-Type-Cycle-Cut”. The keyword of this research debut in the section 1658

“Applications in Cancer’s Recognition” with two cases and subsections “Case 1: The Initial 1659
Steps Toward SuperHyperBipartite as SuperHyperModel” and “Case 2: The Increasing Steps 1660
Toward SuperHyperMultipartite as SuperHyperModel”. In the section, “Open Problems”, there 1661
are some scrutiny and discernment on what’s done and what’s happened in this research in 1662
the terms of “questions” and “problems” to make sense to figure out this research in featured 1663
style. The advantages and the limitations of this research alongside about what’s done in this 1664

research to make sense and to get sense about what’s figured out are included in the section, 1665
“Conclusion and Closing Remarks”. 1666

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 CHAPTER 9 1667

Extreme Preliminaries Of This Scientific 1668

Research On the Redeemed Ways 1669

In this section, the basic material in this scientific research, is referred to [Single Valued 1670
Neutrosophic Set](Ref.[HG38],Definition 2.2,p.2), [Neutrosophic Set](Ref.[HG38],Definition 1671

2.1,p.1), [Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG38],Definition 2.5,p.2), [Charac- 1672

terization of the Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG38],Definition 2.7,p.3), 1673
[t-norm](Ref.[HG38], Definition 2.7, p.3), and [Characterization of the Neutrosophic SuperHy- 1674
perGraph (NSHG)](Ref.[HG38],Definition 2.7,p.3), [Neutrosophic Strength of the Neutrosophic 1675
SuperHyperPaths] (Ref.[HG38],Definition 5.3,p.7), and [Different Neutrosophic Types of Neut- 1676
rosophic SuperHyperEdges (NSHE)] (Ref.[HG38],Definition 5.4,p.7). Also, the new ideas and 1677

their clarifications are addressed to Ref.[HG38]. 1678

In this subsection, the basic material which is used in this scientific research, is presented. Also, 1679
the new ideas and their clarifications are elicited. 1680

Definition 9.0.1 (Neutrosophic Set). (Ref.[HG38],Definition 2.1,p.1).

Let X be a Hamiltonian-Type-Cycle-Cut of points (objects) with generic elements in X denoted by x;
then the Neutrosophic set A (NS A) is an object having the form

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

+
where the functions T, I, F : X →]− 0, 1 [ define respectively the a truth-membership
function, an indeterminacy-membership function, and a falsity-membership function
of the element x ∈ X to the set A with the condition
−
0 ≤ TA (x) + IA (x) + FA (x) ≤ 3+ .
+
The functions TA (x), IA (x) and FA (x) are real standard or nonstandard subsets of ]− 0, 1 [. 1681

Definition 9.0.2 (Single Valued Neutrosophic Set). (Ref.[HG38],Definition 2.2,p.2).

Let X be a Hamiltonian-Type-Cycle-Cut of points (objects) with generic elements in X denoted by x. A
single valued Neutrosophic set A (SVNS A) is characterized by truth-membership function
TA (x), an indeterminacy-membership function IA (x), and a falsity-membership function FA (x).
For each point x in X, TA (x), IA (x), FA (x) ∈ [0, 1]. A SVNS A can be written as

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

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

Definition 9.0.3. The degree of truth-membership, indeterminacy-membership and

falsity-membership of the subset X ⊂ A of the single valued Neutrosophic set A = {< x :
TA (x), IA (x), FA (x) >, x ∈ X}:
TA (X) = min[TA (vi ), TA (vj )]vi ,vj ∈X ,
IA (X) = min[IA (vi ), IA (vj )]vi ,vj ∈X ,
and FA (X) = min[FA (vi ), FA (vj )]vi ,vj ∈X .
Definition 9.0.4. The support of X ⊂ A of the single valued Neutrosophic set A = {< x :
TA (x), IA (x), FA (x) >, x ∈ X}:
supp(X) = {x ∈ X : TA (x), IA (x), FA (x) > 0}.
Definition 9.0.5 (Neutrosophic SuperHyperGraph (NSHG)). (Ref.[HG38],Definition 2.5,p.2). 1682
Assume V 0 is a given set. a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E), 1683
where 1684

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

(ii) V = {(Vi , TV 0 (Vi ), IV 0 (Vi ), FV 0 (Vi )) : TV 0 (Vi ), IV 0 (Vi ), FV 0 (Vi ) ≥ 0}, (i = 1, 2, . . . , n); 1686

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

(iv) E = {(Ei0 , TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 )) : TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 ) ≥ 0}, (i0 = 1688
1, 2, . . . , n0 ); 1689

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

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

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

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

(ix) and the following conditions hold:

TV0 (Ei0 ) ≤ min[TV 0 (Vi ), TV 0 (Vj )]Vi ,Vj ∈Ei0 ,
IV0 (Ei0 ) ≤ min[IV 0 (Vi ), IV 0 (Vj )]Vi ,Vj ∈Ei0 ,
and FV0 (Ei0 ) ≤ min[FV 0 (Vi ), FV 0 (Vj )]Vi ,Vj ∈Ei0
where i0 = 1, 2, . . . , n0 . 1694

Here the Neutrosophic SuperHyperEdges (NSHE) Ej 0 and the Neutrosophic SuperHyperVertices 1695
(NSHV) Vj are single valued Neutrosophic sets. TV 0 (Vi ), IV 0 (Vi ), and FV 0 (Vi ) denote the 1696

degree of truth-membership, the degree of indeterminacy-membership and the degree of 1697

falsity-membership the Neutrosophic SuperHyperVertex (NSHV) Vi to the Neutrosophic 1698
SuperHyperVertex (NSHV) V. TV0 (Ei0 ), TV0 (Ei0 ), and TV0 (Ei0 ) denote the degree of truth- 1699
membership, the degree of indeterminacy-membership and the degree of falsity-membership of 1700
the Neutrosophic SuperHyperEdge (NSHE) Ei0 to the Neutrosophic SuperHyperEdge (NSHE) 1701
E. Thus, the ii0 th element of the incidence matrix of Neutrosophic SuperHyperGraph (NSHG) 1702

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

Henry Garrett · 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 9.0.6 (Characterization of the Neutrosophic SuperHyperGraph (NSHG)). 1704

(Ref.[HG38],Definition 2.7,p.3). 1705
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). The Neutro- 1706
sophic SuperHyperEdges (NSHE) Ei0 and the Neutrosophic SuperHyperVertices (NSHV) Vi of 1707
Neutrosophic SuperHyperGraph (NSHG) S = (V, E) could be characterized as follow-up items. 1708

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

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

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

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

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

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

If we choose different types of binary operations, then we could get hugely diverse types of 1717
general forms of Neutrosophic SuperHyperGraph (NSHG). 1718

Definition 9.0.7 (t-norm). (Ref.[HG38], Definition 2.7, p.3). 1719

A binary operation ⊗ : [0, 1] × [0, 1] → [0, 1] is a t-norm if it satisfies the following for 1720
x, y, z, w ∈ [0, 1]: 1721

(i) 1 ⊗ x = x; 1722

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

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

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

Definition 9.0.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 9.0.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 9.0.10. (General Forms of Neutrosophic SuperHyperGraph (NSHG)). 1726

Assume V 0 is a given set. a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E), 1727

where 1728

Henry Garrett · 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) V = {V1 , V2 , . . . , Vn } a finite set of finite single valued Neutrosophic subsets of V 0 ; 1729

(ii) V = {(Vi , TV 0 (Vi ), IV 0 (Vi ), FV 0 (Vi )) : TV 0 (Vi ), IV 0 (Vi ), FV 0 (Vi ) ≥ 0}, (i = 1, 2, . . . , n); 1730

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

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

1, 2, . . . , n0 ); 1733

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

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

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

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

Here the Neutrosophic SuperHyperEdges (NSHE) Ej 0 and the Neutrosophic SuperHyperVertices 1738
(NSHV) Vj are single valued Neutrosophic sets. TV 0 (Vi ), IV 0 (Vi ), and FV 0 (Vi ) denote the 1739
degree of truth-membership, the degree of indeterminacy-membership and the degree of 1740
falsity-membership the Neutrosophic SuperHyperVertex (NSHV) Vi to the Neutrosophic 1741
SuperHyperVertex (NSHV) V. TV0 (Ei0 ), TV0 (Ei0 ), and TV0 (Ei0 ) denote the degree of truth- 1742

membership, the degree of indeterminacy-membership and the degree of falsity-membership of 1743

the Neutrosophic SuperHyperEdge (NSHE) Ei0 to the Neutrosophic SuperHyperEdge (NSHE) 1744
E. Thus, the ii0 th element of the incidence matrix of Neutrosophic SuperHyperGraph (NSHG) 1745
are of the form (Vi , TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 )), the sets V and E are crisp sets. 1746

Definition 9.0.11 (Characterization of the Neutrosophic SuperHyperGraph (NSHG)). 1747

(Ref.[HG38],Definition 2.7,p.3). 1748
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). The Neutro- 1749
sophic SuperHyperEdges (NSHE) Ei0 and the Neutrosophic SuperHyperVertices (NSHV) Vi of 1750
Neutrosophic SuperHyperGraph (NSHG) S = (V, E) could be characterized as follow-up items. 1751

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

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

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

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

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

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

This SuperHyperModel is too messy and too dense. Thus there’s a need to have some 1760
restrictions and conditions on SuperHyperGraph. The special case of this SuperHyperGraph 1761

makes the patterns and regularities. 1762

Definition 9.0.12. A graph is SuperHyperUniform if it’s SuperHyperGraph and the number 1763

of elements of SuperHyperEdges are the same. 1764

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

To get more visions on SuperHyperUniform, the some SuperHyperClasses are introduced. It 1765
makes to have SuperHyperUniform more understandable. 1766

Definition 9.0.13. Assume a Neutrosophic SuperHyperGraph. There are some SuperHyper- 1767
Classes as follows. 1768

(i). It’s Neutrosophic SuperHyperPath if it’s only one SuperVertex as intersection amid 1769

two given SuperHyperEdges with two exceptions; 1770

(ii). it’s SuperHyperCycle if it’s only one SuperVertex as intersection amid two given 1771
SuperHyperEdges; 1772

(iii). it’s SuperHyperStar it’s only one SuperVertex as intersection amid all SuperHyperEdges; 1773

(iv). it’s SuperHyperBipartite it’s only one SuperVertex as intersection amid two given Supe- 1774
rHyperEdges and these SuperVertices, forming two separate sets, has no SuperHyperEdge 1775

in common; 1776

(v). it’s SuperHyperMultiPartite it’s only one SuperVertex as intersection amid two 1777
given SuperHyperEdges and these SuperVertices, forming multi separate sets, has no 1778
SuperHyperEdge in common; 1779

(vi). it’s SuperHyperWheel if it’s only one SuperVertex as intersection amid two given 1780
SuperHyperEdges and one SuperVertex has one SuperHyperEdge with any common 1781
SuperVertex. 1782

Definition 9.0.14. Let a pair S = (V, E) be a Neutrosophic SuperHyperGraph (NSHG) S. Then

a sequence of Neutrosophic SuperHyperVertices (NSHV) and Neutrosophic SuperHyperEdges
(NSHE)
V1 , E1 , V2 , E2 , V3 , . . . , Vs−1 , Es−1 , Vs
is called a Neutrosophic SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex 1783
(NSHV) V1 to Neutrosophic SuperHyperVertex (NSHV) Vs if either of following conditions hold: 1784

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

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

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

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

0 0
(v) there’s a SuperVertex Vi+1 ∈ Vi+1 such that Vi , Vi+1 ∈ E i0 ; 1789

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

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

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

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

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

Henry Garrett · 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 9.0.15. (Characterization of the Neutrosophic SuperHyperPaths).

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). a Neutrosophic
SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex (NSHV) V1 to Neutrosophic
SuperHyperVertex (NSHV) Vs is sequence of Neutrosophic SuperHyperVertices (NSHV) and
Neutrosophic SuperHyperEdges (NSHE)

V1 , E1 , V2 , E2 , V3 , . . . , Vs−1 , Es−1 , Vs ,

could be characterized as follow-up items. 1794

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

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

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

(iv) if there are Vi , Ej 0 , |Vi | ≥ 1, |Ej 0 | ≥ 2, then NSHP is called Neutrosophic SuperHy- 1798
perPath . 1799

Definition 9.0.16 (Neutrosophic Strength of the Neutrosophic SuperHyperPaths).

(Ref.[HG38],Definition 5.3,p.7).
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). A Neutrosophic
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 1800

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

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

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

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

Definition 9.0.17 (Different Neutrosophic Types of Neutrosophic SuperHyperEdges (NSHE)). 1805

(Ref.[HG38],Definition 5.4,p.7). 1806
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider a 1807
Neutrosophic SuperHyperEdge (NSHE) E = {V1 , V2 , . . . , Vs }. Then E is called 1808

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

of SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex (NSHV) Vi to 1810

Neutrosophic SuperHyperVertex (NSHV) Vj where 1 ≤ i, j ≤ s; 1811

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

of SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex (NSHV) Vi to 1813

Neutrosophic SuperHyperVertex (NSHV) Vj where 1 ≤ i, j ≤ s; 1814

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

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

of SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex (NSHV) Vi to 1816
Neutrosophic SuperHyperVertex (NSHV) Vj where 1 ≤ i, j ≤ s; 1817

(xii) Neutrosophic connective if (T (E), I(E), F (E)) ≥ maximum number of Neutrosophic 1818
strength of SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex (NSHV) Vi 1819
to Neutrosophic SuperHyperVertex (NSHV) Vj where 1 ≤ i, j ≤ s. 1820

Definition 9.0.18. (Different Neutrosophic Types of Neutrosophic SuperHyperHamiltonian-Type- 1821

Cycle-Cut). 1822
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider a 1823
Neutrosophic SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and E 0 = {E1 , E2 , . . . , Ez }. Then either V 0 1824

or E 0 is called 1825

(i) Neutrosophic e-SuperHyperHamiltonian-Type-Cycle-Cut if the following expression is 1826

called Neutrosophic e-SuperHyperHamiltonian-Type-Cycle-Cut criteria holds 1827

∀Ea ∈ C : C is
a SuperHyperCycle and it has
the maximum number of SuperHyperVertices;

(ii) Neutrosophic re-SuperHyperHamiltonian-Type-Cycle-Cut if the following expression is 1828

called Neutrosophic re-SuperHyperHamiltonian-Type-Cycle-Cut criteria holds 1829

∀Ea ∈ C : C is
a SuperHyperCycle and it has
the maximum number of SuperHyperVertices;

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

(iii) Neutrosophic v-SuperHyperHamiltonian-Type-Cycle-Cut if the following expression is 1831

called Neutrosophic v-SuperHyperHamiltonian-Type-Cycle-Cut criteria holds 1832

∀Va ∈ C : C is
a SuperHyperCycle and it has
the maximum number of SuperHyperVertices;

(iv) Neutrosophic rv-SuperHyperHamiltonian-Type-Cycle-Cut if the following expression is 1833

called Neutrosophic v-SuperHyperHamiltonian-Type-Cycle-Cut criteria holds 1834

∀Va ∈ C : C is
a SuperHyperCycle and it has
the maximum number of SuperHyperVertices;

and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; 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

(v) Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut if it’s either of Neutro- 1836

sophic e-SuperHyperHamiltonian-Type-Cycle-Cut, Neutrosophic re-SuperHyperHamiltonian-Type- 1837
Cycle-Cut, Neutrosophic v-SuperHyperHamiltonian-Type-Cycle-Cut, and Neutrosophic rv- 1838
SuperHyperHamiltonian-Type-Cycle-Cut. 1839

Definition 9.0.19. ((Neutrosophic) SuperHyperHamiltonian-Type-Cycle-Cut). 1840

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider a 1841
Neutrosophic SuperHyperEdge (NSHE) E = {V1 , V2 , . . . , Vs }. Then E is called 1842

(i) an Extreme SuperHyperHamiltonian-Type-Cycle-Cut if it’s either of Neutro- 1843

sophic e-SuperHyperHamiltonian-Type-Cycle-Cut, Neutrosophic re-SuperHyperHamiltonian-Type- 1844
Cycle-Cut, Neutrosophic v-SuperHyperHamiltonian-Type-Cycle-Cut, and Neutrosophic rv- 1845
SuperHyperHamiltonian-Type-Cycle-Cut and C(N SHG) for an Extreme SuperHyperGraph 1846

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

of high Extreme cardinality of the Extreme SuperHyperEdges in the conseNeighborive 1848
Extreme sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such 1849
that they form the Extreme SuperHyperHamiltonian-Type-Cycle-Cut; 1850

(ii) a Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut if it’s either of Neutro- 1851

sophic e-SuperHyperHamiltonian-Type-Cycle-Cut, Neutrosophic re-SuperHyperHamiltonian-Type- 1852
Cycle-Cut, Neutrosophic v-SuperHyperHamiltonian-Type-Cycle-Cut, and Neutrosophic rv- 1853
SuperHyperHamiltonian-Type-Cycle-Cut and C(N SHG) for a Neutrosophic SuperHyperGraph 1854
N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic Su- 1855

perHyperEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 1856

conseNeighborive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices 1857
such that they form the Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut; 1858

(iii) an Extreme SuperHyperHamiltonian-Type-Cycle-Cut SuperHyperPolynomial if 1859

it’s either of Neutrosophic e-SuperHyperHamiltonian-Type-Cycle-Cut, Neutrosophic re- 1860
SuperHyperHamiltonian-Type-Cycle-Cut, Neutrosophic v-SuperHyperHamiltonian-Type-Cycle-Cut, and 1861
Neutrosophic rv-SuperHyperHamiltonian-Type-Cycle-Cut and C(N SHG) for an Extreme Super- 1862
HyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme 1863
coefficients defined as the Extreme number of the maximum Extreme cardinality of the 1864

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

conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVertices such 1866
that they form the Extreme SuperHyperHamiltonian-Type-Cycle-Cut; and the Extreme power is 1867
corresponded to its Extreme coefficient; 1868

(iv) a Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut SuperHyperPolynomial 1869

if it’s either of Neutrosophic e-SuperHyperHamiltonian-Type-Cycle-Cut, Neutrosophic re- 1870
SuperHyperHamiltonian-Type-Cycle-Cut, Neutrosophic v-SuperHyperHamiltonian-Type-Cycle-Cut, and 1871
Neutrosophic rv-SuperHyperHamiltonian-Type-Cycle-Cut and C(N SHG) for a Neutrosophic 1872

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

the Neutrosophic coefficients defined as the Neutrosophic number of the maximum 1874
Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic 1875
SuperHyperSet S of high Neutrosophic cardinality conseNeighborive Neutrosophic Super- 1876
HyperEdges and Neutrosophic SuperHyperVertices such that they form the Neutrosophic 1877
SuperHyperHamiltonian-Type-Cycle-Cut; and the Neutrosophic power is corresponded to its 1878

Neutrosophic coefficient; 1879

Henry Garrett · 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) an Extreme V-SuperHyperHamiltonian-Type-Cycle-Cut if it’s either of Neutro- 1880

sophic e-SuperHyperHamiltonian-Type-Cycle-Cut, Neutrosophic re-SuperHyperHamiltonian-Type- 1881
Cycle-Cut, Neutrosophic v-SuperHyperHamiltonian-Type-Cycle-Cut, and Neutrosophic rv- 1882
SuperHyperHamiltonian-Type-Cycle-Cut and C(N SHG) for an Extreme SuperHyperGraph 1883
N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of 1884
high Extreme cardinality of the Extreme SuperHyperVertices in the conseNeighborive 1885

Extreme sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such 1886

that they form the Extreme SuperHyperHamiltonian-Type-Cycle-Cut; 1887

(vi) a Neutrosophic V-SuperHyperHamiltonian-Type-Cycle-Cut if it’s either of Neut- 1888

rosophic e-SuperHyperHamiltonian-Type-Cycle-Cut, Neutrosophic re-SuperHyperHamiltonian- 1889
Type-Cycle-Cut, Neutrosophic v-SuperHyperHamiltonian-Type-Cycle-Cut, and Neutrosophic rv- 1890

SuperHyperHamiltonian-Type-Cycle-Cut and C(N SHG) for a Neutrosophic SuperHyperGraph 1891

N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic Supe- 1892
rHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 1893
conseNeighborive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices 1894
such that they form the Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut; 1895

(vii) an Extreme V-SuperHyperHamiltonian-Type-Cycle-Cut SuperHyperPolynomial 1896

if it’s either of Neutrosophic e-SuperHyperHamiltonian-Type-Cycle-Cut, Neutrosophic re- 1897
SuperHyperHamiltonian-Type-Cycle-Cut, Neutrosophic v-SuperHyperHamiltonian-Type-Cycle-Cut, and 1898
Neutrosophic rv-SuperHyperHamiltonian-Type-Cycle-Cut and C(N SHG) for an Extreme Super- 1899
HyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme 1900
coefficients defined as the Extreme number of the maximum Extreme cardinality of the 1901

Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality 1902

conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVertices such 1903
that they form the Extreme SuperHyperHamiltonian-Type-Cycle-Cut; and the Extreme power is 1904
corresponded to its Extreme coefficient; 1905

(viii) a Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut SuperHyperPolynomial 1906

if it’s either of Neutrosophic e-SuperHyperHamiltonian-Type-Cycle-Cut, Neutrosophic re- 1907

SuperHyperHamiltonian-Type-Cycle-Cut, Neutrosophic v-SuperHyperHamiltonian-Type-Cycle-Cut, and 1908
Neutrosophic rv-SuperHyperHamiltonian-Type-Cycle-Cut and C(N SHG) for a Neutrosophic 1909
SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains 1910
the Neutrosophic coefficients defined as the Neutrosophic number of the maximum 1911
Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic 1912

SuperHyperSet S of high Neutrosophic cardinality conseNeighborive Neutrosophic Super- 1913

HyperEdges and Neutrosophic SuperHyperVertices such that they form the Neutrosophic 1914
SuperHyperHamiltonian-Type-Cycle-Cut; and the Neutrosophic power is corresponded to its 1915
Neutrosophic coefficient. 1916

Definition 9.0.20. ((Extreme/Neutrosophic)δ−SuperHyperHamiltonian-Type-Cycle-Cut). 1917

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

(i) an δ−SuperHyperHamiltonian-Type-Cycle-Cut is a Neutrosophic kind of Neutrosophic 1919

SuperHyperHamiltonian-Type-Cycle-Cut such that either of the following expressions hold for 1920

Henry Garrett · 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 9.1: The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges
Belong to The Neutrosophic SuperHyperGraph Mentioned in the Definition (29.0.23)

The Values of The Vertices The Number of Position in Alphabet

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

the Neutrosophic cardinalities of SuperHyperNeighbors of s ∈ S : 1921

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

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

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

(29.1), holds if S is an δ−SuperHyperDefensive; 1923

(ii) a Neutrosophic δ−SuperHyperHamiltonian-Type-Cycle-Cut is a Neutrosophic kind of 1924

Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut such that either of the following Neut- 1925
rosophic expressions hold for the Neutrosophic cardinalities of SuperHyperNeighbors of 1926
s∈S: 1927

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

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

The Expression (29.1), holds if S is a Neutrosophic δ−SuperHyperOffensive. And 1928

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

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

“redefine” the notion of “Neutrosophic SuperHyperGraph”. The SuperHyperVertices and the 1931
SuperHyperEdges are assigned by the labels from the letters of the alphabets. In this procedure, 1932
there’s the usage of the position of labels to assign to the values. 1933

136DEF1 Definition 9.0.21. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 1934
It’s redefined Neutrosophic SuperHyperGraph if the Table (29.1) holds. 1935

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

to get Neutrosophic type-results to make a Neutrosophic more understandable. 1937

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

(V, E). There are some Neutrosophic SuperHyperClasses if the Table (29.2) holds. 1939
Thus Neutrosophic SuperHyperPath , SuperHyperHamiltonian-Type-Cycle-Cut, SuperHyperStar, 1940
SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, are Neutrosophic 1941
SuperHyperPath, Neutrosophic SuperHyperCycle, Neutrosophic SuperHyperStar, 1942
Neutrosophic SuperHyperBipartite, Neutrosophic SuperHyperMultiPartite, and 1943

Neutrosophic SuperHyperWheel if the Table (29.2) holds. 1944

Henry Garrett · 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 9.2: The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges
Belong to The Neutrosophic SuperHyperGraph, Mentioned in the Definition (29.0.22)

The Values of The Vertices The Number of Position in Alphabet

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

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

The Values of The Vertices The Number of Position in Alphabet

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

It’s useful to define a “Neutrosophic” version of a Neutrosophic SuperHyperHamiltonian-Type-Cycle- 1945

Cut. Since there’s more ways to get type-results to make a Neutrosophic SuperHyperHamiltonian- 1946
Type-Cycle-Cut more Neutrosophicly understandable. 1947
For the sake of having a Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut, there’s a need to 1948

“redefine” the Neutrosophic notion of “Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut”. The 1949

SuperHyperVertices and the SuperHyperEdges are assigned by the labels from the letters of the 1950
alphabets. In this procedure, there’s the usage of the position of labels to assign to the values. 1951
1952

136DEF1 Definition 9.0.23. Assume a SuperHyperHamiltonian-Type-Cycle-Cut. It’s redefined a Neutrosophic 1953

SuperHyperHamiltonian-Type-Cycle-Cut if the Table (29.3) holds. 1954

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 CHAPTER 10 1955

Extreme SuperHyper But As The Hamiltonian-Type-Cycle-Cut 1956

Extensions Excerpt From Dense And 1957

Super Forms 1958

Definition 10.0.1. (Extreme event). 1959

Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) 1960
is a probability Hamiltonian-Type-Cycle-Cut. Any Extreme k-subset of A of V is called Extreme 1961
k-event and if k = 2, then Extreme subset of A of V is called Extreme event. The following 1962
expression is called Extreme probability of A. 1963

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

Definition 10.0.2. (Extreme Independent). 1964

Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) 1965

is a probability Hamiltonian-Type-Cycle-Cut. s Extreme k-events Ai , i ∈ I is called Extreme s- 1966

independent if the following expression is called Extreme s-independent criteria 1967

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

And if s = 2, then Extreme k-events of A and B is called Extreme independent. The 1968

following expression is called Extreme independent criteria 1969

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

Definition 10.0.3. (Extreme Variable). 1970

Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) 1971

is a probability Hamiltonian-Type-Cycle-Cut. Any k-function Hamiltonian-Type-Cycle-Cut like E is called 1972

Extreme k-Variable. If k = 2, then any 2-function Hamiltonian-Type-Cycle-Cut like E is called 1973
Extreme Variable. 1974

The notion of independent on Extreme Variable is likewise. 1975

Definition 10.0.4. (Extreme Expectation). 1976

Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) is 1977

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

a probability Hamiltonian-Type-Cycle-Cut. an Extreme k-Variable E has a number is called Extreme 1978

Expectation if the following expression is called Extreme Expectation criteria 1979

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

Definition 10.0.5. (Extreme Crossing). 1980

Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) is 1981

a probability Hamiltonian-Type-Cycle-Cut. an Extreme number is called Extreme Crossing if the 1982

following expression is called Extreme Crossing criteria 1983

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

Lemma 10.0.6. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 1984
S = (V, E) is a probability Hamiltonian-Type-Cycle-Cut. Let m and n propose special Hamiltonian-Type-Cycle- 1985
Cut. Then with m ≥ 4n, 1986

Proof. Consider a planar embedding G of G with cr(G) crossings. Let S be an Extreme random
k-subset of V obtained by choosing each SuperHyperVertex of G Extreme independently with
probability Hamiltonian-Type-Cycle-Cut p := 4n/m, and set H := G[S] and H := G[S].
Define random variables X, Y, Z on V as follows: X is the Extreme number of SuperHyperVer-
tices, Y the Extreme number of SuperHyperEdges, and Z the Extreme number of crossings of H.
The trivial bound noted above, when applied to H, yields the inequality Z ≥ cr(H) ≥ Y − 3X.
By linearity of Extreme Expectation,

E(Z) ≥ E(Y ) − 3E(X).

Now E(X) = pn, E(Y ) = p2 m (each SuperHyperEdge having some SuperHyperEnds) and
E(Z) = p4 cr(G) (each crossing being defined by some SuperHyperVertices). Hence

p4 cr(G) ≥ p2 m − 3pn.

Dividing both sides by p4 , we have: 1987

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

 1988

Theorem 10.0.7. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). 1989
Consider S = (V, E) is a probability Hamiltonian-Type-Cycle-Cut. Let P be a SuperHyperSet of n points 1990
in the plane, and let l be the Extreme number √ of SuperHyperLines in the plane passing through 1991
at least k + 1 of these points, where 1 ≤ k ≤ 2 2n. Then l < 32n2 /k 3 . 1992

Proof. Form an Extreme SuperHyperGraph G with SuperHyperVertex SuperHyperSet P whose 1993

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

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

Theorem 10.0.8. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). 1999
Consider S = (V, E) is a probability Hamiltonian-Type-Cycle-Cut. Let P be a SuperHyperSet of n points 2000
in the plane, and let k be the number of pairs of points of P at unit SuperHyperDistance. Then 2001
k < 5n4/3 . 2002

Proof. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 2003
S = (V, E) is a probability Hamiltonian-Type-Cycle-Cut. Draw a SuperHyperUnit SuperHyperCircle 2004
around each SuperHyperPoint of P. Let ni be the P Extreme number of these SuperHyperCircles 2005
i = 0n−1 ni = n and k = 12 i = 0n−1 ini .
P
passing through exactly i points of P. Then 2006

Now form an Extreme SuperHyperGraph H with SuperHyperVertex SuperHyperSet P whose 2007

SuperHyperEdges are the SuperHyperArcs between conseNeighborive SuperHyperPoints on the 2008
SuperHyperCircles that pass through at least three SuperHyperPoints of P. Then 2009

n−1
X
e(H) = ini = 2k − n1 − 2n2 ≥ 2k − 2n.
i=3

Some SuperHyperPairs of SuperHyperVertices of H might be joined by some parallel 2010

SuperHyperEdges. Delete from H one of each SuperHyperPair of parallel SuperHyperEdges, so 2011

as to obtain a simple Extreme SuperHyperGraph G with e(G) ≥ k − n. Now cr(G) ≤ n(n − 1) 2012
because G is formed from at most n SuperHyperCircles, and any two SuperHyperCircles cross 2013
at most twice. Thus either e(G) < 4n, in which case k < 5n < 5n4/3 , or n2 > n(n − 1) ≥ 2014
3
cr(G) ≥ (k − n) /64n2 by the Extreme Crossing Lemma, and k < 4n4/3 + n < 5n4/3 .  2015

Proposition 10.0.9. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). 2016
Consider S = (V, E) is a probability Hamiltonian-Type-Cycle-Cut. Let X be a nonnegative Extreme 2017
Variable and t a positive real number. Then 2018

E(X)
P (X ≥ t) ≤ .
t
Proof.
X X
E(X) = {X(a)P (a) : a ∈ V } ≥ {X(a)P (a) : a ∈ V, X(a) ≥ t}
X X
{tP (a) : a ∈ V, X(a) ≥ t} = t {P (a) : a ∈ V, X(a) ≥ t}
tP (X ≥ t).

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

Corollary 10.0.10. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). 2020
Consider S = (V, E) is a probability Hamiltonian-Type-Cycle-Cut. Let Xn be a nonnegative integer- 2021

valued variable in a prob- ability Hamiltonian-Type-Cycle-Cut (Vn , En ), n ≥ 1. If E(Xn ) → 0 as n → ∞, 2022

then P (Xn = 0) → 1 as n → ∞. 2023

Proof.  2024

Theorem 10.0.11. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). 2025
Consider S = (V, E) is a probability Hamiltonian-Type-Cycle-Cut. A special SuperHyperGraph in Gn,p 2026

almost surely has stability number at most d2p−1 log ne. 2027

Henry Garrett · 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. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 2028
S = (V, E) is a probability Hamiltonian-Type-Cycle-Cut. A special SuperHyperGraph in Gn,p is 2029
up. Let G ∈ Gn,p and let S be a given SuperHyperSet of k + 1 SuperHyperVertices of G, 2030
where k ∈ N. The probability that S is a stable SuperHyperSet of G is (1 − p)(k+1)choose2 , this 2031
being the probability that none of the (k + 1)choose2 pairs of SuperHyperVertices of S is a 2032
SuperHyperEdge of the Extreme SuperHyperGraph G. 2033

Let AS denote the event that S is a stable SuperHyperSet of G, and let XS denote the indicator 2034
Extreme Variable for this Extreme Event. By equation, we have 2035

E(XS ) = P (XS = 1) = P (AS ) = (1 − p)(k+1)choose2 .

Let X be the number of stable SuperHyperSets of cardinality k + 1 in G. Then 2036

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

and so, by those, 2037

X
E(X) = {E(XS ) : S ⊆ V, |S| = k + 1} = (n choose k+1)(1 − p)(k+1)choose2 .

We bound the right-hand side by invoking two elementary inequalities: 2038

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

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

nk+1 e−p)(k+1)choose2 ne−pk/2k+1

E(X) ≤ =
(k + 1)! (k + 1)!

Suppose now that k = d2p−1 log ne. Then k ≥ 2p−1 log n, so ne−pk/2 ≤ 1. Because k grows at 2040

least as fast as the logarithm of n, implies that E(X) → 0 as n → ∞. Because X is integer-valued 2041
and nonnegative, we deduce from Corollary that P (X = 0) → 1 as n → ∞. Consequently, an 2042
Extreme SuperHyperGraph in Gn,p almost surely has stability number at most k.  2043

Definition 10.0.12. (Extreme Variance). 2044

Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) is 2045
a probability Hamiltonian-Type-Cycle-Cut. an Extreme k-Variable E has a number is called Extreme 2046

Variance if the following expression is called Extreme Variance criteria 2047

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

Theorem 10.0.13. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). 2048
Consider S = (V, E) is a probability Hamiltonian-Type-Cycle-Cut. Let X be an Extreme Variable and 2049
let t be a positive real number. Then 2050

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

Henry Garrett · 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. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 2051
S = (V, E) is a probability Hamiltonian-Type-Cycle-Cut. Let X be an Extreme Variable and let t be a 2052
positive real number. Then 2053

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

Corollary 10.0.14. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). 2055

Consider S = (V, E) is a probability Hamiltonian-Type-Cycle-Cut. Let Xn be an Extreme Variable in a 2056

probability Hamiltonian-Type-Cycle-Cut (Vn , En ), n ≥ 1. If Ex(Xn ) 6= 0 and V (Xn ) << E 2 (Xn ), then 2057

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

Proof. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 2058
S = (V, E) is a probability Hamiltonian-Type-Cycle-Cut. Set X := Xn and t := |Ex(Xn )| in 2059
Chebyshev’s Inequality, and observe that E(Xn = 0) ≤ E(|Xn − Ex(Xn )| ≥ |Ex(Xn )|) because 2060

|Xn − Ex(Xn )| = |Ex(Xn )| when Xn = 0.  2061

Theorem 10.0.15. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). 2062
Consider S = (V, E) is a probability Hamiltonian-Type-Cycle-Cut. Let G ∈ Gn,1/2 . For 0 ≤ k ≤ n, set 2063

f (k) := (n choose k)2−(k choose 2) and let k ∗ be the least value of k for which f (k) is less than 2064
one. Then almost surely α(G) takes one of the three values k ∗ − 2, k ∗ − 1, k ∗ . 2065

Proof. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 2066
S = (V, E) is a probability Hamiltonian-Type-Cycle-Cut. As in the proof of related Theorem, the result 2067
is straightforward.  2068

Corollary 10.0.16. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). 2069
Consider S = (V, E) is a probability Hamiltonian-Type-Cycle-Cut. Let G ∈ Gn,1/2 and let f and k ∗ be 2070
as defined in previous Theorem. Then either: 2071

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

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

Proof. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 2074
S = (V, E) is a probability Hamiltonian-Type-Cycle-Cut. The latter is straightforward.  2075

Definition 10.0.17. (Extreme Threshold). 2076

Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) is 2077
a probability Hamiltonian-Type-Cycle-Cut. Let P be a monotone property of SuperHyperGraphs (one 2078
which is preserved when SuperHyperEdges are added). Then a Extreme Threshold for P is 2079
a function f (n) such that: 2080

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

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

Henry Garrett · 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 10.0.18. (Extreme Balanced). 2083

Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) is 2084
a probability Hamiltonian-Type-Cycle-Cut. Let F be a fixed Extreme SuperHyperGraph. Then 2085
there is a threshold function for the property of containing a copy of F as an Extreme 2086
SubSuperHyperGraph is called Extreme Balanced. 2087

Theorem 10.0.19. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). 2088
Consider S = (V, E) is a probability Hamiltonian-Type-Cycle-Cut. Let F be a nonempty balanced 2089

Extreme SubSuperHyperGraph with k SuperHyperVertices and l SuperHyperEdges. Then n−k/l 2090

is a threshold function for the property of containing F as an Extreme SubSuperHyperGraph. 2091

Proof. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 2092
S = (V, E) is a probability Hamiltonian-Type-Cycle-Cut. The latter is straightforward.  2093

136EXM1 Example 10.0.20. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E) in 2094
the mentioned Extreme Figures in every Extreme items. 2095

• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme 2096

SuperHyperHamiltonian-Type-Cycle-Cut, is up. The Extreme Algorithm is Extremely straight- 2097
forward. E1 and E3 are some empty Extreme SuperHyperEdges but E2 is a loop Extreme 2098
SuperHyperEdge and E4 is an Extreme SuperHyperEdge. Thus in the terms of Extreme 2099
SuperHyperNeighbor, there’s only one Extreme SuperHyperEdge, namely, E4 . The 2100
Extreme SuperHyperVertex, V3 is Extreme isolated means that there’s no Extreme 2101

SuperHyperEdge has it as an Extreme endpoint. Thus the Extreme SuperHyperVertex, 2102

V3 , is excluded in every given Extreme SuperHyperHamiltonian-Type-Cycle-Cut. 2103

C(N SHG)Extreme Hamiltonian-Type-Cycle-Cut

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

2104

• On the Figure (30.2), the Extreme SuperHyperNotion, namely, Extreme 2105

SuperHyperHamiltonian-Type-Cycle-Cut, is up. The Extreme Algorithm is Extremely straight- 2106

forward. E1 , E2 and E3 are some empty Extreme SuperHyperEdges but E4 is an Extreme 2107
SuperHyperEdge. Thus in the terms of Extreme SuperHyperNeighbor, there’s only 2108
one Extreme SuperHyperEdge, namely, E4 . The Extreme SuperHyperVertex, V3 is 2109
Extreme isolated means that there’s no Extreme SuperHyperEdge has it as an Extreme 2110
endpoint. Thus the Extreme SuperHyperVertex, V3 , is excluded in every given Extreme 2111
SuperHyperHamiltonian-Type-Cycle-Cut. 2112

C(N SHG)Extreme Hamiltonian-Type-Cycle-Cut

Henry Garrett · 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.1: The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
SuperHyperHamiltonian-Type-Cycle-Cut in the Extreme Example (42.0.3) 136NSHG1

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

• On the Figure (30.3), the Extreme SuperHyperNotion, namely, Extreme 2114

SuperHyperHamiltonian-Type-Cycle-Cut, is up. The Extreme Algorithm is Extremely straight- 2115
forward. 2116

C(N SHG)Extreme Hamiltonian-Type-Cycle-Cut

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

Henry Garrett · 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.2: The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
SuperHyperHamiltonian-Type-Cycle-Cut in the Extreme Example (42.0.3) 136NSHG2

Figure 10.3: The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
SuperHyperHamiltonian-Type-Cycle-Cut in the Extreme Example (42.0.3) 136NSHG3

Henry Garrett · 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.4: The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
SuperHyperHamiltonian-Type-Cycle-Cut in the Extreme Example (42.0.3) 136NSHG4

• On the Figure (30.4), the Extreme SuperHyperNotion, namely, Extreme 2118

SuperHyperHamiltonian-Type-Cycle-Cut, is up. The Extreme Algorithm is Extremely straight- 2119
forward. 2120

C(N SHG)Extreme Hamiltonian-Type-Cycle-Cut

= {E4 }.
C(N SHG)Extreme Hamiltonian-Type-Cycle-Cut SuperHyperPolynomial
= z5.
C(N SHG)Extreme V-Hamiltonian-Type-Cycle-Cut
= {V1 , V2 , V3 , {N }, {F }}.
C(N SHG)Extreme V-Hamiltonian-Type-Cycle-Cut SuperHyperPolynomial
= z 4 + z 3 + z 2 + 2z.

2121

• On the Figure (30.5), the Extreme SuperHyperNotion, namely, Extreme 2122

SuperHyperHamiltonian-Type-Cycle-Cut, is up. The Extreme Algorithm is Extremely straight- 2123

forward. 2124

C(N SHG)Extreme Hamiltonian-Type-Cycle-Cut

= {E1 }.
C(N SHG)Extreme Hamiltonian-Type-Cycle-Cut SuperHyperPolynomial
= z5.
C(N SHG)Extreme V-Hamiltonian-Type-Cycle-Cut

Henry Garrett · 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.5: The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
SuperHyperHamiltonian-Type-Cycle-Cut in the Extreme Example (42.0.3) 136NSHG5

= {V1 , V2 , V3 , V4 , V5 }.
C(N SHG)Extreme V-Hamiltonian-Type-Cycle-Cut SuperHyperPolynomial
= z 7 + 2z 4 + z 3 + z 2 .

2125

• On the Figure (30.6), the Extreme SuperHyperNotion, namely, Extreme 2126

SuperHyperHamiltonian-Type-Cycle-Cut, is up. The Extreme Algorithm is Extremely straight- 2127
forward. 2128

C(N SHG)Extreme Hamiltonian-Type-Cycle-Cut

= {Ei=110 , Ej=2232 , E12 }.
C(N SHG)Extreme Hamiltonian-Type-Cycle-Cut SuperHyperPolynomial
= 22z 2 .
C(N SHG)Extreme V-Hamiltonian-Type-Cycle-Cut
= {Vi ∈ VN SHG }.
C(N SHG)Extreme V-Hamiltonian-Type-Cycle-Cut SuperHyperPolynomial
X
= ai z bj .

2129

Henry Garrett · 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.6: The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
SuperHyperHamiltonian-Type-Cycle-Cut in the Extreme Example (42.0.3) 136NSHG6

• On the Figure (30.7), the Extreme SuperHyperNotion, namely, Extreme 2130

SuperHyperHamiltonian-Type-Cycle-Cut, is up. The Extreme Algorithm is Extremely straight- 2131

forward. 2132

C(N SHG)Extreme Hamiltonian-Type-Cycle-Cut

= {E15 , E13 , E16 , E14 , E17 , E12 }.
C(N SHG)Extreme Hamiltonian-Type-Cycle-Cut SuperHyperPolynomial
= 2z 5 + z 4 + 3z 2 .
C(N SHG)Extreme V-Hamiltonian-Type-Cycle-Cut
= {Vi ∈ VN SHG }.
C(N SHG)Extreme V-Hamiltonian-Type-Cycle-Cut SuperHyperPolynomial
X
= ai z bj .

2133

• On the Figure (30.8), the Extreme SuperHyperNotion, namely, Extreme 2134

SuperHyperHamiltonian-Type-Cycle-Cut, is up. The Extreme Algorithm is Extremely straight- 2135
forward. 2136

C(N SHG)Extreme Hamiltonian-Type-Cycle-Cut

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

Figure 10.7: The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
SuperHyperHamiltonian-Type-Cycle-Cut in the Extreme Example (42.0.3) 136NSHG7

C(N SHG)Extreme Hamiltonian-Type-Cycle-Cut SuperHyperPolynomial

= z5.
C(N SHG)Extreme V-Hamiltonian-Type-Cycle-Cut
= {Vi=811 , V!4 }.
C(N SHG)Extreme V-Hamiltonian-Type-Cycle-Cut SuperHyperPolynomial
= z 6 + 3z 5 + z 4 .

2137

• On the Figure (30.9), the Extreme SuperHyperNotion, namely, Extreme 2138

SuperHyperHamiltonian-Type-Cycle-Cut, is up. The Extreme Algorithm is Extremely straight- 2139

forward. 2140

C(N SHG)Extreme Hamiltonian-Type-Cycle-Cut

= {Ei=110 , E22 , E12 }.
C(N SHG)Extreme Hamiltonian-Type-Cycle-Cut SuperHyperPolynomial
= z 11 + 11z 2 .
C(N SHG)Extreme V-Hamiltonian-Type-Cycle-Cut
= {Vi ∈ VN SHG }.
C(N SHG)Extreme V-Hamiltonian-Type-Cycle-Cut SuperHyperPolynomial
X
= ai z bj .

Henry Garrett · 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.8: The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
SuperHyperHamiltonian-Type-Cycle-Cut in the Extreme Example (42.0.3) 136NSHG8

2141

• On the Figure (30.10), the Extreme SuperHyperNotion, namely, Extreme 2142

SuperHyperHamiltonian-Type-Cycle-Cut, is up. The Extreme Algorithm is Extremely straight- 2143
forward. 2144

C(N SHG)Extreme Hamiltonian-Type-Cycle-Cut

= {E1 , E6 , E2 , E7 , E3 , E4 }.
C(N SHG)Extreme Hamiltonian-Type-Cycle-Cut SuperHyperPolynomial
= 2z 5 + z 4 + 3z 2 .
C(N SHG)Extreme V-Hamiltonian-Type-Cycle-Cut
= {Vi ∈ VN SHG }.
C(N SHG)Extreme V-Hamiltonian-Type-Cycle-Cut SuperHyperPolynomial
X
= ai z bj .

2145

• On the Figure (30.11), the Extreme SuperHyperNotion, namely, Extreme 2146

SuperHyperHamiltonian-Type-Cycle-Cut, is up. The Extreme Algorithm is Extremely straight- 2147

Henry Garrett · 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.9: The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
SuperHyperHamiltonian-Type-Cycle-Cut in the Extreme Example (42.0.3) 136NSHG9

Figure 10.10: The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
SuperHyperHamiltonian-Type-Cycle-Cut in the Extreme Example (42.0.3) 136NSHG10

Henry Garrett · 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.11: The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
SuperHyperHamiltonian-Type-Cycle-Cut in the Extreme Example (42.0.3) 136NSHG11

forward. 2148

C(N SHG)Extreme Hamiltonian-Type-Cycle-Cut

= {E1 , E6 , E3 , E8 }.
C(N SHG)Extreme Hamiltonian-Type-Cycle-Cut SuperHyperPolynomial
= 2z 3 + 2z 2 .
C(N SHG)Extreme V-Hamiltonian-Type-Cycle-Cut
= {Vi ∈ VN SHG }.
C(N SHG)Extreme V-Hamiltonian-Type-Cycle-Cut SuperHyperPolynomial
X
= ai z bj .

2149

• On the Figure (30.12), the Extreme SuperHyperNotion, namely, Extreme 2150

SuperHyperHamiltonian-Type-Cycle-Cut, is up. The Extreme Algorithm is Extremely straight- 2151
forward. 2152

C(N SHG)Extreme Hamiltonian-Type-Cycle-Cut

= {E1 }.
C(N SHG)Extreme Hamiltonian-Type-Cycle-Cut SuperHyperPolynomial
= z5.

Henry Garrett · 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.12: The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
SuperHyperHamiltonian-Type-Cycle-Cut in the Extreme Example (42.0.3) 136NSHG12

C(N SHG)Extreme V-Hamiltonian-Type-Cycle-Cut

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

2153

• On the Figure (30.13), the Extreme SuperHyperNotion, namely, Extreme 2154

SuperHyperHamiltonian-Type-Cycle-Cut, is up. The Extreme Algorithm is Extremely straight- 2155
forward. 2156

C(N SHG)Extreme Hamiltonian-Type-Cycle-Cut

= {E9 , E6 , E3 , E8 }.
C(N SHG)Extreme Hamiltonian-Type-Cycle-Cut SuperHyperPolynomial
= 2z 3 + 2z 2 .
C(N SHG)Extreme V-Hamiltonian-Type-Cycle-Cut
= {Vi ∈ VN SHG }.
C(N SHG)Extreme V-Hamiltonian-Type-Cycle-Cut SuperHyperPolynomial
X
= ai z bj .

2157

Henry Garrett · 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.13: The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
SuperHyperHamiltonian-Type-Cycle-Cut in the Extreme Example (42.0.3) 136NSHG13

• On the Figure (30.14), the Extreme SuperHyperNotion, namely, Extreme 2158

SuperHyperHamiltonian-Type-Cycle-Cut, is up. The Extreme Algorithm is Extremely straight- 2159
forward. 2160

C(N SHG)Extreme Hamiltonian-Type-Cycle-Cut

= {}.
C(N SHG)Extreme Hamiltonian-Type-Cycle-Cut SuperHyperPolynomial
= 0z 0 .
C(N SHG)Extreme V-Hamiltonian-Type-Cycle-Cut
= {}.
C(N SHG)Extreme V-Hamiltonian-Type-Cycle-Cut SuperHyperPolynomial
= 0z 0 .

2161

• On the Figure (30.15), the Extreme SuperHyperNotion, namely, Extreme 2162

SuperHyperHamiltonian-Type-Cycle-Cut, is up. The Extreme Algorithm is Extremely straight- 2163

forward. 2164

C(N SHG)Extreme Hamiltonian-Type-Cycle-Cut

= {E4 }.
C(N SHG)Extreme Hamiltonian-Type-Cycle-Cut SuperHyperPolynomial

Henry Garrett · 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.14: The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
SuperHyperHamiltonian-Type-Cycle-Cut in the Extreme Example (42.0.3) 136NSHG14

= z2.
C(N SHG)Extreme V-Hamiltonian-Type-Cycle-Cut
= {V3 , V4 }.
C(N SHG)Extreme V-Hamiltonian-Type-Cycle-Cut SuperHyperPolynomial
= z4 + z3.

2165

• On the Figure (30.16), the Extreme SuperHyperNotion, namely, Extreme 2166

SuperHyperHamiltonian-Type-Cycle-Cut, is up. The Extreme Algorithm is Extremely straight- 2167
forward. 2168

C(N SHG)Extreme Hamiltonian-Type-Cycle-Cut

= {E4 }.
C(N SHG)Extreme Hamiltonian-Type-Cycle-Cut SuperHyperPolynomial

Henry Garrett · 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.15: The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
SuperHyperHamiltonian-Type-Cycle-Cut in the Extreme Example (42.0.3) 136NSHG15

= z 10 .
C(N SHG)Extreme V-Hamiltonian-Type-Cycle-Cut
= {Vi=817 }.
C(N SHG)Extreme V-Hamiltonian-Type-Cycle-Cut SuperHyperPolynomial
X
= ai z bj .

2169

• On the Figure (30.17), the Extreme SuperHyperNotion, namely, Extreme 2170

SuperHyperHamiltonian-Type-Cycle-Cut, is up. The Extreme Algorithm is Extremely straight- 2171
forward. 2172

C(N SHG)Extreme Hamiltonian-Type-Cycle-Cut

= {E4 }.
C(N SHG)Extreme Hamiltonian-Type-Cycle-Cut SuperHyperPolynomial
= z 10 .
C(N SHG)Extreme V-Hamiltonian-Type-Cycle-Cut
= {Vi=817 }.
C(N SHG)Extreme V-Hamiltonian-Type-Cycle-Cut SuperHyperPolynomial
X
= ai z bj .

2173

Henry Garrett · 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.16: The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
SuperHyperHamiltonian-Type-Cycle-Cut in the Extreme Example (42.0.3) 136NSHG16

Figure 10.17: The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
SuperHyperHamiltonian-Type-Cycle-Cut in the Extreme Example (42.0.3) 136NSHG17

Henry Garrett · 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.18: The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
SuperHyperHamiltonian-Type-Cycle-Cut in the Extreme Example (42.0.3) 136NSHG18

• On the Figure (30.18), the Extreme SuperHyperNotion, namely, Extreme 2174

SuperHyperHamiltonian-Type-Cycle-Cut, is up. The Extreme Algorithm is Extremely straight- 2175
forward. 2176

C(N SHG)Extreme Hamiltonian-Type-Cycle-Cut

= {E4 }.
C(N SHG)Extreme Hamiltonian-Type-Cycle-Cut SuperHyperPolynomial
= z 10 .
C(N SHG)Extreme V-Hamiltonian-Type-Cycle-Cut
= {Vi=817 }.
C(N SHG)Extreme V-Hamiltonian-Type-Cycle-Cut SuperHyperPolynomial
X
= ai z bj .

2177

• On the Figure (30.19), the Extreme SuperHyperNotion, namely, Extreme 2178

SuperHyperHamiltonian-Type-Cycle-Cut, is up. The Extreme Algorithm is Extremely straight- 2179

forward. 2180

C(N SHG)Extreme Hamiltonian-Type-Cycle-Cut

= {Ei=112 }.

Henry Garrett · 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.19: The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
SuperHyperHamiltonian-Type-Cycle-Cut in the Extreme Example (42.0.3) 136NSHG19

C(N SHG)Extreme Hamiltonian-Type-Cycle-Cut SuperHyperPolynomial

X
= ai z bj .
C(N SHG)Extreme V-Hamiltonian-Type-Cycle-Cut
= {Vi ∈ VN SHG }.
C(N SHG)Extreme V-Hamiltonian-Type-Cycle-Cut SuperHyperPolynomial
X
= ai z bj .

2181

• On the Figure (30.20), the Extreme SuperHyperNotion, namely, Extreme 2182

SuperHyperHamiltonian-Type-Cycle-Cut, is up. The Extreme Algorithm is Extremely straight- 2183
forward. 2184

C(N SHG)Extreme Hamiltonian-Type-Cycle-Cut

= {E6 }.
C(N SHG)Extreme Hamiltonian-Type-Cycle-Cut SuperHyperPolynomial
= z bj .
C(N SHG)Extreme V-Hamiltonian-Type-Cycle-Cut
= {Vi ∈ VE6 }.
C(N SHG)Extreme V-Hamiltonian-Type-Cycle-Cut SuperHyperPolynomial

Henry Garrett · 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.20: The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
SuperHyperHamiltonian-Type-Cycle-Cut in the Extreme Example (42.0.3) 136NSHG20

X
= ai z bj .

2185

• On the Figure (30.21), the Extreme SuperHyperNotion, namely, Extreme 2186

SuperHyperHamiltonian-Type-Cycle-Cut, is up. The Extreme Algorithm is Extremely straight- 2187
forward. 2188

C(N SHG)Extreme Hamiltonian-Type-Cycle-Cut

= {E1 , E2 }.
C(N SHG)Extreme Hamiltonian-Type-Cycle-Cut SuperHyperPolynomial
= z 10 + z 2 .
C(N SHG)Extreme V-Hamiltonian-Type-Cycle-Cut
= {VE2 }.
C(N SHG)Extreme V-Hamiltonian-Type-Cycle-Cut SuperHyperPolynomial
= z 5 + 2z 3 + 7z.

2189

• On the Figure (30.22), the Extreme SuperHyperNotion, namely, Extreme 2190

SuperHyperHamiltonian-Type-Cycle-Cut, is up. The Extreme Algorithm is Extremely straight- 2191

Henry Garrett · 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.21: The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
SuperHyperHamiltonian-Type-Cycle-Cut in the Extreme Example (42.0.3) 95NHG1

forward. 2192

C(N SHG)Extreme Hamiltonian-Type-Cycle-Cut

= {E2 }.
C(N SHG)Extreme Hamiltonian-Type-Cycle-Cut SuperHyperPolynomial
= z 10 .
C(N SHG)Extreme V-Hamiltonian-Type-Cycle-Cut
= {Vi ∈ VN SHG }.
C(N SHG)Extreme V-Hamiltonian-Type-Cycle-Cut SuperHyperPolynomial
= z 5 + 2z 3 + 7z.

2193

Proposition 10.0.21. Assume a connected Extreme SuperHyperGraph ESHG : (V, E). The all 2194

interior Extreme SuperHyperVertices belong to any Extreme quasi-R-Hamiltonian-Type-Cycle-Cut if for 2195

Henry Garrett · 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.22: The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
SuperHyperHamiltonian-Type-Cycle-Cut in the Extreme Example (42.0.3) 95NHG2

any of them, and any of other corresponded Extreme SuperHyperVertex, some interior Extreme 2196
SuperHyperVertices are mutually Extreme SuperHyperNeighbors with no Extreme exception at 2197
all minus all Extreme SuperHypeNeighbors to any amount of them. 2198

Proposition 10.0.22. Assume a connected non-obvious Extreme SuperHyperGraph ESHG : 2199

(V, E). There’s only one Extreme SuperHyperEdge E ∈ EESHG:(V,E) has only the maximum 2200
possibilities of the distinct interior Extreme SuperHyperVertices inside of any given Extreme 2201
quasi-R-Hamiltonian-Type-Cycle-Cut minus all Extreme SuperHypeNeighbor to some of them but not 2202
all of them. In other words, there’s only an unique Extreme SuperHyperEdge E ∈ EESHG:(V,E) 2203
has only two distinct Extreme SuperHyperVertices in an Extreme quasi-R-Hamiltonian-Type-Cycle-Cut, 2204
minus all Extreme SuperHypeNeighbor to some of them but not all of them. 2205

Proposition 10.0.23. Assume a connected Extreme SuperHyperGraph ESHG : (V, E). If an

Extreme SuperHyperEdge E ∈ EESHG:(V,E) has z Extreme SuperHyperVertices, then the Extreme
cardinality of the Extreme R-Hamiltonian-Type-Cycle-Cut is at least

V \ (V \ {aE , bE , cE , . . . , zE }).

It’s straightforward that the Extreme cardinality of the Extreme R-Hamiltonian-Type-Cycle-Cut is at least 2206
the maximum Extreme number of Extreme SuperHyperVertices of the Extreme SuperHyperEdges 2207
with the maximum number of the Extreme SuperHyperEdges. In other words, the maximum 2208
number of the Extreme SuperHyperEdges contains the maximum Extreme number of Extreme 2209
SuperHyperVertices are renamed to Extreme Hamiltonian-Type-Cycle-Cut in some cases but the maximum 2210

number of the Extreme SuperHyperEdge with the maximum Extreme number of Extreme 2211

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

SuperHyperVertices, has the Extreme SuperHyperVertices are contained in an Extreme R- 2212

Hamiltonian-Type-Cycle-Cut. 2213

Proposition 10.0.24. Assume a simple Extreme SuperHyperGraph ESHG : (V, E). Then the
Extreme number of type-result-R-Hamiltonian-Type-Cycle-Cut has, the least Extreme cardinality, the
lower sharp Extreme bound for Extreme cardinality, is the Extreme cardinality of

V \ V \ {aE , bE 0 , cE 00 , cE 000 }E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .

If there’s an Extreme type-result-R-Hamiltonian-Type-Cycle-Cut with the least Extreme cardinality, the 2214
lower sharp Extreme bound for cardinality. 2215

Proposition 10.0.25. Assume a connected loopless Extreme SuperHyperGraph ESHG : (V, E). 2216
Then in the worst case, literally, 2217

C(N SHG)ExtremeQuasi−Hamiltonian−T ype−Cycle−Cut = {V1 , E1 , V2 , E2 , V3 , E3 , V4 , E4 , V1 }.

C(N SHG)ExtremeQuasi−Hamiltonian−T ype−Cycle−CutSuperHyperP olynomial = z 4 .
C(N SHG)ExtremeQuasi−Hamiltonian−T ype−Cycle−Cut = {V1 , V2 , V3 , V4 , V1 }.
C(N SHG)ExtremeR−Quasi−Hamiltonian−T ype−Cycle−CutSuperHyperP olynomial = z 5 .

Is an Extreme type-result-Hamiltonian-Type-Cycle-Cut. In other words, the least cardinality, the lower 2218
sharp bound for the cardinality, of an Extreme type-result-Hamiltonian-Type-Cycle-Cut is the cardinality 2219
of 2220

C(N SHG)ExtremeQuasi−Hamiltonian−T ype−Cycle−Cut = {V1 , E1 , V2 , E2 , V3 , E3 , V4 , E4 , V1 }.

C(N SHG)ExtremeQuasi−Hamiltonian−T ype−Cycle−CutSuperHyperP olynomial = z 4 .
C(N SHG)ExtremeQuasi−Hamiltonian−T ype−Cycle−Cut = {V1 , V2 , V3 , V4 , V1 }.
C(N SHG)ExtremeR−Quasi−Hamiltonian−T ype−Cycle−CutSuperHyperP olynomial = z 5 .

Proof. Assume a connected loopless Extreme SuperHyperGraph ESHG : (V, E). The
SuperHyperSet of the SuperHyperVertices V \ V \ {z} isn’t a quasi-R-Hamiltonian-Type-Cycle-Cut
since neither amount of Extreme SuperHyperEdges nor amount of SuperHyperVertices where
amount refers to the Extreme number of SuperHyperVertices(-/SuperHyperEdges) more than
one to form any kind of SuperHyperEdges or any number of SuperHyperEdges. Let us consider
the Extreme SuperHyperSet

V \ V \ {aE , bE , cE , . . . , aE 0 , bE 0 , cE 0 , . . .}E,E 0 ={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .

This Extreme SuperHyperSet of the Extreme SuperHyperVertices has the eligibilities to propose
property such that there’s no Extreme SuperHyperVertex of an Extreme SuperHyperEdge is
common and there’s an Extreme SuperHyperEdge for all Extreme SuperHyperVertices but the
maximum Extreme cardinality indicates that these Extreme type-SuperHyperSets couldn’t give
us the Extreme lower bound in the term of Extreme sharpness. In other words, the Extreme
SuperHyperSet

V \ V \ {aE , bE , cE , . . . , aE 0 , bE 0 , cE 0 , . . .}E,E 0 ={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }}

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

of the Extreme SuperHyperVertices implies at least on-quasi-triangle style is up but sometimes

the Extreme SuperHyperSet

V \ V \ {aE , bE , cE , . . . , aE 0 , bE 0 , cE 0 , . . .}E,E 0 ={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }}

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

to the supposition on the connected loopless Extreme SuperHyperGraph ESHG : (V, E).
Thus the minimum case never happens in the generality of the connected loopless Extreme
SuperHyperGraphs. Thus if we assume in the worst case, literally,

V \ V \ {aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .

Is a quasi-R-Hamiltonian-Type-Cycle-Cut. In other words, the least cardinality, the lower sharp bound
for the cardinality, of a quasi-R-Hamiltonian-Type-Cycle-Cut is the cardinality of

V \ V \ {aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .

Then we’ve lost some connected loopless Extreme SuperHyperClasses of the connected loopless
Extreme SuperHyperGraphs titled free-triangle, on-triangle, and their quasi-types but the
SuperHyperStable is only up in this quasi-R-Hamiltonian-Type-Cycle-Cut. It’s the contradiction to
that fact on the generality. There are some counterexamples to deny this statement. One of
them comes from the setting of the graph titled path and cycle as the counterexamples-classes or
reversely direction star as the examples-classes, are well-known classes in that setting and they
could be considered as the examples-classes and counterexamples-classes for the tight bound of

V \ V \ {aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .

Let V \ V \ {z} in mind. There’s no necessity on the SuperHyperEdge since we need at least
two SuperHyperVertices to form a SuperHyperEdge. It doesn’t withdraw the principles of the
main definition since there’s no condition to be satisfied but the condition is on the existence of
the SuperHyperEdge instead of acting on the SuperHyperVertices. In other words, if there’s a
SuperHyperEdge, then the Extreme SuperHyperSet has the necessary condition for the intended
definition to be applied. Thus the V \ V \ {z} is withdrawn not by the conditions of the main
definition but by the necessity of the pre-condition on the usage of the main definition.
The Extreme structure of the Extreme R-Hamiltonian-Type-Cycle-Cut decorates the Extreme
SuperHyperVertices don’t have received any Extreme connections so as this Extreme style
implies different versions of Extreme SuperHyperEdges with the maximum Extreme cardinality
in the terms of Extreme SuperHyperVertices are spotlight. The lower Extreme bound is to have
the maximum Extreme groups of Extreme SuperHyperVertices have perfect Extreme connections
inside each of SuperHyperEdges and the outside of this Extreme SuperHyperSet doesn’t matter
but regarding the connectedness of the used Extreme SuperHyperGraph arising from its
Extreme properties taken from the fact that it’s simple. If there’s no more than one Extreme
SuperHyperVertex in the targeted Extreme SuperHyperSet, then there’s no Extreme connection.
Furthermore, the Extreme existence of one Extreme SuperHyperVertex has no Extreme effect to
talk about the Extreme R-Hamiltonian-Type-Cycle-Cut. Since at least two Extreme SuperHyperVertices
involve to make a title in the Extreme background of the Extreme SuperHyperGraph. The
Extreme SuperHyperGraph is obvious if it has no Extreme SuperHyperEdge but at least two

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

Extreme SuperHyperVertices make the Extreme version of Extreme SuperHyperEdge. Thus in

the Extreme setting of non-obvious Extreme SuperHyperGraph, there are at least one Extreme
SuperHyperEdge. It’s necessary to mention that the word “Simple” is used as Extreme adjective
for the initial Extreme SuperHyperGraph, induces there’s no Extreme appearance of the loop
Extreme version of the Extreme SuperHyperEdge and this Extreme SuperHyperGraph is said
to be loopless. The Extreme adjective “loop” on the basic Extreme framework engages one
Extreme SuperHyperVertex but it never happens in this Extreme setting. With these Extreme
bases, on an Extreme SuperHyperGraph, there’s at least one Extreme SuperHyperEdge thus
there’s at least an Extreme R-Hamiltonian-Type-Cycle-Cut has the Extreme cardinality of an Extreme
SuperHyperEdge. Thus, an Extreme R-Hamiltonian-Type-Cycle-Cut has the Extreme cardinality at
least an Extreme SuperHyperEdge. Assume an Extreme SuperHyperSet V \ V \ {z}. This
Extreme SuperHyperSet isn’t an Extreme R-Hamiltonian-Type-Cycle-Cut since either the Extreme
SuperHyperGraph is an obvious Extreme SuperHyperModel thus it never happens since there’s
no Extreme usage of this Extreme framework and even more there’s no Extreme connection
inside or the Extreme SuperHyperGraph isn’t obvious and as its consequences, there’s an
Extreme contradiction with the term “Extreme R-Hamiltonian-Type-Cycle-Cut” since the maximum
Extreme cardinality never happens for this Extreme style of the Extreme SuperHyperSet and
beyond that there’s no Extreme connection inside as mentioned in first Extreme case in the
forms of drawback for this selected Extreme SuperHyperSet. Let

V \ V \ {aE , bE , cE , . . . , aE 0 , bE 0 , cE 0 , . . .}E,E 0 ={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }}

Comes up. This Extreme case implies having the Extreme style of on-quasi-triangle Extreme
style on the every Extreme elements of this Extreme SuperHyperSet. Precisely, the Extreme
R-Hamiltonian-Type-Cycle-Cut is the Extreme SuperHyperSet of the Extreme SuperHyperVertices
such that some Extreme amount of the Extreme SuperHyperVertices are on-quasi-triangle
Extreme style. The Extreme cardinality of the v SuperHypeSet

V \ V \ {aE , bE , cE , . . . , aE 0 , bE 0 , cE 0 , . . .}E,E 0 ={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }}

Is the maximum in comparison to the Extreme SuperHyperSet

V \ V \ {aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .

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

V \ V \ {aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

Has the maximum Extreme cardinality such that

V \ V \ {aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .

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

Extreme SuperHyperEdges for amount of Extreme SuperHyperVertices taken from the Extreme
SuperHyperSet

V \ V \ {aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .

It means that the Extreme SuperHyperSet of the Extreme SuperHyperVertices

V \ V \ {aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .

Is an Extreme R-Hamiltonian-Type-Cycle-Cut for the Extreme SuperHyperGraph as used Extreme

background in the Extreme terms of worst Extreme case and the common theme of the
lower Extreme bound occurred in the specific Extreme SuperHyperClasses of the Extreme
SuperHyperGraphs which are Extreme free-quasi-triangle.
Assume an Extreme SuperHyperEdge E ∈ EESHG:(V,E) has z Extreme number of the
Extreme SuperHyperVertices. Then every Extreme SuperHyperVertex has at least no
Extreme SuperHyperEdge with others in common. Thus those Extreme SuperHyperVertices
have the eligibles to be contained in an Extreme R-Hamiltonian-Type-Cycle-Cut. Those Extreme
SuperHyperVertices are potentially included in an Extreme style-R-Hamiltonian-Type-Cycle-Cut.
Formally, consider
V \ (V \ {aE , bE , cE , . . . , zE }).
Are the Extreme SuperHyperVertices of an Extreme SuperHyperEdge E ∈ EESHG:(V,E) . Thus

Zi ∼ Zj , i 6= j, i, j = 1, 2, . . . , z.

where the ∼ isn’t an equivalence relation but only the symmetric relation on the Extreme
SuperHyperVertices of the Extreme SuperHyperGraph. The formal definition is as follows.

Zi ∼ Zj , i 6= j, i, j = 1, 2, . . . , z

if and only if Zi and Zj are the Extreme SuperHyperVertices and there’s only and only one
Extreme SuperHyperEdge E ∈ EESHG:(V,E) between the Extreme SuperHyperVertices Zi and
Zj . The other definition for the Extreme SuperHyperEdge E ∈ EESHG:(V,E) in the terms of
Extreme R-Hamiltonian-Type-Cycle-Cut is

{aE , bE , cE , . . . , zE } .

This definition coincides with the definition of the Extreme R-Hamiltonian-Type-Cycle-Cut but
with slightly differences in the maximum Extreme cardinality amid those Extreme type-
SuperHyperSets of the Extreme SuperHyperVertices. Thus the Extreme SuperHyperSet of the
Extreme SuperHyperVertices,

max |{Z1 , Z2 , . . . , Zz | Zi ∼ Zj , i 6= j, i, j = 1, 2, . . . , z}|Extreme cardinality ,

z

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

and
V \ V \ {aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .

is formalized with mathematical literatures on the Extreme R-Hamiltonian-Type-Cycle-Cut. Let

E
Zi ∼ Zj , be defined as Zi and Zj are the Extreme SuperHyperVertices belong to the Extreme
SuperHyperEdge E ∈ EESHG:(V,E) . Thus,

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

Or
{aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .

But with the slightly differences, 2221

Extreme R-Hamiltonian-Type-Cycle-Cut =
E
{Z1 , Z2 , . . . , Zz | ∀i 6= j, i, j = 1, 2, . . . , z, ∃Ex , Zi ∼x Zj , }.
2222

Extreme R-Hamiltonian-Type-Cycle-Cut =
V \ V \ {aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .

Thus E ∈ EESHG:(V,E) is an Extreme quasi-R-Hamiltonian-Type-Cycle-Cut where E ∈ EESHG:(V,E)

is fixed that means Ex = E ∈ EESHG:(V,E) . for all Extreme intended SuperHyperVertices
but in an Extreme Hamiltonian-Type-Cycle-Cut, Ex = E ∈ EESHG:(V,E) could be different and it’s
not unique. To sum them up, in a connected Extreme SuperHyperGraph ESHG : (V, E). If
an Extreme SuperHyperEdge E ∈ EESHG:(V,E) has z Extreme SuperHyperVertices, then the
Extreme cardinality of the Extreme R-Hamiltonian-Type-Cycle-Cut is at least

V \ (V \ {aE , bE , cE , . . . , zE }).

It’s straightforward that the Extreme cardinality of the Extreme R-Hamiltonian-Type-Cycle-Cut 2223
is at least the maximum Extreme number of Extreme SuperHyperVertices of the Extreme 2224
SuperHyperEdges with the maximum number of the Extreme SuperHyperEdges. In other 2225
words, the maximum number of the Extreme SuperHyperEdges contains the maximum Extreme 2226

number of Extreme SuperHyperVertices are renamed to Extreme Hamiltonian-Type-Cycle-Cut in some 2227

cases but the maximum number of the Extreme SuperHyperEdge with the maximum Extreme 2228
number of Extreme SuperHyperVertices, has the Extreme SuperHyperVertices are contained in 2229
an Extreme R-Hamiltonian-Type-Cycle-Cut. 2230
The obvious SuperHyperGraph has no Extreme SuperHyperEdges. But the non-obvious 2231
Extreme SuperHyperModel is up. The quasi-SuperHyperModel addresses some issues about 2232

the Extreme optimal SuperHyperObject. It specially delivers some remarks on the Extreme 2233
SuperHyperSet of the Extreme SuperHyperVertices such that there’s distinct amount of Extreme 2234
SuperHyperEdges for distinct amount of Extreme SuperHyperVertices up to all taken from that 2235
Extreme SuperHyperSet of the Extreme SuperHyperVertices but this Extreme SuperHyperSet of 2236
the Extreme SuperHyperVertices is either has the maximum Extreme SuperHyperCardinality or 2237
it doesn’t have maximum Extreme SuperHyperCardinality. In a non-obvious SuperHyperModel, 2238

there’s at least one Extreme SuperHyperEdge containing at least all Extreme SuperHyperVertices. 2239

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

Thus it forms an Extreme quasi-R-Hamiltonian-Type-Cycle-Cut where the Extreme completion of the 2240
Extreme incidence is up in that. Thus it’s, literarily, an Extreme embedded R-Hamiltonian- 2241
Type-Cycle-Cut. The SuperHyperNotions of embedded SuperHyperSet and quasi-SuperHyperSet 2242
coincide. In the original setting, these types of SuperHyperSets only don’t satisfy on the 2243
maximum SuperHyperCardinality. Thus the embedded setting is elected such that those 2244
SuperHyperSets have the maximum Extreme SuperHyperCardinality and they’re Extreme 2245

SuperHyperOptimal. The less than two distinct types of Extreme SuperHyperVertices are 2246
included in the minimum Extreme style of the embedded Extreme R-Hamiltonian-Type-Cycle-Cut. 2247
The interior types of the Extreme SuperHyperVertices are deciders. Since the Extreme number 2248
of SuperHyperNeighbors are only affected by the interior Extreme SuperHyperVertices. The 2249
common connections, more precise and more formal, the perfect unique connections inside 2250
the Extreme SuperHyperSet for any distinct types of Extreme SuperHyperVertices pose the 2251

Extreme R-Hamiltonian-Type-Cycle-Cut. Thus Extreme exterior SuperHyperVertices could be used 2252

only in one Extreme SuperHyperEdge and in Extreme SuperHyperRelation with the interior 2253
Extreme SuperHyperVertices in that Extreme SuperHyperEdge. In the embedded Extreme 2254
Hamiltonian-Type-Cycle-Cut, there’s the usage of exterior Extreme SuperHyperVertices since they’ve 2255
more connections inside more than outside. Thus the title “exterior” is more relevant than 2256
the title “interior”. One Extreme SuperHyperVertex has no connection, inside. Thus, the 2257

Extreme SuperHyperSet of the Extreme SuperHyperVertices with one SuperHyperElement has 2258
been ignored in the exploring to lead on the optimal case implying the Extreme R-Hamiltonian- 2259
Type-Cycle-Cut. The Extreme R-Hamiltonian-Type-Cycle-Cut with the exclusion of the exclusion of all 2260
Extreme SuperHyperVertices in one Extreme SuperHyperEdge and with other terms, the 2261
Extreme R-Hamiltonian-Type-Cycle-Cut with the inclusion of all Extreme SuperHyperVertices in one 2262
Extreme SuperHyperEdge, is an Extreme quasi-R-Hamiltonian-Type-Cycle-Cut. To sum them up, 2263

in a connected non-obvious Extreme SuperHyperGraph ESHG : (V, E). There’s only one 2264
Extreme SuperHyperEdge E ∈ EESHG:(V,E) has only the maximum possibilities of the distinct 2265
interior Extreme SuperHyperVertices inside of any given Extreme quasi-R-Hamiltonian-Type-Cycle- 2266
Cut minus all Extreme SuperHypeNeighbor to some of them but not all of them. In other 2267
words, there’s only an unique Extreme SuperHyperEdge E ∈ EESHG:(V,E) has only two distinct 2268
Extreme SuperHyperVertices in an Extreme quasi-R-Hamiltonian-Type-Cycle-Cut, minus all Extreme 2269

SuperHypeNeighbor to some of them but not all of them. 2270

The main definition of the Extreme R-Hamiltonian-Type-Cycle-Cut has two titles. an Extreme quasi-R- 2271
Hamiltonian-Type-Cycle-Cut and its corresponded quasi-maximum Extreme R-SuperHyperCardinality 2272
are two titles in the terms of quasi-R-styles. For any Extreme number, there’s an Extreme 2273
quasi-R-Hamiltonian-Type-Cycle-Cut with that quasi-maximum Extreme SuperHyperCardinality in 2274

the terms of the embedded Extreme SuperHyperGraph. If there’s an embedded Extreme 2275
SuperHyperGraph, then the Extreme quasi-SuperHyperNotions lead us to take the collection of 2276
all the Extreme quasi-R-Hamiltonian-Type-Cycle-Cuts for all Extreme numbers less than its Extreme 2277
corresponded maximum number. The essence of the Extreme Hamiltonian-Type-Cycle-Cut ends up 2278
but this essence starts up in the terms of the Extreme quasi-R-Hamiltonian-Type-Cycle-Cut, again 2279
and more in the operations of collecting all the Extreme quasi-R-Hamiltonian-Type-Cycle-Cuts acted 2280

on the all possible used formations of the Extreme SuperHyperGraph to achieve one Extreme 2281
number. This Extreme number is 2282
considered as the equivalence class for all corresponded quasi-R-Hamiltonian-Type-Cycle-Cuts. 2283
Let zExtreme Number , SExtreme SuperHyperSet and GExtreme Hamiltonian-Type-Cycle-Cut be an Extreme 2284

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

number, an Extreme SuperHyperSet and an Extreme Hamiltonian-Type-Cycle-Cut . Then 2285

[zExtreme Number ]Extreme Class = {SExtreme SuperHyperSet |

SExtreme SuperHyperSet = GExtreme Hamiltonian-Type-Cycle-Cut ,
|SExtreme SuperHyperSet |Extreme Cardinality
= zExtreme Number }.

As its consequences, the formal definition of the Extreme Hamiltonian-Type-Cycle-Cut is re-formalized 2286
and redefined as follows. 2287

GExtreme Hamiltonian-Type-Cycle-Cut ∈ ∪zExtreme Number [zExtreme Number ]Extreme Class =

∪zExtreme Number {SExtreme SuperHyperSet |
SExtreme SuperHyperSet = GExtreme Hamiltonian-Type-Cycle-Cut ,
|SExtreme SuperHyperSet |Extreme Cardinality
= zExtreme Number }.

To get more precise perceptions, the follow-up expressions propose another formal technical 2288
definition for the Extreme Hamiltonian-Type-Cycle-Cut. 2289

GExtreme Hamiltonian-Type-Cycle-Cut =
{S ∈ ∪zExtreme Number [zExtreme Number ]Extreme Class =
∪zExtreme Number {SExtreme SuperHyperSet |
SExtreme SuperHyperSet = GExtreme Hamiltonian-Type-Cycle-Cut ,
|SExtreme SuperHyperSet |Extreme Cardinality
= zExtreme Number |
|SExtreme SuperHyperSet |Extreme Cardinality
= max zExtreme Number }.
[zExtreme Number ]Extreme Class

In more concise and more convenient ways, the modified definition for the Extreme Hamiltonian- 2290
poses the upcoming expressions.
Type-Cycle-Cut 2291

GExtreme Hamiltonian-Type-Cycle-Cut =
{S ∈ ∪zExtreme Number [zExtreme Number ]Extreme Class |
|SExtreme SuperHyperSet |Extreme Cardinality
= max zExtreme Number }.
[zExtreme Number ]Extreme Class

To translate the statement to this mathematical literature, the formulae will be revised. 2292

GExtreme Hamiltonian-Type-Cycle-Cut =
{S ∈ ∪zExtreme Number [zExtreme Number ]Extreme Class |
|SExtreme SuperHyperSet |Extreme Cardinality
= max zExtreme Number
[zExtreme Number ]Extreme Class

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

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

And then, 2293

GExtreme Hamiltonian-Type-Cycle-Cut =
{S ∈ ∪zExtreme Number [zExtreme Number ]Extreme Class |
|SExtreme SuperHyperSet |Extreme Cardinality

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

To get more visions in the closer look-up, there’s an overall overlook. 2294

GExtreme Hamiltonian-Type-Cycle-Cut ∈ ∪zExtreme Number [zExtreme Number ]Extreme Class =

∪zExtreme Number {SExtreme SuperHyperSet |
SExtreme SuperHyperSet = GExtreme Hamiltonian-Type-Cycle-Cut ,
|SExtreme SuperHyperSet |Extreme Cardinality

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

GExtreme Hamiltonian-Type-Cycle-Cut =
{S ∈ ∪zExtreme Number [zExtreme Number ]Extreme Class =
∪zExtreme Number {SExtreme SuperHyperSet |
SExtreme SuperHyperSet = GExtreme Hamiltonian-Type-Cycle-Cut ,
|SExtreme SuperHyperSet |Extreme Cardinality
= zExtreme Number |
|SExtreme SuperHyperSet |Extreme Cardinality

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

GExtreme Hamiltonian-Type-Cycle-Cut =
{S ∈ ∪zExtreme Number [zExtreme Number ]Extreme Class |
|SExtreme SuperHyperSet |Extreme Cardinality
= max zExtreme Number
[zExtreme Number ]Extreme Class

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

GExtreme Hamiltonian-Type-Cycle-Cut =
{S ∈ ∪zExtreme Number [zExtreme Number ]Extreme Class |
|SExtreme SuperHyperSet |Extreme Cardinality

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

Now, the extension of these types of approaches is up. Since the new term, “Extreme Super- 2298

HyperNeighborhood”, could be redefined as the collection of the Extreme SuperHyperVertices 2299

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

such that any amount of its Extreme SuperHyperVertices are incident to an Extreme SuperHy- 2300
perEdge. It’s, literarily, another name for “Extreme Quasi-Hamiltonian-Type-Cycle-Cut” but, precisely, 2301
it’s the generalization of “Extreme Quasi-Hamiltonian-Type-Cycle-Cut” since “Extreme Quasi-Hamiltonian- 2302
Type-Cycle-Cut” happens “Extreme Hamiltonian-Type-Cycle-Cut” in an Extreme SuperHyperGraph as 2303
initial framework and background but “Extreme SuperHyperNeighborhood” may not happens 2304
“Extreme Hamiltonian-Type-Cycle-Cut” in an Extreme SuperHyperGraph as initial framework and 2305

preliminarily background since there are some ambiguities about the Extreme SuperHyperCar- 2306
dinality arise from it. To get orderly keywords, the terms, “Extreme SuperHyperNeighborhood”, 2307
“Extreme Quasi-Hamiltonian-Type-Cycle-Cut”, and “Extreme Hamiltonian-Type-Cycle-Cut” are up. 2308
Thus, let zExtreme Number , NExtreme SuperHyperNeighborhood and GExtreme Hamiltonian-Type-Cycle-Cut be 2309
an Extreme number, an Extreme SuperHyperNeighborhood and an Extreme Hamiltonian-Type-Cycle- 2310
Cut and the new terms are up. 2311

GExtreme Hamiltonian-Type-Cycle-Cut ∈ ∪zExtreme Number [zExtreme Number ]Extreme Class =

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

2312

GExtreme Hamiltonian-Type-Cycle-Cut =
{NExtreme SuperHyperNeighborhood
∈ ∪zExtreme Number [zExtreme Number ]Extreme Class =
∪zExtreme Number {NExtreme SuperHyperNeighborhood |
|NExtreme SuperHyperSet |Extreme Cardinality
= zExtreme Number |
|NExtreme SuperHyperNeighborhood |Extreme Cardinality
= max zExtreme Number }.
[zExtreme Number ]Extreme Class

2313

GExtreme Hamiltonian-Type-Cycle-Cut =
{NExtreme SuperHyperNeighborhood
∈ ∪zExtreme Number [zExtreme Number ]Extreme Class |
|NExtreme SuperHyperNeighborhood |Extreme Cardinality
= max zExtreme Number }.
[zExtreme Number ]Extreme Class

2314

GExtreme Hamiltonian-Type-Cycle-Cut =
{NExtreme SuperHyperNeighborhood
∈ ∪zExtreme Number [zExtreme Number ]Extreme Class |
|NExtreme SuperHyperSet |Extreme Cardinality
= max zExtreme Number }.
[zExtreme Number ]Extreme Class

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

And with go back to initial structure, 2315

GExtreme Hamiltonian-Type-Cycle-Cut ∈ ∪zExtreme Number [zExtreme Number ]Extreme Class =

∪zExtreme Number {NExtreme SuperHyperNeighborhood |
|NExtreme SuperHyperNeighborhood |Extreme Cardinality

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

GExtreme Hamiltonian-Type-Cycle-Cut =
{NExtreme SuperHyperNeighborhood
∈ ∪zExtreme Number [zExtreme Number ]Extreme Class =
∪zExtreme Number {NExtreme SuperHyperNeighborhood |
|NExtreme SuperHyperSet |Extreme Cardinality
= zExtreme Number |
|NExtreme SuperHyperNeighborhood |Extreme Cardinality

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

GExtreme Hamiltonian-Type-Cycle-Cut =
{NExtreme SuperHyperNeighborhood
∈ ∪zExtreme Number [zExtreme Number ]Extreme Class |
|NExtreme SuperHyperNeighborhood |Extreme Cardinality
= max zExtreme Number
[zExtreme Number ]Extreme Class

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

GExtreme Hamiltonian-Type-Cycle-Cut =
{NExtreme SuperHyperNeighborhood
∈ ∪zExtreme Number [zExtreme Number ]Extreme Class |
|NExtreme SuperHyperSet |Extreme Cardinality

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

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

V \ V \ {aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

The Extreme SuperHyperSet of Extreme SuperHyperVertices,

V \ V \ {aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .

Is the simple Extreme type-SuperHyperSet of the Extreme R-Hamiltonian-Type-Cycle-Cut. The

Extreme SuperHyperSet of the Extreme SuperHyperVertices,

V \ V \ {aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .

Is an Extreme R-Hamiltonian-Type-Cycle-Cut C(ESHG) for an Extreme SuperHyperGraph

ESHG : (V, E) is an Extreme type-SuperHyperSet with

the maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme Su-

perHyperVertices such that there’s no an Extreme SuperHyperEdge amid some Extreme
SuperHyperVertices instead of all given by Extreme Hamiltonian-Type-Cycle-Cut is related to the
Extreme SuperHyperSet of the Extreme SuperHyperVertices,

V \ V \ {aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .

There’s not only one Extreme SuperHyperVertex inside the intended Extreme SuperHyperSet.
Thus the non-obvious Extreme Hamiltonian-Type-Cycle-Cut is up. The obvious simple Extreme
type-SuperHyperSet called the Extreme Hamiltonian-Type-Cycle-Cut is an Extreme SuperHyperSet
includes only one Extreme SuperHyperVertex. But the Extreme SuperHyperSet of Extreme
SuperHyperVertices,

V \ V \ {aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .

doesn’t have less than two SuperHyperVertices inside the intended Extreme SuperHyperSet
since they’ve come from at least so far an SuperHyperEdge. Thus the non-obvious simple
Extreme type-SuperHyperSet of the Extreme R-Hamiltonian-Type-Cycle-Cut is up. To sum them up,
the Extreme SuperHyperSet of Extreme SuperHyperVertices,

V \ V \ {aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .

Is the non-obvious simple Extreme type-SuperHyperSet of the Extreme R-Hamiltonian-Type-Cycle-Cut.

Since the Extreme SuperHyperSet of the Extreme SuperHyperVertices,

(V \ V \ {x, z}) ∪ {xy}

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

Henry Garrett · 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 maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme Su-

perHyperVertices such that there’s no an Extreme SuperHyperEdge for some amount Extreme
SuperHyperVertices instead of all given by that Extreme type-SuperHyperSet called the Extreme
Hamiltonian-Type-Cycle-Cut. There isn’t only less than two Extreme SuperHyperVertices inside the
intended Extreme SuperHyperSet,

V \ V \ {aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .

Thus the non-obvious Extreme R-Hamiltonian-Type-Cycle-Cut,

V \ V \ {aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .

is up. The non-obvious simple Extreme type-SuperHyperSet of the Extreme Hamiltonian-Type-Cycle-

Cut, not:

V \ V \ {aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .

Is the Extreme SuperHyperSet, not:

V \ V \ {aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .

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

“Extreme R-Hamiltonian-Type-Cycle-Cut” 2323

amid those obvious[non-obvious] simple Extreme type-SuperHyperSets called the 2324

Extreme R-Hamiltonian-Type-Cycle-Cut, 2325

is only and only

V \ V \ {aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .

In a connected Extreme SuperHyperGraph ESHG : (V, E) with a illustrated SuperHyper-

Modeling. It’s also, not only an Extreme free-triangle embedded SuperHyperModel and an
Extreme on-triangle embedded SuperHyperModel but also it’s an Extreme stable embedded
SuperHyperModel. But all only non-obvious simple Extreme type-SuperHyperSets of the
Extreme R-Hamiltonian-Type-Cycle-Cut amid those obvious simple Extreme type-SuperHyperSets of
the Extreme Hamiltonian-Type-Cycle-Cut, are

V \ V \ {aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .

In a connected Extreme SuperHyperGraph ESHG : (V, E).

To sum them up, assume a connected loopless Extreme SuperHyperGraph ESHG : (V, E).
Then in the worst case, literally,

V \ V \ {aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

is an Extreme R-Hamiltonian-Type-Cycle-Cut. In other words, the least cardinality, the lower sharp
bound for the cardinality, of an Extreme R-Hamiltonian-Type-Cycle-Cut is the cardinality of

V \ V \ {aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .

2326
To sum them up, in a connected Extreme SuperHyperGraph ESHG : (V, E). The all interior 2327
Extreme SuperHyperVertices belong to any Extreme quasi-R-Hamiltonian-Type-Cycle-Cut if for any 2328
of them, and any of other corresponded Extreme SuperHyperVertex, some interior Extreme 2329
SuperHyperVertices are mutually Extreme SuperHyperNeighbors with no Extreme exception at 2330
all minus all Extreme SuperHypeNeighbors to any amount of them. 2331

Assume a connected Extreme SuperHyperGraph ESHG : (V, E). Let an Extreme SuperHy- 2332
perEdge ESHE : E ∈ EESHG:(V,E) has some Extreme SuperHyperVertices r. Consider all 2333
Extreme numbers of those Extreme SuperHyperVertices from that Extreme SuperHyperEdge 2334
excluding excluding more than r distinct Extreme SuperHyperVertices, exclude to any given 2335
Extreme SuperHyperSet of the Extreme SuperHyperVertices. Consider there’s an Extreme 2336

R-Hamiltonian-Type-Cycle-Cut with the least cardinality, the lower sharp Extreme bound for Extreme 2337
cardinality. Assume a connected Extreme SuperHyperGraph ESHG : (V, E). The Extreme 2338
SuperHyperSet of the Extreme SuperHyperVertices VESHE \ {z} is an Extreme SuperHyperSet 2339
S of the Extreme SuperHyperVertices such that there’s an Extreme SuperHyperEdge to have 2340
some Extreme SuperHyperVertices uniquely but it isn’t an Extreme R-Hamiltonian-Type-Cycle-Cut. 2341
Since it doesn’t have 2342

2343
the maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme SuperHy- 2344
perVertices such that there’s an Extreme SuperHyperEdge to have some SuperHyperVertices 2345
uniquely. The Extreme SuperHyperSet of the Extreme SuperHyperVertices VESHE ∪ {z} is 2346
the maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme SuperHyper- 2347
Vertices but it isn’t an Extreme R-Hamiltonian-Type-Cycle-Cut. Since it doesn’t do the Extreme 2348

procedure such that such that there’s an Extreme SuperHyperEdge to have some Extreme 2349
SuperHyperVertices uniquely [there are at least one Extreme SuperHyperVertex outside 2350
implying there’s, sometimes in the connected Extreme SuperHyperGraph ESHG : (V, E), 2351
an Extreme SuperHyperVertex, titled its Extreme SuperHyperNeighbor, to that Extreme 2352
SuperHyperVertex in the Extreme SuperHyperSet S so as S doesn’t do “the Extreme pro- 2353
cedure”.]. There’s only one Extreme SuperHyperVertex outside the intended Extreme 2354

SuperHyperSet, VESHE ∪ {z}, in the terms of Extreme SuperHyperNeighborhood. Thus the 2355
obvious Extreme R-Hamiltonian-Type-Cycle-Cut, VESHE is up. The obvious simple Extreme type- 2356
SuperHyperSet of the Extreme R-Hamiltonian-Type-Cycle-Cut, VESHE , is an Extreme SuperHyperSet, 2357
VESHE , includes only all Extreme SuperHyperVertices does forms any kind of Extreme 2358
pairs are titled Extreme SuperHyperNeighbors in a connected Extreme SuperHyperGraph 2359
ESHG : (V, E). Since the Extreme SuperHyperSet of the Extreme SuperHyperVertices VESHE , 2360

is the maximum Extreme SuperHyperCardinality of an Extreme SuperHyperSet S of 2361

Extreme SuperHyperVertices such that there’s an Extreme SuperHyperEdge to have some 2362
Extreme SuperHyperVertices uniquely. Thus, in a connected Extreme SuperHyperGraph 2363
ESHG : (V, E). Any Extreme R-Hamiltonian-Type-Cycle-Cut only contains all interior Extreme 2364
SuperHyperVertices and all exterior Extreme SuperHyperVertices from the unique Extreme 2365
SuperHyperEdge where there’s any of them has all possible Extreme SuperHyperNeighbors in 2366

and there’s all Extreme SuperHyperNeighborhoods in with no exception minus all Extreme 2367

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

SuperHypeNeighbors to some of them not all of them but everything is possible about Extreme 2368
SuperHyperNeighborhoods and Extreme SuperHyperNeighbors out. 2369
The SuperHyperNotion, namely, Hamiltonian-Type-Cycle-Cut, is up. There’s neither empty Su- 2370
perHyperEdge nor loop SuperHyperEdge. The following Extreme SuperHyperSet of Ex- 2371
treme SuperHyperEdges[SuperHyperVertices] is the simple Extreme type-SuperHyperSet 2372
of the Extreme Hamiltonian-Type-Cycle-Cut. The Extreme SuperHyperSet of Extreme SuperHy- 2373

perEdges[SuperHyperVertices], 2374

C(N SHG)ExtremeQuasi−Hamiltonian−T ype−Cycle−Cut

|EESHG:(V,E) |Extreme Cardinality
b c
= {E2i−1 }i=1 2
.
C(N SHG)ExtremeQuasi−Hamiltonian−T ype−Cycle−CutSuperHyperP olynomial
|EESHG:(V,E) |Extreme Cardinality
= 2z b 2 c
.
C(N SHG)ExtremeR−Quasi−Hamiltonian−T ype−Cycle−Cut = {Vi }si=1 , {Vj }tj=1 .
C(N SHG)ExtremeR−Quasi−Hamiltonian−T ype−Cycle−CutSuperHyperP olynomial = az s + bz t .

is the simple Extreme type-SuperHyperSet of the Extreme Hamiltonian-Type-Cycle-Cut. The Extreme 2375

SuperHyperSet of the Extreme SuperHyperEdges[SuperHyperVertices], 2376

C(N SHG)ExtremeQuasi−Hamiltonian−T ype−Cycle−Cut

|EESHG:(V,E) |Extreme Cardinality
b c
= {E2i−1 }i=1 2
.
C(N SHG)ExtremeQuasi−Hamiltonian−T ype−Cycle−CutSuperHyperP olynomial
|EESHG:(V,E) |Extreme Cardinality
= 2z b 2 c
.
C(N SHG)ExtremeR−Quasi−Hamiltonian−T ype−Cycle−Cut = {Vi }si=1 , {Vj }tj=1 .
C(N SHG)ExtremeR−Quasi−Hamiltonian−T ype−Cycle−CutSuperHyperP olynomial = az s + bz t .

Is an Extreme Hamiltonian-Type-Cycle-Cut C(ESHG) for an Extreme SuperHyperGraph 2377

ESHG : (V, E) is an Extreme type-SuperHyperSet with 2378

2379
the maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme Su- 2380
perHyperEdges[SuperHyperVertices] such that there’s no Extreme SuperHyperVertex of an 2381
Extreme SuperHyperEdge is common and there’s an Extreme SuperHyperEdge for all Extreme 2382
SuperHyperVertices. There are not only two Extreme SuperHyperVertices inside the intended 2383

Extreme SuperHyperSet. Thus the non-obvious Extreme Hamiltonian-Type-Cycle-Cut is up. The 2384
obvious simple Extreme type-SuperHyperSet called the Extreme Hamiltonian-Type-Cycle-Cut is an 2385
Extreme SuperHyperSet includes only two Extreme SuperHyperVertices. But the Extreme 2386
SuperHyperSet of the Extreme SuperHyperEdges[SuperHyperVertices], 2387

C(N SHG)ExtremeQuasi−Hamiltonian−T ype−Cycle−Cut

|EESHG:(V,E) |Extreme Cardinality
b c
= {E2i−1 }i=1 2
.
C(N SHG)ExtremeQuasi−Hamiltonian−T ype−Cycle−CutSuperHyperP olynomial
|EESHG:(V,E) |Extreme Cardinality
= 2z b 2 c
.

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

C(N SHG)ExtremeR−Quasi−Hamiltonian−T ype−Cycle−Cut = {Vi }si=1 , {Vj }tj=1 .

C(N SHG)ExtremeR−Quasi−Hamiltonian−T ype−Cycle−CutSuperHyperP olynomial = az s + bz t .

Doesn’t have less than three SuperHyperVertices inside the intended Extreme SuperHyper- 2388
Set. Thus the non-obvious simple Extreme type-SuperHyperSet of the Extreme Hamiltonian- 2389
Type-Cycle-Cut is up. To sum them up, the Extreme SuperHyperSet of the Extreme SuperHy- 2390
perEdges[SuperHyperVertices], 2391

C(N SHG)ExtremeQuasi−Hamiltonian−T ype−Cycle−Cut

|EESHG:(V,E) |Extreme Cardinality
b c
= {E2i−1 }i=1 2
.
C(N SHG)ExtremeQuasi−Hamiltonian−T ype−Cycle−CutSuperHyperP olynomial
|EESHG:(V,E) |Extreme Cardinality
= 2z b 2 c
.
C(N SHG)ExtremeR−Quasi−Hamiltonian−T ype−Cycle−Cut = {Vi }si=1 , {Vj }tj=1 .
C(N SHG)ExtremeR−Quasi−Hamiltonian−T ype−Cycle−CutSuperHyperP olynomial = az s + bz t .

Is the non-obvious simple Extreme type-SuperHyperSet of the Extreme Hamiltonian-Type-Cycle-Cut. 2392

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

C(N SHG)ExtremeQuasi−Hamiltonian−T ype−Cycle−Cut

|EESHG:(V,E) |Extreme Cardinality
b c
= {E2i−1 }i=1 2
.
C(N SHG)ExtremeQuasi−Hamiltonian−T ype−Cycle−CutSuperHyperP olynomial
|EESHG:(V,E) |Extreme Cardinality
= 2z b 2 c
.
C(N SHG)ExtremeR−Quasi−Hamiltonian−T ype−Cycle−Cut = {Vi }si=1 , {Vj }tj=1 .
C(N SHG)ExtremeR−Quasi−Hamiltonian−T ype−Cycle−CutSuperHyperP olynomial = az s + bz t .

Is an Extreme Hamiltonian-Type-Cycle-Cut C(ESHG) for an Extreme SuperHyperGraph ESHG : 2394

(V, E) is the Extreme SuperHyperSet S of Extreme SuperHyperVertices such that there’s 2395
no an Extreme SuperHyperEdge for some Extreme SuperHyperVertices given by that Ex- 2396
treme type-SuperHyperSet called the Extreme Hamiltonian-Type-Cycle-Cut and it’s an Extreme 2397

Hamiltonian-Type-Cycle-Cut. Since it’s 2398

2399
the maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme Su- 2400
perHyperEdges[SuperHyperVertices] such that there’s no Extreme SuperHyperVertex of an 2401
Extreme SuperHyperEdge is common and there’s an Extreme SuperHyperEdge for all Extreme 2402
SuperHyperVertices. There aren’t only less than three Extreme SuperHyperVertices inside the 2403

intended Extreme SuperHyperSet, 2404

C(N SHG)ExtremeQuasi−Hamiltonian−T ype−Cycle−Cut

|EESHG:(V,E) |Extreme Cardinality
b c
= {E2i−1 }i=1 2
.
C(N SHG)ExtremeQuasi−Hamiltonian−T ype−Cycle−CutSuperHyperP olynomial
|EESHG:(V,E) |Extreme Cardinality
= 2z b 2 c
.

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

C(N SHG)ExtremeR−Quasi−Hamiltonian−T ype−Cycle−Cut = {Vi }si=1 , {Vj }tj=1 .

C(N SHG)ExtremeR−Quasi−Hamiltonian−T ype−Cycle−CutSuperHyperP olynomial = az s + bz t .

Thus the non-obvious Extreme Hamiltonian-Type-Cycle-Cut , 2405

C(N SHG)ExtremeQuasi−Hamiltonian−T ype−Cycle−Cut

|EESHG:(V,E) |Extreme Cardinality
b c
= {E2i−1 }i=1 2
.
C(N SHG)ExtremeQuasi−Hamiltonian−T ype−Cycle−CutSuperHyperP olynomial
|EESHG:(V,E) |Extreme Cardinality
= 2z b 2 c
.
C(N SHG)ExtremeR−Quasi−Hamiltonian−T ype−Cycle−Cut = {Vi }si=1 , {Vj }tj=1 .
C(N SHG)ExtremeR−Quasi−Hamiltonian−T ype−Cycle−CutSuperHyperP olynomial = az s + bz t .

Is up. The obvious simple Extreme type-SuperHyperSet of the Extreme Hamiltonian-Type-Cycle-Cut , 2406
not: 2407

C(N SHG)ExtremeQuasi−Hamiltonian−T ype−Cycle−Cut

|EESHG:(V,E) |Extreme Cardinality
b c
= {E2i−1 }i=1 2
.
C(N SHG)ExtremeQuasi−Hamiltonian−T ype−Cycle−CutSuperHyperP olynomial
|EESHG:(V,E) |Extreme Cardinality
= 2z b 2 c
.
C(N SHG)ExtremeR−Quasi−Hamiltonian−T ype−Cycle−Cut = {Vi }si=1 , {Vj }tj=1 .
C(N SHG)ExtremeR−Quasi−Hamiltonian−T ype−Cycle−CutSuperHyperP olynomial = az s + bz t .

Is the Extreme SuperHyperSet, not: 2408

C(N SHG)ExtremeQuasi−Hamiltonian−T ype−Cycle−Cut

|EESHG:(V,E) |Extreme Cardinality
b c
= {E2i−1 }i=1 2
.
C(N SHG)ExtremeQuasi−Hamiltonian−T ype−Cycle−CutSuperHyperP olynomial
|EESHG:(V,E) |Extreme Cardinality
= 2z b 2 c
.
C(N SHG)ExtremeR−Quasi−Hamiltonian−T ype−Cycle−Cut = {Vi }si=1 , {Vj }tj=1 .
C(N SHG)ExtremeR−Quasi−Hamiltonian−T ype−Cycle−CutSuperHyperP olynomial = az s + bz t .

Does includes only less than three SuperHyperVertices in a connected Extreme SuperHyperGraph 2409
ESHG : (V, E). It’s interesting to mention that the only non-obvious simple Extreme type- 2410
SuperHyperSet called the 2411

“Extreme Hamiltonian-Type-Cycle-Cut ” 2412

amid those obvious[non-obvious] simple Extreme type-SuperHyperSets called the 2413

Extreme Hamiltonian-Type-Cycle-Cut , 2414

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

is only and only 2415

C(N SHG)ExtremeQuasi−Hamiltonian−T ype−Cycle−Cut

|EESHG:(V,E) |Extreme Cardinality
b c
= {E2i−1 }i=1 2
.
C(N SHG)ExtremeQuasi−Hamiltonian−T ype−Cycle−CutSuperHyperP olynomial
|EESHG:(V,E) |Extreme Cardinality
= 2z b 2 c
.
C(N SHG)ExtremeR−Quasi−Hamiltonian−T ype−Cycle−Cut = {Vi }si=1 , {Vj }tj=1 .
C(N SHG)ExtremeR−Quasi−Hamiltonian−T ype−Cycle−CutSuperHyperP olynomial = az s + bz t .

In a connected Extreme SuperHyperGraph ESHG : (V, E).  2416

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 CHAPTER 11 2417

The Extreme Departures on The 2418

Theoretical Results Toward Theoretical 2419

Motivations 2420

The previous Extreme approach apply on the upcoming Extreme results on Extreme 2421
SuperHyperClasses. 2422

Proposition 11.0.1. Assume a connected Extreme SuperHyperPath ESHP : (V, E). Then 2423

C(N SHG)Extreme Hamiltonian-Type-Cycle-Cut

= {Eimax }.
C(N SHG)Extreme Hamiltonian-Type-Cycle-Cut SuperHyperPolynomial
max
= z |Ei |
.
C(N SHG)Extreme V-Hamiltonian-Type-Cycle-Cut
= {Vi ∈ Eimax }.
C(N SHG)Extreme V-Hamiltonian-Type-Cycle-Cut SuperHyperPolynomial
X
= ai z bj .
Proof. Let 2424

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V |EN SHG |
, E |EN SHG |
3 3
2425

P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
...,
EXT ERN AL
E |EN SHG | , V |EN SHG |
3 3

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

Figure 11.1: an Extreme SuperHyperPath Associated to the Notions of Extreme

SuperHyperHamiltonian-Type-Cycle-Cut in the Example (42.0.5) 136NSHG18a

be a longest path taken from a connected Extreme SuperHyperPath ESHP : (V, E). There’s a 2426

new way to redefine as 2427

ViEXT ERN AL ∼ VjEXT ERN AL ≡

∃!Ez ∈ EESHG:(V,E) , ViEXT ERN AL , VjEXT ERN AL ∈ Ez ≡
∃!Ez ∈ EESHG:(V,E) , {ViEXT ERN AL , VjEXT ERN AL } ⊆ Ez .

The term “EXTERNAL” implies |N (ViEXT ERN AL )| ≥ |N (Vj )| where Vj is corresponded 2428
to ViEXT ERN AL in the literatures of SuperHyperHamiltonian-Type-Cycle-Cut. The latter is 2429
straightforward.  2430

136EXM18a Example 11.0.2. In the Figure (31.1), the connected Extreme SuperHyperPath ESHP : (V, E), 2431
is highlighted and featured. The Extreme SuperHyperSet, in the Extreme SuperHyperModel 2432
(31.1), is the SuperHyperHamiltonian-Type-Cycle-Cut. 2433

Proposition 11.0.3. Assume a connected Extreme SuperHyperCycle ESHC : (V, E). Then 2434

C(N SHG)Extreme Hamiltonian-Type-Cycle-Cut

= {Ei ∈ EN SHG }.
C(N SHG)Extreme Hamiltonian-Type-Cycle-Cut SuperHyperPolynomial
X
= ai z bj .

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

C(N SHG)Extreme V-Hamiltonian-Type-Cycle-Cut

= {Vi ∈ VN SHG }.
C(N SHG)Extreme V-Hamiltonian-Type-Cycle-Cut SuperHyperPolynomial
X
= ai z bj .

2435

Proof. Let 2436

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V |EN SHG |
, E |EN SHG |
3 3

2437

P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
...,
EXT ERN AL
E |EN SHG | , V |EN SHG |
3 3

be a longest path taken from a connected Extreme SuperHyperCycle ESHC : (V, E). There’s a 2438
new way to redefine as 2439

ViEXT ERN AL ∼ VjEXT ERN AL ≡

∃!Ez ∈ EESHG:(V,E) , ViEXT ERN AL , VjEXT ERN AL ∈ Ez ≡
∃!Ez ∈ EESHG:(V,E) , {ViEXT ERN AL , VjEXT ERN AL } ⊆ Ez .

The term “EXTERNAL” implies |N (ViEXT ERN AL )| ≥ |N (Vj )| where Vj is corresponded 2440
to ViEXT ERN AL in the literatures of SuperHyperHamiltonian-Type-Cycle-Cut. The latter is 2441

straightforward.  2442

136EXM19a Example 11.0.4. In the Figure (31.2), the connected Extreme SuperHyperCycle N SHC : 2443
(V, E), is highlighted and featured. The obtained Extreme SuperHyperSet, in the Extreme 2444
SuperHyperModel (31.2), is the Extreme SuperHyperHamiltonian-Type-Cycle-Cut. 2445

Henry Garrett · 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.2: an Extreme SuperHyperCycle Associated to the Extreme Notions of Extreme

SuperHyperHamiltonian-Type-Cycle-Cut in the Extreme Example (42.0.7) 136NSHG19a

Proposition 11.0.5. Assume a connected Extreme SuperHyperStar ESHS : (V, E). Then 2446

C(N SHG)Extreme Hamiltonian-Type-Cycle-Cut

= {}.
C(N SHG)Extreme Hamiltonian-Type-Cycle-Cut SuperHyperPolynomial
= 0z 0 .
C(N SHG)Extreme V-Hamiltonian-Type-Cycle-Cut
= {}.
C(N SHG)Extreme V-Hamiltonian-Type-Cycle-Cut SuperHyperPolynomial
= 0z 0 .

Proof. Let 2447

P :
V1EXT ERN AL , E1 ,
CEN T ER, E2
2448

P :
E1 , V1EXT ERN AL ,
E2 , CEN T ER

Henry Garrett · 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.3: an Extreme SuperHyperStar Associated to the Extreme Notions of Extreme

SuperHyperHamiltonian-Type-Cycle-Cut in the Extreme Example (42.0.9) 136NSHG20a

be a longest path taken a connected Extreme SuperHyperStar ESHS : (V, E). There’s a new 2449
way to redefine as 2450

ViEXT ERN AL ∼ VjEXT ERN AL ≡

∃!Ez ∈ EESHG:(V,E) , ViEXT ERN AL , VjEXT ERN AL ∈ Ez ≡
∃!Ez ∈ EESHG:(V,E) , {ViEXT ERN AL , VjEXT ERN AL } ⊆ Ez .

The term “EXTERNAL” implies |N (ViEXT ERN AL )| ≥ |N (Vj )| where Vj is corresponded 2451
to ViEXT ERN AL in the literatures of SuperHyperHamiltonian-Type-Cycle-Cut. The latter is 2452
straightforward.  2453

136EXM20a Example 11.0.6. In the Figure (31.3), the connected Extreme SuperHyperStar ESHS : (V, E), 2454
is highlighted and featured. The obtained Extreme SuperHyperSet, by the Algorithm in previous 2455
Extreme result, of the Extreme SuperHyperVertices of the connected Extreme SuperHyperStar 2456

ESHS : (V, E), in the Extreme SuperHyperModel (31.3), is the Extreme SuperHyperHamiltonian- 2457
Type-Cycle-Cut. 2458

Proposition 11.0.7. Assume a connected Extreme SuperHyperBipartite ESHB : (V, E). Then 2459

C(N SHG)Extreme Hamiltonian-Type-Cycle-Cut

= {Vi ∈ P min }.

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

C(N SHG)Extreme Hamiltonian-Type-Cycle-Cut SuperHyperPolynomial

X
= ai z bj .
C(N SHG)Extreme V-Hamiltonian-Type-Cycle-Cut
= {Vi ∈ P min }.
C(N SHG)Extreme V-Hamiltonian-Type-Cycle-Cut SuperHyperPolynomial
X
= ai z bj .

Proof. Let 2460

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V|Pi |=minP ∈E |Pj | , E|Pi |=minPj ∈EN SHG |Pj | .
j N SHG
2461

P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
...,
EXT ERN AL
E|Pi |=minPj ∈EN SHG |Pj | , V|Pi |=minP ∈E |Pj |
j N SHG

is a longest path taken from a connected Extreme SuperHyperBipartite ESHB : (V, E). There’s 2462
a new way to redefine as 2463

ViEXT ERN AL ∼ VjEXT ERN AL ≡

∃!Ez ∈ EESHG:(V,E) , ViEXT ERN AL , VjEXT ERN AL ∈ Ez ≡
∃!Ez ∈ EESHG:(V,E) , {ViEXT ERN AL , VjEXT ERN AL } ⊆ Ez .

The term “EXTERNAL” implies |N (ViEXT ERN AL )| ≥ |N (Vj )| where Vj is corresponded 2464
to ViEXT ERN AL in the literatures of SuperHyperHamiltonian-Type-Cycle-Cut. The latter is 2465
straightforward. Then there’s no at least one SuperHyperHamiltonian-Type-Cycle-Cut. Thus the 2466
notion of quasi may be up but the SuperHyperNotions based on SuperHyperHamiltonian-Type-Cycle- 2467
Cut could be applied. There are only two SuperHyperParts. Thus every SuperHyperPart could 2468

have one SuperHyperVertex as the representative in the 2469

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperHamiltonian-Type-Cycle-Cut taken from a connected Extreme SuperHyperBi- 2470
partite ESHB : (V, E). Thus only some SuperHyperVertices and only minimum-Extreme-of- 2471

SuperHyperPart SuperHyperEdges are attained in any solution 2472

P :

Henry Garrett · 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.4: Extreme SuperHyperBipartite Extreme Associated to the Extreme Notions of

Extreme SuperHyperHamiltonian-Type-Cycle-Cut in the Example (42.0.11) 136NSHG21a

V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

The latter is straightforward.  2473

136EXM21a Example 11.0.8. In the Extreme Figure (31.4), the connected Extreme SuperHyperBipartite 2474

ESHB : (V, E), is Extreme highlighted and Extreme featured. The obtained Extreme 2475
SuperHyperSet, by the Extreme Algorithm in previous Extreme result, of the Extreme 2476
SuperHyperVertices of the connected Extreme SuperHyperBipartite ESHB : (V, E), in the 2477
Extreme SuperHyperModel (31.4), is the Extreme SuperHyperHamiltonian-Type-Cycle-Cut. 2478

Proposition 11.0.9. Assume a connected Extreme SuperHyperMultipartite ESHM : (V, E). 2479
Then 2480

C(N SHG)Extreme Hamiltonian-Type-Cycle-Cut

= {Vi ∈ P min }.
C(N SHG)Extreme Hamiltonian-Type-Cycle-Cut SuperHyperPolynomial
X
= ai z bj .
C(N SHG)Extreme V-Hamiltonian-Type-Cycle-Cut
= {Vi ∈ P min }.
C(N SHG)Extreme V-Hamiltonian-Type-Cycle-Cut SuperHyperPolynomial
X
= ai z bj .

Henry Garrett · 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 2481

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V|Pi |=minP ∈E |Pj | , E|Pi |=minPj ∈EN SHG |Pj | .
j N SHG

2482

P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
...,
EXT ERN AL
E|Pi |=minPj ∈EN SHG |Pj | , V|Pi |=minP ∈E |Pj |
j N SHG

is a longest SuperHyperHamiltonian-Type-Cycle-Cut taken from a connected Extreme SuperHyperMul- 2483

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

ViEXT ERN AL ∼ VjEXT ERN AL ≡

∃!Ez ∈ EESHG:(V,E) , ViEXT ERN AL , VjEXT ERN AL ∈ Ez ≡
∃!Ez ∈ EESHG:(V,E) , {ViEXT ERN AL , VjEXT ERN AL } ⊆ Ez .

The term “EXTERNAL” implies |N (ViEXT ERN AL )| ≥ |N (Vj )| where Vj is corresponded 2485
to ViEXT ERN AL in the literatures of SuperHyperHamiltonian-Type-Cycle-Cut. The latter is 2486
straightforward. Then there’s no at least one SuperHyperHamiltonian-Type-Cycle-Cut. Thus the 2487

notion of quasi may be up but the SuperHyperNotions based on SuperHyperHamiltonian-Type-Cycle- 2488

0
Cut could be applied. There are only z SuperHyperParts. Thus every SuperHyperPart could 2489
have one SuperHyperVertex as the representative in the 2490

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

is a longest path taken from a connected Extreme SuperHyperMultipartite ESHM : 2491

(V, E). Thus only some SuperHyperVertices and only minimum-Extreme-of-SuperHyperPart 2492
SuperHyperEdges are attained in any solution 2493

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

is a longest path taken from a connected Extreme SuperHyperMultipartite ESHM : (V, E). 2494

The latter is straightforward.  2495

Henry Garrett · 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.5: an Extreme SuperHyperMultipartite Associated to the Notions of Extreme

SuperHyperHamiltonian-Type-Cycle-Cut in the Example (42.0.13) 136NSHG22a

136EXM22a Example 11.0.10. In the Figure (31.5), the connected Extreme SuperHyperMultipartite 2496
ESHM : (V, E), is highlighted and Extreme featured. The obtained Extreme SuperHyperSet, by 2497
the Algorithm in previous Extreme result, of the Extreme SuperHyperVertices of the connected 2498
Extreme SuperHyperMultipartite ESHM : (V, E), in the Extreme SuperHyperModel (31.5), is 2499
the Extreme SuperHyperHamiltonian-Type-Cycle-Cut. 2500

Proposition 11.0.11. Assume a connected Extreme SuperHyperWheel ESHW : (V, E). Then, 2501

C(N SHG)Extreme Hamiltonian-Type-Cycle-Cut

= {Ei=1|EN SHG |−1 , Ea∗ , Eb∗ }.
C(N SHG)Extreme Hamiltonian-Type-Cycle-Cut SuperHyperPolynomial
X
= ai z bj .
C(N SHG)Extreme V-Hamiltonian-Type-Cycle-Cut
= {Vi ∈ VN SHG }.
C(N SHG)Extreme V-Hamiltonian-Type-Cycle-Cut SuperHyperPolynomial
X
= ai z bj .

Proof. Let 2502

P :
V1EXT ERN AL , E1∗ ,
CEN T ER, E2∗

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

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

Extreme SuperHyperHamiltonian-Type-Cycle-Cut in the Extreme Example (42.0.15) 136NSHG23a

2503

P :
E1∗ , V1EXT ERN AL ,
E2∗ , CEN T ER

is a longest SuperHyperHamiltonian-Type-Cycle-Cut taken from a connected Extreme SuperHyper- 2504

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

ViEXT ERN AL ∼ VjEXT ERN AL ≡

∃!Ez ∈ EESHG:(V,E) , ViEXT ERN AL , VjEXT ERN AL ∈ Ez ≡
∃!Ez ∈ EESHG:(V,E) , {ViEXT ERN AL , VjEXT ERN AL } ⊆ Ez .

The term “EXTERNAL” implies |N (ViEXT ERN AL )| ≥ |N (Vj )| where Vj is corresponded 2506
to ViEXT ERN AL in the literatures of SuperHyperHamiltonian-Type-Cycle-Cut. The latter is 2507
straightforward. Then there’s at least one SuperHyperHamiltonian-Type-Cycle-Cut. Thus the notion 2508
of quasi isn’t up and the SuperHyperNotions based on SuperHyperHamiltonian-Type-Cycle-Cut 2509
could be applied. The unique embedded SuperHyperHamiltonian-Type-Cycle-Cut proposes some 2510
longest SuperHyperHamiltonian-Type-Cycle-Cut excerpt from some representatives. The latter is 2511

straightforward.  2512

136EXM23a Example 11.0.12. In the Extreme Figure (31.6), the connected Extreme SuperHyperWheel 2513
N SHW : (V, E), is Extreme highlighted and featured. The obtained Extreme SuperHyperSet, 2514

by the Algorithm in previous result, of the Extreme SuperHyperVertices of the connected 2515
Extreme SuperHyperWheel ESHW : (V, E), in the Extreme SuperHyperModel (31.6), is the 2516
Extreme SuperHyperHamiltonian-Type-Cycle-Cut. 2517

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 CHAPTER 12 2518

The Surveys of Mathematical Sets On 2519

The Results But As The Initial Motivation 2520

For the SuperHyperHamiltonian-Type-Cycle-Cut, Extreme SuperHyperHamiltonian-Type-Cycle-Cut, and the 2521

Extreme SuperHyperHamiltonian-Type-Cycle-Cut, some general results are introduced. 2522

Remark 12.0.1. Let remind that the Extreme SuperHyperHamiltonian-Type-Cycle-Cut is “redefined” 2523
on the positions of the alphabets. 2524

Corollary 12.0.2. Assume Extreme SuperHyperHamiltonian-Type-Cycle-Cut. Then 2525

Extreme SuperHyperHamiltonian − T ype − Cycle − Cut =

{theSuperHyperHamiltonian − T ype − Cycle − Cutof theSuperHyperV ertices |
max |SuperHyperOf f ensive
SuperHyperHamiltonian − T ype − Cycle − Cut
|ExtremecardinalityamidthoseSuperHyperHamiltonian−T ype−Cycle−Cut. }

plus one Extreme SuperHypeNeighbor to one. Where σi is the unary operation on the 2526
SuperHyperVertices of the SuperHyperGraph to assign the determinacy, the indeterminacy 2527
and the neutrality, for i = 1, 2, 3, respectively. 2528

Corollary 12.0.3. Assume an Extreme SuperHyperGraph on the same identical letter of the 2529
alphabet. Then the notion of Extreme SuperHyperHamiltonian-Type-Cycle-Cut and SuperHyperHamiltonian- 2530

Type-Cycle-Cut coincide. 2531

Corollary 12.0.4. Assume an Extreme SuperHyperGraph on the same identical letter of 2532
the alphabet. Then a conseNeighborive sequence of the SuperHyperVertices is an Extreme 2533
SuperHyperHamiltonian-Type-Cycle-Cut if and only if it’s a SuperHyperHamiltonian-Type-Cycle-Cut. 2534

Corollary 12.0.5. Assume an Extreme SuperHyperGraph on the same identical letter of 2535
the alphabet. Then a conseNeighborive sequence of the SuperHyperVertices is a strongest 2536
SuperHyperHamiltonian-Type-Cycle-Cut if and only if it’s a longest SuperHyperHamiltonian-Type-Cycle-Cut. 2537

Corollary 12.0.6. Assume SuperHyperClasses of an Extreme SuperHyperGraph on the same 2538

identical letter of the alphabet. Then its Extreme SuperHyperHamiltonian-Type-Cycle-Cut is its 2539
SuperHyperHamiltonian-Type-Cycle-Cut and reversely. 2540

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

Corollary 12.0.7. Assume an Extreme SuperHyperPath(-/SuperHyperHamiltonian-Type-Cycle-Cut, 2541

SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel) on the same 2542
identical letter of the alphabet. Then its Extreme SuperHyperHamiltonian-Type-Cycle-Cut is its 2543
SuperHyperHamiltonian-Type-Cycle-Cut and reversely. 2544

Corollary 12.0.8. Assume an Extreme SuperHyperGraph. Then its Extreme SuperHyperHamiltonian- 2545
isn’t well-defined if and only if its SuperHyperHamiltonian-Type-Cycle-Cut isn’t well-defined.
Type-Cycle-Cut 2546

Corollary 12.0.9. Assume SuperHyperClasses of an Extreme SuperHyperGraph. Then its 2547

Extreme SuperHyperHamiltonian-Type-Cycle-Cut isn’t well-defined if and only if its SuperHyperHamiltonian- 2548

Type-Cycle-Cut isn’t well-defined. 2549

Corollary 12.0.10. Assume an Extreme SuperHyperPath(-/SuperHyperHamiltonian-Type-Cycle-Cut, 2550

SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). Then its 2551
Extreme SuperHyperHamiltonian-Type-Cycle-Cut isn’t well-defined if and only if its SuperHyperHamiltonian- 2552
Type-Cycle-Cut isn’t well-defined. 2553

Corollary 12.0.11. Assume an Extreme SuperHyperGraph. Then its Extreme SuperHyperHamiltonian-2554

is well-defined if and only if its SuperHyperHamiltonian-Type-Cycle-Cut is well-defined.
Type-Cycle-Cut 2555

Corollary 12.0.12. Assume SuperHyperClasses of an Extreme SuperHyperGraph. Then its 2556

Extreme SuperHyperHamiltonian-Type-Cycle-Cut is well-defined if and only if its SuperHyperHamiltonian- 2557
Type-Cycle-Cut is well-defined. 2558

Corollary 12.0.13. Assume an Extreme SuperHyperPath(-/SuperHyperHamiltonian-Type-Cycle-Cut, 2559

SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). Then its 2560
Extreme SuperHyperHamiltonian-Type-Cycle-Cut is well-defined if and only if its SuperHyperHamiltonian- 2561
Type-Cycle-Cut is well-defined. 2562

Proposition 12.0.14. Let ESHG : (V, E) be an Extreme SuperHyperGraph. Then V is 2563

(i) : the dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 2564

(ii) : the strong dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 2565

(iii) : the connected dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 2566

(iv) : the δ-dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 2567

(v) : the strong δ-dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 2568

(vi) : the connected δ-dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut. 2569

Proposition 12.0.15. Let N T G : (V, E, σ, µ) be an Extreme SuperHyperGraph. Then ∅ is 2570

(i) : the SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 2571

(ii) : the strong SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 2572

(iii) : the connected defensive SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 2573

(iv) : the δ-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 2574

(v) : the strong δ-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 2575

Henry Garrett · 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 δ-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut. 2576

Proposition 12.0.16. Let ESHG : (V, E) be an Extreme SuperHyperGraph. Then an 2577

independent SuperHyperSet is 2578

(i) : the SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 2579

(ii) : the strong SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 2580

(iii) : the connected SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 2581

(iv) : the δ-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 2582

(v) : the strong δ-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 2583

(vi) : the connected δ-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut. 2584

Proposition 12.0.17. Let ESHG : (V, E) be an Extreme SuperHyperUniform SuperHyperGraph 2585

which is a SuperHyperHamiltonian-Type-Cycle-Cut/SuperHyperPath. Then V is a maximal 2586

(i) : SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 2587

(ii) : strong SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 2588

(iii) : connected SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 2589

(iv) : O(ESHG)-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 2590

(v) : strong O(ESHG)-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 2591

(vi) : connected O(ESHG)-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 2592

Where the exterior SuperHyperVertices and the interior SuperHyperVertices coincide. 2593

Proposition 12.0.18. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is a 2594

SuperHyperUniform SuperHyperWheel. Then V is a maximal 2595

(i) : dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 2596

(ii) : strong dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 2597

(iii) : connected dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 2598

(iv) : O(ESHG)-dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 2599

(v) : strong O(ESHG)-dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 2600

(vi) : connected O(ESHG)-dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 2601

Where the exterior SuperHyperVertices and the interior SuperHyperVertices coincide. 2602

Proposition 12.0.19. Let ESHG : (V, E) be an Extreme SuperHyperUniform SuperHyperGraph 2603

which is a SuperHyperHamiltonian-Type-Cycle-Cut/SuperHyperPath. Then the number of 2604

(i) : the SuperHyperHamiltonian-Type-Cycle-Cut; 2605

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

(ii) : the SuperHyperHamiltonian-Type-Cycle-Cut; 2606

(iii) : the connected SuperHyperHamiltonian-Type-Cycle-Cut; 2607

(iv) : the O(ESHG)-SuperHyperHamiltonian-Type-Cycle-Cut; 2608

(v) : the strong O(ESHG)-SuperHyperHamiltonian-Type-Cycle-Cut; 2609

(vi) : the connected O(ESHG)-SuperHyperHamiltonian-Type-Cycle-Cut. 2610

is one and it’s only V. Where the exterior SuperHyperVertices and the interior SuperHyperVertices 2611
coincide. 2612

Proposition 12.0.20. Let ESHG : (V, E) be an Extreme SuperHyperUniform SuperHyperGraph 2613

which is a SuperHyperWheel. Then the number of 2614

(i) : the dual SuperHyperHamiltonian-Type-Cycle-Cut; 2615

(ii) : the dual SuperHyperHamiltonian-Type-Cycle-Cut; 2616

(iii) : the dual connected SuperHyperHamiltonian-Type-Cycle-Cut; 2617

(iv) : the dual O(ESHG)-SuperHyperHamiltonian-Type-Cycle-Cut; 2618

(v) : the strong dual O(ESHG)-SuperHyperHamiltonian-Type-Cycle-Cut; 2619

(vi) : the connected dual O(ESHG)-SuperHyperHamiltonian-Type-Cycle-Cut. 2620

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

coincide. 2622

Proposition 12.0.21. Let ESHG : (V, E) be an Extreme SuperHyperUniform SuperHyperGraph 2623

which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperComplete 2624

SuperHyperMultipartite. Then a SuperHyperSet contains [the SuperHyperCenter and] the half of 2625
multiplying r with the number of all the SuperHyperEdges plus one of all the SuperHyperVertices 2626
is a 2627

(i) : dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 2628

(ii) : strong dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 2629

(iii) : connected dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 2630

O(ESHG)
(iv) : 2 + 1-dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 2631

O(ESHG)
(v) : strong 2 + 1-dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 2632

O(ESHG)
(vi) : connected 2 + 1-dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut. 2633

Proposition 12.0.22. Let ESHG : (V, E) be an Extreme SuperHyperUniform SuperHyperGraph 2634

which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperComplete 2635
SuperHyperMultipartite. Then a SuperHyperSet contains the half of multiplying r with the 2636
number of all the SuperHyperEdges plus one of all the SuperHyperVertices in the biggest 2637

SuperHyperPart is a 2638

Henry Garrett · 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 SuperHyperHamiltonian-Type-Cycle-Cut; 2639

(ii) : strong SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 2640

(iii) : connected SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 2641

(iv) : δ-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 2642

(v) : strong δ-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 2643

(vi) : connected δ-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut. 2644

Proposition 12.0.23. Let ESHG : (V, E) be an Extreme SuperHyperUniform SuperHyperGraph 2645

which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperComplete 2646
SuperHyperMultipartite. Then Then the number of 2647

(i) : dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 2648

(ii) : strong dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 2649

(iii) : connected dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 2650

O(ESHG)
(iv) : 2 + 1-dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 2651

O(ESHG)
(v) : strong 2 + 1-dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 2652

O(ESHG)
(vi) : connected 2 + 1-dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut. 2653

is one and it’s only S, a SuperHyperSet contains [the SuperHyperCenter and] the half of 2654
multiplying r with the number of all the SuperHyperEdges plus one of all the SuperHyperVertices. 2655

Where the exterior SuperHyperVertices and the interior SuperHyperVertices coincide. 2656

Proposition 12.0.24. Let ESHG : (V, E) be an Extreme SuperHyperGraph. The number of 2657

connected component is |V − S| if there’s a SuperHyperSet which is a dual 2658

(i) : SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 2659

(ii) : strong SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 2660

(iii) : connected SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 2661

(iv) : SuperHyperHamiltonian-Type-Cycle-Cut; 2662

(v) : strong 1-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 2663

(vi) : connected 1-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut. 2664

Proposition 12.0.25. Let ESHG : (V, E) be an Extreme SuperHyperGraph. Then the number 2665
is at most O(ESHG) and the Extreme number is at most On (ESHG). 2666

Proposition 12.0.26. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is 2667

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

min Σv∈{v1 ,v2 ,··· ,vt } O(ESHG:(V,E)) ⊆V σ(v), in the setting of dual 2669
t>
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

(i) : SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 2670

(ii) : strong SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 2671

(iii) : connected SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 2672

(iv) : ( O(ESHG:(V,E))
2 + 1)-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 2673

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

2 + 1)-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 2674

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

2 + 1)-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut. 2675

Proposition 12.0.27. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is ∅. The 2676
number is 0 and the Extreme number is 0, for an independent SuperHyperSet in the setting of 2677
dual 2678

(i) : SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 2679

(ii) : strong SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 2680

(iii) : connected SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 2681

(iv) : 0-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 2682

(v) : strong 0-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 2683

(vi) : connected 0-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut. 2684

Proposition 12.0.28. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is SuperHy- 2685
perComplete. Then there’s no independent SuperHyperSet. 2686

Proposition 12.0.29. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is 2687

SuperHyperHamiltonian-Type-Cycle-Cut/SuperHyperPath/SuperHyperWheel. The number is O(ESHG : 2688

(V, E)) and the Extreme number is On (ESHG : (V, E)), in the setting of a dual 2689

(i) : SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 2690

(ii) : strong SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 2691

(iii) : connected SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 2692

(iv) : O(ESHG : (V, E))-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 2693

(v) : strong O(ESHG : (V, E))-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 2694

(vi) : connected O(ESHG : (V, E))-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut. 2695

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

(i) : SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 2700

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

(ii) : strong SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 2701

(iii) : connected SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 2702

(iv) : ( O(ESHG:(V,E))
2 + 1)-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 2703

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

2 + 1)-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 2704

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

2 + 1)-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut. 2705

Proposition 12.0.31. Let N SHF : (V, E) be a SuperHyperFamily of the ESHGs : (V, E) 2706
Extreme SuperHyperGraphs which are from one-type SuperHyperClass which the result is obtained 2707
for the individuals. Then the results also hold for the SuperHyperFamily N SHF : (V, E) of 2708
these specific SuperHyperClasses of the Extreme SuperHyperGraphs. 2709

Proposition 12.0.32. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph. If S is a dual 2710
SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut, then ∀v ∈ V \ S, ∃x ∈ S such that 2711

(i) v ∈ Ns (x); 2712

(ii) vx ∈ E. 2713

Proposition 12.0.33. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph. If S is a dual 2714
SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut, then 2715

(i) S is SuperHyperHamiltonian-Type-Cycle-Cut set; 2716

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

Proposition 12.0.34. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph. Then 2718

(i) Γ ≤ O; 2719

(ii) Γs ≤ On . 2720

Proposition 12.0.35. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph which is 2721
connected. Then 2722

(i) Γ ≤ O − 1; 2723

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

Proposition 12.0.36. Let ESHG : (V, E) be an odd SuperHyperPath. Then 2725

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

SuperHyperHamiltonian-Type-Cycle-Cut; 2727

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

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

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

SuperHyperHamiltonian-Type-Cycle-Cut. 2731

Henry Garrett · 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.0.37. Let ESHG : (V, E) be an even SuperHyperPath. Then 2732

(i) the set S = {v2 , v4 , · · · .vn } is a dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle- 2733

Cut; 2734

(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · .vn } and {v1 , v3 , · · · .vn−1 }; 2735

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

(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 2737
SuperHyperHamiltonian-Type-Cycle-Cut. 2738

Proposition 12.0.38. Let ESHG : (V, E) be an even SuperHyperHamiltonian-Type-Cycle-Cut. Then 2739

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

Type-Cycle-Cut; 2741

(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · , vn } and {v1 , v3 , · · · , vn−1 }; 2742

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

(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn } and S2 = {v1 , v3 , · · · , vn−1 } are only dual 2744
SuperHyperHamiltonian-Type-Cycle-Cut. 2745

Proposition 12.0.39. Let ESHG : (V, E) be an odd SuperHyperHamiltonian-Type-Cycle-Cut. Then 2746

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

SuperHyperHamiltonian-Type-Cycle-Cut; 2748

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

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

(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn−1 } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 2751
SuperHyperHamiltonian-Type-Cycle-Cut. 2752

Proposition 12.0.40. Let ESHG : (V, E) be SuperHyperStar. Then 2753

(i) the SuperHyperSet S = {c} is a dual maximal SuperHyperHamiltonian-Type-Cycle-Cut; 2754

(ii) Γ = 1; 2755

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

(iv) the SuperHyperSets S = {c} and S ⊂ S 0 are only dual SuperHyperHamiltonian-Type-Cycle-Cut. 2757

Proposition 12.0.41. Let ESHG : (V, E) be SuperHyperWheel. Then 2758

6+3(i−1)≤n
(i) the SuperHyperSet S = {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is a dual maximal 2759
SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 2760

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

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

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 Henry Garrett · Independent Researcher · Department of Mathematics ·
DrHenryGarrett@gmail.com · Manhattan, NY, USA
6+3(i−1)≤n
(iv) the SuperHyperSet {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is only a dual maximal 2763

SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut. 2764

Proposition 12.0.42. Let ESHG : (V, E) be an odd SuperHyperComplete. Then 2765

b n c+1
(i) the SuperHyperSet S = {vi }i=1
2
is a dual SuperHyperDefensive SuperHyperHamiltonian- 2766
Type-Cycle-Cut; 2767

(ii) Γ = b n2 c + 1; 2768

(iii) Γs = min{Σs∈S Σ3i=1 σi (s)} b n c+1

2
; 2769
S={vi }i=1

b n c+1
(iv) the SuperHyperSet S = {vi }i=1
2
is only a dual SuperHyperDefensive SuperHyperHamiltonian- 2770

Type-Cycle-Cut. 2771

Proposition 12.0.43. Let ESHG : (V, E) be an even SuperHyperComplete. Then 2772

bnc
(i) the SuperHyperSet S = {vi }i=1
2
is a dual SuperHyperDefensive SuperHyperHamiltonian-Type- 2773
Cycle-Cut; 2774

(ii) Γ = b n2 c; 2775

(iii) Γs = min{Σs∈S Σ3i=1 σi (s)} bnc

2
; 2776
S={vi }i=1

bnc
(iv) the SuperHyperSet S = {vi }i=1 2
is only a dual maximal SuperHyperDefensive 2777

SuperHyperHamiltonian-Type-Cycle-Cut. 2778

Proposition 12.0.44. Let N SHF : (V, E) be a m-SuperHyperFamily of Extreme SuperHyper- 2779

Stars with common Extreme SuperHyperVertex SuperHyperSet. Then 2780

(i) the SuperHyperSet S = {c1 , c2 , · · · , cm } is a dual SuperHyperDefensive SuperHyperHamiltonian- 2781

Type-Cycle-Cut for N SHF; 2782

(ii) Γ = m for N SHF : (V, E); 2783

(iii) Γs = Σm 3
i=1 Σj=1 σj (ci ) for N SHF : (V, E); 2784

(iv) the SuperHyperSets S = {c1 , c2 , · · · , cm } and S ⊂ S 0 are only dual SuperHyperHamiltonian- 2785
Type-Cycle-Cut for N SHF : (V, E). 2786

Proposition 12.0.45. Let N SHF : (V, E) be an m-SuperHyperFamily of odd SuperHyperCom- 2787

plete SuperHyperGraphs with common Extreme SuperHyperVertex SuperHyperSet. Then 2788

b n c+1
(i) the SuperHyperSet S = {vi }i=1 2
is a dual maximal SuperHyperDefensive 2789
SuperHyperHamiltonian-Type-Cycle-Cut for N SHF; 2790

(ii) Γ = b n2 c + 1 for N SHF : (V, E); 2791

(iii) Γs = min{Σs∈S Σ3i=1 σi (s)} b n c+1

2
for N SHF : (V, E); 2792
S={vi }i=1

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics ·
DrHenryGarrett@gmail.com · Manhattan, NY, USA
b n c+1
(iv) the SuperHyperSets S = {vi }i=1
2
are only a dual maximal SuperHyperHamiltonian-Type-Cycle- 2793

Cut for N SHF : (V, E). 2794

Proposition 12.0.46. Let N SHF : (V, E) be a m-SuperHyperFamily of even SuperHyperCom- 2795

plete SuperHyperGraphs with common Extreme SuperHyperVertex SuperHyperSet. Then 2796

bnc
(i) the SuperHyperSet S = {vi }i=12
is a dual SuperHyperDefensive SuperHyperHamiltonian-Type- 2797
Cycle-Cut for N SHF : (V, E); 2798

(ii) Γ = b n2 c for N SHF : (V, E); 2799

(iii) Γs = min{Σs∈S Σ3i=1 σi (s)} 2

bnc for N SHF : (V, E); 2800
S={vi }i=1

bnc
(iv) the SuperHyperSets S = {vi }i=1
2
are only dual maximal SuperHyperHamiltonian-Type-Cycle-Cut 2801
for N SHF : (V, E). 2802

Proposition 12.0.47. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph. Then 2803
following statements hold; 2804

(i) if s ≥ t and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 2805

SuperHyperHamiltonian-Type-Cycle-Cut, then S is an s-SuperHyperDefensive SuperHyperHamiltonian- 2806
Type-Cycle-Cut; 2807

(ii) if s ≤ t and a SuperHyperSet S of SuperHyperVertices is a dual t-SuperHyperDefensive 2808

SuperHyperHamiltonian-Type-Cycle-Cut, then S is a dual s-SuperHyperDefensive SuperHyperHamiltonian-
2809
Type-Cycle-Cut. 2810

Proposition 12.0.48. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph. Then 2811

following statements hold; 2812

(i) if s ≥ t + 2 and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 2813

SuperHyperHamiltonian-Type-Cycle-Cut, then S is an s-SuperHyperPowerful SuperHyperHamiltonian- 2814
Type-Cycle-Cut; 2815

(ii) if s ≤ t and a SuperHyperSet S of SuperHyperVertices is a dual t-SuperHyperDefensive 2816

SuperHyperHamiltonian-Type-Cycle-Cut, then S is a dual s-SuperHyperPowerful SuperHyperHamiltonian-2817
Type-Cycle-Cut. 2818

Proposition 12.0.49. Let ESHG : (V, E) be a[an] [V-]SuperHyperUniform-strong-Extreme 2819

SuperHyperGraph. Then following statements hold; 2820

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

SuperHyperHamiltonian-Type-Cycle-Cut; 2822

(ii) if ∀a ∈ V \ S, |Ns (a) ∩ S| > b 2r c + 1, then ESHG : (V, E) is a dual 2-SuperHyperDefensive 2823
SuperHyperHamiltonian-Type-Cycle-Cut; 2824

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

SuperHyperHamiltonian-Type-Cycle-Cut; 2826

Henry Garrett · 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 V-SuperHyperDefensive 2827

SuperHyperHamiltonian-Type-Cycle-Cut. 2828

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

SuperHyperGraph. Then following statements hold; 2830

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

SuperHyperHamiltonian-Type-Cycle-Cut; 2832

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

SuperHyperHamiltonian-Type-Cycle-Cut; 2834

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

SuperHyperHamiltonian-Type-Cycle-Cut; 2836

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

SuperHyperHamiltonian-Type-Cycle-Cut. 2838

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

SuperHyperGraph which is a SuperHyperComplete. Then following statements hold; 2840

(i) ∀a ∈ S, |Ns (a) ∩ S| < b O−1 2 c + 1 if ESHG : (V, E) is an 2-SuperHyperDefensive 2841

SuperHyperHamiltonian-Type-Cycle-Cut; 2842

(ii) ∀a ∈ V \ S, |Ns (a) ∩ S| >b O−1

2 c + 1 if ESHG : (V, E) is a dual 2-SuperHyperDefensive 2843
SuperHyperHamiltonian-Type-Cycle-Cut; 2844

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

SuperHyperHamiltonian-Type-Cycle-Cut; 2846

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

SuperHyperHamiltonian-Type-Cycle-Cut. 2848

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

SuperHyperGraph which is a SuperHyperComplete. Then following statements hold; 2850

(i) if ∀a ∈ S, |Ns (a) ∩ S| < b O−1 2 c + 1, then ESHG : (V, E) is an 2-SuperHyperDefensive 2851
SuperHyperHamiltonian-Type-Cycle-Cut; 2852

(ii) if ∀a ∈ V \ S, |Ns (a) ∩ S| > b O−1 2 c + 1, then ESHG : (V, E) is a dual 2- 2853
SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 2854

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

SuperHyperHamiltonian-Type-Cycle-Cut; 2856

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

SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut. 2858

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

SuperHyperGraph which is SuperHyperHamiltonian-Type-Cycle-Cut. Then following statements hold; 2860

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

SuperHyperHamiltonian-Type-Cycle-Cut; 2862

Henry Garrett · 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) ∀a ∈ V \ S, |Ns (a) ∩ S| > 2 if ESHG : (V, E) is a dual 2-SuperHyperDefensive 2863

SuperHyperHamiltonian-Type-Cycle-Cut; 2864

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

SuperHyperHamiltonian-Type-Cycle-Cut; 2866

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

SuperHyperHamiltonian-Type-Cycle-Cut. 2868

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

SuperHyperGraph which is SuperHyperHamiltonian-Type-Cycle-Cut. Then following statements hold; 2870

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

SuperHyperHamiltonian-Type-Cycle-Cut; 2872

(ii) if ∀a ∈ V \ S, |Ns (a) ∩ S| > 2, then ESHG : (V, E) is a dual 2-SuperHyperDefensive 2873
SuperHyperHamiltonian-Type-Cycle-Cut; 2874

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

SuperHyperHamiltonian-Type-Cycle-Cut; 2876

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

SuperHyperHamiltonian-Type-Cycle-Cut. 2878

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 CHAPTER 13 2879

Extreme Applications in Cancer’s 2880

Extreme Recognition 2881

The cancer is the Extreme disease but the Extreme model is going to figure out what’s going on 2882
this Extreme phenomenon. The special Extreme case of this Extreme disease is considered and 2883
as the consequences of the model, some parameters are used. The cells are under attack of this 2884

disease but the moves of the cancer in the special region are the matter of mind. The Extreme 2885
recognition of the cancer could help to find some Extreme treatments for this Extreme disease. 2886
In the following, some Extreme steps are Extreme devised on this disease. 2887

Step 1. (Extreme Definition) The Extreme recognition of the cancer in the long-term Extreme 2888
function. 2889

Step 2. (Extreme Issue) The specific region has been assigned by the Extreme model [it’s called 2890
Extreme SuperHyperGraph] and the long Extreme cycle of the move from the cancer is 2891

identified by this research. Sometimes the move of the cancer hasn’t be easily identified 2892
since there are some determinacy, indeterminacy and neutrality about the moves and the 2893
effects of the cancer on that region; this event leads us to choose another model [it’s said 2894
to be Extreme SuperHyperGraph] to have convenient perception on what’s happened and 2895
what’s done. 2896

Step 3. (Extreme Model) There are some specific Extreme models, which are well-known 2897
and they’ve got the names, and some general Extreme models. The moves and the 2898
Extreme traces of the cancer on the complex tracks and between complicated groups of 2899
cells could be fantasized by an Extreme SuperHyperPath(-/SuperHyperHamiltonian-Type-Cycle- 2900
Cut, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). 2901
The aim is to find either the Extreme SuperHyperHamiltonian-Type-Cycle-Cut or the Extreme 2902

SuperHyperHamiltonian-Type-Cycle-Cut in those Extreme Extreme SuperHyperModels. 2903

135
 CHAPTER 14 2904

Case 1: The Initial Extreme Steps 2905

Toward Extreme SuperHyperBipartite 2906

as Extreme SuperHyperModel 2907

Step 4. (Extreme Solution) In the Extreme Figure (34.1), the Extreme SuperHyperBipartite 2908
is Extreme highlighted and Extreme featured. 2909

By using the Extreme Figure (34.1) and the Table (34.1), the Extreme SuperHyperBipartite 2910
is obtained. 2911
The obtained Extreme SuperHyperSet, by the Extreme Algorithm in previous Extreme result, 2912

Figure 14.1: an Extreme SuperHyperBipartite Associated to the Notions of Extreme

SuperHyperHamiltonian-Type-Cycle-Cut 136NSHGaa21aa

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

Table 14.1: The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges
Belong to The Extreme SuperHyperBipartite

The Values of The Vertices The Number of Position in Alphabet

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

of the Extreme SuperHyperVertices of the connected Extreme SuperHyperBipartite ESHB : 2913

(V, E), in the Extreme SuperHyperModel (34.1), is the Extreme SuperHyperHamiltonian-Type- 2914
Cycle-Cut. 2915

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 CHAPTER 15 2916

Case 2: The Increasing Extreme Steps 2917

Toward Extreme 2918

SuperHyperMultipartite as Extreme 2919

SuperHyperModel 2920

Step 4. (Extreme Solution) In the Extreme Figure (35.1), the Extreme SuperHyperMultipartite 2921
is Extreme highlighted and Extreme featured. 2922

By using the Extreme Figure (35.1) and the Table (35.1), the Extreme SuperHyperMulti- 2923
partite is obtained. 2924
The obtained Extreme SuperHyperSet, by the Extreme Algorithm in previous result, of the 2925

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

SuperHyperHamiltonian-Type-Cycle-Cut 136NSHGaa22aa

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

Table 15.1: The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges
Belong to The Extreme SuperHyperMultipartite

The Values of The Vertices The Number of Position in Alphabet

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

Extreme SuperHyperVertices of the connected Extreme SuperHyperMultipartite ESHM : 2926

(V, E), in the Extreme SuperHyperModel (35.1), is the Extreme SuperHyperHamiltonian-Type- 2927
Cycle-Cut. 2928

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 CHAPTER 16 2929

Wondering Open Problems But As The 2930

Directions To Forming The Motivations 2931

In what follows, some “problems” and some “questions” are proposed. 2932
The SuperHyperHamiltonian-Type-Cycle-Cut and the Extreme SuperHyperHamiltonian-Type-Cycle-Cut are 2933
defined on a real-world application, titled “Cancer’s Recognitions”. 2934

Question 16.0.1. Which the else SuperHyperModels could be defined based on Cancer’s 2935
recognitions? 2936

Question 16.0.2. Are there some SuperHyperNotions related to SuperHyperHamiltonian-Type-Cycle-Cut 2937

and the Extreme SuperHyperHamiltonian-Type-Cycle-Cut? 2938

Question 16.0.3. Are there some Algorithms to be defined on the SuperHyperModels to compute 2939
them? 2940

Question 16.0.4. Which the SuperHyperNotions are related to beyond the SuperHyperHamiltonian- 2941
and the Extreme SuperHyperHamiltonian-Type-Cycle-Cut?
Type-Cycle-Cut 2942

Problem 16.0.5. The SuperHyperHamiltonian-Type-Cycle-Cut and the Extreme SuperHyperHamiltonian- 2943

do a SuperHyperModel for the Cancer’s recognitions and they’re based on
Type-Cycle-Cut 2944
SuperHyperHamiltonian-Type-Cycle-Cut, are there else? 2945

Problem 16.0.6. Which the fundamental SuperHyperNumbers are related to these SuperHyper- 2946
Numbers types-results? 2947

Problem 16.0.7. What’s the independent research based on Cancer’s recognitions concerning 2948
the multiple types of SuperHyperNotions? 2949

141
 CHAPTER 17 2950

Conclusion and Closing Remarks 2951

In this section, concluding remarks and closing remarks are represented. The drawbacks of this 2952

research are illustrated. Some benefits and some advantages of this research are highlighted. 2953
This research uses some approaches to make Extreme SuperHyperGraphs more understandable. 2954
In this endeavor, two SuperHyperNotions are defined on the SuperHyperHamiltonian-Type-Cycle-Cut. 2955
For that sake in the second definition, the main definition of the Extreme SuperHyperGraph 2956
is redefined on the position of the alphabets. Based on the new definition for the Extreme 2957
SuperHyperGraph, the new SuperHyperNotion, Extreme SuperHyperHamiltonian-Type-Cycle-Cut, finds 2958

the convenient background to implement some results based on that. Some SuperHyperClasses 2959
and some Extreme SuperHyperClasses are the cases of this research on the modeling of the 2960
regions where are under the attacks of the cancer to recognize this disease as it’s mentioned 2961
on the title “Cancer’s Recognitions”. To formalize the instances on the SuperHyperNotion, 2962
SuperHyperHamiltonian-Type-Cycle-Cut, the new SuperHyperClasses and SuperHyperClasses, are 2963
introduced. Some general results are gathered in the section on the SuperHyperHamiltonian-Type- 2964

Cycle-Cut and the Extreme SuperHyperHamiltonian-Type-Cycle-Cut. The clarifications, instances and 2965
literature reviews have taken the whole way through. In this research, the literature reviews 2966
have fulfilled the lines containing the notions and the results. The SuperHyperGraph and 2967
Extreme SuperHyperGraph are the SuperHyperModels on the “Cancer’s Recognitions” and both 2968
bases are the background of this research. Sometimes the cancer has been happened on the 2969
region, full of cells, groups of cells and embedded styles. In this segment, the SuperHyperModel 2970

proposes some SuperHyperNotions based on the connectivities of the moves of the cancer in the 2971
longest and strongest styles with the formation of the design and the architecture are formally 2972
called “ SuperHyperHamiltonian-Type-Cycle-Cut” in the themes of jargons and buzzwords. The prefix 2973
“SuperHyper” refers to the theme of the embedded styles to figure out the background for the 2974
SuperHyperNotions. In the Table (37.1), benefits and avenues for this research are, figured out, 2975
pointed out and spoken out. 2976

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

Table 17.1: An Overlook On This Research And Beyond 136TBLTBL

Advantages Limitations
1. Redefining Extreme SuperHyperGraph 1. General Results

2. SuperHyperHamiltonian-Type-Cycle-Cut

3. Extreme SuperHyperHamiltonian-Type-Cycle-Cut 2. Other SuperHyperNumbers

4. Modeling of Cancer’s Recognitions

5. SuperHyperClasses 3. SuperHyperFamilies

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 CHAPTER 18 2977

Extreme SuperHyperDuality But As The 2978

Extensions Excerpt From Dense And 2979

Super Forms 2980

Definition 18.0.1. (Different Extreme Types of Extreme SuperHyperDuality). 2981

Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider an Extreme 2982
SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and E 0 = {E1 , E2 , . . . , Ez }. Then either V 0 or E 0 is called 2983

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

Va ∈ Ei , Ej ; 2985

(ii) Extreme re-SuperHyperDuality if ∀Ei ∈ E 0 , ∃Ej ∈ EESHG:(V,E) \ E 0 such that 2986

Va ∈ Ei , Ej and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 2987

(iii) Extreme v-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 2988

Vi , Vj ∈ Ea ; 2989

(iv) Extreme rv-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 2990

Vi , Vj ∈ Ea and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; 2991

(v) Extreme SuperHyperDuality if it’s either of Extreme e-SuperHyperDuality, 2992

Extreme re-SuperHyperDuality, Extreme v-SuperHyperDuality, and Extreme rv- 2993

SuperHyperDuality. 2994

Definition 18.0.2. ((Extreme) SuperHyperDuality). 2995

Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider an Extreme 2996
SuperHyperEdge (NSHE) E = {V1 , V2 , . . . , Vs }. Then E is called 2997

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

Extreme re-SuperHyperDuality, Extreme v-SuperHyperDuality, and Extreme rv- 2999
SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3000
is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Extreme 3001
cardinality of the Extreme SuperHyperEdges in the conseNeighborive Extreme sequence 3002
of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 3003

Extreme SuperHyperDuality; 3004

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

(ii) a Extreme SuperHyperDuality if it’s either of Extreme e-SuperHyperDuality, Extreme 3005

re-SuperHyperDuality, Extreme v-SuperHyperDuality, and Extreme rv-SuperHyperDuality 3006
and C(N SHG) for a Extreme SuperHyperGraph N SHG : (V, E) is the maximum 3007
Extreme cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S 3008
of high Extreme cardinality conseNeighborive Extreme SuperHyperEdges and Extreme 3009
SuperHyperVertices such that they form the Extreme SuperHyperDuality; 3010

(iii) an Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of Extreme 3011

e-SuperHyperDuality, Extreme re-SuperHyperDuality, Extreme v-SuperHyperDuality, 3012

and Extreme rv-SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph 3013
N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients 3014
defined as the Extreme number of the maximum Extreme cardinality of the Extreme 3015
SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme cardinality conseNeigh- 3016
borive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form 3017
the Extreme SuperHyperDuality; and the Extreme power is corresponded to its Extreme 3018

coefficient; 3019

(iv) a Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of Extreme 3020

e-SuperHyperDuality, Extreme re-SuperHyperDuality, Extreme v-SuperHyperDuality, 3021

and Extreme rv-SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph 3022
N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients 3023
defined as the Extreme number of the maximum Extreme cardinality of the Extreme 3024
SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme cardinality conseNeigh- 3025
borive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form 3026
the Extreme SuperHyperDuality; and the Extreme power is corresponded to its Extreme 3027

coefficient; 3028

(v) an Extreme R-SuperHyperDuality if it’s either of Extreme e-SuperHyperDuality, 3029

Extreme re-SuperHyperDuality, Extreme v-SuperHyperDuality, and Extreme rv- 3030

SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3031
is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Extreme 3032
cardinality of the Extreme SuperHyperVertices in the conseNeighborive Extreme sequence 3033
of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 3034
Extreme SuperHyperDuality; 3035

(vi) a Extreme R-SuperHyperDuality if it’s either of Extreme e-SuperHyperDuality, 3036

Extreme re-SuperHyperDuality, Extreme v-SuperHyperDuality, and Extreme rv- 3037
SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is 3038

the maximum Extreme cardinality of the Extreme SuperHyperVertices of an Extreme Su- 3039
perHyperSet S of high Extreme cardinality conseNeighborive Extreme SuperHyperEdges 3040
and Extreme SuperHyperVertices such that they form the Extreme SuperHyperDuality; 3041

(vii) an Extreme R-SuperHyperDuality SuperHyperPolynomial if it’s either 3042

of Extreme e-SuperHyperDuality, Extreme re-SuperHyperDuality, Extreme v- 3043
SuperHyperDuality, and Extreme rv-SuperHyperDuality and C(N SHG) for an Extreme 3044
SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the 3045
Extreme coefficients defined as the Extreme number of the maximum Extreme cardinality 3046

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

Henry Garrett · 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 conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVer- 3048

tices such that they form the Extreme SuperHyperDuality; and the Extreme power is 3049
corresponded to its Extreme coefficient; 3050

(viii) a Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of Extreme 3051

e-SuperHyperDuality, Extreme re-SuperHyperDuality, Extreme v-SuperHyperDuality, 3052

and Extreme rv-SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph 3053
N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients 3054
defined as the Extreme number of the maximum Extreme cardinality of the Extreme 3055
SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality 3056
conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVertices such 3057

that they form the Extreme SuperHyperDuality; and the Extreme power is corresponded 3058
to its Extreme coefficient. 3059

136EXM1 Example 18.0.3. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E) in the 3060
mentioned Extreme Figures in every Extreme items. 3061

• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperDu- 3062
ality, is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are some 3063
empty Extreme SuperHyperEdges but E2 is a loop Extreme SuperHyperEdge and E4 is 3064
an Extreme SuperHyperEdge. Thus in the terms of Extreme SuperHyperNeighbor, there’s 3065
only one Extreme SuperHyperEdge, namely, E4 . The Extreme SuperHyperVertex, V3 is 3066

Extreme isolated means that there’s no Extreme SuperHyperEdge has it as an Extreme 3067
endpoint. Thus the Extreme SuperHyperVertex, V3 , is excluded in every given Extreme 3068
SuperHyperDuality. 3069

C(N SHG)Extreme SuperHyperDuality = {E4 }.

C(N SHG)Extreme SuperHyperDuality SuperHyperPolynomial = z.
C(N SHG)Extreme R-SuperHyperDuality = {V4 }.
C(N SHG)Extreme R-SuperHyperDuality SuperHyperPolynomial = 3z.

• On the Figure (30.2), the Extreme SuperHyperNotion, namely, Extreme SuperHyper- 3070
Duality, is up. The Extreme Algorithm is Extremely straightforward. E1 , E2 and E3 3071
are some empty Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. 3072

Thus in the terms of Extreme SuperHyperNeighbor, there’s only one Extreme SuperHy- 3073
perEdge, namely, E4 . The Extreme SuperHyperVertex, V3 is Extreme isolated means that 3074
there’s no Extreme SuperHyperEdge has it as an Extreme endpoint. Thus the Extreme 3075
SuperHyperVertex, V3 , is excluded in every given Extreme SuperHyperDuality. 3076

C(N SHG)Extreme SuperHyperDuality = {E4 }.

C(N SHG)Extreme SuperHyperDuality SuperHyperPolynomial = z.
C(N SHG)Extreme R-SuperHyperDuality = {V4 }.
C(N SHG)Extreme R-SuperHyperDuality SuperHyperPolynomial = 3z.

Henry Garrett · 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 (30.3), the Extreme SuperHyperNotion, namely, Extreme SuperHyperDu- 3077
ality, is up. The Extreme Algorithm is Extremely straightforward. 3078

C(N SHG)Extreme SuperHyperDuality = {E4 }.

C(N SHG)Extreme SuperHyperDuality SuperHyperPolynomial = z.
C(N SHG)Extreme R-SuperHyperDuality = {V4 }.
C(N SHG)Extreme R-SuperHyperDuality SuperHyperPolynomial = 3z.

• On the Figure (30.4), the Extreme SuperHyperNotion, namely, Extreme SuperHyperDu- 3079
ality, is up. The Extreme Algorithm is Extremely straightforward. 3080

C(N SHG)Extreme SuperHyperDuality = {E4 , E2 }.

C(N SHG)Extreme SuperHyperDuality SuperHyperPolynomial = 2z 2 .
C(N SHG)Extreme R-SuperHyperDuality = {V1 , V4 }.
C(N SHG)Extreme R-SuperHyperDuality SuperHyperPolynomial = 15z 2 .

• On the Figure (30.5), the Extreme SuperHyperNotion, namely, Extreme SuperHyperDu- 3081
ality, is up. The Extreme Algorithm is Extremely straightforward. 3082

C(N SHG)Extreme SuperHyperDuality = {E3 }.

C(N SHG)Extreme SuperHyperDuality SuperHyperPolynomial = 4z.
C(N SHG)Extreme R-SuperHyperDuality = {V5 }.
C(N SHG)Extreme R-SuperHyperDuality SuperHyperPolynomial = z.

• On the Figure (30.6), the Extreme SuperHyperNotion, namely, Extreme SuperHyperDu- 3083
ality, is up. The Extreme Algorithm is Extremely straightforward. 3084

C(N SHG)Extreme SuperHyperDuality = {E3i+13i=0 , E3i+243i=0 }.

C(N SHG)Extreme SuperHyperDuality SuperHyperPolynomial 6z 8 .
C(N SHG)Extreme R-SuperHyperDuality = {V3i+17i=0 }.
C(N SHG)Extreme R-SuperHyperDuality SuperHyperPolynomial = 6z 8 .

• On the Figure (30.7), the Extreme SuperHyperNotion, namely, Extreme SuperHyperDu- 3085

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

C(N SHG)Extreme SuperHyperDuality = {E15 , E16 , E17 }.

C(N SHG)Extreme SuperHyperDuality SuperHyperPolynomial = z 3 .
C(N SHG)Extreme R-SuperHyperDuality = {V3 , V13 , V8 }.
C(N SHG)Extreme R-SuperHyperDuality SuperHyperPolynomial =
4 × 5 × 5z 3 .

• On the Figure (30.8), the Extreme SuperHyperNotion, namely, Extreme SuperHyperDu- 3087

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

C(N SHG)Extreme SuperHyperDuality = {E4 }.

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

C(N SHG)Extreme SuperHyperDuality SuperHyperPolynomial = z.

C(N SHG)Extreme R-SuperHyperDuality = {V3 , V13 , V8 }.
C(N SHG)Extreme R-SuperHyperDuality SuperHyperPolynomial =
4 × 5 × 5z 3 .

• On the Figure (30.9), the Extreme SuperHyperNotion, namely, Extreme SuperHyperDu- 3089
ality, is up. The Extreme Algorithm is Extremely straightforward. 3090

C(N SHG)Extreme SuperHyperDuality = {E3i+13i=0 , E23 }.

C(N SHG)Extreme SuperHyperDuality SuperHyperPolynomial = 3z 5 .
C(N SHG)Extreme R-SuperHyperDuality = {V3i+13i=0 , V15 }.
C(N SHG)Extreme R-SuperHyperDuality SuperHyperPolynomial = 3z 5 .

• On the Figure (30.10), the Extreme SuperHyperNotion, namely, Extreme SuperHyperDu- 3091
ality, is up. The Extreme Algorithm is Extremely straightforward. 3092

C(N SHG)Extreme SuperHyperDuality = {E5 }.

C(N SHG)Extreme SuperHyperDuality SuperHyperPolynomial = z.
C(N SHG)Extreme R-SuperHyperDuality = {V3 , V13 , V8 }.
C(N SHG)Extreme R-SuperHyperDuality SuperHyperPolynomial =
4 × 5 × 5z 3 .

• On the Figure (30.11), the Extreme SuperHyperNotion, namely, Extreme SuperHyperDu- 3093
ality, is up. The Extreme Algorithm is Extremely straightforward. 3094

C(N SHG)Extreme SuperHyperDuality = {E1 , E3 }.

C(N SHG)Extreme SuperHyperDuality SuperHyperPolynomial = z 2 .
C(N SHG)Extreme R-SuperHyperDuality = {V6 , V1 }.
C(N SHG)Extreme R-SuperHyperDuality SuperHyperPolynomial =
3 × 3z 2 .

• On the Figure (30.12), the Extreme SuperHyperNotion, namely, Extreme SuperHyperDu- 3095
ality, is up. The Extreme Algorithm is Extremely straightforward. 3096

C(N SHG)Extreme SuperHyperDuality = {E1 }.

C(N SHG)Extreme SuperHyperDuality SuperHyperPolynomial = z.
C(N SHG)Extreme R-SuperHyperDuality = {V1 , Vii610=5,7,8 }.
i=4

C(N SHG)Extreme 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 (30.13), the Extreme SuperHyperNotion, namely, Extreme SuperHyperDu- 3097
ality, is up. The Extreme Algorithm is Extremely straightforward. 3098

C(N SHG)Extreme SuperHyperDuality = {E5 , E9 }.

C(N SHG)Extreme SuperHyperDuality SuperHyperPolynomial = z 2 .
C(N SHG)Extreme R-SuperHyperDuality = {V1 , V6 }.
C(N SHG)Extreme R-SuperHyperDuality SuperHyperPolynomial =
3 × 3z 2 .

• On the Figure (30.14), the Extreme SuperHyperNotion, namely, Extreme SuperHyperDu- 3099
ality, is up. The Extreme Algorithm is Extremely straightforward. 3100

C(N SHG)Extreme SuperHyperDuality = {E1 }.

C(N SHG)Extreme SuperHyperDuality SuperHyperPolynomial = 2z.
C(N SHG)Extreme R-SuperHyperDuality = {V1 }.
C(N SHG)Extreme R-SuperHyperDuality SuperHyperPolynomial = z.

• On the Figure (30.15), the Extreme SuperHyperNotion, namely, Extreme SuperHyperDu- 3101
ality, is up. The Extreme Algorithm is Extremely straightforward. 3102

C(N SHG)Extreme SuperHyperDuality = {E2 , E5 }.

C(N SHG)Extreme SuperHyperDuality SuperHyperPolynomial = 3z 2 .
C(N SHG)Extreme R-SuperHyperDuality = {V1 , V4 }.
C(N SHG)Extreme R-SuperHyperDuality SuperHyperPolynomial = z.

• On the Figure (30.16), the Extreme SuperHyperNotion, namely, Extreme SuperHyperDu- 3103
ality, is up. The Extreme Algorithm is Extremely straightforward. 3104

C(N SHG)Extreme SuperHyperDuality = {E2 , E5 }.

C(N SHG)Extreme SuperHyperDuality SuperHyperPolynomial = 3z 2 .
C(N SHG)Extreme R-SuperHyperDuality = {V1 , V4 }.
C(N SHG)Extreme R-SuperHyperDuality SuperHyperPolynomial =
(2 × 1 × 2) + (2 × 4 × 5)z.

• On the Figure (30.17), the Extreme SuperHyperNotion, namely, Extreme SuperHyperDu- 3105
ality, is up. The Extreme Algorithm is Extremely straightforward. 3106

C(N SHG)Extreme SuperHyperDuality = {E2 , E5 }.

C(N SHG)Extreme SuperHyperDuality SuperHyperPolynomial = 3z 2 .
C(N SHG)Extreme R-SuperHyperDuality = {V1 , V4 }.
C(N SHG)Extreme 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 (30.18), the Extreme SuperHyperNotion, namely, Extreme SuperHyperDu- 3107
ality, is up. The Extreme Algorithm is Extremely straightforward. 3108

C(N SHG)Extreme SuperHyperDuality = {E2 , E5 }.

C(N SHG)Extreme SuperHyperDuality SuperHyperPolynomial = 3z 2 .
C(N SHG)Extreme R-SuperHyperDuality = {V1 , V4 }.
C(N SHG)Extreme R-SuperHyperDuality SuperHyperPolynomial =
(2 × 2 × 2)z.

• On the Figure (30.19), the Extreme SuperHyperNotion, namely, Extreme SuperHyperDu- 3109
ality, is up. The Extreme Algorithm is Extremely straightforward. 3110

C(N SHG)Extreme SuperHyperDuality = {E3i+1i=03 }.

C(N SHG)Extreme SuperHyperDuality SuperHyperPolynomial = 3z 4 .
C(N SHG)Extreme R-SuperHyperDuality = {V2i+1i=05 }.
C(N SHG)Extreme R-SuperHyperDuality SuperHyperPolynomial = 2z 6 .

• On the Figure (30.20), the Extreme SuperHyperNotion, namely, Extreme SuperHyperDu- 3111
ality, is up. The Extreme Algorithm is Extremely straightforward. 3112

C(N SHG)Extreme SuperHyperDuality = {E6 }.

C(N SHG)Extreme SuperHyperDuality SuperHyperPolynomial = 10z.
C(N SHG)Extreme R-SuperHyperDuality = {V1 }.
C(N SHG)Extreme R-SuperHyperDuality SuperHyperPolynomial = z.

• On the Figure (30.21), the Extreme SuperHyperNotion, namely, Extreme SuperHyperDu- 3113

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

C(N SHG)Extreme SuperHyperDuality = {E2 }.

C(N SHG)Extreme SuperHyperDuality SuperHyperPolynomial = 2z.
C(N SHG)Extreme R-SuperHyperDuality = {V1 }.
C(N SHG)Extreme R-SuperHyperDuality SuperHyperPolynomial = 10z.

• On the Figure (30.22), the Extreme SuperHyperNotion, namely, Extreme SuperHyperDu- 3115
ality, is up. The Extreme Algorithm is Extremely straightforward. 3116

C(N SHG)Extreme SuperHyperDuality = {E3 , E4 }.

C(N SHG)Extreme SuperHyperDuality SuperHyperPolynomial = 4z 2 .
C(N SHG)Extreme R-SuperHyperDuality = {V3 , V6 }.
C(N SHG)Extreme R-SuperHyperDuality SuperHyperPolynomial
= 10 × 9 + 10 × 6 + 12 × 9 + 12 × 6z 2 .

The previous Extreme approach apply on the upcoming Extreme results on Extreme 3117

SuperHyperClasses. 3118

Henry Garrett · 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 18.0.4. Assume a connected Extreme SuperHyperPath ESHP : (V, E). Then 3119

C(N SHG)Extreme SuperHyperDuality =

|EESHG:(V,E) |Extreme Cardinality

= {Ei }i=1 3
.
C(N SHG)Extreme SuperHyperDuality SuperHyperPolynomial
|EESHG:(V,E) |Extreme Cardinality
= 3z 3 .
C(N SHG)Extreme R-SuperHyperDuality
|EESHG:(V,E) |Extreme Cardinality

= {ViEXT ERN AL }i=1 3

.
C(N SHG)Extreme R-SuperHyperDuality SuperHyperPolynomial
Y |EESHG:(V,E) |Extreme Cardinality
= |V EXT ERN AL ESHG:(V,E) |Extreme Cardinality z 3 .

Proof. Let 3120

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
E |EESHG:(V,E) |Extreme Cardinality , V EXT ERN AL |EESHG:(V,E) |Extreme Cardinality .
3 3

be a longest path taken from a connected Extreme SuperHyperPath ESHP : (V, E). There’s a 3121
new way to redefine as 3122

ViEXT ERN AL ∼ VjEXT ERN AL ≡

∃!Ez ∈ EESHG:(V,E) , ViEXT ERN AL , VjEXT ERN AL ∈ Ez ≡
∃!Ez ∈ EESHG:(V,E) , {ViEXT ERN AL , VjEXT ERN AL } ⊆ Ez .

The term “EXTERNAL” implies |N (ViEXT ERN AL )| ≥ |N (Vj )| where Vj is corresponded to 3123
ViEXT ERN AL in the literatures of SuperHyperDuality. The latter is straightforward.  3124

136EXM18a Example 18.0.5. In the Figure (31.1), the connected Extreme SuperHyperPath ESHP : (V, E), 3125
is highlighted and featured. The Extreme SuperHyperSet, in the Extreme SuperHyperModel 3126
(31.1), is the SuperHyperDuality. 3127

Proposition 18.0.6. Assume a connected Extreme SuperHyperCycle ESHC : (V, E). Then 3128

C(N SHG)Extreme SuperHyperDuality =

|EESHG:(V,E) |Extreme Cardinality

= {Ei }i=1 3
.
C(N SHG)Extreme SuperHyperDuality SuperHyperPolynomial
|EESHG:(V,E) |Extreme Cardinality
= 3z 3 .
C(N SHG)Extreme R-SuperHyperDuality

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 Henry Garrett · Independent Researcher · Department of Mathematics ·
DrHenryGarrett@gmail.com · Manhattan, NY, USA
|EESHG:(V,E) |Extreme Cardinality

= {ViEXT ERN AL }i=1 3

.
C(N SHG)Extreme R-SuperHyperDuality SuperHyperPolynomial
Y |EESHG:(V,E) |Extreme Cardinality
= |V EXT ERN AL ESHG:(V,E) |Extreme Cardinality z 3 .
Proof. Let 3129

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
E |EESHG:(V,E) |Extreme Cardinality , V EXT ERN AL |EESHG:(V,E) |Extreme Cardinality .
3 3

be a longest path taken from a connected Extreme SuperHyperCycle ESHC : (V, E). There’s a 3130

new way to redefine as 3131

ViEXT ERN AL ∼ VjEXT ERN AL ≡

∃!Ez ∈ EESHG:(V,E) , ViEXT ERN AL , VjEXT ERN AL ∈ Ez ≡
∃!Ez ∈ EESHG:(V,E) , {ViEXT ERN AL , VjEXT ERN AL } ⊆ Ez .
The term “EXTERNAL” implies |N (ViEXT ERN AL )| ≥ |N (Vj )| where Vj is corresponded to 3132
ViEXT ERN AL in the literatures of SuperHyperDuality. The latter is straightforward.  3133

136EXM19a Example 18.0.7. In the Figure (31.2), the connected Extreme SuperHyperCycle N SHC : 3134
(V, E), is highlighted and featured. The obtained Extreme SuperHyperSet, in the Extreme 3135
SuperHyperModel (31.2), is the Extreme SuperHyperDuality. 3136

Proposition 18.0.8. Assume a connected Extreme SuperHyperStar ESHS : (V, E). Then 3137

C(N SHG)Extreme Quasi-SuperHyperDuality = {E ∈ EESHG:(V,E) }.

C(N SHG)Extreme Quasi-SuperHyperDuality SuperHyperPolynomial
= |i | Ei ∈ EESHG:(V,E)|Extreme Cardinality |z.
C(N SHG)Extreme R-Quasi-SuperHyperDuality = {CEN T ER ∈ VESHG:(V,E) }.
C(N SHG)Extreme R-Quasi-SuperHyperDuality SuperHyperPolynomial = z.
Proof. Let 3138

P : ViEXT ERN AL , Ei , CEN T ER, VjEXT ERN AL .

be a longest path taken a connected Extreme SuperHyperStar ESHS : (V, E). There’s a new 3139
way to redefine as 3140

ViEXT ERN AL ∼ VjEXT ERN AL ≡

∃!Ez ∈ EESHG:(V,E) , ViEXT ERN AL , VjEXT ERN AL ∈ Ez ≡
∃!Ez ∈ EESHG:(V,E) , {ViEXT ERN AL , VjEXT ERN AL } ⊆ Ez .
The term “EXTERNAL” implies |N (ViEXT ERN AL )| ≥ |N (Vj )| where Vj is corresponded to 3141

ViEXT ERN AL in the literatures of SuperHyperDuality. The latter is straightforward.  3142

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

136EXM20a Example 18.0.9. In the Figure (31.3), the connected Extreme SuperHyperStar ESHS : (V, E), 3143
is highlighted and featured. The obtained Extreme SuperHyperSet, by the Algorithm in previous 3144
Extreme result, of the Extreme SuperHyperVertices of the connected Extreme SuperHyperStar 3145
ESHS : (V, E), in the Extreme SuperHyperModel (31.3), is the Extreme SuperHyperDuality. 3146

Proposition 18.0.10. Assume a connected Extreme SuperHyperBipartite ESHB : (V, E). Then 3147

C(N SHG)Extreme Quasi-SuperHyperDuality

= {Ei ∈ EPi ESHG:(V,E) , |Pi ESHG:(V,E) | = min |Pi ESHG:(V,E) ∈ P ESHG:(V,E) |}.
i
C(N SHG)Extreme 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)Extreme 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)Extreme Quasi-SuperHyperDuality SuperHyperPolynomial

X X
= =( (|Pi ESHG:(V,E) |choose 2) = z 2 .
EXT ERN AL |
|VESHG:(V,E) i=|P ESHG:(V,E) |
Extreme Cardinality

Proof. Let 3148

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 Extreme SuperHyperBipartite ESHB : (V, E). There’s 3149
a new way to redefine as 3150

ViEXT ERN AL ∼ VjEXT ERN AL ≡

∃!Ez ∈ EESHG:(V,E) , ViEXT ERN AL , VjEXT ERN AL ∈ Ez ≡
∃!Ez ∈ EESHG:(V,E) , {ViEXT ERN AL , VjEXT ERN AL } ⊆ Ez .

The term “EXTERNAL” implies |N (ViEXT ERN AL )| ≥ |N (Vj )| where Vj is corresponded 3151
to ViEXT ERN AL in the literatures of SuperHyperDuality. The latter is straightforward. 3152
Then there’s at least one SuperHyperDuality. Thus the notion of quasi isn’t up and the 3153

SuperHyperNotions based on SuperHyperDuality could be applied. There are only two 3154
SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as the 3155
representative in the 3156

P :
V1EXT ERN AL , E1 ,

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

V2EXT ERN AL , E2 ,
...,
EXT ERN AL
Emini |Pi ESHG:(V,E) ∈P ESHG:(V,E) | , Vmini |Pi
ESHG:(V,E) ∈P ESHG:(V,E) |+1

is a longest SuperHyperDuality taken from a connected Extreme SuperHyperBipartite ESHB : 3157

(V, E). Thus only some SuperHyperVertices and only minimum-Extreme-of-SuperHyperPart 3158

SuperHyperEdges are attained in any solution 3159

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
Emini |Pi ESHG:(V,E) ∈P ESHG:(V,E) | , Vmini |Pi
ESHG:(V,E) ∈P ESHG:(V,E) |+1

The latter is straightforward.  3160

136EXM21a Example 18.0.11. In the Extreme Figure (31.4), the connected Extreme SuperHyperBipartite 3161

ESHB : (V, E), is Extreme highlighted and Extreme featured. The obtained Extreme 3162
SuperHyperSet, by the Extreme Algorithm in previous Extreme result, of the Extreme 3163
SuperHyperVertices of the connected Extreme SuperHyperBipartite ESHB : (V, E), in the 3164
Extreme SuperHyperModel (31.4), is the Extreme SuperHyperDuality. 3165

Proposition 18.0.12. Assume a connected Extreme SuperHyperMultipartite ESHM : (V, E). 3166
Then 3167

C(N SHG)Extreme Quasi-SuperHyperDuality

= {Ei ∈ EPi ESHG:(V,E) , |Pi ESHG:(V,E) | = min |Pi ESHG:(V,E) ∈ P ESHG:(V,E) |}.
i
C(N SHG)Extreme 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)Extreme 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)Extreme Quasi-SuperHyperDuality SuperHyperPolynomial

X X
= =( (|Pi ESHG:(V,E) |choose 2) = z 2 .
EXT ERN AL |
|VESHG:(V,E) i=|P ESHG:(V,E) |
Extreme Cardinality

Proof. Let 3168

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

Henry Garrett · 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 Extreme SuperHyperMultipartite 3169

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

ViEXT ERN AL ∼ VjEXT ERN AL ≡

∃!Ez ∈ EESHG:(V,E) , ViEXT ERN AL , VjEXT ERN AL ∈ Ez ≡
∃!Ez ∈ EESHG:(V,E) , {ViEXT ERN AL , VjEXT ERN AL } ⊆ Ez .

The term “EXTERNAL” implies |N (ViEXT ERN AL )| ≥ |N (Vj )| where Vj is corresponded 3171
to ViEXT ERN AL in the literatures of SuperHyperDuality. The latter is straightforward. 3172
Then there’s at least one SuperHyperDuality. Thus the notion of quasi isn’t up and 3173
the SuperHyperNotions based on SuperHyperDuality could be applied. There are only z 0 3174

SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as the 3175
representative in the 3176

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 Extreme SuperHyperMultipartite ESHM : 3177

(V, E). Thus only some SuperHyperVertices and only minimum-Extreme-of-SuperHyperPart 3178
SuperHyperEdges are attained in any solution 3179

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 Extreme SuperHyperMultipartite ESHM : (V, E). 3180
The latter is straightforward.  3181

136EXM22a Example 18.0.13. In the Figure (31.5), the connected Extreme SuperHyperMultipartite 3182
ESHM : (V, E), is highlighted and Extreme featured. The obtained Extreme SuperHyperSet, by 3183

the Algorithm in previous Extreme result, of the Extreme SuperHyperVertices of the connected 3184
Extreme SuperHyperMultipartite ESHM : (V, E), in the Extreme SuperHyperModel (31.5), is 3185
the Extreme SuperHyperDuality. 3186

Proposition 18.0.14. Assume a connected Extreme SuperHyperWheel ESHW : (V, E). Then, 3187

C(N SHG)Extreme Quasi-SuperHyperDuality = {E ∗ ∈ EESHG:(V,E)

∗
}.
C(N SHG)Extreme Quasi-SuperHyperDuality SuperHyperPolynomial
= |i | Ei∗ ∈ EESHG:(V,E)|
∗
Extreme Cardinality
|z.
C(N SHG)Extreme R-Quasi-SuperHyperDuality = {CEN T ER ∈ VESHG:(V,E) }.
C(N SHG)Extreme R-Quasi-SuperHyperDuality SuperHyperPolynomial = z.

Henry Garrett · 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 3188

P :
V1EXT ERN AL , E1∗ ,
V2EXT ERN AL , E2∗ ,
...,
∗ EXT ERN AL
E|E ∗ | , V|E ∗ |Extreme Cardinality +1
ESHG:(V,E) Extreme Cardinality ESHG:(V,E)

is a longest SuperHyperDuality taken from a connected Extreme SuperHyperWheel ESHW : 3189

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

ViEXT ERN AL ∼ VjEXT ERN AL ≡

∃!Ez∗ ∈ EESHG:(V,E)
∗
, ViEXT ERN AL , VjEXT ERN AL ∈ Ez∗ ≡
∃!Ez∗ ∈ EESHG:(V,E)
∗
, {ViEXT ERN AL , VjEXT ERN AL } ⊆ Ez∗ .

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

to ViEXT ERN AL in the literatures of SuperHyperDuality. The latter is straightforward. 3192

Then there’s at least one SuperHyperDuality. Thus the notion of quasi isn’t up and the 3193
SuperHyperNotions based on SuperHyperDuality could be applied. The unique embedded 3194
SuperHyperDuality proposes some longest SuperHyperDuality excerpt from some representatives. 3195
The latter is straightforward.  3196

136EXM23a Example 18.0.15. In the Extreme Figure (31.6), the connected Extreme SuperHyperWheel 3197
N SHW : (V, E), is Extreme highlighted and featured. The obtained Extreme SuperHyperSet, 3198
by the Algorithm in previous result, of the Extreme SuperHyperVertices of the connected 3199

Extreme SuperHyperWheel ESHW : (V, E), in the Extreme SuperHyperModel (31.6), is the 3200
Extreme SuperHyperDuality. 3201

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 CHAPTER 19 3202

Extreme SuperHyperJoin But As The 3203

Extensions Excerpt From Dense And 3204

Super Forms 3205

Definition 19.0.1. (Different Extreme Types of Extreme SuperHyperJoin). 3206

Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider an Extreme 3207
SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and E 0 = {E1 , E2 , . . . , Ez }. Then either V 0 or E 0 is called 3208

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

Va ∈ Ei , Ej ; and ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; 3210

(ii) Extreme re-SuperHyperJoin if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such that 3211

Va ∈ Ei , Ej ; ∀Ei , Ej ∈ E 0 , such that Va ∈

6 Ei , Ej ; and |Ei |NEUTROSOPIC CARDINALITY = 3212
|Ej |NEUTROSOPIC CARDINALITY ; 3213

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

Vi , Vj 6∈ Ea ; and ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; 3215

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

Vi , Vj ∈ Ea ; ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; and |Vi |NEUTROSOPIC CARDINALITY = 3217
|Vj |NEUTROSOPIC CARDINALITY ; 3218

(v) Extreme SuperHyperJoin if it’s either of Extreme e-SuperHyperJoin, Extreme re- 3219
SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme rv-SuperHyperJoin. 3220

Definition 19.0.2. ((Extreme) SuperHyperJoin). 3221

Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider an Extreme 3222

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

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

re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme rv-SuperHyperJoin and 3225
C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme 3226
cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme 3227
SuperHyperEdges in the conseNeighborive Extreme sequence of Extreme SuperHyperEdges 3228

and Extreme SuperHyperVertices such that they form the Extreme SuperHyperJoin; 3229

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

(ii) a Extreme SuperHyperJoin if it’s either of Extreme e-SuperHyperJoin, Extreme 3230

re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme rv-SuperHyperJoin and 3231
C(N SHG) for a Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme 3232
cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of 3233
high Extreme cardinality conseNeighborive Extreme SuperHyperEdges and Extreme 3234
SuperHyperVertices such that they form the Extreme SuperHyperJoin; 3235

(iii) an Extreme SuperHyperJoin SuperHyperPolynomial if it’s either of Extreme e- 3236

SuperHyperJoin, Extreme re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme 3237

rv-SuperHyperJoin and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3238
is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined as the 3239
Extreme number of the maximum Extreme cardinality of the Extreme SuperHyperEdges 3240
of an Extreme SuperHyperSet S of high Extreme cardinality conseNeighborive Extreme 3241
SuperHyperEdges and Extreme SuperHyperVertices such that they form the Extreme 3242
SuperHyperJoin; and the Extreme power is corresponded to its Extreme coefficient; 3243

(iv) a Extreme SuperHyperJoin SuperHyperPolynomial if it’s either of Extreme e- 3244

SuperHyperJoin, Extreme re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme 3245
rv-SuperHyperJoin and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3246

is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined as the 3247
Extreme number of the maximum Extreme cardinality of the Extreme SuperHyperEdges 3248
of an Extreme SuperHyperSet S of high Extreme cardinality conseNeighborive Extreme 3249
SuperHyperEdges and Extreme SuperHyperVertices such that they form the Extreme 3250
SuperHyperJoin; and the Extreme power is corresponded to its Extreme coefficient; 3251

(v) an Extreme R-SuperHyperJoin if it’s either of Extreme e-SuperHyperJoin, Extreme 3252

re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme rv-SuperHyperJoin and 3253
C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme 3254

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

Extreme SuperHyperVertices in the conseNeighborive Extreme sequence of Extreme 3256
SuperHyperEdges and Extreme SuperHyperVertices such that they form the Extreme 3257
SuperHyperJoin; 3258

(vi) a Extreme R-SuperHyperJoin if it’s either of Extreme e-SuperHyperJoin, Extreme 3259

re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme rv-SuperHyperJoin and 3260
C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme 3261
cardinality of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of 3262
high Extreme cardinality conseNeighborive Extreme SuperHyperEdges and Extreme 3263

SuperHyperVertices such that they form the Extreme SuperHyperJoin; 3264

(vii) an Extreme R-SuperHyperJoin SuperHyperPolynomial if it’s either of Extreme 3265

e-SuperHyperJoin, Extreme re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme 3266

rv-SuperHyperJoin and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3267
is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined as the 3268
Extreme number of the maximum Extreme cardinality of the Extreme SuperHyperVertices 3269
of an Extreme SuperHyperSet S of high Extreme cardinality conseNeighborive Extreme 3270
SuperHyperEdges and Extreme SuperHyperVertices such that they form the Extreme 3271

SuperHyperJoin; and the Extreme power is corresponded to its Extreme coefficient; 3272

Henry Garrett · 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 Extreme SuperHyperJoin SuperHyperPolynomial if it’s either of Extreme e- 3273

SuperHyperJoin, Extreme re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme 3274
rv-SuperHyperJoin and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3275
is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined as the 3276
Extreme number of the maximum Extreme cardinality of the Extreme SuperHyperVertices 3277
of an Extreme SuperHyperSet S of high Extreme cardinality conseNeighborive Extreme 3278

SuperHyperEdges and Extreme SuperHyperVertices such that they form the Extreme 3279
SuperHyperJoin; and the Extreme power is corresponded to its Extreme coefficient. 3280

136EXM1 Example 19.0.3. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E) in the 3281
mentioned Extreme Figures in every Extreme items. 3282

• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperJoin, 3283
is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are some empty 3284
Extreme SuperHyperEdges but E2 is a loop Extreme SuperHyperEdge and E4 is an 3285
Extreme SuperHyperEdge. Thus in the terms of Extreme SuperHyperNeighbor, there’s 3286

only one Extreme SuperHyperEdge, namely, E4 . The Extreme SuperHyperVertex, V3 is 3287

Extreme isolated means that there’s no Extreme SuperHyperEdge has it as an Extreme 3288
endpoint. Thus the Extreme SuperHyperVertex, V3 , is excluded in every given Extreme 3289
SuperHyperJoin. 3290

C(N SHG)Extreme SuperHyperJoin = {E4 }.

C(N SHG)Extreme SuperHyperJoin SuperHyperPolynomial = z.
C(N SHG)Extreme R-SuperHyperJoin = {V1 , V2 , V4 }.
C(N SHG)Extreme R-SuperHyperJoin SuperHyperPolynomial = z 3 .

• On the Figure (30.2), the Extreme SuperHyperNotion, namely, Extreme SuperHyperJoin, 3291
is up. The Extreme Algorithm is Extremely straightforward. E1 , E2 and E3 are some empty 3292
Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. Thus in the terms of 3293
Extreme SuperHyperNeighbor, there’s only one Extreme SuperHyperEdge, namely, E4 . 3294
The Extreme SuperHyperVertex, V3 is Extreme isolated means that there’s no Extreme 3295
SuperHyperEdge has it as an Extreme endpoint. Thus the Extreme SuperHyperVertex, 3296

V3 , is excluded in every given Extreme SuperHyperJoin. 3297

C(N SHG)Extreme SuperHyperJoin = {E4 }.

C(N SHG)Extreme SuperHyperJoin SuperHyperPolynomial = z.
C(N SHG)Extreme R-SuperHyperJoin = {V1 , V2 , V4 }.
C(N SHG)Extreme R-SuperHyperJoin SuperHyperPolynomial = z 3 .

• On the Figure (30.3), the Extreme SuperHyperNotion, namely, Extreme SuperHyperJoin, 3298
is up. The Extreme Algorithm is Extremely straightforward. 3299

C(N SHG)Extreme SuperHyperJoin = {E4 }.

C(N SHG)Extreme SuperHyperJoin SuperHyperPolynomial = z.
C(N SHG)Extreme R-SuperHyperJoin = {V1 , V2 , V3 }.
C(N SHG)Extreme R-SuperHyperJoin 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 (30.4), the Extreme SuperHyperNotion, namely, Extreme SuperHyperJoin, 3300
is up. The Extreme Algorithm is Extremely straightforward. 3301

C(N SHG)Extreme SuperHyperJoin = {E4 , E2 }.

C(N SHG)Extreme SuperHyperJoin SuperHyperPolynomial = 2z 2 .
C(N SHG)Extreme R-SuperHyperJoin = {V1 , V4 }.
C(N SHG)Extreme R-SuperHyperJoin SuperHyperPolynomial = 15z 2 .

• On the Figure (30.5), the Extreme SuperHyperNotion, namely, Extreme SuperHyperJoin, 3302
is up. The Extreme Algorithm is Extremely straightforward. 3303

C(N SHG)Extreme SuperHyperJoin = {E3 }.

C(N SHG)Extreme SuperHyperJoin SuperHyperPolynomial = 4z.
C(N SHG)Extreme R-SuperHyperJoin = {V5 }.
C(N SHG)Extreme R-SuperHyperJoin SuperHyperPolynomial = z.

• On the Figure (30.6), the Extreme SuperHyperNotion, namely, Extreme SuperHyperJoin, 3304
is up. The Extreme Algorithm is Extremely straightforward. 3305

C(N SHG)Extreme SuperHyperJoin = {E3i+13i=0 , E3i+243i=0 }.

C(N SHG)Extreme SuperHyperJoin SuperHyperPolynomial 6z 8 .
C(N SHG)Extreme R-SuperHyperJoin = {V3i+17i=0 }.
C(N SHG)Extreme R-SuperHyperJoin SuperHyperPolynomial = 6z 8 .

• On the Figure (30.7), the Extreme SuperHyperNotion, namely, Extreme SuperHyperJoin, 3306
is up. The Extreme Algorithm is Extremely straightforward. 3307

C(N SHG)Extreme SuperHyperJoin = {E15 , E16 , E17 }.

C(N SHG)Extreme SuperHyperJoin SuperHyperPolynomial = z 3 .
C(N SHG)Extreme R-SuperHyperJoin = {V3 , V13 , V8 }.
C(N SHG)Extreme R-SuperHyperJoin SuperHyperPolynomial =
4 × 5 × 5z 3 .

• On the Figure (30.8), the Extreme SuperHyperNotion, namely, Extreme SuperHyperJoin, 3308
is up. The Extreme Algorithm is Extremely straightforward. 3309

C(N SHG)Extreme SuperHyperJoin = {E4 }.

C(N SHG)Extreme SuperHyperJoin SuperHyperPolynomial = z.
C(N SHG)Extreme R-SuperHyperJoin = {V3 , V13 , V8 }.
C(N SHG)Extreme 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 (30.9), the Extreme SuperHyperNotion, namely, Extreme SuperHyperJoin, 3310
is up. The Extreme Algorithm is Extremely straightforward. 3311

C(N SHG)Extreme SuperHyperJoin = {E3i+13i=0 , E23 }.

C(N SHG)Extreme SuperHyperJoin SuperHyperPolynomial = 3z 5 .
C(N SHG)Extreme R-SuperHyperJoin = {V3i+13i=0 , V15 }.
C(N SHG)Extreme R-SuperHyperJoin SuperHyperPolynomial = 3z 5 .

• On the Figure (30.10), the Extreme SuperHyperNotion, namely, Extreme SuperHyperJoin, 3312
is up. The Extreme Algorithm is Extremely straightforward. 3313

C(N SHG)Extreme SuperHyperJoin = {E5 }.

C(N SHG)Extreme SuperHyperJoin SuperHyperPolynomial = z.
C(N SHG)Extreme R-SuperHyperJoin = {V3 , V13 , V8 }.
C(N SHG)Extreme R-SuperHyperJoin SuperHyperPolynomial =
4 × 5 × 5z 3 .

• On the Figure (30.11), the Extreme SuperHyperNotion, namely, Extreme SuperHyperJoin, 3314
is up. The Extreme Algorithm is Extremely straightforward. 3315

C(N SHG)Extreme SuperHyperJoin = {E1 , E3 }.

C(N SHG)Extreme SuperHyperJoin SuperHyperPolynomial = z 2 .
C(N SHG)Extreme R-SuperHyperJoin = {V6 , V1 }.
C(N SHG)Extreme R-SuperHyperJoin SuperHyperPolynomial =
3 × 3z 2 .

• On the Figure (30.12), the Extreme SuperHyperNotion, namely, Extreme SuperHyperJoin, 3316

is up. The Extreme Algorithm is Extremely straightforward. 3317

C(N SHG)Extreme SuperHyperJoin = {E1 }.

C(N SHG)Extreme SuperHyperJoin SuperHyperPolynomial = z.
C(N SHG)Extreme R-SuperHyperJoin = {V1 , Vii610=5,7,8 }.
i=4

C(N SHG)Extreme R-SuperHyperJoin SuperHyperPolynomial = 5z 5 .

• On the Figure (30.13), the Extreme SuperHyperNotion, namely, Extreme SuperHyperJoin, 3318
is up. The Extreme Algorithm is Extremely straightforward. 3319

C(N SHG)Extreme SuperHyperJoin = {E3 , E9 }.

C(N SHG)Extreme SuperHyperJoin SuperHyperPolynomial = z 2 .
C(N SHG)Extreme R-SuperHyperJoin = {V1 , V6 }.
C(N SHG)Extreme R-SuperHyperJoin SuperHyperPolynomial =
3 × 3z 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 (30.14), the Extreme SuperHyperNotion, namely, Extreme SuperHyperJoin, 3320
is up. The Extreme Algorithm is Extremely straightforward. 3321

C(N SHG)Extreme SuperHyperJoin = {E1 }.

C(N SHG)Extreme SuperHyperJoin SuperHyperPolynomial = 2z.
C(N SHG)Extreme R-SuperHyperJoin = {V1 }.
C(N SHG)Extreme R-SuperHyperJoin SuperHyperPolynomial = z.

• On the Figure (30.15), the Extreme SuperHyperNotion, namely, Extreme SuperHyperJoin, 3322
is up. The Extreme Algorithm is Extremely straightforward. 3323

C(N SHG)Extreme SuperHyperJoin = {E2 , E5 }.

C(N SHG)Extreme SuperHyperJoin SuperHyperPolynomial = 3z 2 .
C(N SHG)Extreme R-SuperHyperJoin = {V1 , V4 }.
C(N SHG)Extreme R-SuperHyperJoin SuperHyperPolynomial = z.

• On the Figure (30.16), the Extreme SuperHyperNotion, namely, Extreme SuperHyperJoin, 3324
is up. The Extreme Algorithm is Extremely straightforward. 3325

C(N SHG)Extreme SuperHyperJoin = {E2 , E5 }.

C(N SHG)Extreme SuperHyperJoin SuperHyperPolynomial = 3z 2 .
C(N SHG)Extreme R-SuperHyperJoin = {V2 , V7 , V17 }.
C(N SHG)Extreme R-SuperHyperJoin SuperHyperPolynomial =
(1 × 5 × 5) + (1 × 2 + 1)z 3 .

• On the Figure (30.17), the Extreme SuperHyperNotion, namely, Extreme SuperHyperJoin, 3326
is up. The Extreme Algorithm is Extremely straightforward. 3327

C(N SHG)Extreme SuperHyperJoin = {E2 , E5 }.

C(N SHG)Extreme SuperHyperJoin SuperHyperPolynomial = 3z 2 .
C(N SHG)Extreme R-SuperHyperJoin = {V27 , V2 , V7 , V17 }.
C(N SHG)Extreme R-SuperHyperJoin SuperHyperPolynomial =
(1 × 1 × 2 + 1)z 4 .

• On the Figure (30.18), the Extreme SuperHyperNotion, namely, Extreme SuperHyperJoin, 3328
is up. The Extreme Algorithm is Extremely straightforward. 3329

C(N SHG)Extreme SuperHyperJoin = {E2 , E5 }.

C(N SHG)Extreme SuperHyperJoin SuperHyperPolynomial = 3z 2 .
C(N SHG)Extreme R-SuperHyperJoin = {V27 , V2 , V7 , V17 }.
C(N SHG)Extreme 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 (30.19), the Extreme SuperHyperNotion, namely, Extreme SuperHyperJoin, 3330
is up. The Extreme Algorithm is Extremely straightforward. 3331

C(N SHG)Extreme SuperHyperJoin = {E3i+1i=03 }.

C(N SHG)Extreme SuperHyperJoin SuperHyperPolynomial = 3z 4 .
C(N SHG)Extreme R-SuperHyperJoin = {V2i+1i=05 }.
C(N SHG)Extreme R-SuperHyperJoin SuperHyperPolynomial = 2z 6 .

• On the Figure (30.20), the Extreme SuperHyperNotion, namely, Extreme SuperHyperJoin, 3332
is up. The Extreme Algorithm is Extremely straightforward. 3333

C(N SHG)Extreme SuperHyperJoin = {E6 }.

C(N SHG)Extreme SuperHyperJoin SuperHyperPolynomial = 10z.
C(N SHG)Extreme R-SuperHyperJoin = {V1 }.
C(N SHG)Extreme R-SuperHyperJoin SuperHyperPolynomial = z.

• On the Figure (30.21), the Extreme SuperHyperNotion, namely, Extreme SuperHyperJoin, 3334
is up. The Extreme Algorithm is Extremely straightforward. 3335

C(N SHG)Extreme SuperHyperJoin = {E2 }.

C(N SHG)Extreme SuperHyperJoin SuperHyperPolynomial = 2z.
C(N SHG)Extreme R-SuperHyperJoin = {V1 }.
C(N SHG)Extreme R-SuperHyperJoin SuperHyperPolynomial = 10z.

• On the Figure (30.22), the Extreme SuperHyperNotion, namely, Extreme SuperHyperJoin, 3336
is up. The Extreme Algorithm is Extremely straightforward. 3337

C(N SHG)Extreme SuperHyperJoin = {E2 , E4 }.

C(N SHG)Extreme SuperHyperJoin SuperHyperPolynomial = 3z 2 .
C(N SHG)Extreme R-SuperHyperJoin = {V3 , V6 }.
C(N SHG)Extreme R-SuperHyperJoin SuperHyperPolynomial
= 10 × 6 + 10 × 6 + 12 × 6 + 12 × 6z 2 .

The previous Extreme approach apply on the upcoming Extreme results on Extreme 3338
SuperHyperClasses. 3339

Henry Garrett · 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 19.0.4. Assume a connected Extreme SuperHyperPath ESHP : (V, E). Then 3340

C(N SHG)Extreme SuperHyperJoin =

|EESHG:(V,E) |Extreme Cardinality

= {Ei }i=1 3
.
C(N SHG)Extreme SuperHyperJoin SuperHyperPolynomial
|EESHG:(V,E) |Extreme Cardinality
= 3z 3 .
C(N SHG)Extreme R-SuperHyperJoin
|EESHG:(V,E) |Extreme Cardinality

= {ViEXT ERN AL }i=1 3

.
C(N SHG)Extreme R-SuperHyperJoin SuperHyperPolynomial
Y |EESHG:(V,E) |Extreme Cardinality
= |V EXT ERN AL ESHG:(V,E) |Extreme Cardinality z 3 .

Proof. Let 3341

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
E |EESHG:(V,E) |Extreme Cardinality , V EXT ERN AL |EESHG:(V,E) |Extreme Cardinality .
3 3

be a longest path taken from a connected Extreme SuperHyperPath ESHP : (V, E). There’s a 3342
new way to redefine as 3343

ViEXT ERN AL ∼ VjEXT ERN AL ≡

∃!Ez ∈ EESHG:(V,E) , ViEXT ERN AL , VjEXT ERN AL ∈ Ez ≡
∃!Ez ∈ EESHG:(V,E) , {ViEXT ERN AL , VjEXT ERN AL } ⊆ Ez .

The term “EXTERNAL” implies |N (ViEXT ERN AL )| ≥ |N (Vj )| where Vj is corresponded to 3344
ViEXT ERN AL in the literatures of SuperHyperJoin. The latter is straightforward.  3345

136EXM18a Example 19.0.5. In the Figure (31.1), the connected Extreme SuperHyperPath ESHP : (V, E), 3346
is highlighted and featured. The Extreme SuperHyperSet, in the Extreme SuperHyperModel 3347
(31.1), is the SuperHyperJoin. 3348

Proposition 19.0.6. Assume a connected Extreme SuperHyperCycle ESHC : (V, E). Then 3349

C(N SHG)Extreme SuperHyperJoin =

|EESHG:(V,E) |Extreme Cardinality

= {Ei }i=1 3
.
C(N SHG)Extreme SuperHyperJoin SuperHyperPolynomial
|EESHG:(V,E) |Extreme Cardinality
= 3z 3 .
C(N SHG)Extreme R-SuperHyperJoin

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 Henry Garrett · Independent Researcher · Department of Mathematics ·
DrHenryGarrett@gmail.com · Manhattan, NY, USA
|EESHG:(V,E) |Extreme Cardinality

= {ViEXT ERN AL }i=1 3

.
C(N SHG)Extreme R-SuperHyperJoin SuperHyperPolynomial
Y |EESHG:(V,E) |Extreme Cardinality
= |V EXT ERN AL ESHG:(V,E) |Extreme Cardinality z 3 .
Proof. Let 3350

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
E |EESHG:(V,E) |Extreme Cardinality , V EXT ERN AL |EESHG:(V,E) |Extreme Cardinality .
3 3

be a longest path taken from a connected Extreme SuperHyperCycle ESHC : (V, E). There’s a 3351

new way to redefine as 3352

ViEXT ERN AL ∼ VjEXT ERN AL ≡

∃!Ez ∈ EESHG:(V,E) , ViEXT ERN AL , VjEXT ERN AL ∈ Ez ≡
∃!Ez ∈ EESHG:(V,E) , {ViEXT ERN AL , VjEXT ERN AL } ⊆ Ez .
The term “EXTERNAL” implies |N (ViEXT ERN AL )| ≥ |N (Vj )| where Vj is corresponded to 3353
ViEXT ERN AL in the literatures of SuperHyperJoin. The latter is straightforward.  3354

136EXM19a Example 19.0.7. In the Figure (31.2), the connected Extreme SuperHyperCycle N SHC : 3355
(V, E), is highlighted and featured. The obtained Extreme SuperHyperSet, in the Extreme 3356
SuperHyperModel (31.2), is the Extreme SuperHyperJoin. 3357

Proposition 19.0.8. Assume a connected Extreme SuperHyperStar ESHS : (V, E). Then 3358

C(N SHG)Extreme Quasi-SuperHyperJoin = {E ∈ EESHG:(V,E) }.

C(N SHG)Extreme Quasi-SuperHyperJoin SuperHyperPolynomial
= |i | Ei ∈ EESHG:(V,E)|Extreme Cardinality |z.
C(N SHG)Extreme R-Quasi-SuperHyperJoin = {CEN T ER ∈ VESHG:(V,E) }.
C(N SHG)Extreme R-Quasi-SuperHyperJoin SuperHyperPolynomial = z.
Proof. Let 3359

P : ViEXT ERN AL , Ei , CEN T ER, VjEXT ERN AL .

be a longest path taken a connected Extreme SuperHyperStar ESHS : (V, E). There’s a new 3360
way to redefine as 3361

ViEXT ERN AL ∼ VjEXT ERN AL ≡

∃!Ez ∈ EESHG:(V,E) , ViEXT ERN AL , VjEXT ERN AL ∈ Ez ≡
∃!Ez ∈ EESHG:(V,E) , {ViEXT ERN AL , VjEXT ERN AL } ⊆ Ez .
The term “EXTERNAL” implies |N (ViEXT ERN AL )| ≥ |N (Vj )| where Vj is corresponded to 3362

ViEXT ERN AL in the literatures of SuperHyperJoin. The latter is straightforward.  3363

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

136EXM20a Example 19.0.9. In the Figure (31.3), the connected Extreme SuperHyperStar ESHS : (V, E), 3364
is highlighted and featured. The obtained Extreme SuperHyperSet, by the Algorithm in previous 3365
Extreme result, of the Extreme SuperHyperVertices of the connected Extreme SuperHyperStar 3366
ESHS : (V, E), in the Extreme SuperHyperModel (31.3), is the Extreme SuperHyperJoin. 3367

Proposition 19.0.10. Assume a connected Extreme SuperHyperBipartite ESHB : (V, E). Then 3368

C(N SHG)Extreme Quasi-SuperHyperJoin

= (PERFECT MATCHING).
{Ei ∈ EPi ESHG:(V,E) ,
∀Pi ESHG:(V,E) , |Pi ESHG:(V,E) | = min |Pi ESHG:(V,E) ∈ P ESHG:(V,E) |}.
i
C(N SHG)Extreme 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)Extreme 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)Extreme SuperHyperJoin SuperHyperPolynomial
= (OTHERWISE)0.
C(N SHG)Extreme 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)Extreme Quasi-SuperHyperJoin SuperHyperPolynomial

X X
= =( (|Pi ESHG:(V,E) |choose 2) = z 2 .
EXT ERN AL |
|VESHG:(V,E) i=|P ESHG:(V,E) |
Extreme Cardinality

Proof. Let 3369

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
Emini |Pi ESHG:(V,E) ∈P ESHG:(V,E) | , Vmin i |Pi
ESHG:(V,E) ∈P ESHG:(V,E) |+1

is a longest path taken from a connected Extreme SuperHyperBipartite ESHB : (V, E). There’s 3370

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

a new way to redefine as 3371

ViEXT ERN AL ∼ VjEXT ERN AL ≡

∃!Ez ∈ EESHG:(V,E) , ViEXT ERN AL , VjEXT ERN AL ∈ Ez ≡
∃!Ez ∈ EESHG:(V,E) , {ViEXT ERN AL , VjEXT ERN AL } ⊆ Ez .

The term “EXTERNAL” implies |N (ViEXT ERN AL )| ≥ |N (Vj )| where Vj is corresponded to 3372
ViEXT ERN AL in the literatures of SuperHyperJoin. The latter is straightforward. Then there’s 3373
no at least one SuperHyperJoin. Thus the notion of quasi may be up but the SuperHyperNotions 3374

based on SuperHyperJoin could be applied. There are only two SuperHyperParts. Thus every 3375
SuperHyperPart could have one SuperHyperVertex as the representative in the 3376

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
Emini |Pi ESHG:(V,E) ∈P ESHG:(V,E) | , Vmini |Pi
ESHG:(V,E) ∈P ESHG:(V,E) |+1

is a longest SuperHyperJoin taken from a connected Extreme SuperHyperBipartite ESHB : 3377

(V, E). Thus only some SuperHyperVertices and only minimum-Extreme-of-SuperHyperPart 3378
SuperHyperEdges are attained in any solution 3379

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
Emini |Pi ESHG:(V,E) ∈P ESHG:(V,E) | , Vmini |Pi
ESHG:(V,E) ∈P ESHG:(V,E) |+1

The latter is straightforward.  3380

136EXM21a Example 19.0.11. In the Extreme Figure (31.4), the connected Extreme SuperHyperBipartite 3381
ESHB : (V, E), is Extreme highlighted and Extreme featured. The obtained Extreme 3382
SuperHyperSet, by the Extreme Algorithm in previous Extreme result, of the Extreme 3383
SuperHyperVertices of the connected Extreme SuperHyperBipartite ESHB : (V, E), in the 3384

Extreme SuperHyperModel (31.4), is the Extreme SuperHyperJoin. 3385

Proposition 19.0.12. Assume a connected Extreme SuperHyperMultipartite ESHM : (V, E). 3386
Then 3387

C(N SHG)Extreme Quasi-SuperHyperJoin

= (PERFECT MATCHING).
{Ei ∈ EPi ESHG:(V,E) ,
∀Pi ESHG:(V,E) , |Pi ESHG:(V,E) | = min |Pi ESHG:(V,E) ∈ P ESHG:(V,E) |}.
i
C(N SHG)Extreme Quasi-SuperHyperJoin

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

= (OTHERWISE).
{},
If ∃Pi ESHG:(V,E) , |Pi ESHG:(V,E) | =
6 min |Pi ESHG:(V,E) ∈ P ESHG:(V,E) |.
i
C(N SHG)Extreme 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)Extreme SuperHyperJoin SuperHyperPolynomial
= (OTHERWISE)0.
C(N SHG)Extreme 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)Extreme Quasi-SuperHyperJoin SuperHyperPolynomial

X X
= =( (|Pi ESHG:(V,E) |choose 2) = z 2 .
EXT ERN AL |
|VESHG:(V,E) i=|P ESHG:(V,E) |
Extreme Cardinality

Proof. Let 3388

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
Emini |Pi ESHG:(V,E) ∈P ESHG:(V,E) | , Vmin i |Pi
ESHG:(V,E) ∈P ESHG:(V,E) |+1

is a longest SuperHyperJoin taken from a connected Extreme SuperHyperMultipartite ESHM : 3389

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

ViEXT ERN AL ∼ VjEXT ERN AL ≡

∃!Ez ∈ EESHG:(V,E) , ViEXT ERN AL , VjEXT ERN AL ∈ Ez ≡
∃!Ez ∈ EESHG:(V,E) , {ViEXT ERN AL , VjEXT ERN AL } ⊆ Ez .

The term “EXTERNAL” implies |N (ViEXT ERN AL )| ≥ |N (Vj )| where Vj is corresponded to 3391
ViEXT ERN AL in the literatures of SuperHyperJoin. The latter is straightforward. Then there’s 3392

no at least one SuperHyperJoin. Thus the notion of quasi may be up but the SuperHyperNotions 3393
based on SuperHyperJoin could be applied. There are only z 0 SuperHyperParts. Thus every 3394
SuperHyperPart could have one SuperHyperVertex as the representative in the 3395

P :

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
Emini |Pi ESHG:(V,E) ∈P ESHG:(V,E) | , Vmini |Pi
ESHG:(V,E) ∈P ESHG:(V,E) |+1

is a longest path taken from a connected Extreme SuperHyperMultipartite ESHM : 3396

(V, E). Thus only some SuperHyperVertices and only minimum-Extreme-of-SuperHyperPart 3397
SuperHyperEdges are attained in any solution 3398

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
Emini |Pi ESHG:(V,E) ∈P ESHG:(V,E) | , Vmini |Pi
ESHG:(V,E) ∈P ESHG:(V,E) |+1

is a longest path taken from a connected Extreme SuperHyperMultipartite ESHM : (V, E). 3399
The latter is straightforward.  3400

136EXM22a Example 19.0.13. In the Figure (31.5), the connected Extreme SuperHyperMultipartite 3401
ESHM : (V, E), is highlighted and Extreme featured. The obtained Extreme SuperHyperSet, by 3402

the Algorithm in previous Extreme result, of the Extreme SuperHyperVertices of the connected 3403
Extreme SuperHyperMultipartite ESHM : (V, E), in the Extreme SuperHyperModel (31.5), is 3404
the Extreme SuperHyperJoin. 3405

Proposition 19.0.14. Assume a connected Extreme SuperHyperWheel ESHW : (V, E). Then, 3406

C(N SHG)Extreme SuperHyperJoin =

|EESHG:(V,E) |Extreme Cardinality

= {Ei }i=1 3
.
C(N SHG)Extreme SuperHyperJoin SuperHyperPolynomial
|EESHG:(V,E) |Extreme Cardinality
= 3z 3 .
C(N SHG)Extreme R-SuperHyperJoin
|EESHG:(V,E) |Extreme Cardinality

= {ViEXT ERN AL }i=1 3

.
C(N SHG)Extreme R-SuperHyperJoin SuperHyperPolynomial
Y |EESHG:(V,E) |Extreme Cardinality
= |V EXT ERN AL ESHG:(V,E) |Extreme Cardinality z 3 .

Proof. Let 3407

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
E |EESHG:(V,E) |Extreme Cardinality , V EXT ERN AL |EESHG:(V,E) |Extreme Cardinality .
3 3

Henry Garrett · 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 Extreme SuperHyperWheel ESHW : (V, E). 3408
There’s a new way to redefine as 3409

ViEXT ERN AL ∼ VjEXT ERN AL ≡

∃!Ez ∈ EESHG:(V,E) , ViEXT ERN AL , VjEXT ERN AL ∈ Ez ≡
∃!Ez ∈ EESHG:(V,E) , {ViEXT ERN AL , VjEXT ERN AL } ⊆ Ez .

The term “EXTERNAL” implies |N (ViEXT ERN AL )| ≥ |N (Vj )| where Vj is corresponded to 3410
ViEXT ERN AL in the literatures of SuperHyperJoin. The latter is straightforward. Then there’s 3411

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

136EXM23a Example 19.0.15. In the Extreme Figure (31.6), the connected Extreme SuperHyperWheel 3415
N SHW : (V, E), is Extreme highlighted and featured. The obtained Extreme SuperHyperSet, 3416
by the Algorithm in previous result, of the Extreme SuperHyperVertices of the connected 3417
Extreme SuperHyperWheel ESHW : (V, E), in the Extreme SuperHyperModel (31.6), is the 3418
Extreme SuperHyperJoin. 3419

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 CHAPTER 20 3420

Extreme SuperHyperPerfect But As The 3421

Extensions Excerpt From Dense And 3422

Super Forms 3423

Definition 20.0.1. (Different Extreme Types of Extreme SuperHyperPerfect). 3424

Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider an Extreme 3425

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

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

Va ∈ Ei , Ej ; 3428

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

Va ∈ Ei , Ej ; and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 3430

(iii) Extreme v-SuperHyperPerfect if ∀Vi ∈ VESHG:(V,E) \ V 0 , ∃!Vj ∈ V 0 , such that 3431

Vi , Vj ∈ Ea ; 3432

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

Vi , Vj ∈ Ea ; and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; 3434

(v) Extreme SuperHyperPerfect if it’s either of Extreme e-SuperHyperPerfect, Extreme 3435

re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, and Extreme rv-SuperHyperPerfect. 3436

Definition 20.0.2. ((Extreme) SuperHyperPerfect). 3437

Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider an Extreme 3438

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

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

Extreme re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, and Extreme rv- 3441
SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3442
is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Extreme 3443
cardinality of the Extreme SuperHyperEdges in the conseNeighborive Extreme sequence 3444
of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 3445

Extreme SuperHyperPerfect; 3446

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

(ii) a Extreme SuperHyperPerfect if it’s either of Extreme e-SuperHyperPerfect, Extreme 3447

re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, and Extreme rv-SuperHyperPerfect 3448
and C(N SHG) for a Extreme SuperHyperGraph N SHG : (V, E) is the maximum 3449
Extreme cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S 3450
of high Extreme cardinality conseNeighborive Extreme SuperHyperEdges and Extreme 3451
SuperHyperVertices such that they form the Extreme SuperHyperPerfect; 3452

(iii) an Extreme SuperHyperPerfect SuperHyperPolynomial if it’s either of Extreme 3453

e-SuperHyperPerfect, Extreme re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, 3454

and Extreme rv-SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph 3455
N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients 3456
defined as the Extreme number of the maximum Extreme cardinality of the Extreme 3457
SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme cardinality conseNeigh- 3458
borive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form 3459
the Extreme SuperHyperPerfect; and the Extreme power is corresponded to its Extreme 3460

coefficient; 3461

(iv) a Extreme SuperHyperPerfect SuperHyperPolynomial if it’s either of Extreme 3462

e-SuperHyperPerfect, Extreme re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, 3463

and Extreme rv-SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph 3464
N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients 3465
defined as the Extreme number of the maximum Extreme cardinality of the Extreme 3466
SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme cardinality conseNeigh- 3467
borive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form 3468
the Extreme SuperHyperPerfect; and the Extreme power is corresponded to its Extreme 3469

coefficient; 3470

(v) an Extreme R-SuperHyperPerfect if it’s either of Extreme e-SuperHyperPerfect, 3471

Extreme re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, and Extreme rv- 3472

SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3473
is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Extreme 3474
cardinality of the Extreme SuperHyperVertices in the conseNeighborive Extreme sequence 3475
of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 3476
Extreme SuperHyperPerfect; 3477

(vi) a Extreme R-SuperHyperPerfect if it’s either of Extreme e-SuperHyperPerfect, 3478

Extreme re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, and Extreme rv- 3479
SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is 3480

the maximum Extreme cardinality of the Extreme SuperHyperVertices of an Extreme Su- 3481
perHyperSet S of high Extreme cardinality conseNeighborive Extreme SuperHyperEdges 3482
and Extreme SuperHyperVertices such that they form the Extreme SuperHyperPerfect; 3483

(vii) an Extreme R-SuperHyperPerfect SuperHyperPolynomial if it’s either 3484

of Extreme e-SuperHyperPerfect, Extreme re-SuperHyperPerfect, Extreme v- 3485
SuperHyperPerfect, and Extreme rv-SuperHyperPerfect and C(N SHG) for an Extreme 3486
SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the 3487
Extreme coefficients defined as the Extreme number of the maximum Extreme cardinality 3488

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

Henry Garrett · 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 conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVer- 3490

tices such that they form the Extreme SuperHyperPerfect; and the Extreme power is 3491
corresponded to its Extreme coefficient; 3492

(viii) a Extreme SuperHyperPerfect SuperHyperPolynomial if it’s either of Extreme 3493

e-SuperHyperPerfect, Extreme re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, 3494

and Extreme rv-SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph 3495
N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients 3496
defined as the Extreme number of the maximum Extreme cardinality of the Extreme 3497
SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality 3498
conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVertices such 3499

that they form the Extreme SuperHyperPerfect; and the Extreme power is corresponded 3500
to its Extreme coefficient. 3501

136EXM1 Example 20.0.3. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E) in the 3502
mentioned Extreme Figures in every Extreme items. 3503

• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperPer- 3504
fect, is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are some 3505
empty Extreme SuperHyperEdges but E2 is a loop Extreme SuperHyperEdge and E4 is 3506
an Extreme SuperHyperEdge. Thus in the terms of Extreme SuperHyperNeighbor, there’s 3507
only one Extreme SuperHyperEdge, namely, E4 . The Extreme SuperHyperVertex, V3 is 3508

Extreme isolated means that there’s no Extreme SuperHyperEdge has it as an Extreme 3509
endpoint. Thus the Extreme SuperHyperVertex, V3 , is excluded in every given Extreme 3510
SuperHyperPerfect. 3511

C(N SHG)Extreme SuperHyperPerfect = {E4 }.

C(N SHG)Extreme SuperHyperPerfect SuperHyperPolynomial = z.
C(N SHG)Extreme R-SuperHyperPerfect = {V4 }.
C(N SHG)Extreme R-SuperHyperPerfect SuperHyperPolynomial = 3z.

• On the Figure (30.2), the Extreme SuperHyperNotion, namely, Extreme SuperHyper- 3512
Perfect, is up. The Extreme Algorithm is Extremely straightforward. E1 , E2 and E3 3513
are some empty Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. 3514

Thus in the terms of Extreme SuperHyperNeighbor, there’s only one Extreme SuperHy- 3515
perEdge, namely, E4 . The Extreme SuperHyperVertex, V3 is Extreme isolated means that 3516
there’s no Extreme SuperHyperEdge has it as an Extreme endpoint. Thus the Extreme 3517
SuperHyperVertex, V3 , is excluded in every given Extreme SuperHyperPerfect. 3518

C(N SHG)Extreme SuperHyperPerfect = {E4 }.

C(N SHG)Extreme SuperHyperPerfect SuperHyperPolynomial = z.
C(N SHG)Extreme R-SuperHyperPerfect = {V4 }.
C(N SHG)Extreme R-SuperHyperPerfect SuperHyperPolynomial = 3z.

Henry Garrett · 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 (30.3), the Extreme SuperHyperNotion, namely, Extreme SuperHyperPer- 3519
fect, is up. The Extreme Algorithm is Extremely straightforward. 3520

C(N SHG)Extreme SuperHyperPerfect = {E4 }.

C(N SHG)Extreme SuperHyperPerfect SuperHyperPolynomial = z.
C(N SHG)Extreme R-SuperHyperPerfect = {V4 }.
C(N SHG)Extreme R-SuperHyperPerfect SuperHyperPolynomial = 3z.

• On the Figure (30.4), the Extreme SuperHyperNotion, namely, Extreme SuperHyperPer- 3521
fect, is up. The Extreme Algorithm is Extremely straightforward. 3522

C(N SHG)Extreme SuperHyperPerfect = {E4 , E2 }.

C(N SHG)Extreme SuperHyperPerfect SuperHyperPolynomial = 2z 2 .
C(N SHG)Extreme R-SuperHyperPerfect = {V1 , V4 }.
C(N SHG)Extreme R-SuperHyperPerfect SuperHyperPolynomial = 15z 2 .

• On the Figure (30.5), the Extreme SuperHyperNotion, namely, Extreme SuperHyperPer- 3523
fect, is up. The Extreme Algorithm is Extremely straightforward. 3524

C(N SHG)Extreme SuperHyperPerfect = {E3 }.

C(N SHG)Extreme SuperHyperPerfect SuperHyperPolynomial = 4z.
C(N SHG)Extreme R-SuperHyperPerfect = {V5 }.
C(N SHG)Extreme R-SuperHyperPerfect SuperHyperPolynomial = z.

• On the Figure (30.6), the Extreme SuperHyperNotion, namely, Extreme SuperHyperPer- 3525
fect, is up. The Extreme Algorithm is Extremely straightforward. 3526

C(N SHG)Extreme SuperHyperPerfect = {E3i+13i=0 , E3i+243i=0 }.

C(N SHG)Extreme SuperHyperPerfect SuperHyperPolynomial 6z 8 .
C(N SHG)Extreme R-SuperHyperPerfect = {V3i+17i=0 }.
C(N SHG)Extreme R-SuperHyperPerfect SuperHyperPolynomial = 6z 8 .

• On the Figure (30.7), the Extreme SuperHyperNotion, namely, Extreme SuperHyperPer- 3527

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

C(N SHG)Extreme SuperHyperPerfect = {E15 , E16 , E17 }.

C(N SHG)Extreme SuperHyperPerfect SuperHyperPolynomial = z 3 .
C(N SHG)Extreme R-SuperHyperPerfect = {V3 , V6 , V8 }.
C(N SHG)Extreme R-SuperHyperPerfect SuperHyperPolynomial =
3 × 4 × 4z 3 .

• On the Figure (30.8), the Extreme SuperHyperNotion, namely, Extreme SuperHyperPer- 3529

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

C(N SHG)Extreme SuperHyperPerfect = {E4 }.

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

C(N SHG)Extreme SuperHyperPerfect SuperHyperPolynomial = z.

C(N SHG)Extreme R-SuperHyperPerfect = {V3 , V6 , V8 }.
C(N SHG)Extreme R-SuperHyperPerfect SuperHyperPolynomial =
3 × 4 × 4z 3 .

• On the Figure (30.9), the Extreme SuperHyperNotion, namely, Extreme SuperHyperPer- 3531
fect, is up. The Extreme Algorithm is Extremely straightforward. 3532

C(N SHG)Extreme Quasi-SuperHyperPerfect = {E3i+13i=0 , E23 }.

C(N SHG)Extreme Quasi-SuperHyperPerfect SuperHyperPolynomial = 3z 5 .
C(N SHG)Extreme R-Quasi-SuperHyperPerfect = {V3i+13i=0 , V15 }.
C(N SHG)Extreme R-Quasi-SuperHyperPerfect SuperHyperPolynomial = 3z 5 .

• On the Figure (30.10), the Extreme SuperHyperNotion, namely, Extreme SuperHyperPer- 3533
fect, is up. The Extreme Algorithm is Extremely straightforward. 3534

C(N SHG)Extreme SuperHyperPerfect = {E5 }.

C(N SHG)Extreme SuperHyperPerfect SuperHyperPolynomial = z.
C(N SHG)Extreme R-SuperHyperPerfect = {V3 , V6 , V8 }.
C(N SHG)Extreme R-SuperHyperPerfect SuperHyperPolynomial =
3 × 4 × 4z 3 .

• On the Figure (30.11), the Extreme SuperHyperNotion, namely, Extreme SuperHyperPer- 3535
fect, is up. The Extreme Algorithm is Extremely straightforward. 3536

C(N SHG)Extreme SuperHyperPerfect = {E1 , E3 }.

C(N SHG)Extreme SuperHyperPerfect SuperHyperPolynomial = z 2 .
C(N SHG)Extreme R-SuperHyperPerfect = {V6 , V1 }.
C(N SHG)Extreme R-SuperHyperPerfect SuperHyperPolynomial =
3 × 2z 2 .

• On the Figure (30.12), the Extreme SuperHyperNotion, namely, Extreme SuperHyperPer- 3537
fect, is up. The Extreme Algorithm is Extremely straightforward. 3538

C(N SHG)Extreme SuperHyperPerfect = {E1 }.

C(N SHG)Extreme SuperHyperPerfect SuperHyperPolynomial = z.
C(N SHG)Extreme R-SuperHyperPerfect = {V1 , Vii610=5,7,8 }.
i=4

C(N SHG)Extreme 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 (30.13), the Extreme SuperHyperNotion, namely, Extreme SuperHyperPer- 3539
fect, is up. The Extreme Algorithm is Extremely straightforward. 3540

C(N SHG)Extreme SuperHyperPerfect = {E3 , E9 }.

C(N SHG)Extreme SuperHyperPerfect SuperHyperPolynomial = z 2 .
C(N SHG)Extreme R-SuperHyperPerfect = {V1 , V6 }.
C(N SHG)Extreme R-SuperHyperPerfect SuperHyperPolynomial =
3 × 3z 2 .

• On the Figure (30.14), the Extreme SuperHyperNotion, namely, Extreme SuperHyperPer- 3541
fect, is up. The Extreme Algorithm is Extremely straightforward. 3542

C(N SHG)Extreme SuperHyperPerfect = {E1 }.

C(N SHG)Extreme SuperHyperPerfect SuperHyperPolynomial = 2z.
C(N SHG)Extreme R-SuperHyperPerfect = {V1 }.
C(N SHG)Extreme R-SuperHyperPerfect SuperHyperPolynomial = z.

• On the Figure (30.15), the Extreme SuperHyperNotion, namely, Extreme SuperHyperPer- 3543
fect, is up. The Extreme Algorithm is Extremely straightforward. 3544

C(N SHG)Extreme SuperHyperPerfect = {E2 , E5 }.

C(N SHG)Extreme SuperHyperPerfect SuperHyperPolynomial = 3z 2 .
C(N SHG)Extreme R-SuperHyperPerfect = {V1 , V4 }.
C(N SHG)Extreme R-SuperHyperPerfect SuperHyperPolynomial = z.

• On the Figure (30.16), the Extreme SuperHyperNotion, namely, Extreme SuperHyperPer- 3545
fect, is up. The Extreme Algorithm is Extremely straightforward. 3546

C(N SHG)Extreme SuperHyperPerfect = {E2 , E5 }.

C(N SHG)Extreme SuperHyperPerfect SuperHyperPolynomial = 3z 2 .
C(N SHG)Extreme R-Quasi-SuperHyperPerfect = {V2 , V7 , V17 }.
C(N SHG)Extreme R-Quasi-SuperHyperPerfect SuperHyperPolynomial =
(1 × 5 × 5) + (1 × 2 + 1)z 3 .

• On the Figure (30.17), the Extreme SuperHyperNotion, namely, Extreme SuperHyperPer- 3547
fect, is up. The Extreme Algorithm is Extremely straightforward. 3548

C(N SHG)Extreme SuperHyperPerfect = {E2 , E5 }.

C(N SHG)Extreme SuperHyperPerfect SuperHyperPolynomial = 3z 2 .
C(N SHG)Extreme R-Quasi-SuperHyperPerfect = {V27 , V2 , V7 , V17 }.
C(N SHG)Extreme 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 (30.18), the Extreme SuperHyperNotion, namely, Extreme SuperHyperPer- 3549
fect, is up. The Extreme Algorithm is Extremely straightforward. 3550

C(N SHG)Extreme SuperHyperPerfect = {E2 , E5 }.

C(N SHG)Extreme SuperHyperPerfect SuperHyperPolynomial = 3z 2 .
C(N SHG)Extreme R-Quasi-SuperHyperPerfect = {V27 , V2 , V7 , V17 }.
C(N SHG)Extreme R-Quasi-SuperHyperPerfect SuperHyperPolynomial =
(1 × 1 × 2 + 1)z 4 .

• On the Figure (30.19), the Extreme SuperHyperNotion, namely, Extreme SuperHyperPer- 3551
fect, is up. The Extreme Algorithm is Extremely straightforward. 3552

C(N SHG)Extreme SuperHyperPerfect = {E3i+1i=03 }.

C(N SHG)Extreme SuperHyperPerfect SuperHyperPolynomial = 3z 4 .
C(N SHG)Extreme R-Quasi-SuperHyperPerfect = {V2i+1i=05 }.
C(N SHG)Extreme R-Quasi-SuperHyperPerfect SuperHyperPolynomial = 2z 6 .

• On the Figure (30.20), the Extreme SuperHyperNotion, namely, Extreme SuperHyperPer- 3553
fect, is up. The Extreme Algorithm is Extremely straightforward. 3554

C(N SHG)Extreme SuperHyperPerfect = {E6 }.

C(N SHG)Extreme SuperHyperPerfect SuperHyperPolynomial = 10z.
C(N SHG)Extreme R-SuperHyperPerfect = {V1 }.
C(N SHG)Extreme R-SuperHyperPerfect SuperHyperPolynomial = z.

• On the Figure (30.21), the Extreme SuperHyperNotion, namely, Extreme SuperHyperPer- 3555

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

C(N SHG)Extreme SuperHyperPerfect = {E2 }.

C(N SHG)Extreme SuperHyperPerfect SuperHyperPolynomial = 2z.
C(N SHG)Extreme R-SuperHyperPerfect = {V1 }.
C(N SHG)Extreme R-SuperHyperPerfect SuperHyperPolynomial = 10z.

• On the Figure (30.22), the Extreme SuperHyperNotion, namely, Extreme SuperHyperPer- 3557
fect, is up. The Extreme Algorithm is Extremely straightforward. 3558

C(N SHG)Extreme SuperHyperPerfect = {E2 , E5 }.

C(N SHG)Extreme SuperHyperPerfect SuperHyperPolynomial = z 2 .
C(N SHG)Extreme R-Quasi-SuperHyperPerfect = {V3 , V6 }.
C(N SHG)Extreme R-Quasi-SuperHyperPerfect SuperHyperPolynomial
= 10 × 6 + 10 × 6 + 12 × 6 + 12 × 6z 2 .

The previous Extreme approach apply on the upcoming Extreme results on Extreme 3559

SuperHyperClasses. 3560

Henry Garrett · 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 20.0.4. Assume a connected Extreme SuperHyperPath ESHP : (V, E). Then 3561

C(N SHG)Extreme SuperHyperPerfect =

|EESHG:(V,E) |Extreme Cardinality

= {Ei }i=1 3
.
C(N SHG)Extreme SuperHyperPerfect SuperHyperPolynomial
|EESHG:(V,E) |Extreme Cardinality
= 3z 3 .
C(N SHG)Extreme R-SuperHyperPerfect
|EESHG:(V,E) |Extreme Cardinality

= {ViEXT ERN AL }i=1 3

.
C(N SHG)Extreme R-SuperHyperPerfect SuperHyperPolynomial
Y |EESHG:(V,E) |Extreme Cardinality
= |V EXT ERN AL ESHG:(V,E) |Extreme Cardinality z 3 .

Proof. Let 3562

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
E |EESHG:(V,E) |Extreme Cardinality , V EXT ERN AL |EESHG:(V,E) |Extreme Cardinality .
3 3

be a longest path taken from a connected Extreme SuperHyperPath ESHP : (V, E). There’s a 3563
new way to redefine as 3564

ViEXT ERN AL ∼ VjEXT ERN AL ≡

∃!Ez ∈ EESHG:(V,E) , ViEXT ERN AL , VjEXT ERN AL ∈ Ez ≡
∃!Ez ∈ EESHG:(V,E) , {ViEXT ERN AL , VjEXT ERN AL } ⊆ Ez .

The term “EXTERNAL” implies |N (ViEXT ERN AL )| ≥ |N (Vj )| where Vj is corresponded to 3565
ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is straightforward.  3566

136EXM18a Example 20.0.5. In the Figure (31.1), the connected Extreme SuperHyperPath ESHP : (V, E), 3567
is highlighted and featured. The Extreme SuperHyperSet, in the Extreme SuperHyperModel 3568
(31.1), is the SuperHyperPerfect. 3569

Proposition 20.0.6. Assume a connected Extreme SuperHyperCycle ESHC : (V, E). Then 3570

C(N SHG)Extreme SuperHyperPerfect =

|EESHG:(V,E) |Extreme Cardinality

= {Ei }i=1 3
.
C(N SHG)Extreme SuperHyperPerfect SuperHyperPolynomial
|EESHG:(V,E) |Extreme Cardinality
= 3z 3 .
C(N SHG)Extreme R-SuperHyperPerfect

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 Henry Garrett · Independent Researcher · Department of Mathematics ·
DrHenryGarrett@gmail.com · Manhattan, NY, USA
|EESHG:(V,E) |Extreme Cardinality

= {ViEXT ERN AL }i=1 3

.
C(N SHG)Extreme R-SuperHyperPerfect SuperHyperPolynomial
Y |EESHG:(V,E) |Extreme Cardinality
= |V EXT ERN AL ESHG:(V,E) |Extreme Cardinality z 3 .
Proof. Let 3571

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
E |EESHG:(V,E) |Extreme Cardinality , V EXT ERN AL |EESHG:(V,E) |Extreme Cardinality .
3 3

be a longest path taken from a connected Extreme SuperHyperCycle ESHC : (V, E). There’s a 3572

new way to redefine as 3573

ViEXT ERN AL ∼ VjEXT ERN AL ≡

∃!Ez ∈ EESHG:(V,E) , ViEXT ERN AL , VjEXT ERN AL ∈ Ez ≡
∃!Ez ∈ EESHG:(V,E) , {ViEXT ERN AL , VjEXT ERN AL } ⊆ Ez .
The term “EXTERNAL” implies |N (ViEXT ERN AL )| ≥ |N (Vj )| where Vj is corresponded to 3574
ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is straightforward.  3575

136EXM19a Example 20.0.7. In the Figure (31.2), the connected Extreme SuperHyperCycle N SHC : 3576
(V, E), is highlighted and featured. The obtained Extreme SuperHyperSet, in the Extreme 3577
SuperHyperModel (31.2), is the Extreme SuperHyperPerfect. 3578

Proposition 20.0.8. Assume a connected Extreme SuperHyperStar ESHS : (V, E). Then 3579

C(N SHG)Extreme SuperHyperPerfect = {E ∈ EESHG:(V,E) }.

C(N SHG)Extreme SuperHyperPerfect SuperHyperPolynomial
= |i | Ei ∈ EESHG:(V,E)|Extreme Cardinality |z.
C(N SHG)Extreme R-SuperHyperPerfect = {CEN T ER ∈ VESHG:(V,E) }.
C(N SHG)Extreme R-SuperHyperPerfect SuperHyperPolynomial = z.
Proof. Let 3580

P : ViEXT ERN AL , Ei , CEN T ER, VjEXT ERN AL .

be a longest path taken a connected Extreme SuperHyperStar ESHS : (V, E). There’s a new 3581
way to redefine as 3582

ViEXT ERN AL ∼ VjEXT ERN AL ≡

∃!Ez ∈ EESHG:(V,E) , ViEXT ERN AL , VjEXT ERN AL ∈ Ez ≡
∃!Ez ∈ EESHG:(V,E) , {ViEXT ERN AL , VjEXT ERN AL } ⊆ Ez .
The term “EXTERNAL” implies |N (ViEXT ERN AL )| ≥ |N (Vj )| where Vj is corresponded to 3583

ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is straightforward.  3584

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

136EXM20a Example 20.0.9. In the Figure (31.3), the connected Extreme SuperHyperStar ESHS : (V, E), 3585
is highlighted and featured. The obtained Extreme SuperHyperSet, by the Algorithm in previous 3586
Extreme result, of the Extreme SuperHyperVertices of the connected Extreme SuperHyperStar 3587
ESHS : (V, E), in the Extreme SuperHyperModel (31.3), is the Extreme SuperHyperPerfect. 3588

Proposition 20.0.10. Assume a connected Extreme SuperHyperBipartite ESHB : (V, E). Then 3589

C(N SHG)Extreme 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)Extreme 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)Extreme 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)Extreme SuperHyperPerfect SuperHyperPolynomial
= (OTHERWISE)0.
C(N SHG)Extreme 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)Extreme Quasi-SuperHyperPerfect SuperHyperPolynomial

X X
= =( (|Pi ESHG:(V,E) |choose 2) = z 2 .
EXT ERN AL |
|VESHG:(V,E) i=|P ESHG:(V,E) |
Extreme Cardinality

Proof. Let 3590

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 Extreme SuperHyperBipartite ESHB : (V, E). There’s 3591

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

a new way to redefine as 3592

ViEXT ERN AL ∼ VjEXT ERN AL ≡

∃!Ez ∈ EESHG:(V,E) , ViEXT ERN AL , VjEXT ERN AL ∈ Ez ≡
∃!Ez ∈ EESHG:(V,E) , {ViEXT ERN AL , VjEXT ERN AL } ⊆ Ez .

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

ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is straightforward. Then 3594
there’s no at least one SuperHyperPerfect. Thus the notion of quasi may be up but the 3595
SuperHyperNotions based on SuperHyperPerfect could be applied. There are only two 3596
SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as the 3597
representative in the 3598

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
Emini |Pi ESHG:(V,E) ∈P ESHG:(V,E) | , Vmini |Pi
ESHG:(V,E) ∈P ESHG:(V,E) |+1

is a longest SuperHyperPerfect taken from a connected Extreme SuperHyperBipartite ESHB : 3599

(V, E). Thus only some SuperHyperVertices and only minimum-Extreme-of-SuperHyperPart 3600
SuperHyperEdges are attained in any solution 3601

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
Emini |Pi ESHG:(V,E) ∈P ESHG:(V,E) | , Vmini |Pi
ESHG:(V,E) ∈P ESHG:(V,E) |+1

The latter is straightforward.  3602

136EXM21a Example 20.0.11. In the Extreme Figure (31.4), the connected Extreme SuperHyperBipartite 3603
ESHB : (V, E), is Extreme highlighted and Extreme featured. The obtained Extreme 3604
SuperHyperSet, by the Extreme Algorithm in previous Extreme result, of the Extreme 3605
SuperHyperVertices of the connected Extreme SuperHyperBipartite ESHB : (V, E), in the 3606
Extreme SuperHyperModel (31.4), is the Extreme SuperHyperPerfect. 3607

Proposition 20.0.12. Assume a connected Extreme SuperHyperMultipartite ESHM : (V, E). 3608

Henry Garrett · 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 3609

C(N SHG)Extreme 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)Extreme 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)Extreme 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)Extreme SuperHyperPerfect SuperHyperPolynomial
= (OTHERWISE)0.
C(N SHG)Extreme 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)Extreme Quasi-SuperHyperPerfect SuperHyperPolynomial

X X
= =( (|Pi ESHG:(V,E) |choose 2) = z 2 .
EXT ERN AL |
|VESHG:(V,E) i=|P ESHG:(V,E) |
Extreme Cardinality

Proof. Let 3610

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 Extreme SuperHyperMultipartite 3611

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

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 corresponded 3613
to ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is straightforward. 3614
Then there’s no at least one SuperHyperPerfect. Thus the notion of quasi may be up but 3615
the SuperHyperNotions based on SuperHyperPerfect could be applied. There are only z 0 3616
SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as the 3617
representative in the 3618

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
Emini |Pi ESHG:(V,E) ∈P ESHG:(V,E) | , Vmini |Pi
ESHG:(V,E) ∈P ESHG:(V,E) |+1

is a longest path taken from a connected Extreme SuperHyperMultipartite ESHM : 3619

(V, E). Thus only some SuperHyperVertices and only minimum-Extreme-of-SuperHyperPart 3620
SuperHyperEdges are attained in any solution 3621

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
Emini |Pi ESHG:(V,E) ∈P ESHG:(V,E) | , Vmini |Pi
ESHG:(V,E) ∈P ESHG:(V,E) |+1

is a longest path taken from a connected Extreme SuperHyperMultipartite ESHM : (V, E). 3622
The latter is straightforward.  3623

136EXM22a Example 20.0.13. In the Figure (31.5), the connected Extreme SuperHyperMultipartite 3624
ESHM : (V, E), is highlighted and Extreme featured. The obtained Extreme SuperHyperSet, by 3625
the Algorithm in previous Extreme result, of the Extreme SuperHyperVertices of the connected 3626
Extreme SuperHyperMultipartite ESHM : (V, E), in the Extreme SuperHyperModel (31.5), is 3627

the Extreme SuperHyperPerfect. 3628

Proposition 20.0.14. Assume a connected Extreme SuperHyperWheel ESHW : (V, E). Then, 3629

C(N SHG)Extreme SuperHyperPerfect = {E ∈ EESHG:(V,E) }.

C(N SHG)Extreme SuperHyperPerfect SuperHyperPolynomial
= |i | Ei ∈ EESHG:(V,E)|Extreme Cardinality |z.
C(N SHG)Extreme R-SuperHyperPerfect = {CEN T ER ∈ VESHG:(V,E) }.
C(N SHG)Extreme R-SuperHyperPerfect SuperHyperPolynomial = z.

Proof. Let 3630

P : ViEXT ERN AL , Ei , CEN T ER, VjEXT ERN AL .

Henry Garrett · 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 SuperHyperPerfect taken from a connected Extreme SuperHyperWheel ESHW : 3631

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

ViEXT ERN AL ∼ VjEXT ERN AL ≡

∃!Ez ∈ EESHG:(V,E) , ViEXT ERN AL , VjEXT ERN AL ∈ Ez ≡
∃!Ez ∈ EESHG:(V,E) , {ViEXT ERN AL , VjEXT ERN AL } ⊆ Ez .

The term “EXTERNAL” implies |N (ViEXT ERN AL )| ≥ |N (Vj )| where Vj is corresponded to 3633
ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is straightforward. Then there’s 3634

at least one SuperHyperPerfect. Thus the notion of quasi isn’t up and the SuperHyperNotions 3635
based on SuperHyperPerfect could be applied. The unique embedded SuperHyperPerfect 3636
proposes some longest SuperHyperPerfect excerpt from some representatives. The latter is 3637
straightforward.  3638

136EXM23a Example 20.0.15. In the Extreme Figure (31.6), the connected Extreme SuperHyperWheel 3639
N SHW : (V, E), is Extreme highlighted and featured. The obtained Extreme SuperHyperSet, 3640
by the Algorithm in previous result, of the Extreme SuperHyperVertices of the connected 3641
Extreme SuperHyperWheel ESHW : (V, E), in the Extreme SuperHyperModel (31.6), is the 3642
Extreme SuperHyperPerfect. 3643

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 CHAPTER 21 3644

Extreme SuperHyperTotal But As The 3645

Extensions Excerpt From Dense And 3646

Super Forms 3647

Definition 21.0.1. (Different Extreme Types of Extreme SuperHyperTotal). 3648

Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider an Extreme 3649
SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and E 0 = {E1 , E2 , . . . , Ez }. Then either V 0 or E 0 is called 3650

(i) Extreme e-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that Va ∈ Ei , Ej ; 3651

(ii) Extreme re-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that Va ∈ 3652

Ei , Ej ; and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 3653

(iii) Extreme v-SuperHyperTotal if ∀Vi ∈ VESHG:(V,E) , ∃!Vj ∈ V 0 , such that Vi , Vj ∈ Ea ; 3654

(iv) Extreme rv-SuperHyperTotal if ∀Vi ∈ VESHG:(V,E) , ∃!Vj ∈ V 0 , such that Vi , Vj ∈ Ea ; 3655

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

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

re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Extreme rv-SuperHyperTotal. 3658

Definition 21.0.2. ((Extreme) SuperHyperTotal). 3659

Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider an Extreme 3660
SuperHyperEdge (NSHE) E = {V1 , V2 , . . . , Vs }. Then E is called 3661

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

re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Extreme rv-SuperHyperTotal and 3663
C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme 3664
cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme 3665
SuperHyperEdges in the conseNeighborive Extreme sequence of Extreme SuperHyperEdges 3666

and Extreme SuperHyperVertices such that they form the Extreme SuperHyperTotal; 3667

(ii) a Extreme SuperHyperTotal if it’s either of Extreme e-SuperHyperTotal, Extreme 3668

re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Extreme rv-SuperHyperTotal 3669
and C(N SHG) for a Extreme SuperHyperGraph N SHG : (V, E) is the maximum 3670

Extreme cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S 3671

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

of high Extreme cardinality conseNeighborive Extreme SuperHyperEdges and Extreme 3672

SuperHyperVertices such that they form the Extreme SuperHyperTotal; 3673

(iii) an Extreme SuperHyperTotal SuperHyperPolynomial if it’s either of Extreme 3674

e-SuperHyperTotal, Extreme re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Ex- 3675
treme rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph N SHG : 3676
(V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined 3677
as the Extreme number of the maximum Extreme cardinality of the Extreme SuperHy- 3678
perEdges of an Extreme SuperHyperSet S of high Extreme cardinality conseNeighborive 3679

Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 3680
Extreme SuperHyperTotal; and the Extreme power is corresponded to its Extreme coeffi- 3681
cient; 3682

(iv) a Extreme SuperHyperTotal SuperHyperPolynomial if it’s either of Extreme e- 3683

SuperHyperTotal, Extreme re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Ex- 3684
treme rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph N SHG : 3685
(V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined 3686
as the Extreme number of the maximum Extreme cardinality of the Extreme SuperHy- 3687

perEdges of an Extreme SuperHyperSet S of high Extreme cardinality conseNeighborive 3688

Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 3689
Extreme SuperHyperTotal; and the Extreme power is corresponded to its Extreme coeffi- 3690
cient; 3691

(v) an Extreme R-SuperHyperTotal if it’s either of Extreme e-SuperHyperTotal, Extreme 3692

re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Extreme rv-SuperHyperTotal 3693
and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum 3694
Extreme cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of 3695
the Extreme SuperHyperVertices in the conseNeighborive Extreme sequence of Extreme 3696

SuperHyperEdges and Extreme SuperHyperVertices such that they form the Extreme 3697
SuperHyperTotal; 3698

(vi) a Extreme R-SuperHyperTotal if it’s either of Extreme e-SuperHyperTotal, Extreme 3699

re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Extreme rv-SuperHyperTotal 3700
and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum 3701
Extreme cardinality of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S 3702
of high Extreme cardinality conseNeighborive Extreme SuperHyperEdges and Extreme 3703
SuperHyperVertices such that they form the Extreme SuperHyperTotal; 3704

(vii) an Extreme R-SuperHyperTotal SuperHyperPolynomial if it’s either of Ex- 3705

treme e-SuperHyperTotal, Extreme re-SuperHyperTotal, Extreme v-SuperHyperTotal, 3706

and Extreme rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph 3707
N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients 3708
defined as the Extreme number of the maximum Extreme cardinality of the Extreme 3709
SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality con- 3710
seNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that 3711
they form the Extreme SuperHyperTotal; and the Extreme power is corresponded to its 3712

Extreme coefficient; 3713

Henry Garrett · 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 Extreme SuperHyperTotal SuperHyperPolynomial if it’s either of Extreme e- 3714

SuperHyperTotal, Extreme re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Ex- 3715
treme rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph N SHG : 3716
(V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined as 3717
the Extreme number of the maximum Extreme cardinality of the Extreme SuperHyper- 3718
Vertices of an Extreme SuperHyperSet S of high Extreme cardinality conseNeighborive 3719

Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 3720
Extreme SuperHyperTotal; and the Extreme power is corresponded to its Extreme coeffi- 3721
cient. 3722

136EXM1 Example 21.0.3. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E) in the 3723
mentioned Extreme Figures in every Extreme items. 3724

• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperTotal, 3725
is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are some empty 3726
Extreme SuperHyperEdges but E2 is a loop Extreme SuperHyperEdge and E4 is an 3727
Extreme SuperHyperEdge. Thus in the terms of Extreme SuperHyperNeighbor, there’s 3728
only one Extreme SuperHyperEdge, namely, E4 . The Extreme SuperHyperVertex, V3 is 3729
Extreme isolated means that there’s no Extreme SuperHyperEdge has it as an Extreme 3730

endpoint. Thus the Extreme SuperHyperVertex, V3 , is excluded in every given Extreme 3731
SuperHyperTotal. 3732

C(N SHG)Extreme Quasi-SuperHyperTotal = {E4 }.

C(N SHG)Extreme Quasi-SuperHyperTotal SuperHyperPolynomial = z.
C(N SHG)Extreme R-Quasi-SuperHyperTotal = {V4 }.
C(N SHG)Extreme R-Quasi-SuperHyperTotal SuperHyperPolynomial = 3z.

• On the Figure (30.2), the Extreme SuperHyperNotion, namely, Extreme SuperHyperTotal, 3733
is up. The Extreme Algorithm is Extremely straightforward. E1 , E2 and E3 are some empty 3734
Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. Thus in the terms of 3735
Extreme SuperHyperNeighbor, there’s only one Extreme SuperHyperEdge, namely, E4 . 3736
The Extreme SuperHyperVertex, V3 is Extreme isolated means that there’s no Extreme 3737

SuperHyperEdge has it as an Extreme endpoint. Thus the Extreme SuperHyperVertex, 3738

V3 , is excluded in every given Extreme SuperHyperTotal. 3739

C(N SHG)Extreme Quasi-SuperHyperTotal = {E4 }.

C(N SHG)Extreme Quasi-SuperHyperTotal SuperHyperPolynomial = z.
C(N SHG)Extreme R-Quasi-SuperHyperTotal = {V4 }.
C(N SHG)Extreme R-Quasi-SuperHyperTotal SuperHyperPolynomial = 3z.

• On the Figure (30.3), the Extreme SuperHyperNotion, namely, Extreme SuperHyperTotal, 3740
is up. The Extreme Algorithm is Extremely straightforward. 3741

C(N SHG)Extreme Quasi-SuperHyperTotal = {E4 }.

C(N SHG)Extreme Quasi-SuperHyperTotal SuperHyperPolynomial = z.
C(N SHG)Extreme R-Quasi-SuperHyperTotal = {V4 }.
C(N SHG)Extreme R-Quasi-SuperHyperTotal SuperHyperPolynomial = 3z.

Henry Garrett · 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 (30.4), the Extreme SuperHyperNotion, namely, Extreme SuperHyperTotal, 3742
is up. The Extreme Algorithm is Extremely straightforward. 3743

C(N SHG)Extreme Quasi- = {E4 , E2 }.

C(N SHG)Extreme Quasi-SuperHyperTotal SuperHyperPolynomial = 2z 2 .
C(N SHG)Extreme R-Quasi-SuperHyperTotal = {V1 , V4 }.
C(N SHG)Extreme R-Quasi-SuperHyperTotal SuperHyperPolynomial = 15z 2 .

• On the Figure (30.5), the Extreme SuperHyperNotion, namely, Extreme SuperHyperTotal, 3744
is up. The Extreme Algorithm is Extremely straightforward. 3745

C(N SHG)Extreme Quasi-SuperHyperTotal = {E3 }.

C(N SHG)Extreme Quasi-SuperHyperTotal SuperHyperPolynomial = 4z.
C(N SHG)Extreme R-Quasi-SuperHyperTotal = {V5 }.
C(N SHG)Extreme R-Quasi-SuperHyperTotal SuperHyperPolynomial = z.

• On the Figure (30.6), the Extreme SuperHyperNotion, namely, Extreme SuperHyperTotal, 3746
is up. The Extreme Algorithm is Extremely straightforward. 3747

C(N SHG)Extreme SuperHyperTotal = {Ei+19i=0 }.

C(N SHG)Extreme SuperHyperTotal SuperHyperPolynomial 20z 10 .
C(N SHG)Extreme R-SuperHyperTotal = {Vi+19i=0 }.
C(N SHG)Extreme R-SuperHyperTotal SuperHyperPolynomial = 20z 10 .

• On the Figure (30.7), the Extreme SuperHyperNotion, namely, Extreme SuperHyperTotal, 3748

is up. The Extreme Algorithm is Extremely straightforward. 3749

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 (30.8), the Extreme SuperHyperNotion, namely, Extreme SuperHyperTotal, 3750

is up. The Extreme Algorithm is Extremely straightforward. 3751

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 (30.9), the Extreme SuperHyperNotion, namely, Extreme SuperHyperTotal, 3752

is up. The Extreme Algorithm is Extremely straightforward. 3753

C(N SHG)Extreme SuperHyperTotal = {Ei+19i=0 }.

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

C(N SHG)Extreme SuperHyperTotal SuperHyperPolynomial 10z 10 .

C(N SHG)Extreme R-SuperHyperTotal = {Vi+19i=0 }.
C(N SHG)Extreme R-SuperHyperTotal SuperHyperPolynomial = 20z 10 .

• On the Figure (30.10), the Extreme SuperHyperNotion, namely, Extreme SuperHyperTotal, 3754
is up. The Extreme Algorithm is Extremely straightforward. 3755

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 (30.11), the Extreme SuperHyperNotion, namely, Extreme SuperHyperTotal, 3756
is up. The Extreme Algorithm is Extremely straightforward. 3757

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 (30.12), the Extreme SuperHyperNotion, namely, Extreme SuperHyperTotal, 3758
is up. The Extreme Algorithm is Extremely straightforward. 3759

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 (30.13), the Extreme SuperHyperNotion, namely, Extreme SuperHyperTotal, 3760
is up. The Extreme Algorithm is Extremely straightforward. 3761

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 (30.14), the Extreme SuperHyperNotion, namely, Extreme SuperHyperTotal, 3762
is up. The Extreme Algorithm is Extremely straightforward. 3763

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 (30.15), the Extreme SuperHyperNotion, namely, Extreme SuperHyperTotal, 3764
is up. The Extreme Algorithm is Extremely straightforward. 3765

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 (30.16), the Extreme SuperHyperNotion, namely, Extreme SuperHyperTotal, 3766

is up. The Extreme Algorithm is Extremely straightforward. 3767

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 (30.17), the Extreme SuperHyperNotion, namely, Extreme SuperHyperTotal, 3768
is up. The Extreme Algorithm is Extremely straightforward. 3769

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 (30.18), the Extreme SuperHyperNotion, namely, Extreme SuperHyperTotal, 3770
is up. The Extreme Algorithm is Extremely straightforward. 3771

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 (30.19), the Extreme SuperHyperNotion, namely, Extreme SuperHyperTotal, 3772
is up. The Extreme Algorithm is Extremely straightforward. 3773

C(N SHG)Extreme SuperHyperTotal = {Ei+2i=011 }.

C(N SHG)Extreme SuperHyperTotal SuperHyperPolynomial = 11z 10 .
C(N SHG)Extreme R-Quasi-SuperHyperTotal = {Vi+2i=011 }.
C(N SHG)Extreme 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 (30.20), the Extreme SuperHyperNotion, namely, Extreme SuperHyperTotal, 3774
is up. The Extreme Algorithm is Extremely straightforward. 3775

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 (30.21), the Extreme SuperHyperNotion, namely, Extreme SuperHyperTotal, 3776
is up. The Extreme Algorithm is Extremely straightforward. 3777

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

C(N SHG)Extreme SuperHyperTotal SuperHyperPolynomial = 2z 2 .
C(N SHG)Extreme R-SuperHyperTotal = {V1 , V2 }.
C(N SHG)Extreme R-SuperHyperTotal SuperHyperPolynomial = 9z 2 .

• On the Figure (30.22), the Extreme SuperHyperNotion, namely, Extreme SuperHyperTotal, 3778

is up. The Extreme Algorithm is Extremely straightforward. 3779

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 Extreme approach apply on the upcoming Extreme results on Extreme 3780
SuperHyperClasses. 3781

Proposition 21.0.4. Assume a connected Extreme SuperHyperPath ESHP : (V, E). Then 3782

C(N SHG)Extreme SuperHyperTotal =

|E | −2
= {Ei }i=1ESHG:(V,E) Extreme Cardinality .
C(N SHG)Extreme SuperHyperTotal SuperHyperPolynomial
= z |EESHG:(V,E) |Extreme Cardinality −2 .
C(N SHG)Extreme R-SuperHyperTotal
|E | −2
= {ViEXT ERN AL }i=1ESHG:(V,E) Extreme Cardinality .
C(N SHG)Extreme R-SuperHyperTotal SuperHyperPolynomial
Y
= |V EXT ERN AL ESHG:(V,E) |Extreme Cardinality z |EESHG:(V,E) |Extreme Cardinality −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

Proof. Let 3783

P :
V2EXT ERN AL , E2 ,
V3EXT ERN AL , E3 ,
...
be a longest path taken from a connected Extreme SuperHyperPath ESHP : (V, E). There’s a 3784

new way to redefine as 3785

ViEXT ERN AL ∼ VjEXT ERN AL ≡

∃!Ez ∈ EESHG:(V,E) , ViEXT ERN AL , VjEXT ERN AL ∈ Ez ≡
∃!Ez ∈ EESHG:(V,E) , {ViEXT ERN AL , VjEXT ERN AL } ⊆ Ez .
The term “EXTERNAL” implies |N (ViEXT ERN AL )| ≥ |N (Vj )| where Vj is corresponded to 3786

ViEXT ERN AL in the literatures of SuperHyperTotal. The latter is straightforward.  3787

136EXM18a Example 21.0.5. In the Figure (31.1), the connected Extreme SuperHyperPath ESHP : (V, E), 3788
is highlighted and featured. The Extreme SuperHyperSet, in the Extreme SuperHyperModel 3789
(31.1), is the SuperHyperTotal. 3790

Proposition 21.0.6. Assume a connected Extreme SuperHyperCycle ESHC : (V, E). Then 3791

C(N SHG)Extreme SuperHyperTotal =

|E | −2
= {Ei }i=1ESHG:(V,E) Extreme Cardinality .
C(N SHG)Extreme SuperHyperTotal SuperHyperPolynomial
= (|EESHG:(V,E) |Extreme Cardinality − 1)
z |EESHG:(V,E) |Extreme Cardinality −2 .
C(N SHG)Extreme R-SuperHyperTotal
|E |Extreme Cardinality −2
= {ViEXT ERN AL }i=1ESHG:(V,E) .
C(N SHG)Extreme R-SuperHyperTotal SuperHyperPolynomial
Y
= |V EXT ERN AL ESHG:(V,E) |Extreme Cardinality z |EESHG:(V,E) |Extreme Cardinality −2

Proof. Let 3792

P :
V2EXT ERN AL , E2 ,
V3EXT ERN AL , E3 ,
...,
E |E|EESHG:(V,E) |Extreme Cardinality −1 .
, V EXT ERN AL |EESHG:(V,E) |Extreme Cardinality −1

be a longest path taken from a connected Extreme SuperHyperCycle ESHC : (V, E). There’s a 3793
new way to redefine as 3794

ViEXT ERN AL ∼ VjEXT ERN AL ≡

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

∃!Ez ∈ EESHG:(V,E) , ViEXT ERN AL , VjEXT ERN AL ∈ Ez ≡

∃!Ez ∈ EESHG:(V,E) , {ViEXT ERN AL , VjEXT ERN AL } ⊆ Ez .

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

ViEXT ERN AL in the literatures of SuperHyperTotal. The latter is straightforward.  3796

136EXM19a Example 21.0.7. In the Figure (31.2), the connected Extreme SuperHyperCycle N SHC : 3797
(V, E), is highlighted and featured. The obtained Extreme SuperHyperSet, in the Extreme 3798
SuperHyperModel (31.2), is the Extreme SuperHyperTotal. 3799

Proposition 21.0.8. Assume a connected Extreme SuperHyperStar ESHS : (V, E). Then 3800

C(N SHG)Extreme SuperHyperTotal = {Ei , Ej ∈ EESHG:(V,E) }.

C(N SHG)Extreme SuperHyperTotal SuperHyperPolynomial
= |i(i − 1) | Ei ∈ EESHG:(V,E)|Extreme Cardinality |z 2 .
C(N SHG)Extreme R-SuperHyperTotal = {CEN T ER, Vj ∈ VESHG:(V,E) }.
C(N SHG)Extreme R-SuperHyperTotal SuperHyperPolynomial =
(|VESHG:(V,E)|Extreme Cardinality |) choose (|VESHG:(V,E)|Extreme Cardinality | − 1)
z2.

Proof. Let 3801

P : ViEXT ERN AL , Ei , CEN T ER, Ej .

be a longest path taken a connected Extreme SuperHyperStar ESHS : (V, E). There’s a new 3802

way to redefine as 3803

ViEXT ERN AL ∼ VjEXT ERN AL ≡

∃!Ez ∈ EESHG:(V,E) , ViEXT ERN AL , VjEXT ERN AL ∈ Ez ≡
∃!Ez ∈ EESHG:(V,E) , {ViEXT ERN AL , VjEXT ERN AL } ⊆ Ez .

The term “EXTERNAL” implies |N (ViEXT ERN AL )| ≥ |N (Vj )| where Vj is corresponded to 3804
ViEXT ERN AL in the literatures of SuperHyperTotal. The latter is straightforward.  3805

136EXM20a Example 21.0.9. In the Figure (31.3), the connected Extreme SuperHyperStar ESHS : (V, E), 3806
is highlighted and featured. The obtained Extreme SuperHyperSet, by the Algorithm in previous 3807
Extreme result, of the Extreme SuperHyperVertices of the connected Extreme SuperHyperStar 3808
ESHS : (V, E), in the Extreme SuperHyperModel (31.3), is the Extreme SuperHyperTotal. 3809

Henry Garrett · 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 21.0.10. Assume a connected Extreme SuperHyperBipartite ESHB : (V, E). Then 3810

C(N SHG)Extreme 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)Extreme SuperHyperTotal
C(N SHG)Extreme 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)Extreme 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)Extreme Quasi-SuperHyperTotal SuperHyperPolynomial

X X
= =( (|Pi ESHG:(V,E) |choose 2) = z 2 .
EXT ERN AL |
|VESHG:(V,E) i=|P ESHG:(V,E) |
Extreme Cardinality

Proof. Let 3811

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest path taken from a connected Extreme SuperHyperBipartite ESHB : (V, E). There’s 3812
a new way to redefine as 3813

ViEXT ERN AL ∼ VjEXT ERN AL ≡

∃!Ez ∈ EESHG:(V,E) , ViEXT ERN AL , VjEXT ERN AL ∈ Ez ≡
∃!Ez ∈ EESHG:(V,E) , {ViEXT ERN AL , VjEXT ERN AL } ⊆ Ez .

The term “EXTERNAL” implies |N (ViEXT ERN AL )| ≥ |N (Vj )| where Vj is corresponded to 3814
ViEXT ERN AL in the literatures of SuperHyperTotal. The latter is straightforward. Then there’s 3815
no at least one SuperHyperTotal. Thus the notion of quasi may be up but the SuperHyperNotions 3816
based on SuperHyperTotal could be applied. There are only two SuperHyperParts. Thus every 3817
SuperHyperPart could have one SuperHyperVertex as the representative in the 3818

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperTotal taken from a connected Extreme SuperHyperBipartite ESHB : 3819
(V, E). Thus only some SuperHyperVertices and only minimum-Extreme-of-SuperHyperPart 3820
SuperHyperEdges are attained in any solution 3821

P :

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

The latter is straightforward.  3822

136EXM21a Example 21.0.11. In the Extreme Figure (31.4), the connected Extreme SuperHyperBipartite 3823
ESHB : (V, E), is Extreme highlighted and Extreme featured. The obtained Extreme 3824

SuperHyperSet, by the Extreme Algorithm in previous Extreme result, of the Extreme 3825
SuperHyperVertices of the connected Extreme SuperHyperBipartite ESHB : (V, E), in the 3826
Extreme SuperHyperModel (31.4), is the Extreme SuperHyperTotal. 3827

Proposition 21.0.12. Assume a connected Extreme SuperHyperMultipartite ESHM : (V, E). 3828
Then 3829

C(N SHG)Extreme 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)Extreme SuperHyperTotal
C(N SHG)Extreme 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)Extreme 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)Extreme Quasi-SuperHyperTotal SuperHyperPolynomial

X X
= =( (|Pi ESHG:(V,E) |choose 2) = z 2 .
EXT ERN AL |
|VESHG:(V,E) i=|P ESHG:(V,E) |
Extreme Cardinality

Proof. Let 3830

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

is a longest SuperHyperTotal taken from a connected Extreme SuperHyperMultipartite 3831

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

ViEXT ERN AL ∼ VjEXT ERN AL ≡

∃!Ez ∈ EESHG:(V,E) , ViEXT ERN AL , VjEXT ERN AL ∈ Ez ≡
∃!Ez ∈ EESHG:(V,E) , {ViEXT ERN AL , VjEXT ERN AL } ⊆ Ez .

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

ViEXT ERN AL in the literatures of SuperHyperTotal. The latter is straightforward. Then there’s 3834

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

no at least one SuperHyperTotal. Thus the notion of quasi may be up but the SuperHyperNotions 3835
based on SuperHyperTotal could be applied. There are only z 0 SuperHyperParts. Thus every 3836
SuperHyperPart could have one SuperHyperVertex as the representative in the 3837

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

is a longest path taken from a connected Extreme SuperHyperMultipartite ESHM : 3838

(V, E). Thus only some SuperHyperVertices and only minimum-Extreme-of-SuperHyperPart 3839
SuperHyperEdges are attained in any solution 3840

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

is a longest path taken from a connected Extreme SuperHyperMultipartite ESHM : (V, E). 3841
The latter is straightforward.  3842

136EXM22a Example 21.0.13. In the Figure (31.5), the connected Extreme SuperHyperMultipartite 3843
ESHM : (V, E), is highlighted and Extreme featured. The obtained Extreme SuperHyperSet, by 3844
the Algorithm in previous Extreme result, of the Extreme SuperHyperVertices of the connected 3845
Extreme SuperHyperMultipartite ESHM : (V, E), in the Extreme SuperHyperModel (31.5), is 3846

the Extreme SuperHyperTotal. 3847

Proposition 21.0.14. Assume a connected Extreme SuperHyperWheel ESHW : (V, E). Then, 3848

∗
C(N SHG)Extreme SuperHyperTotal = {Ei , Ej ∈ EESHG:(V,E) }.
C(N SHG)Extreme SuperHyperTotal SuperHyperPolynomial
∗
= |i(i − 1) | Ei ∈ EESHG:(V,E)| Extreme Cardinality
|z 2 .
C(N SHG)Extreme R-SuperHyperTotal = {CEN T ER, Vj ∈ VESHG:(V,E) }.
C(N SHG)Extreme R-SuperHyperTotal SuperHyperPolynomial =
(|VESHG:(V,E)|Extreme Cardinality |) choose (|VESHG:(V,E)|Extreme Cardinality | − 1)
z2.

Proof. Let 3849

P : ViEXT ERN AL , Ei∗ , CEN T ER, Ej .

is a longest SuperHyperTotal taken from a connected Extreme SuperHyperWheel ESHW : 3850

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

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 corresponded to 3852
ViEXT ERN AL in the literatures of SuperHyperTotal. The latter is straightforward. Then there’s 3853
at least one SuperHyperTotal. Thus the notion of quasi isn’t up and the SuperHyperNotions 3854
based on SuperHyperTotal could be applied. The unique embedded SuperHyperTotal 3855
proposes some longest SuperHyperTotal excerpt from some representatives. The latter is 3856
straightforward.  3857

136EXM23a Example 21.0.15. In the Extreme Figure (31.6), the connected Extreme SuperHyperWheel 3858
N SHW : (V, E), is Extreme highlighted and featured. The obtained Extreme SuperHyperSet, 3859

by the Algorithm in previous result, of the Extreme SuperHyperVertices of the connected 3860
Extreme SuperHyperWheel ESHW : (V, E), in the Extreme SuperHyperModel (31.6), is the 3861
Extreme SuperHyperTotal. 3862

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 CHAPTER 22 3863

Extreme SuperHyperConnected But As 3864

The Extensions Excerpt From Dense And 3865

Super Forms 3866

Definition 22.0.1. (Different Extreme Types of Extreme SuperHyperConnected). 3867

Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider an Extreme 3868
SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and E 0 = {E1 , E2 , . . . , Ez }. Then either V 0 or E 0 is called 3869

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

Va ∈ Ei , Ej ; and ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; 3871

(ii) Extreme re-SuperHyperConnected if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such that 3872

Va ∈ Ei , Ej ; ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; and |Ei |NEUTROSOPIC CARDINALITY = 3873

|Ej |NEUTROSOPIC CARDINALITY ; 3874

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

Vi , Vj 6∈ Ea ; and ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; 3876

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

Vi , Vj ∈ Ea ; ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; and |Vi |NEUTROSOPIC CARDINALITY = 3878
|Vj |NEUTROSOPIC CARDINALITY ; 3879

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

Extreme re-SuperHyperConnected, Extreme v-SuperHyperConnected, and Extreme rv- 3881
SuperHyperConnected. 3882

Definition 22.0.2. ((Extreme) SuperHyperConnected). 3883

Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider an Extreme 3884
SuperHyperEdge (NSHE) E = {V1 , V2 , . . . , Vs }. Then E is called 3885

(i) an Extreme SuperHyperConnected if it’s either of Extreme e-SuperHyperConnected, 3886

Extreme re-SuperHyperConnected, Extreme v-SuperHyperConnected, and Extreme rv- 3887
SuperHyperConnected and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3888
is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Extreme 3889

cardinality of the Extreme SuperHyperEdges in the conseNeighborive Extreme sequence 3890

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

of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 3891
Extreme SuperHyperConnected; 3892

(ii) a Extreme SuperHyperConnected if it’s either of Extreme e-SuperHyperConnected, 3893

Extreme re-SuperHyperConnected, Extreme v-SuperHyperConnected, and Extreme rv- 3894

SuperHyperConnected and C(N SHG) for a Extreme SuperHyperGraph N SHG : (V, E) 3895
is the maximum Extreme cardinality of the Extreme SuperHyperEdges of an Extreme 3896
SuperHyperSet S of high Extreme cardinality conseNeighborive Extreme SuperHyperEdges 3897
and Extreme SuperHyperVertices such that they form the Extreme SuperHyperConnected; 3898

(iii) an Extreme SuperHyperConnected SuperHyperPolynomial if it’s either of 3899

Extreme e-SuperHyperConnected, Extreme re-SuperHyperConnected, Extreme v- 3900
SuperHyperConnected, and Extreme rv-SuperHyperConnected and C(N SHG) for an 3901
Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial con- 3902

tains the Extreme coefficients defined as the Extreme number of the maximum Extreme 3903
cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high 3904
Extreme cardinality conseNeighborive Extreme SuperHyperEdges and Extreme SuperHy- 3905
perVertices such that they form the Extreme SuperHyperConnected; and the Extreme 3906
power is corresponded to its Extreme coefficient; 3907

(iv) a Extreme SuperHyperConnected SuperHyperPolynomial if it’s either of 3908

Extreme e-SuperHyperConnected, Extreme re-SuperHyperConnected, Extreme v- 3909
SuperHyperConnected, and Extreme rv-SuperHyperConnected and C(N SHG) for an 3910

Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial con- 3911

tains the Extreme coefficients defined as the Extreme number of the maximum Extreme 3912
cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high 3913
Extreme cardinality conseNeighborive Extreme SuperHyperEdges and Extreme SuperHy- 3914
perVertices such that they form the Extreme SuperHyperConnected; and the Extreme 3915
power is corresponded to its Extreme coefficient; 3916

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

Extreme re-SuperHyperConnected, Extreme v-SuperHyperConnected, and Extreme rv- 3918
SuperHyperConnected and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3919
is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Extreme 3920
cardinality of the Extreme SuperHyperVertices in the conseNeighborive Extreme sequence 3921
of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 3922
Extreme SuperHyperConnected; 3923

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

Extreme re-SuperHyperConnected, Extreme v-SuperHyperConnected, and Extreme rv- 3925
SuperHyperConnected and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3926
is the maximum Extreme cardinality of the Extreme SuperHyperVertices of an Extreme Su- 3927
perHyperSet S of high Extreme cardinality conseNeighborive Extreme SuperHyperEdges 3928

and Extreme SuperHyperVertices such that they form the Extreme SuperHyperConnected; 3929

(vii) an Extreme R-SuperHyperConnected SuperHyperPolynomial if it’s either 3930

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

SuperHyperConnected, and Extreme rv-SuperHyperConnected and C(N SHG) for an 3932

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

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

contains the Extreme coefficients defined as the Extreme number of the maximum 3934
Extreme cardinality of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S 3935
of high Extreme cardinality conseNeighborive Extreme SuperHyperEdges and Extreme 3936
SuperHyperVertices such that they form the Extreme SuperHyperConnected; and the 3937
Extreme power is corresponded to its Extreme coefficient; 3938

(viii) a Extreme SuperHyperConnected SuperHyperPolynomial if it’s either of 3939

Extreme e-SuperHyperConnected, Extreme re-SuperHyperConnected, Extreme v- 3940
SuperHyperConnected, and Extreme rv-SuperHyperConnected and C(N SHG) for an 3941
Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial con- 3942
tains the Extreme coefficients defined as the Extreme number of the maximum Extreme 3943

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

Extreme cardinality conseNeighborive Extreme SuperHyperEdges and Extreme SuperHy- 3945
perVertices such that they form the Extreme SuperHyperConnected; and the Extreme 3946
power is corresponded to its Extreme coefficient. 3947

136EXM1 Example 22.0.3. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E) in the 3948

mentioned Extreme Figures in every Extreme items. 3949

• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperCon- 3950
nected, is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are some 3951
empty Extreme SuperHyperEdges but E2 is a loop Extreme SuperHyperEdge and E4 is 3952

an Extreme SuperHyperEdge. Thus in the terms of Extreme SuperHyperNeighbor, there’s 3953

only one Extreme SuperHyperEdge, namely, E4 . The Extreme SuperHyperVertex, V3 is 3954
Extreme isolated means that there’s no Extreme SuperHyperEdge has it as an Extreme 3955
endpoint. Thus the Extreme SuperHyperVertex, V3 , is excluded in every given Extreme 3956
SuperHyperConnected. 3957

C(N SHG)Extreme SuperHyperConnected = {E4 }.

C(N SHG)Extreme SuperHyperConnected SuperHyperPolynomial = z.
C(N SHG)Extreme R-SuperHyperConnected = {V4 }.
C(N SHG)Extreme R-SuperHyperConnected SuperHyperPolynomial = 3z.

• On the Figure (30.2), the Extreme SuperHyperNotion, namely, Extreme SuperHyper- 3958
Connected, is up. The Extreme Algorithm is Extremely straightforward. E1 , E2 and 3959
E3 are some empty Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. 3960
Thus in the terms of Extreme SuperHyperNeighbor, there’s only one Extreme SuperHy- 3961
perEdge, namely, E4 . The Extreme SuperHyperVertex, V3 is Extreme isolated means that 3962
there’s no Extreme SuperHyperEdge has it as an Extreme endpoint. Thus the Extreme 3963

SuperHyperVertex, V3 , is excluded in every given Extreme SuperHyperConnected. 3964

C(N SHG)Extreme SuperHyperConnected = {E4 }.

C(N SHG)Extreme SuperHyperConnected SuperHyperPolynomial = z.
C(N SHG)Extreme R-SuperHyperConnected = {V4 }.
C(N SHG)Extreme R-SuperHyperConnected SuperHyperPolynomial = 3z.

Henry Garrett · 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 (30.3), the Extreme SuperHyperNotion, namely, Extreme SuperHyperCon- 3965
nected, is up. The Extreme Algorithm is Extremely straightforward. 3966

C(N SHG)Extreme SuperHyperConnected = {E4 }.

C(N SHG)Extreme SuperHyperConnected SuperHyperPolynomial = z.
C(N SHG)Extreme R-SuperHyperConnected = {V4 }.
C(N SHG)Extreme R-SuperHyperConnected SuperHyperPolynomial = 3z.

• On the Figure (30.4), the Extreme SuperHyperNotion, namely, Extreme SuperHyperCon- 3967

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

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

C(N SHG)Extreme SuperHyperConnected SuperHyperPolynomial = z 3 .
C(N SHG)Extreme R-Quasi-SuperHyperConnected = {V1 , V4 }.
C(N SHG)Extreme R-Quasi-SuperHyperConnected SuperHyperPolynomial = 15z 2 .

• On the Figure (30.5), the Extreme SuperHyperNotion, namely, Extreme SuperHyperCon- 3969
nected, is up. The Extreme Algorithm is Extremely straightforward. 3970

C(N SHG)Extreme SuperHyperConnected = {E3 }.

C(N SHG)Extreme SuperHyperConnected SuperHyperPolynomial = 4z.
C(N SHG)Extreme R-SuperHyperConnected = {V5 }.
C(N SHG)Extreme R-SuperHyperConnected SuperHyperPolynomial = z.

• On the Figure (30.6), the Extreme SuperHyperNotion, namely, Extreme SuperHyperCon- 3971
nected, is up. The Extreme Algorithm is Extremely straightforward. 3972

C(N SHG)Extreme Quasi-SuperHyperConnected = {Ei+19i=0 }.

C(N SHG)Extreme Quasi-SuperHyperConnected SuperHyperPolynomial 20z 10 .
C(N SHG)Extreme R-Quasi-SuperHyperConnected = {Vi+19i=0 }.
C(N SHG)Extreme R-Quasi-SuperHyperConnected SuperHyperPolynomial = 20z 10 .

• On the Figure (30.7), the Extreme SuperHyperNotion, namely, Extreme SuperHyperCon- 3973

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

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 (30.8), the Extreme SuperHyperNotion, namely, Extreme SuperHyperCon- 3975
nected, is up. The Extreme Algorithm is Extremely straightforward. 3976

C(N SHG)Extreme Quasi-SuperHyperConnected = {E4 }.

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

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 (30.9), the Extreme SuperHyperNotion, namely, Extreme SuperHyperCon- 3977
nected, is up. The Extreme Algorithm is Extremely straightforward. 3978

C(N SHG)Extreme Quasi-SuperHyperConnected = {Ei+19i=0 }.

C(N SHG)Extreme Quasi-SuperHyperConnected SuperHyperPolynomial 10z 10 .
C(N SHG)Extreme R-SuperHyperConnected = {Vi+119
i=11
, V22 }.
C(N SHG)Extreme R-SuperHyperConnected SuperHyperPolynomial = 20z 10 .

• On the Figure (30.10), the Extreme SuperHyperNotion, namely, Extreme SuperHyper- 3979
Connected, is up. The Extreme Algorithm is Extremely straightforward. 3980

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 (30.11), the Extreme SuperHyperNotion, namely, Extreme SuperHyper- 3981
Connected, is up. The Extreme Algorithm is Extremely straightforward. 3982

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 (30.12), the Extreme SuperHyperNotion, namely, Extreme SuperHyper- 3983
Connected, is up. The Extreme Algorithm is Extremely straightforward. 3984

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 (30.13), the Extreme SuperHyperNotion, namely, Extreme SuperHyper- 3985
Connected, is up. The Extreme Algorithm is Extremely straightforward. 3986

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 .

Henry Garrett · 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 (30.14), the Extreme SuperHyperNotion, namely, Extreme SuperHyper- 3987
Connected, is up. The Extreme Algorithm is Extremely straightforward. 3988

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 (30.15), the Extreme SuperHyperNotion, namely, Extreme SuperHyper- 3989
Connected, is up. The Extreme Algorithm is Extremely straightforward. 3990

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 .

• On the Figure (30.16), the Extreme SuperHyperNotion, namely, Extreme SuperHyper- 3991
Connected, is up. The Extreme Algorithm is Extremely straightforward. 3992

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 (30.17), the Extreme SuperHyperNotion, namely, Extreme SuperHyper- 3993
Connected, is up. The Extreme Algorithm is Extremely straightforward. 3994

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 (30.18), the Extreme SuperHyperNotion, namely, Extreme SuperHyper- 3995
Connected, is up. The Extreme Algorithm is Extremely straightforward. 3996

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 .

Henry Garrett · 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 (30.19), the Extreme SuperHyperNotion, namely, Extreme SuperHyper- 3997
Connected, is up. The Extreme Algorithm is Extremely straightforward. 3998

C(N SHG)Extreme Quasi-SuperHyperConnected = {Ei+2i=011 }.

C(N SHG)Extreme Quasi-SuperHyperConnected SuperHyperPolynomial = 11z 10 .
C(N SHG)Extreme R-Quasi-SuperHyperConnected = {Vi+2i=011 }.
C(N SHG)Extreme R-Quasi-SuperHyperConnected SuperHyperPolynomial = 11z 10 .

• On the Figure (30.20), the Extreme SuperHyperNotion, namely, Extreme SuperHyper- 3999
Connected, is up. The Extreme Algorithm is Extremely straightforward. 4000

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.

• On the Figure (30.21), the Extreme SuperHyperNotion, namely, Extreme SuperHyper- 4001
Connected, is up. The Extreme Algorithm is Extremely straightforward. 4002

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 = 10z.

• On the Figure (30.22), the Extreme SuperHyperNotion, namely, Extreme SuperHyper- 4003
Connected, is up. The Extreme Algorithm is Extremely straightforward. 4004

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 Extreme approach apply on the upcoming Extreme results on Extreme 4005
SuperHyperClasses. 4006

Henry Garrett · 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 22.0.4. Assume a connected Extreme SuperHyperPath ESHP : (V, E). Then 4007

C(N SHG)Extreme Quasi-SuperHyperConnected =

|EESHG:(V,E) |
Extreme Cardinality
−2
= {Ei }i=1 .
C(N SHG)Extreme Quasi-SuperHyperConnected SuperHyperPolynomial
|EESHG:(V,E) |Extreme −2
=z Cardinality .
C(N SHG)Extreme R-Quasi-SuperHyperConnected
|EESHG:(V,E) |Extreme −2
= {ViEXT ERN AL }i=1 Cardinality
.
C(N SHG)Extreme R-Quasi-SuperHyperConnected SuperHyperPolynomial
|E | −2
Y
= |V EXT ERN AL ESHG:(V,E) |Extreme Cardinality z ESHG:(V,E) Extreme Cardinality

Proof. Let 4008

P :
V2EXT ERN AL , E2 ,
V3EXT ERN AL , E3 ,
...,
E|EESHG:(V,E) |Extreme Cardinality −1 , V EXT ERN AL |EESHG:(V,E) |Extreme Cardinality −1 .

be a longest path taken from a connected Extreme SuperHyperPath ESHP : (V, E). There’s a 4009
new way to redefine as 4010

ViEXT ERN AL ∼ VjEXT ERN AL ≡

∃!Ez ∈ EESHG:(V,E) , ViEXT ERN AL , VjEXT ERN AL ∈ Ez ≡
∃!Ez ∈ EESHG:(V,E) , {ViEXT ERN AL , VjEXT ERN AL } ⊆ Ez .

The term “EXTERNAL” implies |N (ViEXT ERN AL )| ≥ |N (Vj )| where Vj is corresponded to 4011
ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is straightforward.  4012

136EXM18a Example 22.0.5. In the Figure (31.1), the connected Extreme SuperHyperPath ESHP : (V, E), 4013
is highlighted and featured. The Extreme SuperHyperSet, in the Extreme SuperHyperModel 4014
(31.1), is the SuperHyperConnected. 4015

Proposition 22.0.6. Assume a connected Extreme SuperHyperCycle ESHC : (V, E). Then 4016

C(N SHG)Extreme Quasi-SuperHyperConnected =

|EESHG:(V,E) |Extreme Cardinality
−2
= {Ei }i=1 .
C(N SHG)Extreme Quasi-SuperHyperConnected SuperHyperPolynomial
= (|EESHG:(V,E) |Extreme Cardinality − 1)
|EESHG:(V,E) |Extreme −2
z Cardinality .
C(N SHG)Extreme R-Quasi-SuperHyperConnected

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 Henry Garrett · Independent Researcher · Department of Mathematics ·
DrHenryGarrett@gmail.com · Manhattan, NY, USA
|EESHG:(V,E) |Extreme −2
= {ViEXT ERN AL }i=1 Cardinality
.
C(N SHG)Extreme R-Quasi-SuperHyperConnected SuperHyperPolynomial
|E | −2
Y
= |V EXT ERN AL ESHG:(V,E) |Extreme Cardinality z ESHG:(V,E) Extreme Cardinality

Proof. Let 4017

P :
V2EXT ERN AL , E2 ,
V3EXT ERN AL , E3 ,
...,
E|EESHG:(V,E) |Extreme Cardinality −1 , V EXT ERN AL |EESHG:(V,E) |Extreme Cardinality −1 .

be a longest path taken from a connected Extreme SuperHyperCycle ESHC : (V, E). There’s a 4018
new way to redefine as 4019

ViEXT ERN AL ∼ VjEXT ERN AL ≡

∃!Ez ∈ EESHG:(V,E) , ViEXT ERN AL , VjEXT ERN AL ∈ Ez ≡
∃!Ez ∈ EESHG:(V,E) , {ViEXT ERN AL , VjEXT ERN AL } ⊆ Ez .

The term “EXTERNAL” implies |N (ViEXT ERN AL )| ≥ |N (Vj )| where Vj is corresponded to 4020
ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is straightforward.  4021

136EXM19a Example 22.0.7. In the Figure (31.2), the connected Extreme SuperHyperCycle N SHC : 4022
(V, E), is highlighted and featured. The obtained Extreme SuperHyperSet, in the Extreme 4023
SuperHyperModel (31.2), is the Extreme SuperHyperConnected. 4024

Proposition 22.0.8. Assume a connected Extreme SuperHyperStar ESHS : (V, E). Then 4025

C(N SHG)Extreme SuperHyperConnected = {Ei ∈ EESHG:(V,E) }.

C(N SHG)Extreme SuperHyperConnected SuperHyperPolynomial
= |i | Ei ∈ |EESHG:(V,E) |Extreme Cardinality z.
C(N SHG)Extreme R-SuperHyperConnected = {CEN T ER ∈ VESHG:(V,E) }.
C(N SHG)Extreme R-SuperHyperConnected SuperHyperPolynomial = z.
Proof. Let 4026

P : ViEXT ERN AL , Ei , CEN T ER, Ej .

be a longest path taken a connected Extreme SuperHyperStar ESHS : (V, E). There’s a new 4027

way to redefine as 4028

ViEXT ERN AL ∼ VjEXT ERN AL ≡

∃!Ez ∈ EESHG:(V,E) , ViEXT ERN AL , VjEXT ERN AL ∈ Ez ≡
∃!Ez ∈ EESHG:(V,E) , {ViEXT ERN AL , VjEXT ERN AL } ⊆ Ez .

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

ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is straightforward.  4030

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

136EXM20a Example 22.0.9. In the Figure (31.3), the connected Extreme SuperHyperStar ESHS : (V, E), 4031
is highlighted and featured. The obtained Extreme SuperHyperSet, by the Algorithm in previous 4032
Extreme result, of the Extreme SuperHyperVertices of the connected Extreme SuperHyperStar 4033
ESHS : (V, E), in the Extreme SuperHyperModel (31.3), is the Extreme SuperHyperConnected. 4034

Proposition 22.0.10. Assume a connected Extreme SuperHyperBipartite ESHB : (V, E). Then 4035

C(N SHG)Extreme 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)Extreme 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)Extreme 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)Extreme V-SuperHyperConnected SuperHyperPolynomial

X X
= =( (|Pi ESHG:(V,E) |choose 2) = z 2 .
EXT ERN AL |
|VESHG:(V,E) i=|P ESHG:(V,E) |
Extreme Cardinality

Proof. Let 4036

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

is a longest path taken from a connected Extreme SuperHyperBipartite ESHB : (V, E). There’s 4037
a new way to redefine as 4038

ViEXT ERN AL ∼ VjEXT ERN AL ≡

∃!Ez ∈ EESHG:(V,E) , ViEXT ERN AL , VjEXT ERN AL ∈ Ez ≡
∃!Ez ∈ EESHG:(V,E) , {ViEXT ERN AL , VjEXT ERN AL } ⊆ Ez .

The term “EXTERNAL” implies |N (ViEXT ERN AL )| ≥ |N (Vj )| where Vj is corresponded to 4039
ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is straightforward. Then 4040
there’s no at least one SuperHyperConnected. Thus the notion of quasi may be up but the 4041
SuperHyperNotions based on SuperHyperConnected could be applied. There are only two 4042
SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as the 4043
representative in the 4044

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 SuperHyperConnected taken from a connected Extreme SuperHyperBipartite 4045

ESHB : (V, E). Thus only some SuperHyperVertices and only minimum-Extreme-of- 4046
SuperHyperPart SuperHyperEdges are attained in any solution 4047

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
The latter is straightforward.  4048

136EXM21a Example 22.0.11. In the Extreme Figure (31.4), the connected Extreme SuperHyperBipartite 4049
ESHB : (V, E), is Extreme highlighted and Extreme featured. The obtained Extreme 4050
SuperHyperSet, by the Extreme Algorithm in previous Extreme result, of the Extreme 4051
SuperHyperVertices of the connected Extreme SuperHyperBipartite ESHB : (V, E), in the 4052
Extreme SuperHyperModel (31.4), is the Extreme SuperHyperConnected. 4053

Proposition 22.0.12. Assume a connected Extreme SuperHyperMultipartite ESHM : (V, E). 4054
Then 4055

C(N SHG)Extreme 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)Extreme 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)Extreme 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)Extreme V-SuperHyperConnected SuperHyperPolynomial

X X
= =( (|Pi ESHG:(V,E) |choose 2) = z 2 .
EXT ERN AL |
|VESHG:(V,E) i=|P ESHG:(V,E) |
Extreme Cardinality

Proof. Let 4056

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperConnected taken from a connected Extreme SuperHyperMultipartite 4057
ESHM : (V, E). There’s a new way to redefine as 4058

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 corresponded to 4059
ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is straightforward. Then 4060
there’s no at least one SuperHyperConnected. Thus the notion of quasi may be up but 4061
the SuperHyperNotions based on SuperHyperConnected could be applied. There are only 4062
z 0 SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as the 4063
representative in the 4064

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

is a longest path taken from a connected Extreme SuperHyperMultipartite ESHM : 4065

(V, E). Thus only some SuperHyperVertices and only minimum-Extreme-of-SuperHyperPart 4066
SuperHyperEdges are attained in any solution 4067

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

is a longest path taken from a connected Extreme SuperHyperMultipartite ESHM : (V, E). 4068
The latter is straightforward.  4069

136EXM22a Example 22.0.13. In the Figure (31.5), the connected Extreme SuperHyperMultipartite 4070
ESHM : (V, E), is highlighted and Extreme featured. The obtained Extreme SuperHyperSet, by 4071

the Algorithm in previous Extreme result, of the Extreme SuperHyperVertices of the connected 4072
Extreme SuperHyperMultipartite ESHM : (V, E), in the Extreme SuperHyperModel (31.5), is 4073
the Extreme SuperHyperConnected. 4074

Proposition 22.0.14. Assume a connected Extreme SuperHyperWheel ESHW : (V, E). Then, 4075

∗
C(N SHG)Extreme SuperHyperConnected = {Ei ∈ EESHG:(V,E) }.
C(N SHG)Extreme SuperHyperConnected SuperHyperPolynomial
= |i | Ei ∈ |E ∗ ESHG:(V,E) |Extreme Cardinality |z.
C(N SHG)Extreme V-SuperHyperConnected = {CEN T ER ∈ VESHG:(V,E) }.
C(N SHG)Extreme V-SuperHyperConnected SuperHyperPolynomial = z.

Proof. Let 4076

P : V EXT ERN AL i , E ∗ i , CEN T ER, Ej .

is a longest SuperHyperConnected taken from a connected Extreme SuperHyperWheel 4077

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

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 corresponded 4079
to ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is straightforward. 4080
Then there’s at least one SuperHyperConnected. Thus the notion of quasi isn’t up and 4081
the SuperHyperNotions based on SuperHyperConnected could be applied. The unique 4082
embedded SuperHyperConnected proposes some longest SuperHyperConnected excerpt from 4083
some representatives. The latter is straightforward.  4084

136EXM23a Example 22.0.15. In the Extreme Figure (31.6), the connected Extreme SuperHyperWheel 4085
N SHW : (V, E), is Extreme highlighted and featured. The obtained Extreme SuperHyperSet, 4086

by the Algorithm in previous result, of the Extreme SuperHyperVertices of the connected 4087
Extreme SuperHyperWheel ESHW : (V, E), in the Extreme SuperHyperModel (31.6), is the 4088
Extreme SuperHyperConnected. 4089

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 CHAPTER 23 4090

Background 4091

There are some scientific researches covering the topic of this research. In what follows, there 4092
are some discussion and literature reviews about them. 4093

The seminal paper and groundbreaking article is titled “neutrosophic co-degree and neutrosophic 4094
degree alongside chromatic numbers in the setting of some classes related to neutrosophic 4095
hypergraphs” in Ref. [HG1] by Henry Garrett (2022). In this research article, a novel approach 4096
is implemented on SuperHyperGraph and neutrosophic SuperHyperGraph based on general 4097
forms without using neutrosophic classes of neutrosophic SuperHyperGraph. It’s published 4098
in prestigious and fancy journal is entitled “Journal of Current Trends in Computer Science 4099

Research (JCTCSR)” with ISO abbreviation “J Curr Trends Comp Sci Res” in volume 1 4100
and issue 1 with pages 06-14. The research article studies deeply with choosing neutrosophic 4101
hypergraphs instead of neutrosophic SuperHyperGraph. It’s the breakthrough toward independent 4102
results based on initial background. 4103
The seminal paper and groundbreaking article is titled “Super Hyper Dominating and Super 4104
Hyper Resolving on Neutrosophic Super Hyper Graphs and Their Directions in Game Theory and 4105

Neutrosophic Super Hyper Classes” in Ref. [HG2] by Henry Garrett (2022). In this research 4106
article, a novel approach is implemented on SuperHyperGraph and neutrosophic SuperHyper- 4107
Graph based on fundamental SuperHyperNumber and using neutrosophic SuperHyperClasses 4108
of neutrosophic SuperHyperGraph. It’s published in prestigious and fancy journal is entitled 4109
“Journal of Mathematical Techniques and Computational Mathematics(JMTCM)” with ISO 4110
abbreviation “J Math Techniques Comput Math” in volume 1 and issue 3 with pages 242-263. 4111

The research article studies deeply with choosing directly neutrosophic SuperHyperGraph and 4112
SuperHyperGraph. It’s the breakthrough toward independent results based on initial background 4113
and fundamental SuperHyperNumbers. 4114
The seminal paper and groundbreaking article is titled “Some Super Hyper Degrees and Co-Super 4115
Hyper Degrees on Neutrosophic Super Hyper Graphs And Super Hyper Graphs Alongside 4116
Applications in Cancer’s Treatments” in Ref. [HG3] by Henry Garrett (2023). In this research 4117

article, a novel approach is implemented on SuperHyperGraph and neutrosophic SuperHy- 4118

perGraph based on fundamental notions and using vital tools in Cancer’s Treatments. It’s 4119
published in prestigious and fancy journal is entitled “Journal of Mathematical Techniques and 4120
Computational Mathematics(JMTCM)” with ISO abbreviation “J Math Techniques Comput 4121
Math” in volume 2 and issue 1 with pages 35-47. The research article studies deeply with 4122
choosing directly neutrosophic SuperHyperGraph and SuperHyperGraph. It’s the breakthrough 4123

toward independent results based on initial background and fundamental SuperHyperNumbers. 4124

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

In some articles are titled “0039 | Closing Numbers and Super-Closing Numbers as 4125
(Dual)Resolving and (Dual)Coloring alongside (Dual)Dominating in (Neutrosophic)n- 4126
SuperHyperGraph” in Ref. [HG4] by Henry Garrett (2022), “0049 | (Failed)1-Zero-Forcing 4127
Number in Neutrosophic Graphs” in Ref. [HG5] by Henry Garrett (2022), “Extreme SuperHy- 4128
perClique as the Firm Scheme of Confrontation under Cancer’s Recognition as the Model in 4129
The Setting of (Neutrosophic) SuperHyperGraphs” in Ref. [HG6] by Henry Garrett (2022), 4130

“Uncertainty On The Act And Effect Of Cancer Alongside The Foggy Positions Of Cells Toward 4131
Neutrosophic Failed SuperHyperClique inside Neutrosophic SuperHyperGraphs Titled Cancer’s 4132
Recognition” in Ref. [HG7] by Henry Garrett (2022), “Neutrosophic Version Of Separates 4133
Groups Of Cells In Cancer’s Recognition On Neutrosophic SuperHyperGraphs” in Ref. [HG8] 4134
by Henry Garrett (2022), “The Shift Paradigm To Classify Separately The Cells and Affected 4135
Cells Toward The Totality Under Cancer’s Recognition By New Multiple Definitions On the 4136

Sets Polynomials Alongside Numbers In The (Neutrosophic) SuperHyperMatching Theory 4137

Based on SuperHyperGraph and Neutrosophic SuperHyperGraph” in Ref. [HG9] by Henry 4138
Garrett (2022), “Breaking the Continuity and Uniformity of Cancer In The Worst Case of 4139
Full Connections With Extreme Failed SuperHyperClique In Cancer’s Recognition Applied in 4140
(Neutrosophic) SuperHyperGraphs” in Ref. [HG10] by Henry Garrett (2022), “Neutrosophic 4141
Failed SuperHyperStable as the Survivors on the Cancer’s Neutrosophic Recognition Based 4142

on Uncertainty to All Modes in Neutrosophic SuperHyperGraphs” in Ref. [HG11] by Henry 4143

Garrett (2022), “Extremism of the Attacked Body Under the Cancer’s Circumstances Where 4144
Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs” in Ref. [HG12] by Henry 4145
Garrett (2022), “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Recognitions And 4146
(Neutrosophic) SuperHyperGraphs” in Ref. [HG13] by Henry Garrett (2022), “Neutrosophic 4147
Messy-Style SuperHyperGraphs To Form Neutrosophic SuperHyperStable To Act on Cancer’s 4148

Neutrosophic Recognitions In Special ViewPoints” in Ref. [HG14] by Henry Garrett (2022), 4149
“Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To Use Neutrosophic 4150
SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond” in Ref. [HG15] by 4151
Henry Garrett (2022), “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well- 4152
SuperHyperModelled (Neutrosophic) SuperHyperGraphs ” in Ref. [HG16] by Henry Garrett 4153
(2022), “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic SuperHyperStable 4154

To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints” in Ref. [HG12] by 4155

Henry Garrett (2022), “Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutro- 4156
sophic) SuperHyperModeling in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs” 4157
in Ref. [HG17] by Henry Garrett (2022), “Neutrosophic Messy-Style SuperHyperGraphs To 4158
Form Neutrosophic SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special 4159

ViewPoints” in Ref. [HG18] by Henry Garrett (2022),“(Neutrosophic) SuperHyperModeling of 4160

Cancer’s Recognitions Featuring (Neutrosophic) SuperHyperDefensive SuperHyperAlliances” in 4161
Ref. [HG19] by Henry Garrett (2022), “(Neutrosophic) SuperHyperAlliances With SuperHyper- 4162
Defensive and SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph 4163
With (Neutrosophic) SuperHyperModeling of Cancer’s Recognitions And Related (Neutrosophic) 4164
SuperHyperClasses” in Ref. [HG20] by Henry Garrett (2022), “SuperHyperGirth on Su- 4165

perHyperGraph and Neutrosophic SuperHyperGraph With SuperHyperModeling of Cancer’s 4166

Recognitions” in Ref. [HG21] by Henry Garrett (2022), “Some SuperHyperDegrees and 4167
Co-SuperHyperDegrees on Neutrosophic SuperHyperGraphs and SuperHyperGraphs Alongside 4168
Applications in Cancer’s Treatments” in Ref. [HG22] by Henry Garrett (2022), “Super- 4169
HyperDominating and SuperHyperResolving on Neutrosophic SuperHyperGraphs And Their 4170

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

Directions in Game Theory and Neutrosophic SuperHyperClasses” in Ref. [HG23] by Henry 4171
Garrett (2022), “SuperHyperMatching By (R-)Definitions And Polynomials To Monitor Cancer’s 4172
Recognition In Neutrosophic SuperHyperGraphs” in Ref. [HG24] by Henry Garrett (2023), 4173
“The Focus on The Partitions Obtained By Parallel Moves In The Cancer’s Extreme Recognition 4174
With Different Types of Extreme SuperHyperMatching Set and Polynomial on (Neutrosophic) Su- 4175
perHyperGraphs” in Ref. [HG25] by Henry Garrett (2023), “Extreme Failed SuperHyperClique 4176

Decides the Failures on the Cancer’s Recognition in the Perfect Connections of Cancer’s Attacks 4177
By SuperHyperModels Named (Neutrosophic) SuperHyperGraphs” in Ref. [HG26] by Henry 4178
Garrett (2023), “Indeterminacy On The All Possible Connections of Cells In Front of Cancer’s 4179
Attacks In The Terms of Neutrosophic Failed SuperHyperClique on Cancer’s Recognition 4180
called Neutrosophic SuperHyperGraphs” in Ref. [HG27] by Henry Garrett (2023), “Perfect 4181
Directions Toward Idealism in Cancer’s Neutrosophic Recognition Forwarding Neutrosophic 4182

SuperHyperClique on Neutrosophic SuperHyperGraphs” in Ref. [HG28] by Henry Garrett 4183

(2023), “Demonstrating Complete Connections in Every Embedded Regions and Sub-Regions in 4184
the Terms of Cancer’s Recognition and (Neutrosophic) SuperHyperGraphs With (Neutrosophic) 4185
SuperHyperClique” in Ref. [HG29] by Henry Garrett (2023), “Different Neutrosophic Types 4186
of Neutrosophic Regions titled neutrosophic Failed SuperHyperStable in Cancer’s Neutrosophic 4187
Recognition modeled in the Form of Neutrosophic SuperHyperGraphs” in Ref. [HG30] by 4188

Henry Garrett (2023), “Using the Tool As (Neutrosophic) Failed SuperHyperStable To SuperHy- 4189
perModel Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs” in Ref. [HG31] by 4190
Henry Garrett (2023), “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic 4191
SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints” in Ref. 4192
[HG32] by Henry Garrett (2023), “(Neutrosophic) SuperHyperStable on Cancer’s Recognition 4193
by Well-SuperHyperModelled (Neutrosophic) SuperHyperGraphs” in Ref. [HG33] by Henry 4194

Garrett (2023), “Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To Use 4195

Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond” in Ref. 4196
[HG34] by Henry Garrett (2022), “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s 4197
Recognitions And (Neutrosophic) SuperHyperGraphs” in Ref. [HG35] by Henry Garrett (2022), 4198
“Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic) SuperHyperModeling 4199
in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs” in Ref. [HG36] by Henry 4200

Garrett (2022), “Basic Neutrosophic Notions Concerning SuperHyperDominating and Neutro- 4201
sophic SuperHyperResolving in SuperHyperGraph” in Ref. [HG37] by Henry Garrett (2022), 4202
“Initial Material of Neutrosophic Preliminaries to Study Some Neutrosophic Notions Based 4203
on Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic SuperHyperGraph (NSHG)” in 4204
Ref. [HG38] by Henry Garrett (2022), and [HG4; HG5; HG6; HG7; HG8; HG9; HG10; 4205

HG11; HG12; HG13; HG14; HG15; HG16; HG17; HG18; HG19; HG20; HG21; 4206
HG22; HG23; HG24; HG25; HG26; HG27; HG28; HG29; HG30; HG31; HG32; 4207
HG33; HG34; HG35; HG36; HG37; HG38; HG94; HG942; HG95; HG952; HG96; 4208
HG962; HG97; HG972; HG98; HG982; HG106; HG107; HG111; HG112; HG115; 4209
HG116; HG120; HG121; HG122; HG123; HG124; HG125; HG126; HG127; HG128; 4210
HG129; HG130; HG131; HG132; HG134; HG135; HG136; HG137; HG138; HG139; 4211

HG140; HG141; HG142; HG143; HG144; HG145; HG146; HG147; HG148; HG149; 4212
HG150; HG151; HG152; HG153; HG154; HG155; HG156; HG157; HG158; HG159; 4213
HG160; HG161; HG162; HG163; HG164; HG165; HG166; HG167; HG168; HG169; 4214
HG170; HG171; HG172; HG173; HG174; HG175; HG176; HG177; HG178; HG179; 4215
HG180; HG181; HG182; HG183; HG184; HG185; HG186; HG187; HG188; HG189; 4216

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

HG190; HG191; HG192; HG193; HG194; HG195; HG196; HG197; HG198; HG199; 4217
HG200; HG201; HG202; HG203; HG204; HG205; HG206; HG207; HG208; HG209; 4218
HG210; HG211; HG212; HG213; HG214; HG215; HG216; HG217; HG218; HG219; 4219
HG220; HG221; HG222; HG223; HG224; HG225; HG226; HG228; HG230; HG231; 4220
HG232; HG233; HG234; HG235; HG236], there are some endeavors to formalize the 4221
basic SuperHyperNotions about neutrosophic SuperHyperGraph and SuperHyperGraph along- 4222

side scientific research books at [HG60b; HG61b; HG62b; HG63b; HG64b; HG65b; 4223
HG66b; HG67b; HG68b; HG69b; HG70b; HG71b; HG72b; HG73b; HG74b; 4224
HG75b; HG76b; HG77b; HG78b; HG79b; HG80b; HG81b; HG82b; HG83b; 4225
HG84b; HG85b; HG86b; HG87b; HG88b; HG89b; HG90b; HG91b; HG92b; 4226
HG93b; HG94b; HG95b; HG96b; HG97b; HG98b; HG99b; HG100b; HG101b; 4227
HG102b; HG103b; HG104b; HG105b; HG106b; HG107b; HG108b; HG109b; 4228

HG110b; HG111b; HG112b; HG113b; HG114b; HG115b; HG116b; HG117b; 4229

HG118b; HG119b; HG120b; HG121b; HG122b; HG123b; HG124b; HG125b; 4230
HG126b; HG127b; HG128b; HG129b; HG130b; HG131b; HG132b; HG133b; 4231
HG134b; HG135b; HG136b; HG137b; HG138b; HG139b; HG140b; HG141b; 4232
HG142b; HG143b; HG144b; HG145b; HG146b; HG147b; HG148b; HG149b; 4233
HG150b; HG151b; HG152b; HG153b; HG154b; HG155b]. Two popular scientific 4234

research books in Scribd in the terms of high readers, 4190 and 5189 respectively, on neutro- 4235
sophic science is on [HG32b; HG44b]. 4236
Some scientific studies and scientific researches about neutrosophic graphs, are proposed as book 4237
in Ref. [HG71b] by Henry Garrett (2023) which is indexed by Google Scholar and has more 4238
than 4216 readers in Scribd. It’s titled “Beyond Neutrosophic Graphs” and published by Dr. 4239
Henry Garrett. This research book covers different types of notions and settings in neutrosophic 4240

graph theory and neutrosophic SuperHyperGraph theory. 4241

Also, some scientific studies and scientific researches about neutrosophic graphs, are proposed 4242
as book in Ref. [HG70b] by Henry Garrett (2023) which is indexed by Google Scholar and 4243
has more than 5214 readers in Scribd. It’s titled “Neutrosophic Duality” and published by Dr. 4244
Henry Garrett. This research book presents different types of notions SuperHyperResolving and 4245
SuperHyperDominating in the setting of duality in neutrosophic graph theory and neutrosophic 4246

SuperHyperGraph theory. This research book has scrutiny on the complement of the intended set 4247
and the intended set, simultaneously. It’s smart to consider a set but acting on its complement 4248
that what’s done in this research book which is popular in the terms of high readers in Scribd. 4249
See the seminal scientific researches [HG1; HG2; HG3]. The formalization of the notions on 4250
the framework of notions in SuperHyperGraphs, Neutrosophic notions in SuperHyperGraphs the- 4251

ory, and (Neutrosophic) SuperHyperGraphs theory at [HG4; HG5; HG6; HG7; HG8; HG9; 4252
HG10; HG11; HG12; HG13; HG14; HG15; HG16; HG17; HG18; HG19; HG20; 4253
HG21; HG22; HG23; HG24; HG25; HG26; HG27; HG28; HG29; HG30; HG31; 4254
HG32; HG33; HG34; HG35; HG36; HG37; HG38; HG94; HG942; HG95; HG952; 4255
HG96; HG962; HG97; HG972; HG98; HG982; HG106; HG107; HG111; HG112; 4256
HG115; HG116; HG120; HG121; HG122; HG123; HG124; HG125; HG126; HG127; 4257

HG128; HG129; HG130; HG131; HG132; HG134; HG135; HG136; HG137; HG138; 4258
HG139; HG140; HG141; HG142; HG143; HG144; HG145; HG146; HG147; HG148; 4259
HG149; HG150; HG151; HG152; HG153; HG154; HG155; HG156; HG157; HG158; 4260
HG159; HG160; HG161; HG162; HG163; HG164; HG165; HG166; HG167; HG168; 4261
HG169; HG170; HG171; HG172; HG173; HG174; HG175; HG176; HG177; HG178; 4262

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

HG179; HG180; HG181; HG182; HG183; HG184; HG185; HG186; HG187; HG188; 4263
HG189; HG190; HG191; HG192; HG193; HG194; HG195; HG196; HG197; HG198; 4264
HG199; HG200; HG201; HG202; HG203; HG204; HG205; HG206; HG207; HG208; 4265
HG209; HG210; HG211; HG212; HG213; HG214; HG215; HG216; HG217; HG218; 4266
HG219; HG220; HG221; HG222; HG223; HG224; HG225; HG226; HG228; HG230; 4267
HG231; HG232; HG233; HG234; HG235; HG236] alongside scientific research books 4268

at [HG60b; HG61b; HG62b; HG63b; HG64b; HG65b; HG66b; HG67b; HG68b; 4269
HG69b; HG70b; HG71b; HG72b; HG73b; HG74b; HG75b; HG76b; HG77b; 4270
HG78b; HG79b; HG80b; HG81b; HG82b; HG83b; HG84b; HG85b; HG86b; 4271
HG87b; HG88b; HG89b; HG90b; HG91b; HG92b; HG93b; HG94b; HG95b; 4272
HG96b; HG97b; HG98b; HG99b; HG100b; HG101b; HG102b; HG103b; HG104b; 4273
HG105b; HG106b; HG107b; HG108b; HG109b; HG110b; HG111b; HG112b; 4274

HG113b; HG114b; HG115b; HG116b; HG117b; HG118b; HG119b; HG120b; 4275

HG121b; HG122b; HG123b; HG124b; HG125b; HG126b; HG127b; HG128b; 4276
HG129b; HG130b; HG131b; HG132b; HG133b; HG134b; HG135b; HG136b; 4277
HG137b; HG138b; HG139b; HG140b; HG141b; HG142b; HG143b; HG144b; 4278
HG145b; HG146b; HG147b; HG148b; HG149b; HG150b; HG151b; HG152b; 4279
HG153b; HG154b; HG155b]. Two popular scientific research books in Scribd in the 4280

terms of high readers, 4216 and 5214 respectively, on neutrosophic science is on [HG32b; 4281
HG44b]. 4282

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 Bibliography 4283

HG1 [1] Henry Garrett, “Neutrosophic Co-degree and Neutrosophic Degree alongside Chromatic 4284

Numbers in the Setting of Some Classes Related to Neutrosophic Hypergraphs”, J Curr 4285
Trends Comp Sci Res 1(1) (2022) 06-14. 4286

HG2 [2] Henry Garrett, “Super Hyper Dominating and Super Hyper Resolving on Neutro- 4287

sophic Super Hyper Graphs and Their Directions in Game Theory and Neutrosophic 4288
Super Hyper Classes”, J Math Techniques Comput Math 1(3) (2022) 242-263. (doi: 4289
10.33140/JMTCM.01.03.09) 4290

HG3 [3] Henry Garrett, “Some Super Hyper Degrees and Co-Super Hyper Degrees on Neut- 4291
rosophic Super Hyper Graphs And Super Hyper Graphs Alongside Applications 4292
in Cancer’s Treatments”, J Math Techniques Comput Math 2(1) (2023) 35-47. 4293
(https://www.opastpublishers.com/open-access-articles/some-super-hyper-degrees-and- 4294
cosuper-hyper-degrees-on-neutrosophic-super-hyper-graphs-and-super-hyper-graphs- 4295

alongside-a.pdf) 4296

HG216 [4] Henry Garrett, “A Research on Cancers Recognition and Neutrosophic Super 4297
Hypergraph by Eulerian Super Hyper Cycles and Hamiltonian Sets as Hyper Cov- 4298

ering Versus Super separations”, J Math Techniques Comput Math 2(3) (2023) 4299
136-148. (https://www.opastpublishers.com/open-access-articles/a-research-on-cancers- 4300
recognition-and-neutrosophic-super-hypergraph-by-eulerian-super-hyper-cycles-and- 4301
hamiltonian-sets-.pdf) 4302

HG4 [5] Garrett, Henry. “0039 | Closing Numbers and Super-Closing Numbers as (Dual)Resolving 4303
and (Dual)Coloring alongside (Dual)Dominating in (Neutrosophic)n-SuperHyperGraph.” 4304
CERN European Organization for Nuclear Research - Zenodo, Nov. 2022. CERN 4305
European Organization for Nuclear Research, https://doi.org/10.5281/zenodo.6319942. 4306
https://oa.mg/work/10.5281/zenodo.6319942 4307

HG5 [6] Garrett, Henry. “0049 | (Failed)1-Zero-Forcing Number in Neutrosophic Graphs.” CERN 4308
European Organization for Nuclear Research - Zenodo, Feb. 2022. CERN European 4309
Organization for Nuclear Research, https://doi.org/10.13140/rg.2.2.35241.26724. ht- 4310

tps://oa.mg/work/10.13140/rg.2.2.35241.26724 4311

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

HG6 [7] Henry Garrett, “Extreme SuperHyperClique as the Firm Scheme of Confrontation under 4312
Cancer’s Recognition as the Model in The Setting of (Neutrosophic) SuperHyperGraphs”, 4313
Preprints 2023, 2023010308 (doi: 10.20944/preprints202301.0308.v1). 4314

HG7 [8] Henry Garrett, “Uncertainty On The Act And Effect Of Cancer Alongside The Foggy 4315
Positions Of Cells Toward Neutrosophic Failed SuperHyperClique inside Neutrosophic 4316
SuperHyperGraphs Titled Cancer’s Recognition”, Preprints 2023, 2023010282 (doi: 4317
10.20944/preprints202301.0282.v1). 4318

HG8 [9] Henry Garrett, “Neutrosophic Version Of Separates Groups Of Cells In Cancer’s 4319
Recognition On Neutrosophic SuperHyperGraphs”, Preprints 2023, 2023010267 (doi: 4320
10.20944/preprints202301.0267.v1). 4321

HG9 [10] Henry Garrett, “The Shift Paradigm To Classify Separately The Cells and Affected 4322
Cells Toward The Totality Under Cancer’s Recognition By New Multiple Definitions On 4323
the Sets Polynomials Alongside Numbers In The (Neutrosophic) SuperHyperMatching 4324

Theory Based on SuperHyperGraph and Neutrosophic SuperHyperGraph”, Preprints 2023, 4325

2023010265 (doi: 10.20944/preprints202301.0265.v1). 4326

HG10 [11] Henry Garrett, “Breaking the Continuity and Uniformity of Cancer In The Worst Case of 4327

Full Connections With Extreme Failed SuperHyperClique In Cancer’s Recognition Applied 4328
in (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010262,(doi: 10.20944/pre- 4329
prints202301.0262.v1). 4330

HG11 [12] Henry Garrett, “Neutrosophic Failed SuperHyperStable as the Survivors on the Cancer’s 4331
Neutrosophic Recognition Based on Uncertainty to All Modes in Neutrosophic SuperHy- 4332
perGraphs”, Preprints 2023, 2023010240 (doi: 10.20944/preprints202301.0240.v1). 4333

HG12 [13] Henry Garrett, “Extremism of the Attacked Body Under the Cancer’s Circumstances 4334
Where Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 4335
2023010224, (doi: 10.20944/preprints202301.0224.v1). 4336

HG13 [14] Henry Garrett, “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Recognitions 4337
And (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010105 (doi: 10.20944/pre- 4338
prints202301.0105.v1). 4339

HG14 [15] Henry Garrett, “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic 4340
SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints”, 4341
Preprints 2023, 2023010088 (doi: 10.20944/preprints202301.0088.v1). 4342

HG15 [16] Henry Garrett, “Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To 4343
Use Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond”, 4344
Preprints 2023, 2023010044 4345

HG16 [17] Henry Garrett, “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well- 4346
SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010043 4347
(doi: 10.20944/preprints202301.0043.v1). 4348

HG17 [18] Henry Garrett, “Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic) 4349
SuperHyperModeling in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs”, 4350

Preprints 2023, 2023010105 (doi: 10.20944/preprints202301.0105.v1). 4351

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

HG18 [19] Henry Garrett, “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic 4352
SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints”, 4353
Preprints 2023, 2023010088 (doi: 10.20944/preprints202301.0088.v1). 4354

HG19 [20] Henry Garrett, “(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions Featuring 4355
(Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, Preprints 2022, 2022120549 4356

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

HG20 [21] Henry Garrett, “(Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and Su- 4358
perHyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With (Neut- 4359
rosophic) SuperHyperModeling of Cancer’s Recognitions And Related (Neutrosophic) Su- 4360
perHyperClasses”, Preprints 2022, 2022120540 (doi: 10.20944/preprints202212.0540.v1). 4361

HG21 [22] Henry Garrett, “SuperHyperGirth on SuperHyperGraph and Neutrosophic SuperHyper- 4362
Graph With SuperHyperModeling of Cancer’s Recognitions”, Preprints 2022, 2022120500 4363
(doi: 10.20944/preprints202212.0500.v1). 4364

HG22 [23] Henry Garrett, “Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic 4365
SuperHyperGraphs and SuperHyperGraphs Alongside Applications in Cancer’s Treatments”, 4366
Preprints 2022, 2022120324 (doi: 10.20944/preprints202212.0324.v1). 4367

HG23 [24] Henry Garrett, “SuperHyperDominating and SuperHyperResolving on Neutrosophic Super- 4368
HyperGraphs And Their Directions in Game Theory and Neutrosophic SuperHyperClasses”, 4369
Preprints 2022, 2022110576 (doi: 10.20944/preprints202211.0576.v1). 4370

HG236 [25] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph 4371
By Hamiltonian-Type-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 4372

2023, (doi: 10.5281/zenodo.7806767). 4373

HG235 [26] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Hamiltonian-Type- 4374
Cycle-Neighbor In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 4375
2023, (doi: 10.5281/zenodo.7806838). 4376

HG234 [27] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph 4377

By Hamiltonian-Type-Cycle-Decomposition As Hyper Decompress On Super Decompensa- 4378

tion”, Zenodo 2023, (doi: 10.5281/zenodo.7804238). 4379

HG233 [28] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of 4380
Hamiltonian-Type-Cycle-Decomposition In Cancer’s Recognition With (Neutrosophic) 4381
SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zenodo.7804228). 4382

HG232 [29] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph 4383
By Hamiltonian-Type-Cycle-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, 4384
(doi: 10.5281/zenodo.7799902). 4385

HG231 [30] Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Type- 4386
Cycle-Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 4387

2023, (doi: 10.5281/zenodo.7804218). 4388

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

HG230 [31] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph 4389
By Hamiltonian-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, 4390
(doi: 10.5281/zenodo.7796334). 4391

HG228 [32] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph 4392
By Hamiltonian-Cycle-Decomposition As Hyper Decompress On Super Decompensation”, 4393
Zenodo 2023, (doi: 10.5281/zenodo.7793372). 4394

HG226 [33] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph 4395
By Hamiltonian-Cycle-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi: 4396
10.5281/zenodo.7791952). 4397

HG225 [34] Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Cycle- 4398
Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 4399
10.5281/zenodo.7791982). 4400

HG224 [35] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph 4401
By Hamiltonian-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 4402
10.5281/zenodo.7790026). 4403

HG223 [36] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Hamiltonian-Neighbor 4404
In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 4405
10.5281/zenodo.7790052). 4406

HG222 [37] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph 4407
By Hamiltonian-Decomposition As Hyper Decompress On Super Decompensation”, Zenodo 4408
2023, (doi: 10.5281/zenodo.7787066). 4409

HG221 [38] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of 4410
Hamiltonian-Decomposition In Recognition of Cancer With (Neutrosophic) SuperHy- 4411
perGraph”, Zenodo 2023, (doi: 10.5281/zenodo.7787094). 4412

HG220 [39] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph 4413
By Hamiltonian-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi: 4414
10.5281/zenodo.7781476). 4415

HG219 [40] Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Cut 4416
In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 4417
10.5281/zenodo.7783082). 4418

HG218 [41] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyper- 4419
Graph By Trace-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 4420
10.5281/zenodo.7777857). 4421

HG217 [42] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Trace-Neighbor 4422
In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 4423
10.5281/zenodo.7779286). 4424

HG215 [43] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 4425
By Trace-Decomposition As Hyper Decompress On Super Decompensation”, Zenodo 2023, 4426

(doi: 10.5281/zenodo.7771831). 4427

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

HG214 [44] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of Trace- 4428
Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 4429
2023, (doi: 10.5281/zenodo.7772468). 4430

HG213 [45] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 4431
By Trace-Cut As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 4432
10.13140/RG.2.2.20913.25446). 4433

HG212 [46] Henry Garrett, “New Ideas On Super Tract By Hyper Track Of Trace-Cut In Cancer’s 4434
Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zen- 4435
odo.7764916). 4436

HG211 [47] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 4437
By Edge-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 4438
10.13140/RG.2.2.11770.98247). 4439

HG210 [48] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Edge-Neighbor In 4440
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 4441
10.13140/RG.2.2.12400.12808). 4442

HG209 [49] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 4443
By Edge-Decomposition As Hyper Decompress On Super Decompensation”, ResearchGate 4444
2023, (doi: 10.13140/RG.2.2.22545.10089). 4445

HG208 [50] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of 4446
Edge-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 4447
ResearchGate 2023, (doi: 10.13140/RG.2.2.29544.34564). 4448

HG207 [51] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyper- 4449
Graph By Edge-Cut As Hyper Edify On Super Eddy”, ResearchGate 2023, (doi: 4450
10.13140/RG.2.2.11377.76644). 4451

HG206 [52] Henry Garrett, “New Ideas On Super Eddy By Hyper Edify Of Edge-Cut In Can- 4452
cer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 4453
10.13140/RG.2.2.23750.96329). 4454

HG205 [53] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 4455
By Vertex-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 4456
10.13140/RG.2.2.31366.24641). 4457

HG204 [54] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Vertex-Neighbor In 4458
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 4459
10.13140/RG.2.2.34721.68960). 4460

HG203 [55] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 4461
By Vertex-Decomposition As Hyper Decompress On Super Decompensation”, ResearchGate 4462
2023, (doi: 10.13140/RG.2.2.30212.81289). 4463

HG202 [56] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of 4464
Vertex-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 4465

ResearchGate 2023, (doi: 10.13140/RG.2.2.18468.76169). 4466

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

HG201 [57] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyper- 4467
Graph By Vertex-Cut As Hyper Vertu On Super Vertigo”, ResearchGate 2023, (doi: 4468
10.13140/RG.2.2.24288.35842). 4469

HG200 [58] Henry Garrett, “New Ideas On Super Vertigo By Hyper Vertu Of Vertex-Cut In 4470
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 4471
10.13140/RG.2.2.32467.25124). 4472

HG199 [59] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 4473
By Stable-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 4474
10.13140/RG.2.2.31025.45925). 4475

HG198 [60] Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of Stable-Neighbor In 4476
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 4477
10.13140/RG.2.2.17184.25602). 4478

HG197 [61] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 4479
By Stable-Decompositions As Hyper Stain On Super Stagy”, ResearchGate 2023, (doi: 4480
10.13140/RG.2.2.23423.28327). 4481

HG196 [62] Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Decompositions In 4482
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 4483
10.13140/RG.2.2.28456.44805). 4484

HG195 [63] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyper- 4485
Graph By Stable-Cut As Hyper Stain On Super Stagy”, ResearchGate 2023, (doi: 4486
10.13140/RG.2.2.23525.68320). 4487

HG194 [64] Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Cut In Can- 4488
cer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 4489
10.13140/RG.2.2.20170.24000). 4490

HG193 [65] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 4491
By Clique-Neighbors As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 4492
10.13140/RG.2.2.36475.59683). 4493

HG192 [66] Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of Clique-Neighbors In 4494
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 4495
10.13140/RG.2.2.29764.71046). 4496

HG191 [67] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 4497
By Clique-Decompositions As Hyper Decompile On Super Decommission”, ResearchGate 4498
2023, (doi: 10.13140/RG.2.2.18780.87683). 4499

HG190 [68] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of 4500
Clique- Decompositions In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 4501
ResearchGate 2023, (doi: 10.13140/RG.2.2.27169.48487). 4502

HG189 [69] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyper- 4503
Graph By Clique-Cut As Hyper Click On Super Cliche”, ResearchGate 2023, (doi: 4504

10.13140/RG.2.2.26134.01603). 4505

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

HG188 [70] Henry Garrett, “New Ideas On Super Cliff By Hyper Cling Of Clique-Cut In Can- 4506
cer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 4507
10.13140/RG.2.2.27392.30721). 4508

HG187 [71] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHy- 4509
perGraph By Space As Hyper Spin On Super Spacy”, ResearchGate 2023, (doi: 4510
10.13140/RG.2.2.33028.40321). 4511

HG186 [72] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyper- 4512
Graph By List- Coloring As Hyper List On Super Lisle”, ResearchGate 2023, (doi: 4513
10.13140/RG.2.2.21389.20966). 4514

HG185 [73] Henry Garrett, “New Ideas On Super Lith By Hyper Lite Of List-Coloring In 4515
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 4516
10.13140/RG.2.2.16356.04489). 4517

HG184 [74] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHy- 4518
perGraph By Space As Hyper Sparse On Super Spark”, ResearchGate 2023, (doi: 4519
10.13140/RG.2.2.21756.21129). 4520

HG183 [75] Henry Garrett, “New Ideas On Super Solidarity By Hyper Soul Of Space In 4521
Cancer’s Recognition With (Extreme) SuperHyperGraph”, ResearchGate 2023, (doi: 4522
10.13140/RG.2.2.30983.68009). 4523

HG182 [76] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 4524
By Edge-Connectivity As Hyper Disclosure On Super Closure”, ResearchGate 2023, (doi: 4525
10.13140/RG.2.2.28552.29445). 4526

HG181 [77] Henry Garrett, “New Ideas On Super Uniform By Hyper Deformation Of Edge- 4527
Connectivity In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchG- 4528
ate 2023, (doi: 10.13140/RG.2.2.10936.21761). 4529

HG180 [78] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 4530
By Vertex-Connectivity As Hyper Leak On Super Structure”, ResearchGate 2023, (doi: 4531
10.13140/RG.2.2.35105.89447). 4532

HG179 [79] Henry Garrett, “New Ideas On Super System By Hyper Explosions Of Vertex-Connectivity 4533
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, 4534
(doi: 10.13140/RG.2.2.30072.72960). 4535

HG178 [80] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 4536
By Tree-Decomposition As Hyper Forward On Super Returns”, ResearchGate 2023, (doi: 4537
10.13140/RG.2.2.31147.52003). 4538

HG177 [81] Henry Garrett, “New Ideas On Super Nodes By Hyper Moves Of Tree-Decomposition In 4539
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 4540
10.13140/RG.2.2.32825.24163). 4541

HG176 [82] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyper- 4542
Graph By Chord As Hyper Excellence On Super Excess”, ResearchGate 2023, (doi: 4543

10.13140/RG.2.2.13059.58401). 4544

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

HG175 [83] Henry Garrett, “New Ideas On Super Gap By Hyper Navigations Of Chord In 4545
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 4546
10.13140/RG.2.2.11172.14720). 4547

HG174 [84] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 4548
By SuperHyper(i,j)-Domination As Hyper Controller On Super Waves”, ResearchGate 4549
2023, (doi: 10.13140/RG.2.2.22011.80165). 4550

HG173 [85] Henry Garrett, “New Ideas On Super Coincidence By Hyper Routes Of SuperHyper(i,j)- 4551
Domination In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchG- 4552
ate 2023, (doi: 10.13140/RG.2.2.30819.84003). 4553

HG172 [86] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 4554
By SuperHyperEdge-Domination As Hyper Reversion On Super Indirection”, ResearchGate 4555
2023, (doi: 10.13140/RG.2.2.10493.84962). 4556

HG171 [87] Henry Garrett, “New Ideas On Super Obstacles By Hyper Model Of SuperHyperEdge- 4557
Domination In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchG- 4558
ate 2023, (doi: 10.13140/RG.2.2.13849.29280). 4559

HG170 [88] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 4560
By SuperHyperK-Domination As Hyper k-Actions On Super Patterns”, ResearchGate 4561
2023, (doi: 10.13140/RG.2.2.19944.14086). 4562

HG169 [89] Henry Garrett, “New Ideas On Super Harmony By Hyper k-Function Of SuperHyperK- 4563
Domination In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchG- 4564
ate 2023, (doi: 10.13140/RG.2.2.23299.58404). 4565

HG168 [90] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 4566
By SuperHyperK-Number As Hyper k-Partition On Super Layers”, ResearchGate 2023, 4567
(doi: 10.13140/RG.2.2.33103.76968). 4568

HG167 [91] Henry Garrett, “New Ideas On Super Gradient By Hyper k-Class Of SuperHyperK-Number 4569
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, 4570
(doi: 10.13140/RG.2.2.23037.44003). 4571

HG166 [92] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 4572
By SuperHyperOrder As Hyper Enumerations On Super Landmarks”, ResearchGate 2023, 4573
(doi: 10.13140/RG.2.2.35646.56641). 4574

HG165 [93] Henry Garrett, “New Ideas On Super Analogous By Hyper Visions Of SuperHyperOrder 4575
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, 4576
(doi: 10.13140/RG.2.2.18030.48967). 4577

HG164 [94] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 4578
By SuperHyperColoring As Hyper Categories On Super Neighbors”, ResearchGate 2023, 4579
(doi: 10.13140/RG.2.2.13973.81121). 4580

HG163 [95] Henry Garrett, “New Ideas On Super Relations By Hyper Identifications Of SuperHyper- 4581
Coloring In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 4582

2023, (doi: 10.13140/RG.2.2.34106.47047). 4583

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

HG162 [96] Henry Garrett, “New Ideas On Super Contradiction By Hyper Detection of SuperHyper- 4584
Defensive In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 4585
ResearchGate 2023, (doi: 10.13140/RG.2.2.13397.09446). 4586

HG161 [97] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 4587
By SuperHyperDimension As Hyper Distinguishing On Super Distances”, ResearchGate 4588
2023, (doi: 10.13140/RG.2.2.31956.88961). 4589

HG160 [98] Henry Garrett, “New Ideas On Super Locations By Hyper Differing Of SuperHyperDi- 4590
mension In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 4591
2023, (doi: 10.13140/RG.2.2.15179.67361). 4592

HG159 [99] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 4593
By SuperHyperDominating As Hyper Closing On Super Messy”, ResearchGate 2023, (doi: 4594
10.13140/RG.2.2.21510.45125). 4595

HG158 [100] Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDom- 4596
inating In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 4597
2023, (doi: 10.13140/RG.2.2.13121.84321). 4598

HG157 [101] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 4599
By SuperHyperConnected As Hyper Group On Super Surge”, ResearchGate 2023, (doi: 4600
10.13140/RG.2.2.11758.69441). 4601

HG156 [102] Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of SuperHyperCon- 4602
nected In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 4603
2023, (doi: 10.13140/RG.2.2.31891.35367). 4604

HG155 [103] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 4605
By SuperHyperTotal As Hyper Covering On Super Infections”, ResearchGate 2023, (doi: 4606
10.13140/RG.2.2.19360.87048). 4607

HG154 [104] Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal 4608
In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 4609
10.13140/RG.2.2.32363.21286). 4610

HG153 [105] Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect 4611
In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 4612
10.13140/RG.2.2.23266.81602). 4613

HG152 [106] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 4614
By SuperHyperPerfect As Hyper Idealism On Super Vacancy”, ResearchGate 2023, (doi: 4615
10.13140/RG.2.2.19911.37285). 4616

HG151 [107] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 4617
By SuperHyperJoin As Hyper Separations On Super Sorts”, ResearchGate 2023, (doi: 4618
10.13140/RG.2.2.11050.90569). 4619

HG150 [108] Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of SuperHy- 4620
perJoin In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 4621

2023, (doi: 10.13140/RG.2.2.17761.79206). 4622

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

HG149 [109] Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of Super- 4623
HyperDuality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 4624
ResearchGate 2023, (doi: 10.13140/RG.2.2.34953.52320). 4625

HG148 [110] Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph 4626
By SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchG- 4627
ate 2023, (doi: 10.13140/RG.2.2.33275.80161). 4628

HG147 [111] Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph 4629
By Path SuperHyperColoring As Hyper Correction On Super Faults”, ResearchGate 2023, 4630
(doi: 10.13140/RG.2.2.30182.50241). 4631

HG146 [112] Henry Garrett, “New Ideas On Super Reflections By Hyper Rotations Of Path SuperHy- 4632
perColoring In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 4633
ResearchGate 2023, (doi: 10.13140/RG.2.2.33459.30243). 4634

HG145 [113] Henry Garrett, “New Ideas As Hyper Deformations On Super Chains In Cancer’s 4635
Neutrosophic Recognition and Neutrosophic SuperHyperGraph By SuperHyperDensity”, 4636
ResearchGate 2023, (doi: 10.13140/RG.2.2.13444.60806). 4637

HG144 [114] Henry Garrett, “New Ideas As Hyper Ignorance By SuperHyperDensity On Super 4638
Resistances In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 4639
ResearchGate 2023, (doi:10.13140/RG.2.2.16800.05123). 4640

HG143 [115] Henry Garrett, “New Research On Cancer’s Recognition and Neutrosophic SuperHyper- 4641
Graph By Eulerian SuperHyperCycles and Hamiltonian Sets As Hyper Covering Versus 4642
Super separations-VI”, ResearchGate 2023, (doi: 10.13140/RG.2.2.29913.80482). 4643

HG142 [116] Henry Garrett, “New Research On Cancer’s Recognition and Neutrosophic SuperHyper- 4644
Graph By Eulerian SuperHyperCycles and Hamiltonian Sets As Hyper Covering Versus 4645
Super separations-V”, ResearchGate 2023, (doi: 10.13140/RG.2.2.33269.24809). 4646

HG141 [117] Henry Garrett, “New Research On Cancer’s Recognition and Neutrosophic SuperHyper- 4647
Graph By Eulerian SuperHyperCycles and Hamiltonian Sets As Hyper Covering Versus 4648
Super separations-IV”, ResearchGate 2023, (doi: 10.13140/RG.2.2.34946.96960). 4649

HG140 [118] Henry Garrett, “A Research On Cancer’s Recognition and Neutrosophic SuperHyperGraph 4650
By Eulerian SuperHyperCycles and Hamiltonian Sets As Hyper Covering Versus Super 4651
separations-III”, ResearchGate 2023, (doi: 10.13140/RG.2.2.14814.31040). 4652

HG139 [119] Henry Garrett, “A Research On Cancer’s Recognition and Neutrosophic SuperHyperGraph 4653
By Eulerian SuperHyperCycles and Hamiltonian Sets As Hyper Covering Versus Super 4654
separations-II”, ResearchGate 2023, (doi: 10.13140/RG.2.2.15653.17125). 4655

HG138 [120] Henry Garrett, “A Research On Cancer’s Recognition and Neutrosophic SuperHyperGraph 4656
By Eulerian SuperHyperCycles and Hamiltonian Sets As Hyper Covering Versus Super 4657
separations-I”, ResearchGate 2023, (doi: 10.13140/RG.2.2.25719.50089). 4658

HG137 [121] Henry Garrett, “New Ideas On Super Disruptions In Cancer’s Extreme Recognition 4659
As Neutrosophic SuperHyperGraph By Hyper Plans Called SuperHyperConnectivities”, 4660

ResearchGate 2023, (doi: 10.13140/RG.2.2.29441.94562). 4661

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

HG136 [122] Henry Garrett, “Cancer’s Neutrosophic Recognition As Neutrosophic SuperHyperGraph 4662
By SuperHyperConnectivities As Hyper Diagnosis On Super Mechanism”, ResearchGate 4663
2023, (doi: 10.13140/RG.2.2.17252.24968). 4664

HG135 [123] Henry Garrett,“Cancer’s Recognition and (Neutrosophic) SuperHyperGraph By the 4665
Criteria of Eulerian and Hamiltonian Type-Sets As Hyper Modified Cycles On Super 4666
Mess”, ResearchGate 2023,(doi: 10.13140/RG.2.2.16652.59525). 4667

HG134 [124] Henry Garrett,“Eulerian and Hamiltonian In Cancer’s Neutrosophic Recognition and 4668

Neutrosophic SuperHyperGraph On Super Interactions By Hyper Extensions of Cycles”, 4669

ResearchGate 2023,(doi: 10.13140/RG.2.2.34583.24485). 4670

HG132 [125] Henry Garrett,“SuperHyperGirth Type-Results on extreme SuperHyperGirth theory and 4671

(Neutrosophic) SuperHyperGraphs Toward Cancer’s extreme Recognition”, Preprints 2023, 4672

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

HG131 [126] Henry Garrett,“Neutrosophic SuperHyperGraphs Warns Hyper Landmark of neutrosophic 4674
SuperHyperGirth In Super Type-Versions of Cancer’s neutrosophic Recognition”, Preprints 4675

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

HG130 [127] Henry Garrett,“The Constructions of (Neutrosophic) SuperHyperGraphs on the Cancer’s 4677
Recognition in The Confrontation With Super Attacks In Hyper Situations By Implement- 4678

ing (Neutrosophic) 1-Failed SuperHyperForcing in The Technical Approaches to Neutralize 4679

SuperHyperViews”, ResearchGate 2023, (doi: 10.13140/RG.2.2.26240.51204). 4680

HG129 [128] Henry Garrett,“(Neutrosophic) 1-Failed SuperHyperForcing As the Entrepreneurs on 4681

Cancer’s Recognitions To Fail Forcing Style As the Super Classes With Hyper Effects 4682

In The Background of the Framework is So-Called (Neutrosophic) SuperHyperGraphs”, 4683

ResearchGate 2023, (doi: 10.13140/RG.2.2.12818.73925). 4684

HG128 [129] Henry Garrett,“Super Actions On The Types of Hyper Levels In The Sensible Neutrosophic 4685

SuperHyperGirth On Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyper- 4686

Graph”, ResearchGate 2023,(doi: 10.13140/RG.2.2.26836.88960). 4687

HG127 [130] Henry Garrett,“SuperHyperGirth Approaches on the Super Challenges on the Cancer’s 4688
Recognition In the Hyper Model of (Neutrosophic) SuperHyperGraph”, ResearchGate 4689

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

HG126 [131] Henry Garrett,“Extreme SuperHyperClique as the Firm Scheme of Confrontation under 4691
Cancer’s Recognition as the Model in The Setting of (Neutrosophic) SuperHyperGraphs”, 4692

Preprints 2023, 2023010308 (doi: 10.20944/preprints202301.0308.v1). 4693

HG125 [132] Henry Garrett,“Uncertainty On The Act And Effect Of Cancer Alongside The Foggy 4694
Positions Of Cells Toward Neutrosophic Failed SuperHyperClique inside Neutrosophic 4695
SuperHyperGraphs Titled Cancer’s Recognition”, Preprints 2023, 2023010282 (doi: 4696

10.20944/preprints202301.0282.v1). 4697

HG124 [133] Henry Garrett,“Neutrosophic Version Of Separates Groups Of Cells In Cancer’s 4698
Recognition On Neutrosophic SuperHyperGraphs”, Preprints 2023, 2023010267 (doi: 4699

10.20944/preprints202301.0267.v1).). 4700

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

HG123 [134] Henry Garrett, “The Shift Paradigm To Classify Separately The Cells and Affected 4701
Cells Toward The Totality Under Cancer’s Recognition By New Multiple Definitions On 4702
the Sets Polynomials Alongside Numbers In The (Neutrosophic) SuperHyperMatching 4703
Theory Based on SuperHyperGraph and Neutrosophic SuperHyperGraph”, Preprints 2023, 4704
2023010265 (doi: 10.20944/preprints202301.0265.v1). 4705

HG122 [135] Henry Garrett,“Breaking the Continuity and Uniformity of Cancer In The Worst Case of 4706
Full Connections With Extreme Failed SuperHyperClique In Cancer’s Recognition Applied 4707
in (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010262,(doi: 10.20944/pre- 4708
prints202301.0262.v1). 4709

HG121 [136] Henry Garrett, “Neutrosophic Failed SuperHyperStable as the Survivors on the Cancer’s 4710
Neutrosophic Recognition Based on Uncertainty to All Modes in Neutrosophic SuperHy- 4711
perGraphs”, Preprints 2023, 2023010240 (doi: 10.20944/preprints202301.0240.v1). 4712

HG120 [137] Henry Garrett, “Extremism of the Attacked Body Under the Cancer’s Circumstances 4713
Where Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 4714
2023010224, (doi: 10.20944/preprints202301.0224.v1). 4715

HG24 [138] Henry Garrett,“SuperHyperMatching By (R-)Definitions And Polynomials To Monitor 4716

Cancer’s Recognition In Neutrosophic SuperHyperGraphs”, ResearchGate 2023,(doi: 4717

10.13140/RG.2.2.35061.65767). 4718

HG25 [139] Henry Garrett,“The Focus on The Partitions Obtained By Parallel Moves In The 4719

Cancer’s Extreme Recognition With Different Types of Extreme SuperHyperMatching 4720

Set and Polynomial on (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 4721
10.13140/RG.2.2.18494.15680). 4722

HG26 [140] Henry Garrett,“Extreme Failed SuperHyperClique Decides the Failures on the Can- 4723

cer’s Recognition in the Perfect Connections of Cancer’s Attacks By SuperHy- 4724

perModels Named (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 4725
10.13140/RG.2.2.32530.73922). 4726

HG27 [141] Henry Garrett,“Indeterminacy On The All Possible Connections of Cells In Front 4727

of Cancer’s Attacks In The Terms of Neutrosophic Failed SuperHyperClique on 4728

Cancer’s Recognition called Neutrosophic SuperHyperGraphs”, ResearchGate 2023, (doi: 4729
10.13140/RG.2.2.15897.70243). 4730

HG116 [142] Henry Garrett,“Extreme Failed SuperHyperClique Decides the Failures on the Can- 4731

cer’s Recognition in the Perfect Connections of Cancer’s Attacks By SuperHy- 4732

perModels Named (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 4733
10.13140/RG.2.2.32530.73922). 4734

HG115 [143] Henry Garrett, “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Recognitions 4735

And (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010105 (doi: 10.20944/pre- 4736

prints202301.0105.v1). 4737

HG28 [144] Henry Garrett,“Perfect Directions Toward Idealism in Cancer’s Neutrosophic Recogni- 4738
tion Forwarding Neutrosophic SuperHyperClique on Neutrosophic SuperHyperGraphs”, 4739

ResearchGate 2023, (doi: 10.13140/RG.2.2.30092.80004). 4740

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

HG29 [145] Henry Garrett,“Demonstrating Complete Connections in Every Embedded Regions 4741
and Sub-Regions in the Terms of Cancer’s Recognition and (Neutrosophic) Su- 4742
perHyperGraphs With (Neutrosophic) SuperHyperClique”, ResearchGate 2023, (doi: 4743
10.13140/RG.2.2.23172.19849). 4744

HG112 [146] Henry Garrett, “Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic) 4745
SuperHyperModeling in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs”, 4746
Preprints 2023, 2023010105 (doi: 10.20944/preprints202301.0105.v1). 4747

HG111 [147] Henry Garrett, “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic 4748
SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints”, 4749

Preprints 2023, 2023010088 (doi: 10.20944/preprints202301.0088.v1). 4750

HG30 [148] Henry Garrett,“Different Neutrosophic Types of Neutrosophic Regions titled neut- 4751
rosophic Failed SuperHyperStable in Cancer’s Neutrosophic Recognition modeled 4752
in the Form of Neutrosophic SuperHyperGraphs”, ResearchGate 2023, (doi: 4753

10.13140/RG.2.2.17385.36968). 4754

HG107 [149] Henry Garrett, “Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To 4755
Use Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond”, 4756
Preprints 2023, 2023010044 4757

HG106 [150] Henry Garrett, “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well- 4758
SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010043 4759
(doi: 10.20944/preprints202301.0043.v1). 4760

HG31 [151] Henry Garrett, “Using the Tool As (Neutrosophic) Failed SuperHyperStable To SuperHy- 4761

perModel Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs”, ResearchGate 4762

2023, (doi: 10.13140/RG.2.2.28945.92007). 4763

HG32 [152] Henry Garrett, “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic 4764
SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints”, 4765

ResearchGate 2023, (doi: 10.13140/RG.2.2.11447.80803). 4766

HG33 [153] Henry Garrett, “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well- 4767
SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 4768
10.13140/RG.2.2.35774.77123). 4769

HG34 [154] Henry Garrett, “Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To 4770
Use Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond”, 4771
ResearchGate 2022, (doi: 10.13140/RG.2.2.36141.77287). 4772

HG35 [155] Henry Garrett, “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Re- 4773

cognitions And (Neutrosophic) SuperHyperGraphs”, ResearchGate 2022, (doi: 4774

10.13140/RG.2.2.29430.88642). 4775

HG36 [156] Henry Garrett, “Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic) 4776
SuperHyperModeling in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs”, 4777

ResearchGate 2022, (doi: 10.13140/RG.2.2.11369.16487). 4778

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

HG982 [157] Henry Garrett, “(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions Featuring 4779
(Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, Preprints 2022, 2022120549 4780
(doi: 10.20944/preprints202212.0549.v1). 4781

HG98 [158] Henry Garrett, “(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions Featuring 4782

(Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, ResearchGate 2022, (doi: 4783

10.13140/RG.2.2.19380.94084). 4784

HG972 [159] Henry Garrett, “(Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and Su- 4785
perHyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With (Neut- 4786
rosophic) SuperHyperModeling of Cancer’s Recognitions And Related (Neutrosophic) Su- 4787

perHyperClasses”, Preprints 2022, 2022120540 (doi: 10.20944/preprints202212.0540.v1). 4788

HG97 [160] Henry Garrett, “(Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and 4789
SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With 4790
(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions And Related (Neutrosophic) 4791

SuperHyperClasses”, ResearchGate 2022, (doi: 10.13140/RG.2.2.14426.41923). 4792

HG962 [161] Henry Garrett, “SuperHyperGirth on SuperHyperGraph and Neutrosophic SuperHyper- 4793
Graph With SuperHyperModeling of Cancer’s Recognitions”, Preprints 2022, 2022120500 4794
(doi: 10.20944/preprints202212.0500.v1). 4795

HG96 [162] Henry Garrett, “SuperHyperGirth on SuperHyperGraph and Neutrosophic SuperHyper- 4796
Graph With SuperHyperModeling of Cancer’s Recognitions”, ResearchGate 2022 (doi: 4797
10.13140/RG.2.2.20993.12640). 4798

HG952 [163] Henry Garrett,“Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic 4799

SuperHyperGraphs and SuperHyperGraphs Alongside Applications in Cancer’s Treatments”, 4800

Preprints 2022, 2022120324 (doi: 10.20944/preprints202212.0324.v1). 4801

HG95 [164] Henry Garrett, “Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic Su- 4802
perHyperGraphs And SuperHyperGraphs Alongside Applications in Cancer’s Treatments”, 4803

ResearchGate 2022 (doi: 10.13140/RG.2.2.23123.04641). 4804

HG942 [165] Henry Garrett, “SuperHyperDominating and SuperHyperResolving on Neutrosophic Super- 4805
HyperGraphs And Their Directions in Game Theory and Neutrosophic SuperHyperClasses”, 4806
Preprints 2022, 2022110576 (doi: 10.20944/preprints202211.0576.v1). 4807

HG94 [166] Henry Garrett, “SuperHyperDominating and SuperHyperResolving on Neutrosophic Super- 4808
HyperGraphs And Their Directions in Game Theory and Neutrosophic SuperHyperClasses”, 4809
ResearchGate 2022 (doi: 10.13140/RG.2.2.23324.56966). 4810

HG37 [167] Henry Garrett, “Basic Neutrosophic Notions Concerning SuperHyperDominating and 4811

Neutrosophic SuperHyperResolving in SuperHyperGraph”, ResearchGate 2022 (doi: 4812

10.13140/RG.2.2.29173.86244). 4813

HG38 [168] Henry Garrett, “Initial Material of Neutrosophic Preliminaries to Study Some Neutro- 4814
sophic Notions Based on Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic Super- 4815

HyperGraph (NSHG)”, ResearchGate 2022 (doi: 10.13140/RG.2.2.25385.88160). 4816

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

HG155b [169] Henry Garrett, “Hamiltonian-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 4817
2023 (doi: 10.5281/zenodo.7804449). 4818

HG154b [170] Henry Garrett, “Hamiltonian-Cycle-Decomposition In SuperHyperGraphs”. Dr. Henry 4819

Garrett, 2023 (doi: 10.5281/zenodo.7793875). 4820

HG153b [171] Henry Garrett, “Hamiltonian-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 4821
(doi: 10.5281/zenodo.7792307). 4822

HG152b [172] Henry Garrett, “Hamiltonian-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 4823
(doi: 10.5281/zenodo.7790728). 4824

HG151b [173] Henry Garrett, “Hamiltonian-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 4825
2023 (doi: 10.5281/zenodo.7787712). 4826

HG150b [174] Henry Garrett, “Hamiltonian-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 4827
10.5281/zenodo.7783791). 4828

HG149b [175] Henry Garrett, “Trace-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 4829
10.5281/zenodo.7780123). 4830

HG148b [176] Henry Garrett, “Trace-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 4831
(doi: 10.5281/zenodo.7773119). 4832

HG147b [177] Henry Garrett, “SuperHyperDuality”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4833

odo.7637762). 4834

HG146b [178] Henry Garrett, “Trace-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 4835
10.5281/zenodo.7766174). 4836

HG145b [179] Henry Garrett, “Edge-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 4837
10.5281/zenodo.7762232). 4838

HG144b [180] Henry Garrett, “Edge-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 4839

(doi: 10.5281/zenodo.7758601). 4840

HG143b [181] Henry Garrett, “Edge-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 4841
10.5281/zenodo.7754661). 4842

HG142b [182] Henry Garrett, “Vertex-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 4843
10.5281/zenodo.7750995) . 4844

HG141b [183] Henry Garrett, “Vertex-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 4845

(doi: 10.5281/zenodo.7749875). 4846

HG140b [184] Henry Garrett, “Vertex-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 4847
10.5281/zenodo.7747236). 4848

HG139b [185] Henry Garrett, “Stable-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 4849
10.5281/zenodo.7742587). 4850

HG138b [186] Henry Garrett, “Stable-Decompositions In SuperHyperGraphs”. Dr. Henry Garrett, 2023 4851

(doi: 10.5281/zenodo.7738635). 4852

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

HG137b [187] Henry Garrett, “Stable-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 4853
10.5281/zenodo.7734719). 4854

HG136b [188] Henry Garrett, “Clique-Neighbors In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 4855
10.5281/zenodo.7730484). 4856

HG135b [189] Henry Garrett, “Clique-Decompositions In SuperHyperGraphs”. Dr. Henry Garrett, 2023 4857
(doi: 10.5281/zenodo.7730469). 4858

HG134b [190] Henry Garrett, “Clique-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 4859
10.5281/zenodo.7722865). 4860

HG133b [191] Henry Garrett, “Space In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4861
odo.7713563). 4862

HG132b [192] Henry Garrett, “Space In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4863
odo.7709116). 4864

HG131b [193] Henry Garrett, “Edge-Connectivity In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 4865
10.5281/zenodo.7706415). 4866

HG130b [194] Henry Garrett, “Vertex-Connectivity In SuperHyperGraphs”. Dr. Henry Garrett, 2023 4867
(doi: 10.5281/zenodo.7706063). 4868

HG129b [195] Henry Garrett, “Tree-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 4869

(doi: 10.5281/zenodo.7701906). 4870

HG128b [196] Henry Garrett, “Chord In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4871
odo.7700205). 4872

HG127b [197] Henry Garrett, “(i,j)-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 4873
10.5281/zenodo.7694876). 4874

HG126b [198] Henry Garrett, “Edge-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 4875

10.5281/zenodo.7679410). 4876

HG125b [199] Henry Garrett, “K-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 4877
10.5281/zenodo.7675982). 4878

HG124b [200] Henry Garrett, “K-Number In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 4879
10.5281/zenodo.7672388). 4880

HG123b [201] Henry Garrett, “Order In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4881

odo.7668648). 4882

HG122b [202] Henry Garrett, “Coloring In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 4883
10.5281/zenodo.7662810). 4884

HG121b [203] Henry Garrett, “Dimension In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 4885
10.5281/zenodo.7659162). 4886

HG120b [204] Henry Garrett, “Cancer In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 4887

10.5281/zenodo.7653233). 4888

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

HG119b [205] Henry Garrett, “SuperHyperWheel”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4889
odo.7653204). 4890

HG118b [206] Henry Garrett, “SuperHyperMultipartite”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4891
odo.7653142). 4892

HG117b [207] Henry Garrett, “SuperHyperBipartite”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4893
odo.7653117). 4894

HG116b [208] Henry Garrett, “SuperHyperStar”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4895
odo.7653089). 4896

HG115b [209] Henry Garrett, “SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4897
odo.7651687). 4898

HG114b [210] Henry Garrett, “SuperHyperPath”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4899
odo.7651619). 4900

HG113b [211] Henry Garrett, “SuperHyperDomination”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4901
odo.7651439). 4902

HG112b [212] Henry Garrett, “SuperHyperDominating”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4903
odo.7650729). 4904

HG111b [213] Henry Garrett, “SuperHyperConnected”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4905

odo.7647868). 4906

HG110b [214] Henry Garrett, “SuperHyperTotal”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4907
odo.7647017). 4908

HG109b [215] Henry Garrett, “SuperHyperPerfect”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4909
odo.7644894). 4910

HG108b [216] Henry Garrett, “SuperHyperJoin”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4911

odo.7641880). 4912

HG107b [217] Henry Garrett, “Path SuperHyperColoring”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4913
odo.7632923). 4914

HG106b [218] Henry Garrett, “SuperHyperDensity”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4915
odo.7623459). 4916

HG105b [219] Henry Garrett, “Neutrosophic SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 4917

10.5281/zenodo.7606416). 4918

HG104b [220] Henry Garrett, “Extreme SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 4919
10.5281/zenodo.7606416). 4920

HG103b [221] Henry Garrett, “SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4921
odo.7606404). 4922

HG102b [222] Henry Garrett, “Neutrosophic SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 4923

10.5281/zenodo.7580018). 4924

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

HG101b [223] Henry Garrett, “Extreme SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4925
odo.7580018). 4926

HG100b [224] Henry Garrett, “Extreme SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4927
odo.7580018). 4928

HG99b [225] Henry Garrett, “SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4929
odo.7579929). 4930

HG98b [226] Henry Garrett, “Neutrosophic SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 4931
10.5281/zenodo.7563170). 4932

HG97b [227] Henry Garrett, “Extreme SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4933
odo.7563164). 4934

HG96b [228] Henry Garrett, “SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4935
odo.7563160). 4936

HG95b [229] Henry Garrett, “Extreme SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4937
odo.7563160). 4938

HG94b [230] Henry Garrett, “Overlook On SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 4939
10.5281/zenodo.7563160). 4940

HG93b [231] Henry Garrett, “Neutrosophic SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 4941

10.5281/zenodo.7557063). 4942

HG92b [232] Henry Garrett, “Extreme SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 4943
10.5281/zenodo.7557009). 4944

HG91b [233] Henry Garrett, “Overlook On SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 4945
10.5281/zenodo.7539484). 4946

HG90b [234] Henry Garrett, “Neutrosophic Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 4947

10.5281/zenodo.7523390). 4948

HG89b [235] Henry Garrett, “Extreme Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 4949
10.5281/zenodo.7523390). 4950

HG88b [236] Henry Garrett, “Overlook On Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 4951
10.5281/zenodo.7523390). 4952

HG87b [237] Henry Garrett, “Extreme SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4953

odo.7574952). 4954

HG86b [238] Henry Garrett, “Neutrosophic SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 4955
10.5281/zenodo.7574992). 4956

HG85b [239] Henry Garrett, “Extreme SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4957
odo.7523357). 4958

HG84b [240] Henry Garrett, “Overlook On SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 4959

10.5281/zenodo.7523357). 4960

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

HG83b [241] Henry Garrett, “Neutrosophic Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 4961
10.5281/zenodo.7504782). 4962

HG82b [242] Henry Garrett, “Extreme Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 4963
10.5281/zenodo.7504782). 4964

HG81b [243] Henry Garrett, “Overlook On Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 4965
10.5281/zenodo.7504782). 4966

HG80b [244] Henry Garrett, “Neutrosophic SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 4967
10.5281/zenodo.7499395). 4968

HG79b [245] Henry Garrett, “Extreme SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4969
odo.7499395). 4970

HG78b [246] Henry Garrett, “Overlook On SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 4971
10.5281/zenodo.7499395). 4972

HG77b [247] Henry Garrett, “Neutrosophic Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 4973
10.5281/zenodo.7497450). 4974

HG76b [248] Henry Garrett, “Extreme Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 4975
10.5281/zenodo.7497450). 4976

HG75b [249] Henry Garrett, “Neutrosophic SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 4977

10.5281/zenodo.7494862). 4978

HG74b [250] Henry Garrett, “Extreme SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4979
odo.7494862). 4980

HG73b [251] Henry Garrett, “Overlook On SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 4981
10.5281/zenodo.7494862). 4982

HG72b [252] Henry Garrett, “Neutrosophic SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 4983

10.5281/zenodo.7493845). 4984

HG71b [253] Henry Garrett, “Extreme SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 4985
10.5281/zenodo.7493845). 4986

HG70b [254] Henry Garrett, “Overlook On SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 4987
10.5281/zenodo.7493845). 4988

HG69b [255] Henry Garrett, “SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4989

odo.7539484). 4990

HG68b [256] Henry Garrett, “Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4991
odo.7523390). 4992

HG67b [257] Henry Garrett, “SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4993
odo.7523357). 4994

HG66b [258] Henry Garrett, “Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4995

odo.7504782). 4996

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

HG65b [259] Henry Garrett, “SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4997
odo.7499395). 4998

HG64b [260] Henry Garrett, “Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4999
odo.7497450). 5000

HG63b [261] Henry Garrett, “SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 5001
odo.7494862). 5002

HG62b [262] Henry Garrett, “SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 5003

odo.7493845). 5004

HG61b [263] Henry Garrett, “SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 5005
odo.7480110). 5006

HG60b [264] Henry Garrett, “Neut. SuperHyperEdges”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 5007
odo.7378758). 5008

HG32b [265] Henry Garrett, “Beyond Neutrosophic Graphs”. Dr. Henry Garrett, 2023 (doi: 5009
10.5281/zenodo.6320305). 5010

HG44b [266] Henry Garrett, “Neutrosophic Duality”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 5011
odo.6677173). 5012

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 CHAPTER 24 5013

Cancer In Neutrosophic 5014

SuperHyperGraph 5015

The cancer is the Neutrosophic disease but the Neutrosophic model is going to figure out what’s 5016
going on this Neutrosophic phenomenon. The special Neutrosophic case of this Neutrosophic 5017
disease is considered and as the consequences of the model, some parameters are used. The 5018
cells are under attack of this disease but the moves of the cancer in the special region are the 5019

matter of mind. The Neutrosophic recognition of the cancer could help to find some Neutrosophic 5020
treatments for this Neutrosophic disease. 5021
In the following, some Neutrosophic steps are Neutrosophic devised on this disease. 5022

Step 1. (Neutrosophic Definition) The Neutrosophic recognition of the cancer in the long-term 5023
Neutrosophic function. 5024

Step 2. (Neutrosophic Issue) The specific region has been assigned by the Neutrosophic model 5025
[it’s called Neutrosophic SuperHyperGraph] and the long Neutrosophic cycle of the move 5026
from the cancer is identified by this research. Sometimes the move of the cancer hasn’t be 5027
easily identified since there are some determinacy, indeterminacy and neutrality about the 5028

moves and the effects of the cancer on that region; this event leads us to choose another 5029
model [it’s said to be Neutrosophic SuperHyperGraph] to have convenient perception on 5030
what’s happened and what’s done. 5031

Step 3. (Neutrosophic Model) There are some specific Neutrosophic models, which are well- 5032

known and they’ve got the names, and some general Neutrosophic models. The moves and 5033
the Neutrosophic traces of the cancer on the complex tracks and between complicated groups 5034
of cells could be fantasized by a Neutrosophic SuperHyperPath(-/SuperHyperK-Domination, 5035
SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The 5036
aim is to find either the Neutrosophic SuperHyperK-Domination or the Neutrosophic 5037
SuperHyperK-Domination in those Neutrosophic Neutrosophic SuperHyperModels. 5038

Some cells have been faced with some attacks from the situation which is caused by the 5039
cancer’s attacks. In this case, there are some embedded analysis on the ongoing situations 5040
which in that, the cells could be labelled as some groups and some groups or individuals have 5041
excessive labels which all are raised from the behaviors to overcome the cancer’s attacks. In 5042
the embedded situations, the individuals of cells and the groups of cells could be considered 5043

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

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

proper analysis on this messy story. I’ve found the SuperHyperModels which are officially 5045
called “SuperHyperGraphs” and “Neutrosophic SuperHyperGraphs”. In this SuperHyperModel, 5046
the cells and the groups of cells are defined as “SuperHyperVertices” and the relations between 5047
the individuals of cells and the groups of cells are defined as “SuperHyperEdges”. Thus it’s 5048
another motivation for us to do research on this SuperHyperModel based on the “Cancer’s 5049
Recognition”. Sometimes, the situations get worst. The situation is passed from the certainty 5050

and precise style. Thus it’s the beyond them. There are three descriptions, namely, the degrees 5051
of determinacy, indeterminacy and neutrality, for any object based on vague forms, namely, 5052
incomplete data, imprecise data, and uncertain analysis. The latter model could be considered on 5053
the previous SuperHyperModel. It’s SuperHyperModel. It’s SuperHyperGraph but it’s officially 5054
called “Neutrosophic SuperHyperGraphs”. The cancer is the disease but the model is going to 5055
figure out what’s going on this phenomenon. The special case of this disease is considered and 5056

as the consequences of the model, some parameters are used. The cells are under attack of this 5057
disease but the moves of the cancer in the special region are the matter of mind. The recognition 5058
of the cancer could help to find some treatments for this disease. The SuperHyperGraph and 5059
Neutrosophic SuperHyperGraph are the SuperHyperModels on the “Cancer’s Recognition” and 5060
both bases are the background of this research. Sometimes the cancer has been happened on the 5061
region, full of cells, groups of cells and embedded styles. In this segment, the SuperHyperModel 5062

proposes some SuperHyperNotions based on the connectivities of the moves of the cancer in the 5063
forms of alliances’ styles with the formation of the design and the architecture are formally called 5064
“ SuperHyperK-Domination” in the themes of jargons and buzzwords. The prefix “SuperHyper” 5065
refers to the theme of the embedded styles to figure out the background for the SuperHyperNotions. 5066
The recognition of the cancer in the long-term function. The specific region has been assigned 5067
by the model [it’s called SuperHyperGraph] and the long cycle of the move from the cancer is 5068

identified by this research. Sometimes the move of the cancer hasn’t be easily identified since 5069
there are some determinacy, indeterminacy and neutrality about the moves and the effects of the 5070
cancer on that region; this event leads us to choose another model [it’s said to be Neutrosophic 5071
SuperHyperGraph] to have convenient perception on what’s happened and what’s done. There are 5072
some specific models, which are well-known and they’ve got the names, and some general models. 5073
The moves and the traces of the cancer on the complex tracks and between complicated groups 5074

of cells could be fantasized by a Neutrosophic SuperHyperPath (-/SuperHyperK-Domination, 5075

SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim 5076
is to find either the optimal SuperHyperK-Domination or the Neutrosophic SuperHyperK- 5077
Domination in those Neutrosophic SuperHyperModels. Some general results are introduced. 5078
Beyond that in SuperHyperStar, all possible Neutrosophic SuperHyperPath s have only two 5079

SuperHyperEdges but it’s not enough since it’s essential to have at least three SuperHyperEdges 5080
to form any style of a SuperHyperK-Domination. There isn’t any formation of any SuperHyperK- 5081
Domination but literarily, it’s the deformation of any SuperHyperK-Domination. It, literarily, 5082
deforms and it doesn’t form. 5083

Question 24.0.1. How to define the SuperHyperNotions and to do research on them to find the “ 5084
amount of SuperHyperK-Domination” of either individual of cells or the groups of cells based on 5085
the fixed cell or the fixed group of cells, extensively, the “amount of SuperHyperK-Domination” 5086
based on the fixed groups of cells or the fixed groups of group of cells? 5087

Question 24.0.2. What are the best descriptions for the “Cancer’s Recognition” in terms of 5088

these messy and dense SuperHyperModels where embedded notions are illustrated? 5089

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

It’s motivation to find notions to use in this dense model is titled “SuperHyperGraphs”. Thus 5090
it motivates us to define different types of “ SuperHyperK-Domination” and “Neutrosophic 5091
SuperHyperK-Domination” on “SuperHyperGraph” and “Neutrosophic SuperHyperGraph”. Then 5092
the research has taken more motivations to define SuperHyperClasses and to find some 5093
connections amid this SuperHyperNotion with other SuperHyperNotions. It motivates us to get 5094
some instances and examples to make clarifications about the framework of this research. The 5095

general results and some results about some connections are some avenues to make key point of 5096
this research, “Cancer’s Recognition”, more understandable and more clear. 5097
Some SuperHyperClasses and some Neutrosophic SuperHyperClasses are the cases of this 5098
research on the modeling of the regions where are under the attacks of the cancer to 5099
recognize this disease as it’s mentioned on the title “Cancer’s Recognitions”. To formalize 5100
the instances on the SuperHyperNotion, SuperHyperK-Domination, the new SuperHyperClasses 5101

and SuperHyperClasses, are introduced. Some general results are gathered in the section on the 5102
SuperHyperK-Domination and the Neutrosophic SuperHyperK-Domination. The clarifications, 5103
instances and literature reviews have taken the whole way through. In this scientific research, 5104
the literature reviews have fulfilled the lines containing the notions and the results. The 5105
SuperHyperGraph and Neutrosophic SuperHyperGraph are the SuperHyperModels on the 5106
“Cancer’s Recognitions” and both bases are the background of this research. Sometimes the 5107

cancer has been happened on the region, full of cells, groups of cells and embedded styles. In 5108
this scientific segment, the SuperHyperModel proposes some SuperHyperNotions based on the 5109
connectivities of the moves of the cancer in the longest and strongest styles with the formation 5110
of the design and the architecture are formally called “ SuperHyperK-Domination” in the themes 5111
of jargons and buzzwords. The prefix “SuperHyper” refers to the theme of the embedded styles to 5112
figure out the background for the SuperHyperNotions. 5113

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 CHAPTER 25 5114

Neutrosophic 5115

Hamiltonian-Type-Cycle-Cut 5116

Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of SuperHyperDu- 5117
ality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, ResearchGate 5118
2023, (doi: 10.13140/RG.2.2.34953.52320). 5119
Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph By 5120
SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchGate 2023, 5121
(doi: 10.13140/RG.2.2.33275.80161). 5122

Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 5123
By SuperHyperJoin As Hyper Separations On Super Sorts”, ResearchGate 2023, (doi: 5124
10.13140/RG.2.2.11050.90569). 5125
Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of SuperHyperJoin 5126
In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 5127
10.13140/RG.2.2.17761.79206). 5128

Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 5129
By SuperHyperPerfect As Hyper Idealism On Super Vacancy”, ResearchGate 2023, (doi: 5130
10.13140/RG.2.2.19911.37285). 5131
Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect 5132
In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 5133
10.13140/RG.2.2.23266.81602). 5134

Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 5135
By SuperHyperTotal As Hyper Covering On Super Infections”, ResearchGate 2023, (doi: 5136
10.13140/RG.2.2.19360.87048). 5137
Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal 5138
In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 5139
10.13140/RG.2.2.32363.21286). 5140

Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 5141
By SuperHyperConnected As Hyper Group On Super Surge”, ResearchGate 2023, (doi: 5142
10.13140/RG.2.2.11758.69441). 5143
Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of SuperHyperConnected 5144
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 5145
10.13140/RG.2.2.31891.35367). 5146

Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 5147

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

By SuperHyperDominating As Hyper Closing On Super Messy”, ResearchGate 2023, (doi: 5148

10.13140/RG.2.2.21510.45125). 5149
Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDominating 5150
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 5151
10.13140/RG.2.2.13121.84321). 5152

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 CHAPTER 26 5153

New Ideas In Recognition of Cancer And 5154

Neutrosophic SuperHyperGraph By 5155

Hamiltonian-Type-Cycle-Cut As Hyper 5156

Hamper On Super Hammy 5157

247
 CHAPTER 27 5158

ABSTRACT 5159

In this scientific research, (Different Neutrosophic Types of Neutrosophic SuperHyperHamiltonian- 5160

Type-Cycle-Cut). Assume a Neutrosophic SuperHyperGraph (NSHG) S is a Hamiltonian-Type-Cycle- 5161

0
Cut pair S = (V, E). Consider a Neutrosophic SuperHyperSet V = {V1 , V2 , . . . , Vs } and 5162
0 0 0
E = {E1 , E2 , . . . , Ez }. Then either V or E is called Neutrosophic e-SuperHyperHamiltonian- 5163
Type-Cycle-Cut if the following expression is called Neutrosophic e-SuperHyperHamiltonian-Type-Cycle-Cut 5164
criteria holds 5165

∀Ea ∈ C : C is
a SuperHyperCycle and it has
the maximum number of SuperHyperVertices;
Neutrosophic re-SuperHyperHamiltonian-Type-Cycle-Cut if the following expression is called Neutro- 5166
sophic e-SuperHyperHamiltonian-Type-Cycle-Cut criteria holds 5167

∀Ea ∈ C : C is
a SuperHyperCycle and it has
the maximum number of SuperHyperVertices;
and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; Neutrosophic 5168
v-SuperHyperHamiltonian-Type-Cycle-Cut if the following expression is called Neutrosophic v- 5169
SuperHyperHamiltonian-Type-Cycle-Cut criteria holds 5170

∀Va ∈ C : C is
a SuperHyperCycle and it has
the maximum number of SuperHyperVertices;
Neutrosophic rv-SuperHyperHamiltonian-Type-Cycle-Cut if the following expression is called Neutro- 5171
sophic v-SuperHyperHamiltonian-Type-Cycle-Cut criteria holds 5172

∀Va ∈ C : C is
a SuperHyperCycle and it has
the maximum number of SuperHyperVertices;
and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; Neutrosophic 5173

SuperHyperHamiltonian-Type-Cycle-Cut if it’s either of Neutrosophic e-SuperHyperHamiltonian-Type-Cycle-Cut, 5174

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

Neutrosophic re-SuperHyperHamiltonian-Type-Cycle-Cut, Neutrosophic v-SuperHyperHamiltonian-Type-Cycle- 5175

Cut, and Neutrosophic rv-SuperHyperHamiltonian-Type-Cycle-Cut. ((Neutrosophic) SuperHyperHamiltonian- 5176
Type-Cycle-Cut). Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 5177
a Neutrosophic SuperHyperEdge (NSHE) E = {V1 , V2 , . . . , Vs }. Then E is called an Extreme 5178
SuperHyperHamiltonian-Type-Cycle-Cut if it’s either of Neutrosophic e-SuperHyperHamiltonian-Type-Cycle-Cut, 5179
Neutrosophic re-SuperHyperHamiltonian-Type-Cycle-Cut, Neutrosophic v-SuperHyperHamiltonian-Type-Cycle- 5180

Cut, and Neutrosophic rv-SuperHyperHamiltonian-Type-Cycle-Cut and C(N SHG) for an Extreme 5181
SuperHyperGraph N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHy- 5182
perSet S of high Extreme cardinality of the Extreme SuperHyperEdges in the conseNeighborive 5183
Extreme sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that 5184
they form the Extreme SuperHyperHamiltonian-Type-Cycle-Cut; a Neutrosophic SuperHyperHamiltonian- 5185
Type-Cycle-Cut if it’s either of Neutrosophic e-SuperHyperHamiltonian-Type-Cycle-Cut, Neutrosophic re- 5186

SuperHyperHamiltonian-Type-Cycle-Cut, Neutrosophic v-SuperHyperHamiltonian-Type-Cycle-Cut, and Neutro- 5187

sophic rv-SuperHyperHamiltonian-Type-Cycle-Cut and C(N SHG) for a Neutrosophic SuperHyperGraph 5188
N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges 5189
of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality conseNeighborive Neut- 5190
rosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the 5191
Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut; an Extreme SuperHyperHamiltonian-Type-Cycle-Cut 5192

SuperHyperPolynomial if it’s either of Neutrosophic e-SuperHyperHamiltonian-Type-Cycle-Cut, Neut- 5193

rosophic re-SuperHyperHamiltonian-Type-Cycle-Cut, Neutrosophic v-SuperHyperHamiltonian-Type-Cycle-Cut, 5194
and Neutrosophic rv-SuperHyperHamiltonian-Type-Cycle-Cut and C(N SHG) for an Extreme Supe- 5195
rHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme 5196
coefficients defined as the Extreme number of the maximum Extreme cardinality of the Extreme 5197
SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme cardinality conseNeighborive 5198

Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the Extreme 5199
SuperHyperHamiltonian-Type-Cycle-Cut; and the Extreme power is corresponded to its Extreme coeffi- 5200
cient; a Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut SuperHyperPolynomial if it’s either of 5201
Neutrosophic e-SuperHyperHamiltonian-Type-Cycle-Cut, Neutrosophic re-SuperHyperHamiltonian-Type-Cycle- 5202
Cut, Neutrosophic v-SuperHyperHamiltonian-Type-Cycle-Cut, and Neutrosophic rv-SuperHyperHamiltonian- 5203
Type-Cycle-Cut and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the 5204

Neutrosophic SuperHyperPolynomial contains the Neutrosophic coefficients defined as the 5205

Neutrosophic number of the maximum Neutrosophic cardinality of the Neutrosophic SuperHy- 5206
perEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality conseNeighborive 5207
Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the 5208
Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut; and the Neutrosophic power is corresponded to 5209

its Neutrosophic coefficient; an Extreme V-SuperHyperHamiltonian-Type-Cycle-Cut if it’s either of Neut- 5210

rosophic e-SuperHyperHamiltonian-Type-Cycle-Cut, Neutrosophic re-SuperHyperHamiltonian-Type-Cycle-Cut, 5211
Neutrosophic v-SuperHyperHamiltonian-Type-Cycle-Cut, and Neutrosophic rv-SuperHyperHamiltonian-Type- 5212
Cycle-Cut and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum 5213
Extreme cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme 5214
SuperHyperVertices in the conseNeighborive Extreme sequence of Extreme SuperHyperEdges 5215

and Extreme SuperHyperVertices such that they form the Extreme SuperHyperHamiltonian- 5216
Type-Cycle-Cut; a Neutrosophic V-SuperHyperHamiltonian-Type-Cycle-Cut if it’s either of Neutrosophic 5217
e-SuperHyperHamiltonian-Type-Cycle-Cut, Neutrosophic re-SuperHyperHamiltonian-Type-Cycle-Cut, Neutro- 5218
sophic v-SuperHyperHamiltonian-Type-Cycle-Cut, and Neutrosophic rv-SuperHyperHamiltonian-Type-Cycle-Cut 5219
and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutro- 5220

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

sophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S of 5221

high Neutrosophic cardinality conseNeighborive Neutrosophic SuperHyperEdges and Neutrosophic 5222
SuperHyperVertices such that they form the Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut; an 5223
Extreme V-SuperHyperHamiltonian-Type-Cycle-Cut SuperHyperPolynomial if it’s either of Neutrosophic 5224
e-SuperHyperHamiltonian-Type-Cycle-Cut, Neutrosophic re-SuperHyperHamiltonian-Type-Cycle-Cut, Neutro- 5225
sophic v-SuperHyperHamiltonian-Type-Cycle-Cut, and Neutrosophic rv-SuperHyperHamiltonian-Type-Cycle-Cut 5226

and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyper- 5227
Polynomial contains the Extreme coefficients defined as the Extreme number of the maximum 5228
Extreme cardinality of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of 5229
high Extreme cardinality conseNeighborive Extreme SuperHyperEdges and Extreme SuperHy- 5230
perVertices such that they form the Extreme SuperHyperHamiltonian-Type-Cycle-Cut; and the Extreme 5231
power is corresponded to its Extreme coefficient; a Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut 5232

SuperHyperPolynomial if it’s either of Neutrosophic e-SuperHyperHamiltonian-Type-Cycle-Cut, Neutro- 5233

sophic re-SuperHyperHamiltonian-Type-Cycle-Cut, Neutrosophic v-SuperHyperHamiltonian-Type-Cycle-Cut, and 5234
Neutrosophic rv-SuperHyperHamiltonian-Type-Cycle-Cut and C(N SHG) for a Neutrosophic SuperHy- 5235
perGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains the Neutrosophic 5236
coefficients defined as the Neutrosophic number of the maximum Neutrosophic cardinality of the 5237
Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic car- 5238

dinality conseNeighborive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices 5239

such that they form the Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut; and the Neutrosophic 5240
power is corresponded to its Neutrosophic coefficient. In this scientific research, new setting 5241
is introduced for new SuperHyperNotions, namely, a SuperHyperHamiltonian-Type-Cycle-Cut and 5242
Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut. Two different types of SuperHyperDefinitions 5243
are debut for them but the research goes further and the SuperHyperNotion, SuperHyperUniform, 5244

and SuperHyperClass based on that are well-defined and well-reviewed. The literature review is 5245
implemented in the whole of this research. For shining the elegancy and the significancy of this 5246
research, the comparison between this SuperHyperNotion with other SuperHyperNotions and 5247
fundamental SuperHyperNumbers are featured. The definitions are followed by the examples 5248
and the instances thus the clarifications are driven with different tools. The applications are 5249
figured out to make sense about the theoretical aspect of this ongoing research. The “Cancer’s 5250

Recognition” are the under research to figure out the challenges make sense about ongoing and 5251
upcoming research. The special case is up. The cells are viewed in the deemed ways. There 5252
are different types of them. Some of them are individuals and some of them are well-modeled 5253
by the group of cells. These types are all officially called “SuperHyperVertex” but the relations 5254
amid them all officially called “SuperHyperEdge”. The frameworks “SuperHyperGraph” and 5255

“Neutrosophic SuperHyperGraph” are chosen and elected to research about “Cancer’s Recog- 5256
nition”. Thus these complex and dense SuperHyperModels open up some avenues to research 5257
on theoretical segments and “Cancer’s Recognition”. Some avenues are posed to pursue this 5258
research. It’s also officially collected in the form of some questions and some problems. Assume 5259
a SuperHyperGraph. Assume a SuperHyperGraph. Then δ−SuperHyperHamiltonian-Type-Cycle-Cut 5260
is a maximal of SuperHyperVertices with a maximum cardinality such that either of the 5261

following expressions hold for the (Neutrosophic) cardinalities of SuperHyperNeighbors of 5262

s ∈ S : there are |S ∩ N (s)| > |S ∩ (V \ N (s))| + δ; and |S ∩ N (s)| < |S ∩ (V \ N (s))| + δ. The 5263
first Expression, holds if S is an δ−SuperHyperOffensive. And the second Expression, holds 5264
if S is an δ−SuperHyperDefensive; a Neutrosophic δ−SuperHyperHamiltonian-Type-Cycle-Cut is a 5265
maximal Neutrosophic of SuperHyperVertices with maximum Neutrosophic cardinality such 5266

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

that either of the following expressions hold for the Neutrosophic cardinalities of SuperHy- 5267
perNeighbors of s ∈ S there are: |S ∩ N (s)|N eutrosophic > |S ∩ (V \ N (s))|N eutrosophic + δ; 5268
and |S ∩ N (s)|N eutrosophic < |S ∩ (V \ N (s))|N eutrosophic + δ. The first Expression, holds if S is 5269
a Neutrosophic δ−SuperHyperOffensive. And the second Expression, holds if S is a Neutrosophic 5270
δ−SuperHyperDefensive It’s useful to define a “Neutrosophic” version of a SuperHyperHamiltonian- 5271
Type-Cycle-Cut . Since there’s more ways to get type-results to make a SuperHyperHamiltonian-Type-Cycle- 5272

Cut more understandable. For the sake of having Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut, 5273
there’s a need to “redefine” the notion of a “SuperHyperHamiltonian-Type-Cycle-Cut ”. The SuperHy- 5274
perVertices and the SuperHyperEdges are assigned by the labels from the letters of the alphabets. 5275
In this procedure, there’s the usage of the position of labels to assign to the values. Assume a 5276
SuperHyperHamiltonian-Type-Cycle-Cut . It’s redefined a Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut 5277
if the mentioned Table holds, concerning, “The Values of Vertices, SuperVertices, Edges, 5278

HyperEdges, and SuperHyperEdges Belong to The Neutrosophic SuperHyperGraph” with the key 5279
points, “The Values of The Vertices & The Number of Position in Alphabet”, “The Values 5280
of The SuperVertices&The maximum Values of Its Vertices”, “The Values of The Edges&The 5281
maximum Values of Its Vertices”, “The Values of The HyperEdges&The maximum Values of 5282
Its Vertices”, “The Values of The SuperHyperEdges&The maximum Values of Its Endpoints”. 5283
To get structural examples and instances, I’m going to introduce the next SuperHyperClass 5284

of SuperHyperGraph based on a SuperHyperHamiltonian-Type-Cycle-Cut . It’s the main. It’ll be 5285

disciplinary to have the foundation of previous definition in the kind of SuperHyperClass. If 5286
there’s a need to have all SuperHyperHamiltonian-Type-Cycle-Cut until the SuperHyperHamiltonian-Type- 5287
Cycle-Cut, then it’s officially called a “SuperHyperHamiltonian-Type-Cycle-Cut” but otherwise, it isn’t 5288
a SuperHyperHamiltonian-Type-Cycle-Cut . There are some instances about the clarifications for the 5289
main definition titled a “SuperHyperHamiltonian-Type-Cycle-Cut ”. These two examples get more 5290

scrutiny and discernment since there are characterized in the disciplinary ways of the SuperHy- 5291
perClass based on a SuperHyperHamiltonian-Type-Cycle-Cut . For the sake of having a Neutrosophic 5292
SuperHyperHamiltonian-Type-Cycle-Cut, there’s a need to “redefine” the notion of a “Neutrosophic 5293
SuperHyperHamiltonian-Type-Cycle-Cut” and a “Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut ”. The 5294
SuperHyperVertices and the SuperHyperEdges are assigned by the labels from the letters of the 5295
alphabets. In this procedure, there’s the usage of the position of labels to assign to the values. 5296

Assume a Neutrosophic SuperHyperGraph. It’s redefined “Neutrosophic SuperHyperGraph” if the 5297

intended Table holds. And a SuperHyperHamiltonian-Type-Cycle-Cut are redefined to a “Neutrosophic 5298
SuperHyperHamiltonian-Type-Cycle-Cut” if the intended Table holds. It’s useful to define “Neutro- 5299
sophic” version of SuperHyperClasses. Since there’s more ways to get Neutrosophic type-results 5300
to make a Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut more understandable. Assume a 5301

Neutrosophic SuperHyperGraph. There are some Neutrosophic SuperHyperClasses if the in- 5302
tended Table holds. Thus SuperHyperPath, SuperHyperHamiltonian-Type-Cycle-Cut, SuperHyperStar, 5303
SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, are “Neutrosophic Supe- 5304
rHyperPath”, “Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut”, “Neutrosophic SuperHyperStar”, 5305
“Neutrosophic SuperHyperBipartite”, “Neutrosophic SuperHyperMultiPartite”, and “Neutrosophic 5306
SuperHyperWheel” if the intended Table holds. A SuperHyperGraph has a “Neutrosophic 5307

SuperHyperHamiltonian-Type-Cycle-Cut” where it’s the strongest [the maximum Neutrosophic value from 5308
all the SuperHyperHamiltonian-Type-Cycle-Cut amid the maximum value amid all SuperHyperVertices 5309
from a SuperHyperHamiltonian-Type-Cycle-Cut .] SuperHyperHamiltonian-Type-Cycle-Cut . A graph is a 5310
SuperHyperUniform if it’s a SuperHyperGraph and the number of elements of SuperHyperEdges 5311
are the same. Assume a Neutrosophic SuperHyperGraph. There are some SuperHyperClasses 5312

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

as follows. It’s SuperHyperPath if it’s only one SuperVertex as intersection amid two given 5313
SuperHyperEdges with two exceptions; it’s SuperHyperHamiltonian-Type-Cycle-Cut if it’s only one 5314
SuperVertex as intersection amid two given SuperHyperEdges; it’s SuperHyperStar it’s only one 5315
SuperVertex as intersection amid all SuperHyperEdges; it’s SuperHyperBipartite it’s only one 5316
SuperVertex as intersection amid two given SuperHyperEdges and these SuperVertices, forming 5317
two separate sets, has no SuperHyperEdge in common; it’s SuperHyperMultiPartite it’s only 5318

one SuperVertex as intersection amid two given SuperHyperEdges and these SuperVertices, 5319
forming multi separate sets, has no SuperHyperEdge in common; it’s a SuperHyperWheel if it’s 5320
only one SuperVertex as intersection amid two given SuperHyperEdges and one SuperVertex 5321
has one SuperHyperEdge with any common SuperVertex. The SuperHyperModel proposes 5322
the specific designs and the specific architectures. The SuperHyperModel is officially called 5323
“SuperHyperGraph” and “Neutrosophic SuperHyperGraph”. In this SuperHyperModel, The 5324

“specific” cells and “specific group” of cells are SuperHyperModeled as “SuperHyperVertices” and 5325
the common and intended properties between “specific” cells and “specific group” of cells are 5326
SuperHyperModeled as “SuperHyperEdges”. Sometimes, it’s useful to have some degrees of 5327
determinacy, indeterminacy, and neutrality to have more precise SuperHyperModel which in 5328
this case the SuperHyperModel is called “Neutrosophic”. In the future research, the foundation 5329
will be based on the “Cancer’s Recognition” and the results and the definitions will be introduced 5330

in redeemed ways. The recognition of the cancer in the long-term function. The specific region 5331
has been assigned by the model [it’s called SuperHyperGraph] and the long cycle of the move 5332
from the cancer is identified by this research. Sometimes the move of the cancer hasn’t be easily 5333
identified since there are some determinacy, indeterminacy and neutrality about the moves 5334
and the effects of the cancer on that region; this event leads us to choose another model [it’s 5335
said to be Neutrosophic SuperHyperGraph] to have convenient perception on what’s happened 5336

and what’s done. There are some specific models, which are well-known and they’ve got the 5337
names, and some SuperHyperGeneral SuperHyperModels. The moves and the traces of the 5338
cancer on the complex tracks and between complicated groups of cells could be fantasized by 5339
a Neutrosophic SuperHyperPath(-/SuperHyperHamiltonian-Type-Cycle-Cut, SuperHyperStar, Super- 5340
HyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find either the 5341
longest SuperHyperHamiltonian-Type-Cycle-Cut or the strongest SuperHyperHamiltonian-Type-Cycle-Cut in 5342

those Neutrosophic SuperHyperModels. For the longest SuperHyperHamiltonian-Type-Cycle-Cut, called 5343

SuperHyperHamiltonian-Type-Cycle-Cut, and the strongest SuperHyperHamiltonian-Type-Cycle-Cut, called 5344
Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut, some general results are introduced. Beyond 5345
that in SuperHyperStar, all possible SuperHyperPaths have only two SuperHyperEdges but it’s 5346
not enough since it’s essential to have at least three SuperHyperEdges to form any style of a 5347

SuperHyperHamiltonian-Type-Cycle-Cut. There isn’t any formation of any SuperHyperHamiltonian-Type- 5348

Cycle-Cut but literarily, it’s the deformation of any SuperHyperHamiltonian-Type-Cycle-Cut. It, literarily, 5349
deforms and it doesn’t form. A basic familiarity with Neutrosophic SuperHyperHamiltonian-Type- 5350
Cycle-Cut theory, SuperHyperGraphs, and Neutrosophic SuperHyperGraphs theory are proposed. 5351
Keywords: Neutrosophic SuperHyperGraph, SuperHyperHamiltonian-Type-Cycle-Cut, Cancer’s Neut- 5352

rosophic Recognition 5353

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

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 CHAPTER 28 5355

Applied Notions Under The Scrutiny Of 5356

The Motivation Of This Scientific 5357

Research 5358

In this scientific research, there are some ideas in the featured frameworks of motivations. 5359
I try to bring the motivations in the narrative ways. Some cells have been faced with some 5360
attacks from the situation which is caused by the cancer’s attacks. In this case, there are 5361
some embedded analysis on the ongoing situations which in that, the cells could be labelled as 5362

some groups and some groups or individuals have excessive labels which all are raised from 5363
the behaviors to overcome the cancer’s attacks. In the embedded situations, the individuals 5364
of cells and the groups of cells could be considered as “new groups”. Thus it motivates us to 5365
find the proper SuperHyperModels for getting more proper analysis on this messy story. I’ve 5366
found the SuperHyperModels which are officially called “SuperHyperGraphs” and “Neutrosophic 5367
SuperHyperGraphs”. In this SuperHyperModel, the cells and the groups of cells are defined as 5368

“SuperHyperVertices” and the relations between the individuals of cells and the groups of cells 5369
are defined as “SuperHyperEdges”. Thus it’s another motivation for us to do research on this 5370
SuperHyperModel based on the “Cancer’s Recognition”. Sometimes, the situations get worst. 5371
The situation is passed from the certainty and precise style. Thus it’s the beyond them. There 5372
are three descriptions, namely, the degrees of determinacy, indeterminacy and neutrality, for any 5373
object based on vague forms, namely, incomplete data, imprecise data, and uncertain analysis. 5374

The latter model could be considered on the previous SuperHyperModel. It’s SuperHyperModel. 5375
It’s SuperHyperGraph but it’s officially called “Neutrosophic SuperHyperGraphs”. The cancer is 5376
the disease but the model is going to figure out what’s going on this phenomenon. The special 5377
case of this disease is considered and as the consequences of the model, some parameters 5378
are used. The cells are under attack of this disease but the moves of the cancer in the 5379
special region are the matter of mind. The recognition of the cancer could help to find some 5380

treatments for this disease. The SuperHyperGraph and Neutrosophic SuperHyperGraph are the 5381
SuperHyperModels on the “Cancer’s Recognition” and both bases are the background of this 5382
research. Sometimes the cancer has been happened on the region, full of cells, groups of cells 5383
and embedded styles. In this segment, the SuperHyperModel proposes some SuperHyperNotions 5384
based on the connectivities of the moves of the cancer in the forms of alliances’ styles with 5385
the formation of the design and the architecture are formally called “ SuperHyperHamiltonian- 5386

Type-Cycle-Cut” in the themes of jargons and buzzwords. The prefix “SuperHyper” refers to the 5387

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

theme of the embedded styles to figure out the background for the SuperHyperNotions. The 5388
recognition of the cancer in the long-term function. The specific region has been assigned by 5389
the model [it’s called SuperHyperGraph] and the long cycle of the move from the cancer is 5390
identified by this research. Sometimes the move of the cancer hasn’t be easily identified since 5391
there are some determinacy, indeterminacy and neutrality about the moves and the effects of the 5392
cancer on that region; this event leads us to choose another model [it’s said to be Neutrosophic 5393

SuperHyperGraph] to have convenient perception on what’s happened and what’s done. There 5394
are some specific models, which are well-known and they’ve got the names, and some general 5395
models. The moves and the traces of the cancer on the complex tracks and between complicated 5396
groups of cells could be fantasized by a Neutrosophic SuperHyperPath (-/SuperHyperHamiltonian- 5397
Type-Cycle-Cut, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). 5398
The aim is to find either the optimal SuperHyperHamiltonian-Type-Cycle-Cut or the Neutrosophic 5399

SuperHyperHamiltonian-Type-Cycle-Cut in those Neutrosophic SuperHyperModels. Some general results 5400

are introduced. Beyond that in SuperHyperStar, all possible Neutrosophic SuperHyperPath s 5401
have only two SuperHyperEdges but it’s not enough since it’s essential to have at least three 5402
SuperHyperEdges to form any style of a SuperHyperHamiltonian-Type-Cycle-Cut. There isn’t any 5403
formation of any SuperHyperHamiltonian-Type-Cycle-Cut but literarily, it’s the deformation of any 5404
SuperHyperHamiltonian-Type-Cycle-Cut. It, literarily, deforms and it doesn’t form. 5405

Question 28.0.1. How to define the SuperHyperNotions and to do research on them to find the 5406

“ amount of SuperHyperHamiltonian-Type-Cycle-Cut” of either individual of cells or the groups of cells 5407

based on the fixed cell or the fixed group of cells, extensively, the “amount of SuperHyperHamiltonian- 5408
Type-Cycle-Cut” based on the fixed groups of cells or the fixed groups of group of cells? 5409

Question 28.0.2. What are the best descriptions for the “Cancer’s Recognition” in terms of 5410
these messy and dense SuperHyperModels where embedded notions are illustrated? 5411

It’s motivation to find notions to use in this dense model is titled “SuperHyperGraphs”. Thus 5412
it motivates us to define different types of “ SuperHyperHamiltonian-Type-Cycle-Cut” and “Neutrosophic 5413

SuperHyperHamiltonian-Type-Cycle-Cut” on “SuperHyperGraph” and “Neutrosophic SuperHyperGraph”. 5414

Then the research has taken more motivations to define SuperHyperClasses and to find some 5415
connections amid this SuperHyperNotion with other SuperHyperNotions. It motivates us to get 5416
some instances and examples to make clarifications about the framework of this research. The 5417
general results and some results about some connections are some avenues to make key point of 5418
this research, “Cancer’s Recognition”, more understandable and more clear. 5419

The framework of this research is as follows. In the beginning, I introduce basic definitions 5420
to clarify about preliminaries. In the subsection “Preliminaries”, initial definitions about 5421
SuperHyperGraphs and Neutrosophic SuperHyperGraph are deeply-introduced and in-depth- 5422
discussed. The elementary concepts are clarified and illustrated completely and sometimes 5423
review literature are applied to make sense about what’s going to figure out about the upcoming 5424
sections. The main definitions and their clarifications alongside some results about new notions, 5425

SuperHyperHamiltonian-Type-Cycle-Cut and Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut, are figured 5426

out in sections “ SuperHyperHamiltonian-Type-Cycle-Cut” and “Neutrosophic SuperHyperHamiltonian- 5427
Type-Cycle-Cut”. In the sense of tackling on getting results and in Hamiltonian-Type-Cycle-Cut to 5428
make sense about continuing the research, the ideas of SuperHyperUniform and Neutrosophic 5429
SuperHyperUniform are introduced and as their consequences, corresponded SuperHyperClasses 5430
are figured out to debut what’s done in this section, titled “Results on SuperHyperClasses” 5431

and “Results on Neutrosophic SuperHyperClasses”. As going back to origin of the notions, 5432

Henry Garrett · 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 smart steps toward the common notions to extend the new notions in new 5433
frameworks, SuperHyperGraph and Neutrosophic SuperHyperGraph, in the sections “Results on 5434
SuperHyperClasses” and “Results on Neutrosophic SuperHyperClasses”. The starter research 5435
about the general SuperHyperRelations and as concluding and closing section of theoretical 5436
research are contained in the section “General Results”. Some general SuperHyperRelations 5437
are fundamental and they are well-known as fundamental SuperHyperNotions as elicited and 5438

discussed in the sections, “General Results”, “ SuperHyperHamiltonian-Type-Cycle-Cut”, “Neutrosophic 5439

SuperHyperHamiltonian-Type-Cycle-Cut”, “Results on SuperHyperClasses” and “Results on Neutrosophic 5440
SuperHyperClasses”. There are curious questions about what’s done about the SuperHyperNotions 5441
to make sense about excellency of this research and going to figure out the word “best” as the 5442
description and adjective for this research as presented in section, “ SuperHyperHamiltonian-Type-Cycle- 5443
Cut”. The keyword of this research debut in the section “Applications in Cancer’s Recognition” 5444

with two cases and subsections “Case 1: The Initial Steps Toward SuperHyperBipartite as 5445
SuperHyperModel” and “Case 2: The Increasing Steps Toward SuperHyperMultipartite as 5446
SuperHyperModel”. In the section, “Open Problems”, there are some scrutiny and discernment 5447
on what’s done and what’s happened in this research in the terms of “questions” and “problems” 5448
to make sense to figure out this research in featured style. The advantages and the limitations of 5449
this research alongside about what’s done in this research to make sense and to get sense about 5450

what’s figured out are included in the section, “Conclusion and Closing Remarks”. 5451

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 CHAPTER 29 5452

Neutrosophic Preliminaries Of This 5453

Scientific Research On the Redeemed 5454

Ways 5455

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

Neutrosophic Set](Ref.[HG38],Definition 2.2,p.2), [Neutrosophic Set](Ref.[HG38],Definition 5457

2.1,p.1), [Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG38],Definition 2.5,p.2), [Char- 5458
acterization of the Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG38],Definition 2.7,p.3), 5459
[t-norm](Ref.[HG38], Definition 2.7, p.3), and [Characterization of the Neutrosophic SuperHy- 5460
perGraph (NSHG)](Ref.[HG38],Definition 2.7,p.3), [Neutrosophic Strength of the Neutrosophic 5461
SuperHyperPaths] (Ref.[HG38],Definition 5.3,p.7), and [Different Neutrosophic Types of Neut- 5462

rosophic SuperHyperEdges (NSHE)] (Ref.[HG38],Definition 5.4,p.7). Also, the new ideas and 5463
their clarifications are addressed to Ref.[HG38]. 5464
In this subsection, the basic material which is used in this scientific research, is presented. Also, 5465
the new ideas and their clarifications are elicited. 5466

Definition 29.0.1 (Neutrosophic Set). (Ref.[HG38],Definition 2.1,p.1).

Let X be a Hamiltonian-Type-Cycle-Cut of points (objects) with generic elements in X denoted by x;
then the Neutrosophic set A (NS A) is an object having the form
A = {< x : TA (x), IA (x), FA (x) >, x ∈ X}
+
where the functions T, I, F : X →]− 0, 1 [ define respectively the a truth-membership
function, an indeterminacy-membership function, and a falsity-membership function
of the element x ∈ X to the set A with the condition
−
0 ≤ TA (x) + IA (x) + FA (x) ≤ 3+ .
+
The functions TA (x), IA (x) and FA (x) are real standard or nonstandard subsets of ]− 0, 1 [. 5467

Definition 29.0.2 (Single Valued Neutrosophic Set). (Ref.[HG38],Definition 2.2,p.2).

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

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

Definition 29.0.3. The degree of truth-membership, indeterminacy-membership and

falsity-membership of the subset X ⊂ A of the single valued Neutrosophic set A = {< x :
TA (x), IA (x), FA (x) >, x ∈ X}:
TA (X) = min[TA (vi ), TA (vj )]vi ,vj ∈X ,
IA (X) = min[IA (vi ), IA (vj )]vi ,vj ∈X ,
and FA (X) = min[FA (vi ), FA (vj )]vi ,vj ∈X .
Definition 29.0.4. The support of X ⊂ A of the single valued Neutrosophic set A = {< x :
TA (x), IA (x), FA (x) >, x ∈ X}:
supp(X) = {x ∈ X : TA (x), IA (x), FA (x) > 0}.
Definition 29.0.5 (Neutrosophic SuperHyperGraph (NSHG)). (Ref.[HG38],Definition 2.5,p.2). 5468
Assume V 0 is a given set. a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E), 5469
where 5470

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

(ii) V = {(Vi , TV 0 (Vi ), IV 0 (Vi ), FV 0 (Vi )) : TV 0 (Vi ), IV 0 (Vi ), FV 0 (Vi ) ≥ 0}, (i = 1, 2, . . . , n); 5472

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

(iv) E = {(Ei0 , TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 )) : TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 ) ≥ 0}, (i0 = 5474
1, 2, . . . , n0 ); 5475

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

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

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

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

(ix) and the following conditions hold:

TV0 (Ei0 ) ≤ min[TV 0 (Vi ), TV 0 (Vj )]Vi ,Vj ∈Ei0 ,
IV0 (Ei0 ) ≤ min[IV 0 (Vi ), IV 0 (Vj )]Vi ,Vj ∈Ei0 ,
and FV0 (Ei0 ) ≤ min[FV 0 (Vi ), FV 0 (Vj )]Vi ,Vj ∈Ei0
where i0 = 1, 2, . . . , n0 . 5480

Here the Neutrosophic SuperHyperEdges (NSHE) Ej 0 and the Neutrosophic SuperHyperVertices 5481
(NSHV) Vj are single valued Neutrosophic sets. TV 0 (Vi ), IV 0 (Vi ), and FV 0 (Vi ) denote the 5482

degree of truth-membership, the degree of indeterminacy-membership and the degree of 5483

falsity-membership the Neutrosophic SuperHyperVertex (NSHV) Vi to the Neutrosophic 5484
SuperHyperVertex (NSHV) V. TV0 (Ei0 ), TV0 (Ei0 ), and TV0 (Ei0 ) denote the degree of truth- 5485
membership, the degree of indeterminacy-membership and the degree of falsity-membership of 5486
the Neutrosophic SuperHyperEdge (NSHE) Ei0 to the Neutrosophic SuperHyperEdge (NSHE) 5487
E. Thus, the ii0 th element of the incidence matrix of Neutrosophic SuperHyperGraph (NSHG) 5488

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

Henry Garrett · 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 29.0.6 (Characterization of the Neutrosophic SuperHyperGraph (NSHG)). 5490

(Ref.[HG38],Definition 2.7,p.3). 5491
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). The Neutro- 5492
sophic SuperHyperEdges (NSHE) Ei0 and the Neutrosophic SuperHyperVertices (NSHV) Vi of 5493
Neutrosophic SuperHyperGraph (NSHG) S = (V, E) could be characterized as follow-up items. 5494

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

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

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

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

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

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

If we choose different types of binary operations, then we could get hugely diverse types of 5503
general forms of Neutrosophic SuperHyperGraph (NSHG). 5504

Definition 29.0.7 (t-norm). (Ref.[HG38], Definition 2.7, p.3). 5505

A binary operation ⊗ : [0, 1] × [0, 1] → [0, 1] is a t-norm if it satisfies the following for 5506
x, y, z, w ∈ [0, 1]: 5507

(i) 1 ⊗ x = x; 5508

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

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

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

Definition 29.0.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 29.0.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 29.0.10. (General Forms of Neutrosophic SuperHyperGraph (NSHG)). 5512

Assume V 0 is a given set. a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E), 5513

where 5514

Henry Garrett · 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) V = {V1 , V2 , . . . , Vn } a finite set of finite single valued Neutrosophic subsets of V 0 ; 5515

(ii) V = {(Vi , TV 0 (Vi ), IV 0 (Vi ), FV 0 (Vi )) : TV 0 (Vi ), IV 0 (Vi ), FV 0 (Vi ) ≥ 0}, (i = 1, 2, . . . , n); 5516

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

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

1, 2, . . . , n0 ); 5519

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

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

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

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

Here the Neutrosophic SuperHyperEdges (NSHE) Ej 0 and the Neutrosophic SuperHyperVertices 5524
(NSHV) Vj are single valued Neutrosophic sets. TV 0 (Vi ), IV 0 (Vi ), and FV 0 (Vi ) denote the 5525
degree of truth-membership, the degree of indeterminacy-membership and the degree of 5526
falsity-membership the Neutrosophic SuperHyperVertex (NSHV) Vi to the Neutrosophic 5527
SuperHyperVertex (NSHV) V. TV0 (Ei0 ), TV0 (Ei0 ), and TV0 (Ei0 ) denote the degree of truth- 5528

membership, the degree of indeterminacy-membership and the degree of falsity-membership of 5529

the Neutrosophic SuperHyperEdge (NSHE) Ei0 to the Neutrosophic SuperHyperEdge (NSHE) 5530
E. Thus, the ii0 th element of the incidence matrix of Neutrosophic SuperHyperGraph (NSHG) 5531
are of the form (Vi , TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 )), the sets V and E are crisp sets. 5532

Definition 29.0.11 (Characterization of the Neutrosophic SuperHyperGraph (NSHG)). 5533

(Ref.[HG38],Definition 2.7,p.3). 5534
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). The Neutrosophic 5535
SuperHyperEdges (NSHE) Ei0 and the Neutrosophic SuperHyperVertices (NSHV) Vi of Neutro- 5536
sophic SuperHyperGraph (NSHG) S = (V, E) could be characterized as follow-up items. 5537

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

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

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

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

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

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

This SuperHyperModel is too messy and too dense. Thus there’s a need to have some 5546
restrictions and conditions on SuperHyperGraph. The special case of this SuperHyperGraph 5547

makes the patterns and regularities. 5548

Definition 29.0.12. A graph is SuperHyperUniform if it’s SuperHyperGraph and the number 5549

of elements of SuperHyperEdges are the same. 5550

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

To get more visions on SuperHyperUniform, the some SuperHyperClasses are introduced. It 5551
makes to have SuperHyperUniform more understandable. 5552

Definition 29.0.13. Assume a Neutrosophic SuperHyperGraph. There are some SuperHyper- 5553
Classes as follows. 5554

(i). It’s Neutrosophic SuperHyperPath if it’s only one SuperVertex as intersection amid 5555

two given SuperHyperEdges with two exceptions; 5556

(ii). it’s SuperHyperCycle if it’s only one SuperVertex as intersection amid two given 5557
SuperHyperEdges; 5558

(iii). it’s SuperHyperStar it’s only one SuperVertex as intersection amid all SuperHyperEdges; 5559

(iv). it’s SuperHyperBipartite it’s only one SuperVertex as intersection amid two given Supe- 5560
rHyperEdges and these SuperVertices, forming two separate sets, has no SuperHyperEdge 5561

in common; 5562

(v). it’s SuperHyperMultiPartite it’s only one SuperVertex as intersection amid two 5563
given SuperHyperEdges and these SuperVertices, forming multi separate sets, has no 5564
SuperHyperEdge in common; 5565

(vi). it’s SuperHyperWheel if it’s only one SuperVertex as intersection amid two given 5566
SuperHyperEdges and one SuperVertex has one SuperHyperEdge with any common 5567
SuperVertex. 5568

Definition 29.0.14. Let a pair S = (V, E) be a Neutrosophic SuperHyperGraph (NSHG) S. Then

a sequence of Neutrosophic SuperHyperVertices (NSHV) and Neutrosophic SuperHyperEdges
(NSHE)
V1 , E1 , V2 , E2 , V3 , . . . , Vs−1 , Es−1 , Vs
is called a Neutrosophic SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex 5569
(NSHV) V1 to Neutrosophic SuperHyperVertex (NSHV) Vs if either of following conditions hold: 5570

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

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

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

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

0 0
(v) there’s a SuperVertex Vi+1 ∈ Vi+1 such that Vi , Vi+1 ∈ E i0 ; 5575

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

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

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

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

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

Henry Garrett · 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 29.0.15. (Characterization of the Neutrosophic SuperHyperPaths).

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). a Neutrosophic
SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex (NSHV) V1 to Neutrosophic
SuperHyperVertex (NSHV) Vs is sequence of Neutrosophic SuperHyperVertices (NSHV) and
Neutrosophic SuperHyperEdges (NSHE)

V1 , E1 , V2 , E2 , V3 , . . . , Vs−1 , Es−1 , Vs ,

could be characterized as follow-up items. 5580

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

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

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

(iv) if there are Vi , Ej 0 , |Vi | ≥ 1, |Ej 0 | ≥ 2, then NSHP is called Neutrosophic SuperHy- 5584
perPath . 5585

Definition 29.0.16 (Neutrosophic Strength of the Neutrosophic SuperHyperPaths).

(Ref.[HG38],Definition 5.3,p.7).
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). A Neutrosophic
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 5586

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

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

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

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

Definition 29.0.17 (Different Neutrosophic Types of Neutrosophic SuperHyperEdges (NSHE)). 5591

(Ref.[HG38],Definition 5.4,p.7). 5592
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider a 5593
Neutrosophic SuperHyperEdge (NSHE) E = {V1 , V2 , . . . , Vs }. Then E is called 5594

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

of SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex (NSHV) Vi to 5596

Neutrosophic SuperHyperVertex (NSHV) Vj where 1 ≤ i, j ≤ s; 5597

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

of SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex (NSHV) Vi to 5599

Neutrosophic SuperHyperVertex (NSHV) Vj where 1 ≤ i, j ≤ s; 5600

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

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

of SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex (NSHV) Vi to 5602
Neutrosophic SuperHyperVertex (NSHV) Vj where 1 ≤ i, j ≤ s; 5603

(xii) Neutrosophic connective if (T (E), I(E), F (E)) ≥ maximum number of Neutrosophic 5604
strength of SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex (NSHV) Vi 5605
to Neutrosophic SuperHyperVertex (NSHV) Vj where 1 ≤ i, j ≤ s. 5606

Definition 29.0.18. (Different Neutrosophic Types of Neutrosophic SuperHyperHamiltonian-Type- 5607

Cycle-Cut). 5608
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider a 5609
Neutrosophic SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and E 0 = {E1 , E2 , . . . , Ez }. Then either V 0 5610

or E 0 is called 5611

(i) Neutrosophic e-SuperHyperHamiltonian-Type-Cycle-Cut if the following expression is 5612

called Neutrosophic e-SuperHyperHamiltonian-Type-Cycle-Cut criteria holds 5613

∀Ea ∈ C : C is
a SuperHyperCycle and it has
the maximum number of SuperHyperVertices;

(ii) Neutrosophic re-SuperHyperHamiltonian-Type-Cycle-Cut if the following expression is 5614

called Neutrosophic re-SuperHyperHamiltonian-Type-Cycle-Cut criteria holds 5615

∀Ea ∈ C : C is
a SuperHyperCycle and it has
the maximum number of SuperHyperVertices;

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

(iii) Neutrosophic v-SuperHyperHamiltonian-Type-Cycle-Cut if the following expression is 5617

called Neutrosophic v-SuperHyperHamiltonian-Type-Cycle-Cut criteria holds 5618

∀Va ∈ C : C is
a SuperHyperCycle and it has
the maximum number of SuperHyperVertices;

(iv) Neutrosophic rv-SuperHyperHamiltonian-Type-Cycle-Cut if the following expression is 5619

called Neutrosophic v-SuperHyperHamiltonian-Type-Cycle-Cut criteria holds 5620

∀Va ∈ C : C is
a SuperHyperCycle and it has
the maximum number of SuperHyperVertices;

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

Henry Garrett · 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) Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut if it’s either of Neutro- 5622

sophic e-SuperHyperHamiltonian-Type-Cycle-Cut, Neutrosophic re-SuperHyperHamiltonian-Type- 5623
Cycle-Cut, Neutrosophic v-SuperHyperHamiltonian-Type-Cycle-Cut, and Neutrosophic rv- 5624
SuperHyperHamiltonian-Type-Cycle-Cut. 5625

Definition 29.0.19. ((Neutrosophic) SuperHyperHamiltonian-Type-Cycle-Cut). 5626

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider a 5627
Neutrosophic SuperHyperEdge (NSHE) E = {V1 , V2 , . . . , Vs }. Then E is called 5628

(i) an Extreme SuperHyperHamiltonian-Type-Cycle-Cut if it’s either of Neutro- 5629

sophic e-SuperHyperHamiltonian-Type-Cycle-Cut, Neutrosophic re-SuperHyperHamiltonian-Type- 5630
Cycle-Cut, Neutrosophic v-SuperHyperHamiltonian-Type-Cycle-Cut, and Neutrosophic rv- 5631
SuperHyperHamiltonian-Type-Cycle-Cut and C(N SHG) for an Extreme SuperHyperGraph 5632

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

of high Extreme cardinality of the Extreme SuperHyperEdges in the conseNeighborive 5634
Extreme sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such 5635
that they form the Extreme SuperHyperHamiltonian-Type-Cycle-Cut; 5636

(ii) a Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut if it’s either of Neutro- 5637

sophic e-SuperHyperHamiltonian-Type-Cycle-Cut, Neutrosophic re-SuperHyperHamiltonian-Type- 5638
Cycle-Cut, Neutrosophic v-SuperHyperHamiltonian-Type-Cycle-Cut, and Neutrosophic rv- 5639
SuperHyperHamiltonian-Type-Cycle-Cut and C(N SHG) for a Neutrosophic SuperHyperGraph 5640
N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic Su- 5641

perHyperEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 5642

conseNeighborive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices 5643
such that they form the Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut; 5644

(iii) an Extreme SuperHyperHamiltonian-Type-Cycle-Cut SuperHyperPolynomial if 5645

it’s either of Neutrosophic e-SuperHyperHamiltonian-Type-Cycle-Cut, Neutrosophic re- 5646
SuperHyperHamiltonian-Type-Cycle-Cut, Neutrosophic v-SuperHyperHamiltonian-Type-Cycle-Cut, and 5647
Neutrosophic rv-SuperHyperHamiltonian-Type-Cycle-Cut and C(N SHG) for an Extreme Super- 5648
HyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme 5649
coefficients defined as the Extreme number of the maximum Extreme cardinality of the 5650

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

conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVertices such 5652
that they form the Extreme SuperHyperHamiltonian-Type-Cycle-Cut; and the Extreme power is 5653
corresponded to its Extreme coefficient; 5654

(iv) a Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut SuperHyperPolynomial 5655

if it’s either of Neutrosophic e-SuperHyperHamiltonian-Type-Cycle-Cut, Neutrosophic re- 5656
SuperHyperHamiltonian-Type-Cycle-Cut, Neutrosophic v-SuperHyperHamiltonian-Type-Cycle-Cut, and 5657
Neutrosophic rv-SuperHyperHamiltonian-Type-Cycle-Cut and C(N SHG) for a Neutrosophic 5658

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

the Neutrosophic coefficients defined as the Neutrosophic number of the maximum 5660
Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic 5661
SuperHyperSet S of high Neutrosophic cardinality conseNeighborive Neutrosophic Super- 5662
HyperEdges and Neutrosophic SuperHyperVertices such that they form the Neutrosophic 5663
SuperHyperHamiltonian-Type-Cycle-Cut; and the Neutrosophic power is corresponded to its 5664

Neutrosophic coefficient; 5665

Henry Garrett · 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) an Extreme V-SuperHyperHamiltonian-Type-Cycle-Cut if it’s either of Neutro- 5666

sophic e-SuperHyperHamiltonian-Type-Cycle-Cut, Neutrosophic re-SuperHyperHamiltonian-Type- 5667
Cycle-Cut, Neutrosophic v-SuperHyperHamiltonian-Type-Cycle-Cut, and Neutrosophic rv- 5668
SuperHyperHamiltonian-Type-Cycle-Cut and C(N SHG) for an Extreme SuperHyperGraph 5669
N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of 5670
high Extreme cardinality of the Extreme SuperHyperVertices in the conseNeighborive 5671

Extreme sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such 5672

that they form the Extreme SuperHyperHamiltonian-Type-Cycle-Cut; 5673

(vi) a Neutrosophic V-SuperHyperHamiltonian-Type-Cycle-Cut if it’s either of Neut- 5674

rosophic e-SuperHyperHamiltonian-Type-Cycle-Cut, Neutrosophic re-SuperHyperHamiltonian- 5675
Type-Cycle-Cut, Neutrosophic v-SuperHyperHamiltonian-Type-Cycle-Cut, and Neutrosophic rv- 5676

SuperHyperHamiltonian-Type-Cycle-Cut and C(N SHG) for a Neutrosophic SuperHyperGraph 5677

N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic Supe- 5678
rHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 5679
conseNeighborive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices 5680
such that they form the Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut; 5681

(vii) an Extreme V-SuperHyperHamiltonian-Type-Cycle-Cut SuperHyperPolynomial 5682

if it’s either of Neutrosophic e-SuperHyperHamiltonian-Type-Cycle-Cut, Neutrosophic re- 5683
SuperHyperHamiltonian-Type-Cycle-Cut, Neutrosophic v-SuperHyperHamiltonian-Type-Cycle-Cut, and 5684
Neutrosophic rv-SuperHyperHamiltonian-Type-Cycle-Cut and C(N SHG) for an Extreme Super- 5685
HyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme 5686
coefficients defined as the Extreme number of the maximum Extreme cardinality of the 5687

Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality 5688

conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVertices such 5689
that they form the Extreme SuperHyperHamiltonian-Type-Cycle-Cut; and the Extreme power is 5690
corresponded to its Extreme coefficient; 5691

(viii) a Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut SuperHyperPolynomial 5692

if it’s either of Neutrosophic e-SuperHyperHamiltonian-Type-Cycle-Cut, Neutrosophic re- 5693

SuperHyperHamiltonian-Type-Cycle-Cut, Neutrosophic v-SuperHyperHamiltonian-Type-Cycle-Cut, and 5694
Neutrosophic rv-SuperHyperHamiltonian-Type-Cycle-Cut and C(N SHG) for a Neutrosophic 5695
SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains 5696
the Neutrosophic coefficients defined as the Neutrosophic number of the maximum 5697
Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic 5698

SuperHyperSet S of high Neutrosophic cardinality conseNeighborive Neutrosophic Super- 5699

HyperEdges and Neutrosophic SuperHyperVertices such that they form the Neutrosophic 5700
SuperHyperHamiltonian-Type-Cycle-Cut; and the Neutrosophic power is corresponded to its 5701
Neutrosophic coefficient. 5702

Definition 29.0.20. ((Extreme/Neutrosophic)δ−SuperHyperHamiltonian-Type-Cycle-Cut). 5703

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

(i) an δ−SuperHyperHamiltonian-Type-Cycle-Cut is a Neutrosophic kind of Neutrosophic 5705

SuperHyperHamiltonian-Type-Cycle-Cut such that either of the following expressions hold for 5706

Henry Garrett · 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 29.1: The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges
Belong to The Neutrosophic SuperHyperGraph Mentioned in the Definition (29.0.23)

The Values of The Vertices The Number of Position in Alphabet

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

the Neutrosophic cardinalities of SuperHyperNeighbors of s ∈ S : 5707

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

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

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

(29.1), holds if S is an δ−SuperHyperDefensive; 5709

(ii) a Neutrosophic δ−SuperHyperHamiltonian-Type-Cycle-Cut is a Neutrosophic kind of 5710

Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut such that either of the following Neut- 5711
rosophic expressions hold for the Neutrosophic cardinalities of SuperHyperNeighbors of 5712
s∈S: 5713

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

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

The Expression (29.1), holds if S is a Neutrosophic δ−SuperHyperOffensive. And 5714

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

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

“redefine” the notion of “Neutrosophic SuperHyperGraph”. The SuperHyperVertices and the 5717
SuperHyperEdges are assigned by the labels from the letters of the alphabets. In this procedure, 5718
there’s the usage of the position of labels to assign to the values. 5719

136DEF1 Definition 29.0.21. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 5720
It’s redefined Neutrosophic SuperHyperGraph if the Table (29.1) holds. 5721

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

to get Neutrosophic type-results to make a Neutrosophic more understandable. 5723

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

(V, E). There are some Neutrosophic SuperHyperClasses if the Table (29.2) holds. 5725
Thus Neutrosophic SuperHyperPath , SuperHyperHamiltonian-Type-Cycle-Cut, SuperHyperStar, 5726
SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, are Neutrosophic 5727
SuperHyperPath, Neutrosophic SuperHyperCycle, Neutrosophic SuperHyperStar, 5728
Neutrosophic SuperHyperBipartite, Neutrosophic SuperHyperMultiPartite, and 5729

Neutrosophic SuperHyperWheel if the Table (29.2) holds. 5730

Henry Garrett · 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 29.2: The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges
Belong to The Neutrosophic SuperHyperGraph, Mentioned in the Definition (29.0.22)

The Values of The Vertices The Number of Position in Alphabet

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

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

The Values of The Vertices The Number of Position in Alphabet

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

It’s useful to define a “Neutrosophic” version of a Neutrosophic SuperHyperHamiltonian-Type- 5731

Cycle-Cut. Since there’s more ways to get type-results to make a Neutrosophic SuperHyperHamiltonian- 5732
Type-Cycle-Cut more Neutrosophicly understandable. 5733
For the sake of having a Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut, there’s a need to 5734

“redefine” the Neutrosophic notion of “Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut”. The 5735

SuperHyperVertices and the SuperHyperEdges are assigned by the labels from the letters of the 5736
alphabets. In this procedure, there’s the usage of the position of labels to assign to the values. 5737

136DEF1 Definition 29.0.23. Assume a SuperHyperHamiltonian-Type-Cycle-Cut. It’s redefined a Neutro- 5738

sophic SuperHyperHamiltonian-Type-Cycle-Cut if the Table (29.3) holds. 5739

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 CHAPTER 30 5740

Neutrosophic SuperHyper But As Hamiltonian-Type-Cycle-Cut 5741

The Extensions Excerpt From Dense And 5742

Super Forms 5743

Definition 30.0.1. (Neutrosophic event). 5744

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

S = (V, E) is a probability Hamiltonian-Type-Cycle-Cut. Any Neutrosophic k-subset of A of V 5746
is called Neutrosophic k-event and if k = 2, then Neutrosophic subset of A of V is called 5747
Neutrosophic event. The following expression is called Neutrosophic probability of A. 5748

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

Definition 30.0.2. (Neutrosophic Independent). 5749

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

a probability Hamiltonian-Type-Cycle-Cut. s Neutrosophic k-events Ai , i ∈ I is called Neutrosophic 5751

s-independent if the following expression is called Neutrosophic s-independent criteria 5752

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

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

The following expression is called Neutrosophic independent criteria 5754

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

Definition 30.0.3. (Neutrosophic Variable). 5755

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

is a probability Hamiltonian-Type-Cycle-Cut. Any k-function Hamiltonian-Type-Cycle-Cut like E is called 5757

Neutrosophic k-Variable. If k = 2, then any 2-function Hamiltonian-Type-Cycle-Cut like E is called 5758
Neutrosophic Variable. 5759

The notion of independent on Neutrosophic Variable is likewise. 5760

Definition 30.0.4. (Neutrosophic Expectation). 5761

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

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

is a probability Hamiltonian-Type-Cycle-Cut. A Neutrosophic k-Variable E has a number is called 5763

Neutrosophic Expectation if the following expression is called Neutrosophic Expectation 5764
criteria 5765
X
Ex(E) = E(α)P (α).
α∈V

Definition 30.0.5. (Neutrosophic Crossing). 5766

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) is 5767
a probability Hamiltonian-Type-Cycle-Cut. A Neutrosophic number is called Neutrosophic Crossing 5768
if the following expression is called Neutrosophic Crossing criteria 5769

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

Lemma 30.0.6. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 5770
Consider S = (V, E) is a probability Hamiltonian-Type-Cycle-Cut. Let m and n propose special Hamiltonian- 5771
Type-Cycle-Cut. Then with m ≥ 4n, 5772

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

random k-subset of V obtained by choosing each SuperHyperVertex of G Neutrosophic
independently with probability Hamiltonian-Type-Cycle-Cut p := 4n/m, and set H := G[S] and
H := G[S].
Define random variables X, Y, Z on V as follows: X is the Neutrosophic number of
SuperHyperVertices, Y the Neutrosophic number of SuperHyperEdges, and Z the Neutrosophic
number of crossings of H. The trivial bound noted above, when applied to H, yields the
inequality Z ≥ cr(H) ≥ Y − 3X. By linearity of Neutrosophic Expectation,
E(Z) ≥ E(Y ) − 3E(X).
2
Now E(X) = pn, E(Y ) = p m (each SuperHyperEdge having some SuperHyperEnds) and
E(Z) = p4 cr(G) (each crossing being defined by some SuperHyperVertices). Hence
p4 cr(G) ≥ p2 m − 3pn.
Dividing both sides by p4 , we have: 5773

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

Theorem 30.0.7. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 5775
Consider S = (V, E) is a probability Hamiltonian-Type-Cycle-Cut. Let P be a SuperHyperSet of n points 5776
in the plane, and let l be the Neutrosophic number of√SuperHyperLines in the plane passing 5777

through at least k + 1 of these points, where 1 ≤ k ≤ 2 2n. Then l < 32n2 /k 3 . 5778

Proof. Form a Neutrosophic SuperHyperGraph G with SuperHyperVertex SuperHyperSet 5779

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

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

Theorem 30.0.8. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 5785
Consider S = (V, E) is a probability Hamiltonian-Type-Cycle-Cut. Let P be a SuperHyperSet of n points 5786
in the plane, and let k be the number of pairs of points of P at unit SuperHyperDistance. Then 5787
k < 5n4/3 . 5788

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

(V, E) is a probability Hamiltonian-Type-Cycle-Cut. Draw a SuperHyperUnit SuperHyperCircle around 5790

each SuperHyperPoint of P. Let ni be the Neutrosophic number of thesePSuperHyperCircles 5791
i = 0n−1 ni = n and k = 12 i = 0n−1 ini . Now
P
passing through exactly i points of P. Then 5792
form a Neutrosophic SuperHyperGraph H with SuperHyperVertex SuperHyperSet P whose 5793
SuperHyperEdges are the SuperHyperArcs between conseNeighborive SuperHyperPoints on the 5794
SuperHyperCircles that pass through at least three SuperHyperPoints of P. Then 5795

n−1
X
e(H) = ini = 2k − n1 − 2n2 ≥ 2k − 2n.
i=3

Some SuperHyperPairs of SuperHyperVertices of H might be joined by some parallel 5796

SuperHyperEdges. Delete from H one of each SuperHyperPair of parallel SuperHyperEdges, 5797
so as to obtain a simple Neutrosophic SuperHyperGraph G with e(G) ≥ k − n. Now 5798

cr(G) ≤ n(n − 1) because G is formed from at most n SuperHyperCircles, and any two 5799
SuperHyperCircles cross at most twice. Thus either e(G) < 4n, in which case k < 5n < 5n4/3 , 5800
3
or n2 > n(n − 1) ≥ cr(G) ≥ (k − n) /64n2 by the Neutrosophic Crossing Lemma, and 5801
4/3 4/3
k < 4n + n < 5n .  5802

Proposition 30.0.9. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 5803
Consider S = (V, E) is a probability Hamiltonian-Type-Cycle-Cut. Let X be a nonnegative Neutrosophic 5804

Variable and t a positive real number. Then 5805

E(X)
P (X ≥ t) ≤ .
t
Proof.
X X
E(X) = {X(a)P (a) : a ∈ V } ≥ {X(a)P (a) : a ∈ V, X(a) ≥ t}
X X
{tP (a) : a ∈ V, X(a) ≥ t} = t {P (a) : a ∈ V, X(a) ≥ t}
tP (X ≥ t).
Dividing the first and last members by t yields the asserted inequality.  5806

Corollary 30.0.10. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 5807
Consider S = (V, E) is a probability Hamiltonian-Type-Cycle-Cut. Let Xn be a nonnegative integer- 5808

valued variable in a prob- ability Hamiltonian-Type-Cycle-Cut (Vn , En ), n ≥ 1. If E(Xn ) → 0 as n → ∞, 5809

then P (Xn = 0) → 1 as n → ∞. 5810

Proof.  5811

Theorem 30.0.11. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 5812
Consider S = (V, E) is a probability Hamiltonian-Type-Cycle-Cut. A special SuperHyperGraph in Gn,p 5813

almost surely has stability number at most d2p−1 log ne. 5814

Henry Garrett · 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. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 5815
S = (V, E) is a probability Hamiltonian-Type-Cycle-Cut. A special SuperHyperGraph in Gn,p is 5816
up. Let G ∈ Gn,p and let S be a given SuperHyperSet of k + 1 SuperHyperVertices of G, 5817
where k ∈ N. The probability that S is a stable SuperHyperSet of G is (1 − p)(k+1)choose2 , this 5818
being the probability that none of the (k + 1)choose2 pairs of SuperHyperVertices of S is a 5819
SuperHyperEdge of the Neutrosophic SuperHyperGraph G. 5820

Let AS denote the event that S is a stable SuperHyperSet of G, and let XS denote the indicator 5821
Neutrosophic Variable for this Neutrosophic Event. By equation, we have 5822

E(XS ) = P (XS = 1) = P (AS ) = (1 − p)(k+1)choose2 .

Let X be the number of stable SuperHyperSets of cardinality k + 1 in G. Then 5823

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

and so, by those, 5824

X
E(X) = {E(XS ) : S ⊆ V, |S| = k + 1} = (n choose k+1)(1 − p)(k+1)choose2 .

We bound the right-hand side by invoking two elementary inequalities: 5825

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

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

nk+1 e−p)(k+1)choose2 ne−pk/2k+1

E(X) ≤ =
(k + 1)! (k + 1)!

Suppose now that k = d2p−1 log ne. Then k ≥ 2p−1 log n, so ne−pk/2 ≤ 1. Because k grows at 5827
least as fast as the logarithm of n, implies that E(X) → 0 as n → ∞. Because X is integer-valued 5828
and nonnegative, we deduce from Corollary that P (X = 0) → 1 as n → ∞. Consequently, a 5829
Neutrosophic SuperHyperGraph in Gn,p almost surely has stability number at most k.  5830

Definition 30.0.12. (Neutrosophic Variance). 5831

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) 5832
is a probability Hamiltonian-Type-Cycle-Cut. A Neutrosophic k-Variable E has a number is called 5833
Neutrosophic Variance if the following expression is called Neutrosophic Variance 5834
criteria 5835

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

Theorem 30.0.13. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 5836
Consider S = (V, E) is a probability Hamiltonian-Type-Cycle-Cut. Let X be a Neutrosophic Variable 5837
and let t be a positive real number. Then 5838

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

Henry Garrett · 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. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 5839
S = (V, E) is a probability Hamiltonian-Type-Cycle-Cut. Let X be a Neutrosophic Variable and let t 5840
be a positive real number. Then 5841

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

Corollary 30.0.14. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 5843
Consider S = (V, E) is a probability Hamiltonian-Type-Cycle-Cut. Let Xn be a Neutrosophic Variable 5844
in a probability Hamiltonian-Type-Cycle-Cut (Vn , En ), n ≥ 1. If Ex(Xn ) 6= 0 and V (Xn ) << E 2 (Xn ), 5845
then 5846

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

Proof. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 5847
S = (V, E) is a probability Hamiltonian-Type-Cycle-Cut. Set X := Xn and t := |Ex(Xn )| in 5848
Chebyshev’s Inequality, and observe that E(Xn = 0) ≤ E(|Xn − Ex(Xn )| ≥ |Ex(Xn )|) because 5849
|Xn − Ex(Xn )| = |Ex(Xn )| when Xn = 0.  5850

Theorem 30.0.15. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 5851
Consider S = (V, E) is a probability Hamiltonian-Type-Cycle-Cut. Let G ∈ Gn,1/2 . For 0 ≤ k ≤ n, set 5852

f (k) := (n choose k)2−(k choose 2) and let k ∗ be the least value of k for which f (k) is less than 5853
one. Then almost surely α(G) takes one of the three values k ∗ − 2, k ∗ − 1, k ∗ . 5854

Proof. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 5855
S = (V, E) is a probability Hamiltonian-Type-Cycle-Cut. As in the proof of related Theorem, the result 5856
is straightforward.  5857

Corollary 30.0.16. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 5858
Consider S = (V, E) is a probability Hamiltonian-Type-Cycle-Cut. Let G ∈ Gn,1/2 and let f and k ∗ be 5859
as defined in previous Theorem. Then either: 5860

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

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

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

S = (V, E) is a probability Hamiltonian-Type-Cycle-Cut. The latter is straightforward.  5864

Definition 30.0.17. (Neutrosophic Threshold). 5865

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) 5866
is a probability Hamiltonian-Type-Cycle-Cut. Let P be a monotone property of SuperHyperGraphs 5867
(one which is preserved when SuperHyperEdges are added). Then a Neutrosophic Threshold 5868

for P is a function f (n) such that: 5869

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

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

Henry Garrett · 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 30.0.18. (Neutrosophic Balanced). 5872

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) 5873
is a probability Hamiltonian-Type-Cycle-Cut. Let F be a fixed Neutrosophic SuperHyperGraph. Then 5874
there is a threshold function for the property of containing a copy of F as a Neutrosophic 5875
SubSuperHyperGraph is called Neutrosophic Balanced. 5876

Theorem 30.0.19. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = 5877

(V, E). Consider S = (V, E) is a probability Hamiltonian-Type-Cycle-Cut. Let F be a nonempty 5878
balanced Neutrosophic SubSuperHyperGraph with k SuperHyperVertices and l SuperHyperEdges. 5879
Then n−k/l is a threshold function for the property of containing F as a Neutrosophic 5880
SubSuperHyperGraph. 5881

Proof. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 5882
S = (V, E) is a probability Hamiltonian-Type-Cycle-Cut. The latter is straightforward.  5883

136EXM1 Example 30.0.20. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E) 5884
in the mentioned Neutrosophic Figures in every Neutrosophic items. 5885

• On the Figure (30.1), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 5886

SuperHyperHamiltonian-Type-Cycle-Cut, is up. The Neutrosophic Algorithm is Neutrosophicly 5887
straightforward. E1 and E3 are some empty Neutrosophic SuperHyperEdges but E2 5888

is a loop Neutrosophic SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. 5889

Thus in the terms of Neutrosophic SuperHyperNeighbor, there’s only one Neutrosophic 5890
SuperHyperEdge, namely, E4 . The Neutrosophic SuperHyperVertex, V3 is Neutrosophic 5891
isolated means that there’s no Neutrosophic SuperHyperEdge has it as a Neutrosophic 5892
endpoint. Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in every given 5893
Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut. 5894

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

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

5895

• On the Figure (30.2), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 5896

SuperHyperHamiltonian-Type-Cycle-Cut, is up. The Neutrosophic Algorithm is Neutrosophicly 5897
straightforward. E1 , E2 and E3 are some empty Neutrosophic SuperHyperEdges 5898
but E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of Neutrosophic 5899
SuperHyperNeighbor, there’s only one Neutrosophic SuperHyperEdge, namely, E4 . The 5900
Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means that there’s no 5901

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

Henry Garrett · 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 30.1: The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of

Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut in the Neutrosophic Example (42.0.3) 136NSHG1

SuperHyperVertex, V3 , is excluded in every given Neutrosophic SuperHyperHamiltonian-Type- 5903

Cycle-Cut. 5904

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

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

5905

• On the Figure (30.3), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 5906

SuperHyperHamiltonian-Type-Cycle-Cut, is up. The Neutrosophic Algorithm is Neutrosophicly 5907

straightforward. 5908

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

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

Henry Garrett · 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 30.2: The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of

Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut in the Neutrosophic Example (42.0.3) 136NSHG2

C(N SHG)Neutrosophic V-Hamiltonian-Type-Cycle-Cut SuperHyperPolynomial

= z8 + z4 + z3.

5909

• On the Figure (30.4), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 5910

SuperHyperHamiltonian-Type-Cycle-Cut, is up. The Neutrosophic Algorithm is Neutrosophicly 5911
straightforward. 5912

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

= {E4 }.
C(N SHG)Neutrosophic Hamiltonian-Type-Cycle-Cut SuperHyperPolynomial
= z5.
C(N SHG)Neutrosophic V-Hamiltonian-Type-Cycle-Cut
= {V1 , V2 , V3 , {N }, {F }}.
C(N SHG)Neutrosophic V-Hamiltonian-Type-Cycle-Cut SuperHyperPolynomial
= z 4 + z 3 + z 2 + 2z.

5913

• On the Figure (30.5), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 5914

SuperHyperHamiltonian-Type-Cycle-Cut, is up. The Neutrosophic Algorithm is Neutrosophicly 5915

Henry Garrett · 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 30.3: The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of

Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut in the Neutrosophic Example (42.0.3) 136NSHG3

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

Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut in the Neutrosophic Example (42.0.3) 136NSHG4

Henry Garrett · 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 30.5: The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of

Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut in the Neutrosophic Example (42.0.3) 136NSHG5

straightforward. 5916

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

= {E1 }.
C(N SHG)Neutrosophic Hamiltonian-Type-Cycle-Cut SuperHyperPolynomial
= z5.
C(N SHG)Neutrosophic V-Hamiltonian-Type-Cycle-Cut
= {V1 , V2 , V3 , V4 , V5 }.
C(N SHG)Neutrosophic V-Hamiltonian-Type-Cycle-Cut SuperHyperPolynomial
= z 7 + 2z 4 + z 3 + z 2 .

5917

• On the Figure (30.6), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 5918

SuperHyperHamiltonian-Type-Cycle-Cut, is up. The Neutrosophic Algorithm is Neutrosophicly 5919
straightforward. 5920

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

= {Ei=110 , Ej=2232 , E12 }.
C(N SHG)Neutrosophic Hamiltonian-Type-Cycle-Cut SuperHyperPolynomial
= 22z 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

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

Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut in the Neutrosophic Example (42.0.3) 136NSHG6

C(N SHG)Neutrosophic V-Hamiltonian-Type-Cycle-Cut

= {Vi ∈ VN SHG }.
C(N SHG)Neutrosophic V-Hamiltonian-Type-Cycle-Cut SuperHyperPolynomial
X
= ai z bj .
5921

• On the Figure (30.7), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 5922

SuperHyperHamiltonian-Type-Cycle-Cut, is up. The Neutrosophic Algorithm is Neutrosophicly 5923
straightforward. 5924

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

= {E15 , E13 , E16 , E14 , E17 , E12 }.
C(N SHG)Neutrosophic Hamiltonian-Type-Cycle-Cut SuperHyperPolynomial
= 2z 5 + z 4 + 3z 2 .
C(N SHG)Neutrosophic V-Hamiltonian-Type-Cycle-Cut
= {Vi ∈ VN SHG }.
C(N SHG)Neutrosophic V-Hamiltonian-Type-Cycle-Cut SuperHyperPolynomial
X
= ai z bj .
5925

Henry Garrett · 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 30.7: The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of

Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut in the Neutrosophic Example (42.0.3) 136NSHG7

• On the Figure (30.8), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 5926

SuperHyperHamiltonian-Type-Cycle-Cut, is up. The Neutrosophic Algorithm is Neutrosophicly 5927
straightforward. 5928

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

= {E3 }.
C(N SHG)Neutrosophic Hamiltonian-Type-Cycle-Cut SuperHyperPolynomial
= z5.
C(N SHG)Neutrosophic V-Hamiltonian-Type-Cycle-Cut
= {Vi=811 , V!4 }.
C(N SHG)Neutrosophic V-Hamiltonian-Type-Cycle-Cut SuperHyperPolynomial
= z 6 + 3z 5 + z 4 .

5929

• On the Figure (30.9), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 5930

SuperHyperHamiltonian-Type-Cycle-Cut, is up. The Neutrosophic Algorithm is Neutrosophicly 5931
straightforward. 5932

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

= {Ei=110 , E22 , E12 }.
C(N SHG)Neutrosophic Hamiltonian-Type-Cycle-Cut SuperHyperPolynomial

Henry Garrett · 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 30.8: The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of

Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut in the Neutrosophic Example (42.0.3) 136NSHG8

= z 11 + 11z 2 .
C(N SHG)Neutrosophic V-Hamiltonian-Type-Cycle-Cut
= {Vi ∈ VN SHG }.
C(N SHG)Neutrosophic V-Hamiltonian-Type-Cycle-Cut SuperHyperPolynomial
X
= ai z bj .

5933

• On the Figure (30.10), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 5934

SuperHyperHamiltonian-Type-Cycle-Cut, is up. The Neutrosophic Algorithm is Neutrosophicly 5935
straightforward. 5936

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

= {E1 , E6 , E2 , E7 , E3 , E4 }.
C(N SHG)Neutrosophic Hamiltonian-Type-Cycle-Cut SuperHyperPolynomial
= 2z 5 + z 4 + 3z 2 .
C(N SHG)Neutrosophic V-Hamiltonian-Type-Cycle-Cut
= {Vi ∈ VN SHG }.
C(N SHG)Neutrosophic V-Hamiltonian-Type-Cycle-Cut SuperHyperPolynomial
X
= ai z bj .

Henry Garrett · 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 30.9: The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of

Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut in the Neutrosophic Example (42.0.3) 136NSHG9

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

Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut in the Neutrosophic Example (42.0.3) 136NSHG10

Henry Garrett · 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 30.11: The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of

Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut in the Neutrosophic Example (42.0.3) 136NSHG11

5937

• On the Figure (30.11), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 5938

SuperHyperHamiltonian-Type-Cycle-Cut, is up. The Neutrosophic Algorithm is Neutrosophicly 5939

straightforward. 5940

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

= {E1 , E6 , E3 , E8 }.
C(N SHG)Neutrosophic Hamiltonian-Type-Cycle-Cut SuperHyperPolynomial
= 2z 3 + 2z 2 .
C(N SHG)Neutrosophic V-Hamiltonian-Type-Cycle-Cut
= {Vi ∈ VN SHG }.
C(N SHG)Neutrosophic V-Hamiltonian-Type-Cycle-Cut SuperHyperPolynomial
X
= ai z bj .

5941

• On the Figure (30.12), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 5942

SuperHyperHamiltonian-Type-Cycle-Cut, is up. The Neutrosophic Algorithm is Neutrosophicly 5943

Henry Garrett · 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 30.12: The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of

Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut in the Neutrosophic Example (42.0.3) 136NSHG12

straightforward. 5944

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

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

5945

• On the Figure (30.13), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 5946

SuperHyperHamiltonian-Type-Cycle-Cut, is up. The Neutrosophic Algorithm is Neutrosophicly 5947
straightforward. 5948

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

= {E9 , E6 , E3 , E8 }.
C(N SHG)Neutrosophic Hamiltonian-Type-Cycle-Cut SuperHyperPolynomial
= 2z 3 + 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

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

Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut in the Neutrosophic Example (42.0.3) 136NSHG13

C(N SHG)Neutrosophic V-Hamiltonian-Type-Cycle-Cut

= {Vi ∈ VN SHG }.
C(N SHG)Neutrosophic V-Hamiltonian-Type-Cycle-Cut SuperHyperPolynomial
X
= ai z bj .

5949

• On the Figure (30.14), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 5950

SuperHyperHamiltonian-Type-Cycle-Cut, is up. The Neutrosophic Algorithm is Neutrosophicly 5951
straightforward. 5952

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

= {}.
C(N SHG)Neutrosophic Hamiltonian-Type-Cycle-Cut SuperHyperPolynomial
= 0z 0 .
C(N SHG)Neutrosophic V-Hamiltonian-Type-Cycle-Cut
= {}.
C(N SHG)Neutrosophic V-Hamiltonian-Type-Cycle-Cut SuperHyperPolynomial
= 0z 0 .

5953

Henry Garrett · 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 30.14: The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of

Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut in the Neutrosophic Example (42.0.3) 136NSHG14

• On the Figure (30.15), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 5954

SuperHyperHamiltonian-Type-Cycle-Cut, is up. The Neutrosophic Algorithm is Neutrosophicly 5955

straightforward. 5956

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

= {E4 }.
C(N SHG)Neutrosophic Hamiltonian-Type-Cycle-Cut SuperHyperPolynomial
= z2.
C(N SHG)Neutrosophic V-Hamiltonian-Type-Cycle-Cut
= {V3 , V4 }.
C(N SHG)Neutrosophic V-Hamiltonian-Type-Cycle-Cut SuperHyperPolynomial
= z4 + z3.

5957

Henry Garrett · 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 30.15: The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of

Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut in the Neutrosophic Example (42.0.3) 136NSHG15

• On the Figure (30.16), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 5958

SuperHyperHamiltonian-Type-Cycle-Cut, is up. The Neutrosophic Algorithm is Neutrosophicly 5959

straightforward. 5960

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

= {E4 }.
C(N SHG)Neutrosophic Hamiltonian-Type-Cycle-Cut SuperHyperPolynomial
= z 10 .
C(N SHG)Neutrosophic V-Hamiltonian-Type-Cycle-Cut
= {Vi=817 }.
C(N SHG)Neutrosophic V-Hamiltonian-Type-Cycle-Cut SuperHyperPolynomial
X
= ai z bj .

5961

• On the Figure (30.17), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 5962

SuperHyperHamiltonian-Type-Cycle-Cut, is up. The Neutrosophic Algorithm is Neutrosophicly 5963

straightforward. 5964

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

= {E4 }.
C(N SHG)Neutrosophic Hamiltonian-Type-Cycle-Cut 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 30.16: The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of

Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut in the Neutrosophic Example (42.0.3) 136NSHG16

C(N SHG)Neutrosophic V-Hamiltonian-Type-Cycle-Cut

= {Vi=817 }.
C(N SHG)Neutrosophic V-Hamiltonian-Type-Cycle-Cut SuperHyperPolynomial
X
= ai z bj .

5965

• On the Figure (30.18), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 5966

SuperHyperHamiltonian-Type-Cycle-Cut, is up. The Neutrosophic Algorithm is Neutrosophicly 5967
straightforward. 5968

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

= {E4 }.
C(N SHG)Neutrosophic Hamiltonian-Type-Cycle-Cut SuperHyperPolynomial
= z 10 .
C(N SHG)Neutrosophic V-Hamiltonian-Type-Cycle-Cut
= {Vi=817 }.
C(N SHG)Neutrosophic V-Hamiltonian-Type-Cycle-Cut SuperHyperPolynomial
X
= ai z bj .

5969

• On the Figure (30.19), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 5970

SuperHyperHamiltonian-Type-Cycle-Cut, is up. The Neutrosophic Algorithm is Neutrosophicly 5971

Henry Garrett · 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 30.17: The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of

Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut in the Neutrosophic Example (42.0.3) 136NSHG17

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

Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut in the Neutrosophic Example (42.0.3) 136NSHG18

Henry Garrett · 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 30.19: The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of

Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut in the Neutrosophic Example (42.0.3) 136NSHG19

straightforward. 5972

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

= {Ei=112 }.
C(N SHG)Neutrosophic Hamiltonian-Type-Cycle-Cut SuperHyperPolynomial
X
= ai z bj .
C(N SHG)Neutrosophic V-Hamiltonian-Type-Cycle-Cut
= {Vi ∈ VN SHG }.
C(N SHG)Neutrosophic V-Hamiltonian-Type-Cycle-Cut SuperHyperPolynomial
X
= ai z bj .

5973

• On the Figure (30.20), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 5974

SuperHyperHamiltonian-Type-Cycle-Cut, is up. The Neutrosophic Algorithm is Neutrosophicly 5975
straightforward. 5976

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

= {E6 }.
C(N SHG)Neutrosophic Hamiltonian-Type-Cycle-Cut SuperHyperPolynomial

Henry Garrett · 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 30.20: The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of

Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut in the Neutrosophic Example (42.0.3) 136NSHG20

= z bj .
C(N SHG)Neutrosophic V-Hamiltonian-Type-Cycle-Cut
= {Vi ∈ VE6 }.
C(N SHG)Neutrosophic V-Hamiltonian-Type-Cycle-Cut SuperHyperPolynomial
X
= ai z bj .
5977

• On the Figure (30.21), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 5978

SuperHyperHamiltonian-Type-Cycle-Cut, is up. The Neutrosophic Algorithm is Neutrosophicly 5979
straightforward. 5980

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

= {E1 , E2 }.
C(N SHG)Neutrosophic Hamiltonian-Type-Cycle-Cut SuperHyperPolynomial
= z 10 + z 2 .
C(N SHG)Neutrosophic V-Hamiltonian-Type-Cycle-Cut
= {VE2 }.
C(N SHG)Neutrosophic V-Hamiltonian-Type-Cycle-Cut SuperHyperPolynomial
= z 5 + 2z 3 + 7z.

Henry Garrett · 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 30.21: The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of

Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut in the Neutrosophic Example (42.0.3) 95NHG1

5981

• On the Figure (30.22), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 5982

SuperHyperHamiltonian-Type-Cycle-Cut, is up. The Neutrosophic Algorithm is Neutrosophicly 5983

straightforward. 5984

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

= {E2 }.
C(N SHG)Neutrosophic Hamiltonian-Type-Cycle-Cut SuperHyperPolynomial
= z 10 .
C(N SHG)Neutrosophic V-Hamiltonian-Type-Cycle-Cut
= {Vi ∈ VN SHG }.
C(N SHG)Neutrosophic V-Hamiltonian-Type-Cycle-Cut SuperHyperPolynomial
= z 5 + 2z 3 + 7z.

Henry Garrett · 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 30.22: The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of

Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut in the Neutrosophic Example (42.0.3) 95NHG2

5985

Proposition 30.0.21. Assume a connected Neutrosophic SuperHyperGraph ESHG : (V, E). The 5986
all interior Neutrosophic SuperHyperVertices belong to any Neutrosophic quasi-R-Hamiltonian-Type- 5987
Cycle-Cut if for any of them, and any of other corresponded Neutrosophic SuperHyperVertex, some 5988
interior Neutrosophic SuperHyperVertices are mutually Neutrosophic SuperHyperNeighbors with 5989
no Neutrosophic exception at all minus all Neutrosophic SuperHypeNeighbors to any amount of 5990
them. 5991

Proposition 30.0.22. Assume a connected non-obvious Neutrosophic SuperHyperGraph ESHG : 5992

(V, E). There’s only one Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) has only the maximum 5993
possibilities of the distinct interior Neutrosophic SuperHyperVertices inside of any given 5994
Neutrosophic quasi-R-Hamiltonian-Type-Cycle-Cut minus all Neutrosophic SuperHypeNeighbor to some 5995

of them but not all of them. In other words, there’s only an unique Neutrosophic SuperHyperEdge 5996
E ∈ EESHG:(V,E) has only two distinct Neutrosophic SuperHyperVertices in an Neutrosophic 5997
quasi-R-Hamiltonian-Type-Cycle-Cut, minus all Neutrosophic SuperHypeNeighbor to some of them but 5998
not all of them. 5999

Proposition 30.0.23. Assume a connected Neutrosophic SuperHyperGraph ESHG : (V, E). If

a Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) has z Neutrosophic SuperHyperVertices, then
the Neutrosophic cardinality of the Neutrosophic R-Hamiltonian-Type-Cycle-Cut is at least

V \ (V \ {aE , bE , cE , . . . , zE }).

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

It’s straightforward that the Neutrosophic cardinality of the Neutrosophic R-Hamiltonian-Type-Cycle- 6000
Cut is at least the maximum Neutrosophic number of Neutrosophic SuperHyperVertices of the 6001
Neutrosophic SuperHyperEdges with the maximum number of the Neutrosophic SuperHyperEdges. 6002
In other words, the maximum number of the Neutrosophic SuperHyperEdges contains 6003
the maximum Neutrosophic number of Neutrosophic SuperHyperVertices are renamed to 6004
Neutrosophic Hamiltonian-Type-Cycle-Cut in some cases but the maximum number of the Neutrosophic 6005

SuperHyperEdge with the maximum Neutrosophic number of Neutrosophic SuperHyperVertices, 6006

has the Neutrosophic SuperHyperVertices are contained in a Neutrosophic R-Hamiltonian-Type-Cycle- 6007
Cut. 6008

Proposition 30.0.24. Assume a simple Neutrosophic SuperHyperGraph ESHG : (V, E). Then
the Neutrosophic number of type-result-R-Hamiltonian-Type-Cycle-Cut has, the least Neutrosophic
cardinality, the lower sharp Neutrosophic bound for Neutrosophic cardinality, is the Neutrosophic
cardinality of

V \ V \ {aE , bE 0 , cE 00 , cE 000 }E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .

If there’s a Neutrosophic type-result-R-Hamiltonian-Type-Cycle-Cut with the least Neutrosophic 6009

cardinality, the lower sharp Neutrosophic bound for cardinality. 6010

Proposition 30.0.25. Assume a connected loopless Neutrosophic SuperHyperGraph ESHG : 6011

(V, E). Then in the worst case, literally, 6012

C(N SHG)N eutrosophicQuasi−Hamiltonian−T ype−Cycle−Cut = {V1 , E1 , V2 , E2 , V3 , E3 , V4 , E4 , V1 }.

C(N SHG)N eutrosophicQuasi−Hamiltonian−T ype−Cycle−CutSuperHyperP olynomial = z 4 .
C(N SHG)N eutrosophicQuasi−Hamiltonian−T ype−Cycle−Cut = {V1 , V2 , V3 , V4 , V1 }.
C(N SHG)N eutrosophicR−Quasi−Hamiltonian−T ype−Cycle−CutSuperHyperP olynomial = z 5 .

Is a Neutrosophic type-result-Hamiltonian-Type-Cycle-Cut. In other words, the least cardinality, the 6013

lower sharp bound for the cardinality, of a Neutrosophic type-result-Hamiltonian-Type-Cycle-Cut is the 6014
cardinality of 6015

C(N SHG)N eutrosophicQuasi−Hamiltonian−T ype−Cycle−Cut = {V1 , E1 , V2 , E2 , V3 , E3 , V4 , E4 , V1 }.

C(N SHG)N eutrosophicQuasi−Hamiltonian−T ype−Cycle−CutSuperHyperP olynomial = z 4 .
C(N SHG)N eutrosophicQuasi−Hamiltonian−T ype−Cycle−Cut = {V1 , V2 , V3 , V4 , V1 }.
C(N SHG)N eutrosophicR−Quasi−Hamiltonian−T ype−Cycle−CutSuperHyperP olynomial = z 5 .

Proof. Assume a connected loopless Neutrosophic SuperHyperGraph ESHG : (V, E). The
SuperHyperSet of the SuperHyperVertices V \ V \ {z} isn’t a quasi-R-Hamiltonian-Type-Cycle-Cut
since neither amount of Neutrosophic SuperHyperEdges nor amount of SuperHyperVertices
where amount refers to the Neutrosophic number of SuperHyperVertices(-/SuperHyperEdges)
more than one to form any kind of SuperHyperEdges or any number of SuperHyperEdges. Let
us consider the Neutrosophic SuperHyperSet

V \ V \ {aE , bE , cE , . . . , aE 0 , bE 0 , cE 0 , . . .}E,E 0 ={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .

This Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices has the eligibilities

to propose property such that there’s no Neutrosophic SuperHyperVertex of a Neutrosophic

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

SuperHyperEdge is common and there’s an Neutrosophic SuperHyperEdge for all Neutrosophic

SuperHyperVertices but the maximum Neutrosophic cardinality indicates that these Neutro-
sophic type-SuperHyperSets couldn’t give us the Neutrosophic lower bound in the term of
Neutrosophic sharpness. In other words, the Neutrosophic SuperHyperSet

V \ V \ {aE , bE , cE , . . . , aE 0 , bE 0 , cE 0 , . . .}E,E 0 ={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }}

of the Neutrosophic SuperHyperVertices implies at least on-quasi-triangle style is up but

sometimes the Neutrosophic SuperHyperSet

V \ V \ {aE , bE , cE , . . . , aE 0 , bE 0 , cE 0 , . . .}E,E 0 ={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }}

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

to the supposition on the connected loopless Neutrosophic SuperHyperGraph ESHG : (V, E).
Thus the minimum case never happens in the generality of the connected loopless Neutrosophic
SuperHyperGraphs. Thus if we assume in the worst case, literally,

V \ V \ {aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .

Is a quasi-R-Hamiltonian-Type-Cycle-Cut. In other words, the least cardinality, the lower sharp bound
for the cardinality, of a quasi-R-Hamiltonian-Type-Cycle-Cut is the cardinality of

V \ V \ {aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .

Then we’ve lost some connected loopless Neutrosophic SuperHyperClasses of the connected
loopless Neutrosophic SuperHyperGraphs titled free-triangle, on-triangle, and their quasi-types
but the SuperHyperStable is only up in this quasi-R-Hamiltonian-Type-Cycle-Cut. It’s the contradiction
to that fact on the generality. There are some counterexamples to deny this statement. One of
them comes from the setting of the graph titled path and cycle as the counterexamples-classes or
reversely direction star as the examples-classes, are well-known classes in that setting and they
could be considered as the examples-classes and counterexamples-classes for the tight bound of

V \ V \ {aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .

Let V \ V \ {z} in mind. There’s no necessity on the SuperHyperEdge since we need at least
two SuperHyperVertices to form a SuperHyperEdge. It doesn’t withdraw the principles of the
main definition since there’s no condition to be satisfied but the condition is on the existence of
the SuperHyperEdge instead of acting on the SuperHyperVertices. In other words, if there’s a
SuperHyperEdge, then the Neutrosophic SuperHyperSet has the necessary condition for the
intended definition to be applied. Thus the V \ V \ {z} is withdrawn not by the conditions of
the main definition but by the necessity of the pre-condition on the usage of the main definition.
The Neutrosophic structure of the Neutrosophic R-Hamiltonian-Type-Cycle-Cut decorates the
Neutrosophic SuperHyperVertices don’t have received any Neutrosophic connections so as
this Neutrosophic style implies different versions of Neutrosophic SuperHyperEdges with
the maximum Neutrosophic cardinality in the terms of Neutrosophic SuperHyperVertices
are spotlight. The lower Neutrosophic bound is to have the maximum Neutrosophic
groups of Neutrosophic SuperHyperVertices have perfect Neutrosophic connections inside

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

each of SuperHyperEdges and the outside of this Neutrosophic SuperHyperSet doesn’t

matter but regarding the connectedness of the used Neutrosophic SuperHyperGraph arising
from its Neutrosophic properties taken from the fact that it’s simple. If there’s no more
than one Neutrosophic SuperHyperVertex in the targeted Neutrosophic SuperHyperSet,
then there’s no Neutrosophic connection. Furthermore, the Neutrosophic existence of one
Neutrosophic SuperHyperVertex has no Neutrosophic effect to talk about the Neutrosophic
R-Hamiltonian-Type-Cycle-Cut. Since at least two Neutrosophic SuperHyperVertices involve to
make a title in the Neutrosophic background of the Neutrosophic SuperHyperGraph. The
Neutrosophic SuperHyperGraph is obvious if it has no Neutrosophic SuperHyperEdge
but at least two Neutrosophic SuperHyperVertices make the Neutrosophic version of
Neutrosophic SuperHyperEdge. Thus in the Neutrosophic setting of non-obvious Neutrosophic
SuperHyperGraph, there are at least one Neutrosophic SuperHyperEdge. It’s necessary to
mention that the word “Simple” is used as Neutrosophic adjective for the initial Neutrosophic
SuperHyperGraph, induces there’s no Neutrosophic appearance of the loop Neutrosophic
version of the Neutrosophic SuperHyperEdge and this Neutrosophic SuperHyperGraph is
said to be loopless. The Neutrosophic adjective “loop” on the basic Neutrosophic framework
engages one Neutrosophic SuperHyperVertex but it never happens in this Neutrosophic setting.
With these Neutrosophic bases, on a Neutrosophic SuperHyperGraph, there’s at least one
Neutrosophic SuperHyperEdge thus there’s at least a Neutrosophic R-Hamiltonian-Type-Cycle-Cut
has the Neutrosophic cardinality of a Neutrosophic SuperHyperEdge. Thus, a Neutrosophic R-
Hamiltonian-Type-Cycle-Cut has the Neutrosophic cardinality at least a Neutrosophic SuperHyperEdge.
Assume a Neutrosophic SuperHyperSet V \ V \ {z}. This Neutrosophic SuperHyperSet isn’t a
Neutrosophic R-Hamiltonian-Type-Cycle-Cut since either the Neutrosophic SuperHyperGraph is an
obvious Neutrosophic SuperHyperModel thus it never happens since there’s no Neutrosophic
usage of this Neutrosophic framework and even more there’s no Neutrosophic connection
inside or the Neutrosophic SuperHyperGraph isn’t obvious and as its consequences, there’s a
Neutrosophic contradiction with the term “Neutrosophic R-Hamiltonian-Type-Cycle-Cut” since the
maximum Neutrosophic cardinality never happens for this Neutrosophic style of the Neutrosophic
SuperHyperSet and beyond that there’s no Neutrosophic connection inside as mentioned in first
Neutrosophic case in the forms of drawback for this selected Neutrosophic SuperHyperSet. Let
V \ V \ {aE , bE , cE , . . . , aE 0 , bE 0 , cE 0 , . . .}E,E 0 ={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }}

Comes up. This Neutrosophic case implies having the Neutrosophic style of on-quasi-triangle
Neutrosophic style on the every Neutrosophic elements of this Neutrosophic SuperHyperSet.
Precisely, the Neutrosophic R-Hamiltonian-Type-Cycle-Cut is the Neutrosophic SuperHyperSet of the
Neutrosophic SuperHyperVertices such that some Neutrosophic amount of the Neutrosophic
SuperHyperVertices are on-quasi-triangle Neutrosophic style. The Neutrosophic cardinality of
the v SuperHypeSet
V \ V \ {aE , bE , cE , . . . , aE 0 , bE 0 , cE 0 , . . .}E,E 0 ={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }}

Is the maximum in comparison to the Neutrosophic SuperHyperSet

V \ V \ {aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .

But the lower Neutrosophic bound is up. Thus the minimum Neutrosophic cardinality of the
maximum Neutrosophic cardinality ends up the Neutrosophic discussion. The first Neutrosophic

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

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

V \ V \ {aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .

Has the maximum Neutrosophic cardinality such that

V \ V \ {aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .

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

Neutrosophic SuperHyperEdges for amount of Neutrosophic SuperHyperVertices taken from
the Neutrosophic SuperHyperSet

V \ V \ {aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .

It means that the Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices

V \ V \ {aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .

Is a Neutrosophic R-Hamiltonian-Type-Cycle-Cut for the Neutrosophic SuperHyperGraph as used

Neutrosophic background in the Neutrosophic terms of worst Neutrosophic case and the common
theme of the lower Neutrosophic bound occurred in the specific Neutrosophic SuperHyperClasses
of the Neutrosophic SuperHyperGraphs which are Neutrosophic free-quasi-triangle.
Assume a Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) has z Neutrosophic number of
the Neutrosophic SuperHyperVertices. Then every Neutrosophic SuperHyperVertex has at
least no Neutrosophic SuperHyperEdge with others in common. Thus those Neutrosophic
SuperHyperVertices have the eligibles to be contained in a Neutrosophic R-Hamiltonian-Type-
Cycle-Cut. Those Neutrosophic SuperHyperVertices are potentially included in a Neutrosophic
style-R-Hamiltonian-Type-Cycle-Cut. Formally, consider

V \ (V \ {aE , bE , cE , . . . , zE }).

Are the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) .

Thus
Zi ∼ Zj , i 6= j, i, j = 1, 2, . . . , z.
where the ∼ isn’t an equivalence relation but only the symmetric relation on the Neutrosophic
SuperHyperVertices of the Neutrosophic SuperHyperGraph. The formal definition is as follows.

Zi ∼ Zj , i 6= j, i, j = 1, 2, . . . , z

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

if and only if Zi and Zj are the Neutrosophic SuperHyperVertices and there’s only and only one
Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) between the Neutrosophic SuperHyperVertices
Zi and Zj . The other definition for the Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) in the
terms of Neutrosophic R-Hamiltonian-Type-Cycle-Cut is

{aE , bE , cE , . . . , zE } .

This definition coincides with the definition of the Neutrosophic R-Hamiltonian-Type-Cycle-Cut but
with slightly differences in the maximum Neutrosophic cardinality amid those Neutrosophic type-
SuperHyperSets of the Neutrosophic SuperHyperVertices. Thus the Neutrosophic SuperHyperSet
of the Neutrosophic SuperHyperVertices,

max |{Z1 , Z2 , . . . , Zz | Zi ∼ Zj , i 6= j, i, j = 1, 2, . . . , z}|Neutrosophic cardinality ,

z

and
V \ V \ {aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .

is formalized with mathematical literatures on the Neutrosophic R-Hamiltonian-Type-Cycle-Cut. Let

E
Zi ∼ Zj , be defined as Zi and Zj are the Neutrosophic SuperHyperVertices belong to the
Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) . Thus,
E
E = {Z1 , Z2 , . . . , Zz | Zi ∼ Zj , i 6= j, i, j = 1, 2, . . . , z}.

Or
{aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .

But with the slightly differences, 6016

Neutrosophic R-Hamiltonian-Type-Cycle-Cut =
E
{Z1 , Z2 , . . . , Zz | ∀i 6= j, i, j = 1, 2, . . . , z, ∃Ex , Zi ∼x Zj , }.
6017

Neutrosophic R-Hamiltonian-Type-Cycle-Cut =
V \ V \ {aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .

Thus E ∈ EESHG:(V,E) is a Neutrosophic quasi-R-Hamiltonian-Type-Cycle-Cut where E ∈ EESHG:(V,E)

is fixed that means Ex = E ∈ EESHG:(V,E) . for all Neutrosophic intended SuperHyperVertices
but in a Neutrosophic Hamiltonian-Type-Cycle-Cut, Ex = E ∈ EESHG:(V,E) could be different and it’s
not unique. To sum them up, in a connected Neutrosophic SuperHyperGraph ESHG : (V, E).
If a Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) has z Neutrosophic SuperHyperVertices,
then the Neutrosophic cardinality of the Neutrosophic R-Hamiltonian-Type-Cycle-Cut is at least

V \ (V \ {aE , bE , cE , . . . , zE }).

It’s straightforward that the Neutrosophic cardinality of the Neutrosophic R-Hamiltonian-Type- 6018
Cycle-Cut is at least the maximum Neutrosophic number of Neutrosophic SuperHyperVertices of 6019
the Neutrosophic SuperHyperEdges with the maximum number of the Neutrosophic SuperHy- 6020

perEdges. In other words, the maximum number of the Neutrosophic SuperHyperEdges contains 6021

Henry Garrett · 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 maximum Neutrosophic number of Neutrosophic SuperHyperVertices are renamed to Neut- 6022
rosophic Hamiltonian-Type-Cycle-Cut in some cases but the maximum number of the Neutrosophic 6023
SuperHyperEdge with the maximum Neutrosophic number of Neutrosophic SuperHyperVertices, 6024
has the Neutrosophic SuperHyperVertices are contained in a Neutrosophic R-Hamiltonian-Type-Cycle- 6025
Cut. 6026
The obvious SuperHyperGraph has no Neutrosophic SuperHyperEdges. But the non-obvious 6027

Neutrosophic SuperHyperModel is up. The quasi-SuperHyperModel addresses some issues 6028

about the Neutrosophic optimal SuperHyperObject. It specially delivers some remarks on 6029
the Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices such that there’s 6030
distinct amount of Neutrosophic SuperHyperEdges for distinct amount of Neutrosophic Supe- 6031
rHyperVertices up to all taken from that Neutrosophic SuperHyperSet of the Neutrosophic 6032
SuperHyperVertices but this Neutrosophic SuperHyperSet of the Neutrosophic SuperHyper- 6033

Vertices is either has the maximum Neutrosophic SuperHyperCardinality or it doesn’t have 6034
maximum Neutrosophic SuperHyperCardinality. In a non-obvious SuperHyperModel, there’s 6035
at least one Neutrosophic SuperHyperEdge containing at least all Neutrosophic SuperHyper- 6036
Vertices. Thus it forms a Neutrosophic quasi-R-Hamiltonian-Type-Cycle-Cut where the Neutrosophic 6037
completion of the Neutrosophic incidence is up in that. Thus it’s, literarily, a Neutrosophic 6038
embedded R-Hamiltonian-Type-Cycle-Cut. The SuperHyperNotions of embedded SuperHyperSet and 6039

quasi-SuperHyperSet coincide. In the original setting, these types of SuperHyperSets only 6040
don’t satisfy on the maximum SuperHyperCardinality. Thus the embedded setting is elected 6041
such that those SuperHyperSets have the maximum Neutrosophic SuperHyperCardinality and 6042
they’re Neutrosophic SuperHyperOptimal. The less than two distinct types of Neutrosophic 6043
SuperHyperVertices are included in the minimum Neutrosophic style of the embedded Neut- 6044
rosophic R-Hamiltonian-Type-Cycle-Cut. The interior types of the Neutrosophic SuperHyperVertices 6045

are deciders. Since the Neutrosophic number of SuperHyperNeighbors are only affected by 6046
the interior Neutrosophic SuperHyperVertices. The common connections, more precise and 6047
more formal, the perfect unique connections inside the Neutrosophic SuperHyperSet for any 6048
distinct types of Neutrosophic SuperHyperVertices pose the Neutrosophic R-Hamiltonian-Type-Cycle- 6049
Cut. Thus Neutrosophic exterior SuperHyperVertices could be used only in one Neutrosophic 6050
SuperHyperEdge and in Neutrosophic SuperHyperRelation with the interior Neutrosophic 6051

SuperHyperVertices in that Neutrosophic SuperHyperEdge. In the embedded Neutrosophic 6052

Hamiltonian-Type-Cycle-Cut, there’s the usage of exterior Neutrosophic SuperHyperVertices since 6053
they’ve more connections inside more than outside. Thus the title “exterior” is more relevant 6054
than the title “interior”. One Neutrosophic SuperHyperVertex has no connection, inside. Thus, 6055
the Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices with one SuperHyper- 6056

Element has been ignored in the exploring to lead on the optimal case implying the Neutrosophic 6057
R-Hamiltonian-Type-Cycle-Cut. The Neutrosophic R-Hamiltonian-Type-Cycle-Cut with the exclusion of the 6058
exclusion of all Neutrosophic SuperHyperVertices in one Neutrosophic SuperHyperEdge and with 6059
other terms, the Neutrosophic R-Hamiltonian-Type-Cycle-Cut with the inclusion of all Neutrosophic 6060
SuperHyperVertices in one Neutrosophic SuperHyperEdge, is a Neutrosophic quasi-R-Hamiltonian- 6061
Type-Cycle-Cut. To sum them up, in a connected non-obvious Neutrosophic SuperHyperGraph 6062

ESHG : (V, E). There’s only one Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) has only the 6063
maximum possibilities of the distinct interior Neutrosophic SuperHyperVertices inside of any 6064
given Neutrosophic quasi-R-Hamiltonian-Type-Cycle-Cut minus all Neutrosophic SuperHypeNeighbor 6065
to some of them but not all of them. In other words, there’s only an unique Neutrosophic 6066
SuperHyperEdge E ∈ EESHG:(V,E) has only two distinct Neutrosophic SuperHyperVertices in 6067

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

an Neutrosophic quasi-R-Hamiltonian-Type-Cycle-Cut, minus all Neutrosophic SuperHypeNeighbor to 6068

some of them but not all of them. 6069
The main definition of the Neutrosophic R-Hamiltonian-Type-Cycle-Cut has two titles. a Neutro- 6070
sophic quasi-R-Hamiltonian-Type-Cycle-Cut and its corresponded quasi-maximum Neutrosophic R- 6071
SuperHyperCardinality are two titles in the terms of quasi-R-styles. For any Neutrosophic 6072
number, there’s a Neutrosophic quasi-R-Hamiltonian-Type-Cycle-Cut with that quasi-maximum Neut- 6073

rosophic SuperHyperCardinality in the terms of the embedded Neutrosophic SuperHyper- 6074

Graph. If there’s an embedded Neutrosophic SuperHyperGraph, then the Neutrosophic quasi- 6075
SuperHyperNotions lead us to take the collection of all the Neutrosophic quasi-R-Hamiltonian- 6076
Type-Cycle-Cuts for all Neutrosophic numbers less than its Neutrosophic corresponded maximum 6077
number. The essence of the Neutrosophic Hamiltonian-Type-Cycle-Cut ends up but this essence starts 6078
up in the terms of the Neutrosophic quasi-R-Hamiltonian-Type-Cycle-Cut, again and more in the 6079

operations of collecting all the Neutrosophic quasi-R-Hamiltonian-Type-Cycle-Cuts acted on the all 6080
possible used formations of the Neutrosophic SuperHyperGraph to achieve one Neutrosophic 6081
number. This Neutrosophic number is 6082
considered as the equivalence class for all corresponded quasi-R-Hamiltonian-Type-Cycle-Cuts. Let 6083
zNeutrosophic Number , SNeutrosophic SuperHyperSet and GNeutrosophic Hamiltonian-Type-Cycle-Cut be a Neut- 6084
rosophic number, a Neutrosophic SuperHyperSet and a Neutrosophic Hamiltonian-Type-Cycle-Cut. 6085

Then 6086

[zNeutrosophic Number ]Neutrosophic Class = {SNeutrosophic SuperHyperSet |

SNeutrosophic SuperHyperSet = GNeutrosophic Hamiltonian-Type-Cycle-Cut ,
|SNeutrosophic SuperHyperSet |Neutrosophic Cardinality
= zNeutrosophic Number }.

As its consequences, the formal definition of the Neutrosophic Hamiltonian-Type-Cycle-Cut is re- 6087
formalized and redefined as follows. 6088

GNeutrosophic Hamiltonian-Type-Cycle-Cut ∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class =

∪zNeutrosophic Number {SNeutrosophic SuperHyperSet |
SNeutrosophic SuperHyperSet = GNeutrosophic Hamiltonian-Type-Cycle-Cut ,
|SNeutrosophic SuperHyperSet |Neutrosophic Cardinality
= zNeutrosophic Number }.

To get more precise perceptions, the follow-up expressions propose another formal technical 6089
definition for the Neutrosophic Hamiltonian-Type-Cycle-Cut. 6090

GNeutrosophic Hamiltonian-Type-Cycle-Cut =
{S ∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class =
∪zNeutrosophic Number {SNeutrosophic SuperHyperSet |
SNeutrosophic SuperHyperSet = GNeutrosophic Hamiltonian-Type-Cycle-Cut ,
|SNeutrosophic SuperHyperSet |Neutrosophic Cardinality
= zNeutrosophic Number |
|SNeutrosophic SuperHyperSet |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

= max zNeutrosophic Number }.

[zNeutrosophic Number ]Neutrosophic Class

In more concise and more convenient ways, the modified definition for the Neutrosophic 6091
poses the upcoming expressions.
Hamiltonian-Type-Cycle-Cut 6092

GNeutrosophic Hamiltonian-Type-Cycle-Cut =
{S ∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class |
|SNeutrosophic SuperHyperSet |Neutrosophic Cardinality
= max zNeutrosophic Number }.
[zNeutrosophic Number ]Neutrosophic Class

To translate the statement to this mathematical literature, the formulae will be revised. 6093

GNeutrosophic Hamiltonian-Type-Cycle-Cut =
{S ∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class |
|SNeutrosophic SuperHyperSet |Neutrosophic Cardinality
= max zNeutrosophic Number
[zNeutrosophic Number ]Neutrosophic Class

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

And then, 6094

GNeutrosophic Hamiltonian-Type-Cycle-Cut =
{S ∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class |
|SNeutrosophic SuperHyperSet |Neutrosophic Cardinality

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

To get more visions in the closer look-up, there’s an overall overlook. 6095

GNeutrosophic Hamiltonian-Type-Cycle-Cut ∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class =

∪zNeutrosophic Number {SNeutrosophic SuperHyperSet |
SNeutrosophic SuperHyperSet = GNeutrosophic Hamiltonian-Type-Cycle-Cut ,
|SNeutrosophic SuperHyperSet |Neutrosophic Cardinality

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

GNeutrosophic Hamiltonian-Type-Cycle-Cut =
{S ∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class =
∪zNeutrosophic Number {SNeutrosophic SuperHyperSet |
SNeutrosophic SuperHyperSet = GNeutrosophic Hamiltonian-Type-Cycle-Cut ,
|SNeutrosophic SuperHyperSet |Neutrosophic Cardinality
= zNeutrosophic Number |
|SNeutrosophic SuperHyperSet |Neutrosophic Cardinality

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

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

6097

GNeutrosophic Hamiltonian-Type-Cycle-Cut =
{S ∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class |
|SNeutrosophic SuperHyperSet |Neutrosophic Cardinality
= max zNeutrosophic Number
[zNeutrosophic Number ]Neutrosophic Class

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

GNeutrosophic Hamiltonian-Type-Cycle-Cut =
{S ∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class |
|SNeutrosophic SuperHyperSet |Neutrosophic Cardinality

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

Now, the extension of these types of approaches is up. Since the new term, “Neutrosophic 6099
SuperHyperNeighborhood”, could be redefined as the collection of the Neutrosophic SuperHy- 6100
perVertices such that any amount of its Neutrosophic SuperHyperVertices are incident to a 6101
Neutrosophic SuperHyperEdge. It’s, literarily, another name for “Neutrosophic Quasi-Hamiltonian- 6102
Type-Cycle-Cut” but, precisely, it’s the generalization of “Neutrosophic Quasi-Hamiltonian-Type-Cycle-Cut” 6103
since “Neutrosophic Quasi-Hamiltonian-Type-Cycle-Cut” happens “Neutrosophic Hamiltonian-Type-Cycle-Cut” 6104
in a Neutrosophic SuperHyperGraph as initial framework and background but “Neutrosophic 6105
SuperHyperNeighborhood” may not happens “Neutrosophic Hamiltonian-Type-Cycle-Cut” in a Neut- 6106
rosophic SuperHyperGraph as initial framework and preliminarily background since there are 6107
some ambiguities about the Neutrosophic SuperHyperCardinality arise from it. To get orderly 6108
keywords, the terms, “Neutrosophic SuperHyperNeighborhood”, “Neutrosophic Quasi-Hamiltonian- 6109
Type-Cycle-Cut”, and “Neutrosophic Hamiltonian-Type-Cycle-Cut” are up. 6110
Thus, let zNeutrosophic Number , NNeutrosophic SuperHyperNeighborhood and GNeutrosophic Hamiltonian-Type-Cycle-Cut
6111

be a Neutrosophic number, a Neutrosophic SuperHyperNeighborhood and a Neutrosophic 6112

Hamiltonian-Type-Cycle-Cut and the new terms are up. 6113

GNeutrosophic Hamiltonian-Type-Cycle-Cut ∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class =

∪zNeutrosophic Number {NNeutrosophic SuperHyperNeighborhood |
|NNeutrosophic SuperHyperNeighborhood |Neutrosophic Cardinality
= max zNeutrosophic Number }.
[zNeutrosophic Number ]Neutrosophic Class

6114

GNeutrosophic Hamiltonian-Type-Cycle-Cut =
{NNeutrosophic SuperHyperNeighborhood
∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class =
∪zNeutrosophic Number {NNeutrosophic SuperHyperNeighborhood |
|NNeutrosophic SuperHyperSet |Neutrosophic Cardinality
= zNeutrosophic Number |
|NNeutrosophic SuperHyperNeighborhood |Neutrosophic Cardinality

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

= max zNeutrosophic Number }.

[zNeutrosophic Number ]Neutrosophic Class

6115

GNeutrosophic Hamiltonian-Type-Cycle-Cut =
{NNeutrosophic SuperHyperNeighborhood
∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class |
|NNeutrosophic SuperHyperNeighborhood |Neutrosophic Cardinality
= max zNeutrosophic Number }.
[zNeutrosophic Number ]Neutrosophic Class

6116

GNeutrosophic Hamiltonian-Type-Cycle-Cut =
{NNeutrosophic SuperHyperNeighborhood
∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class |
|NNeutrosophic SuperHyperSet |Neutrosophic Cardinality
= max zNeutrosophic Number }.
[zNeutrosophic Number ]Neutrosophic Class

And with go back to initial structure, 6117

GNeutrosophic Hamiltonian-Type-Cycle-Cut ∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class =

∪zNeutrosophic Number {NNeutrosophic SuperHyperNeighborhood |
|NNeutrosophic SuperHyperNeighborhood |Neutrosophic Cardinality

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

GNeutrosophic Hamiltonian-Type-Cycle-Cut =
{NNeutrosophic SuperHyperNeighborhood
∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class =
∪zNeutrosophic Number {NNeutrosophic SuperHyperNeighborhood |
|NNeutrosophic SuperHyperSet |Neutrosophic Cardinality
= zNeutrosophic Number |
|NNeutrosophic SuperHyperNeighborhood |Neutrosophic Cardinality

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

GNeutrosophic Hamiltonian-Type-Cycle-Cut =
{NNeutrosophic SuperHyperNeighborhood
∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class |
|NNeutrosophic SuperHyperNeighborhood |Neutrosophic Cardinality
= max zNeutrosophic Number
[zNeutrosophic Number ]Neutrosophic Class

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

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

6120

GNeutrosophic Hamiltonian-Type-Cycle-Cut =
{NNeutrosophic SuperHyperNeighborhood
∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class |
|NNeutrosophic SuperHyperSet |Neutrosophic Cardinality

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

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

V \ V \ {aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .

The Neutrosophic SuperHyperSet of Neutrosophic SuperHyperVertices,

V \ V \ {aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .

Is the simple Neutrosophic type-SuperHyperSet of the Neutrosophic R-Hamiltonian-Type-Cycle-Cut.

The Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices,

V \ V \ {aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .

Is an Neutrosophic R-Hamiltonian-Type-Cycle-Cut C(ESHG) for an Neutrosophic SuperHyper-

Graph ESHG : (V, E) is a Neutrosophic type-SuperHyperSet with

the maximum Neutrosophic cardinality of a Neutrosophic SuperHyperSet S of Neutro-

sophic SuperHyperVertices such that there’s no a Neutrosophic SuperHyperEdge amid some Neut-
rosophic SuperHyperVertices instead of all given by Neutrosophic Hamiltonian-Type-Cycle-Cut is
related to the Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices,

V \ V \ {aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .

There’s not only one Neutrosophic SuperHyperVertex inside the intended Neutrosophic
SuperHyperSet. Thus the non-obvious Neutrosophic Hamiltonian-Type-Cycle-Cut is up. The obvious
simple Neutrosophic type-SuperHyperSet called the Neutrosophic Hamiltonian-Type-Cycle-Cut is a
Neutrosophic SuperHyperSet includes only one Neutrosophic SuperHyperVertex. But the
Neutrosophic SuperHyperSet of Neutrosophic SuperHyperVertices,

V \ V \ {aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

doesn’t have less than two SuperHyperVertices inside the intended Neutrosophic SuperHyperSet
since they’ve come from at least so far an SuperHyperEdge. Thus the non-obvious simple
Neutrosophic type-SuperHyperSet of the Neutrosophic R-Hamiltonian-Type-Cycle-Cut is up. To sum
them up, the Neutrosophic SuperHyperSet of Neutrosophic SuperHyperVertices,

V \ V \ {aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .

Is the non-obvious simple Neutrosophic type-SuperHyperSet of the Neutrosophic R-Hamiltonian-

. Since the Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices,
Type-Cycle-Cut

(V \ V \ {x, z}) ∪ {xy}

or
(V \ V \ {x, z}) ∪ {zy}
is an Neutrosophic R-Hamiltonian-Type-Cycle-Cut C(ESHG) for an Neutrosophic SuperHyperGraph
ESHG : (V, E) is the Neutrosophic SuperHyperSet S of Neutrosophic SuperHyperVertices
such that there’s no a Neutrosophic SuperHyperEdge for some Neutrosophic SuperHyperVer-
tices instead of all given by that Neutrosophic type-SuperHyperSet called the Neutrosophic
Hamiltonian-Type-Cycle-Cut and it’s an Neutrosophic Hamiltonian-Type-Cycle-Cut. Since it’s

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

rosophic SuperHyperVertices such that there’s no a Neutrosophic SuperHyperEdge for some
amount Neutrosophic SuperHyperVertices instead of all given by that Neutrosophic type-
SuperHyperSet called the Neutrosophic Hamiltonian-Type-Cycle-Cut. There isn’t only less than two
Neutrosophic SuperHyperVertices inside the intended Neutrosophic SuperHyperSet,

V \ V \ {aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .

Thus the non-obvious Neutrosophic R-Hamiltonian-Type-Cycle-Cut,

V \ V \ {aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .

is up. The non-obvious simple Neutrosophic type-SuperHyperSet of the Neutrosophic Hamiltonian-

, not:
Type-Cycle-Cut

V \ V \ {aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .

Is the Neutrosophic SuperHyperSet, not:

V \ V \ {aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .

does includes only less than two SuperHyperVertices in a connected Neutrosophic Super- 6121
HyperGraph ESHG : (V, E) but it’s impossible in the case, they’ve corresponded to an 6122
SuperHyperEdge. It’s interesting to mention that the only non-obvious simple Neutrosophic 6123
type-SuperHyperSet called the 6124

“Neutrosophic R-Hamiltonian-Type-Cycle-Cut” 6125

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

amid those obvious[non-obvious] simple Neutrosophic type-SuperHyperSets called the 6126

Neutrosophic R-Hamiltonian-Type-Cycle-Cut, 6127

is only and only

V \ V \ {aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .

In a connected Neutrosophic SuperHyperGraph ESHG : (V, E) with a illustrated SuperHyper-

Modeling. It’s also, not only a Neutrosophic free-triangle embedded SuperHyperModel and a
Neutrosophic on-triangle embedded SuperHyperModel but also it’s a Neutrosophic stable em-
bedded SuperHyperModel. But all only non-obvious simple Neutrosophic type-SuperHyperSets
of the Neutrosophic R-Hamiltonian-Type-Cycle-Cut amid those obvious simple Neutrosophic type-
SuperHyperSets of the Neutrosophic Hamiltonian-Type-Cycle-Cut, are

V \ V \ {aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .

In a connected Neutrosophic SuperHyperGraph ESHG : (V, E).

To sum them up, assume a connected loopless Neutrosophic SuperHyperGraph ESHG : (V, E).
Then in the worst case, literally,

V \ V \ {aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .

is a Neutrosophic R-Hamiltonian-Type-Cycle-Cut. In other words, the least cardinality, the lower sharp
bound for the cardinality, of a Neutrosophic R-Hamiltonian-Type-Cycle-Cut is the cardinality of

V \ V \ {aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .

6128

To sum them up, in a connected Neutrosophic SuperHyperGraph ESHG : (V, E). The all 6129
interior Neutrosophic SuperHyperVertices belong to any Neutrosophic quasi-R-Hamiltonian-Type- 6130
Cycle-Cut if for any of them, and any of other corresponded Neutrosophic SuperHyperVertex, some 6131
interior Neutrosophic SuperHyperVertices are mutually Neutrosophic SuperHyperNeighbors 6132
with no Neutrosophic exception at all minus all Neutrosophic SuperHypeNeighbors to any 6133
amount of them. 6134

Assume a connected Neutrosophic SuperHyperGraph ESHG : (V, E). Let a Neutrosophic Supe- 6135
rHyperEdge ESHE : E ∈ EESHG:(V,E) has some Neutrosophic SuperHyperVertices r. Consider 6136
all Neutrosophic numbers of those Neutrosophic SuperHyperVertices from that Neutrosophic 6137
SuperHyperEdge excluding excluding more than r distinct Neutrosophic SuperHyperVertices, 6138
exclude to any given Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices. 6139
Consider there’s a Neutrosophic R-Hamiltonian-Type-Cycle-Cut with the least cardinality, the lower 6140

sharp Neutrosophic bound for Neutrosophic cardinality. Assume a connected Neutrosophic 6141
SuperHyperGraph ESHG : (V, E). The Neutrosophic SuperHyperSet of the Neutrosophic 6142
SuperHyperVertices VESHE \ {z} is a Neutrosophic SuperHyperSet S of the Neutrosophic Su- 6143
perHyperVertices such that there’s a Neutrosophic SuperHyperEdge to have some Neutrosophic 6144
SuperHyperVertices uniquely but it isn’t a Neutrosophic R-Hamiltonian-Type-Cycle-Cut. Since it 6145
doesn’t have 6146

6147

Henry Garrett · 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 maximum Neutrosophic cardinality of a Neutrosophic SuperHyperSet S of Neut- 6148

rosophic SuperHyperVertices such that there’s a Neutrosophic SuperHyperEdge to have some 6149
SuperHyperVertices uniquely. The Neutrosophic SuperHyperSet of the Neutrosophic Supe- 6150
rHyperVertices VESHE ∪ {z} is the maximum Neutrosophic cardinality of a Neutrosophic 6151
SuperHyperSet S of Neutrosophic SuperHyperVertices but it isn’t a Neutrosophic R-Hamiltonian- 6152
Type-Cycle-Cut. Since it doesn’t do the Neutrosophic procedure such that such that there’s a 6153

Neutrosophic SuperHyperEdge to have some Neutrosophic SuperHyperVertices uniquely [there 6154

are at least one Neutrosophic SuperHyperVertex outside implying there’s, sometimes in the 6155
connected Neutrosophic SuperHyperGraph ESHG : (V, E), a Neutrosophic SuperHyperVer- 6156
tex, titled its Neutrosophic SuperHyperNeighbor, to that Neutrosophic SuperHyperVertex 6157
in the Neutrosophic SuperHyperSet S so as S doesn’t do “the Neutrosophic procedure”.]. 6158
There’s only one Neutrosophic SuperHyperVertex outside the intended Neutrosophic Super- 6159

HyperSet, VESHE ∪ {z}, in the terms of Neutrosophic SuperHyperNeighborhood. Thus the 6160
obvious Neutrosophic R-Hamiltonian-Type-Cycle-Cut, VESHE is up. The obvious simple Neutrosophic 6161
type-SuperHyperSet of the Neutrosophic R-Hamiltonian-Type-Cycle-Cut, VESHE , is a Neutrosophic Su- 6162
perHyperSet, VESHE , includes only all Neutrosophic SuperHyperVertices does forms any kind 6163
of Neutrosophic pairs are titled Neutrosophic SuperHyperNeighbors in a connected Neutrosophic 6164
SuperHyperGraph ESHG : (V, E). Since the Neutrosophic SuperHyperSet of the Neutrosophic 6165

SuperHyperVertices VESHE , is the maximum Neutrosophic SuperHyperCardinality of 6166

a Neutrosophic SuperHyperSet S of Neutrosophic SuperHyperVertices such that there’s 6167
a Neutrosophic SuperHyperEdge to have some Neutrosophic SuperHyperVertices uniquely. 6168
Thus, in a connected Neutrosophic SuperHyperGraph ESHG : (V, E). Any Neutrosophic 6169
R-Hamiltonian-Type-Cycle-Cut only contains all interior Neutrosophic SuperHyperVertices and all 6170
exterior Neutrosophic SuperHyperVertices from the unique Neutrosophic SuperHyperEdge 6171

where there’s any of them has all possible Neutrosophic SuperHyperNeighbors in and there’s all 6172
Neutrosophic SuperHyperNeighborhoods in with no exception minus all Neutrosophic SuperHy- 6173
peNeighbors to some of them not all of them but everything is possible about Neutrosophic 6174
SuperHyperNeighborhoods and Neutrosophic SuperHyperNeighbors out. 6175
The SuperHyperNotion, namely, Hamiltonian-Type-Cycle-Cut, is up. There’s neither empty SuperHy- 6176
perEdge nor loop SuperHyperEdge. The following Neutrosophic SuperHyperSet of Neutrosophic 6177

SuperHyperEdges[SuperHyperVertices] is the simple Neutrosophic type-SuperHyperSet of 6178

the Neutrosophic Hamiltonian-Type-Cycle-Cut. The Neutrosophic SuperHyperSet of Neutrosophic 6179
SuperHyperEdges[SuperHyperVertices], 6180

C(N SHG)N eutrosophicQuasi−Hamiltonian−T ype−Cycle−Cut

|EESHG:(V,E) |Neutrosophic Cardinality
b c
= {E2i−1 }i=1 2
.
C(N SHG)N eutrosophicQuasi−Hamiltonian−T ype−Cycle−CutSuperHyperP olynomial
|EESHG:(V,E) |Neutrosophic Cardinality
= 2z b 2 c
.
C(N SHG)N eutrosophicR−Quasi−Hamiltonian−T ype−Cycle−Cut = {Vi }si=1 , {Vj }tj=1 .
C(N SHG)N eutrosophicR−Quasi−Hamiltonian−T ype−Cycle−CutSuperHyperP olynomial = az s + bz t .

is the simple Neutrosophic type-SuperHyperSet of the Neutrosophic Hamiltonian-Type-Cycle-Cut. The 6181

Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperEdges[SuperHyperVertices], 6182

C(N SHG)N eutrosophicQuasi−Hamiltonian−T ype−Cycle−Cut

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics ·
DrHenryGarrett@gmail.com · Manhattan, NY, USA
|EESHG:(V,E) |Neutrosophic Cardinality
b c
= {E2i−1 }i=1 2
.
C(N SHG)N eutrosophicQuasi−Hamiltonian−T ype−Cycle−CutSuperHyperP olynomial
|EESHG:(V,E) |Neutrosophic Cardinality
= 2z b 2 c
.
C(N SHG)N eutrosophicR−Quasi−Hamiltonian−T ype−Cycle−Cut = {Vi }si=1 , {Vj }tj=1 .
C(N SHG)N eutrosophicR−Quasi−Hamiltonian−T ype−Cycle−CutSuperHyperP olynomial = az s + bz t .
Is an Neutrosophic Hamiltonian-Type-Cycle-Cut C(ESHG) for an Neutrosophic SuperHyper- 6183
Graph ESHG : (V, E) is a Neutrosophic type-SuperHyperSet with 6184

6185
the maximum Neutrosophic cardinality of a Neutrosophic SuperHyperSet S of Neut- 6186
rosophic SuperHyperEdges[SuperHyperVertices] such that there’s no Neutrosophic Super- 6187
HyperVertex of a Neutrosophic SuperHyperEdge is common and there’s an Neutrosophic 6188
SuperHyperEdge for all Neutrosophic SuperHyperVertices. There are not only two Neut- 6189
rosophic SuperHyperVertices inside the intended Neutrosophic SuperHyperSet. Thus the 6190

non-obvious Neutrosophic Hamiltonian-Type-Cycle-Cut is up. The obvious simple Neutrosophic type- 6191
SuperHyperSet called the Neutrosophic Hamiltonian-Type-Cycle-Cut is a Neutrosophic SuperHyperSet 6192
includes only two Neutrosophic SuperHyperVertices. But the Neutrosophic SuperHyperSet of 6193
the Neutrosophic SuperHyperEdges[SuperHyperVertices], 6194

C(N SHG)N eutrosophicQuasi−Hamiltonian−T ype−Cycle−Cut

|EESHG:(V,E) |Neutrosophic Cardinality
b c
= {E2i−1 }i=1 2
.
C(N SHG)N eutrosophicQuasi−Hamiltonian−T ype−Cycle−CutSuperHyperP olynomial
|EESHG:(V,E) |Neutrosophic Cardinality
= 2z b 2 c
.
C(N SHG)N eutrosophicR−Quasi−Hamiltonian−T ype−Cycle−Cut = {Vi }si=1 , {Vj }tj=1 .
C(N SHG)N eutrosophicR−Quasi−Hamiltonian−T ype−Cycle−CutSuperHyperP olynomial = az s + bz t .
Doesn’t have less than three SuperHyperVertices inside the intended Neutrosophic SuperHy- 6195
perSet. Thus the non-obvious simple Neutrosophic type-SuperHyperSet of the Neutrosophic 6196
Hamiltonian-Type-Cycle-Cut is up. To sum them up, the Neutrosophic SuperHyperSet of the Neutro- 6197
sophic SuperHyperEdges[SuperHyperVertices], 6198

C(N SHG)N eutrosophicQuasi−Hamiltonian−T ype−Cycle−Cut

|EESHG:(V,E) |Neutrosophic Cardinality
b c
= {E2i−1 }i=1 2
.
C(N SHG)N eutrosophicQuasi−Hamiltonian−T ype−Cycle−CutSuperHyperP olynomial
|EESHG:(V,E) |Neutrosophic Cardinality
= 2z b 2 c
.
C(N SHG)N eutrosophicR−Quasi−Hamiltonian−T ype−Cycle−Cut = {Vi }si=1 , {Vj }tj=1 .
C(N SHG)N eutrosophicR−Quasi−Hamiltonian−T ype−Cycle−CutSuperHyperP olynomial = az s + bz t .
Is the non-obvious simple Neutrosophic type-SuperHyperSet of the Neutrosophic Hamiltonian- 6199
.
Type-Cycle-Cut Since the Neutrosophic SuperHyperSet of the Neutrosophic SuperHy- 6200

perEdges[SuperHyperVertices], 6201

C(N SHG)N eutrosophicQuasi−Hamiltonian−T ype−Cycle−Cut

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 Henry Garrett · Independent Researcher · Department of Mathematics ·
DrHenryGarrett@gmail.com · Manhattan, NY, USA
|EESHG:(V,E) |Neutrosophic Cardinality
b c
= {E2i−1 }i=1 2
.
C(N SHG)N eutrosophicQuasi−Hamiltonian−T ype−Cycle−CutSuperHyperP olynomial
|EESHG:(V,E) |Neutrosophic Cardinality
= 2z b 2 c
.
C(N SHG)N eutrosophicR−Quasi−Hamiltonian−T ype−Cycle−Cut = {Vi }si=1 , {Vj }tj=1 .
C(N SHG)N eutrosophicR−Quasi−Hamiltonian−T ype−Cycle−CutSuperHyperP olynomial = az s + bz t .

Is an Neutrosophic Hamiltonian-Type-Cycle-Cut C(ESHG) for an Neutrosophic SuperHyperGraph 6202

ESHG : (V, E) is the Neutrosophic SuperHyperSet S of Neutrosophic SuperHyperVertices such 6203
that there’s no a Neutrosophic SuperHyperEdge for some Neutrosophic SuperHyperVertices 6204
given by that Neutrosophic type-SuperHyperSet called the Neutrosophic Hamiltonian-Type-Cycle-Cut 6205

and it’s an Neutrosophic Hamiltonian-Type-Cycle-Cut. Since it’s 6206

6207
the maximum Neutrosophic cardinality of a Neutrosophic SuperHyperSet S of Neut- 6208
rosophic SuperHyperEdges[SuperHyperVertices] such that there’s no Neutrosophic Super- 6209
HyperVertex of a Neutrosophic SuperHyperEdge is common and there’s an Neutrosophic 6210
SuperHyperEdge for all Neutrosophic SuperHyperVertices. There aren’t only less than three 6211

Neutrosophic SuperHyperVertices inside the intended Neutrosophic SuperHyperSet, 6212

C(N SHG)N eutrosophicQuasi−Hamiltonian−T ype−Cycle−Cut

|EESHG:(V,E) |Neutrosophic Cardinality
b c
= {E2i−1 }i=1 2
.
C(N SHG)N eutrosophicQuasi−Hamiltonian−T ype−Cycle−CutSuperHyperP olynomial
|EESHG:(V,E) |Neutrosophic Cardinality
= 2z b 2 c
.
C(N SHG)N eutrosophicR−Quasi−Hamiltonian−T ype−Cycle−Cut = {Vi }si=1 , {Vj }tj=1 .
C(N SHG)N eutrosophicR−Quasi−Hamiltonian−T ype−Cycle−CutSuperHyperP olynomial = az s + bz t .

Thus the non-obvious Neutrosophic Hamiltonian-Type-Cycle-Cut , 6213

C(N SHG)N eutrosophicQuasi−Hamiltonian−T ype−Cycle−Cut

|EESHG:(V,E) |Neutrosophic Cardinality
b c
= {E2i−1 }i=1 2
.
C(N SHG)N eutrosophicQuasi−Hamiltonian−T ype−Cycle−CutSuperHyperP olynomial
|EESHG:(V,E) |Neutrosophic Cardinality
= 2z b 2 c
.
C(N SHG)N eutrosophicR−Quasi−Hamiltonian−T ype−Cycle−Cut = {Vi }si=1 , {Vj }tj=1 .
C(N SHG)N eutrosophicR−Quasi−Hamiltonian−T ype−Cycle−CutSuperHyperP olynomial = az s + bz t .

Is up. The obvious simple Neutrosophic type-SuperHyperSet of the Neutrosophic Hamiltonian-Type- 6214
Cycle-Cut, not: 6215

C(N SHG)N eutrosophicQuasi−Hamiltonian−T ype−Cycle−Cut

|EESHG:(V,E) |Neutrosophic Cardinality
b c
= {E2i−1 }i=1 2
.
C(N SHG)N eutrosophicQuasi−Hamiltonian−T ype−Cycle−CutSuperHyperP olynomial

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics ·
DrHenryGarrett@gmail.com · Manhattan, NY, USA
|EESHG:(V,E) |Neutrosophic Cardinality
= 2z b 2 c
.
C(N SHG)N eutrosophicR−Quasi−Hamiltonian−T ype−Cycle−Cut = {Vi }si=1 , {Vj }tj=1 .
C(N SHG)N eutrosophicR−Quasi−Hamiltonian−T ype−Cycle−CutSuperHyperP olynomial = az s + bz t .

Is the Neutrosophic SuperHyperSet, not: 6216

C(N SHG)N eutrosophicQuasi−Hamiltonian−T ype−Cycle−Cut

|EESHG:(V,E) |Neutrosophic Cardinality
b c
= {E2i−1 }i=1 2
.
C(N SHG)N eutrosophicQuasi−Hamiltonian−T ype−Cycle−CutSuperHyperP olynomial
|EESHG:(V,E) |Neutrosophic Cardinality
= 2z b 2 c
.
C(N SHG)N eutrosophicR−Quasi−Hamiltonian−T ype−Cycle−Cut = {Vi }si=1 , {Vj }tj=1 .
C(N SHG)N eutrosophicR−Quasi−Hamiltonian−T ype−Cycle−CutSuperHyperP olynomial = az s + bz t .

Does includes only less than three SuperHyperVertices in a connected Neutrosophic Super- 6217

HyperGraph ESHG : (V, E). It’s interesting to mention that the only non-obvious simple 6218
Neutrosophic type-SuperHyperSet called the 6219

“Neutrosophic Hamiltonian-Type-Cycle-Cut ” 6220

amid those obvious[non-obvious] simple Neutrosophic type-SuperHyperSets called the 6221

Neutrosophic Hamiltonian-Type-Cycle-Cut , 6222

is only and only 6223

C(N SHG)N eutrosophicQuasi−Hamiltonian−T ype−Cycle−Cut

|EESHG:(V,E) |Neutrosophic Cardinality
b c
= {E2i−1 }i=1 2
.
C(N SHG)N eutrosophicQuasi−Hamiltonian−T ype−Cycle−CutSuperHyperP olynomial
|EESHG:(V,E) |Neutrosophic Cardinality
= 2z b 2 c
.
C(N SHG)N eutrosophicR−Quasi−Hamiltonian−T ype−Cycle−Cut = {Vi }si=1 , {Vj }tj=1 .
C(N SHG)N eutrosophicR−Quasi−Hamiltonian−T ype−Cycle−CutSuperHyperP olynomial = az s + bz t .

In a connected Neutrosophic SuperHyperGraph ESHG : (V, E).  6224

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 CHAPTER 31 6225

The Neutrosophic Departures on The 6226

Theoretical Results Toward Theoretical 6227

Motivations 6228

The previous Neutrosophic approach apply on the upcoming Neutrosophic results on Neutrosophic 6229
SuperHyperClasses. 6230

Proposition 31.0.1. Assume a connected Neutrosophic SuperHyperPath ESHP : (V, E). Then 6231

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

= {Eimax }.
C(N SHG)Neutrosophic Hamiltonian-Type-Cycle-Cut SuperHyperPolynomial
max
= z |Ei |
.
C(N SHG)Neutrosophic V-Hamiltonian-Type-Cycle-Cut
= {Vi ∈ Eimax }.
C(N SHG)Neutrosophic V-Hamiltonian-Type-Cycle-Cut SuperHyperPolynomial
X
= ai z bj .
Proof. Let 6232

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V |EN SHG |
, E |EN SHG |
3 3
6233

P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
...,
EXT ERN AL
E |EN SHG | , V |EN SHG |
3 3

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

Figure 31.1: a Neutrosophic SuperHyperPath Associated to the Notions of Neutrosophic

SuperHyperHamiltonian-Type-Cycle-Cut in the Example (42.0.5) 136NSHG18a

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

There’s a new way to redefine as 6235

ViEXT ERN AL ∼ VjEXT ERN AL ≡

∃!Ez ∈ EESHG:(V,E) , ViEXT ERN AL , VjEXT ERN AL ∈ Ez ≡
∃!Ez ∈ EESHG:(V,E) , {ViEXT ERN AL , VjEXT ERN AL } ⊆ Ez .

The term “EXTERNAL” implies |N (ViEXT ERN AL )| ≥ |N (Vj )| where Vj is corresponded 6236
to ViEXT ERN AL in the literatures of SuperHyperHamiltonian-Type-Cycle-Cut. The latter is 6237
straightforward.  6238

136EXM18a Example 31.0.2. In the Figure (31.1), the connected Neutrosophic SuperHyperPath ESHP : 6239
(V, E), is highlighted and featured. The Neutrosophic SuperHyperSet, in the Neutrosophic 6240
SuperHyperModel (31.1), is the SuperHyperHamiltonian-Type-Cycle-Cut. 6241

Proposition 31.0.3. Assume a connected Neutrosophic SuperHyperCycle ESHC : (V, E). Then 6242

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

= {Ei ∈ EN SHG }.
C(N SHG)Neutrosophic Hamiltonian-Type-Cycle-Cut SuperHyperPolynomial
X
= ai z bj .

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

C(N SHG)Neutrosophic V-Hamiltonian-Type-Cycle-Cut

= {Vi ∈ VN SHG }.
C(N SHG)Neutrosophic V-Hamiltonian-Type-Cycle-Cut SuperHyperPolynomial
X
= ai z bj .

6243

Proof. Let 6244

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V |EN SHG |
, E |EN SHG |
3 3

6245

P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
...,
EXT ERN AL
E |EN SHG | , V |EN SHG |
3 3

be a longest path taken from a connected Neutrosophic SuperHyperCycle ESHC : (V, E). 6246
There’s a new way to redefine as 6247

ViEXT ERN AL ∼ VjEXT ERN AL ≡

∃!Ez ∈ EESHG:(V,E) , ViEXT ERN AL , VjEXT ERN AL ∈ Ez ≡
∃!Ez ∈ EESHG:(V,E) , {ViEXT ERN AL , VjEXT ERN AL } ⊆ Ez .

The term “EXTERNAL” implies |N (ViEXT ERN AL )| ≥ |N (Vj )| where Vj is corresponded 6248
to ViEXT ERN AL in the literatures of SuperHyperHamiltonian-Type-Cycle-Cut. The latter is 6249

straightforward.  6250

136EXM19a Example 31.0.4. In the Figure (31.2), the connected Neutrosophic SuperHyperCycle N SHC : 6251
(V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, in the 6252
Neutrosophic SuperHyperModel (31.2), is the Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut. 6253

Henry Garrett · 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 31.2: a Neutrosophic SuperHyperCycle Associated to the Neutrosophic Notions of

Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut in the Neutrosophic Example (42.0.7) 136NSHG19a

Proposition 31.0.5. Assume a connected Neutrosophic SuperHyperStar ESHS : (V, E). Then 6254

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

= {}.
C(N SHG)Neutrosophic Hamiltonian-Type-Cycle-Cut SuperHyperPolynomial
= 0z 0 .
C(N SHG)Neutrosophic V-Hamiltonian-Type-Cycle-Cut
= {}.
C(N SHG)Neutrosophic V-Hamiltonian-Type-Cycle-Cut SuperHyperPolynomial
= 0z 0 .

Proof. Let 6255

P :
V1EXT ERN AL , E1 ,
CEN T ER, E2
6256

P :
E1 , V1EXT ERN AL ,
E2 , CEN T ER

Henry Garrett · 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 31.3: a Neutrosophic SuperHyperStar Associated to the Neutrosophic Notions of

Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut in the Neutrosophic Example (42.0.9) 136NSHG20a

be a longest path taken a connected Neutrosophic SuperHyperStar ESHS : (V, E). There’s a 6257
new way to redefine as 6258

ViEXT ERN AL ∼ VjEXT ERN AL ≡

∃!Ez ∈ EESHG:(V,E) , ViEXT ERN AL , VjEXT ERN AL ∈ Ez ≡
∃!Ez ∈ EESHG:(V,E) , {ViEXT ERN AL , VjEXT ERN AL } ⊆ Ez .

The term “EXTERNAL” implies |N (ViEXT ERN AL )| ≥ |N (Vj )| where Vj is corresponded 6259
to ViEXT ERN AL in the literatures of SuperHyperHamiltonian-Type-Cycle-Cut. The latter is 6260
straightforward.  6261

136EXM20a Example 31.0.6. In the Figure (31.3), the connected Neutrosophic SuperHyperStar ESHS : 6262
(V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, by the Algorithm 6263
in previous Neutrosophic result, of the Neutrosophic SuperHyperVertices of the connected 6264

Neutrosophic SuperHyperStar ESHS : (V, E), in the Neutrosophic SuperHyperModel (31.3), is 6265
the Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut. 6266

Proposition 31.0.7. Assume a connected Neutrosophic SuperHyperBipartite ESHB : (V, E). 6267

Henry Garrett · 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 6268

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

= {Vi ∈ P min }.
C(N SHG)Neutrosophic Hamiltonian-Type-Cycle-Cut SuperHyperPolynomial
X
= ai z bj .
C(N SHG)Neutrosophic V-Hamiltonian-Type-Cycle-Cut
= {Vi ∈ P min }.
C(N SHG)Neutrosophic V-Hamiltonian-Type-Cycle-Cut SuperHyperPolynomial
X
= ai z bj .

Proof. Let 6269

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V|Pi |=minP ∈E |Pj | , E|Pi |=minPj ∈EN SHG |Pj | .
j N SHG

6270

P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
...,
EXT ERN AL
E|Pi |=minPj ∈EN SHG |Pj | , V|Pi |=minP ∈E |Pj |
j N SHG

is a longest path taken from a connected Neutrosophic SuperHyperBipartite ESHB : (V, E). 6271
There’s a new way to redefine as 6272

ViEXT ERN AL ∼ VjEXT ERN AL ≡

∃!Ez ∈ EESHG:(V,E) , ViEXT ERN AL , VjEXT ERN AL ∈ Ez ≡
∃!Ez ∈ EESHG:(V,E) , {ViEXT ERN AL , VjEXT ERN AL } ⊆ Ez .

The term “EXTERNAL” implies |N (ViEXT ERN AL )| ≥ |N (Vj )| where Vj is corresponded 6273
to ViEXT ERN AL in the literatures of SuperHyperHamiltonian-Type-Cycle-Cut. The latter is 6274
straightforward. Then there’s no at least one SuperHyperHamiltonian-Type-Cycle-Cut. Thus the 6275
notion of quasi may be up but the SuperHyperNotions based on SuperHyperHamiltonian-Type-Cycle- 6276

Cut could be applied. There are only two SuperHyperParts. Thus every SuperHyperPart could 6277
have one SuperHyperVertex as the representative in the 6278

P :
V1EXT ERN AL , E1 ,

Henry Garrett · 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 31.4: Neutrosophic SuperHyperBipartite Neutrosophic Associated to the Neutrosophic

Notions of Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut in the Example (42.0.11) 136NSHG21a

V2EXT ERN AL , E2

is a longest SuperHyperHamiltonian-Type-Cycle-Cut taken from a connected Neutrosophic SuperHyper- 6279

Bipartite ESHB : (V, E). Thus only some SuperHyperVertices and only minimum-Neutrosophic- 6280
of-SuperHyperPart SuperHyperEdges are attained in any solution 6281

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

The latter is straightforward.  6282

136EXM21a Example 31.0.8. In the Neutrosophic Figure (31.4), the connected Neutrosophic SuperHy- 6283
perBipartite ESHB : (V, E), is Neutrosophic highlighted and Neutrosophic featured. The 6284

obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous Neutrosophic 6285

result, of the Neutrosophic SuperHyperVertices of the connected Neutrosophic SuperHyper- 6286
Bipartite ESHB : (V, E), in the Neutrosophic SuperHyperModel (31.4), is the Neutrosophic 6287
SuperHyperHamiltonian-Type-Cycle-Cut. 6288

Proposition 31.0.9. Assume a connected Neutrosophic SuperHyperMultipartite ESHM : (V, E). 6289

Henry Garrett · 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 6290

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

= {Vi ∈ P min }.
C(N SHG)Neutrosophic Hamiltonian-Type-Cycle-Cut SuperHyperPolynomial
X
= ai z bj .
C(N SHG)Neutrosophic V-Hamiltonian-Type-Cycle-Cut
= {Vi ∈ P min }.
C(N SHG)Neutrosophic V-Hamiltonian-Type-Cycle-Cut SuperHyperPolynomial
X
= ai z bj .

Proof. Let 6291

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V|Pi |=minP ∈E |Pj | , E|Pi |=minPj ∈EN SHG |Pj | .
j N SHG

6292

P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
...,
EXT ERN AL
E|Pi |=minPj ∈EN SHG |Pj | , V|Pi |=minP ∈E |Pj |
j N SHG

is a longest SuperHyperHamiltonian-Type-Cycle-Cut taken from a connected Neutrosophic SuperHy- 6293

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

ViEXT ERN AL ∼ VjEXT ERN AL ≡

∃!Ez ∈ EESHG:(V,E) , ViEXT ERN AL , VjEXT ERN AL ∈ Ez ≡
∃!Ez ∈ EESHG:(V,E) , {ViEXT ERN AL , VjEXT ERN AL } ⊆ Ez .

The term “EXTERNAL” implies |N (ViEXT ERN AL )| ≥ |N (Vj )| where Vj is corresponded 6295
to ViEXT ERN AL in the literatures of SuperHyperHamiltonian-Type-Cycle-Cut. The latter is 6296
straightforward. Then there’s no at least one SuperHyperHamiltonian-Type-Cycle-Cut. Thus the 6297
notion of quasi may be up but the SuperHyperNotions based on SuperHyperHamiltonian-Type-Cycle- 6298
0
Cut could be applied. There are only z SuperHyperParts. Thus every SuperHyperPart could 6299

have one SuperHyperVertex as the representative in the 6300

P :
V1EXT ERN AL , E1 ,

Henry Garrett · 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 31.5: a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic

SuperHyperHamiltonian-Type-Cycle-Cut in the Example (42.0.13) 136NSHG22a

V2EXT ERN AL , E2

is a longest path taken from a connected Neutrosophic SuperHyperMultipartite ESHM : (V, E). 6301
Thus only some SuperHyperVertices and only minimum-Neutrosophic-of-SuperHyperPart 6302

SuperHyperEdges are attained in any solution 6303

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

is a longest path taken from a connected Neutrosophic SuperHyperMultipartite ESHM : (V, E). 6304
The latter is straightforward.  6305

136EXM22a Example 31.0.10. In the Figure (31.5), the connected Neutrosophic SuperHyperMultipartite 6306
ESHM : (V, E), is highlighted and Neutrosophic featured. The obtained Neutrosophic 6307
SuperHyperSet, by the Algorithm in previous Neutrosophic result, of the Neutrosophic 6308

SuperHyperVertices of the connected Neutrosophic SuperHyperMultipartite ESHM : (V, E), 6309

in the Neutrosophic SuperHyperModel (31.5), is the Neutrosophic SuperHyperHamiltonian-Type- 6310
Cycle-Cut. 6311

Proposition 31.0.11. Assume a connected Neutrosophic SuperHyperWheel ESHW : (V, E). 6312

Henry Garrett · 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, 6313

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

= {Ei=1|EN SHG |−1 , Ea∗ , Eb∗ }.
C(N SHG)Neutrosophic Hamiltonian-Type-Cycle-Cut SuperHyperPolynomial
X
= ai z bj .
C(N SHG)Neutrosophic V-Hamiltonian-Type-Cycle-Cut
= {Vi ∈ VN SHG }.
C(N SHG)Neutrosophic V-Hamiltonian-Type-Cycle-Cut SuperHyperPolynomial
X
= ai z bj .

Proof. Let 6314

P :
V1EXT ERN AL , E1∗ ,
CEN T ER, E2∗
6315

P :
E1∗ , V1EXT ERN AL ,
E2∗ , CEN T ER

is a longest SuperHyperHamiltonian-Type-Cycle-Cut taken from a connected Neutrosophic SuperHy- 6316

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

ViEXT ERN AL ∼ VjEXT ERN AL ≡

∃!Ez ∈ EESHG:(V,E) , ViEXT ERN AL , VjEXT ERN AL ∈ Ez ≡
∃!Ez ∈ EESHG:(V,E) , {ViEXT ERN AL , VjEXT ERN AL } ⊆ Ez .

The term “EXTERNAL” implies |N (ViEXT ERN AL )| ≥ |N (Vj )| where Vj is corresponded 6318
to ViEXT ERN AL in the literatures of SuperHyperHamiltonian-Type-Cycle-Cut. The latter is 6319

straightforward. Then there’s at least one SuperHyperHamiltonian-Type-Cycle-Cut. Thus the notion 6320
of quasi isn’t up and the SuperHyperNotions based on SuperHyperHamiltonian-Type-Cycle-Cut 6321
could be applied. The unique embedded SuperHyperHamiltonian-Type-Cycle-Cut proposes some 6322
longest SuperHyperHamiltonian-Type-Cycle-Cut excerpt from some representatives. The latter is 6323
straightforward.  6324

136EXM23a Example 31.0.12. In the Neutrosophic Figure (31.6), the connected Neutrosophic SuperHyper- 6325
Wheel N SHW : (V, E), is Neutrosophic highlighted and featured. The obtained Neutrosophic 6326
SuperHyperSet, by the Algorithm in previous result, of the Neutrosophic SuperHyperVer- 6327

tices of the connected Neutrosophic SuperHyperWheel ESHW : (V, E), in the Neutrosophic 6328
SuperHyperModel (31.6), is the Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut. 6329

Henry Garrett · 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 31.6: a Neutrosophic SuperHyperWheel Neutrosophic Associated to the Neutrosophic

Notions of Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut in the Neutrosophic Example
(42.0.15) 136NSHG23a

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 CHAPTER 32 6330

The Surveys of Mathematical Sets On 6331

The Results But As The Initial Motivation 6332

For the SuperHyperHamiltonian-Type-Cycle-Cut, Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut, and the 6333

Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut, some general results are introduced. 6334

Remark 32.0.1. Let remind that the Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut is 6335

“redefined” on the positions of the alphabets. 6336

Corollary 32.0.2. Assume Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut. Then 6337

N eutrosophic SuperHyperHamiltonian − T ype − Cycle − Cut =

{theSuperHyperHamiltonian − T ype − Cycle − Cutof theSuperHyperV ertices |
max |SuperHyperOf f ensive
SuperHyperHamiltonian − T ype − Cycle − Cut
|N eutrosophiccardinalityamidthoseSuperHyperHamiltonian−T ype−Cycle−Cut. }

plus one Neutrosophic SuperHypeNeighbor to one. Where σi is the unary operation on the 6338
SuperHyperVertices of the SuperHyperGraph to assign the determinacy, the indeterminacy and 6339
the neutrality, for i = 1, 2, 3, respectively. 6340

Corollary 32.0.3. Assume a Neutrosophic SuperHyperGraph on the same identical letter 6341
of the alphabet. Then the notion of Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut and 6342

SuperHyperHamiltonian-Type-Cycle-Cut coincide. 6343

Corollary 32.0.4. Assume a Neutrosophic SuperHyperGraph on the same identical letter of 6344
the alphabet. Then a conseNeighborive sequence of the SuperHyperVertices is a Neutrosophic 6345
SuperHyperHamiltonian-Type-Cycle-Cut if and only if it’s a SuperHyperHamiltonian-Type-Cycle-Cut. 6346

Corollary 32.0.5. Assume a Neutrosophic SuperHyperGraph on the same identical letter of 6347
the alphabet. Then a conseNeighborive sequence of the SuperHyperVertices is a strongest 6348
SuperHyperHamiltonian-Type-Cycle-Cut if and only if it’s a longest SuperHyperHamiltonian-Type-Cycle-Cut. 6349

Corollary 32.0.6. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph on the same 6350

identical letter of the alphabet. Then its Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut is its 6351
SuperHyperHamiltonian-Type-Cycle-Cut and reversely. 6352

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

Corollary 32.0.7. Assume a Neutrosophic SuperHyperPath(-/SuperHyperHamiltonian-Type-Cycle-Cut, 6353

SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel) on the same 6354
identical letter of the alphabet. Then its Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut is its 6355
SuperHyperHamiltonian-Type-Cycle-Cut and reversely. 6356

Corollary 32.0.8. Assume a Neutrosophic SuperHyperGraph. Then its Neutrosophic 6357

SuperHyperHamiltonian-Type-Cycle-Cut isn’t well-defined if and only if its SuperHyperHamiltonian-Type- 6358
Cycle-Cut isn’t well-defined. 6359

Corollary 32.0.9. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph. Then 6360

its Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut isn’t well-defined if and only if its 6361
SuperHyperHamiltonian-Type-Cycle-Cut isn’t well-defined. 6362

Corollary 32.0.10. Assume a Neutrosophic SuperHyperPath(-/SuperHyperHamiltonian-Type- 6363

, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel).
Cycle-Cut 6364
Then its Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut isn’t well-defined if and only if its 6365

SuperHyperHamiltonian-Type-Cycle-Cut isn’t well-defined. 6366

Corollary 32.0.11. Assume a Neutrosophic SuperHyperGraph. Then its Neutrosophic 6367

SuperHyperHamiltonian-Type-Cycle-Cut is well-defined if and only if its SuperHyperHamiltonian-Type-Cycle-Cut 6368

is well-defined. 6369

Corollary 32.0.12. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph. 6370

Then its Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut is well-defined if and only if its 6371

SuperHyperHamiltonian-Type-Cycle-Cut is well-defined. 6372

Corollary 32.0.13. Assume a Neutrosophic SuperHyperPath(-/SuperHyperHamiltonian-Type-Cycle- 6373

, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel).

Cut 6374
Then its Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut is well-defined if and only if its 6375
SuperHyperHamiltonian-Type-Cycle-Cut is well-defined. 6376

Proposition 32.0.14. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. Then V is 6377

(i) : the dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 6378

(ii) : the strong dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 6379

(iii) : the connected dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 6380

(iv) : the δ-dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 6381

(v) : the strong δ-dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 6382

(vi) : the connected δ-dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut. 6383

Proposition 32.0.15. Let N T G : (V, E, σ, µ) be a Neutrosophic SuperHyperGraph. Then ∅ is 6384

(i) : the SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 6385

(ii) : the strong SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 6386

(iii) : the connected defensive SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 6387

(iv) : the δ-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 6388

Henry Garrett · 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) : the strong δ-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 6389

(vi) : the connected δ-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut. 6390

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

independent SuperHyperSet is 6392

(i) : the SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 6393

(ii) : the strong SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 6394

(iii) : the connected SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 6395

(iv) : the δ-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 6396

(v) : the strong δ-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 6397

(vi) : the connected δ-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut. 6398

Proposition 32.0.17. Let ESHG : (V, E) be a Neutrosophic SuperHyperUniform SuperHyper- 6399

Graph which is a SuperHyperHamiltonian-Type-Cycle-Cut/SuperHyperPath. Then V is a maximal 6400

(i) : SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 6401

(ii) : strong SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 6402

(iii) : connected SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 6403

(iv) : O(ESHG)-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 6404

(v) : strong O(ESHG)-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 6405

(vi) : connected O(ESHG)-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 6406

Where the exterior SuperHyperVertices and the interior SuperHyperVertices coincide. 6407

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

SuperHyperUniform SuperHyperWheel. Then V is a maximal 6409

(i) : dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 6410

(ii) : strong dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 6411

(iii) : connected dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 6412

(iv) : O(ESHG)-dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 6413

(v) : strong O(ESHG)-dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 6414

(vi) : connected O(ESHG)-dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 6415

Where the exterior SuperHyperVertices and the interior SuperHyperVertices coincide. 6416

Proposition 32.0.19. Let ESHG : (V, E) be a Neutrosophic SuperHyperUniform SuperHyper- 6417

Graph which is a SuperHyperHamiltonian-Type-Cycle-Cut/SuperHyperPath. Then the number of 6418

Henry Garrett · 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 SuperHyperHamiltonian-Type-Cycle-Cut; 6419

(ii) : the SuperHyperHamiltonian-Type-Cycle-Cut; 6420

(iii) : the connected SuperHyperHamiltonian-Type-Cycle-Cut; 6421

(iv) : the O(ESHG)-SuperHyperHamiltonian-Type-Cycle-Cut; 6422

(v) : the strong O(ESHG)-SuperHyperHamiltonian-Type-Cycle-Cut; 6423

(vi) : the connected O(ESHG)-SuperHyperHamiltonian-Type-Cycle-Cut. 6424

is one and it’s only V. Where the exterior SuperHyperVertices and the interior SuperHyperVertices 6425
coincide. 6426

Proposition 32.0.20. Let ESHG : (V, E) be a Neutrosophic SuperHyperUniform SuperHyper- 6427

Graph which is a SuperHyperWheel. Then the number of 6428

(i) : the dual SuperHyperHamiltonian-Type-Cycle-Cut; 6429

(ii) : the dual SuperHyperHamiltonian-Type-Cycle-Cut; 6430

(iii) : the dual connected SuperHyperHamiltonian-Type-Cycle-Cut; 6431

(iv) : the dual O(ESHG)-SuperHyperHamiltonian-Type-Cycle-Cut; 6432

(v) : the strong dual O(ESHG)-SuperHyperHamiltonian-Type-Cycle-Cut; 6433

(vi) : the connected dual O(ESHG)-SuperHyperHamiltonian-Type-Cycle-Cut. 6434

is one and it’s only V. Where the exterior SuperHyperVertices and the interior SuperHyperVertices 6435
coincide. 6436

Proposition 32.0.21. Let ESHG : (V, E) be a Neutrosophic SuperHyperUniform SuperHy- 6437

perGraph which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyper- 6438
Complete SuperHyperMultipartite. Then a SuperHyperSet contains [the SuperHyperCenter 6439

and] the half of multiplying r with the number of all the SuperHyperEdges plus one of all the 6440
SuperHyperVertices is a 6441

(i) : dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 6442

(ii) : strong dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 6443

(iii) : connected dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 6444

O(ESHG)
(iv) : 2 + 1-dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 6445

O(ESHG)
(v) : strong 2 + 1-dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 6446

O(ESHG)
(vi) : connected 2 + 1-dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut. 6447

Henry Garrett · 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 32.0.22. Let ESHG : (V, E) be a Neutrosophic SuperHyperUniform SuperHyper- 6448

Graph which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperCom- 6449
plete SuperHyperMultipartite. Then a SuperHyperSet contains the half of multiplying r with 6450
the number of all the SuperHyperEdges plus one of all the SuperHyperVertices in the biggest 6451
SuperHyperPart is a 6452

(i) : SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 6453

(ii) : strong SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 6454

(iii) : connected SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 6455

(iv) : δ-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 6456

(v) : strong δ-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 6457

(vi) : connected δ-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut. 6458

Proposition 32.0.23. Let ESHG : (V, E) be a Neutrosophic SuperHyperUniform SuperHyper- 6459

Graph which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperCom- 6460

plete SuperHyperMultipartite. Then Then the number of 6461

(i) : dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 6462

(ii) : strong dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 6463

(iii) : connected dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 6464

O(ESHG)
(iv) : 2 + 1-dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 6465

O(ESHG)
(v) : strong 2 + 1-dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 6466

O(ESHG)
(vi) : connected 2 + 1-dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut. 6467

is one and it’s only S, a SuperHyperSet contains [the SuperHyperCenter and] the half of 6468
multiplying r with the number of all the SuperHyperEdges plus one of all the SuperHyperVertices. 6469
Where the exterior SuperHyperVertices and the interior SuperHyperVertices coincide. 6470

Proposition 32.0.24. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. The number of 6471
connected component is |V − S| if there’s a SuperHyperSet which is a dual 6472

(i) : SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 6473

(ii) : strong SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 6474

(iii) : connected SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 6475

(iv) : SuperHyperHamiltonian-Type-Cycle-Cut; 6476

(v) : strong 1-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 6477

(vi) : connected 1-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut. 6478

Henry Garrett · 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 32.0.25. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. Then the 6479
number is at most O(ESHG) and the Neutrosophic number is at most On (ESHG). 6480

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

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

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

(i) : SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 6484

(ii) : strong SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 6485

(iii) : connected SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 6486

(iv) : ( O(ESHG:(V,E))
2 + 1)-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 6487

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

2 + 1)-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 6488

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

2 + 1)-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut. 6489

Proposition 32.0.27. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is ∅. The 6490
number is 0 and the Neutrosophic number is 0, for an independent SuperHyperSet in the setting 6491
of dual 6492

(i) : SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 6493

(ii) : strong SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 6494

(iii) : connected SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 6495

(iv) : 0-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 6496

(v) : strong 0-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 6497

(vi) : connected 0-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut. 6498

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

SuperHyperComplete. Then there’s no independent SuperHyperSet. 6500

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

SuperHyperHamiltonian-Type-Cycle-Cut/SuperHyperPath/SuperHyperWheel. The number is O(ESHG : 6502

(V, E)) and the Neutrosophic number is On (ESHG : (V, E)), in the setting of a dual 6503

(i) : SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 6504

(ii) : strong SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 6505

(iii) : connected SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 6506

(iv) : O(ESHG : (V, E))-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 6507

(v) : strong O(ESHG : (V, E))-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 6508

(vi) : connected O(ESHG : (V, E))-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut. 6509

Henry Garrett · 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 32.0.30. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is 6510

SuperHyperStar/complete SuperHyperBipartite/complete SuperHyperMultiPartite. The number 6511

is O(ESHG:(V,E))
2 + 1 and the Neutrosophic number is min Σv∈{v1 ,v2 ,··· ,vt } O(ESHG:(V,E)) ⊆V σ(v), 6512
t>
2
in the setting of a dual 6513

(i) : SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 6514

(ii) : strong SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 6515

(iii) : connected SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 6516

(iv) : ( O(ESHG:(V,E))
2 + 1)-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 6517

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

2 + 1)-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 6518

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

2 + 1)-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut. 6519

Proposition 32.0.31. Let N SHF : (V, E) be a SuperHyperFamily of the ESHGs : (V, E) 6520
Neutrosophic SuperHyperGraphs which are from one-type SuperHyperClass which the result is 6521

obtained for the individuals. Then the results also hold for the SuperHyperFamily N SHF : (V, E) 6522
of these specific SuperHyperClasses of the Neutrosophic SuperHyperGraphs. 6523

Proposition 32.0.32. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph. If S is a 6524

dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut, then ∀v ∈ V \ S, ∃x ∈ S such that 6525

(i) v ∈ Ns (x); 6526

(ii) vx ∈ E. 6527

Proposition 32.0.33. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph. If S is 6528

a dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut, then 6529

(i) S is SuperHyperHamiltonian-Type-Cycle-Cut set; 6530

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

Proposition 32.0.34. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph. Then 6532

(i) Γ ≤ O; 6533

(ii) Γs ≤ On . 6534

Proposition 32.0.35. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph which is 6535
connected. Then 6536

(i) Γ ≤ O − 1; 6537

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

Proposition 32.0.36. Let ESHG : (V, E) be an odd SuperHyperPath. Then 6539

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

SuperHyperHamiltonian-Type-Cycle-Cut; 6541

Henry Garrett · 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) Γ = b n2 c + 1 and corresponded SuperHyperSet is S = {v2 , v4 , · · · , vn−1 }; 6542

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

(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn−1 } and S2 = {v1 , v3 , · · · , vn−1 } are only a dual 6544
SuperHyperHamiltonian-Type-Cycle-Cut. 6545

Proposition 32.0.37. Let ESHG : (V, E) be an even SuperHyperPath. Then 6546

(i) the set S = {v2 , v4 , · · · .vn } is a dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle- 6547

Cut; 6548

(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · .vn } and {v1 , v3 , · · · .vn−1 }; 6549

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

(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 6551
SuperHyperHamiltonian-Type-Cycle-Cut. 6552

Proposition 32.0.38. Let ESHG : (V, E) be an even SuperHyperHamiltonian-Type-Cycle-Cut. Then 6553

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

Type-Cycle-Cut; 6555

(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · , vn } and {v1 , v3 , · · · , vn−1 }; 6556

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

(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn } and S2 = {v1 , v3 , · · · , vn−1 } are only dual 6558
SuperHyperHamiltonian-Type-Cycle-Cut. 6559

Proposition 32.0.39. Let ESHG : (V, E) be an odd SuperHyperHamiltonian-Type-Cycle-Cut. Then 6560

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

SuperHyperHamiltonian-Type-Cycle-Cut; 6562

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

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

(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn−1 } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 6565
SuperHyperHamiltonian-Type-Cycle-Cut. 6566

Proposition 32.0.40. Let ESHG : (V, E) be SuperHyperStar. Then 6567

(i) the SuperHyperSet S = {c} is a dual maximal SuperHyperHamiltonian-Type-Cycle-Cut; 6568

(ii) Γ = 1; 6569

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

(iv) the SuperHyperSets S = {c} and S ⊂ S 0 are only dual SuperHyperHamiltonian-Type-Cycle-Cut. 6571

Proposition 32.0.41. Let ESHG : (V, E) be SuperHyperWheel. Then 6572

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 Henry Garrett · Independent Researcher · Department of Mathematics ·
DrHenryGarrett@gmail.com · Manhattan, NY, USA
6+3(i−1)≤n
(i) the SuperHyperSet S = {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is a dual maximal 6573

SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 6574

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

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

6+3(i−1)≤n
(iv) the SuperHyperSet {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is only a dual maximal 6577
SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut. 6578

Proposition 32.0.42. Let ESHG : (V, E) be an odd SuperHyperComplete. Then 6579

b n c+1
(i) the SuperHyperSet S = {vi }i=1
2
is a dual SuperHyperDefensive SuperHyperHamiltonian- 6580
Type-Cycle-Cut; 6581

(ii) Γ = b n2 c + 1; 6582

(iii) Γs = min{Σs∈S Σ3i=1 σi (s)} 2

b n c+1 ; 6583
S={vi }i=1

b n c+1
(iv) the SuperHyperSet S = {vi }i=1
2
is only a dual SuperHyperDefensive SuperHyperHamiltonian- 6584
Type-Cycle-Cut. 6585

Proposition 32.0.43. Let ESHG : (V, E) be an even SuperHyperComplete. Then 6586

bnc
(i) the SuperHyperSet S = {vi }i=1
2
is a dual SuperHyperDefensive SuperHyperHamiltonian-Type- 6587
Cycle-Cut; 6588

(ii) Γ = b n2 c; 6589

(iii) Γs = min{Σs∈S Σ3i=1 σi (s)} 2

bnc ; 6590
S={vi }i=1

bnc
(iv) the SuperHyperSet S = {vi }i=1 2
is only a dual maximal SuperHyperDefensive 6591
SuperHyperHamiltonian-Type-Cycle-Cut. 6592

Proposition 32.0.44. Let N SHF : (V, E) be a m-SuperHyperFamily of Neutrosophic SuperHy- 6593

perStars with common Neutrosophic SuperHyperVertex SuperHyperSet. Then 6594

(i) the SuperHyperSet S = {c1 , c2 , · · · , cm } is a dual SuperHyperDefensive SuperHyperHamiltonian- 6595

Type-Cycle-Cut for N SHF; 6596

(ii) Γ = m for N SHF : (V, E); 6597

(iii) Γs = Σm 3
i=1 Σj=1 σj (ci ) for N SHF : (V, E); 6598

(iv) the SuperHyperSets S = {c1 , c2 , · · · , cm } and S ⊂ S 0 are only dual SuperHyperHamiltonian- 6599
Type-Cycle-Cut for N SHF : (V, E). 6600

Proposition 32.0.45. Let N SHF : (V, E) be an m-SuperHyperFamily of odd SuperHyperCom- 6601

plete SuperHyperGraphs with common Neutrosophic SuperHyperVertex SuperHyperSet. Then 6602

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics ·
DrHenryGarrett@gmail.com · Manhattan, NY, USA
b n c+1
(i) the SuperHyperSet S = {vi }i=1 2
is a dual maximal SuperHyperDefensive 6603

SuperHyperHamiltonian-Type-Cycle-Cut for N SHF; 6604

(ii) Γ = b n2 c + 1 for N SHF : (V, E); 6605

(iii) Γs = min{Σs∈S Σ3i=1 σi (s)} 2

b n c+1 for N SHF : (V, E); 6606
S={vi }i=1

b n c+1
(iv) the SuperHyperSets S = {vi }i=1
2
are only a dual maximal SuperHyperHamiltonian-Type-Cycle- 6607

Cut for N SHF : (V, E). 6608

Proposition 32.0.46. Let N SHF : (V, E) be a m-SuperHyperFamily of even SuperHyperCom- 6609

plete SuperHyperGraphs with common Neutrosophic SuperHyperVertex SuperHyperSet. Then 6610

bnc
(i) the SuperHyperSet S = {vi }i=12
is a dual SuperHyperDefensive SuperHyperHamiltonian-Type- 6611
Cycle-Cut for N SHF : (V, E); 6612

(ii) Γ = b n2 c for N SHF : (V, E); 6613

(iii) Γs = min{Σs∈S Σ3i=1 σi (s)} 2

bnc for N SHF : (V, E); 6614
S={vi }i=1

bnc
(iv) the SuperHyperSets S = {vi }i=1
2
are only dual maximal SuperHyperHamiltonian-Type-Cycle-Cut 6615
for N SHF : (V, E). 6616

Proposition 32.0.47. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph. Then 6617

following statements hold; 6618

(i) if s ≥ t and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 6619

SuperHyperHamiltonian-Type-Cycle-Cut, then S is an s-SuperHyperDefensive SuperHyperHamiltonian- 6620

Type-Cycle-Cut; 6621

(ii) if s ≤ t and a SuperHyperSet S of SuperHyperVertices is a dual t-SuperHyperDefensive 6622

SuperHyperHamiltonian-Type-Cycle-Cut, then S is a dual s-SuperHyperDefensive SuperHyperHamiltonian-
6623
Type-Cycle-Cut. 6624

Proposition 32.0.48. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph. Then 6625
following statements hold; 6626

(i) if s ≥ t + 2 and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 6627

SuperHyperHamiltonian-Type-Cycle-Cut, then S is an s-SuperHyperPowerful SuperHyperHamiltonian- 6628

Type-Cycle-Cut; 6629

(ii) if s ≤ t and a SuperHyperSet S of SuperHyperVertices is a dual t-SuperHyperDefensive 6630

SuperHyperHamiltonian-Type-Cycle-Cut, then S is a dual s-SuperHyperPowerful SuperHyperHamiltonian-6631
Type-Cycle-Cut. 6632

Proposition 32.0.49. Let ESHG : (V, E) be a[an] [V-]SuperHyperUniform-strong-Neutrosophic 6633

SuperHyperGraph. Then following statements hold; 6634

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

SuperHyperHamiltonian-Type-Cycle-Cut; 6636

Henry Garrett · 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 ∀a ∈ V \ S, |Ns (a) ∩ S| > b 2r c + 1, then ESHG : (V, E) is a dual 2-SuperHyperDefensive 6637
SuperHyperHamiltonian-Type-Cycle-Cut; 6638

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

SuperHyperHamiltonian-Type-Cycle-Cut; 6640

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

SuperHyperHamiltonian-Type-Cycle-Cut. 6642

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

SuperHyperGraph. Then following statements hold; 6644

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

SuperHyperHamiltonian-Type-Cycle-Cut; 6646

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

SuperHyperHamiltonian-Type-Cycle-Cut; 6648

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

SuperHyperHamiltonian-Type-Cycle-Cut; 6650

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

SuperHyperHamiltonian-Type-Cycle-Cut. 6652

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

SuperHyperGraph which is a SuperHyperComplete. Then following statements hold; 6654

(i) ∀a ∈ S, |Ns (a) ∩ S| < b O−1 2 c + 1 if ESHG : (V, E) is an 2-SuperHyperDefensive 6655

SuperHyperHamiltonian-Type-Cycle-Cut; 6656

(ii) ∀a ∈ V \ S, |Ns (a) ∩ S| > b O−1 2 c + 1 if ESHG : (V, E) is a dual 2-SuperHyperDefensive 6657
SuperHyperHamiltonian-Type-Cycle-Cut; 6658

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

SuperHyperHamiltonian-Type-Cycle-Cut; 6660

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

SuperHyperHamiltonian-Type-Cycle-Cut. 6662

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

SuperHyperGraph which is a SuperHyperComplete. Then following statements hold; 6664

(i) if ∀a ∈ S, |Ns (a) ∩ S| < b O−1

2 c + 1, then ESHG : (V, E) is an 2-SuperHyperDefensive 6665

SuperHyperHamiltonian-Type-Cycle-Cut; 6666

(ii) if ∀a ∈ V \ S, |Ns (a) ∩ S| > b O−1 2 c + 1, then ESHG : (V, E) is a dual 2- 6667
SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut; 6668

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

SuperHyperHamiltonian-Type-Cycle-Cut; 6670

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

SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Cut. 6672

Henry Garrett · 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 32.0.53. Let ESHG : (V, E) is a[an] [V-]SuperHyperUniform-strong-Neutrosophic 6673

SuperHyperGraph which is SuperHyperHamiltonian-Type-Cycle-Cut. Then following statements hold; 6674

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

SuperHyperHamiltonian-Type-Cycle-Cut; 6676

(ii) ∀a ∈ V \ S, |Ns (a) ∩ S| > 2 if ESHG : (V, E) is a dual 2-SuperHyperDefensive 6677

SuperHyperHamiltonian-Type-Cycle-Cut; 6678

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

SuperHyperHamiltonian-Type-Cycle-Cut; 6680

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

SuperHyperHamiltonian-Type-Cycle-Cut. 6682

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

SuperHyperGraph which is SuperHyperHamiltonian-Type-Cycle-Cut. Then following statements hold; 6684

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

SuperHyperHamiltonian-Type-Cycle-Cut; 6686

(ii) if ∀a ∈ V \ S, |Ns (a) ∩ S| > 2, then ESHG : (V, E) is a dual 2-SuperHyperDefensive 6687
SuperHyperHamiltonian-Type-Cycle-Cut; 6688

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

SuperHyperHamiltonian-Type-Cycle-Cut; 6690

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

SuperHyperHamiltonian-Type-Cycle-Cut. 6692

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 CHAPTER 33 6693

Neutrosophic Applications in Cancer’s 6694

Neutrosophic Recognition 6695

The cancer is the Neutrosophic disease but the Neutrosophic model is going to figure out what’s 6696
going on this Neutrosophic phenomenon. The special Neutrosophic case of this Neutrosophic 6697
disease is considered and as the consequences of the model, some parameters are used. The 6698

cells are under attack of this disease but the moves of the cancer in the special region are the 6699
matter of mind. The Neutrosophic recognition of the cancer could help to find some Neutrosophic 6700
treatments for this Neutrosophic disease. 6701
In the following, some Neutrosophic steps are Neutrosophic devised on this disease. 6702

Step 1. (Neutrosophic Definition) The Neutrosophic recognition of the cancer in the long-term 6703
Neutrosophic function. 6704

Step 2. (Neutrosophic Issue) The specific region has been assigned by the Neutrosophic model 6705

[it’s called Neutrosophic SuperHyperGraph] and the long Neutrosophic cycle of the move 6706
from the cancer is identified by this research. Sometimes the move of the cancer hasn’t be 6707
easily identified since there are some determinacy, indeterminacy and neutrality about the 6708
moves and the effects of the cancer on that region; this event leads us to choose another 6709
model [it’s said to be Neutrosophic SuperHyperGraph] to have convenient perception on 6710
what’s happened and what’s done. 6711

Step 3. (Neutrosophic Model) There are some specific Neutrosophic models, which are well- 6712
known and they’ve got the names, and some general Neutrosophic models. The moves and 6713
the Neutrosophic traces of the cancer on the complex tracks and between complicated groups 6714
of cells could be fantasized by a Neutrosophic SuperHyperPath(-/SuperHyperHamiltonian- 6715
Type-Cycle-Cut, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyper- 6716

Wheel). The aim is to find either the Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut or 6717

the Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut in those Neutrosophic Neutrosophic 6718
SuperHyperModels. 6719

337
 CHAPTER 34 6720

Case 1: The Initial Neutrosophic Steps 6721

Toward Neutrosophic 6722

SuperHyperBipartite as Neutrosophic 6723

SuperHyperModel 6724

Step 4. (Neutrosophic Solution) In the Neutrosophic Figure (34.1), the Neutrosophic Super- 6725
HyperBipartite is Neutrosophic highlighted and Neutrosophic featured. 6726

Figure 34.1: a Neutrosophic SuperHyperBipartite Associated to the Notions of Neutrosophic

SuperHyperHamiltonian-Type-Cycle-Cut 136NSHGaa21aa

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

Table 34.1: The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges
Belong to The Neutrosophic SuperHyperBipartite

The Values of The Vertices The Number of Position in Alphabet

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

By using the Neutrosophic Figure (34.1) and the Table (34.1), the Neutrosophic SuperHy- 6727
perBipartite is obtained. 6728
The obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous 6729
Neutrosophic result, of the Neutrosophic SuperHyperVertices of the connected Neutrosophic 6730
SuperHyperBipartite ESHB : (V, E), in the Neutrosophic SuperHyperModel (34.1), is the 6731

Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut. 6732

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 CHAPTER 35 6733

Case 2: The Increasing Neutrosophic 6734

Steps Toward Neutrosophic 6735

SuperHyperMultipartite as 6736

Neutrosophic SuperHyperModel 6737

Step 4. (Neutrosophic Solution) In the Neutrosophic Figure (35.1), the Neutrosophic Super- 6738
HyperMultipartite is Neutrosophic highlighted and Neutrosophic featured. 6739

By using the Neutrosophic Figure (35.1) and the Table (35.1), the Neutrosophic SuperHy- 6740
perMultipartite is obtained. 6741
The obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous 6742

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

SuperHyperHamiltonian-Type-Cycle-Cut 136NSHGaa22aa

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

Table 35.1: The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges
Belong to The Neutrosophic SuperHyperMultipartite

The Values of The Vertices The Number of Position in Alphabet

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

result, of the Neutrosophic SuperHyperVertices of the connected Neutrosophic SuperHy- 6743

perMultipartite ESHM : (V, E), in the Neutrosophic SuperHyperModel (35.1), is the 6744
Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut. 6745

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 CHAPTER 36 6746

Wondering Open Problems But As The 6747

Directions To Forming The Motivations 6748

In what follows, some “problems” and some “questions” are proposed. 6749
The SuperHyperHamiltonian-Type-Cycle-Cut and the Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut are 6750
defined on a real-world application, titled “Cancer’s Recognitions”. 6751

Question 36.0.1. Which the else SuperHyperModels could be defined based on Cancer’s 6752
recognitions? 6753

Question 36.0.2. Are there some SuperHyperNotions related to SuperHyperHamiltonian-Type-Cycle-Cut 6754

and the Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut? 6755

Question 36.0.3. Are there some Algorithms to be defined on the SuperHyperModels to compute 6756
them? 6757

Question 36.0.4. Which the SuperHyperNotions are related to beyond the SuperHyperHamiltonian- 6758
and the Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut?
Type-Cycle-Cut 6759

Problem 36.0.5. The SuperHyperHamiltonian-Type-Cycle-Cut and the Neutrosophic SuperHyperHamiltonian- 6760

do a SuperHyperModel for the Cancer’s recognitions and they’re based on 6761
Type-Cycle-Cut
SuperHyperHamiltonian-Type-Cycle-Cut, are there else? 6762

Problem 36.0.6. Which the fundamental SuperHyperNumbers are related to these SuperHyper- 6763
Numbers types-results? 6764

Problem 36.0.7. What’s the independent research based on Cancer’s recognitions concerning 6765
the multiple types of SuperHyperNotions? 6766

343
 CHAPTER 37 6767

Conclusion and Closing Remarks 6768

In this section, concluding remarks and closing remarks are represented. The drawbacks of this 6769

research are illustrated. Some benefits and some advantages of this research are highlighted. 6770
This research uses some approaches to make Neutrosophic SuperHyperGraphs more under- 6771
standable. In this endeavor, two SuperHyperNotions are defined on the SuperHyperHamiltonian- 6772
Type-Cycle-Cut. For that sake in the second definition, the main definition of the Neutrosophic 6773
SuperHyperGraph is redefined on the position of the alphabets. Based on the new definition for the 6774
Neutrosophic SuperHyperGraph, the new SuperHyperNotion, Neutrosophic SuperHyperHamiltonian- 6775

Type-Cycle-Cut, finds the convenient background to implement some results based on that. Some 6776
SuperHyperClasses and some Neutrosophic SuperHyperClasses are the cases of this research 6777
on the modeling of the regions where are under the attacks of the cancer to recognize this 6778
disease as it’s mentioned on the title “Cancer’s Recognitions”. To formalize the instances 6779
on the SuperHyperNotion, SuperHyperHamiltonian-Type-Cycle-Cut, the new SuperHyperClasses and 6780
SuperHyperClasses, are introduced. Some general results are gathered in the section on the 6781

SuperHyperHamiltonian-Type-Cycle-Cut and the Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut. The 6782

clarifications, instances and literature reviews have taken the whole way through. In this re- 6783
search, the literature reviews have fulfilled the lines containing the notions and the results. 6784
The SuperHyperGraph and Neutrosophic SuperHyperGraph are the SuperHyperModels on the 6785
“Cancer’s Recognitions” and both bases are the background of this research. Sometimes the 6786
cancer has been happened on the region, full of cells, groups of cells and embedded styles. In this 6787

segment, the SuperHyperModel proposes some SuperHyperNotions based on the connectivities of 6788
the moves of the cancer in the longest and strongest styles with the formation of the design and 6789
the architecture are formally called “ SuperHyperHamiltonian-Type-Cycle-Cut” in the themes of jargons 6790
and buzzwords. The prefix “SuperHyper” refers to the theme of the embedded styles to figure out 6791
the background for the SuperHyperNotions. In the Table (37.1), benefits and avenues for this 6792
research are, figured out, pointed out and spoken out. 6793

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

Table 37.1: An Overlook On This Research And Beyond 136TBLTBL

Advantages Limitations
1. Redefining Neutrosophic SuperHyperGraph 1. General Results

2. SuperHyperHamiltonian-Type-Cycle-Cut

3. Neutrosophic SuperHyperHamiltonian-Type-Cycle-Cut 2. Other SuperHyperNumbers

4. Modeling of Cancer’s Recognitions

5. SuperHyperClasses 3. SuperHyperFamilies

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 CHAPTER 38 6794

Neutrosophic SuperHyperDuality But As 6795

The Extensions Excerpt From Dense And 6796

Super Forms 6797

Definition 38.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperDuality). 6798

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

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

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

Va ∈ Ei , Ej ; 6803

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

Va ∈ Ei , Ej and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 6805

(iii) Neutrosophic v-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 6806

Vi , Vj ∈ Ea ; 6807

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

Vi , Vj ∈ Ea and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; 6809

(v) Neutrosophic SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 6810

Neutrosophic re-SuperHyperDuality, Neutrosophic v-SuperHyperDuality, and Neutro- 6811

sophic rv-SuperHyperDuality. 6812

Definition 38.0.2. ((Neutrosophic) SuperHyperDuality). 6813

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

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

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

Neutrosophic re-SuperHyperDuality, Neutrosophic v-SuperHyperDuality, and Neutro- 6817
sophic rv-SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : 6818
(V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high 6819
Extreme cardinality of the Extreme SuperHyperEdges in the conseNeighborive Extreme 6820
sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 6821

form the Extreme SuperHyperDuality; 6822

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

(ii) a Neutrosophic SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 6823

Neutrosophic re-SuperHyperDuality, Neutrosophic v-SuperHyperDuality, and Neutro- 6824
sophic rv-SuperHyperDuality and C(N SHG) for a Neutrosophic SuperHyperGraph 6825
N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic Su- 6826
perHyperEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 6827
conseNeighborive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices 6828

such that they form the Neutrosophic SuperHyperDuality; 6829

(iii) an Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of Neut- 6830

rosophic e-SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic v- 6831

SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for an Ex- 6832
treme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains 6833
the Extreme coefficients defined as the Extreme number of the maximum Extreme cardin- 6834
ality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme 6835
cardinality conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVer- 6836

tices such that they form the Extreme SuperHyperDuality; and the Extreme power is 6837
corresponded to its Extreme coefficient; 6838

(iv) a Neutrosophic SuperHyperDuality SuperHyperPolynomial if it’s either of Neut- 6839

rosophic e-SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic v- 6840

SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for a Neut- 6841
rosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 6842
contains the Neutrosophic coefficients defined as the Neutrosophic number of the max- 6843
imum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic 6844
SuperHyperSet S of high Neutrosophic cardinality conseNeighborive Neutrosophic Super- 6845

HyperEdges and Neutrosophic SuperHyperVertices such that they form the Neutrosophic 6846
SuperHyperDuality; and the Neutrosophic power is corresponded to its Neutrosophic 6847
coefficient; 6848

(v) an Extreme R-SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 6849

Neutrosophic re-SuperHyperDuality, Neutrosophic v-SuperHyperDuality, and Neutro- 6850
sophic rv-SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : 6851
(V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high 6852
Extreme cardinality of the Extreme SuperHyperVertices in the conseNeighborive Extreme 6853

sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 6854
form the Extreme SuperHyperDuality; 6855

(vi) a Neutrosophic R-SuperHyperDuality if it’s either of Neutrosophic e- 6856

SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic v-SuperHyperDuality,6857
and Neutrosophic rv-SuperHyperDuality and C(N SHG) for a Neutrosophic SuperHyper- 6858
Graph N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic 6859
SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 6860
conseNeighborive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices 6861
such that they form the Neutrosophic SuperHyperDuality; 6862

(vii) an Extreme R-SuperHyperDuality SuperHyperPolynomial if it’s either of 6863

Neutrosophic e-SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic 6864

v-SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for an 6865

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

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

contains the Extreme coefficients defined as the Extreme number of the maximum 6867
Extreme cardinality of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S 6868
of high Extreme cardinality conseNeighborive Extreme SuperHyperEdges and Extreme 6869
SuperHyperVertices such that they form the Extreme SuperHyperDuality; and the Extreme 6870
power is corresponded to its Extreme coefficient; 6871

(viii) a Neutrosophic SuperHyperDuality SuperHyperPolynomial if it’s either of Neut- 6872

rosophic e-SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic v- 6873
SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for a Neut- 6874

rosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 6875

contains the Neutrosophic coefficients defined as the Neutrosophic number of the max- 6876
imum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic 6877
SuperHyperSet S of high Neutrosophic cardinality conseNeighborive Neutrosophic Super- 6878
HyperEdges and Neutrosophic SuperHyperVertices such that they form the Neutrosophic 6879
SuperHyperDuality; and the Neutrosophic power is corresponded to its Neutrosophic 6880

coefficient. 6881

136EXM1 Example 38.0.3. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E) in 6882
the mentioned Neutrosophic Figures in every Neutrosophic items. 6883

• On the Figure (30.1), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 6884

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 6885

E1 and E3 are some empty Extreme SuperHyperEdges but E2 is a loop Neutrosophic 6886
SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of 6887
Neutrosophic SuperHyperNeighbor, there’s only one Neutrosophic SuperHyperEdge, 6888
namely, E4 . The Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means 6889
that there’s no Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. 6890
Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in every given Neutrosophic 6891

SuperHyperDuality. 6892

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 (30.2), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 6893

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 6894
E1 , E2 and E3 are some empty Neutrosophic SuperHyperEdges but E4 is a Neutrosophic 6895
SuperHyperEdge. Thus in the terms of Neutrosophic SuperHyperNeighbor, there’s only 6896
one Neutrosophic SuperHyperEdge, namely, E4 . The Neutrosophic SuperHyperVertex, V3 6897
is Neutrosophic isolated means that there’s no Neutrosophic SuperHyperEdge has it as 6898

a Neutrosophic endpoint. Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in 6899

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

every given Neutrosophic SuperHyperDuality. 6900

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 (30.3), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 6901

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 6902

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 (30.4), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 6903

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 6904

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 (30.5), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 6905

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 6906

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 (30.6), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 6907

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 6908

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 (30.7), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 6909

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 6910

C(N SHG)Neutrosophic SuperHyperDuality = {E15 , E16 , E17 }.

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

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 .

• On the Figure (30.8), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 6911

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 6912

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 (30.9), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 6913

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 6914

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 (30.10), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 6915

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 6916

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 (30.11), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 6917

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 6918

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 .

Henry Garrett · 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 (30.12), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 6919

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 6920

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 .

• On the Figure (30.13), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 6921

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 6922

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 (30.14), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 6923

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 6924

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 (30.15), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 6925

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 6926

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 (30.16), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 6927

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 6928

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.

Henry Garrett · 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 (30.17), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 6929

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 6930

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.

• On the Figure (30.18), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 6931

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 6932

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 (30.19), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 6933

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 6934

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 (30.20), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 6935

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 6936

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 (30.21), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 6937

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 6938

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.

Henry Garrett · 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 (30.22), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 6939

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 6940

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 6941
Neutrosophic SuperHyperClasses. 6942

Proposition 38.0.4. Assume a connected Neutrosophic SuperHyperPath ESHP : (V, E). Then 6943

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 6944

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 ESHP : (V, E). 6945

There’s a new way to redefine as 6946

ViEXT ERN AL ∼ VjEXT ERN AL ≡

∃!Ez ∈ EESHG:(V,E) , ViEXT ERN AL , VjEXT ERN AL ∈ Ez ≡
∃!Ez ∈ EESHG:(V,E) , {ViEXT ERN AL , VjEXT ERN AL } ⊆ Ez .

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

ViEXT ERN AL in the literatures of SuperHyperDuality. The latter is straightforward.  6948

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

136EXM18a Example 38.0.5. In the Figure (31.1), the connected Neutrosophic SuperHyperPath ESHP : 6949
(V, E), is highlighted and featured. The Neutrosophic SuperHyperSet, in the Neutrosophic 6950
SuperHyperModel (31.1), is the SuperHyperDuality. 6951

Proposition 38.0.6. Assume a connected Neutrosophic SuperHyperCycle ESHC : (V, E). Then 6952

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 6953

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 ESHC : (V, E). 6954
There’s a new way to redefine as 6955

ViEXT ERN AL ∼ VjEXT ERN AL ≡

∃!Ez ∈ EESHG:(V,E) , ViEXT ERN AL , VjEXT ERN AL ∈ Ez ≡
∃!Ez ∈ EESHG:(V,E) , {ViEXT ERN AL , VjEXT ERN AL } ⊆ Ez .
The term “EXTERNAL” implies |N (ViEXT ERN AL )| ≥ |N (Vj )| where Vj is corresponded to 6956
ViEXT ERN AL in the literatures of SuperHyperDuality. The latter is straightforward.  6957

136EXM19a Example 38.0.7. In the Figure (31.2), the connected Neutrosophic SuperHyperCycle N SHC : 6958

(V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, in the 6959
Neutrosophic SuperHyperModel (31.2), is the Neutrosophic SuperHyperDuality. 6960

Proposition 38.0.8. Assume a connected Neutrosophic SuperHyperStar ESHS : (V, E). Then 6961

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.

Henry Garrett · 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 6962

P : ViEXT ERN AL , Ei , CEN T ER, VjEXT ERN AL .

be a longest path taken a connected Neutrosophic SuperHyperStar ESHS : (V, E). There’s a 6963

new way to redefine as 6964

ViEXT ERN AL ∼ VjEXT ERN AL ≡

∃!Ez ∈ EESHG:(V,E) , ViEXT ERN AL , VjEXT ERN AL ∈ Ez ≡
∃!Ez ∈ EESHG:(V,E) , {ViEXT ERN AL , VjEXT ERN AL } ⊆ Ez .

The term “EXTERNAL” implies |N (ViEXT ERN AL )| ≥ |N (Vj )| where Vj is corresponded to 6965
ViEXT ERN AL in the literatures of SuperHyperDuality. The latter is straightforward.  6966

136EXM20a Example 38.0.9. In the Figure (31.3), the connected Neutrosophic SuperHyperStar ESHS : 6967
(V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, by the Algorithm 6968

in previous Neutrosophic result, of the Neutrosophic SuperHyperVertices of the connected 6969

Neutrosophic SuperHyperStar ESHS : (V, E), in the Neutrosophic SuperHyperModel (31.3), is 6970
the Neutrosophic SuperHyperDuality. 6971

Proposition 38.0.10. Assume a connected Neutrosophic SuperHyperBipartite ESHB : (V, E). 6972
Then 6973

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 6974

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

Henry Garrett · 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 ESHB : (V, E). 6975
There’s a new way to redefine as 6976

ViEXT ERN AL ∼ VjEXT ERN AL ≡

∃!Ez ∈ EESHG:(V,E) , ViEXT ERN AL , VjEXT ERN AL ∈ Ez ≡
∃!Ez ∈ EESHG:(V,E) , {ViEXT ERN AL , VjEXT ERN AL } ⊆ Ez .

The term “EXTERNAL” implies |N (ViEXT ERN AL )| ≥ |N (Vj )| where Vj is corresponded 6977
to ViEXT ERN AL in the literatures of SuperHyperDuality. The latter is straightforward. 6978

Then there’s at least one SuperHyperDuality. Thus the notion of quasi isn’t up and the 6979
SuperHyperNotions based on SuperHyperDuality could be applied. There are only two 6980
SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as the 6981
representative in the 6982

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
Emini |Pi ESHG:(V,E) ∈P ESHG:(V,E) | , Vmini |Pi
ESHG:(V,E) ∈P ESHG:(V,E) |+1

is a longest SuperHyperDuality taken from a connected Neutrosophic SuperHyperBipartite 6983

ESHB : (V, E). Thus only some SuperHyperVertices and only minimum-Neutrosophic-of- 6984
SuperHyperPart SuperHyperEdges are attained in any solution 6985

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
Emini |Pi ESHG:(V,E) ∈P ESHG:(V,E) | , Vmini |Pi
ESHG:(V,E) ∈P ESHG:(V,E) |+1

The latter is straightforward.  6986

136EXM21a Example 38.0.11. In the Neutrosophic Figure (31.4), the connected Neutrosophic SuperHy- 6987

perBipartite ESHB : (V, E), is Neutrosophic highlighted and Neutrosophic featured. The 6988
obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous Neutrosophic 6989
result, of the Neutrosophic SuperHyperVertices of the connected Neutrosophic SuperHyper- 6990
Bipartite ESHB : (V, E), in the Neutrosophic SuperHyperModel (31.4), is the Neutrosophic 6991
SuperHyperDuality. 6992

Proposition 38.0.12. Assume a connected Neutrosophic SuperHyperMultipartite ESHM : 6993

Henry Garrett · 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, E). Then 6994

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 6995

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

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

ViEXT ERN AL ∼ VjEXT ERN AL ≡

∃!Ez ∈ EESHG:(V,E) , ViEXT ERN AL , VjEXT ERN AL ∈ Ez ≡
∃!Ez ∈ EESHG:(V,E) , {ViEXT ERN AL , VjEXT ERN AL } ⊆ Ez .

The term “EXTERNAL” implies |N (ViEXT ERN AL )| ≥ |N (Vj )| where Vj is corresponded 6998
to ViEXT ERN AL in the literatures of SuperHyperDuality. The latter is straightforward. 6999
Then there’s at least one SuperHyperDuality. Thus the notion of quasi isn’t up and 7000
the SuperHyperNotions based on SuperHyperDuality could be applied. There are only z 0 7001
SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as the 7002

representative in the 7003

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

Henry Garrett · 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 SuperHyperMultipartite ESHM : (V, E). 7004
Thus only some SuperHyperVertices and only minimum-Neutrosophic-of-SuperHyperPart 7005
SuperHyperEdges are attained in any solution 7006

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
Emini |Pi ESHG:(V,E) ∈P ESHG:(V,E) | , Vmini |Pi
ESHG:(V,E) ∈P ESHG:(V,E) |+1

is a longest path taken from a connected Neutrosophic SuperHyperMultipartite ESHM : (V, E). 7007
The latter is straightforward.  7008

136EXM22a Example 38.0.13. In the Figure (31.5), the connected Neutrosophic SuperHyperMultipartite 7009
ESHM : (V, E), is highlighted and Neutrosophic featured. The obtained Neutrosophic 7010

SuperHyperSet, by the Algorithm in previous Neutrosophic result, of the Neutrosophic 7011

SuperHyperVertices of the connected Neutrosophic SuperHyperMultipartite ESHM : (V, E), 7012
in the Neutrosophic SuperHyperModel (31.5), is the Neutrosophic SuperHyperDuality. 7013

Proposition 38.0.14. Assume a connected Neutrosophic SuperHyperWheel ESHW : (V, E). 7014
Then, 7015

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 7016

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)

is a longest SuperHyperDuality taken from a connected Neutrosophic SuperHyperWheel 7017

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

ViEXT ERN AL ∼ VjEXT ERN AL ≡

∃!Ez∗ ∈ EESHG:(V,E)
∗
, ViEXT ERN AL , VjEXT ERN AL ∈ Ez∗ ≡
∃!Ez∗ ∈ EESHG:(V,E)
∗
, {ViEXT ERN AL , VjEXT ERN AL } ⊆ Ez∗ .

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

to ViEXT ERN AL in the literatures of SuperHyperDuality. The latter is straightforward. 7020

Henry Garrett · 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 there’s at least one SuperHyperDuality. Thus the notion of quasi isn’t up and the 7021
SuperHyperNotions based on SuperHyperDuality could be applied. The unique embedded 7022
SuperHyperDuality proposes some longest SuperHyperDuality excerpt from some representatives. 7023
The latter is straightforward.  7024

136EXM23a Example 38.0.15. In the Neutrosophic Figure (31.6), the connected Neutrosophic SuperHyper- 7025
Wheel N SHW : (V, E), is Neutrosophic highlighted and featured. The obtained Neutrosophic 7026
SuperHyperSet, by the Algorithm in previous result, of the Neutrosophic SuperHyperVer- 7027
tices of the connected Neutrosophic SuperHyperWheel ESHW : (V, E), in the Neutrosophic 7028

SuperHyperModel (31.6), is the Neutrosophic SuperHyperDuality. 7029

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 CHAPTER 39 7030

Neutrosophic SuperHyperJoin But As 7031

The Extensions Excerpt From Dense And 7032

Super Forms 7033

Definition 39.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperJoin). 7034

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider a 7035
Neutrosophic SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and E 0 = {E1 , E2 , . . . , Ez }. Then either V 0 7036
or E 0 is called 7037

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

Va ∈ Ei , Ej ; and ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; 7039

(ii) Neutrosophic re-SuperHyperJoin if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such that 7040

Va ∈ Ei , Ej ; ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; and |Ei |NEUTROSOPIC CARDINALITY = 7041
|Ej |NEUTROSOPIC CARDINALITY ; 7042

(iii) Neutrosophic v-SuperHyperJoin if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such that 7043

Vi , Vj 6∈ Ea ; and ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; 7044

(iv) Neutrosophic rv-SuperHyperJoin if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such that 7045

Vi , Vj ∈ Ea ; ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; and |Vi |NEUTROSOPIC CARDINALITY = 7046
|Vj |NEUTROSOPIC CARDINALITY ; 7047

(v) Neutrosophic SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 7048

Neutrosophic re-SuperHyperJoin, Neutrosophic v-SuperHyperJoin, and Neutrosophic 7049
rv-SuperHyperJoin. 7050

Definition 39.0.2. ((Neutrosophic) SuperHyperJoin). 7051

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider a 7052
Neutrosophic SuperHyperEdge (NSHE) E = {V1 , V2 , . . . , Vs }. Then E is called 7053

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

Neutrosophic re-SuperHyperJoin, Neutrosophic v-SuperHyperJoin, and Neutrosophic 7055
rv-SuperHyperJoin and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 7056

is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Extreme 7057

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

cardinality of the Extreme SuperHyperEdges in the conseNeighborive Extreme sequence 7058

of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 7059
Extreme SuperHyperJoin; 7060

(ii) a Neutrosophic SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 7061

Neutrosophic re-SuperHyperJoin, Neutrosophic v-SuperHyperJoin, and Neutrosophic 7062
rv-SuperHyperJoin and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7063
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of 7064
a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality conseNeighborive 7065

Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they 7066

form the Neutrosophic SuperHyperJoin; 7067

(iii) an Extreme SuperHyperJoin SuperHyperPolynomial if it’s either of Neutrosophic 7068

e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic v-SuperHyperJoin, 7069
and Neutrosophic rv-SuperHyperJoin and C(N SHG) for an Extreme SuperHyperGraph 7070
N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients 7071
defined as the Extreme number of the maximum Extreme cardinality of the Extreme 7072
SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme cardinality conseNeigh- 7073

borive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form 7074
the Extreme SuperHyperJoin; and the Extreme power is corresponded to its Extreme 7075
coefficient; 7076

(iv) a Neutrosophic SuperHyperJoin SuperHyperPolynomial if it’s either of 7077

Neutrosophic e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic v- 7078
SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for a Neutrosophic 7079
SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains 7080
the Neutrosophic coefficients defined as the Neutrosophic number of the maximum Neutro- 7081
sophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet 7082

S of high Neutrosophic cardinality conseNeighborive Neutrosophic SuperHyperEdges and 7083

Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperJoin; 7084
and the Neutrosophic power is corresponded to its Neutrosophic coefficient; 7085

(v) an Extreme R-SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 7086

Neutrosophic re-SuperHyperJoin, Neutrosophic v-SuperHyperJoin, and Neutrosophic 7087
rv-SuperHyperJoin and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 7088
is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Extreme 7089
cardinality of the Extreme SuperHyperVertices in the conseNeighborive Extreme sequence 7090

of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 7091
Extreme SuperHyperJoin; 7092

(vi) a Neutrosophic R-SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 7093

Neutrosophic re-SuperHyperJoin, Neutrosophic v-SuperHyperJoin, and Neutrosophic 7094
rv-SuperHyperJoin and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7095
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of 7096
a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality conseNeighborive 7097
Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they 7098

form the Neutrosophic SuperHyperJoin; 7099

Henry Garrett · 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-SuperHyperJoin SuperHyperPolynomial if it’s either of 7100

Neutrosophic e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic v- 7101
SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for an Extreme 7102
SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the 7103
Extreme coefficients defined as the Extreme number of the maximum Extreme cardinality 7104
of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme 7105

cardinality conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVertices 7106

such that they form the Extreme SuperHyperJoin; and the Extreme power is corresponded 7107
to its Extreme coefficient; 7108

(viii) a Neutrosophic SuperHyperJoin SuperHyperPolynomial if it’s either of 7109

Neutrosophic e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic v- 7110
SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for a Neutrosophic 7111

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

the Neutrosophic coefficients defined as the Neutrosophic number of the maximum 7113
Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic 7114
SuperHyperSet S of high Neutrosophic cardinality conseNeighborive Neutrosophic Super- 7115
HyperEdges and Neutrosophic SuperHyperVertices such that they form the Neutrosophic 7116
SuperHyperJoin; and the Neutrosophic power is corresponded to its Neutrosophic 7117

coefficient. 7118

136EXM1 Example 39.0.3. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E) in 7119

the mentioned Neutrosophic Figures in every Neutrosophic items. 7120

• On the Figure (30.1), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 7121

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7122

E1 and E3 are some empty Neutrosophic SuperHyperEdges but E2 is a loop Neutrosophic 7123
SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of 7124
Neutrosophic SuperHyperNeighbor, there’s only one Neutrosophic SuperHyperEdge, 7125
namely, E4 . The Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means 7126
that there’s no Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. 7127

Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in every given Neutrosophic 7128

SuperHyperJoin. 7129

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

C(N SHG)Neutrosophic SuperHyperJoin SuperHyperPolynomial = z.
C(N SHG)Neutrosophic R-SuperHyperJoin = {V1 , V2 , V4 }.
C(N SHG)Neutrosophic R-SuperHyperJoin SuperHyperPolynomial = z 3 .

• On the Figure (30.2), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 7130

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7131
E1 , E2 and E3 are some empty Neutrosophic SuperHyperEdges but E4 is a Neutrosophic 7132
SuperHyperEdge. Thus in the terms of Neutrosophic SuperHyperNeighbor, there’s only 7133
one Neutrosophic SuperHyperEdge, namely, E4 . The Neutrosophic SuperHyperVertex, V3 7134
is Neutrosophic isolated means that there’s no Neutrosophic SuperHyperEdge has it as 7135

a Neutrosophic endpoint. Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in 7136

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

every given Neutrosophic SuperHyperJoin. 7137

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

C(N SHG)Neutrosophic SuperHyperJoin SuperHyperPolynomial = z.
C(N SHG)Neutrosophic R-SuperHyperJoin = {V1 , V2 , V4 }.
C(N SHG)Neutrosophic R-SuperHyperJoin SuperHyperPolynomial = z 3 .

• On the Figure (30.3), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 7138

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7139

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

C(N SHG)Neutrosophic SuperHyperJoin SuperHyperPolynomial = z.
C(N SHG)Neutrosophic R-SuperHyperJoin = {V1 , V2 , V3 }.
C(N SHG)Neutrosophic R-SuperHyperJoin SuperHyperPolynomial = z 3 .

• On the Figure (30.4), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 7140

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7141

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 (30.5), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 7142

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7143

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 (30.6), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 7144

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7145

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 (30.7), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 7146

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7147

C(N SHG)Neutrosophic SuperHyperJoin = {E15 , E16 , E17 }.

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

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 .

• On the Figure (30.8), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 7148

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7149

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 (30.9), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 7150

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7151

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 (30.10), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 7152

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7153

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 (30.11), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 7154

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7155

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 .

Henry Garrett · 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 (30.12), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 7156

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7157

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 .

• On the Figure (30.13), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 7158

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7159

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 (30.14), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 7160

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7161

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 (30.15), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 7162

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7163

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 (30.16), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 7164

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7165

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 .

Henry Garrett · 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 (30.17), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 7166

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7167

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 (30.18), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 7168

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7169

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 (30.19), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 7170

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7171

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 (30.20), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 7172

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7173

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 (30.21), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 7174

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7175

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.

Henry Garrett · 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 (30.22), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 7176

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7177

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 7178
Neutrosophic SuperHyperClasses. 7179

Proposition 39.0.4. Assume a connected Neutrosophic SuperHyperPath ESHP : (V, E). Then 7180

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 7181

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 ESHP : (V, E). 7182

There’s a new way to redefine as 7183

ViEXT ERN AL ∼ VjEXT ERN AL ≡

∃!Ez ∈ EESHG:(V,E) , ViEXT ERN AL , VjEXT ERN AL ∈ Ez ≡
∃!Ez ∈ EESHG:(V,E) , {ViEXT ERN AL , VjEXT ERN AL } ⊆ Ez .

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

ViEXT ERN AL in the literatures of SuperHyperJoin. The latter is straightforward.  7185

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

136EXM18a Example 39.0.5. In the Figure (31.1), the connected Neutrosophic SuperHyperPath ESHP : 7186
(V, E), is highlighted and featured. The Neutrosophic SuperHyperSet, in the Neutrosophic 7187
SuperHyperModel (31.1), is the SuperHyperJoin. 7188

Proposition 39.0.6. Assume a connected Neutrosophic SuperHyperCycle ESHC : (V, E). Then 7189

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 7190

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 ESHC : (V, E). 7191
There’s a new way to redefine as 7192

ViEXT ERN AL ∼ VjEXT ERN AL ≡

∃!Ez ∈ EESHG:(V,E) , ViEXT ERN AL , VjEXT ERN AL ∈ Ez ≡
∃!Ez ∈ EESHG:(V,E) , {ViEXT ERN AL , VjEXT ERN AL } ⊆ Ez .
The term “EXTERNAL” implies |N (ViEXT ERN AL )| ≥ |N (Vj )| where Vj is corresponded to 7193
ViEXT ERN AL in the literatures of SuperHyperJoin. The latter is straightforward.  7194

136EXM19a Example 39.0.7. In the Figure (31.2), the connected Neutrosophic SuperHyperCycle N SHC : 7195

(V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, in the 7196
Neutrosophic SuperHyperModel (31.2), is the Neutrosophic SuperHyperJoin. 7197

Proposition 39.0.8. Assume a connected Neutrosophic SuperHyperStar ESHS : (V, E). Then 7198

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.

Henry Garrett · 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 7199

P : ViEXT ERN AL , Ei , CEN T ER, VjEXT ERN AL .

be a longest path taken a connected Neutrosophic SuperHyperStar ESHS : (V, E). There’s a 7200

new way to redefine as 7201

ViEXT ERN AL ∼ VjEXT ERN AL ≡

∃!Ez ∈ EESHG:(V,E) , ViEXT ERN AL , VjEXT ERN AL ∈ Ez ≡
∃!Ez ∈ EESHG:(V,E) , {ViEXT ERN AL , VjEXT ERN AL } ⊆ Ez .

The term “EXTERNAL” implies |N (ViEXT ERN AL )| ≥ |N (Vj )| where Vj is corresponded to 7202
ViEXT ERN AL in the literatures of SuperHyperJoin. The latter is straightforward.  7203

136EXM20a Example 39.0.9. In the Figure (31.3), the connected Neutrosophic SuperHyperStar ESHS : 7204
(V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, by the Algorithm 7205

in previous Neutrosophic result, of the Neutrosophic SuperHyperVertices of the connected 7206

Neutrosophic SuperHyperStar ESHS : (V, E), in the Neutrosophic SuperHyperModel (31.3), is 7207
the Neutrosophic SuperHyperJoin. 7208

Proposition 39.0.10. Assume a connected Neutrosophic SuperHyperBipartite ESHB : (V, E). 7209
Then 7210

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

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

= {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 7211

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
Emini |Pi ESHG:(V,E) ∈P ESHG:(V,E) | , Vmini |Pi
ESHG:(V,E) ∈P ESHG:(V,E) |+1

is a longest path taken from a connected Neutrosophic SuperHyperBipartite ESHB : (V, E). 7212
There’s a new way to redefine as 7213

ViEXT ERN AL ∼ VjEXT ERN AL ≡

∃!Ez ∈ EESHG:(V,E) , ViEXT ERN AL , VjEXT ERN AL ∈ Ez ≡
∃!Ez ∈ EESHG:(V,E) , {ViEXT ERN AL , VjEXT ERN AL } ⊆ Ez .

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

ViEXT ERN AL in the literatures of SuperHyperJoin. The latter is straightforward. Then there’s 7215
no at least one SuperHyperJoin. Thus the notion of quasi may be up but the SuperHyperNotions 7216
based on SuperHyperJoin could be applied. There are only two SuperHyperParts. Thus every 7217
SuperHyperPart could have one SuperHyperVertex as the representative in the 7218

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
Emini |Pi ESHG:(V,E) ∈P ESHG:(V,E) | , Vmini |Pi
ESHG:(V,E) ∈P ESHG:(V,E) |+1

is a longest SuperHyperJoin taken from a connected Neutrosophic SuperHyperBipartite 7219

ESHB : (V, E). Thus only some SuperHyperVertices and only minimum-Neutrosophic-of- 7220
SuperHyperPart SuperHyperEdges are attained in any solution 7221

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
Emini |Pi ESHG:(V,E) ∈P ESHG:(V,E) | , Vmini |Pi
ESHG:(V,E) ∈P ESHG:(V,E) |+1

The latter is straightforward.  7222

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

136EXM21a Example 39.0.11. In the Neutrosophic Figure (31.4), the connected Neutrosophic SuperHy- 7223
perBipartite ESHB : (V, E), is Neutrosophic highlighted and Neutrosophic featured. The 7224
obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous Neutrosophic 7225
result, of the Neutrosophic SuperHyperVertices of the connected Neutrosophic SuperHyper- 7226
Bipartite ESHB : (V, E), in the Neutrosophic SuperHyperModel (31.4), is the Neutrosophic 7227
SuperHyperJoin. 7228

Proposition 39.0.12. Assume a connected Neutrosophic SuperHyperMultipartite ESHM : 7229

(V, E). Then 7230

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 7231

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
Emini |Pi ESHG:(V,E) ∈P ESHG:(V,E) | , Vmini |Pi
ESHG:(V,E) ∈P ESHG:(V,E) |+1

Henry Garrett · 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 SuperHyperMultipartite 7232

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

ViEXT ERN AL ∼ VjEXT ERN AL ≡

∃!Ez ∈ EESHG:(V,E) , ViEXT ERN AL , VjEXT ERN AL ∈ Ez ≡
∃!Ez ∈ EESHG:(V,E) , {ViEXT ERN AL , VjEXT ERN AL } ⊆ Ez .

The term “EXTERNAL” implies |N (ViEXT ERN AL )| ≥ |N (Vj )| where Vj is corresponded to 7234
ViEXT ERN AL in the literatures of SuperHyperJoin. The latter is straightforward. Then there’s 7235
no at least one SuperHyperJoin. Thus the notion of quasi may be up but the SuperHyperNotions 7236

based on SuperHyperJoin could be applied. There are only z 0 SuperHyperParts. Thus every 7237
SuperHyperPart could have one SuperHyperVertex as the representative in the 7238

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
Emini |Pi ESHG:(V,E) ∈P ESHG:(V,E) | , Vmini |Pi
ESHG:(V,E) ∈P ESHG:(V,E) |+1

is a longest path taken from a connected Neutrosophic SuperHyperMultipartite ESHM : (V, E). 7239
Thus only some SuperHyperVertices and only minimum-Neutrosophic-of-SuperHyperPart 7240
SuperHyperEdges are attained in any solution 7241

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
Emini |Pi ESHG:(V,E) ∈P ESHG:(V,E) | , Vmini |Pi
ESHG:(V,E) ∈P ESHG:(V,E) |+1

is a longest path taken from a connected Neutrosophic SuperHyperMultipartite ESHM : (V, E). 7242
The latter is straightforward.  7243

136EXM22a Example 39.0.13. In the Figure (31.5), the connected Neutrosophic SuperHyperMultipartite 7244
ESHM : (V, E), is highlighted and Neutrosophic featured. The obtained Neutrosophic 7245
SuperHyperSet, by the Algorithm in previous Neutrosophic result, of the Neutrosophic 7246

SuperHyperVertices of the connected Neutrosophic SuperHyperMultipartite ESHM : (V, E), 7247

in the Neutrosophic SuperHyperModel (31.5), is the Neutrosophic SuperHyperJoin. 7248

Proposition 39.0.14. Assume a connected Neutrosophic SuperHyperWheel ESHW : (V, E). 7249

Henry Garrett · 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, 7250

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 7251

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

is a longest SuperHyperJoin taken from a connected Neutrosophic SuperHyperWheel ESHW : 7252

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

ViEXT ERN AL ∼ VjEXT ERN AL ≡

∃!Ez ∈ EESHG:(V,E) , ViEXT ERN AL , VjEXT ERN AL ∈ Ez ≡
∃!Ez ∈ EESHG:(V,E) , {ViEXT ERN AL , VjEXT ERN AL } ⊆ Ez .

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

ViEXT ERN AL in the literatures of SuperHyperJoin. The latter is straightforward. Then there’s 7255
at least one SuperHyperJoin. Thus the notion of quasi isn’t up and the SuperHyperNotions based 7256
on SuperHyperJoin could be applied. The unique embedded SuperHyperJoin proposes some 7257
longest SuperHyperJoin excerpt from some representatives. The latter is straightforward.  7258

136EXM23a Example 39.0.15. In the Neutrosophic Figure (31.6), the connected Neutrosophic SuperHyper- 7259
Wheel N SHW : (V, E), is Neutrosophic highlighted and featured. The obtained Neutrosophic 7260
SuperHyperSet, by the Algorithm in previous result, of the Neutrosophic SuperHyperVer- 7261
tices of the connected Neutrosophic SuperHyperWheel ESHW : (V, E), in the Neutrosophic 7262
SuperHyperModel (31.6), is the Neutrosophic SuperHyperJoin. 7263

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 CHAPTER 40 7264

Neutrosophic SuperHyperPerfect But As 7265

The Extensions Excerpt From Dense And 7266

Super Forms 7267

Definition 40.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperPerfect). 7268

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

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

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

Va ∈ Ei , Ej ; 7273

(ii) Neutrosophic re-SuperHyperPerfect if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃!Ej ∈ E 0 , such 7274

that Va ∈ Ei , Ej ; and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 7275

(iii) Neutrosophic v-SuperHyperPerfect if ∀Vi ∈ VESHG:(V,E) \ V 0 , ∃!Vj ∈ V 0 , such that 7276

Vi , Vj ∈ Ea ; 7277

(iv) Neutrosophic rv-SuperHyperPerfect if ∀Vi ∈ VESHG:(V,E) \ V 0 , ∃!Vj ∈ V 0 , such that 7278

Vi , Vj ∈ Ea ; and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; 7279

(v) Neutrosophic SuperHyperPerfect if it’s either of Neutrosophic e-SuperHyperPerfect, 7280

Neutrosophic re-SuperHyperPerfect, Neutrosophic v-SuperHyperPerfect, and Neutrosophic 7281

rv-SuperHyperPerfect. 7282

Definition 40.0.2. ((Neutrosophic) SuperHyperPerfect). 7283

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

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

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

Neutrosophic re-SuperHyperPerfect, Neutrosophic v-SuperHyperPerfect, and Neutrosophic 7287
rv-SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 7288
is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Extreme 7289
cardinality of the Extreme SuperHyperEdges in the conseNeighborive Extreme sequence 7290
of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 7291

Extreme SuperHyperPerfect; 7292

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

(ii) a Neutrosophic SuperHyperPerfect if it’s either of Neutrosophic e-SuperHyperPerfect, 7293

Neutrosophic re-SuperHyperPerfect, Neutrosophic v-SuperHyperPerfect, and Neutrosophic 7294
rv-SuperHyperPerfect and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : 7295
(V, E) is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges 7296
of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality conseNeighborive 7297
Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they 7298

form the Neutrosophic SuperHyperPerfect; 7299

(iii) an Extreme SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7300

rosophic e-SuperHyperPerfect, Neutrosophic re-SuperHyperPerfect, Neutrosophic v- 7301

SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for an Ex- 7302
treme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains 7303
the Extreme coefficients defined as the Extreme number of the maximum Extreme cardin- 7304
ality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme 7305
cardinality conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVer- 7306

tices such that they form the Extreme SuperHyperPerfect; and the Extreme power is 7307
corresponded to its Extreme coefficient; 7308

(iv) a Neutrosophic SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7309

rosophic e-SuperHyperPerfect, Neutrosophic re-SuperHyperPerfect, Neutrosophic v- 7310

SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for a Neut- 7311
rosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 7312
contains the Neutrosophic coefficients defined as the Neutrosophic number of the max- 7313
imum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic 7314
SuperHyperSet S of high Neutrosophic cardinality conseNeighborive Neutrosophic Super- 7315

HyperEdges and Neutrosophic SuperHyperVertices such that they form the Neutrosophic 7316
SuperHyperPerfect; and the Neutrosophic power is corresponded to its Neutrosophic 7317
coefficient; 7318

(v) an Extreme R-SuperHyperPerfect if it’s either of Neutrosophic e-SuperHyperPerfect, 7319

Neutrosophic re-SuperHyperPerfect, Neutrosophic v-SuperHyperPerfect, and Neutrosophic 7320
rv-SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 7321
is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Extreme 7322
cardinality of the Extreme SuperHyperVertices in the conseNeighborive Extreme sequence 7323
of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 7324

Extreme SuperHyperPerfect; 7325

(vi) a Neutrosophic R-SuperHyperPerfect if it’s either of Neutrosophic e- 7326

SuperHyperPerfect, Neutrosophic re-SuperHyperPerfect, Neutrosophic v-SuperHyperPerfect,7327
and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for a Neutrosophic SuperHyper- 7328
Graph N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic 7329
SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 7330
conseNeighborive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices 7331
such that they form the Neutrosophic SuperHyperPerfect; 7332

(vii) an Extreme R-SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7333

rosophic e-SuperHyperPerfect, Neutrosophic re-SuperHyperPerfect, Neutrosophic v- 7334
SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for an Ex- 7335

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

Henry Garrett · 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 Extreme coefficients defined as the Extreme number of the maximum Extreme cardin- 7337
ality of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme 7338
cardinality conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVer- 7339
tices such that they form the Extreme SuperHyperPerfect; and the Extreme power is 7340
corresponded to its Extreme coefficient; 7341

(viii) a Neutrosophic SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7342

rosophic e-SuperHyperPerfect, Neutrosophic re-SuperHyperPerfect, Neutrosophic v- 7343
SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for a Neut- 7344
rosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 7345
contains the Neutrosophic coefficients defined as the Neutrosophic number of the max- 7346

imum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic 7347

SuperHyperSet S of high Neutrosophic cardinality conseNeighborive Neutrosophic Super- 7348
HyperEdges and Neutrosophic SuperHyperVertices such that they form the Neutrosophic 7349
SuperHyperPerfect; and the Neutrosophic power is corresponded to its Neutrosophic 7350
coefficient. 7351

136EXM1 Example 40.0.3. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E) in 7352
the mentioned Neutrosophic Figures in every Neutrosophic items. 7353

• On the Figure (30.1), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 7354

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7355
E1 and E3 are some empty Neutrosophic SuperHyperEdges but E2 is a loop Neutrosophic 7356
SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of 7357
Neutrosophic SuperHyperNeighbor, there’s only one Neutrosophic SuperHyperEdge, 7358

namely, E4 . The Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means 7359

that there’s no Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. 7360
Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in every given Neutrosophic 7361
SuperHyperPerfect. 7362

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 (30.2), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 7363

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7364
E1 , E2 and E3 are some empty Neutrosophic SuperHyperEdges but E4 is a Neutrosophic 7365

SuperHyperEdge. Thus in the terms of Neutrosophic SuperHyperNeighbor, there’s only 7366

one Neutrosophic SuperHyperEdge, namely, E4 . The Neutrosophic SuperHyperVertex, V3 7367
is Neutrosophic isolated means that there’s no Neutrosophic SuperHyperEdge has it as 7368
a Neutrosophic endpoint. Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in 7369
every given Neutrosophic SuperHyperPerfect. 7370

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.

Henry Garrett · 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 (30.3), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 7371

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7372

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 (30.4), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 7373

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7374

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 (30.5), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 7375

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7376

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 (30.6), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 7377

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7378

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 (30.7), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 7379

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7380

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 .

• On the Figure (30.8), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 7381

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7382

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

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

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 (30.9), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 7383

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7384

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 (30.10), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 7385

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7386

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 (30.11), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 7387

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7388

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 (30.12), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 7389

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7390

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 (30.13), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 7391

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7392

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 (30.14), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 7393

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7394

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 (30.15), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 7395

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7396

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 (30.16), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 7397

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7398

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 (30.17), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 7399

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7400

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 (30.18), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 7401

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7402

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 (30.19), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 7403

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7404

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 (30.20), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 7405

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7406

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 (30.21), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 7407

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7408

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 (30.22), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 7409

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7410

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 7411

Neutrosophic SuperHyperClasses. 7412

Henry Garrett · 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 40.0.4. Assume a connected Neutrosophic SuperHyperPath ESHP : (V, E). Then 7413

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 7414

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 ESHP : (V, E). 7415
There’s a new way to redefine as 7416

ViEXT ERN AL ∼ VjEXT ERN AL ≡

∃!Ez ∈ EESHG:(V,E) , ViEXT ERN AL , VjEXT ERN AL ∈ Ez ≡
∃!Ez ∈ EESHG:(V,E) , {ViEXT ERN AL , VjEXT ERN AL } ⊆ Ez .

The term “EXTERNAL” implies |N (ViEXT ERN AL )| ≥ |N (Vj )| where Vj is corresponded to 7417
ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is straightforward.  7418

136EXM18a Example 40.0.5. In the Figure (31.1), the connected Neutrosophic SuperHyperPath ESHP : 7419
(V, E), is highlighted and featured. The Neutrosophic SuperHyperSet, in the Neutrosophic 7420
SuperHyperModel (31.1), is the SuperHyperPerfect. 7421

Proposition 40.0.6. Assume a connected Neutrosophic SuperHyperCycle ESHC : (V, E). Then 7422

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

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 Henry Garrett · Independent Researcher · Department of Mathematics ·
DrHenryGarrett@gmail.com · Manhattan, NY, USA
|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 7423

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 ESHC : (V, E). 7424

There’s a new way to redefine as 7425

ViEXT ERN AL ∼ VjEXT ERN AL ≡

∃!Ez ∈ EESHG:(V,E) , ViEXT ERN AL , VjEXT ERN AL ∈ Ez ≡
∃!Ez ∈ EESHG:(V,E) , {ViEXT ERN AL , VjEXT ERN AL } ⊆ Ez .
The term “EXTERNAL” implies |N (ViEXT ERN AL )| ≥ |N (Vj )| where Vj is corresponded to 7426
ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is straightforward.  7427

136EXM19a Example 40.0.7. In the Figure (31.2), the connected Neutrosophic SuperHyperCycle N SHC : 7428
(V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, in the 7429
Neutrosophic SuperHyperModel (31.2), is the Neutrosophic SuperHyperPerfect. 7430

Proposition 40.0.8. Assume a connected Neutrosophic SuperHyperStar ESHS : (V, E). Then 7431

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 7432

P : ViEXT ERN AL , Ei , CEN T ER, VjEXT ERN AL .

be a longest path taken a connected Neutrosophic SuperHyperStar ESHS : (V, E). There’s a 7433
new way to redefine as 7434

ViEXT ERN AL ∼ VjEXT ERN AL ≡

∃!Ez ∈ EESHG:(V,E) , ViEXT ERN AL , VjEXT ERN AL ∈ Ez ≡
∃!Ez ∈ EESHG:(V,E) , {ViEXT ERN AL , VjEXT ERN AL } ⊆ Ez .
The term “EXTERNAL” implies |N (ViEXT ERN AL )| ≥ |N (Vj )| where Vj is corresponded to 7435

ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is straightforward.  7436

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

136EXM20a Example 40.0.9. In the Figure (31.3), the connected Neutrosophic SuperHyperStar ESHS : 7437
(V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, by the Algorithm 7438
in previous Neutrosophic result, of the Neutrosophic SuperHyperVertices of the connected 7439
Neutrosophic SuperHyperStar ESHS : (V, E), in the Neutrosophic SuperHyperModel (31.3), is 7440
the Neutrosophic SuperHyperPerfect. 7441

Proposition 40.0.10. Assume a connected Neutrosophic SuperHyperBipartite ESHB : (V, E). 7442
Then 7443

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 7444

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
Emini |Pi ESHG:(V,E) ∈P ESHG:(V,E) | , Vmini |Pi
ESHG:(V,E) ∈P ESHG:(V,E) |+1

Henry Garrett · 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 ESHB : (V, E). 7445
There’s a new way to redefine as 7446

ViEXT ERN AL ∼ VjEXT ERN AL ≡

∃!Ez ∈ EESHG:(V,E) , ViEXT ERN AL , VjEXT ERN AL ∈ Ez ≡
∃!Ez ∈ EESHG:(V,E) , {ViEXT ERN AL , VjEXT ERN AL } ⊆ Ez .

The term “EXTERNAL” implies |N (ViEXT ERN AL )| ≥ |N (Vj )| where Vj is corresponded to 7447
ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is straightforward. Then 7448

there’s no at least one SuperHyperPerfect. Thus the notion of quasi may be up but the 7449
SuperHyperNotions based on SuperHyperPerfect could be applied. There are only two 7450
SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as the 7451
representative in the 7452

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
Emini |Pi ESHG:(V,E) ∈P ESHG:(V,E) | , Vmini |Pi
ESHG:(V,E) ∈P ESHG:(V,E) |+1

is a longest SuperHyperPerfect taken from a connected Neutrosophic SuperHyperBipartite 7453

ESHB : (V, E). Thus only some SuperHyperVertices and only minimum-Neutrosophic-of- 7454
SuperHyperPart SuperHyperEdges are attained in any solution 7455

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
Emini |Pi ESHG:(V,E) ∈P ESHG:(V,E) | , Vmini |Pi
ESHG:(V,E) ∈P ESHG:(V,E) |+1

The latter is straightforward.  7456

136EXM21a Example 40.0.11. In the Neutrosophic Figure (31.4), the connected Neutrosophic SuperHy- 7457

perBipartite ESHB : (V, E), is Neutrosophic highlighted and Neutrosophic featured. The 7458
obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous Neutrosophic 7459
result, of the Neutrosophic SuperHyperVertices of the connected Neutrosophic SuperHyper- 7460
Bipartite ESHB : (V, E), in the Neutrosophic SuperHyperModel (31.4), is the Neutrosophic 7461
SuperHyperPerfect. 7462

Proposition 40.0.12. Assume a connected Neutrosophic SuperHyperMultipartite ESHM : 7463

Henry Garrett · 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, E). Then 7464

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 7465

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
Emini |Pi ESHG:(V,E) ∈P ESHG:(V,E) | , Vmini |Pi
ESHG:(V,E) ∈P ESHG:(V,E) |+1

is a longest SuperHyperPerfect taken from a connected Neutrosophic SuperHyperMultipartite 7466

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

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 corresponded 7468
to ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is straightforward. 7469
Then there’s no at least one SuperHyperPerfect. Thus the notion of quasi may be up but 7470
the SuperHyperNotions based on SuperHyperPerfect could be applied. There are only z 0 7471
SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as the 7472
representative in the 7473

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
Emini |Pi ESHG:(V,E) ∈P ESHG:(V,E) | , Vmini |Pi
ESHG:(V,E) ∈P ESHG:(V,E) |+1

is a longest path taken from a connected Neutrosophic SuperHyperMultipartite ESHM : (V, E). 7474
Thus only some SuperHyperVertices and only minimum-Neutrosophic-of-SuperHyperPart 7475
SuperHyperEdges are attained in any solution 7476

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
Emini |Pi ESHG:(V,E) ∈P ESHG:(V,E) | , Vmini |Pi
ESHG:(V,E) ∈P ESHG:(V,E) |+1

is a longest path taken from a connected Neutrosophic SuperHyperMultipartite ESHM : (V, E). 7477
The latter is straightforward.  7478

136EXM22a Example 40.0.13. In the Figure (31.5), the connected Neutrosophic SuperHyperMultipartite 7479
ESHM : (V, E), is highlighted and Neutrosophic featured. The obtained Neutrosophic 7480
SuperHyperSet, by the Algorithm in previous Neutrosophic result, of the Neutrosophic 7481

SuperHyperVertices of the connected Neutrosophic SuperHyperMultipartite ESHM : (V, E), 7482

in the Neutrosophic SuperHyperModel (31.5), is the Neutrosophic SuperHyperPerfect. 7483

Proposition 40.0.14. Assume a connected Neutrosophic SuperHyperWheel ESHW : (V, E). 7484
Then, 7485

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 7486

P : ViEXT ERN AL , Ei , CEN T ER, VjEXT ERN AL .

Henry Garrett · 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 SuperHyperPerfect taken from a connected Neutrosophic SuperHyperWheel 7487

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

ViEXT ERN AL ∼ VjEXT ERN AL ≡

∃!Ez ∈ EESHG:(V,E) , ViEXT ERN AL , VjEXT ERN AL ∈ Ez ≡
∃!Ez ∈ EESHG:(V,E) , {ViEXT ERN AL , VjEXT ERN AL } ⊆ Ez .

The term “EXTERNAL” implies |N (ViEXT ERN AL )| ≥ |N (Vj )| where Vj is corresponded to 7489
ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is straightforward. Then there’s 7490

at least one SuperHyperPerfect. Thus the notion of quasi isn’t up and the SuperHyperNotions 7491
based on SuperHyperPerfect could be applied. The unique embedded SuperHyperPerfect 7492
proposes some longest SuperHyperPerfect excerpt from some representatives. The latter is 7493
straightforward.  7494

136EXM23a Example 40.0.15. In the Neutrosophic Figure (31.6), the connected Neutrosophic SuperHyper- 7495
Wheel N SHW : (V, E), is Neutrosophic highlighted and featured. The obtained Neutrosophic 7496
SuperHyperSet, by the Algorithm in previous result, of the Neutrosophic SuperHyperVer- 7497
tices of the connected Neutrosophic SuperHyperWheel ESHW : (V, E), in the Neutrosophic 7498
SuperHyperModel (31.6), is the Neutrosophic SuperHyperPerfect. 7499

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 CHAPTER 41 7500

Neutrosophic SuperHyperTotal But As 7501

The Extensions Excerpt From Dense And 7502

Super Forms 7503

Definition 41.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperTotal). 7504

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

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

(i) Neutrosophic e-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that 7508

Va ∈ Ei , Ej ; 7509

(ii) Neutrosophic re-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that 7510

Va ∈ Ei , Ej ; and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 7511

(iii) Neutrosophic v-SuperHyperTotal if ∀Vi ∈ VESHG:(V,E) , ∃!Vj ∈ V 0 , such that 7512

Vi , Vj ∈ Ea ; 7513

(iv) Neutrosophic rv-SuperHyperTotal if ∀Vi ∈ VESHG:(V,E) , ∃!Vj ∈ V 0 , such that 7514

Vi , Vj ∈ Ea ; and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; 7515

(v) Neutrosophic SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 7516

Neutrosophic re-SuperHyperTotal, Neutrosophic v-SuperHyperTotal, and Neutrosophic 7517

rv-SuperHyperTotal. 7518

Definition 41.0.2. ((Neutrosophic) SuperHyperTotal). 7519

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

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

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

Neutrosophic re-SuperHyperTotal, Neutrosophic v-SuperHyperTotal, and Neutrosophic 7523
rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 7524
is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Extreme 7525
cardinality of the Extreme SuperHyperEdges in the conseNeighborive Extreme sequence 7526
of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 7527

Extreme SuperHyperTotal; 7528

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

(ii) a Neutrosophic SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 7529

Neutrosophic re-SuperHyperTotal, Neutrosophic v-SuperHyperTotal, and Neutrosophic 7530
rv-SuperHyperTotal and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7531
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of 7532
a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality conseNeighborive 7533
Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they 7534

form the Neutrosophic SuperHyperTotal; 7535

(iii) an Extreme SuperHyperTotal SuperHyperPolynomial if it’s either of Neutrosophic 7536

e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v-SuperHyperTotal, 7537

and Neutrosophic rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph 7538
N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients 7539
defined as the Extreme number of the maximum Extreme cardinality of the Extreme 7540
SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme cardinality conseNeigh- 7541
borive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form 7542

the Extreme SuperHyperTotal; and the Extreme power is corresponded to its Extreme 7543
coefficient; 7544

(iv) a Neutrosophic SuperHyperTotal SuperHyperPolynomial if it’s either of 7545

Neutrosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v- 7546

SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for a Neutro- 7547
sophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 7548
contains the Neutrosophic coefficients defined as the Neutrosophic number of the max- 7549
imum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic 7550
SuperHyperSet S of high Neutrosophic cardinality conseNeighborive Neutrosophic Super- 7551

HyperEdges and Neutrosophic SuperHyperVertices such that they form the Neutrosophic 7552
SuperHyperTotal; and the Neutrosophic power is corresponded to its Neutrosophic coeffi- 7553
cient; 7554

(v) an Extreme R-SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 7555

Neutrosophic re-SuperHyperTotal, Neutrosophic v-SuperHyperTotal, and Neutrosophic 7556
rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 7557
is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Extreme 7558
cardinality of the Extreme SuperHyperVertices in the conseNeighborive Extreme sequence 7559

of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 7560
Extreme SuperHyperTotal; 7561

(vi) a Neutrosophic R-SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 7562

Neutrosophic re-SuperHyperTotal, Neutrosophic v-SuperHyperTotal, and Neutrosophic 7563

rv-SuperHyperTotal and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7564
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of 7565
a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality conseNeighborive 7566
Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they 7567
form the Neutrosophic SuperHyperTotal; 7568

(vii) an Extreme R-SuperHyperTotal SuperHyperPolynomial if it’s either of Neut- 7569

rosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v- 7570

SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for an Extreme 7571

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

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

Extreme coefficients defined as the Extreme number of the maximum Extreme cardinality 7573
of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme 7574
cardinality conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVer- 7575
tices such that they form the Extreme SuperHyperTotal; and the Extreme power is 7576
corresponded to its Extreme coefficient; 7577

(viii) a Neutrosophic SuperHyperTotal SuperHyperPolynomial if it’s either of 7578

Neutrosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v- 7579
SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for a Neutro- 7580

sophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 7581

contains the Neutrosophic coefficients defined as the Neutrosophic number of the max- 7582
imum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic 7583
SuperHyperSet S of high Neutrosophic cardinality conseNeighborive Neutrosophic Super- 7584
HyperEdges and Neutrosophic SuperHyperVertices such that they form the Neutrosophic 7585
SuperHyperTotal; and the Neutrosophic power is corresponded to its Neutrosophic coeffi- 7586

cient. 7587

136EXM1 Example 41.0.3. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E) in 7588
the mentioned Neutrosophic Figures in every Neutrosophic items. 7589

• On the Figure (30.1), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 7590

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7591

E1 and E3 are some empty Neutrosophic SuperHyperEdges but E2 is a loop Neutrosophic 7592
SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of 7593
Neutrosophic SuperHyperNeighbor, there’s only one Neutrosophic SuperHyperEdge, 7594
namely, E4 . The Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means 7595
that there’s no Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. 7596
Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in every given Neutrosophic 7597

SuperHyperTotal. 7598

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 (30.2), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 7599

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7600
E1 , E2 and E3 are some empty Neutrosophic SuperHyperEdges but E4 is a Neutrosophic 7601
SuperHyperEdge. Thus in the terms of Neutrosophic SuperHyperNeighbor, there’s only 7602
one Neutrosophic SuperHyperEdge, namely, E4 . The Neutrosophic SuperHyperVertex, V3 7603
is Neutrosophic isolated means that there’s no Neutrosophic SuperHyperEdge has it as 7604

a Neutrosophic endpoint. Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in 7605

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

every given Neutrosophic SuperHyperTotal. 7606

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 (30.3), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 7607

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7608

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 (30.4), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 7609

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7610

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 (30.5), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 7611

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7612

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 (30.6), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 7613

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7614

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 (30.7), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 7615

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7616

C(N SHG)Extreme SuperHyperTotal = {E12 , E13 , E14 }.

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

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 (30.8), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 7617

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7618

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 (30.9), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 7619

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7620

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 (30.10), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 7621

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7622

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 (30.11), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 7623

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7624

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 (30.12), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 7625

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7626

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 .

Henry Garrett · 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 (30.13), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 7627

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7628

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 (30.14), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 7629

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7630

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 .

• On the Figure (30.15), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 7631

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7632

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 (30.16), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 7633

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7634

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 (30.17), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 7635

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7636

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 .

Henry Garrett · 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 (30.18), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 7637

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7638

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 (30.19), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 7639

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7640

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 .

• On the Figure (30.20), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 7641

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7642

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 (30.21), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 7643

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7644

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 (30.22), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 7645

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7646

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 .

Henry Garrett · 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 previous Neutrosophic approach apply on the upcoming Neutrosophic results on 7647
Neutrosophic SuperHyperClasses. 7648

Proposition 41.0.4. Assume a connected Neutrosophic SuperHyperPath ESHP : (V, E). Then 7649

C(N SHG)Neutrosophic SuperHyperTotal =

|E |Neutrosophic Cardinality −2
= {Ei }i=1ESHG:(V,E) .
C(N SHG)Neutrosophic SuperHyperTotal SuperHyperPolynomial
= z |EESHG:(V,E) |Neutrosophic Cardinality −2 .
C(N SHG)Neutrosophic R-SuperHyperTotal
|E | −2
= {ViEXT ERN AL }i=1ESHG:(V,E) Neutrosophic Cardinality .
C(N SHG)Neutrosophic R-SuperHyperTotal SuperHyperPolynomial
Y
= |V EXT ERN AL ESHG:(V,E) |Neutrosophic Cardinality z |EESHG:(V,E) |Neutrosophic Cardinality −2

Proof. Let 7650

P :
V2EXT ERN AL , E2 ,
V3EXT ERN AL , E3 ,
...

be a longest path taken from a connected Neutrosophic SuperHyperPath ESHP : (V, E). 7651
There’s a new way to redefine as 7652

ViEXT ERN AL ∼ VjEXT ERN AL ≡

∃!Ez ∈ EESHG:(V,E) , ViEXT ERN AL , VjEXT ERN AL ∈ Ez ≡
∃!Ez ∈ EESHG:(V,E) , {ViEXT ERN AL , VjEXT ERN AL } ⊆ Ez .

The term “EXTERNAL” implies |N (ViEXT ERN AL )| ≥ |N (Vj )| where Vj is corresponded to 7653
ViEXT ERN AL in the literatures of SuperHyperTotal. The latter is straightforward.  7654

136EXM18a Example 41.0.5. In the Figure (31.1), the connected Neutrosophic SuperHyperPath ESHP : 7655

(V, E), is highlighted and featured. The Neutrosophic SuperHyperSet, in the Neutrosophic 7656
SuperHyperModel (31.1), is the SuperHyperTotal. 7657

Proposition 41.0.6. Assume a connected Neutrosophic SuperHyperCycle ESHC : (V, E). Then 7658

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

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 Henry Garrett · Independent Researcher · Department of Mathematics ·
DrHenryGarrett@gmail.com · Manhattan, NY, USA
|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 7659

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 ESHC : (V, E). 7660
There’s a new way to redefine as 7661

ViEXT ERN AL ∼ VjEXT ERN AL ≡

∃!Ez ∈ EESHG:(V,E) , ViEXT ERN AL , VjEXT ERN AL ∈ Ez ≡
∃!Ez ∈ EESHG:(V,E) , {ViEXT ERN AL , VjEXT ERN AL } ⊆ Ez .
The term “EXTERNAL” implies |N (ViEXT ERN AL )| ≥ |N (Vj )| where Vj is corresponded to 7662
ViEXT ERN AL in the literatures of SuperHyperTotal. The latter is straightforward.  7663

136EXM19a Example 41.0.7. In the Figure (31.2), the connected Neutrosophic SuperHyperCycle N SHC : 7664
(V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, in the 7665
Neutrosophic SuperHyperModel (31.2), is the Neutrosophic SuperHyperTotal. 7666

Proposition 41.0.8. Assume a connected Neutrosophic SuperHyperStar ESHS : (V, E). Then 7667

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 7668

P : ViEXT ERN AL , Ei , CEN T ER, Ej .

be a longest path taken a connected Neutrosophic SuperHyperStar ESHS : (V, E). There’s a 7669
new way to redefine as 7670

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 corresponded to 7671
ViEXT ERN AL in the literatures of SuperHyperTotal. The latter is straightforward.  7672

136EXM20a Example 41.0.9. In the Figure (31.3), the connected Neutrosophic SuperHyperStar ESHS : 7673
(V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, by the Algorithm 7674
in previous Neutrosophic result, of the Neutrosophic SuperHyperVertices of the connected 7675

Neutrosophic SuperHyperStar ESHS : (V, E), in the Neutrosophic SuperHyperModel (31.3), is 7676
the Neutrosophic SuperHyperTotal. 7677

Proposition 41.0.10. Assume a connected Neutrosophic SuperHyperBipartite ESHB : (V, E). 7678
Then 7679

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 7680

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

is a longest path taken from a connected Neutrosophic SuperHyperBipartite ESHB : (V, E). 7681
There’s a new way to redefine as 7682

ViEXT ERN AL ∼ VjEXT ERN AL ≡

∃!Ez ∈ EESHG:(V,E) , ViEXT ERN AL , VjEXT ERN AL ∈ Ez ≡
∃!Ez ∈ EESHG:(V,E) , {ViEXT ERN AL , VjEXT ERN AL } ⊆ Ez .

The term “EXTERNAL” implies |N (ViEXT ERN AL )| ≥ |N (Vj )| where Vj is corresponded to 7683
ViEXT ERN AL in the literatures of SuperHyperTotal. The latter is straightforward. Then there’s 7684

no at least one SuperHyperTotal. Thus the notion of quasi may be up but the SuperHyperNotions 7685

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

based on SuperHyperTotal could be applied. There are only two SuperHyperParts. Thus every 7686
SuperHyperPart could have one SuperHyperVertex as the representative in the 7687

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

is a longest SuperHyperTotal taken from a connected Neutrosophic SuperHyperBipartite 7688

ESHB : (V, E). Thus only some SuperHyperVertices and only minimum-Neutrosophic-of- 7689
SuperHyperPart SuperHyperEdges are attained in any solution 7690

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

The latter is straightforward.  7691

136EXM21a Example 41.0.11. In the Neutrosophic Figure (31.4), the connected Neutrosophic SuperHy- 7692
perBipartite ESHB : (V, E), is Neutrosophic highlighted and Neutrosophic featured. The 7693
obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous Neutrosophic 7694
result, of the Neutrosophic SuperHyperVertices of the connected Neutrosophic SuperHyper- 7695

Bipartite ESHB : (V, E), in the Neutrosophic SuperHyperModel (31.4), is the Neutrosophic 7696
SuperHyperTotal. 7697

Proposition 41.0.12. Assume a connected Neutrosophic SuperHyperMultipartite ESHM : 7698

(V, E). Then 7699

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 7700

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

is a longest SuperHyperTotal taken from a connected Neutrosophic SuperHyperMultipartite 7701

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

ViEXT ERN AL ∼ VjEXT ERN AL ≡

∃!Ez ∈ EESHG:(V,E) , ViEXT ERN AL , VjEXT ERN AL ∈ Ez ≡
∃!Ez ∈ EESHG:(V,E) , {ViEXT ERN AL , VjEXT ERN AL } ⊆ Ez .

The term “EXTERNAL” implies |N (ViEXT ERN AL )| ≥ |N (Vj )| where Vj is corresponded to 7703
ViEXT ERN AL in the literatures of SuperHyperTotal. The latter is straightforward. Then there’s 7704
no at least one SuperHyperTotal. Thus the notion of quasi may be up but the SuperHyperNotions 7705

based on SuperHyperTotal could be applied. There are only z 0 SuperHyperParts. Thus every 7706
SuperHyperPart could have one SuperHyperVertex as the representative in the 7707

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

is a longest path taken from a connected Neutrosophic SuperHyperMultipartite ESHM : (V, E). 7708
Thus only some SuperHyperVertices and only minimum-Neutrosophic-of-SuperHyperPart 7709
SuperHyperEdges are attained in any solution 7710

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

is a longest path taken from a connected Neutrosophic SuperHyperMultipartite ESHM : (V, E). 7711
The latter is straightforward.  7712

136EXM22a Example 41.0.13. In the Figure (31.5), the connected Neutrosophic SuperHyperMultipartite 7713

ESHM : (V, E), is highlighted and Neutrosophic featured. The obtained Neutrosophic 7714
SuperHyperSet, by the Algorithm in previous Neutrosophic result, of the Neutrosophic 7715
SuperHyperVertices of the connected Neutrosophic SuperHyperMultipartite ESHM : (V, E), 7716
in the Neutrosophic SuperHyperModel (31.5), is the Neutrosophic SuperHyperTotal. 7717

Proposition 41.0.14. Assume a connected Neutrosophic SuperHyperWheel ESHW : (V, E). 7718
Then, 7719

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

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

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 7720

P : ViEXT ERN AL , Ei∗ , CEN T ER, Ej .

is a longest SuperHyperTotal taken from a connected Neutrosophic SuperHyperWheel ESHW : 7721

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

ViEXT ERN AL ∼ VjEXT ERN AL ≡

∃!Ez ∈ EESHG:(V,E) , ViEXT ERN AL , VjEXT ERN AL ∈ Ez ≡
∃!Ez ∈ EESHG:(V,E) , {ViEXT ERN AL , VjEXT ERN AL } ⊆ Ez .

The term “EXTERNAL” implies |N (ViEXT ERN AL )| ≥ |N (Vj )| where Vj is corresponded to 7723
ViEXT ERN AL in the literatures of SuperHyperTotal. The latter is straightforward. Then there’s 7724
at least one SuperHyperTotal. Thus the notion of quasi isn’t up and the SuperHyperNotions 7725

based on SuperHyperTotal could be applied. The unique embedded SuperHyperTotal 7726

proposes some longest SuperHyperTotal excerpt from some representatives. The latter is 7727
straightforward.  7728

136EXM23a Example 41.0.15. In the Neutrosophic Figure (31.6), the connected Neutrosophic SuperHyper- 7729
Wheel N SHW : (V, E), is Neutrosophic highlighted and featured. The obtained Neutrosophic 7730
SuperHyperSet, by the Algorithm in previous result, of the Neutrosophic SuperHyperVer- 7731
tices of the connected Neutrosophic SuperHyperWheel ESHW : (V, E), in the Neutrosophic 7732
SuperHyperModel (31.6), is the Neutrosophic SuperHyperTotal. 7733

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 CHAPTER 42 7734

Neutrosophic SuperHyperConnected But 7735

As The Extensions Excerpt From Dense 7736

And Super Forms 7737

Definition 42.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperConnected). 7738

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider a 7739
Neutrosophic SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and E 0 = {E1 , E2 , . . . , Ez }. Then either V 0 7740
or E 0 is called 7741

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

that Va ∈ Ei , Ej ; and ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; 7743

(ii) Neutrosophic re-SuperHyperConnected if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ 7744

E 0 , such that Va ∈ Ei , Ej ; ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; and 7745
|Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 7746

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

that Vi , Vj 6∈ Ea ; and ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; 7748

(iv) Neutrosophic rv-SuperHyperConnected if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ 7749

V 0 , such that Vi , Vj ∈ Ea ; ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; and 7750
|Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; 7751

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

7752
Neutrosophic re-SuperHyperConnected, Neutrosophic v-SuperHyperConnected, and Neut- 7753
rosophic rv-SuperHyperConnected. 7754

Definition 42.0.2. ((Neutrosophic) SuperHyperConnected). 7755

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider a 7756
Neutrosophic SuperHyperEdge (NSHE) E = {V1 , V2 , . . . , Vs }. Then E is called 7757

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

7758
Neutrosophic re-SuperHyperConnected, Neutrosophic v-SuperHyperConnected, and Neut- 7759
rosophic rv-SuperHyperConnected and C(N SHG) for an Extreme SuperHyperGraph 7760
N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S 7761

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

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

Extreme sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such 7763
that they form the Extreme SuperHyperConnected; 7764

(ii) a Neutrosophic SuperHyperConnected if it’s either of Neutrosophic e- 7765

SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neutrosophic v- 7766
SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) 7767
for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic 7768
cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S 7769

of high Neutrosophic cardinality conseNeighborive Neutrosophic SuperHyperEdges and 7770

Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperCon- 7771
nected; 7772

(iii) an Extreme SuperHyperConnected SuperHyperPolynomial if it’s either of Neut- 7773

rosophic e-SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neutrosophic 7774
v-SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) for 7775
an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial 7776
contains the Extreme coefficients defined as the Extreme number of the maximum Ex- 7777
treme cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S 7778

of high Extreme cardinality conseNeighborive Extreme SuperHyperEdges and Extreme 7779

SuperHyperVertices such that they form the Extreme SuperHyperConnected; and the 7780
Extreme power is corresponded to its Extreme coefficient; 7781

(iv) a Neutrosophic SuperHyperConnected SuperHyperPolynomial if it’s either of 7782

Neutrosophic e-SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neut- 7783
rosophic v-SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and 7784
C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic 7785
SuperHyperPolynomial contains the Neutrosophic coefficients defined as the Neutrosophic 7786

number of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges 7787

of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality conseNeighborive 7788
Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form 7789
the Neutrosophic SuperHyperConnected; and the Neutrosophic power is corresponded to 7790
its Neutrosophic coefficient; 7791

(v) an Extreme R-SuperHyperConnected if it’s either of Neutrosophic e- 7792

SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neutrosophic v- 7793
SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) 7794
for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme cardinality 7795

of an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme SuperHyper- 7796

Vertices in the conseNeighborive Extreme sequence of Extreme SuperHyperEdges and 7797
Extreme SuperHyperVertices such that they form the Extreme SuperHyperConnected; 7798

(vi) a Neutrosophic R-SuperHyperConnected if it’s either of Neutrosophic e- 7799

SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neutrosophic v- 7800
SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) 7801
for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic 7802
cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S 7803

of high Neutrosophic cardinality conseNeighborive Neutrosophic SuperHyperEdges and 7804

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperCon- 7805
nected; 7806

(vii) an Extreme R-SuperHyperConnected SuperHyperPolynomial if it’s either of 7807

Neutrosophic e-SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neut- 7808
rosophic v-SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and 7809
C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme Super- 7810
HyperPolynomial contains the Extreme coefficients defined as the Extreme number of the 7811
maximum Extreme cardinality of the Extreme SuperHyperVertices of an Extreme Super- 7812

HyperSet S of high Extreme cardinality conseNeighborive Extreme SuperHyperEdges and 7813

Extreme SuperHyperVertices such that they form the Extreme SuperHyperConnected; 7814
and the Extreme power is corresponded to its Extreme coefficient; 7815

(viii) a Neutrosophic SuperHyperConnected SuperHyperPolynomial if it’s either of 7816

Neutrosophic e-SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neut- 7817
rosophic v-SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and 7818
C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic 7819

SuperHyperPolynomial contains the Neutrosophic coefficients defined as the Neutrosophic 7820

number of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices 7821
of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality conseNeighborive 7822
Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form 7823
the Neutrosophic SuperHyperConnected; and the Neutrosophic power is corresponded to 7824
its Neutrosophic coefficient. 7825

136EXM1 Example 42.0.3. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E) in 7826
the mentioned Neutrosophic Figures in every Neutrosophic items. 7827

• On the Figure (30.1), the Neutrosophic SuperHyperNotion, namely, Neutrosophic Super- 7828
HyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7829

E1 and E3 are some empty Neutrosophic SuperHyperEdges but E2 is a loop Neutrosophic 7830
SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of Neutro- 7831
sophic SuperHyperNeighbor, there’s only one Neutrosophic SuperHyperEdge, namely, E4 . 7832
The Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means that there’s no 7833
Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. Thus the Neutrosophic 7834

SuperHyperVertex, V3 , is excluded in every given Neutrosophic SuperHyperConnected. 7835

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 (30.2), the Neutrosophic SuperHyperNotion, namely, Neutrosophic Super- 7836
HyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7837
E1 , E2 and E3 are some empty Neutrosophic SuperHyperEdges but E4 is a Neutrosophic 7838
SuperHyperEdge. Thus in the terms of Neutrosophic SuperHyperNeighbor, there’s only 7839
one Neutrosophic SuperHyperEdge, namely, E4 . The Neutrosophic SuperHyperVertex, V3 7840

is Neutrosophic isolated means that there’s no Neutrosophic SuperHyperEdge has it as 7841

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

a Neutrosophic endpoint. Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in 7842

every given Neutrosophic SuperHyperConnected. 7843

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 (30.3), the Neutrosophic SuperHyperNotion, namely, Neutrosophic Super- 7844

HyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7845

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 (30.4), the Neutrosophic SuperHyperNotion, namely, Neutrosophic Super- 7846
HyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7847

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 .

• On the Figure (30.5), the Neutrosophic SuperHyperNotion, namely, Neutrosophic Super- 7848
HyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7849

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 (30.6), the Neutrosophic SuperHyperNotion, namely, Neutrosophic Super- 7850
HyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7851

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 (30.7), the Neutrosophic SuperHyperNotion, namely, Neutrosophic Super- 7852
HyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7853

C(N SHG)Extreme SuperHyperConnected = {E12 , E13 , E14 }.

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

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 (30.8), the Neutrosophic SuperHyperNotion, namely, Neutrosophic Super- 7854
HyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7855

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 (30.9), the Neutrosophic SuperHyperNotion, namely, Neutrosophic Super- 7856
HyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7857

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 (30.10), the Neutrosophic SuperHyperNotion, namely, Neutrosophic Super- 7858
HyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7859

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 (30.11), the Neutrosophic SuperHyperNotion, namely, Neutrosophic Super- 7860
HyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7861

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 (30.12), the Neutrosophic SuperHyperNotion, namely, Neutrosophic Super- 7862
HyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7863

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 .

Henry Garrett · 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 (30.13), the Neutrosophic SuperHyperNotion, namely, Neutrosophic Super- 7864
HyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7865

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 (30.14), the Neutrosophic SuperHyperNotion, namely, Neutrosophic Super- 7866
HyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7867

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 (30.15), the Neutrosophic SuperHyperNotion, namely, Neutrosophic Super- 7868
HyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7869

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 .

• On the Figure (30.16), the Neutrosophic SuperHyperNotion, namely, Neutrosophic Super- 7870
HyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7871

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 (30.17), the Neutrosophic SuperHyperNotion, namely, Neutrosophic Super- 7872

HyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7873

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 .

Henry Garrett · 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 (30.18), the Neutrosophic SuperHyperNotion, namely, Neutrosophic Super- 7874
HyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7875

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 (30.19), the Neutrosophic SuperHyperNotion, namely, Neutrosophic Super- 7876
HyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7877

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 (30.20), the Neutrosophic SuperHyperNotion, namely, Neutrosophic Super- 7878
HyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7879

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.

• On the Figure (30.21), the Neutrosophic SuperHyperNotion, namely, Neutrosophic Super- 7880

HyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7881

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 (30.22), the Neutrosophic SuperHyperNotion, namely, Neutrosophic Super- 7882
HyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7883

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 7884

Neutrosophic SuperHyperClasses. 7885

Henry Garrett · 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 42.0.4. Assume a connected Neutrosophic SuperHyperPath ESHP : (V, E). Then 7886

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 7887

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 ESHP : (V, E). 7888
There’s a new way to redefine as 7889

ViEXT ERN AL ∼ VjEXT ERN AL ≡

∃!Ez ∈ EESHG:(V,E) , ViEXT ERN AL , VjEXT ERN AL ∈ Ez ≡
∃!Ez ∈ EESHG:(V,E) , {ViEXT ERN AL , VjEXT ERN AL } ⊆ Ez .

The term “EXTERNAL” implies |N (ViEXT ERN AL )| ≥ |N (Vj )| where Vj is corresponded to 7890
ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is straightforward.  7891

136EXM18a Example 42.0.5. In the Figure (31.1), the connected Neutrosophic SuperHyperPath ESHP : 7892
(V, E), is highlighted and featured. The Neutrosophic SuperHyperSet, in the Neutrosophic 7893
SuperHyperModel (31.1), is the SuperHyperConnected. 7894

Proposition 42.0.6. Assume a connected Neutrosophic SuperHyperCycle ESHC : (V, E). Then 7895

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

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 Henry Garrett · Independent Researcher · Department of Mathematics ·
DrHenryGarrett@gmail.com · Manhattan, NY, USA
|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 7896

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 ESHC : (V, E). 7897
There’s a new way to redefine as 7898

ViEXT ERN AL ∼ VjEXT ERN AL ≡

∃!Ez ∈ EESHG:(V,E) , ViEXT ERN AL , VjEXT ERN AL ∈ Ez ≡
∃!Ez ∈ EESHG:(V,E) , {ViEXT ERN AL , VjEXT ERN AL } ⊆ Ez .

The term “EXTERNAL” implies |N (ViEXT ERN AL )| ≥ |N (Vj )| where Vj is corresponded to 7899
ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is straightforward.  7900

136EXM19a Example 42.0.7. In the Figure (31.2), the connected Neutrosophic SuperHyperCycle N SHC : 7901
(V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, in the 7902
Neutrosophic SuperHyperModel (31.2), is the Neutrosophic SuperHyperConnected. 7903

Proposition 42.0.8. Assume a connected Neutrosophic SuperHyperStar ESHS : (V, E). Then 7904

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 7905

P : ViEXT ERN AL , Ei , CEN T ER, Ej .

be a longest path taken a connected Neutrosophic SuperHyperStar ESHS : (V, E). There’s a 7906

new way to redefine as 7907

ViEXT ERN AL ∼ VjEXT ERN AL ≡

∃!Ez ∈ EESHG:(V,E) , ViEXT ERN AL , VjEXT ERN AL ∈ Ez ≡
∃!Ez ∈ EESHG:(V,E) , {ViEXT ERN AL , VjEXT ERN AL } ⊆ Ez .

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

ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is straightforward.  7909

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

136EXM20a Example 42.0.9. In the Figure (31.3), the connected Neutrosophic SuperHyperStar ESHS : 7910
(V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, by the Algorithm 7911
in previous Neutrosophic result, of the Neutrosophic SuperHyperVertices of the connected 7912
Neutrosophic SuperHyperStar ESHS : (V, E), in the Neutrosophic SuperHyperModel (31.3), is 7913
the Neutrosophic SuperHyperConnected. 7914

Proposition 42.0.10. Assume a connected Neutrosophic SuperHyperBipartite ESHB : (V, E). 7915
Then 7916

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 7917

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

is a longest path taken from a connected Neutrosophic SuperHyperBipartite ESHB : (V, E). 7918
There’s a new way to redefine as 7919

ViEXT ERN AL ∼ VjEXT ERN AL ≡

∃!Ez ∈ EESHG:(V,E) , ViEXT ERN AL , VjEXT ERN AL ∈ Ez ≡
∃!Ez ∈ EESHG:(V,E) , {ViEXT ERN AL , VjEXT ERN AL } ⊆ Ez .

The term “EXTERNAL” implies |N (ViEXT ERN AL )| ≥ |N (Vj )| where Vj is corresponded to 7920
ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is straightforward. Then 7921
there’s no at least one SuperHyperConnected. Thus the notion of quasi may be up but the 7922
SuperHyperNotions based on SuperHyperConnected could be applied. There are only two 7923
SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as the 7924
representative in the 7925

P :

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

is a longest SuperHyperConnected taken from a connected Neutrosophic SuperHyperBipartite 7926

ESHB : (V, E). Thus only some SuperHyperVertices and only minimum-Neutrosophic-of- 7927
SuperHyperPart SuperHyperEdges are attained in any solution 7928

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

The latter is straightforward.  7929

136EXM21a Example 42.0.11. In the Neutrosophic Figure (31.4), the connected Neutrosophic SuperHy- 7930

perBipartite ESHB : (V, E), is Neutrosophic highlighted and Neutrosophic featured. The 7931
obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous Neutrosophic 7932
result, of the Neutrosophic SuperHyperVertices of the connected Neutrosophic SuperHyper- 7933
Bipartite ESHB : (V, E), in the Neutrosophic SuperHyperModel (31.4), is the Neutrosophic 7934
SuperHyperConnected. 7935

Proposition 42.0.12. Assume a connected Neutrosophic SuperHyperMultipartite ESHM : 7936

(V, E). Then 7937

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 7938

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 SuperHyperConnected taken from a connected Neutrosophic SuperHyperMultipartite 7939

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

ViEXT ERN AL ∼ VjEXT ERN AL ≡

∃!Ez ∈ EESHG:(V,E) , ViEXT ERN AL , VjEXT ERN AL ∈ Ez ≡
∃!Ez ∈ EESHG:(V,E) , {ViEXT ERN AL , VjEXT ERN AL } ⊆ Ez .

The term “EXTERNAL” implies |N (ViEXT ERN AL )| ≥ |N (Vj )| where Vj is corresponded to 7941
ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is straightforward. Then 7942
there’s no at least one SuperHyperConnected. Thus the notion of quasi may be up but 7943
the SuperHyperNotions based on SuperHyperConnected could be applied. There are only 7944

z 0 SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as the 7945
representative in the 7946

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

is a longest path taken from a connected Neutrosophic SuperHyperMultipartite ESHM : (V, E). 7947
Thus only some SuperHyperVertices and only minimum-Neutrosophic-of-SuperHyperPart 7948
SuperHyperEdges are attained in any solution 7949

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

is a longest path taken from a connected Neutrosophic SuperHyperMultipartite ESHM : (V, E). 7950

The latter is straightforward.  7951

136EXM22a Example 42.0.13. In the Figure (31.5), the connected Neutrosophic SuperHyperMultipartite 7952
ESHM : (V, E), is highlighted and Neutrosophic featured. The obtained Neutrosophic 7953

SuperHyperSet, by the Algorithm in previous Neutrosophic result, of the Neutrosophic 7954

SuperHyperVertices of the connected Neutrosophic SuperHyperMultipartite ESHM : (V, E), 7955
in the Neutrosophic SuperHyperModel (31.5), is the Neutrosophic SuperHyperConnected. 7956

Proposition 42.0.14. Assume a connected Neutrosophic SuperHyperWheel ESHW : (V, E). 7957
Then, 7958

∗
C(N SHG)Neutrosophic SuperHyperConnected = {Ei ∈ EESHG:(V,E) }.
C(N SHG)Neutrosophic SuperHyperConnected SuperHyperPolynomial
= |i | Ei ∈ |E ∗ ESHG:(V,E) |Neutrosophic Cardinality |z.
C(N SHG)Neutrosophic V-SuperHyperConnected = {CEN T ER ∈ VESHG:(V,E) }.
C(N SHG)Neutrosophic V-SuperHyperConnected SuperHyperPolynomial = z.

Proof. Let 7959

P : V EXT ERN AL i , E ∗ i , CEN T ER, Ej .

Henry Garrett · 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 SuperHyperConnected taken from a connected Neutrosophic SuperHyperWheel 7960

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

ViEXT ERN AL ∼ VjEXT ERN AL ≡

∃!Ez ∈ EESHG:(V,E) , ViEXT ERN AL , VjEXT ERN AL ∈ Ez ≡
∃!Ez ∈ EESHG:(V,E) , {ViEXT ERN AL , VjEXT ERN AL } ⊆ Ez .

The term “EXTERNAL” implies |N (ViEXT ERN AL )| ≥ |N (Vj )| where Vj is corresponded 7962
to ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is straightforward. 7963

Then there’s at least one SuperHyperConnected. Thus the notion of quasi isn’t up and 7964
the SuperHyperNotions based on SuperHyperConnected could be applied. The unique 7965
embedded SuperHyperConnected proposes some longest SuperHyperConnected excerpt from 7966
some representatives. The latter is straightforward.  7967

136EXM23a Example 42.0.15. In the Neutrosophic Figure (31.6), the connected Neutrosophic SuperHyper- 7968
Wheel N SHW : (V, E), is Neutrosophic highlighted and featured. The obtained Neutrosophic 7969
SuperHyperSet, by the Algorithm in previous result, of the Neutrosophic SuperHyperVer- 7970
tices of the connected Neutrosophic SuperHyperWheel ESHW : (V, E), in the Neutrosophic 7971
SuperHyperModel (31.6), is the Neutrosophic SuperHyperConnected. 7972

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 CHAPTER 43 7973

Background 7974

There are some scientific researches covering the topic of this research. In what follows, there 7975
are some discussion and literature reviews about them. 7976

The seminal paper and groundbreaking article is titled “neutrosophic co-degree and neutrosophic 7977
degree alongside chromatic numbers in the setting of some classes related to neutrosophic 7978
hypergraphs” in Ref. [HG1] by Henry Garrett (2022). In this research article, a novel approach 7979
is implemented on SuperHyperGraph and neutrosophic SuperHyperGraph based on general 7980
forms without using neutrosophic classes of neutrosophic SuperHyperGraph. It’s published 7981
in prestigious and fancy journal is entitled “Journal of Current Trends in Computer Science 7982

Research (JCTCSR)” with ISO abbreviation “J Curr Trends Comp Sci Res” in volume 1 7983
and issue 1 with pages 06-14. The research article studies deeply with choosing neutrosophic 7984
hypergraphs instead of neutrosophic SuperHyperGraph. It’s the breakthrough toward independent 7985
results based on initial background. 7986
The seminal paper and groundbreaking article is titled “Super Hyper Dominating and Super 7987
Hyper Resolving on Neutrosophic Super Hyper Graphs and Their Directions in Game Theory and 7988

Neutrosophic Super Hyper Classes” in Ref. [HG2] by Henry Garrett (2022). In this research 7989
article, a novel approach is implemented on SuperHyperGraph and neutrosophic SuperHyper- 7990
Graph based on fundamental SuperHyperNumber and using neutrosophic SuperHyperClasses 7991
of neutrosophic SuperHyperGraph. It’s published in prestigious and fancy journal is entitled 7992
“Journal of Mathematical Techniques and Computational Mathematics(JMTCM)” with ISO 7993
abbreviation “J Math Techniques Comput Math” in volume 1 and issue 3 with pages 242-263. 7994

The research article studies deeply with choosing directly neutrosophic SuperHyperGraph and 7995
SuperHyperGraph. It’s the breakthrough toward independent results based on initial background 7996
and fundamental SuperHyperNumbers. 7997
The seminal paper and groundbreaking article is titled “Some Super Hyper Degrees and Co-Super 7998
Hyper Degrees on Neutrosophic Super Hyper Graphs And Super Hyper Graphs Alongside 7999
Applications in Cancer’s Treatments” in Ref. [HG3] by Henry Garrett (2023). In this research 8000

article, a novel approach is implemented on SuperHyperGraph and neutrosophic SuperHy- 8001

perGraph based on fundamental notions and using vital tools in Cancer’s Treatments. It’s 8002
published in prestigious and fancy journal is entitled “Journal of Mathematical Techniques and 8003
Computational Mathematics(JMTCM)” with ISO abbreviation “J Math Techniques Comput 8004
Math” in volume 2 and issue 1 with pages 35-47. The research article studies deeply with 8005
choosing directly neutrosophic SuperHyperGraph and SuperHyperGraph. It’s the breakthrough 8006

toward independent results based on initial background and fundamental SuperHyperNumbers. 8007

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

In some articles are titled “0039 | Closing Numbers and Super-Closing Numbers as 8008
(Dual)Resolving and (Dual)Coloring alongside (Dual)Dominating in (Neutrosophic)n- 8009
SuperHyperGraph” in Ref. [HG4] by Henry Garrett (2022), “0049 | (Failed)1-Zero-Forcing 8010
Number in Neutrosophic Graphs” in Ref. [HG5] by Henry Garrett (2022), “Extreme SuperHy- 8011
perClique as the Firm Scheme of Confrontation under Cancer’s Recognition as the Model in 8012
The Setting of (Neutrosophic) SuperHyperGraphs” in Ref. [HG6] by Henry Garrett (2022), 8013

“Uncertainty On The Act And Effect Of Cancer Alongside The Foggy Positions Of Cells Toward 8014
Neutrosophic Failed SuperHyperClique inside Neutrosophic SuperHyperGraphs Titled Cancer’s 8015
Recognition” in Ref. [HG7] by Henry Garrett (2022), “Neutrosophic Version Of Separates 8016
Groups Of Cells In Cancer’s Recognition On Neutrosophic SuperHyperGraphs” in Ref. [HG8] 8017
by Henry Garrett (2022), “The Shift Paradigm To Classify Separately The Cells and Affected 8018
Cells Toward The Totality Under Cancer’s Recognition By New Multiple Definitions On the 8019

Sets Polynomials Alongside Numbers In The (Neutrosophic) SuperHyperMatching Theory 8020

Based on SuperHyperGraph and Neutrosophic SuperHyperGraph” in Ref. [HG9] by Henry 8021
Garrett (2022), “Breaking the Continuity and Uniformity of Cancer In The Worst Case of 8022
Full Connections With Extreme Failed SuperHyperClique In Cancer’s Recognition Applied in 8023
(Neutrosophic) SuperHyperGraphs” in Ref. [HG10] by Henry Garrett (2022), “Neutrosophic 8024
Failed SuperHyperStable as the Survivors on the Cancer’s Neutrosophic Recognition Based 8025

on Uncertainty to All Modes in Neutrosophic SuperHyperGraphs” in Ref. [HG11] by Henry 8026

Garrett (2022), “Extremism of the Attacked Body Under the Cancer’s Circumstances Where 8027
Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs” in Ref. [HG12] by Henry 8028
Garrett (2022), “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Recognitions And 8029
(Neutrosophic) SuperHyperGraphs” in Ref. [HG13] by Henry Garrett (2022), “Neutrosophic 8030
Messy-Style SuperHyperGraphs To Form Neutrosophic SuperHyperStable To Act on Cancer’s 8031

Neutrosophic Recognitions In Special ViewPoints” in Ref. [HG14] by Henry Garrett (2022), 8032
“Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To Use Neutrosophic 8033
SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond” in Ref. [HG15] by 8034
Henry Garrett (2022), “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well- 8035
SuperHyperModelled (Neutrosophic) SuperHyperGraphs ” in Ref. [HG16] by Henry Garrett 8036
(2022), “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic SuperHyperStable 8037

To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints” in Ref. [HG12] by 8038

Henry Garrett (2022), “Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutro- 8039
sophic) SuperHyperModeling in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs” 8040
in Ref. [HG17] by Henry Garrett (2022), “Neutrosophic Messy-Style SuperHyperGraphs To 8041
Form Neutrosophic SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special 8042

ViewPoints” in Ref. [HG18] by Henry Garrett (2022),“(Neutrosophic) SuperHyperModeling of 8043

Cancer’s Recognitions Featuring (Neutrosophic) SuperHyperDefensive SuperHyperAlliances” in 8044
Ref. [HG19] by Henry Garrett (2022), “(Neutrosophic) SuperHyperAlliances With SuperHyper- 8045
Defensive and SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph 8046
With (Neutrosophic) SuperHyperModeling of Cancer’s Recognitions And Related (Neutrosophic) 8047
SuperHyperClasses” in Ref. [HG20] by Henry Garrett (2022), “SuperHyperGirth on Su- 8048

perHyperGraph and Neutrosophic SuperHyperGraph With SuperHyperModeling of Cancer’s 8049

Recognitions” in Ref. [HG21] by Henry Garrett (2022), “Some SuperHyperDegrees and 8050
Co-SuperHyperDegrees on Neutrosophic SuperHyperGraphs and SuperHyperGraphs Alongside 8051
Applications in Cancer’s Treatments” in Ref. [HG22] by Henry Garrett (2022), “Super- 8052
HyperDominating and SuperHyperResolving on Neutrosophic SuperHyperGraphs And Their 8053

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

Directions in Game Theory and Neutrosophic SuperHyperClasses” in Ref. [HG23] by Henry 8054
Garrett (2022), “SuperHyperMatching By (R-)Definitions And Polynomials To Monitor Cancer’s 8055
Recognition In Neutrosophic SuperHyperGraphs” in Ref. [HG24] by Henry Garrett (2023), 8056
“The Focus on The Partitions Obtained By Parallel Moves In The Cancer’s Extreme Recognition 8057
With Different Types of Extreme SuperHyperMatching Set and Polynomial on (Neutrosophic) Su- 8058
perHyperGraphs” in Ref. [HG25] by Henry Garrett (2023), “Extreme Failed SuperHyperClique 8059

Decides the Failures on the Cancer’s Recognition in the Perfect Connections of Cancer’s Attacks 8060
By SuperHyperModels Named (Neutrosophic) SuperHyperGraphs” in Ref. [HG26] by Henry 8061
Garrett (2023), “Indeterminacy On The All Possible Connections of Cells In Front of Cancer’s 8062
Attacks In The Terms of Neutrosophic Failed SuperHyperClique on Cancer’s Recognition 8063
called Neutrosophic SuperHyperGraphs” in Ref. [HG27] by Henry Garrett (2023), “Perfect 8064
Directions Toward Idealism in Cancer’s Neutrosophic Recognition Forwarding Neutrosophic 8065

SuperHyperClique on Neutrosophic SuperHyperGraphs” in Ref. [HG28] by Henry Garrett 8066

(2023), “Demonstrating Complete Connections in Every Embedded Regions and Sub-Regions in 8067
the Terms of Cancer’s Recognition and (Neutrosophic) SuperHyperGraphs With (Neutrosophic) 8068
SuperHyperClique” in Ref. [HG29] by Henry Garrett (2023), “Different Neutrosophic Types 8069
of Neutrosophic Regions titled neutrosophic Failed SuperHyperStable in Cancer’s Neutrosophic 8070
Recognition modeled in the Form of Neutrosophic SuperHyperGraphs” in Ref. [HG30] by 8071

Henry Garrett (2023), “Using the Tool As (Neutrosophic) Failed SuperHyperStable To SuperHy- 8072
perModel Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs” in Ref. [HG31] by 8073
Henry Garrett (2023), “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic 8074
SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints” in Ref. 8075
[HG32] by Henry Garrett (2023), “(Neutrosophic) SuperHyperStable on Cancer’s Recognition 8076
by Well-SuperHyperModelled (Neutrosophic) SuperHyperGraphs” in Ref. [HG33] by Henry 8077

Garrett (2023), “Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To Use 8078

Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond” in Ref. 8079
[HG34] by Henry Garrett (2022), “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s 8080
Recognitions And (Neutrosophic) SuperHyperGraphs” in Ref. [HG35] by Henry Garrett (2022), 8081
“Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic) SuperHyperModeling 8082
in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs” in Ref. [HG36] by Henry 8083

Garrett (2022), “Basic Neutrosophic Notions Concerning SuperHyperDominating and Neutro- 8084
sophic SuperHyperResolving in SuperHyperGraph” in Ref. [HG37] by Henry Garrett (2022), 8085
“Initial Material of Neutrosophic Preliminaries to Study Some Neutrosophic Notions Based 8086
on Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic SuperHyperGraph (NSHG)” in 8087
Ref. [HG38] by Henry Garrett (2022), and [HG4; HG5; HG6; HG7; HG8; HG9; HG10; 8088

HG11; HG12; HG13; HG14; HG15; HG16; HG17; HG18; HG19; HG20; HG21; 8089
HG22; HG23; HG24; HG25; HG26; HG27; HG28; HG29; HG30; HG31; HG32; 8090
HG33; HG34; HG35; HG36; HG37; HG38; HG94; HG942; HG95; HG952; HG96; 8091
HG962; HG97; HG972; HG98; HG982; HG106; HG107; HG111; HG112; HG115; 8092
HG116; HG120; HG121; HG122; HG123; HG124; HG125; HG126; HG127; HG128; 8093
HG129; HG130; HG131; HG132; HG134; HG135; HG136; HG137; HG138; HG139; 8094

HG140; HG141; HG142; HG143; HG144; HG145; HG146; HG147; HG148; HG149; 8095
HG150; HG151; HG152; HG153; HG154; HG155; HG156; HG157; HG158; HG159; 8096
HG160; HG161; HG162; HG163; HG164; HG165; HG166; HG167; HG168; HG169; 8097
HG170; HG171; HG172; HG173; HG174; HG175; HG176; HG177; HG178; HG179; 8098
HG180; HG181; HG182; HG183; HG184; HG185; HG186; HG187; HG188; HG189; 8099

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

HG190; HG191; HG192; HG193; HG194; HG195; HG196; HG197; HG198; HG199; 8100
HG200; HG201; HG202; HG203; HG204; HG205; HG206; HG207; HG208; HG209; 8101
HG210; HG211; HG212; HG213; HG214; HG215; HG216; HG217; HG218; HG219; 8102
HG220; HG221; HG222; HG223; HG224; HG225; HG226; HG228; HG230; HG231; 8103
HG232; HG233; HG234; HG235; HG236], there are some endeavors to formalize the 8104
basic SuperHyperNotions about neutrosophic SuperHyperGraph and SuperHyperGraph along- 8105

side scientific research books at [HG60b; HG61b; HG62b; HG63b; HG64b; HG65b; 8106
HG66b; HG67b; HG68b; HG69b; HG70b; HG71b; HG72b; HG73b; HG74b; 8107
HG75b; HG76b; HG77b; HG78b; HG79b; HG80b; HG81b; HG82b; HG83b; 8108
HG84b; HG85b; HG86b; HG87b; HG88b; HG89b; HG90b; HG91b; HG92b; 8109
HG93b; HG94b; HG95b; HG96b; HG97b; HG98b; HG99b; HG100b; HG101b; 8110
HG102b; HG103b; HG104b; HG105b; HG106b; HG107b; HG108b; HG109b; 8111

HG110b; HG111b; HG112b; HG113b; HG114b; HG115b; HG116b; HG117b; 8112

HG118b; HG119b; HG120b; HG121b; HG122b; HG123b; HG124b; HG125b; 8113
HG126b; HG127b; HG128b; HG129b; HG130b; HG131b; HG132b; HG133b; 8114
HG134b; HG135b; HG136b; HG137b; HG138b; HG139b; HG140b; HG141b; 8115
HG142b; HG143b; HG144b; HG145b; HG146b; HG147b; HG148b; HG149b; 8116
HG150b; HG151b; HG152b; HG153b; HG154b; HG155b]. Two popular scientific 8117

research books in Scribd in the terms of high readers, 4190 and 5189 respectively, on neutro- 8118
sophic science is on [HG32b; HG44b]. 8119
Some scientific studies and scientific researches about neutrosophic graphs, are proposed as book 8120
in Ref. [HG71b] by Henry Garrett (2023) which is indexed by Google Scholar and has more 8121
than 4216 readers in Scribd. It’s titled “Beyond Neutrosophic Graphs” and published by Dr. 8122
Henry Garrett. This research book covers different types of notions and settings in neutrosophic 8123

graph theory and neutrosophic SuperHyperGraph theory. 8124

Also, some scientific studies and scientific researches about neutrosophic graphs, are proposed 8125
as book in Ref. [HG70b] by Henry Garrett (2023) which is indexed by Google Scholar and 8126
has more than 5214 readers in Scribd. It’s titled “Neutrosophic Duality” and published by Dr. 8127
Henry Garrett. This research book presents different types of notions SuperHyperResolving and 8128
SuperHyperDominating in the setting of duality in neutrosophic graph theory and neutrosophic 8129

SuperHyperGraph theory. This research book has scrutiny on the complement of the intended set 8130
and the intended set, simultaneously. It’s smart to consider a set but acting on its complement 8131
that what’s done in this research book which is popular in the terms of high readers in Scribd. 8132
See the seminal scientific researches [HG1; HG2; HG3]. The formalization of the notions on 8133
the framework of notions in SuperHyperGraphs, Neutrosophic notions in SuperHyperGraphs the- 8134

ory, and (Neutrosophic) SuperHyperGraphs theory at [HG4; HG5; HG6; HG7; HG8; HG9; 8135
HG10; HG11; HG12; HG13; HG14; HG15; HG16; HG17; HG18; HG19; HG20; 8136
HG21; HG22; HG23; HG24; HG25; HG26; HG27; HG28; HG29; HG30; HG31; 8137
HG32; HG33; HG34; HG35; HG36; HG37; HG38; HG94; HG942; HG95; HG952; 8138
HG96; HG962; HG97; HG972; HG98; HG982; HG106; HG107; HG111; HG112; 8139
HG115; HG116; HG120; HG121; HG122; HG123; HG124; HG125; HG126; HG127; 8140

HG128; HG129; HG130; HG131; HG132; HG134; HG135; HG136; HG137; HG138; 8141
HG139; HG140; HG141; HG142; HG143; HG144; HG145; HG146; HG147; HG148; 8142
HG149; HG150; HG151; HG152; HG153; HG154; HG155; HG156; HG157; HG158; 8143
HG159; HG160; HG161; HG162; HG163; HG164; HG165; HG166; HG167; HG168; 8144
HG169; HG170; HG171; HG172; HG173; HG174; HG175; HG176; HG177; HG178; 8145

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

HG179; HG180; HG181; HG182; HG183; HG184; HG185; HG186; HG187; HG188; 8146
HG189; HG190; HG191; HG192; HG193; HG194; HG195; HG196; HG197; HG198; 8147
HG199; HG200; HG201; HG202; HG203; HG204; HG205; HG206; HG207; HG208; 8148
HG209; HG210; HG211; HG212; HG213; HG214; HG215; HG216; HG217; HG218; 8149
HG219; HG220; HG221; HG222; HG223; HG224; HG225; HG226; HG228; HG230; 8150
HG231; HG232; HG233; HG234; HG235; HG236] alongside scientific research books 8151

at [HG60b; HG61b; HG62b; HG63b; HG64b; HG65b; HG66b; HG67b; HG68b; 8152
HG69b; HG70b; HG71b; HG72b; HG73b; HG74b; HG75b; HG76b; HG77b; 8153
HG78b; HG79b; HG80b; HG81b; HG82b; HG83b; HG84b; HG85b; HG86b; 8154
HG87b; HG88b; HG89b; HG90b; HG91b; HG92b; HG93b; HG94b; HG95b; 8155
HG96b; HG97b; HG98b; HG99b; HG100b; HG101b; HG102b; HG103b; HG104b; 8156
HG105b; HG106b; HG107b; HG108b; HG109b; HG110b; HG111b; HG112b; 8157

HG113b; HG114b; HG115b; HG116b; HG117b; HG118b; HG119b; HG120b; 8158

HG121b; HG122b; HG123b; HG124b; HG125b; HG126b; HG127b; HG128b; 8159
HG129b; HG130b; HG131b; HG132b; HG133b; HG134b; HG135b; HG136b; 8160
HG137b; HG138b; HG139b; HG140b; HG141b; HG142b; HG143b; HG144b; 8161
HG145b; HG146b; HG147b; HG148b; HG149b; HG150b; HG151b; HG152b; 8162
HG153b; HG154b; HG155b]. Two popular scientific research books in Scribd in the 8163

terms of high readers, 4216 and 5214 respectively, on neutrosophic science is on [HG32b; 8164
HG44b]. 8165

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 Bibliography 8166

HG1 [1] Henry Garrett, “Neutrosophic Co-degree and Neutrosophic Degree alongside Chromatic 8167

Numbers in the Setting of Some Classes Related to Neutrosophic Hypergraphs”, J Curr 8168
Trends Comp Sci Res 1(1) (2022) 06-14. 8169

HG2 [2] Henry Garrett, “Super Hyper Dominating and Super Hyper Resolving on Neutro- 8170

sophic Super Hyper Graphs and Their Directions in Game Theory and Neutrosophic 8171
Super Hyper Classes”, J Math Techniques Comput Math 1(3) (2022) 242-263. (doi: 8172
10.33140/JMTCM.01.03.09) 8173

HG3 [3] Henry Garrett, “Some Super Hyper Degrees and Co-Super Hyper Degrees on Neut- 8174
rosophic Super Hyper Graphs And Super Hyper Graphs Alongside Applications 8175
in Cancer’s Treatments”, J Math Techniques Comput Math 2(1) (2023) 35-47. 8176
(https://www.opastpublishers.com/open-access-articles/some-super-hyper-degrees-and- 8177
cosuper-hyper-degrees-on-neutrosophic-super-hyper-graphs-and-super-hyper-graphs- 8178

alongside-a.pdf) 8179

HG216 [4] Henry Garrett, “A Research on Cancers Recognition and Neutrosophic Super 8180
Hypergraph by Eulerian Super Hyper Cycles and Hamiltonian Sets as Hyper Cov- 8181

ering Versus Super separations”, J Math Techniques Comput Math 2(3) (2023) 8182
136-148. (https://www.opastpublishers.com/open-access-articles/a-research-on-cancers- 8183
recognition-and-neutrosophic-super-hypergraph-by-eulerian-super-hyper-cycles-and- 8184
hamiltonian-sets-.pdf) 8185

HG4 [5] Garrett, Henry. “0039 | Closing Numbers and Super-Closing Numbers as (Dual)Resolving 8186
and (Dual)Coloring alongside (Dual)Dominating in (Neutrosophic)n-SuperHyperGraph.” 8187
CERN European Organization for Nuclear Research - Zenodo, Nov. 2022. CERN 8188
European Organization for Nuclear Research, https://doi.org/10.5281/zenodo.6319942. 8189
https://oa.mg/work/10.5281/zenodo.6319942 8190

HG5 [6] Garrett, Henry. “0049 | (Failed)1-Zero-Forcing Number in Neutrosophic Graphs.” CERN 8191
European Organization for Nuclear Research - Zenodo, Feb. 2022. CERN European 8192
Organization for Nuclear Research, https://doi.org/10.13140/rg.2.2.35241.26724. ht- 8193

tps://oa.mg/work/10.13140/rg.2.2.35241.26724 8194

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

HG6 [7] Henry Garrett, “Extreme SuperHyperClique as the Firm Scheme of Confrontation under 8195
Cancer’s Recognition as the Model in The Setting of (Neutrosophic) SuperHyperGraphs”, 8196
Preprints 2023, 2023010308 (doi: 10.20944/preprints202301.0308.v1). 8197

HG7 [8] Henry Garrett, “Uncertainty On The Act And Effect Of Cancer Alongside The Foggy 8198
Positions Of Cells Toward Neutrosophic Failed SuperHyperClique inside Neutrosophic 8199
SuperHyperGraphs Titled Cancer’s Recognition”, Preprints 2023, 2023010282 (doi: 8200
10.20944/preprints202301.0282.v1). 8201

HG8 [9] Henry Garrett, “Neutrosophic Version Of Separates Groups Of Cells In Cancer’s 8202
Recognition On Neutrosophic SuperHyperGraphs”, Preprints 2023, 2023010267 (doi: 8203
10.20944/preprints202301.0267.v1). 8204

HG9 [10] Henry Garrett, “The Shift Paradigm To Classify Separately The Cells and Affected 8205
Cells Toward The Totality Under Cancer’s Recognition By New Multiple Definitions On 8206
the Sets Polynomials Alongside Numbers In The (Neutrosophic) SuperHyperMatching 8207

Theory Based on SuperHyperGraph and Neutrosophic SuperHyperGraph”, Preprints 2023, 8208

2023010265 (doi: 10.20944/preprints202301.0265.v1). 8209

HG10 [11] Henry Garrett, “Breaking the Continuity and Uniformity of Cancer In The Worst Case of 8210

Full Connections With Extreme Failed SuperHyperClique In Cancer’s Recognition Applied 8211
in (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010262,(doi: 10.20944/pre- 8212
prints202301.0262.v1). 8213

HG11 [12] Henry Garrett, “Neutrosophic Failed SuperHyperStable as the Survivors on the Cancer’s 8214
Neutrosophic Recognition Based on Uncertainty to All Modes in Neutrosophic SuperHy- 8215
perGraphs”, Preprints 2023, 2023010240 (doi: 10.20944/preprints202301.0240.v1). 8216

HG12 [13] Henry Garrett, “Extremism of the Attacked Body Under the Cancer’s Circumstances 8217
Where Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 8218
2023010224, (doi: 10.20944/preprints202301.0224.v1). 8219

HG13 [14] Henry Garrett, “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Recognitions 8220
And (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010105 (doi: 10.20944/pre- 8221
prints202301.0105.v1). 8222

HG14 [15] Henry Garrett, “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic 8223
SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints”, 8224
Preprints 2023, 2023010088 (doi: 10.20944/preprints202301.0088.v1). 8225

HG15 [16] Henry Garrett, “Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To 8226
Use Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond”, 8227
Preprints 2023, 2023010044 8228

HG16 [17] Henry Garrett, “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well- 8229
SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010043 8230
(doi: 10.20944/preprints202301.0043.v1). 8231

HG17 [18] Henry Garrett, “Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic) 8232
SuperHyperModeling in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs”, 8233

Preprints 2023, 2023010105 (doi: 10.20944/preprints202301.0105.v1). 8234

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

HG18 [19] Henry Garrett, “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic 8235
SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints”, 8236
Preprints 2023, 2023010088 (doi: 10.20944/preprints202301.0088.v1). 8237

HG19 [20] Henry Garrett, “(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions Featuring 8238
(Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, Preprints 2022, 2022120549 8239

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

HG20 [21] Henry Garrett, “(Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and Su- 8241
perHyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With (Neut- 8242
rosophic) SuperHyperModeling of Cancer’s Recognitions And Related (Neutrosophic) Su- 8243
perHyperClasses”, Preprints 2022, 2022120540 (doi: 10.20944/preprints202212.0540.v1). 8244

HG21 [22] Henry Garrett, “SuperHyperGirth on SuperHyperGraph and Neutrosophic SuperHyper- 8245
Graph With SuperHyperModeling of Cancer’s Recognitions”, Preprints 2022, 2022120500 8246
(doi: 10.20944/preprints202212.0500.v1). 8247

HG22 [23] Henry Garrett, “Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic 8248
SuperHyperGraphs and SuperHyperGraphs Alongside Applications in Cancer’s Treatments”, 8249
Preprints 2022, 2022120324 (doi: 10.20944/preprints202212.0324.v1). 8250

HG23 [24] Henry Garrett, “SuperHyperDominating and SuperHyperResolving on Neutrosophic Super- 8251
HyperGraphs And Their Directions in Game Theory and Neutrosophic SuperHyperClasses”, 8252
Preprints 2022, 2022110576 (doi: 10.20944/preprints202211.0576.v1). 8253

HG236 [25] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph 8254
By Hamiltonian-Type-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 8255

2023, (doi: 10.5281/zenodo.7806767). 8256

HG235 [26] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Hamiltonian-Type- 8257
Cycle-Neighbor In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 8258
2023, (doi: 10.5281/zenodo.7806838). 8259

HG234 [27] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph 8260

By Hamiltonian-Type-Cycle-Decomposition As Hyper Decompress On Super Decompensa- 8261

tion”, Zenodo 2023, (doi: 10.5281/zenodo.7804238). 8262

HG233 [28] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of 8263
Hamiltonian-Type-Cycle-Decomposition In Cancer’s Recognition With (Neutrosophic) 8264
SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zenodo.7804228). 8265

HG232 [29] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph 8266
By Hamiltonian-Type-Cycle-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, 8267
(doi: 10.5281/zenodo.7799902). 8268

HG231 [30] Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Type- 8269
Cycle-Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 8270

2023, (doi: 10.5281/zenodo.7804218). 8271

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

HG230 [31] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph 8272
By Hamiltonian-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, 8273
(doi: 10.5281/zenodo.7796334). 8274

HG228 [32] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph 8275
By Hamiltonian-Cycle-Decomposition As Hyper Decompress On Super Decompensation”, 8276
Zenodo 2023, (doi: 10.5281/zenodo.7793372). 8277

HG226 [33] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph 8278
By Hamiltonian-Cycle-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi: 8279
10.5281/zenodo.7791952). 8280

HG225 [34] Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Cycle- 8281
Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 8282
10.5281/zenodo.7791982). 8283

HG224 [35] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph 8284
By Hamiltonian-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 8285
10.5281/zenodo.7790026). 8286

HG223 [36] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Hamiltonian-Neighbor 8287
In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 8288
10.5281/zenodo.7790052). 8289

HG222 [37] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph 8290
By Hamiltonian-Decomposition As Hyper Decompress On Super Decompensation”, Zenodo 8291
2023, (doi: 10.5281/zenodo.7787066). 8292

HG221 [38] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of 8293
Hamiltonian-Decomposition In Recognition of Cancer With (Neutrosophic) SuperHy- 8294
perGraph”, Zenodo 2023, (doi: 10.5281/zenodo.7787094). 8295

HG220 [39] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph 8296
By Hamiltonian-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi: 8297
10.5281/zenodo.7781476). 8298

HG219 [40] Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Cut 8299
In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 8300
10.5281/zenodo.7783082). 8301

HG218 [41] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyper- 8302
Graph By Trace-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 8303
10.5281/zenodo.7777857). 8304

HG217 [42] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Trace-Neighbor 8305
In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 8306
10.5281/zenodo.7779286). 8307

HG215 [43] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 8308
By Trace-Decomposition As Hyper Decompress On Super Decompensation”, Zenodo 2023, 8309

(doi: 10.5281/zenodo.7771831). 8310

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

HG214 [44] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of Trace- 8311
Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 8312
2023, (doi: 10.5281/zenodo.7772468). 8313

HG213 [45] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 8314
By Trace-Cut As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 8315
10.13140/RG.2.2.20913.25446). 8316

HG212 [46] Henry Garrett, “New Ideas On Super Tract By Hyper Track Of Trace-Cut In Cancer’s 8317
Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zen- 8318
odo.7764916). 8319

HG211 [47] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 8320
By Edge-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 8321
10.13140/RG.2.2.11770.98247). 8322

HG210 [48] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Edge-Neighbor In 8323
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 8324
10.13140/RG.2.2.12400.12808). 8325

HG209 [49] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 8326
By Edge-Decomposition As Hyper Decompress On Super Decompensation”, ResearchGate 8327
2023, (doi: 10.13140/RG.2.2.22545.10089). 8328

HG208 [50] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of 8329
Edge-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 8330
ResearchGate 2023, (doi: 10.13140/RG.2.2.29544.34564). 8331

HG207 [51] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyper- 8332
Graph By Edge-Cut As Hyper Edify On Super Eddy”, ResearchGate 2023, (doi: 8333
10.13140/RG.2.2.11377.76644). 8334

HG206 [52] Henry Garrett, “New Ideas On Super Eddy By Hyper Edify Of Edge-Cut In Can- 8335
cer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 8336
10.13140/RG.2.2.23750.96329). 8337

HG205 [53] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 8338
By Vertex-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 8339
10.13140/RG.2.2.31366.24641). 8340

HG204 [54] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Vertex-Neighbor In 8341
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 8342
10.13140/RG.2.2.34721.68960). 8343

HG203 [55] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 8344
By Vertex-Decomposition As Hyper Decompress On Super Decompensation”, ResearchGate 8345
2023, (doi: 10.13140/RG.2.2.30212.81289). 8346

HG202 [56] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of 8347
Vertex-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 8348

ResearchGate 2023, (doi: 10.13140/RG.2.2.18468.76169). 8349

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

HG201 [57] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyper- 8350
Graph By Vertex-Cut As Hyper Vertu On Super Vertigo”, ResearchGate 2023, (doi: 8351
10.13140/RG.2.2.24288.35842). 8352

HG200 [58] Henry Garrett, “New Ideas On Super Vertigo By Hyper Vertu Of Vertex-Cut In 8353
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 8354
10.13140/RG.2.2.32467.25124). 8355

HG199 [59] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 8356
By Stable-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 8357
10.13140/RG.2.2.31025.45925). 8358

HG198 [60] Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of Stable-Neighbor In 8359
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 8360
10.13140/RG.2.2.17184.25602). 8361

HG197 [61] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 8362
By Stable-Decompositions As Hyper Stain On Super Stagy”, ResearchGate 2023, (doi: 8363
10.13140/RG.2.2.23423.28327). 8364

HG196 [62] Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Decompositions In 8365
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 8366
10.13140/RG.2.2.28456.44805). 8367

HG195 [63] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyper- 8368
Graph By Stable-Cut As Hyper Stain On Super Stagy”, ResearchGate 2023, (doi: 8369
10.13140/RG.2.2.23525.68320). 8370

HG194 [64] Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Cut In Can- 8371
cer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 8372
10.13140/RG.2.2.20170.24000). 8373

HG193 [65] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 8374
By Clique-Neighbors As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 8375
10.13140/RG.2.2.36475.59683). 8376

HG192 [66] Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of Clique-Neighbors In 8377
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 8378
10.13140/RG.2.2.29764.71046). 8379

HG191 [67] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 8380
By Clique-Decompositions As Hyper Decompile On Super Decommission”, ResearchGate 8381
2023, (doi: 10.13140/RG.2.2.18780.87683). 8382

HG190 [68] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of 8383
Clique- Decompositions In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 8384
ResearchGate 2023, (doi: 10.13140/RG.2.2.27169.48487). 8385

HG189 [69] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyper- 8386
Graph By Clique-Cut As Hyper Click On Super Cliche”, ResearchGate 2023, (doi: 8387

10.13140/RG.2.2.26134.01603). 8388

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

HG188 [70] Henry Garrett, “New Ideas On Super Cliff By Hyper Cling Of Clique-Cut In Can- 8389
cer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 8390
10.13140/RG.2.2.27392.30721). 8391

HG187 [71] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHy- 8392
perGraph By Space As Hyper Spin On Super Spacy”, ResearchGate 2023, (doi: 8393
10.13140/RG.2.2.33028.40321). 8394

HG186 [72] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyper- 8395
Graph By List- Coloring As Hyper List On Super Lisle”, ResearchGate 2023, (doi: 8396
10.13140/RG.2.2.21389.20966). 8397

HG185 [73] Henry Garrett, “New Ideas On Super Lith By Hyper Lite Of List-Coloring In 8398
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 8399
10.13140/RG.2.2.16356.04489). 8400

HG184 [74] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHy- 8401
perGraph By Space As Hyper Sparse On Super Spark”, ResearchGate 2023, (doi: 8402
10.13140/RG.2.2.21756.21129). 8403

HG183 [75] Henry Garrett, “New Ideas On Super Solidarity By Hyper Soul Of Space In 8404
Cancer’s Recognition With (Extreme) SuperHyperGraph”, ResearchGate 2023, (doi: 8405
10.13140/RG.2.2.30983.68009). 8406

HG182 [76] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 8407
By Edge-Connectivity As Hyper Disclosure On Super Closure”, ResearchGate 2023, (doi: 8408
10.13140/RG.2.2.28552.29445). 8409

HG181 [77] Henry Garrett, “New Ideas On Super Uniform By Hyper Deformation Of Edge- 8410
Connectivity In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchG- 8411
ate 2023, (doi: 10.13140/RG.2.2.10936.21761). 8412

HG180 [78] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 8413
By Vertex-Connectivity As Hyper Leak On Super Structure”, ResearchGate 2023, (doi: 8414
10.13140/RG.2.2.35105.89447). 8415

HG179 [79] Henry Garrett, “New Ideas On Super System By Hyper Explosions Of Vertex-Connectivity 8416
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, 8417
(doi: 10.13140/RG.2.2.30072.72960). 8418

HG178 [80] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 8419
By Tree-Decomposition As Hyper Forward On Super Returns”, ResearchGate 2023, (doi: 8420
10.13140/RG.2.2.31147.52003). 8421

HG177 [81] Henry Garrett, “New Ideas On Super Nodes By Hyper Moves Of Tree-Decomposition In 8422
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 8423
10.13140/RG.2.2.32825.24163). 8424

HG176 [82] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyper- 8425
Graph By Chord As Hyper Excellence On Super Excess”, ResearchGate 2023, (doi: 8426

10.13140/RG.2.2.13059.58401). 8427

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

HG175 [83] Henry Garrett, “New Ideas On Super Gap By Hyper Navigations Of Chord In 8428
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 8429
10.13140/RG.2.2.11172.14720). 8430

HG174 [84] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 8431
By SuperHyper(i,j)-Domination As Hyper Controller On Super Waves”, ResearchGate 8432
2023, (doi: 10.13140/RG.2.2.22011.80165). 8433

HG173 [85] Henry Garrett, “New Ideas On Super Coincidence By Hyper Routes Of SuperHyper(i,j)- 8434
Domination In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchG- 8435
ate 2023, (doi: 10.13140/RG.2.2.30819.84003). 8436

HG172 [86] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 8437
By SuperHyperEdge-Domination As Hyper Reversion On Super Indirection”, ResearchGate 8438
2023, (doi: 10.13140/RG.2.2.10493.84962). 8439

HG171 [87] Henry Garrett, “New Ideas On Super Obstacles By Hyper Model Of SuperHyperEdge- 8440
Domination In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchG- 8441
ate 2023, (doi: 10.13140/RG.2.2.13849.29280). 8442

HG170 [88] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 8443
By SuperHyperK-Domination As Hyper k-Actions On Super Patterns”, ResearchGate 8444
2023, (doi: 10.13140/RG.2.2.19944.14086). 8445

HG169 [89] Henry Garrett, “New Ideas On Super Harmony By Hyper k-Function Of SuperHyperK- 8446
Domination In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchG- 8447
ate 2023, (doi: 10.13140/RG.2.2.23299.58404). 8448

HG168 [90] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 8449
By SuperHyperK-Number As Hyper k-Partition On Super Layers”, ResearchGate 2023, 8450
(doi: 10.13140/RG.2.2.33103.76968). 8451

HG167 [91] Henry Garrett, “New Ideas On Super Gradient By Hyper k-Class Of SuperHyperK-Number 8452
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, 8453
(doi: 10.13140/RG.2.2.23037.44003). 8454

HG166 [92] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 8455
By SuperHyperOrder As Hyper Enumerations On Super Landmarks”, ResearchGate 2023, 8456
(doi: 10.13140/RG.2.2.35646.56641). 8457

HG165 [93] Henry Garrett, “New Ideas On Super Analogous By Hyper Visions Of SuperHyperOrder 8458
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, 8459
(doi: 10.13140/RG.2.2.18030.48967). 8460

HG164 [94] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 8461
By SuperHyperColoring As Hyper Categories On Super Neighbors”, ResearchGate 2023, 8462
(doi: 10.13140/RG.2.2.13973.81121). 8463

HG163 [95] Henry Garrett, “New Ideas On Super Relations By Hyper Identifications Of SuperHyper- 8464
Coloring In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 8465

2023, (doi: 10.13140/RG.2.2.34106.47047). 8466

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

HG162 [96] Henry Garrett, “New Ideas On Super Contradiction By Hyper Detection of SuperHyper- 8467
Defensive In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 8468
ResearchGate 2023, (doi: 10.13140/RG.2.2.13397.09446). 8469

HG161 [97] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 8470
By SuperHyperDimension As Hyper Distinguishing On Super Distances”, ResearchGate 8471
2023, (doi: 10.13140/RG.2.2.31956.88961). 8472

HG160 [98] Henry Garrett, “New Ideas On Super Locations By Hyper Differing Of SuperHyperDi- 8473
mension In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 8474
2023, (doi: 10.13140/RG.2.2.15179.67361). 8475

HG159 [99] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 8476
By SuperHyperDominating As Hyper Closing On Super Messy”, ResearchGate 2023, (doi: 8477
10.13140/RG.2.2.21510.45125). 8478

HG158 [100] Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDom- 8479
inating In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 8480
2023, (doi: 10.13140/RG.2.2.13121.84321). 8481

HG157 [101] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 8482
By SuperHyperConnected As Hyper Group On Super Surge”, ResearchGate 2023, (doi: 8483
10.13140/RG.2.2.11758.69441). 8484

HG156 [102] Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of SuperHyperCon- 8485
nected In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 8486
2023, (doi: 10.13140/RG.2.2.31891.35367). 8487

HG155 [103] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 8488
By SuperHyperTotal As Hyper Covering On Super Infections”, ResearchGate 2023, (doi: 8489
10.13140/RG.2.2.19360.87048). 8490

HG154 [104] Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal 8491
In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 8492
10.13140/RG.2.2.32363.21286). 8493

HG153 [105] Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect 8494
In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 8495
10.13140/RG.2.2.23266.81602). 8496

HG152 [106] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 8497
By SuperHyperPerfect As Hyper Idealism On Super Vacancy”, ResearchGate 2023, (doi: 8498
10.13140/RG.2.2.19911.37285). 8499

HG151 [107] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 8500
By SuperHyperJoin As Hyper Separations On Super Sorts”, ResearchGate 2023, (doi: 8501
10.13140/RG.2.2.11050.90569). 8502

HG150 [108] Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of SuperHy- 8503
perJoin In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 8504

2023, (doi: 10.13140/RG.2.2.17761.79206). 8505

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

HG149 [109] Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of Super- 8506
HyperDuality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 8507
ResearchGate 2023, (doi: 10.13140/RG.2.2.34953.52320). 8508

HG148 [110] Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph 8509
By SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchG- 8510
ate 2023, (doi: 10.13140/RG.2.2.33275.80161). 8511

HG147 [111] Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph 8512
By Path SuperHyperColoring As Hyper Correction On Super Faults”, ResearchGate 2023, 8513
(doi: 10.13140/RG.2.2.30182.50241). 8514

HG146 [112] Henry Garrett, “New Ideas On Super Reflections By Hyper Rotations Of Path SuperHy- 8515
perColoring In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 8516
ResearchGate 2023, (doi: 10.13140/RG.2.2.33459.30243). 8517

HG145 [113] Henry Garrett, “New Ideas As Hyper Deformations On Super Chains In Cancer’s 8518
Neutrosophic Recognition and Neutrosophic SuperHyperGraph By SuperHyperDensity”, 8519
ResearchGate 2023, (doi: 10.13140/RG.2.2.13444.60806). 8520

HG144 [114] Henry Garrett, “New Ideas As Hyper Ignorance By SuperHyperDensity On Super 8521
Resistances In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 8522
ResearchGate 2023, (doi:10.13140/RG.2.2.16800.05123). 8523

HG143 [115] Henry Garrett, “New Research On Cancer’s Recognition and Neutrosophic SuperHyper- 8524
Graph By Eulerian SuperHyperCycles and Hamiltonian Sets As Hyper Covering Versus 8525
Super separations-VI”, ResearchGate 2023, (doi: 10.13140/RG.2.2.29913.80482). 8526

HG142 [116] Henry Garrett, “New Research On Cancer’s Recognition and Neutrosophic SuperHyper- 8527
Graph By Eulerian SuperHyperCycles and Hamiltonian Sets As Hyper Covering Versus 8528
Super separations-V”, ResearchGate 2023, (doi: 10.13140/RG.2.2.33269.24809). 8529

HG141 [117] Henry Garrett, “New Research On Cancer’s Recognition and Neutrosophic SuperHyper- 8530
Graph By Eulerian SuperHyperCycles and Hamiltonian Sets As Hyper Covering Versus 8531
Super separations-IV”, ResearchGate 2023, (doi: 10.13140/RG.2.2.34946.96960). 8532

HG140 [118] Henry Garrett, “A Research On Cancer’s Recognition and Neutrosophic SuperHyperGraph 8533
By Eulerian SuperHyperCycles and Hamiltonian Sets As Hyper Covering Versus Super 8534
separations-III”, ResearchGate 2023, (doi: 10.13140/RG.2.2.14814.31040). 8535

HG139 [119] Henry Garrett, “A Research On Cancer’s Recognition and Neutrosophic SuperHyperGraph 8536
By Eulerian SuperHyperCycles and Hamiltonian Sets As Hyper Covering Versus Super 8537
separations-II”, ResearchGate 2023, (doi: 10.13140/RG.2.2.15653.17125). 8538

HG138 [120] Henry Garrett, “A Research On Cancer’s Recognition and Neutrosophic SuperHyperGraph 8539
By Eulerian SuperHyperCycles and Hamiltonian Sets As Hyper Covering Versus Super 8540
separations-I”, ResearchGate 2023, (doi: 10.13140/RG.2.2.25719.50089). 8541

HG137 [121] Henry Garrett, “New Ideas On Super Disruptions In Cancer’s Extreme Recognition 8542
As Neutrosophic SuperHyperGraph By Hyper Plans Called SuperHyperConnectivities”, 8543

ResearchGate 2023, (doi: 10.13140/RG.2.2.29441.94562). 8544

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

HG136 [122] Henry Garrett, “Cancer’s Neutrosophic Recognition As Neutrosophic SuperHyperGraph 8545
By SuperHyperConnectivities As Hyper Diagnosis On Super Mechanism”, ResearchGate 8546
2023, (doi: 10.13140/RG.2.2.17252.24968). 8547

HG135 [123] Henry Garrett,“Cancer’s Recognition and (Neutrosophic) SuperHyperGraph By the 8548
Criteria of Eulerian and Hamiltonian Type-Sets As Hyper Modified Cycles On Super 8549
Mess”, ResearchGate 2023,(doi: 10.13140/RG.2.2.16652.59525). 8550

HG134 [124] Henry Garrett,“Eulerian and Hamiltonian In Cancer’s Neutrosophic Recognition and 8551

Neutrosophic SuperHyperGraph On Super Interactions By Hyper Extensions of Cycles”, 8552

ResearchGate 2023,(doi: 10.13140/RG.2.2.34583.24485). 8553

HG132 [125] Henry Garrett,“SuperHyperGirth Type-Results on extreme SuperHyperGirth theory and 8554

(Neutrosophic) SuperHyperGraphs Toward Cancer’s extreme Recognition”, Preprints 2023, 8555

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

HG131 [126] Henry Garrett,“Neutrosophic SuperHyperGraphs Warns Hyper Landmark of neutrosophic 8557
SuperHyperGirth In Super Type-Versions of Cancer’s neutrosophic Recognition”, Preprints 8558

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

HG130 [127] Henry Garrett,“The Constructions of (Neutrosophic) SuperHyperGraphs on the Cancer’s 8560
Recognition in The Confrontation With Super Attacks In Hyper Situations By Implement- 8561

ing (Neutrosophic) 1-Failed SuperHyperForcing in The Technical Approaches to Neutralize 8562

SuperHyperViews”, ResearchGate 2023, (doi: 10.13140/RG.2.2.26240.51204). 8563

HG129 [128] Henry Garrett,“(Neutrosophic) 1-Failed SuperHyperForcing As the Entrepreneurs on 8564

Cancer’s Recognitions To Fail Forcing Style As the Super Classes With Hyper Effects 8565

In The Background of the Framework is So-Called (Neutrosophic) SuperHyperGraphs”, 8566

ResearchGate 2023, (doi: 10.13140/RG.2.2.12818.73925). 8567

HG128 [129] Henry Garrett,“Super Actions On The Types of Hyper Levels In The Sensible Neutrosophic 8568

SuperHyperGirth On Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyper- 8569

Graph”, ResearchGate 2023,(doi: 10.13140/RG.2.2.26836.88960). 8570

HG127 [130] Henry Garrett,“SuperHyperGirth Approaches on the Super Challenges on the Cancer’s 8571
Recognition In the Hyper Model of (Neutrosophic) SuperHyperGraph”, ResearchGate 8572

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

HG126 [131] Henry Garrett,“Extreme SuperHyperClique as the Firm Scheme of Confrontation under 8574
Cancer’s Recognition as the Model in The Setting of (Neutrosophic) SuperHyperGraphs”, 8575

Preprints 2023, 2023010308 (doi: 10.20944/preprints202301.0308.v1). 8576

HG125 [132] Henry Garrett,“Uncertainty On The Act And Effect Of Cancer Alongside The Foggy 8577
Positions Of Cells Toward Neutrosophic Failed SuperHyperClique inside Neutrosophic 8578
SuperHyperGraphs Titled Cancer’s Recognition”, Preprints 2023, 2023010282 (doi: 8579

10.20944/preprints202301.0282.v1). 8580

HG124 [133] Henry Garrett,“Neutrosophic Version Of Separates Groups Of Cells In Cancer’s 8581
Recognition On Neutrosophic SuperHyperGraphs”, Preprints 2023, 2023010267 (doi: 8582

10.20944/preprints202301.0267.v1).). 8583

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

HG123 [134] Henry Garrett, “The Shift Paradigm To Classify Separately The Cells and Affected 8584
Cells Toward The Totality Under Cancer’s Recognition By New Multiple Definitions On 8585
the Sets Polynomials Alongside Numbers In The (Neutrosophic) SuperHyperMatching 8586
Theory Based on SuperHyperGraph and Neutrosophic SuperHyperGraph”, Preprints 2023, 8587
2023010265 (doi: 10.20944/preprints202301.0265.v1). 8588

HG122 [135] Henry Garrett,“Breaking the Continuity and Uniformity of Cancer In The Worst Case of 8589
Full Connections With Extreme Failed SuperHyperClique In Cancer’s Recognition Applied 8590
in (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010262,(doi: 10.20944/pre- 8591
prints202301.0262.v1). 8592

HG121 [136] Henry Garrett, “Neutrosophic Failed SuperHyperStable as the Survivors on the Cancer’s 8593
Neutrosophic Recognition Based on Uncertainty to All Modes in Neutrosophic SuperHy- 8594
perGraphs”, Preprints 2023, 2023010240 (doi: 10.20944/preprints202301.0240.v1). 8595

HG120 [137] Henry Garrett, “Extremism of the Attacked Body Under the Cancer’s Circumstances 8596
Where Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 8597
2023010224, (doi: 10.20944/preprints202301.0224.v1). 8598

HG24 [138] Henry Garrett,“SuperHyperMatching By (R-)Definitions And Polynomials To Monitor 8599

Cancer’s Recognition In Neutrosophic SuperHyperGraphs”, ResearchGate 2023,(doi: 8600

10.13140/RG.2.2.35061.65767). 8601

HG25 [139] Henry Garrett,“The Focus on The Partitions Obtained By Parallel Moves In The 8602

Cancer’s Extreme Recognition With Different Types of Extreme SuperHyperMatching 8603

Set and Polynomial on (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 8604
10.13140/RG.2.2.18494.15680). 8605

HG26 [140] Henry Garrett,“Extreme Failed SuperHyperClique Decides the Failures on the Can- 8606

cer’s Recognition in the Perfect Connections of Cancer’s Attacks By SuperHy- 8607

perModels Named (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 8608
10.13140/RG.2.2.32530.73922). 8609

HG27 [141] Henry Garrett,“Indeterminacy On The All Possible Connections of Cells In Front 8610

of Cancer’s Attacks In The Terms of Neutrosophic Failed SuperHyperClique on 8611

Cancer’s Recognition called Neutrosophic SuperHyperGraphs”, ResearchGate 2023, (doi: 8612
10.13140/RG.2.2.15897.70243). 8613

HG116 [142] Henry Garrett,“Extreme Failed SuperHyperClique Decides the Failures on the Can- 8614

cer’s Recognition in the Perfect Connections of Cancer’s Attacks By SuperHy- 8615

perModels Named (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 8616
10.13140/RG.2.2.32530.73922). 8617

HG115 [143] Henry Garrett, “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Recognitions 8618

And (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010105 (doi: 10.20944/pre- 8619

prints202301.0105.v1). 8620

HG28 [144] Henry Garrett,“Perfect Directions Toward Idealism in Cancer’s Neutrosophic Recogni- 8621
tion Forwarding Neutrosophic SuperHyperClique on Neutrosophic SuperHyperGraphs”, 8622

ResearchGate 2023, (doi: 10.13140/RG.2.2.30092.80004). 8623

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

HG29 [145] Henry Garrett,“Demonstrating Complete Connections in Every Embedded Regions 8624
and Sub-Regions in the Terms of Cancer’s Recognition and (Neutrosophic) Su- 8625
perHyperGraphs With (Neutrosophic) SuperHyperClique”, ResearchGate 2023, (doi: 8626
10.13140/RG.2.2.23172.19849). 8627

HG112 [146] Henry Garrett, “Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic) 8628
SuperHyperModeling in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs”, 8629
Preprints 2023, 2023010105 (doi: 10.20944/preprints202301.0105.v1). 8630

HG111 [147] Henry Garrett, “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic 8631
SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints”, 8632

Preprints 2023, 2023010088 (doi: 10.20944/preprints202301.0088.v1). 8633

HG30 [148] Henry Garrett,“Different Neutrosophic Types of Neutrosophic Regions titled neut- 8634
rosophic Failed SuperHyperStable in Cancer’s Neutrosophic Recognition modeled 8635
in the Form of Neutrosophic SuperHyperGraphs”, ResearchGate 2023, (doi: 8636

10.13140/RG.2.2.17385.36968). 8637

HG107 [149] Henry Garrett, “Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To 8638
Use Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond”, 8639
Preprints 2023, 2023010044 8640

HG106 [150] Henry Garrett, “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well- 8641
SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010043 8642
(doi: 10.20944/preprints202301.0043.v1). 8643

HG31 [151] Henry Garrett, “Using the Tool As (Neutrosophic) Failed SuperHyperStable To SuperHy- 8644

perModel Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs”, ResearchGate 8645

2023, (doi: 10.13140/RG.2.2.28945.92007). 8646

HG32 [152] Henry Garrett, “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic 8647
SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints”, 8648

ResearchGate 2023, (doi: 10.13140/RG.2.2.11447.80803). 8649

HG33 [153] Henry Garrett, “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well- 8650
SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 8651
10.13140/RG.2.2.35774.77123). 8652

HG34 [154] Henry Garrett, “Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To 8653
Use Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond”, 8654
ResearchGate 2022, (doi: 10.13140/RG.2.2.36141.77287). 8655

HG35 [155] Henry Garrett, “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Re- 8656

cognitions And (Neutrosophic) SuperHyperGraphs”, ResearchGate 2022, (doi: 8657

10.13140/RG.2.2.29430.88642). 8658

HG36 [156] Henry Garrett, “Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic) 8659
SuperHyperModeling in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs”, 8660

ResearchGate 2022, (doi: 10.13140/RG.2.2.11369.16487). 8661

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

HG982 [157] Henry Garrett, “(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions Featuring 8662
(Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, Preprints 2022, 2022120549 8663
(doi: 10.20944/preprints202212.0549.v1). 8664

HG98 [158] Henry Garrett, “(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions Featuring 8665

(Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, ResearchGate 2022, (doi: 8666

10.13140/RG.2.2.19380.94084). 8667

HG972 [159] Henry Garrett, “(Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and Su- 8668
perHyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With (Neut- 8669
rosophic) SuperHyperModeling of Cancer’s Recognitions And Related (Neutrosophic) Su- 8670

perHyperClasses”, Preprints 2022, 2022120540 (doi: 10.20944/preprints202212.0540.v1). 8671

HG97 [160] Henry Garrett, “(Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and 8672
SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With 8673
(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions And Related (Neutrosophic) 8674

SuperHyperClasses”, ResearchGate 2022, (doi: 10.13140/RG.2.2.14426.41923). 8675

HG962 [161] Henry Garrett, “SuperHyperGirth on SuperHyperGraph and Neutrosophic SuperHyper- 8676
Graph With SuperHyperModeling of Cancer’s Recognitions”, Preprints 2022, 2022120500 8677
(doi: 10.20944/preprints202212.0500.v1). 8678

HG96 [162] Henry Garrett, “SuperHyperGirth on SuperHyperGraph and Neutrosophic SuperHyper- 8679
Graph With SuperHyperModeling of Cancer’s Recognitions”, ResearchGate 2022 (doi: 8680
10.13140/RG.2.2.20993.12640). 8681

HG952 [163] Henry Garrett,“Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic 8682

SuperHyperGraphs and SuperHyperGraphs Alongside Applications in Cancer’s Treatments”, 8683

Preprints 2022, 2022120324 (doi: 10.20944/preprints202212.0324.v1). 8684

HG95 [164] Henry Garrett, “Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic Su- 8685
perHyperGraphs And SuperHyperGraphs Alongside Applications in Cancer’s Treatments”, 8686

ResearchGate 2022 (doi: 10.13140/RG.2.2.23123.04641). 8687

HG942 [165] Henry Garrett, “SuperHyperDominating and SuperHyperResolving on Neutrosophic Super- 8688
HyperGraphs And Their Directions in Game Theory and Neutrosophic SuperHyperClasses”, 8689
Preprints 2022, 2022110576 (doi: 10.20944/preprints202211.0576.v1). 8690

HG94 [166] Henry Garrett, “SuperHyperDominating and SuperHyperResolving on Neutrosophic Super- 8691
HyperGraphs And Their Directions in Game Theory and Neutrosophic SuperHyperClasses”, 8692
ResearchGate 2022 (doi: 10.13140/RG.2.2.23324.56966). 8693

HG37 [167] Henry Garrett, “Basic Neutrosophic Notions Concerning SuperHyperDominating and 8694

Neutrosophic SuperHyperResolving in SuperHyperGraph”, ResearchGate 2022 (doi: 8695

10.13140/RG.2.2.29173.86244). 8696

HG38 [168] Henry Garrett, “Initial Material of Neutrosophic Preliminaries to Study Some Neutro- 8697
sophic Notions Based on Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic Super- 8698

HyperGraph (NSHG)”, ResearchGate 2022 (doi: 10.13140/RG.2.2.25385.88160). 8699

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

HG155b [169] Henry Garrett, “Hamiltonian-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 8700
2023 (doi: 10.5281/zenodo.7804449). 8701

HG154b [170] Henry Garrett, “Hamiltonian-Cycle-Decomposition In SuperHyperGraphs”. Dr. Henry 8702

Garrett, 2023 (doi: 10.5281/zenodo.7793875). 8703

HG153b [171] Henry Garrett, “Hamiltonian-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 8704
(doi: 10.5281/zenodo.7792307). 8705

HG152b [172] Henry Garrett, “Hamiltonian-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 8706
(doi: 10.5281/zenodo.7790728). 8707

HG151b [173] Henry Garrett, “Hamiltonian-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 8708
2023 (doi: 10.5281/zenodo.7787712). 8709

HG150b [174] Henry Garrett, “Hamiltonian-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 8710
10.5281/zenodo.7783791). 8711

HG149b [175] Henry Garrett, “Trace-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 8712
10.5281/zenodo.7780123). 8713

HG148b [176] Henry Garrett, “Trace-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 8714
(doi: 10.5281/zenodo.7773119). 8715

HG147b [177] Henry Garrett, “SuperHyperDuality”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8716

odo.7637762). 8717

HG146b [178] Henry Garrett, “Trace-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 8718
10.5281/zenodo.7766174). 8719

HG145b [179] Henry Garrett, “Edge-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 8720
10.5281/zenodo.7762232). 8721

HG144b [180] Henry Garrett, “Edge-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 8722

(doi: 10.5281/zenodo.7758601). 8723

HG143b [181] Henry Garrett, “Edge-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 8724
10.5281/zenodo.7754661). 8725

HG142b [182] Henry Garrett, “Vertex-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 8726
10.5281/zenodo.7750995) . 8727

HG141b [183] Henry Garrett, “Vertex-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 8728

(doi: 10.5281/zenodo.7749875). 8729

HG140b [184] Henry Garrett, “Vertex-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 8730
10.5281/zenodo.7747236). 8731

HG139b [185] Henry Garrett, “Stable-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 8732
10.5281/zenodo.7742587). 8733

HG138b [186] Henry Garrett, “Stable-Decompositions In SuperHyperGraphs”. Dr. Henry Garrett, 2023 8734

(doi: 10.5281/zenodo.7738635). 8735

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

HG137b [187] Henry Garrett, “Stable-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 8736
10.5281/zenodo.7734719). 8737

HG136b [188] Henry Garrett, “Clique-Neighbors In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 8738
10.5281/zenodo.7730484). 8739

HG135b [189] Henry Garrett, “Clique-Decompositions In SuperHyperGraphs”. Dr. Henry Garrett, 2023 8740
(doi: 10.5281/zenodo.7730469). 8741

HG134b [190] Henry Garrett, “Clique-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 8742
10.5281/zenodo.7722865). 8743

HG133b [191] Henry Garrett, “Space In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8744
odo.7713563). 8745

HG132b [192] Henry Garrett, “Space In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8746
odo.7709116). 8747

HG131b [193] Henry Garrett, “Edge-Connectivity In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 8748
10.5281/zenodo.7706415). 8749

HG130b [194] Henry Garrett, “Vertex-Connectivity In SuperHyperGraphs”. Dr. Henry Garrett, 2023 8750
(doi: 10.5281/zenodo.7706063). 8751

HG129b [195] Henry Garrett, “Tree-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 8752

(doi: 10.5281/zenodo.7701906). 8753

HG128b [196] Henry Garrett, “Chord In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8754
odo.7700205). 8755

HG127b [197] Henry Garrett, “(i,j)-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 8756
10.5281/zenodo.7694876). 8757

HG126b [198] Henry Garrett, “Edge-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 8758

10.5281/zenodo.7679410). 8759

HG125b [199] Henry Garrett, “K-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 8760
10.5281/zenodo.7675982). 8761

HG124b [200] Henry Garrett, “K-Number In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 8762
10.5281/zenodo.7672388). 8763

HG123b [201] Henry Garrett, “Order In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8764

odo.7668648). 8765

HG122b [202] Henry Garrett, “Coloring In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 8766
10.5281/zenodo.7662810). 8767

HG121b [203] Henry Garrett, “Dimension In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 8768
10.5281/zenodo.7659162). 8769

HG120b [204] Henry Garrett, “Cancer In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 8770

10.5281/zenodo.7653233). 8771

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

HG119b [205] Henry Garrett, “SuperHyperWheel”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8772
odo.7653204). 8773

HG118b [206] Henry Garrett, “SuperHyperMultipartite”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8774
odo.7653142). 8775

HG117b [207] Henry Garrett, “SuperHyperBipartite”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8776
odo.7653117). 8777

HG116b [208] Henry Garrett, “SuperHyperStar”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8778
odo.7653089). 8779

HG115b [209] Henry Garrett, “SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8780
odo.7651687). 8781

HG114b [210] Henry Garrett, “SuperHyperPath”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8782
odo.7651619). 8783

HG113b [211] Henry Garrett, “SuperHyperDomination”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8784
odo.7651439). 8785

HG112b [212] Henry Garrett, “SuperHyperDominating”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8786
odo.7650729). 8787

HG111b [213] Henry Garrett, “SuperHyperConnected”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8788

odo.7647868). 8789

HG110b [214] Henry Garrett, “SuperHyperTotal”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8790
odo.7647017). 8791

HG109b [215] Henry Garrett, “SuperHyperPerfect”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8792
odo.7644894). 8793

HG108b [216] Henry Garrett, “SuperHyperJoin”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8794

odo.7641880). 8795

HG107b [217] Henry Garrett, “Path SuperHyperColoring”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8796
odo.7632923). 8797

HG106b [218] Henry Garrett, “SuperHyperDensity”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8798
odo.7623459). 8799

HG105b [219] Henry Garrett, “Neutrosophic SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 8800

10.5281/zenodo.7606416). 8801

HG104b [220] Henry Garrett, “Extreme SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 8802
10.5281/zenodo.7606416). 8803

HG103b [221] Henry Garrett, “SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8804
odo.7606404). 8805

HG102b [222] Henry Garrett, “Neutrosophic SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 8806

10.5281/zenodo.7580018). 8807

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

HG101b [223] Henry Garrett, “Extreme SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8808
odo.7580018). 8809

HG100b [224] Henry Garrett, “Extreme SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8810
odo.7580018). 8811

HG99b [225] Henry Garrett, “SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8812
odo.7579929). 8813

HG98b [226] Henry Garrett, “Neutrosophic SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 8814
10.5281/zenodo.7563170). 8815

HG97b [227] Henry Garrett, “Extreme SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8816
odo.7563164). 8817

HG96b [228] Henry Garrett, “SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8818
odo.7563160). 8819

HG95b [229] Henry Garrett, “Extreme SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8820
odo.7563160). 8821

HG94b [230] Henry Garrett, “Overlook On SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 8822
10.5281/zenodo.7563160). 8823

HG93b [231] Henry Garrett, “Neutrosophic SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 8824

10.5281/zenodo.7557063). 8825

HG92b [232] Henry Garrett, “Extreme SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 8826
10.5281/zenodo.7557009). 8827

HG91b [233] Henry Garrett, “Overlook On SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 8828
10.5281/zenodo.7539484). 8829

HG90b [234] Henry Garrett, “Neutrosophic Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 8830

10.5281/zenodo.7523390). 8831

HG89b [235] Henry Garrett, “Extreme Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 8832
10.5281/zenodo.7523390). 8833

HG88b [236] Henry Garrett, “Overlook On Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 8834
10.5281/zenodo.7523390). 8835

HG87b [237] Henry Garrett, “Extreme SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8836

odo.7574952). 8837

HG86b [238] Henry Garrett, “Neutrosophic SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 8838
10.5281/zenodo.7574992). 8839

HG85b [239] Henry Garrett, “Extreme SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8840
odo.7523357). 8841

HG84b [240] Henry Garrett, “Overlook On SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 8842

10.5281/zenodo.7523357). 8843

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

HG83b [241] Henry Garrett, “Neutrosophic Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 8844
10.5281/zenodo.7504782). 8845

HG82b [242] Henry Garrett, “Extreme Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 8846
10.5281/zenodo.7504782). 8847

HG81b [243] Henry Garrett, “Overlook On Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 8848
10.5281/zenodo.7504782). 8849

HG80b [244] Henry Garrett, “Neutrosophic SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 8850
10.5281/zenodo.7499395). 8851

HG79b [245] Henry Garrett, “Extreme SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8852
odo.7499395). 8853

HG78b [246] Henry Garrett, “Overlook On SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 8854
10.5281/zenodo.7499395). 8855

HG77b [247] Henry Garrett, “Neutrosophic Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 8856
10.5281/zenodo.7497450). 8857

HG76b [248] Henry Garrett, “Extreme Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 8858
10.5281/zenodo.7497450). 8859

HG75b [249] Henry Garrett, “Neutrosophic SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 8860

10.5281/zenodo.7494862). 8861

HG74b [250] Henry Garrett, “Extreme SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8862
odo.7494862). 8863

HG73b [251] Henry Garrett, “Overlook On SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 8864
10.5281/zenodo.7494862). 8865

HG72b [252] Henry Garrett, “Neutrosophic SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 8866

10.5281/zenodo.7493845). 8867

HG71b [253] Henry Garrett, “Extreme SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 8868
10.5281/zenodo.7493845). 8869

HG70b [254] Henry Garrett, “Overlook On SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 8870
10.5281/zenodo.7493845). 8871

HG69b [255] Henry Garrett, “SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8872

odo.7539484). 8873

HG68b [256] Henry Garrett, “Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8874
odo.7523390). 8875

HG67b [257] Henry Garrett, “SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8876
odo.7523357). 8877

HG66b [258] Henry Garrett, “Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8878

odo.7504782). 8879

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

HG65b [259] Henry Garrett, “SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8880
odo.7499395). 8881

HG64b [260] Henry Garrett, “Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8882
odo.7497450). 8883

HG63b [261] Henry Garrett, “SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8884
odo.7494862). 8885

HG62b [262] Henry Garrett, “SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8886

odo.7493845). 8887

HG61b [263] Henry Garrett, “SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8888
odo.7480110). 8889

HG60b [264] Henry Garrett, “Neut. SuperHyperEdges”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8890
odo.7378758). 8891

HG32b [265] Henry Garrett, “Beyond Neutrosophic Graphs”. Dr. Henry Garrett, 2023 (doi: 8892
10.5281/zenodo.6320305). 8893

HG44b [266] Henry Garrett, “Neutrosophic Duality”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8894
odo.6677173). 8895

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 CHAPTER 44 8896

Books’ Contributions 8897

“Books’ Contributions”: | Featured Threads 8898

The following references are cited by chapters. 8899

8900
[Ref231] 8901
Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Type-Cycle- 8902
Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 8903
10.5281/zenodo.7804218). 8904
8905

[Ref232] 8906
Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph 8907
By Hamiltonian-Type-Cycle-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi: 8908
10.5281/zenodo.7799902). 8909
8910
The links to the contributions of this scientific research book are listed below. 8911

[HG231 8912
Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Type-Cycle- 8913
Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 8914
10.5281/zenodo.7804218). 8915
8916
[TITLE] “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Type-Cycle- 8917

Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph” 8918

8919
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ResearchGate”] 8920
https://www.researchgate.net/publication/369825403 8921
8922
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “Scribd”:] 8923

https://www.scribd.com/document/636440183 8924
8925
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ZENODO_ORG”:] 8926
https://zenodo.org/record/7804218 8927
8928
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “academia”:] 8929

https://www.academia.edu/99744710 8930

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

Figure 44.1: Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-
Type-Cycle-Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo
2023, (doi: 10.5281/zenodo.7804218).

8931
[ADDRESSED CITATION] 8932
Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Type-Cycle- 8933
Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 8934
10.5281/zenodo.7804218). 8935
[ASSIGNED NUMBER] #231 Article 8936

[DATE] April 2023 8937

[DOI] 10.5281/zenodo.7804218 8938
[LICENSE] CC BY-NC-ND 4.0 8939
[PROJECT] Neutrosophic SuperHyperGraphs and SuperHyperGraphs 8940
[AVAILABLE AT TWITTER’S IDS] WordPress ResearchGate Scribd academia ZEN- 8941
ODO_ORG Twitter facebook LinkedIn Amazon googlebooks GooglePlay 8942

8943
[HG232] 8944
Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph 8945
By Hamiltonian-Type-Cycle-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi: 8946
10.5281/zenodo.7799902). 8947
8948

[TITLE] “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph By 8949

Hamiltonian-Type-Cycle-Cut As Hyper Hamper On Super Hammy” 8950
8951
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ResearchGate”] 8952
https://www.researchgate.net/publication/369787658 8953
8954

[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “Scribd”:] 8955

Henry Garrett · 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 44.2: Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-
Type-Cycle-Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo
2023, (doi: 10.5281/zenodo.7804218).

Figure 44.3: Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-
Type-Cycle-Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo
2023, (doi: 10.5281/zenodo.7804218).

Henry Garrett · 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 44.4: Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic
SuperHyperGraph By Hamiltonian-Type-Cycle-Cut As Hyper Hamper On Super Hammy”,
Zenodo 2023, (doi: 10.5281/zenodo.7799902).

https://www.scribd.com/document/636114181 8956
8957
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ZENODO_ORG”:] 8958
https://zenodo.org/record/7799902 8959
8960
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “academia”:] 8961

https://www.academia.edu/99665864 8962
8963
[ADDRESSED CITATION] 8964
Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph 8965
By Hamiltonian-Type-Cycle-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi: 8966
10.5281/zenodo.7799902). 8967

[ASSIGNED NUMBER] #232 Article 8968

[DATE] April 2023 8969
[DOI] 10.5281/zenodo.7799902 8970
[LICENSE] CC BY-NC-ND 4.0 8971
[PROJECT] Neutrosophic SuperHyperGraphs and SuperHyperGraphs 8972
[AVAILABLE AT TWITTER’S IDS] 8973

WordPress ResearchGate Scribd academia ZENODO_ORG Twitter facebook LinkedIn Amazon 8974
googlebooks GooglePlay 8975
8976
[ASSIGNED NUMBER] | Book #156 8977
[ADDRESSED CITATION] 8978
Henry Garrett, “Hamiltonian-Type-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 8979

(doi: 10.5281/zenodo.7807782). 8980

Henry Garrett · 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 44.5: Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic
SuperHyperGraph By Hamiltonian-Type-Cycle-Cut As Hyper Hamper On Super Hammy”,
Zenodo 2023, (doi: 10.5281/zenodo.7799902).

Figure 44.6: Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic
SuperHyperGraph By Hamiltonian-Type-Cycle-Cut As Hyper Hamper On Super Hammy”,
Zenodo 2023, (doi: 10.5281/zenodo.7799902).

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

[TITLE] Hamiltonian-Type-Cycle-Cut In SuperHyperGraphs 8981

#Latest_Updates 8982
#The_Links 8983
[AVAILABLE AT TWITTER’S IDS] 8984
WordPress ResearchGate Scribd academia ZENODO_ORG Twitter facebook LinkedIn Amazon 8985
googlebooks GooglePlay 8986

8987
#Latest_Updates 8988
8989
#The_Links 8990
8991

[ASSIGNED NUMBER] | Book #156 8992

8993
[TITLE] Hamiltonian-Type-Cycle-Cut In SuperHyperGraphs 8994
8995
[AVAILABLE AT TWITTER’S IDS] 8996
WordPress ResearchGate Scribd academia ZENODO_ORG Twitter facebook LinkedIn Amazon 8997
googlebooks GooglePlay 8998

8999
– 9000
9001
[PUBLISHER] 9002
(Paperback): https://www.amazon.com/dp/- 9003

(Hardcover): https://www.amazon.com/dp/- 9004

(Kindle Edition): https://www.amazon.com/dp/- 9005
9006
– 9007
9008
[ISBN] 9009

(Paperback): - 9010
(Hardcover): - 9011
(Kindle Edition): CC BY-NC-ND 4.0 9012
(EBook): CC BY-NC-ND 4.0 9013
9014
– 9015

9016
[PRINT LENGTH] 9017
(Paperback): - pages 9018
(Hardcover): - pages 9019
(Kindle Edition): - pages 9020
(E-Book): - pages 9021

9022
– 9023
9024
#Latest_Updates 9025
9026

Henry Garrett · 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_Links 9027
9028
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ResearchGate”] 9029
https://www.researchgate.net/publication/- 9030
9031
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “WordPress”] 9032

https://drhenrygarrett.wordpress.com/2023/04/22/ 9033
Hamiltonian-Type-Cycle-Cut-In-SuperHyperGraphs/ 9034
9035
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “Scribd”] 9036
https://www.scribd.com/document/- 9037

9038
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “academia”] 9039
https://www.academia.edu/- 9040
9041
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ZENODO_ORG”] 9042
https://zenodo.org/record/- 9043

9044
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “googlebooks”] 9045
https://books.google.com/books/about?id=- 9046
9047
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “GooglePlay”] 9048
https://play.google.com/store/books/details?id=- 9049

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

[TITLE] Hamiltonian-Type-Cycle-Cut In SuperHyperGraphs (Published Version) 9050

9051
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “WordPress”] 9052
9053
https://drhenrygarrett.wordpress.com/2023/04/22/ 9054
Hamiltonian-Type-Cycle-Cut-In-SuperHyperGraphs/ 9055

9056
– 9057
9058
[POSTED BY] Dr. Henry Garrett 9059
9060

[DATE] April 007, 2023 9061

9062
[POSTED IN] 156 | Hamiltonian-Type-Cycle-Cut In SuperHyperGraphs 9063
9064
[TAGS] 9065
Applications, Applied Mathematics, Applied Research, Cancer, Cancer’s Recognitions, Combin- 9066
atorics, Edge, Edges, Graph Theory, Graphs, Latest Research, Literature Reviews, Modeling, 9067

Neutrosophic Graph, Neutrosophic Graph Theory, Neutrosophic Science, Neutrosophic Su- 9068
perHyperClasses, Neutrosophic SuperHyperGraph, Neutrosophic SuperHyperGraph Theory, 9069
neutrosophic SuperHyperGraphs, Neutrosophic Hamiltonian-Type-Cycle-Cut In SuperHyper- 9070
Graphs, Open Problems, Open Questions, Problems, Pure Math, Pure Mathematics, Questions, 9071
Real-World Applications, Recent Research, Recognitions, Research, scientific research Article, 9072
scientific research Articles, scientific research Book, scientific research Chapter, scientific 9073

research Chapters, Review, SuperHyperClasses, SuperHyperEdges, SuperHyperGraph, Super- 9074

HyperGraph Theory, SuperHyperGraphs, Hamiltonian-Type-Cycle-Cut In SuperHyperGraphs, 9075
SuperHyperModeling, SuperHyperVertices, Theoretical Research, Vertex, Vertices. 9076
In this scientific research book, there are some scientific research chapters on “Extreme 9077
Hamiltonian-Type-Cycle-Cut In SuperHyperGraphs” and “Neutrosophic Hamiltonian-Type- 9078
Cycle-Cut In SuperHyperGraphs” about some scientific research on Hamiltonian-Type-Cycle-Cut 9079

In SuperHyperGraphs by two (Extreme/Neutrosophic) notions, namely, Extreme Hamiltonian- 9080

Type-Cycle-Cut In SuperHyperGraphs and Neutrosophic Hamiltonian-Type-Cycle-Cut In Su- 9081
perHyperGraphs. With scientific research on the basic scientific research properties, the 9082
scientific research book starts to make Extreme Hamiltonian-Type-Cycle-Cut In SuperHyper- 9083
Graphs theory and Neutrosophic Hamiltonian-Type-Cycle-Cut In SuperHyperGraphs theory more 9084

(Extremely/Neutrosophicly) understandable. 9085

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 CHAPTER 45 9086

“SuperHyperGraph-Based Books”: | 9087

Featured Tweets 9088

“SuperHyperGraph-Based Books”: | Featured Tweets 9089

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

Figure 45.1: “SuperHyperGraph-Based Books”: | Featured Tweets

Henry Garrett · 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 45.2: “SuperHyperGraph-Based Books”: | Featured Tweets

Henry Garrett · 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 45.3: “SuperHyperGraph-Based Books”: | Featured Tweets #69

Henry Garrett · 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 45.4: “SuperHyperGraph-Based Books”: | Featured Tweets #69

Henry Garrett · 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 45.5: “SuperHyperGraph-Based Books”: | Featured Tweets #69

Henry Garrett · 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 45.6: “SuperHyperGraph-Based Books”: | Featured Tweets #68

Henry Garrett · 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 45.7: “SuperHyperGraph-Based Books”: | Featured Tweets #68

Henry Garrett · 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 45.8: “SuperHyperGraph-Based Books”: | Featured Tweets #68

Henry Garrett · 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 45.9: “SuperHyperGraph-Based Books”: | Featured Tweets #68

Figure 45.10: “SuperHyperGraph-Based Books”: | Featured Tweets #67

Henry Garrett · 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 45.11: “SuperHyperGraph-Based Books”: | Featured Tweets #67

Henry Garrett · 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 45.12: “SuperHyperGraph-Based Books”: | Featured Tweets #67

Henry Garrett · 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 45.13: “SuperHyperGraph-Based Books”: | Featured Tweets #67

Figure 45.14: “SuperHyperGraph-Based Books”: | Featured Tweets #66

Henry Garrett · 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 45.15: “SuperHyperGraph-Based Books”: | Featured Tweets #66

Henry Garrett · 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 45.16: “SuperHyperGraph-Based Books”: | Featured Tweets #66

Henry Garrett · 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 45.17: “SuperHyperGraph-Based Books”: | Featured Tweets #66

Figure 45.18: “SuperHyperGraph-Based Books”: | Featured Tweets #66

Henry Garrett · 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 45.19: “SuperHyperGraph-Based Books”: | Featured Tweets #65

Henry Garrett · 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 45.20: “SuperHyperGraph-Based Books”: | Featured Tweets #65

Henry Garrett · 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 45.21: “SuperHyperGraph-Based Books”: | Featured Tweets #65

Henry Garrett · 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 45.22: “SuperHyperGraph-Based Books”: | Featured Tweets #65

Henry Garrett · 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 45.23: “SuperHyperGraph-Based Books”: | Featured Tweets #65

Henry Garrett · 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 45.24: “SuperHyperGraph-Based Books”: | Featured Tweets #65

Henry Garrett · 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 45.25: “SuperHyperGraph-Based Books”: | Featured Tweets #64

Henry Garrett · 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 45.26: “SuperHyperGraph-Based Books”: | Featured Tweets #63

Henry Garrett · 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 45.27: “SuperHyperGraph-Based Books”: | Featured Tweets #62

Henry Garrett · 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 45.28: “SuperHyperGraph-Based Books”: | Featured Tweets #61

Henry Garrett · 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 45.29: “SuperHyperGraph-Based Books”: | Featured Tweets #60

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
CHAPTER 46 9090

CV 9091

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

Henry Garrett CV
Status: Known As Henry Garrett With Highly Productive Style.

Fields: Combinatorics, Algebraic Structures, Algebraic Hyperstructures, Fuzzy

Logic

Prefers: Graph Theory, Domination, Metric Dimension, Neutrosophic Graph

Theory, Neutrosophic Domination, Lattice Theory, Groups and
Hypergroups

Activities: Traveling, Painting, Writing, Reading books and Papers

Professional Experiences

2017 - Present Continuous Member AMS

I tried to show them that Science is not only interesting, it’s beautiful and exciting.
Participating in the academic space of the largest mathematical Society gave me valuable
experiences. The use of Bulletin and Notice of the American Mathematical Society is another
benefit of this presence.

2017 - 2019 Continuous Member EMS

The use Newsletter of the European Mathematical Society is benefit of this membership.
I am interested in giving a small, though small, effect on math epidemic progress

Awards and Achievements

Dec 2022 Award: Selected as a Reviewer @SciencePG

Award: Selected as Reviewer to Journal of American Journal of Computer

Science and Technology, Science Publishing Group, USA, @SciencePG:
https://www.sciencepublishinggroup.com/journal/index?journalid=303
American Journal of Computer Science and Technology, Science Publishing Group, USA,
@SciencePG: https://www.sciencepublishinggroup.com/journal/index?journalid=303; PDF:
https://drhenrygarrett.files.wordpress.com/2023/02/certificate_for_reviewer-2.pdf

Sep 2022 Award: Selected as an Editorial Board Member to JMTCM JMTCM

Award: Selected as an Editorial Board Member to Journal of Mathematical Techniques and

Computational Mathematics(JMTCM)
Journal of Mathematical Techniques and Computational Mathematics(JMTCM)

Jun 2022 Award: Selected as an Editorial Board Member to JCTCSR JCTCSR

Award: Selected as an Editorial Board Member to Journal of Current Trends in Computer

Science Research(JCTCSR)
Journal of Current Trends in Computer Science Research(JCTCSR)

Jan 23, 2022 Award: Diploma By Neutrosophic Science International Association Neutrosophic Science International

Association

Award: Distinguished Achievements

Honorary Membership; PDF: https://drhenrygarrett.files.wordpress.com/2023/02/neutrosophicdiploma-
henry-garrett.pdf

Journal Referee

Sep 2022 Editorial Board Member to JMTCM JMTCM

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

Editorial Board Member to Journal of Mathematical Techniques and Computational

Mathematics(JMTCM)
Journal of Mathematical Techniques and Computational Mathematics(JMTCM)

Jun 2022 Editorial Board Member to JCTCSR JCTCSR

Editorial Board Member to Journal of Current Trends in Computer Science

Research(JCTCSR)
Journal of Current Trends in Computer Science Research(JCTCSR)
 9094
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett @gmail.com · Manhattan, NY, USA

Publications: Articles

2023 213 Manuscript

Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph

By Trace-Cut As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi:
10.13140/RG.2.2.20913.25446).

@ResearchGate: https://www.researchgate.net/publication/369456588
@Scribd: https://www.scribd.com/document/633165164
@ZENODO_ORG: https://zenodo.org/record/7763661
@academia: https://www.academia.edu/98987491

2023 212 Manuscript

Henry Garrett, “New Ideas On Super Tract By Hyper Track Of Trace-Cut

In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi:
10.5281/zenodo.7764916).

@ResearchGate: https://www.researchgate.net/publication/369475240
@Scribd: https://www.scribd.com/document/-
@ZENODO_ORG: https://zenodo.org/record/7764916
@academia: https://www.academia.edu/99003070

2023 211 Manuscript

Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph

By Edge-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi:
10.13140/RG.2.2.11770.98247).

@ResearchGate: https://www.researchgate.net/publication/369422667
@Scribd: https://www.scribd.com/document/-
@ZENODO_ORG: https://zenodo.org/record/7760212
@academia: https://www.academia.edu/98943519

2023 210 Manuscript

Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Edge-Neighbor

In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi:
10.13140/RG.2.2.12400.12808).

@ResearchGate: https://www.researchgate.net/publication/369440337
@Scribd: https://www.scribd.com/document/-
@ZENODO_ORG: https://zenodo.org/record/7761479
@academia: https://www.academia.edu/98956543

2023 209 Manuscript

Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph By

Edge-Decomposition As Hyper Decompress On Super Decompensation”, ResearchGate 2023,
(doi: 10.13140/RG.2.2.22545.10089).

@ResearchGate: https://www.researchgate.net/publication/369385213
@Scribd: https://www.scribd.com/document/632697126
@ZENODO_ORG: https://zenodo.org/record/7756528
@academia: https://www.academia.edu/98896282

2023 208 Manuscript

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

Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of

Edge-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”,
ResearchGate 2023, (doi: 10.13140/RG.2.2.29544.34564).

@ResearchGate: https://www.researchgate.net/publication/369402546
@Scribd: https://www.scribd.com/document/632779196
@ZENODO_ORG: https://zenodo.org/record/7757802
@academia: https://www.academia.edu/98911823

2023 207 Manuscript

Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of

Edge-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”,
ResearchGate 2023, (doi: 10.13140/RG.2.2.29544.34564).

@ResearchGate: https://www.researchgate.net/publication/369402546
@Scribd: https://www.scribd.com/document/632779196
@ZENODO_ORG: https://zenodo.org/record/7757802
@academia: https://www.academia.edu/98911823

2023 207 Manuscript

Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic

SuperHyperGraph By Edge-Cut As Hyper Edify On Super Eddy”, ResearchGate 2023,
(doi: 10.13140/RG.2.2.11377.76644).

@ResearchGate: https://www.researchgate.net/publication/369374430
@Scribd: https://www.scribd.com/document/-
@ZENODO_ORG: https://zenodo.org/record/7752592
@academia: https://www.academia.edu/98839726

2023 206 Manuscript

Henry Garrett, “New Ideas On Super Eddy By Hyper Edify Of Edge-Cut In

Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi:
10.13140/RG.2.2.23750.96329).

@ResearchGate: https://www.researchgate.net/publication/369374477
@Scribd: https://www.scribd.com/document/-
@ZENODO_ORG: https://zenodo.org/record/7752721
@academia: https://www.academia.edu/98842223

2023 205 Manuscript

Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph

By Vertex-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi:
10.13140/RG.2.2.31366.24641).

@ResearchGate: https://www.researchgate.net/publication/369365026
@Scribd: https://www.scribd.com/document/-
@ZENODO_ORG: https://zenodo.org/record/7750194
@academia: https://www.academia.edu/98781256

2023 204 Manuscript

 9096
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett @gmail.com · Manhattan, NY, USA
Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Vertex-Neighbor
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi:
10.13140/RG.2.2.34721.68960).

@ResearchGate: https://www.researchgate.net/publication/369365539
@Scribd: https://www.scribd.com/document/-
@ZENODO_ORG: https://zenodo.org/record/7750225
@academia: https://www.academia.edu/98782337

2023 203 Manuscript

Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph

By Vertex-Decomposition As Hyper Decompress On Super Decompensation”, ResearchGate
2023, (doi: 10.13140/RG.2.2.30212.81289).

@ResearchGate: https://www.researchgate.net/publication/369335397
@Scribd: https://www.scribd.com/document/-
@ZENODO_ORG: https://zenodo.org/record/7748755
@academia: https://www.academia.edu/98734865

2023 202 Manuscript

Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of

Vertex-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”,
ResearchGate 2023, (doi: 10.13140/RG.2.2.18468.76169).

@ResearchGate: https://www.researchgate.net/publication/369340345
@Scribd: https://www.scribd.com/document/-
@ZENODO_ORG: https://zenodo.org/record/7748817
@academia: https://www.academia.edu/98735229

2023 201 Manuscript

Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph

By Vertex-Cut As Hyper Vertu On Super Vertigo”, ResearchGate 2023, (doi:
10.13140/RG.2.2.24288.35842).

@ResearchGate: https://www.researchgate.net/publication/369322064
@Scribd: https://www.scribd.com/document/-
@ZENODO_ORG: https://zenodo.org/record/7745834
@academia: https://www.academia.edu/98688581

2023 200 Manuscript

Henry Garrett, “New Ideas On Super Vertigo By Hyper Vertu Of Vertex-Cut In

Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi:
10.13140/RG.2.2.32467.25124).

@ResearchGate: https://www.researchgate.net/publication/369327937
@Scribd: https://www.scribd.com/document/-
@ZENODO_ORG: https://zenodo.org/record/7747096
@academia: https://www.academia.edu/98705974

2023 199 Manuscript

 9097
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett @gmail.com · Manhattan, NY, USA
Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph
By Stable-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi:
10.13140/RG.2.2.31025.45925).

@ResearchGate: https://www.researchgate.net/publication/369274134
@Scribd: https://www.scribd.com/document/631665626
@ZENODO_ORG: https://zenodo.org/record/7741133
@academia: https://www.academia.edu/98631043

2023 198 Manuscript

Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of Stable-Neighbor

In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi:
10.13140/RG.2.2.17184.25602).

@ResearchGate: https://www.researchgate.net/publication/369284173
@Scribd: https://www.scribd.com/document/631671733
@ZENODO_ORG: https://zenodo.org/record/7741293
@academia: https://www.academia.edu/98634171

2023 197 Manuscript

Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph

By Stable-Decompositions As Hyper Stain On Super Stagy”, ResearchGate 2023, (doi:
10.13140/RG.2.2.23423.28327).

@ResearchGate: https://www.researchgate.net/publication/369245279
@Scribd: https://www.scribd.com/document/631523400
@ZENODO_ORG: https://zenodo.org/record/7737369
@academia: https://www.academia.edu/98568607

2023 196 Manuscript

Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Decompositions

In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi:
10.13140/RG.2.2.28456.44805).

@ResearchGate: https://www.researchgate.net/publication/369245643
@Scribd: https://www.scribd.com/document/631525857
@ZENODO_ORG: https://zenodo.org/record/7737444
@academia: https://www.academia.edu/98569557

2023 195 Manuscript

Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph

By Stable-Cut As Hyper Stain On Super Stagy”, ResearchGate 2023, (doi:
10.13140/RG.2.2.23525.68320).

@ResearchGate: https://www.researchgate.net/publication/369211168
@Scribd: https://www.scribd.com/document/631425638
@ZENODO_ORG: https://zenodo.org/record/7734654
@academia: https://www.academia.edu/98524882

2023 194 Manuscript

 9098
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett @gmail.com · Manhattan, NY, USA
Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Cut In
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi:
10.13140/RG.2.2.20170.24000).

@ResearchGate: https://www.researchgate.net/publication/369214553
@Scribd: https://www.scribd.com/document/631425179
@ZENODO_ORG: https://zenodo.org/record/7734645
@academia: https://www.academia.edu/98524637

2023 193 Manuscript

Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph

By Clique-Neighbors As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi:
10.13140/RG.2.2.36475.59683).

@ResearchGate: https://www.researchgate.net/publication/369196398
@Scribd: https://www.scribd.com/document/-
@ZENODO_ORG: https://zenodo.org/record/7730378
@academia: https://www.academia.edu/98458444

2023 192 Manuscript

Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of Clique-Neighbors

In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi:
10.13140/RG.2.2.29764.71046).

@ResearchGate: https://www.researchgate.net/publication/369196478
@Scribd: https://www.scribd.com/document/-
@ZENODO_ORG: https://zenodo.org/record/7730148
@academia: https://www.academia.edu/98458038

2023 191 Manuscript

Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph

By Clique-Decompositions As Hyper Decompile On Super Decommission”, ResearchGate 2023,
(doi: 10.13140/RG.2.2.18780.87683).

@ResearchGate: https://www.researchgate.net/publication/369187021
@Scribd: https://www.scribd.com/document/-
@ZENODO_ORG: https://zenodo.org/record/7728608
@academia: https://www.academia.edu/98437657

2023 190 Manuscript

Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of

Clique-Decompositions In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”,
ResearchGate 2023, (doi: 10.13140/RG.2.2.27169.48487).

@ResearchGate: https://www.researchgate.net/publication/369186444
@Scribd: https://www.scribd.com/document/630547839
@ZENODO_ORG: https://zenodo.org/record/7728571
@academia: https://www.academia.edu/98437046

2023 189 Manuscript

 9099
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett @gmail.com · Manhattan, NY, USA
Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph
By Clique-Cut As Hyper Click On Super Cliche”, ResearchGate 2023, (doi:
10.13140/RG.2.2.26134.01603).

@ResearchGate: https://www.researchgate.net/publication/369147477
@Scribd: https://www.scribd.com/document/630547839
@ZENODO_ORG: https://zenodo.org/record/7722788
@academia: https://www.academia.edu/98323588

2023 188 Manuscript

Henry Garrett, “New Ideas On Super Cliff By Hyper Cling Of Clique-Cut In

Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi:
10.13140/RG.2.2.27392.30721).

@ResearchGate: https://www.researchgate.net/publication/369151536
@Scribd: https://www.scribd.com/document/630547839
@ZENODO_ORG: https://zenodo.org/record/7722833
@academia: https://www.academia.edu/98324424

2023 187 Manuscript

Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic

SuperHyperGraph By Space As Hyper Spin On Super Spacy”, ResearchGate 2023, (doi:
10.13140/RG.2.2.33028.40321).

@ResearchGate: https://www.researchgate.net/publication/369118224
@Scribd: https://www.scribd.com/document/630547839
@ZENODO_ORG: https://zenodo.org/record/7714718
@academia: https://www.academia.edu/98256482

2023 186 Manuscript

Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph

By List-Coloring As Hyper List On Super Lisle”, ResearchGate 2023, (doi:
10.13140/RG.2.2.21389.20966).

@ResearchGate: https://www.researchgate.net/publication/369111929
@Scribd: https://www.scribd.com/document/630424177
@ZENODO_ORG: https://zenodo.org/record/7713262
@academia: https://www.academia.edu/98228831

2023 185 Manuscript

Henry Garrett, “New Ideas On Super Lith By Hyper Lite Of List-Coloring In

Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi:
10.13140/RG.2.2.16356.04489).

@ResearchGate: https://www.researchgate.net/publication/369113233
@Scribd: https://www.scribd.com/document/630429081
@ZENODO_ORG: https://zenodo.org/record/7713362
@academia: https://www.academia.edu/98230329

2023 184 Manuscript

 9100
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett @gmail.com · Manhattan, NY, USA
Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic
SuperHyperGraph By Space As Hyper Sparse On Super Spark”, ResearchGate 2023,
(doi: 10.13140/RG.2.2.21756.21129).

@ResearchGate: https://www.researchgate.net/publication/369086888
@Scribd: https://www.scribd.com/document/-
@ZENODO_ORG: https://zenodo.org/record/7708851
@academia: https://www.academia.edu/98165095

2023 183 Manuscript

Henry Garrett, “New Ideas On Super Solidarity By Hyper Soul Of Space In

Cancer’s Recognition With (Extreme) SuperHyperGraph”, ResearchGate 2023, (doi:
10.13140/RG.2.2.30983.68009).

@ResearchGate: https://www.researchgate.net/publication/369087468
@Scribd: https://www.scribd.com/document/-
@ZENODO_ORG: https://zenodo.org/record/7709005
@academia: https://www.academia.edu/98167776

2023 182 Manuscript

Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph

By Edge-Connectivity As Hyper Disclosure On Super Closure”, ResearchGate 2023, (doi:
10.13140/RG.2.2.28552.29445).

@ResearchGate: https://www.researchgate.net/publication/369058636
@Scribd: https://www.scribd.com/document/-
@ZENODO_ORG: https://zenodo.org/record/7706177
@academia: https://www.academia.edu/98107686

2023 181 Manuscript

Henry Garrett, “New Ideas On Super Uniform By Hyper Deformation Of Edge-Connectivity

In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi:
10.13140/RG.2.2.10936.21761).

@ResearchGate: https://www.researchgate.net/publication/369059966
@Scribd: https://www.scribd.com/document/-
@ZENODO_ORG: https://zenodo.org/record/7706254
@academia: https://www.academia.edu/98108721

2023 180 Manuscript

Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph

By Vertex-Connectivity As Hyper Leak On Super Structure”, ResearchGate 2023, (doi:
10.13140/RG.2.2.35105.89447).

@ResearchGate: https://www.researchgate.net/publication/369051049
@Scribd: https://www.scribd.com/document/-
@ZENODO_ORG: https://zenodo.org/record/7705887
@academia: https://www.academia.edu/98103871

2023 179 Manuscript

 9101
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett @gmail.com · Manhattan, NY, USA
Henry Garrett, “New Ideas On Super System By Hyper Explosions Of Vertex-Connectivity
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi:
10.13140/RG.2.2.30072.72960).

@ResearchGate: https://www.researchgate.net/publication/369052717
@Scribd: https://www.scribd.com/document/-
@ZENODO_ORG: https://zenodo.org/record/7705951
@academia: https://www.academia.edu/98104801

2023 178 Manuscript

Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph

By Tree-Decomposition As Hyper Forward On Super Returns”, ResearchGate 2023, (doi:
10.13140/RG.2.2.31147.52003).

@ResearchGate: https://www.researchgate.net/publication/369029627
@Scribd: https://www.scribd.com/document/-
@ZENODO_ORG: https://zenodo.org/record/7701758
@academia: https://www.academia.edu/98023078

2023 177 Manuscript

Henry Garrett, “New Ideas On Super Nodes By Hyper Moves Of Tree-Decomposition

In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi:
10.13140/RG.2.2.32825.24163).

@ResearchGate: https://www.researchgate.net/publication/369030046
@Scribd: https://www.scribd.com/document/-
@ZENODO_ORG: https://zenodo.org/record/7701796
@academia: https://www.academia.edu/98024333

2023 176 Manuscript

Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph

By Chord As Hyper Excellence On Super Excess”, ResearchGate 2023, (doi:
10.13140/RG.2.2.13059.58401).

@ResearchGate: https://www.researchgate.net/publication/369019923
@Scribd: https://www.scribd.com/document/629520682
@ZENODO_ORG: https://zenodo.org/record/7699943
@academia: https://www.academia.edu/97971843

2023 175 Manuscript

Henry Garrett, “New Ideas On Super Gap By Hyper Navigations Of Chord In

Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi:
10.13140/RG.2.2.11172.14720).

@ResearchGate: https://www.researchgate.net/publication/369020072
@Scribd: https://www.scribd.com/document/-
@ZENODO_ORG: https://zenodo.org/record/7700125
@academia: https://www.academia.edu/97976111

2023 174 Manuscript

 9102
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett @gmail.com · Manhattan, NY, USA
Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph
By SuperHyper(i,j)-Domination As Hyper Controller On Super Waves”, ResearchGate 2023,
(doi: 10.13140/RG.2.2.22011.80165).

@ResearchGate: https://www.researchgate.net/publication/368922546
@Scribd: https://www.scribd.com/document/628952478
@ZENODO_ORG: https://zenodo.org/record/7692323
@academia: https://www.academia.edu/97805753

2023 173 Manuscript

Henry Garrett, “New Ideas On Super Coincidence By Hyper Routes Of SuperHyper(i,j)-

Domination In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate
2023, (doi: 10.13140/RG.2.2.30819.84003).

@ResearchGate: https://www.researchgate.net/publication/368923375
@Scribd: https://www.scribd.com/document/-
@ZENODO_ORG: https://zenodo.org/record/7692540
@academia: https://www.academia.edu/97808461

2023 172 Manuscript

Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph

By SuperHyperEdge-Domination As Hyper Reversion On Super Indirection”, ResearchGate
2023, (doi: 10.13140/RG.2.2.10493.84962).

@ResearchGate: https://www.researchgate.net/publication/368824400
@Scribd: https://www.scribd.com/document/-
@ZENODO_ORG: https://zenodo.org/record/7679016
@academia: https://www.academia.edu/97569540

2023 171 Manuscript

Henry Garrett, “New Ideas On Super Obstacles By Hyper Model Of SuperHyperEdge-

Domination In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate
2023, (doi: 10.13140/RG.2.2.13849.29280).

@ResearchGate: https://www.researchgate.net/publication/368824505
@Scribd: https://www.scribd.com/document/-
@ZENODO_ORG: https://zenodo.org/record/7679054
@academia: https://www.academia.edu/97569904

2023 170 Manuscript

Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph

By SuperHyperK-Domination As Hyper k-Actions On Super Patterns”, ResearchGate 2023,
(doi: 10.13140/RG.2.2.19944.14086).

@ResearchGate: https://www.researchgate.net/publication/368781100
@Scribd: https://www.scribd.com/document/627821588
@ZENODO_ORG: https://zenodo.org/record/7675903
@academia: https://www.academia.edu/97484903

2023 169 Manuscript

 9103
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett @gmail.com · Manhattan, NY, USA
Henry Garrett, “New Ideas On Super Harmony By Hyper k-Function Of SuperHyperK-
Domination In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate
2023, (doi: 10.13140/RG.2.2.23299.58404).

@ResearchGate: https://www.researchgate.net/publication/368786722
@Scribd: https://www.scribd.com/document/627821272
@ZENODO_ORG: https://zenodo.org/record/7675943
@academia: https://www.academia.edu/97485466

2023 168 Manuscript

Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph

By SuperHyperK-Number As Hyper k-Partition On Super Layers”, ResearchGate 2023, (doi:
10.13140/RG.2.2.33103.76968).

@ResearchGate: https://www.researchgate.net/publication/368752952
@Scribd: https://www.scribd.com/document/627632376
@ZENODO_ORG: https://zenodo.org/record/7672331
@academia: https://www.academia.edu/97431255

2023 167 Manuscript

Henry Garrett, “New Ideas On Super Gradient By Hyper k-Class Of SuperHyperK-Number

In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi:
10.13140/RG.2.2.23037.44003).

@ResearchGate: https://www.researchgate.net/publication/368753609
@Scribd: https://www.scribd.com/document/627635276
@ZENODO_ORG: https://zenodo.org/record/7672351
@academia: https://www.academia.edu/97431782

2023 166 Manuscript

Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph By

SuperHyperOrder As Hyper Enumerations On Super Landmarks”, ResearchGate 2023, (doi:
10.13140/RG.2.2.35646.56641).

@ResearchGate: https://www.researchgate.net/publication/368717242
@Scribd: https://www.scribd.com/document/627431073
@ZENODO_ORG: https://zenodo.org/record/97377500
@academia: https://www.academia.edu/97377500

2023 165 Manuscript

Henry Garrett, “New Ideas On Super Analogous By Hyper Visions Of SuperHyperOrder

In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi:
10.13140/RG.2.2.18030.48967).

@ResearchGate: https://www.researchgate.net/publication/368717426
@Scribd: https://www.scribd.com/document/627435127
@ZENODO_ORG: https://zenodo.org/record/7668620
@academia: https://www.academia.edu/97378363

2023 164 Manuscript

 9104
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett @gmail.com · Manhattan, NY, USA
Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph
By SuperHyperColoring As Hyper Categories On Super Neighbors”, ResearchGate 2023, (doi:
10.13140/RG.2.2.13973.81121).

@ResearchGate: https://www.researchgate.net/publication/368686241
@Scribd: https://www.scribd.com/document/627159268
@ZENODO_ORG: https://zenodo.org/record/7662771
@academia: https://www.academia.edu/97306994

2023 163 Manuscript

Henry Garrett, “New Ideas On Super Relations By Hyper Identifications Of

SuperHyperColoring In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”,
ResearchGate 2023, (doi: 10.13140/RG.2.2.34106.47047).

@ResearchGate: https://www.researchgate.net/publication/368686111
@Scribd: https://www.scribd.com/document/627162153
@ZENODO_ORG: https://zenodo.org/record/7662798
@academia: https://www.academia.edu/97307446

2023 162 Manuscript

Henry Garrett, “New Ideas On Super Contradiction By Hyper Detection

of SuperHyperDefensive In Cancer’s Neutrosophic Recognition and Neutrosophic
SuperHyperGraph”, ResearchGate 2023, (doi: 10.13140/RG.2.2.13397.09446).

@ResearchGate: https://www.researchgate.net/publication/368654749
@ZENODO_ORG: https://zenodo.org/record/7656758
@academia: https://www.academia.edu/97211570

2023 161 Manuscript

Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph

By SuperHyperDimension As Hyper Distinguishing On Super Distances”, ResearchGate 2023,
(doi: 10.13140/RG.2.2.31956.88961).

@ResearchGate: https://www.researchgate.net/publication/368663284
@Scribd: https://www.scribd.com/document/626941521
@ZENODO_ORG: https://zenodo.org/record/7659101
@academia: https://www.academia.edu/97244153

2023 160 Manuscript

Henry Garrett, “New Ideas On Super Locations By Hyper Differing Of SuperHyperDimension

In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi:
10.13140/RG.2.2.15179.67361).

@ResearchGate: https://www.researchgate.net/publication/368663387
@Scribd: https://www.scribd.com/document/626943597
@ZENODO_ORG: https://zenodo.org/record/7659125
@academia: https://www.academia.edu/97244962

2023 159 Manuscript

Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph

By SuperHyperDominating As Hyper Closing On Super Messy”, ResearchGate 2023, (doi:
10.13140/RG.2.2.21510.45125).

@ResearchGate: https://www.researchgate.net/publication/368599405
@Scribd: https://www.scribd.com/document/626381737
@ZENODO_ORG: https://zenodo.org/record/7650464
@academia: https://www.academia.edu/97068321
 9105
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett @gmail.com · Manhattan, NY, USA
2023 158 Manuscript

Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDominating

In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi:
10.13140/RG.2.2.13121.84321).

@ResearchGate: https://www.researchgate.net/publication/368599585
@Scribd: https://www.scribd.com/document/626385255
@ZENODO_ORG: https://zenodo.org/record/7650563
@academia: https://www.academia.edu/97069463

2023 157 Manuscript

Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph

By SuperHyperConnected As Hyper Group On Super Surge”, ResearchGate 2023, (doi:
10.13140/RG.2.2.11758.69441).
@ResearchGate: https://www.researchgate.net/publication/368571428
@Scribd: https://www.scribd.com/document/-
@ZENODO_ORG: https://zenodo.org/record/7647825
@academia: https://www.academia.edu/97032199

2023 156 Manuscript

Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of

SuperHyperConnected In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”,
ResearchGate 2023, (doi: 10.13140/RG.2.2.31891.35367).
@ResearchGate: https://www.researchgate.net/publication/368571754
@Scribd: https://www.scribd.com/document/-
@ZENODO_ORG: https://zenodo.org/record/7647834
@academia: https://www.academia.edu/97032546

2023 155 Manuscript

Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph

By SuperHyperTotal As Hyper Covering On Super Infections”, ResearchGate 2023, (doi:
10.13140/RG.2.2.19360.87048).
@ResearchGate: https://www.researchgate.net/publication/368567448
@Scribd: https://www.scribd.com/document/-
@ZENODO_ORG: https://zenodo.org/record/7646887
@academia: https://www.academia.edu/97011284

2023 154 Manuscript

Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal

In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi:
10.13140/RG.2.2.32363.21286).
@ResearchGate: https://www.researchgate.net/publication/368568084
@Scribd: https://www.scribd.com/document/-
@ZENODO_ORG: https://zenodo.org/record/7646950
@academia: https://www.academia.edu/97012331

2023 153 Manuscript

Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect

In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi:
10.13140/RG.2.2.23266.81602).
@ResearchGate: https://www.researchgate.net/publication/368505978
@Scribd: https://www.scribd.com/document/626054425
@ZENODO_ORG: https://zenodo.org/record/7644841
@academia: https://www.academia.edu/96975382

2023 152 Manuscript

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

Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph

By SuperHyperPerfect As Hyper Idealism On Super Vacancy”, ResearchGate 2023, (doi:
10.13140/RG.2.2.19911.37285).
@ResearchGate: https://www.researchgate.net/publication/368537004
@Scribd: https://www.researchgate.net/publication/368537004
@ZENODO_ORG: https://zenodo.org/record/7644822
@academia: https://www.academia.edu/96974987

2023 151 Manuscript

Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph

By SuperHyperJoin As Hyper Separations On Super Sorts”, ResearchGate 2023, (doi:
10.13140/RG.2.2.11050.90569).
@ResearchGate: https://www.researchgate.net/publication/368504049
@Scribd: https://www.scribd.com/document/625849647
@ZENODO_ORG: https://zenodo.org/record/7641835
@academia: https://www.academia.edu/96920275

2023 150 Manuscript

Henry Garrett, “New Ideas On Super connections By Hyper disconnections

Of SuperHyperJoin In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”,
ResearchGate 2023, (doi: 10.13140/RG.2.2.17761.79206).
@ResearchGate: https://www.researchgate.net/publication/368505978
@Scribd: https://www.scribd.com/document/625851794
@ZENODO_ORG: https://zenodo.org/record/7641856
@academia: https://www.academia.edu/96920884

2023 149 Manuscript

Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions

Of SuperHyperDuality In Cancer’s Neutrosophic Recognition and Neutrosophic
SuperHyperGraph”, ResearchGate 2023, (doi: 10.13140/RG.2.2.34953.52320).
@ResearchGate: https://www.researchgate.net/publication/368472959
@Scribd: https://www.scribd.com/document/625624015
@ZENODO_ORG: https://zenodo.org/record/7637677
@academia: https://www.academia.edu/96855185

2023 148 Manuscript

Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph

By SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchGate
2023, (doi: 10.13140/RG.2.2.33275.80161).
@ResearchGate: https://www.researchgate.net/publication/368473015
@Scribd: https://www.scribd.com/document/625629651
@ZENODO_ORG: https://zenodo.org/record/7637699
@academia: https://www.academia.edu/96856241

2023 147 Manuscript

Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph

By Path SuperHyperColoring As Hyper Correction On Super Faults”, ResearchGate 2023, (doi:
10.13140/RG.2.2.30182.50241).
@ResearchGate: https://www.researchgate.net/publication/368451328
@Scribd: https://www.scribd.com/document/625250582
@ZENODO_ORG: https://zenodo.org/record/7632880
@academia: https://www.academia.edu/96735840

2023 146 Manuscript

 9107
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett @gmail.com · Manhattan, NY, USA
Henry Garrett, “New Ideas On Super Reflections By Hyper Rotations Of
Path SuperHyperColoring In Cancer’s Neutrosophic Recognition and Neutrosophic
SuperHyperGraph”, ResearchGate 2023, (doi: 10.13140/RG.2.2.33459.30243).
@ResearchGate: https://www.researchgate.net/publication/368451019
@Scribd: https://www.scribd.com/document/625247178
@ZENODO_ORG: https://zenodo.org/record/7632855
@academia: https://www.academia.edu/96734741

2023 145 Manuscript

Henry Garrett, “New Ideas As Hyper Deformations On Super Chains In Cancer’s

Neutrosophic Recognition and Neutrosophic SuperHyperGraph By SuperHyperDensity”,
ResearchGate 2023, (doi: 10.13140/RG.2.2.13444.60806).
@ResearchGate: https://www.researchgate.net/publication/368360212
@ZENODO_ORG: https://zenodo.org/record/96569022
@academia: https://www.academia.edu/96567710

2023 144 Manuscript

Henry Garrett, “New Ideas As Hyper Ignorance By SuperHyperDensity On Super Resistances

In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, ResearchGate
2023, (doi:10.13140/RG.2.2.16800.05123).
@ResearchGate: https://www.researchgate.net/publication/368359455
@ZENODO_ORG: https://zenodo.org/record/7623324
@academia: https://www.academia.edu/96567710

2023 143 Manuscript

Henry Garrett, “New Research On Cancer’s Recognition and Neutrosophic SuperHyperGraph

By Eulerian SuperHyperCycles and Hamiltonian Sets As Hyper Covering Versus Super
separations-VI”, ResearchGate 2023, (doi: 10.13140/RG.2.2.29913.80482).
@WordPress: -
@ResearchGate: https://www.researchgate.net/publication/368291720
@Scribd: https://www.scribd.com/document/624027069
@ZENODO_ORG: https://zenodo.org/record/7608740
@academia: https://www.academia.edu/96375324

2023 142 Manuscript

Henry Garrett, “New Research On Cancer’s Recognition and Neutrosophic SuperHyperGraph

By Eulerian SuperHyperCycles and Hamiltonian Sets As Hyper Covering Versus Super
separations-V”, ResearchGate 2023, (doi: 10.13140/RG.2.2.33269.24809).
@WordPress: -
@ResearchGate: https://www.researchgate.net/publication/368291539
@Scribd:https://www.scribd.com/document/624023778
@ZENODO_ORG: https://zenodo.org/record/7608672
@academia: https://www.academia.edu/96374297

2023 141 Manuscript

Henry Garrett, “New Research On Cancer’s Recognition and Neutrosophic SuperHyperGraph

By Eulerian SuperHyperCycles and Hamiltonian Sets As Hyper Covering Versus Super
separations-IV”, ResearchGate 2023, (doi: 10.13140/RG.2.2.34946.96960).
@WordPress: -
@ResearchGate: https://www.researchgate.net/publication/368291452
@Scribd: https://www.scribd.com/document/624020887
@ZENODO_ORG: https://zenodo.org/record/7608627
@academia: https://www.academia.edu/96373214

2023 140 Manuscript

 9108
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett @gmail.com · Manhattan, NY, USA
Henry Garrett, “A Research On Cancer’s Recognition and Neutrosophic SuperHyperGraph
By Eulerian SuperHyperCycles and Hamiltonian Sets As Hyper Covering Versus Super
separations-III”, ResearchGate 2023, (doi: 10.13140/RG.2.2.14814.31040).
@WordPress: -
@ResearchGate: https://www.researchgate.net/publication/368291252
@Scribd: https://www.scribd.com/document/624016701
@ZENODO_ORG: https://zenodo.org/record/7608572
@academia: https://www.academia.edu/96372008

2023 139 Manuscript

Henry Garrett, “A Research On Cancer’s Recognition and Neutrosophic SuperHyperGraph

By Eulerian SuperHyperCycles and Hamiltonian Sets As Hyper Covering Versus Super
separations-II”, ResearchGate 2023, (doi: 10.13140/RG.2.2.15653.17125).
@WordPress: -
@ResearchGate: https://www.researchgate.net/publication/368291112
@Scribd: https://www.scribd.com/document/624011527
@ZENODO_ORG: https://zenodo.org/record/7608521
@academia: https://www.academia.edu/96370816

2023 138 Manuscript

Henry Garrett, “A Research On Cancer’s Recognition and Neutrosophic SuperHyperGraph

By Eulerian SuperHyperCycles and Hamiltonian Sets As Hyper Covering Versus Super
separations-I”, ResearchGate 2023, (doi: 10.13140/RG.2.2.25719.50089).
@WordPress: -
@ResearchGate: https://www.researchgate.net/publication/368290537
@Scribd: https://www.scribd.com/document/624009023
@ZENODO_ORG: https://zenodo.org/record/7608491
@academia: https://www.academia.edu/96370160

2023 137 Manuscript

Henry Garrett, “New Ideas On Super Disruptions In Cancer’s Extreme Recognition

As Neutrosophic SuperHyperGraph By Hyper Plans Called SuperHyperConnectivities”,
ResearchGate 2023, (doi: 10.13140/RG.2.2.29441.94562).
@WordPress: -
@ResearchGate: https://www.researchgate.net/publication/368275564
@Scribd: https://www.scribd.com/document/623818360
@ZENODO_ORG: https://zenodo.org/record/7606366
@academia: https://www.academia.edu/96303538

2023 136 Manuscript

Henry Garrett, “Cancer’s Neutrosophic Recognition As Neutrosophic SuperHyperGraph

By SuperHyperConnectivities As Hyper Diagnosis On Super Mechanism”, ResearchGate 2023,
(doi: 10.13140/RG.2.2.17252.24968).
@WordPress: -
@ResearchGate: https://www.researchgate.net/publication/368145050
@Scribd: https://www.scribd.com/document/623487116
@ZENODO_ORG: https://zenodo.org/record/7601136
@academia: https://www.academia.edu/96199009

2023 135 Manuscript

Henry Garrett,“Cancer’s Recognition and (Neutrosophic) SuperHyperGraph By the

Criteria of Eulerian and Hamiltonian Type-Sets As Hyper Modified Cycles On Super Mess”,
ResearchGate 2023,(doi: 10.13140/RG.2.2.16652.59525).
@WordPress: -
@ResearchGate: https://www.researchgate.net/publication/367510970
@Scribd: https://www.scribd.com/document/622449802
@academia: https://www.academia.edu/95863072
@ZENODO_ORG: https://zenodo.org/record/7579699

2023 134 Manuscript

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

Henry Garrett,“Eulerian and Hamiltonian In Cancer’s Neutrosophic Recognition and

Neutrosophic SuperHyperGraph On Super Interactions By Hyper Extensions of Cycles”,
ResearchGate 2023,(doi: 10.13140/RG.2.2.34583.24485).
@WordPress: -
@ResearchGate: https://www.researchgate.net/publication/367487872
@Scribd: https://www.scribd.com/document/622345752
@academia: https://www.academia.edu/95825118
@ZENODO_ORG: https://zenodo.org/record/7577878

2023 Article133 (JMTCM) Article

Henry Garrett, “Some Super Hyper Degrees and Co-Super Hyper Degrees on Neutrosophic
Super Hyper Graphs And Super Hyper Graphs Alongside Applications in Cancer’s
Treatments”, J Math Techniques Comput Math 2(1) (2023) 35-47.
(https://www.opastpublishers.com/open-access-articles/some-super-hyper-degrees-
and-cosuper-hyper-degrees-on-neutrosophic-super-hyper-graphs-and-super-hyper-graphs-
alongside-a.pdf)
The links to PDF, its abstract, its citation and the volume are as follows.
PDF:https://www.opastpublishers.com/open-access-articles/some-super-hyper-degrees-
and-cosuper-hyper-degrees-on-neutrosophic-super-hyper-graphs-and-super-hyper-graphs-
alongside-a.pdf
Abstract:https://www.opastpublishers.com/peer-review/some-super-hyper-degrees-and-
cosuper-hyper-degrees-on-neutrosophic-super-hyper-graphs-and-super-hyper-graphs-
alongside-a-5009.html
Citation:https://www.opastpublishers.com/citation/some-super-hyper-degrees-and-cosuper-
hyper-degrees-on-neutrosophic-super-hyper-graphs-and-super-hyper-graphs-alongside-a-
5009.html
Volume:https://www.opastpublishers.com/table-contents/jmtcm-volume-2-issue-1-year-2023

2023 132 Manuscript

Henry Garrett,“SuperHyperGirth Type-Results on extreme SuperHyperGirth theory and

(Neutrosophic) SuperHyperGraphs Toward Cancer’s extreme Recognition”, Preprints 2023,
2023010396 (doi: 10.20944/preprints202301.0396.v1).
@WordPress: -
@PrePrints_ORG: https://www.preprints.org/manuscript/202301.0396/v1
@ResearchGate: https://www.researchgate.net/publication/367339379
@Scribd: https://www.scribd.com/document/621318391
@academia: https://www.academia.edu/95502099
@ZENODO_ORG:https://zenodo.org/record/7559540

2023 131 Manuscript

Henry Garrett,“Neutrosophic SuperHyperGraphs Warns Hyper Landmark of neutrosophic

SuperHyperGirth In Super Type-Versions of Cancer’s neutrosophic Recognition”, Preprints
2023, 2023010395 (doi: 10.20944/preprints202301.0395.v1).
@WordPress: -
@PrePrints_ORG: https://www.preprints.org/manuscript/202301.0395/v1
@ResearchGate: https://www.researchgate.net/publication/367339286
@Scribd: https://www.scribd.com/document/621318365
@academia: https://www.academia.edu/95500542
@ZENODO_ORG: https://zenodo.org/record/7559490

2023 130 Manuscript

Henry Garrett,“The Constructions of (Neutrosophic) SuperHyperGraphs on the Cancer’s

Recognition in The Confrontation With Super Attacks In Hyper Situations By Implementing
(Neutrosophic) 1-Failed SuperHyperForcing in The Technical Approaches to Neutralize
SuperHyperViews”, ResearchGate 2023, (doi: 10.13140/RG.2.2.26240.51204).
@WordPress: -
@ResearchGate: https://www.researchgate.net/publication/367298521
@Scribd: https://www.scribd.com/document/620971287
@ZENODO_ORG: https://zenodo.org/record/7555616
@academia: https://www.academia.edu/95379594
 9110
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett @gmail.com · Manhattan, NY, USA
2023 129 Manuscript

Henry Garrett,“(Neutrosophic) 1-Failed SuperHyperForcing As the Entrepreneurs on

Cancer’s Recognitions To Fail Forcing Style As the Super Classes With Hyper Effects In The
Background of the Framework is So-Called (Neutrosophic) SuperHyperGraphs”, ResearchGate
2023, (doi: 10.13140/RG.2.2.12818.73925).
@WordPress: -
@ResearchGate: https://www.researchgate.net/publication/367298409
@Scribd: https://www.scribd.com/document/620966787
@ZENODO_ORG: https://zenodo.org/record/7555558
@academia: https://www.academia.edu/95378699

2023 128 Manuscript

Henry Garrett,“Super Actions On The Types of Hyper Levels In The Sensible

Neutrosophic SuperHyperGirth On Cancer’s Neutrosophic Recognition and Neutrosophic
SuperHyperGraph”, ResearchGate 2023,(doi: 10.13140/RG.2.2.26836.88960).
@WordPress: -
@ResearchGate: https://www.researchgate.net/publication/367336596
@Scribd: https://www.scribd.com/document/621281512
@academia: https://www.academia.edu/95490090
@ZENODO_ORG: https://zenodo.org/record/7559351

2023 127 Manuscript

Henry Garrett,“SuperHyperGirth Approaches on the Super Challenges on the Cancer’s

Recognition In the Hyper Model of (Neutrosophic) SuperHyperGraph”, ResearchGate
2023,(doi: 10.13140/RG.2.2.36745.93289).
@WordPress: -
@ResearchGate:https://www.researchgate.net/publication/367336398
@Scribd: https://www.scribd.com/document/621280166
@academia: https://www.academia.edu/95488505
@ZENODO_ORG: https://zenodo.org/record/7559313

2023 0126 | Extreme SuperHyperClique as the Firm Scheme of Confrontation under Cancer’s Recognition Manuscript
as the Model in The Setting of (Neutrosophic) SuperHyperGraphs
Henry Garrett,“Extreme SuperHyperClique as the Firm Scheme of Confrontation under
Cancer’s Recognition as the Model in The Setting of (Neutrosophic) SuperHyperGraphs”,
Preprints 2023, 2023010308 (doi: 10.20944/preprints202301.0308.v1).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2023 0125 | Uncertainty On The Act And Effect Of Cancer Alongside The Foggy Positions Of Cells Manuscript
Toward Neutrosophic Failed SuperHyperClique inside Neutrosophic SuperHyperGraphs Titled Cancer’s

Recognition
Henry Garrett,“Uncertainty On The Act And Effect Of Cancer Alongside The Foggy
Positions Of Cells Toward Neutrosophic Failed SuperHyperClique inside Neutrosophic
SuperHyperGraphs Titled Cancer’s Recognition”, Preprints 2023, 2023010282 (doi:
10.20944/preprints202301.0282.v1).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2023 0124 | Neutrosophic Version Of Separates Groups Of Cells In Cancer’s Recognition On Neutrosophic Manuscript
SuperHyperGraphs
Henry Garrett,“Neutrosophic Version Of Separates Groups Of Cells In Cancer’s
Recognition On Neutrosophic SuperHyperGraphs”, Preprints 2023, 2023010267 (doi:
10.20944/preprints202301.0267.v1).).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2023 0123 | The Shift Paradigm To Classify Separately The Cells and Affected Cells Toward The Totality Manuscript
Under Cancer’s Recognition By New Multiple Definitions On the Sets Polynomials Alongside Numbers

In The (Neutrosophic) SuperHyperMatching Theory Based on SuperHyperGraph and Neutrosophic

SuperHyperGraph
 9111
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett @gmail.com · Manhattan, NY, USA
Henry Garrett, “The Shift Paradigm To Classify Separately The Cells and Affected Cells
Toward The Totality Under Cancer’s Recognition By New Multiple Definitions On the Sets
Polynomials Alongside Numbers In The (Neutrosophic) SuperHyperMatching Theory Based
on SuperHyperGraph and Neutrosophic SuperHyperGraph”, Preprints 2023, 2023010265 (doi:
10.20944/preprints202301.0265.v1).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2023 0122 | Breaking the Continuity and Uniformity of Cancer In The Worst Case of Full Manuscript
Connections With Extreme Failed SuperHyperClique In Cancer’s Recognition Applied in (Neutrosophic)

SuperHyperGraphs
Henry Garrett,“Breaking the Continuity and Uniformity of Cancer In The
Worst Case of Full Connections With Extreme Failed SuperHyperClique In Cancer’s
Recognition Applied in (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010262,(doi:
10.20944/preprints202301.0262.v1).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2023 0121 | Neutrosophic Failed SuperHyperStable as the Survivors on the Cancer’s Neutrosophic Manuscript
Recognition Based on Uncertainty to All Modes in Neutrosophic SuperHyperGraphs
Henry Garrett, “Neutrosophic Failed SuperHyperStable as the Survivors on the
Cancer’s Neutrosophic Recognition Based on Uncertainty to All Modes in Neutrosophic
SuperHyperGraphs”, Preprints 2023, 2023010240 (doi: 10.20944/preprints202301.0240.v1).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2023 0120 | Extremism of the Attacked Body Under the Cancer’s Circumstances Where Cancer’s Manuscript
Recognition Titled (Neutrosophic) SuperHyperGraphs
Henry Garrett, “Extremism of the Attacked Body Under the Cancer’s Circumstances Where
Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010224,
(doi: 10.20944/preprints202301.0224.v1).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2023 0119 | SuperHyperMatching By (R-)Definitions And Polynomials To Monitor Cancer’s Recognition Manuscript
In Neutrosophic SuperHyperGraphs
Henry Garrett,“SuperHyperMatching By (R-)Definitions And Polynomials To Monitor
Cancer’s Recognition In Neutrosophic SuperHyperGraphs”, ResearchGate 2023,(doi:
10.13140/RG.2.2.35061.65767).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2023 0118 | The Focus on The Partitions Obtained By Parallel Moves In The Cancer’s Extreme Recognition Manuscript
With Different Types of Extreme SuperHyperMatching Set and Polynomial on (Neutrosophic)

SuperHyperGraphs
Henry Garrett,“The Focus on The Partitions Obtained By Parallel Moves In The
Cancer’s Extreme Recognition With Different Types of Extreme SuperHyperMatching
Set and Polynomial on (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023,(doi:
10.13140/RG.2.2.18494.15680).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2023 0117 | Indeterminacy On The All Possible Connections of Cells In Front of Cancer’s Attacks In Manuscript
The Terms of Neutrosophic Failed SuperHyperClique on Cancer’s Recognition called Neutrosophic

SuperHyperGraphs
Henry Garrett,“Extreme Failed SuperHyperClique Decides the Failures on the Cancer’s
Recognition in the Perfect Connections of Cancer’s Attacks By SuperHyperModels Named
(Neutrosophic) SuperHyperGraphs”, ResearchGate 2023,(doi: 10.13140/RG.2.2.15897.70243).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2023 0116 | Extreme Failed SuperHyperClique Decides the Failures on the Cancer’s Recognition Manuscript
in the Perfect Connections of Cancer’s Attacks By SuperHyperModels Named (Neutrosophic)

SuperHyperGraphs
Henry Garrett,“Extreme Failed SuperHyperClique Decides the Failures on the Cancer’s
Recognition in the Perfect Connections of Cancer’s Attacks By SuperHyperModels Named
(Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 10.13140/RG.2.2.32530.73922).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2023 0115 | (Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Recognitions And (Neutrosophic) Manuscript
SuperHyperGraphs
 9112
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett @gmail.com · Manhattan, NY, USA

Henry Garrett, “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s

Recognitions And (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010105 (doi:
10.20944/preprints202301.0105.v1).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2023 0114 | Perfect Directions Toward Idealism in Cancer’s Neutrosophic Recognition Forwarding Manuscript
Neutrosophic SuperHyperClique on Neutrosophic SuperHyperGraphs
Henry Garrett,“Perfect Directions Toward Idealism in Cancer’s Neutrosophic Recognition
Forwarding Neutrosophic SuperHyperClique on Neutrosophic SuperHyperGraphs”,
ResearchGate 2023, (doi: 10.13140/RG.2.2.30092.80004).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2023 0113 | Demonstrating Complete Connections in Every Embedded Regions and Sub-Regions in Manuscript
the Terms of Cancer’s Recognition and (Neutrosophic) SuperHyperGraphs With (Neutrosophic)

SuperHyperClique
Henry Garrett,“Demonstrating Complete Connections in Every Embedded Regions and Sub-
Regions in the Terms of Cancer’s Recognition and (Neutrosophic) SuperHyperGraphs With
(Neutrosophic) SuperHyperClique”, ResearchGate 2023, (doi: 10.13140/RG.2.2.23172.19849).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2023 0112 | Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic) SuperHyperModeling Manuscript
in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs
Henry Garrett, “Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic)
SuperHyperModeling in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs”,
Preprints 2023, 2023010105 (doi: 10.20944/preprints202301.0105.v1).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2023 0111 | Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic SuperHyperStable To Manuscript

Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints
Henry Garrett, “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic
SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints”,
Preprints 2023, 2023010088 (doi: 10.20944/preprints202301.0088.v1).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2023 0110 | Different Neutrosophic Types of Neutrosophic Regions titled neutrosophic Failed Manuscript
SuperHyperStable in Cancer’s Neutrosophic Recognition modeled in the Form of Neutrosophic

SuperHyperGraphs
Henry Garrett,“Different Neutrosophic Types of Neutrosophic Regions titled neutrosophic
Failed SuperHyperStable in Cancer’s Neutrosophic Recognition modeled in the Form of
Neutrosophic SuperHyperGraphs”, ResearchGate 2023, (doi: 10.13140/RG.2.2.17385.36968).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2022 0109 | 0039 | Closing Numbers and Super-Closing Numbers as (Dual)Resolving and (Dual)Coloring Manuscript
alongside (Dual)Dominating in (Neutrosophic)n-SuperHyperGraph
Garrett, Henry. “0039 | Closing Numbers and Super-Closing Numbers as (Dual)Resolving and
(Dual)Coloring alongside (Dual)Dominating in (Neutrosophic)n-SuperHyperGraph.” CERN
European Organization for Nuclear Research - Zenodo, Nov. 2022. CERN European
Organization for Nuclear Research, https://doi.org/10.5281/zenodo.6319942.
https://oa.mg/work/10.5281/zenodo.6319942
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2022 0108 | 0049 | (Failed)1-Zero-Forcing Number in Neutrosophic Graphs Manuscript

Garrett, Henry. “0049 | (Failed)1-Zero-Forcing Number in Neutrosophic Graphs.” CERN

European Organization for Nuclear Research - Zenodo, Feb. 2022. CERN European
Organization for Nuclear Research, https://doi.org/10.13140/rg.2.2.35241.26724.
https://oa.mg/work/10.13140/rg.2.2.35241.26724
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2023 0107 | Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To Use Neutrosophic Manuscript
SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond
 9113
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett @gmail.com · Manhattan, NY, USA

Henry Garrett, “Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To

Use Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond”,
Preprints 2023, 2023010044
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2023 0106 | (Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well-SuperHyperModelled Manuscript

(Neutrosophic) SuperHyperGraphs
Henry Garrett, “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well-
SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010043 (doi:
10.20944/preprints202301.0043.v1).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2022 Article105 (JMTCM) Article

Henry Garrett, “Super Hyper Dominating and Super Hyper Resolving on Neutrosophic Super
Hyper Graphs and Their Directions in Game Theory and Neutrosophic Super Hyper Classes”,
J Math Techniques Comput Math 1(3) (2022) 242-263. (doi: 10.33140/JMTCM.01.03.09).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2023 0104 | Using the Tool As (Neutrosophic) Failed SuperHyperStable To SuperHyperModel Cancer’s Manuscript
Recognition Titled (Neutrosophic) SuperHyperGraphs
Henry Garrett,“Using the Tool As (Neutrosophic) Failed SuperHyperStable To
SuperHyperModel Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs”,
ResearchGate 2023, (doi: 10.13140/RG.2.2.28945.92007).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2023 0103 | Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic SuperHyperStable To Manuscript

Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints
Henry Garrett,“Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic
SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints”,
ResearchGate 2023, (doi: 10.13140/RG.2.2.11447.80803).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2023 0102 | (Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well-SuperHyperModelled Manuscript

(Neutrosophic) SuperHyperGraphs
Henry Garrett,“(Neutrosophic) SuperHyperStable on Cancer’s Recognition by
Well-SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi:
10.13140/RG.2.2.35774.77123).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2022 0101 | Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To Use Neutrosophic Manuscript
SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond
Henry Garrett,“Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To
Use Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond”,
ResearchGate 2022, (doi: 10.13140/RG.2.2.36141.77287).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2022 0100 | (Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Recognitions And (Neutrosophic) Manuscript
SuperHyperGraphs
Henry Garrett,“(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Recognitions And
(Neutrosophic) SuperHyperGraphs”, ResearchGate 2022, (doi: 10.13140/RG.2.2.29430.88642).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2022 0099 | Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic) SuperHyperModeling Manuscript
in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs
Henry Garrett,“Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic)
SuperHyperModeling in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs”,
ResearchGate 2022, (doi: 10.13140/RG.2.2.11369.16487).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2022 0098 | (Neutrosophic) SuperHyperModeling of Cancer’s Recognitions Featuring (Neutrosophic) Manuscript

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

Henry Garrett, “(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions Featuring

(Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, Preprints 2022, 2022120549 (doi:
10.20944/preprints202212.0549.v1).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2022 0098 | (Neutrosophic) SuperHyperModeling of Cancer’s Recognitions Featuring (Neutrosophic) Manuscript

SuperHyperDefensive SuperHyperAlliances
Henry Garrett, “(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions
Featuring (Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, ResearchGate 2022,
(doi: 10.13140/RG.2.2.19380.94084).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2022 0097 | (Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and SuperHyperOffensive Manuscript

Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With (Neutrosophic) SuperHyperModeling

of Cancer’s Recognitions And Related (Neutrosophic) SuperHyperClasses

Henry Garrett, “(Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and
SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With
(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions And Related (Neutrosophic)
SuperHyperClasses”, Preprints 2022, 2022120540 (doi: 10.20944/preprints202212.0540.v1).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2022 0097 | (Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and SuperHyperOffensive Manuscript

Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With (Neutrosophic) SuperHyperModeling

of Cancer’s Recognitions And Related (Neutrosophic) SuperHyperClasses

Henry Garrett, “(Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and
SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With
(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions And Related (Neutrosophic)
SuperHyperClasses”, ResearchGate 2022, (doi: 10.13140/RG.2.2.14426.41923).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2022 0096 | SuperHyperGirth on SuperHyperGraph and Neutrosophic SuperHyperGraph With Manuscript

SuperHyperModeling of Cancer’s Recognitions
Henry Garrett, “SuperHyperGirth on SuperHyperGraph and Neutrosophic
SuperHyperGraph With SuperHyperModeling of Cancer’s Recognitions”, Preprints 2022,
2022120500 (doi: 10.20944/preprints202212.0500.v1).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2022 0096 | SuperHyperGirth on SuperHyperGraph and Neutrosophic SuperHyperGraph With Manuscript

SuperHyperModeling of Cancer’s Recognitions
Henry Garrett, “SuperHyperGirth on SuperHyperGraph and Neutrosophic
SuperHyperGraph With SuperHyperModeling of Cancer’s Recognitions”, ResearchGate
2022 (doi: 10.13140/RG.2.2.20993.12640).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2022 0095 | Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic SuperHyperGraphs Manuscript

and SuperHyperGraphs Alongside Applications in Cancer’s Treatments
Henry Garrett,“Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic
SuperHyperGraphs and SuperHyperGraphs Alongside Applications in Cancer’s Treatments”,
Preprints 2022, 2022120324 (doi: 10.20944/preprints202212.0324.v1).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2022 0095 | Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic SuperHyperGraphs Manuscript

And SuperHyperGraphs Alongside Applications in Cancer’s Treatments
Henry Garrett, “Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic
SuperHyperGraphs And SuperHyperGraphs Alongside Applications in Cancer’s Treatments”,
ResearchGate 2022 (doi: 10.13140/RG.2.2.23123.04641).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2022 0094 | SuperHyperDominating and SuperHyperResolving on Neutrosophic SuperHyperGraphs And Manuscript

Their Directions in Game Theory and Neutrosophic SuperHyperClasses
Henry Garrett, “SuperHyperDominating and SuperHyperResolving on Neutrosophic
SuperHyperGraphs And Their Directions in Game Theory and Neutrosophic
SuperHyperClasses”, Preprints 2022, 2022110576 (doi: 10.20944/preprints202211.0576.v1).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn
 9115
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett @gmail.com · Manhattan, NY, USA
2022 0094 | SuperHyperDominating and SuperHyperResolving on Neutrosophic SuperHyperGraphs And Manuscript
Their Directions in Game Theory and Neutrosophic SuperHyperClasses
Henry Garrett, “SuperHyperDominating and SuperHyperResolving on Neutrosophic
SuperHyperGraphs And Their Directions in Game Theory and Neutrosophic
SuperHyperClasses”, ResearchGate 2022 (doi: 10.13140/RG.2.2.23324.56966).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2022 0093 | Neutrosophic Co-degree and Neutrosophic Degree alongside Chromatic Numbers in the Setting Article
of Some Classes Related to Neutrosophic Hypergraphs
Henry Garrett, “Neutrosophic Co-degree and Neutrosophic Degree alongside Chromatic
Numbers in the Setting of Some Classes Related to Neutrosophic Hypergraphs”, J Curr Trends
Comp Sci Res 1(1) (2022) 06-14.
PDF,Abstract,Issue.
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2022 0092 | Recognition of the Pattern for Vertices to Make Dimension by Resolving in some Classes of Manuscript
Neutrosophic Graphs
Henry Garrett, “Recognition of the Pattern for Vertices to Make Dimension
by Resolving in some Classes of Neutrosophic Graphs”, ResearchGate 2022 (doi:
10.13140/RG.2.2.27281.51046).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2022 0091 | Regularity of Every Element to Function in the Type of Domination in Neutrosophic Graphs Manuscript

Henry Garrett, “Regularity of Every Element to Function in the Type of Domination in

Neutrosophic Graphs”, ResearchGate 2022 (doi: 10.13140/RG.2.2.22861.10727).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2022 0090 | Initial Material of Neutrosophic Preliminaries to Study Some Neutrosophic Notions Based on Manuscript
Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic SuperHyperGraph (NSHG)
Henry Garrett, “Initial Material of Neutrosophic Preliminaries to Study Some Neutrosophic
Notions Based on Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic SuperHyperGraph
(NSHG)”, ResearchGate 2022 (doi: 10.13140/RG.2.2.25385.88160).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2022 0089 | Basic Neutrosophic Notions Concerning Neutrosophic SuperHyperDominating and Manuscript
Neutrosophic SuperHyperResolving in Neutrosophic SuperHyperGraph
Henry Garrett, “Basic Neutrosophic Notions Concerning Neutrosophic
SuperHyperDominating and Neutrosophic SuperHyperResolving in Neutrosophic
SuperHyperGraph”, ResearchGate 2022 (doi: 10.13140/RG.2.2.29173.86244).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2022 0088 | Seeking Empty Subgraphs To Determine Different Measurements in Some Classes of Manuscript
Neutrosophic Graphs
Henry Garrett, “Seeking Empty Subgraphs To Determine Different Measurements in Some
Classes of Neutrosophic Graphs”, ResearchGate 2022 (doi: 10.13140/RG.2.2.30448.53766).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2022 0087 | Impacts of Isolated Vertices To Cover Other Vertices in Neutrosophic Graphs Manuscript

Henry Garrett, “Impacts of Isolated Vertices To Cover Other Vertices in Neutrosophic

Graphs”, ResearchGate 2022 (doi: 10.13140/RG.2.2.16185.44647).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2022 0086 | Perfect Locating of All Vertices in Some Classes of Neutrosophic Graphs Manuscript

Henry Garrett, “Perfect Locating of All Vertices in Some Classes of Neutrosophic Graphs”,
ResearchGate 2022 (doi: 10.13140/RG.2.2.23971.12326).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2022 0085 | Complete Connections Between Vertices in Neutrosophic Graphs Manuscript

Henry Garrett, “Complete Connections Between Vertices in Neutrosophic Graphs”,

ResearchGate 2022 (doi: 10.13140/RG.2.2.28860.10885).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn
 9116
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett @gmail.com · Manhattan, NY, USA
2022 0084 | Unique Distance Differentiation By Collection of Vertices in Neutrosophic Graphs Manuscript

Henry Garrett, “Unique Distance Differentiation By Collection of Vertices in Neutrosophic

Graphs”, ResearchGate 2022 (doi: 10.13140/RG.2.2.17692.77449).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2022 0083 | Single Connection Amid Vertices From Two Given Sets Partitioning Vertex Set in Some Classes Manuscript
of Neutrosophic Graphs
Henry Garrett, “Single Connection Amid Vertices From Two Given Sets Partitioning
Vertex Set in Some Classes of Neutrosophic Graphs”, ResearchGate 2022 (doi:
10.13140/RG.2.2.32189.33764).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2022 0082 | Separate Joint-Sets Representing Separate Numbers Where Classes of Neutrosophic Graphs Manuscript
and Applications are Cases of Study
Henry Garrett, “Separate Joint-Sets Representing Separate Numbers Where Classes
of Neutrosophic Graphs and Applications are Cases of Study”, ResearchGate 2022 (doi:
10.13140/RG.2.2.22666.95686).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2022 0081 | Repetitive Joint-Sets Featuring Multiple Numbers For Neutrosophic Graphs Manuscript

Henry Garrett, “Repetitive Joint-Sets Featuring Multiple Numbers For Neutrosophic

Graphs”, ResearchGate 2022 (doi: 10.13140/RG.2.2.15113.93283).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2022 0080 | Dual-Resolving Numbers Excerpt from Some Classes of Neutrosophic Graphs With Some Manuscript
Applications
Henry Garrett, “Dual-Resolving Numbers Excerpt from Some Classes of Neutrosophic
Graphs With Some Applications”, ResearchGate 2022 (doi: 10.13140/RG.2.2.14971.39200).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2022 0079 | Dual-Dominating Numbers in Neutrosophic Setting and Crisp Setting Obtained From Classes Manuscript
of Neutrosophic Graphs
Henry Garrett, “Dual-Dominating Numbers in Neutrosophic Setting and Crisp
Setting Obtained From Classes of Neutrosophic Graphs”, ResearchGate 2022 (doi:
10.13140/RG.2.2.19925.91361).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2022 0078 | Neutrosophic Path-Coloring Numbers BasedOn Endpoints In Neutrosophic Graphs Manuscript

Henry Garrett, “Neutrosophic Path-Coloring Numbers BasedOn Endpoints In Neutrosophic

Graphs”, ResearchGate 2022 (doi: 10.13140/RG.2.2.27990.11845).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2022 0077 | Neutrosophic Dominating Path-Coloring Numbers in New Visions of Classes of Neutrosophic Manuscript
Graphs
Henry Garrett, “Neutrosophic Dominating Path-Coloring Numbers in New Visions of Classes
of Neutrosophic Graphs”, ResearchGate 2022 (doi: 10.13140/RG.2.2.32151.65445).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2022 0076 | Path Coloring Numbers of Neutrosophic Graphs Based on Shared Edges and Neutrosophic Manuscript
Cardinality of Edges With Some Applications from Real-World Problems
Henry Garrett, “Path Coloring Numbers of Neutrosophic Graphs Based on Shared Edges
and Neutrosophic Cardinality of Edges With Some Applications from Real-World Problems”,
ResearchGate 2022 (doi: 10.13140/RG.2.2.30105.70244).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2022 0075 | Neutrosophic Collapsed Numbers in the Viewpoint of Neutrosophic Graphs Manuscript

Henry Garrett, “Neutrosophic Collapsed Numbers in the Viewpoint of Neutrosophic Graphs”,

ResearchGate 2022 (doi: 10.13140/RG.2.2.27962.67520).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn
 9117
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett @gmail.com · Manhattan, NY, USA
2022 0074 | Bulky Numbers of Classes of Neutrosophic Graphs Based on Neutrosophic Edges Manuscript

Henry Garrett, “Bulky Numbers of Classes of Neutrosophic Graphs Based on Neutrosophic

Edges”, ResearchGate 2022 (doi: 10.13140/RG.2.2.24204.18564).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2022 0073 | Dense Numbers and Minimal Dense Sets of Neutrosophic Graphs Manuscript

Henry Garrett, “Dense Numbers and Minimal Dense Sets of Neutrosophic Graphs”,
ResearchGate 2022 (doi: 10.13140/RG.2.2.28044.59527).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2022 0072 | Connectivities of Neutrosophic Graphs in the terms of Crisp Cycles Manuscript

Henry Garrett, “Connectivities of Neutrosophic Graphs in the terms of Crisp Cycles”,

ResearchGate 2022 (doi: 10.13140/RG.2.2.31917.77281).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2022 0071 | Strong Paths Defining Connectivities in Neutrosophic Graphs Manuscript

Henry Garrett, “Strong Paths Defining Connectivities in Neutrosophic Graphs”,

ResearchGate 2022 (doi: 10.13140/RG.2.2.17311.43682).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2022 0070 | Finding Longest Weakest Paths assigning numbers to some Classes of Neutrosophic Graphs Manuscript

Henry Garrett, “Finding Longest Weakest Paths assigning numbers to some Classes of
Neutrosophic Graphs”, ResearchGate 2022 (doi: 10.13140/RG.2.2.35579.59689).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2022 0068 | Relations and Notions amid Hamiltonicity and Eulerian Notions in Some Classes of Manuscript
Neutrosophic Graphs
Henry Garrett, “Relations and Notions amid Hamiltonicity and Eulerian Notions in Some
Classes of Neutrosophic Graphs”, ResearchGate 2022 (doi: 10.13140/RG.2.2.35579.59689).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2022 0067 | Eulerian Results In Neutrosophic Graphs With Applications Manuscript

Henry Garrett, “Eulerian Results In Neutrosophic Graphs With Applic- ations”,

ResearchGate 2022 (doi: 10.13140/RG.2.2.34203.34089).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2022 0066 | Finding Hamiltonian Neutrosophic Cycles in Classes of Neutrosophic Graphs Manuscript

Henry Garrett, “Finding Hamiltonian Neutrosophic Cycles in Classes of Neutrosophic

Graphs”, ResearchGate 2022 (doi: 10.13140/RG.2.2.29071.87200).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2022 0065 | Extending Sets Type-Results in Neutrosophic Graphs Manuscript

Henry Garrett, “Extending Sets Type-Results in Neutrosophic Graphs”, ResearchGate 2022

(doi: 10.13140/RG.2.2.13317.01767).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2022 0064 | Some Polynomials Related to Numbers in Classes of (Strong) Neutrosophic Graphs Manuscript

Henry Garrett, “Some Polynomials Related to Numbers in Classes of (Strong) Neutrosophic

Graphs”, ResearchGate 2022 (doi: 10.13140/RG.2.2.36280.83204).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2022 0063 | Finding Shortest Sequences of Consecutive Vertices in Neutrosophic Graphs Manuscript

Henry Garrett, “Finding Shortest Sequences of Consecutive Vertices in Neutrosophic

Graphs”, ResearchGate 2022 (doi: 10.13140/RG.2.2.22924.59526).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn
 9118
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett @gmail.com · Manhattan, NY, USA
2022 0062 | Neutrosophic Girth Based On Crisp Cycle in Neutrosophic Graphs Manuscript

Henry Garrett, “Neutrosophic Girth Based On Crisp Cycle in Neutrosophic Graphs”,

ResearchGate 2022 (doi: 10.13140/RG.2.2.14011.69923).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2022 0061 | e-Matching Number and e-Matching Polynomials in Neutrosophic Graphs Manuscript

Henry Garrett, “e-Matching Number and e-Matching Polynomials in Neutrosophic Graphs”,

ResearchGate 2022 (doi: 10.13140/RG.2.2.32516.60805).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2022 0060 | Matching Polynomials in Neutrosophic Graphs Manuscript

Henry Garrett, “Matching Polynomials in Neutrosophic Graphs”, ResearchGate 2022 (doi:

10.13140/RG.2.2.33630.72002).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2022 0059 | Some Results in Classes Of Neutrosophic Graphs Manuscript

Henry Garrett, “Some Results in Classes Of Neutrosophic Graphs”, Preprints 2022,

2022030248 (doi: 10.20944/preprints202203.0248.v1).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2022 0058 | Matching Number in Neutrosophic Graphs Manuscript

Henry Garrett, “Matching Number in Neutrosophic Graphs”, ResearchGate 2022 (doi:

10.13140/RG.2.2.18609.86882).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2022 0055 | (Failed) 1-clique Number in Neutrosophic Graphs Manuscript

Henry Garrett, “(Failed) 1-Clique Number in Neutrosophic Graphs”, ResearchGate 2022

(doi: 10.13140/RG.2.2.14241.89449).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2022 0054 | Failed Clique Number in Neutrosophic Graphs Manuscript

Henry Garrett, “Failed Clique Number in Neutrosophic Graphs”, ResearchGate 2022 (doi:
10.13140/RG.2.2.36039.16800).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2022 0053 | Clique Number in Neutrosophic Graphs Manuscript

Henry Garrett, “Clique Number in Neutrosophic Graphs”, ResearchGate 2022 (doi:

10.13140/RG.2.2.28338.68800).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2022 0052 | (Failed) 1-independent Number in Neutrosophic Graphs Manuscript

Henry Garrett, “(Failed) 1-Independent Number in Neutrosophic Graphs”, ResearchGate

2022 (doi: 10.13140/RG.2.2.30593.12643).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2022 0051 | Failed Independent Number in Neutrosophic Graphs Manuscript

Henry Garrett, “Failed Independent Number in Neutrosophic Graphs”, Preprints 2022,

2022020334 (doi: 10.20944/preprints202202.0334.v2)
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2022 0051 | Failed Independent Number in Neutrosophic Graphs Manuscript

Henry Garrett, “Failed Independent Number in Neutrosophic Graphs”, ResearchGate 2022

(doi: 10.13140/RG.2.2.31196.05768).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn
 9119
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett @gmail.com · Manhattan, NY, USA
2022 0050 | Independent Set in Neutrosophic Graphs Manuscript

Henry Garrett, “Independent Set in Neutrosophic Graphs”, Preprints 2022, 2022020334 (doi:
10.20944/preprints202202.0334.v1).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2022 0050 | Independent Set in Neutrosophic Graphs Manuscript

Henry Garrett, “Independent Set in Neutrosophic Graphs”, ResearchGate 2022 (doi:

10.13140/RG.2.2.17472.81925).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2022 0049 | (Failed)1-Zero-Forcing Number in Neutrosophic Graphs Manuscript

Henry Garrett, “(Failed)1-Zero-Forcing Number in Neutrosophic Graphs”, ResearchGate

2022 (doi: 10.13140/RG.2.2.35241.26724).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2022 0048 | Failed Zero-Forcing Number in Neutrosophic Graphs Manuscript

Henry Garrett, “Failed Zero-Forcing Number in Neutrosophic Graphs”, Preprints 2022,

2022020343 (doi: 10.20944/preprints202202.0343.v1).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2022 0048 | Failed Zero-Forcing Number in Neutrosophic Graphs Manuscript

Henry Garrett, “Failed Zero-Forcing Number in Neutrosophic Graphs”, ResearchGate 2022

(doi: 10.13140/RG.2.2.24873.47209).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2022 0047 | Zero Forcing Number in Neutrosophic Graphs Manuscript

Henry Garrett, “Zero Forcing Number in Neutrosophic Graphs”, ResearchGate 2022 (doi:
10.13140/RG.2.2.32265.93286).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2022 0046 | Quasi-Number in Neutrosophic Graphs Manuscript

Henry Garrett, “Quasi-Number in Neutrosophic Graphs”, ResearchGate 2022 (doi:

10.13140/RG.2.2.18470.60488).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2022 0045 | Quasi-Degree in Neutrosophic Graphs Manuscript

Henry Garrett, “Quasi-Degree in Neutrosophic Graphs”, Preprints 2022, 2022020100 (doi:

10.20944/preprints202202.0100.v1).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2022 0045 | Quasi-Degree in Neutrosophic Graphs Manuscript

Henry Garrett, “Quasi-Degree in ResearchGate 2022 (doi: 10.13140/RG.2.2.25460.01927).

Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2022 0044 | Co-Neighborhood in Neutrosophic Graphs Manuscript

Henry Garrett, “Co-Neighborhood in Neutrosophic Graphs”, ResearchGate 2022 (doi:

10.13140/RG.2.2.17687.44964).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2022 0043 | Global Powerful Alliance in Strong Neutrosophic Graphs Manuscript

Henry Garrett, “Global Powerful Alliance in Strong Neutrosophic Graphs”, Preprints 2022,
2022010429 (doi: 10.20944/preprints202201.0429.v1).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn
 9120
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett @gmail.com · Manhattan, NY, USA
2022 0043 | Global Powerful Alliance in Strong Neutrosophic Graphs Manuscript

Henry Garrett, “Global Powerful Alliance in Strong Neutrosophic Graphs”, ResearchGate

2022 (doi: 10.13140/RG.2.2.31784.24322).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2022 0042 | Global Offensive Alliance in Strong Neutrosophic Graphs Manuscript

Henry Garrett, “Global Offensive Alliance in Strong Neutrosophic Graphs”, Preprints 2022,
2022010429 (doi: 10.20944/preprints202201.0429.v1).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2022 0042 | Global Offensive Alliance in Strong Neutrosophic Graphs Manuscript

Henry Garrett, “Global Offensive Alliance in Strong Neutrosophic Graphs”, ResearchGate

2022 (doi: 10.13140/RG.2.2.26541.20961).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2022 0041 | Three Types of Neutrosophic Alliances based on Connectedness and (Strong) Edges Manuscript

Henry Garrett, “Three Types of Neutrosophic Alliances based on Connectedness and (Strong)
Edges”, Preprints 2022, 2022010239 (doi: 10.20944/preprints202201.0239.v1).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2022 0041 | Three Types of Neutrosophic Alliances based on Connectedness and (Strong) Edges Manuscript

Henry Garrett, “Three Types of Neutrosophic Alliances based on Connectedness and (Strong)
Edges”, ResearchGate 2022 (doi: 10.13140/RG.2.2.18486.83521).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2022 0040 | Three types of neutrosophic alliances based of connectedness and (strong) edges (In-Progress) Manuscript

Henry Garrett, “Three types of neutrosophic alliances based of connectedness and (strong)
edges (In-Progress)”, ResearchGate 2022 (doi: 10.13140/RG.2.2.27570.12480).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2022 0039 | Closing Numbers and Super-Closing Numbers as (Dual)Resolving and (Dual)Coloring Manuscript
alongside (Dual)Dominating in (Neutrosophic)n-SuperHyperGraph
Henry Garrett, “Closing Numbers and Super-Closing Numbers as (Dual)Resolving and
(Dual)Coloring alongside (Dual)Dominating in (Neutrosophic)n-SuperHyperGraph”, Preprints
2022, 2022010145 (doi: 10.20944/preprints202201.0145.v1).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2022 0039 | Closing Numbers and Super-Closing Numbers as (Dual)Resolving and (Dual)Coloring Manuscript
alongside (Dual)Dominating in (Neutrosophic)n-SuperHyperGraph
Henry Garrett, “Closing Numbers and Super-Closing Numbers as (Dual)Resolving
and (Dual)Coloring alongside (Dual)Dominating in (Neutrosophic)n-SuperHyperGraph”,
ResearchGate 2022 (doi: 10.13140/RG.2.2.18909.54244/1).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2022 0038 | Co-degree and Degree of classes of Neutrosophic Hypergraphs Manuscript

Henry Garrett, “Co-degree and Degree of classes of Neutrosophic Hypergraphs”, Preprints

2022, 2022010027 (doi: 10.20944/preprints202201.0027.v1).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2022 0038 | Co-degree and Degree of classes of Neutrosophic Hypergraphs Manuscript

Henry Garrett, “Co-degree and Degree of classes of Neutrosophic Hypergraphs”,

ResearchGate 2022 (doi: 10.13140/RG.2.2.32672.10249).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2021 0037 | Dimension and Coloring alongside Domination in Neutrosophic Hypergraphs Manuscript
 9121
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett @gmail.com · Manhattan, NY, USA

Henry Garrett, “Dimension and Coloring alongside Domination in Neutrosophic

Hypergraphs”, Preprints 2021, 2021120448 (doi: 10.20944/preprints202112.0448.v1).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2021 0037 | Dimension and Coloring alongside Domination in Neutrosophic Hypergraphs Manuscript

Henry Garrett, “Dimension and Coloring alongside Domination in Neutrosophic

Hypergraphs”, ResearchGate 2021 (doi: 10.13140/RG.2.2.13070.28483).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2021 0036 | Different Types of Neutrosophic Chromatic Number Manuscript

Henry Garrett, “Different Types of Neutrosophic Chromatic Number”, Preprints 2021,

2021120335 (doi: 10.20944/preprints202112.0335.v1).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2021 0036 | Different Types of Neutrosophic Chromatic Number Manuscript

Henry Garrett, “Different Types of Neutrosophic Chromatic Number”, ResearchGate 2021

(doi: 10.13140/RG.2.2.19068.46723).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2021 0035 | Neutrosophic Chromatic Number Based on Connectedness Manuscript

Henry Garrett, “Neutrosophic Chromatic Number Based on Connectedness”, Preprints 2021,

2021120226 (doi: 10.20944/preprints202112.0226.v1).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2021 0035 | Neutrosophic Chromatic Number Based on Connectedness Manuscript

Henry Garrett, “Neutrosophic Chromatic Number Based on Connectedness”, ResearchGate

2021 (doi: 10.13140/RG.2.2.18563.84001).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2021 0034 | Chromatic Number and Neutrosophic Chromatic Number Manuscript

Henry Garrett, “Chromatic Number and Neutrosophic Chromatic Number”, Preprints 2021,
2021120177 (doi: 10.20944/preprints202112.0177.v1).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2021 0034 | Chromatic Number and Neutrosophic Chromatic Number Manuscript

Henry Garrett, “Chromatic Number and Neutrosophic Chromatic Number”, ResearchGate

2021 (doi: 10.13140/RG.2.2.36035.73766).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2021 0033 | Metric Dimension in fuzzy(neutrosophic) Graphs #12 Manuscript

Henry Garrett, “Metric Dimension in fuzzy(neutrosophic) Graphs #12”, ResearchGate 2021

(doi: 10.13140/RG.2.2.20690.48322).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2021 0032 | Metric Dimension in fuzzy(neutrosophic) Graphs #11 Manuscript

Henry Garrett, “Metric Dimension in fuzzy(neutrosophic) Graphs #11”, ResearchGate 2021

(doi: 10.13140/RG.2.2.29308.46725).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2021 0031 | Metric Dimension in fuzzy(neutrosophic) Graphs #10 Manuscript

Henry Garrett, “Metric Dimension in fuzzy(neutrosophic) Graphs #10”, ResearchGate 2021

(doi: 10.13140/RG.2.2.21614.54085).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn
 9122
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett @gmail.com · Manhattan, NY, USA
2021 0030 | Metric Dimension in fuzzy(neutrosophic) Graphs #9 Manuscript

Henry Garrett, “Metric Dimension in fuzzy(neutrosophic) Graphs #9”, ResearchGate 2021

(doi: 10.13140/RG.2.2.34040.16648).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2021 0029 | Metric Dimension in fuzzy(neutrosophic) Graphs #8 Manuscript

Henry Garrett, “Metric Dimension in fuzzy(neutrosophic) Graphs #8”, ResearchGate 2021

(doi: 10.13140/RG.2.2.19464.96007).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2021 0028 | Metric Dimension in fuzzy(neutrosophic) Graphs-VII Manuscript

Henry Garrett, “Metric Dimension in fuzzy(neutrosophic) Graphs-VII”, ResearchGate 2021

(doi: 10.13140/RG.2.2.14667.72481).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2021 0028 | Metric Dimension in fuzzy(neutrosophic) Graphs-VII Manuscript

Henry Garrett, “Metric Dimension in fuzzy(neutrosophic) Graphs-VII”, Preprints 2021,

2021110142 (doi: 10.20944/preprints202111.0142.v7).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2021 0027 | Metric Dimension in fuzzy(neutrosophic) Graphs-VI Manuscript

Henry Garrett, “Metric Dimension in fuzzy(neutrosophic) Graphs-VI”, Preprints 2021,

2021110142 (doi: 10.20944/preprints202111.0142.v6).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2021 0026 | Metric Dimension in fuzzy(neutrosophic) Graphs-V Manuscript

Henry Garrett, “Metric Dimension in fuzzy(neutrosophic) Graphs-V”, Preprints 2021,

2021110142 (doi: 10.20944/preprints202111.0142.v5).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2021 0025 | Metric Dimension in fuzzy(neutrosophic) Graphs-IV Manuscript

Henry Garrett, “Metric Dimension in fuzzy(neutrosophic) Graphs-IV”, Preprints 2021,

2021110142 (doi: 10.20944/preprints202111.0142.v4).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2021 0024 | Metric Dimension in fuzzy(neutrosophic) Graphs-III Manuscript

Henry Garrett, “Metric Dimension in fuzzy(neutrosophic) Graphs-III”, Preprints 2021,

2021110142 (doi: 10.20944/preprints202111.0142.v3).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2021 0023 | Metric Dimension in fuzzy(neutrosophic) Graphs-II Manuscript

Henry Garrett, “Metric Dimension in fuzzy(neutrosophic) Graphs-II”, Preprints 2021,

2021110142 (doi: 10.20944/preprints202111.0142.v2).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2021 0022 | Metric Dimension in Fuzzy Graphs and Neutrosophic Graphs Manuscript

Henry Garrett, “Metric Dimension in Fuzzy Graphs and Neutrosophic Graphs”, Preprints
2021, 2021110142 (doi: 10.20944/preprints202111.0142.v1)
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2021 0021 | Valued Number And Set Manuscript

Henry Garrett, “Valued Number And Set”, Preprints 2021, 2021080229 (doi:
10.20944/preprints202108.0229.v1).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn
 9123
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett @gmail.com · Manhattan, NY, USA
2021 0020 | Notion of Valued Set Manuscript

Henry Garrett, “Notion of Valued Set”, Preprints 2021, 2021070410 (doi:

10.20944/preprints202107.0410.v1).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2021 0019 | Set And Its Operations Manuscript

Henry Garrett, “Set And Its Operations”, Preprints 2021, 2021060508 (doi:
10.20944/preprints202106.0508.v1).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2021 0018 | Metric Dimensions Of Graphs Manuscript

Henry Garrett, “Metric Dimensions Of Graphs”, Preprints 2021, 2021060392 (doi:

10.20944/preprints202106.0392.v1).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2021 0017 | New Graph Of Graph Manuscript

Henry Garrett, “New Graph Of Graph”, Preprints 2021, 2021060323 (doi:

10.20944/preprints202106.0323.v1).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2021 0016 | Numbers Based On Edges Manuscript

Henry Garrett, “Numbers Based On Edges”, Preprints 2021, 2021060315 (doi:

10.20944/preprints202106.0315.v1).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2021 0015 | Locating And Location Number Manuscript

Henry Garrett, “Locating And Location Number”, Preprints 2021, 2021060206 (doi:
10.20944/preprints202106.0206.v1).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2021 0014 | Big Sets Of Vertices Manuscript

Henry Garrett, “Big Sets Of Vertices”, Preprints 2021, 2021060189 (doi:

10.20944/preprints202106.0189.v1).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2021 0013 | Matroid And Its Outlines Manuscript

Henry Garrett, “Matroid And Its Outlines”, Preprints 2021, 2021060146 (doi:
10.20944/preprints202106.0146.v1).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2021 0012 | Matroid And Its Relations Manuscript

Henry Garrett, “Matroid And Its Relations”, Preprints 2021, 2021060080 (doi:
10.20944/preprints202106.0080.v1).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn

2021 0011 | Metric Number in Dimension Manuscript

Henry Garrett, “Metric Number in Dimension”, Preprints 2021, 2021060004 (doi:

10.20944/preprints202106.0004.v1).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn
 9124
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett @gmail.com · Manhattan, NY, USA

Publications: Books

2023 147 | SuperHyperDuality Amazon

[ADDRESSED CITATION]
[HG147b] Henry Garrett, “SuperHyperDuality”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7637762).
@googlebooks:https://books.google.com/books/about?id=jLCtEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=jLCtEAAAQBAJ
@ResearchGate: https://www.researchgate.net/publication/368473083
@WordPress: https://drhenrygar rett.wordpress.com/2023/02/14/superhyperduality
@Scribd: https://www.scribd.com/document/625758800
@ZENODO_ORG: https://zenodo.org/record/7637762
@academia:https://www.academia.edu/96858234

(Paperback): https://www.amazon.com/dp/B0BVPMX6C4
(Hardcover): https://www.amazon.com/dp/B0BVNTYX6M
(Kindle Edition): https://www.amazon.com/dp/-
ISBN
(Paperback): 9798377344674
(Hardcover): 9798377346043
(Kindle Edition): -
Other Publishers: @googlebooks @GooglePlay @AmazonKindle
Available at @WordPress @ResearchGate @Scribd @academia @ZENODO_ORG @Twitter
@facebook @LinkedIn @Amazon @googlebooks @GooglePlay @AmazonKindle

2023 146 | Trace-Cut In SuperHyperGraphs Amazon

[ADDRESSED CITATION]
[HG146b] Henry Garrett, “Trace-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7766174).
@googlebooks:https://books.google.com/books/about?id=8oW1EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=8oW1EAAAQBAJ
@ResearchGate: https://www.researchgate.net/publication/369479895
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Trace-Cut-In-
SuperHyperGraphs/
@Scribd: https://www.scribd.com/document/-
@ZENODO_ORG: https://zenodo.org/record/7766174
@academia:https://www.academia.edu/99022111

(Paperback): https://www.amazon.com/dp/B0BZJ5ZL59
(Hardcover): https://www.amazon.com/dp/B0BZFJ46Q6
(Kindle Edition): https://www.amazon.com/dp/B0BZF75SF2
ISBN
(Paperback): 9798388172235
(Hardcover): 9798388338693
(Kindle Edition): CC BY-NC-ND 4.0
Other Publishers: @googlebooks @GooglePlay @AmazonKindle
Available at @WordPress @ResearchGate @Scribd @academia @ZENODO_ORG @Twitter
@facebook @LinkedIn @Amazon @googlebooks @GooglePlay @AmazonKindle

2023 145 | Edge-Decomposition In SuperHyperGraphs Amazon

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

[ADDRESSED CITATION]
[HG145b] Henry Garrett, “Edge-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023
(doi: 10.5281/zenodo.7762232).
@googlebooks:https://books.google.com/books/about?id=q021EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=q021EAAAQBAJ
@ResearchGate: https://www.researchgate.net/publication/369452146
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Edge-Neighbor-In-
SuperHyperGraphs/
@Scribd: https://www.scribd.com/document/-
@ZENODO_ORG: https://zenodo.org/record/7762232
@academia:https://www.academia.edu/98969900

(Paperback): https://www.amazon.com/dp/B0BZBY449B
(Hardcover): https://www.amazon.com/dp/B0BZFCBXYR
(Kindle Edition): https://www.amazon.com/dp/B0BZCP4DSW
ISBN
(Paperback): 9798388172235
(Hardcover): 9798388173157
(Kindle Edition): CC BY-NC-ND 4.0
Other Publishers: @googlebooks @GooglePlay @AmazonKindle
Available at @WordPress @ResearchGate @Scribd @academia @ZENODO_ORG @Twitter
@facebook @LinkedIn @Amazon @googlebooks @GooglePlay @AmazonKindle

2023 144 | Edge-Decomposition In SuperHyperGraphs Amazon

[ADDRESSED CITATION]
[HG144b] Henry Garrett, “Edge-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett,
2023 (doi: 10.5281/zenodo.7758601).
@googlebooks:https://books.google.com/books/about?id=5Pm0EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=5Pm0EAAAQBAJ
@ResearchGate: https://www.researchgate.net/publication/369415896
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Edge-Decomposition-In-
SuperHyperGraphs/
@Scribd: https://www.scribd.com/document/-
@ZENODO_ORG: https://zenodo.org/record/7758601
@academia:https://www.academia.edu/98923026

(Paperback): https://www.amazon.com/dp/B0BZBGNQTR
(Hardcover): https://www.amazon.com/dp/B0BZ6SNCXJ
(Kindle Edition): https://www.amazon.com/dp/B0BZ7WZF48
ISBN
(Paperback): 9798388014078
(Hardcover): 9798388014962
(Kindle Edition): CC BY-NC-ND 4.0
Other Publishers: @googlebooks @GooglePlay @AmazonKindle
Available at @WordPress @ResearchGate @Scribd @academia @ZENODO_ORG @Twitter
@facebook @LinkedIn @Amazon @googlebooks @GooglePlay @AmazonKindle

2023 143 | Edge-Cut In SuperHyperGraphs Amazon

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

[ADDRESSED CITATION]
[HG143b] Henry Garrett, “Edge-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7754661).
@googlebooks:https://books.google.com/books/about?id=L u0EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=L u0EAAAQBAJ
@ResearchGate: https://www.researchgate.net/publication/369382238
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Edge-Cut-In-
SuperHyperGraphs/
@Scribd: https://www.scribd.com/document/-
@ZENODO_ORG: https://zenodo.org/record/7754661
@academia:https://www.academia.edu/98876376

(Paperback): https://www.amazon.com/dp/B0BZ324MLT
(Hardcover): https://www.amazon.com/dp/B0BZ34DF21
(Kindle Edition): https://www.amazon.com/dp/B0BZ3Z9J8W
ISBN
(Paperback): 9798387863837
(Hardcover): 9798387865688
(Kindle Edition): CC BY-NC-ND 4.0
Other Publishers: @googlebooks @GooglePlay @AmazonKindle
Available at @WordPress @ResearchGate @Scribd @academia @ZENODO_ORG @Twitter
@facebook @LinkedIn @Amazon @googlebooks @GooglePlay @AmazonKindle

2023 142 | Vertex-Neighbor In SuperHyperGraphs Amazon

[ADDRESSED CITATION]
[HG142b] Henry Garrett, “Vertex-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023
(doi: 10.5281/zenodo.7750995).
@googlebooks:https://books.google.com/books/about?id=5JO0EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=5JO0EAAAQBAJ
@ResearchGate: https://www.researchgate.net/publication/369369191
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Vertex-Neighbor-In-
SuperHyperGraphs/
@Scribd: https://www.scribd.com/document/-
@ZENODO_ORG: https://zenodo.org/record/7750995
@academia:https://www.academia.edu/98811872

(Paperback): https://www.amazon.com/dp/B0BYR8YN3V
(Hardcover): https://www.amazon.com/dp/B0BYRL26L7
(Kindle Edition): https://www.amazon.com/dp/B0BYYW89VD
ISBN
(Paperback): 9798387725944
(Hardcover): 9798387727511
(Kindle Edition): CC BY-NC-ND 4.0
Other Publishers: @googlebooks @GooglePlay @AmazonKindle
Available at @WordPress @ResearchGate @Scribd @academia @ZENODO_ORG @Twitter
@facebook @LinkedIn @Amazon @googlebooks @GooglePlay @AmazonKindle

2023 141 | Vertex-Decomposition In SuperHyperGraphs Amazon

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

[ADDRESSED CITATION]
[HG141b] Henry Garrett, “Vertex-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett,
2023 (doi: 10.5281/zenodo.7749875).
@googlebooks:https://books.google.com/books/about?id=-oS0EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=-oS0EAAAQBAJ
@ResearchGate: https://www.researchgate.net/publication/369361689
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Vertex-Decomposition-In-
SuperHyperGraphs/
@Scribd: https://www.scribd.com/document/-
@ZENODO_ORG: https://zenodo.org/record/7749875
@academia:https://www.academia.edu/98766669

(Paperback): https://www.amazon.com/dp/B0BYR862GV
(Hardcover): https://www.amazon.com/dp/B0BYR7TZXZ
(Kindle Edition): https://www.amazon.com/dp/B0BYX3144B
ISBN
(Paperback): 9798387614910
(Hardcover): 9798387616792
(Kindle Edition): CC BY-NC-ND 4.0
Other Publishers: @googlebooks @GooglePlay @AmazonKindle
Available at @WordPress @ResearchGate @Scribd @academia @ZENODO_ORG @Twitter
@facebook @LinkedIn @Amazon @googlebooks @GooglePlay @AmazonKindle

2023 140 | Vertex-Cut In SuperHyperGraphs Amazon

[ADDRESSED CITATION]
[HG140b] Henry Garrett, “Vertex-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7747236).
@googlebooks:https://books.google.com/books/about?id=fmC0EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=fmC0EAAAQBAJ
@ResearchGate: https://www.researchgate.net/publication/369328181
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Vertex-Cut-In-
SuperHyperGraphs/
@Scribd: https://www.scribd.com/document/-
@ZENODO_ORG: https://zenodo.org/record/7747236
@academia:https://www.academia.edu/98708467

(Paperback): https://www.amazon.com/dp/B0BYRC9P2F
(Hardcover): https://www.amazon.com/dp/B0BYR7YKMC
(Kindle Edition): https://www.amazon.com/dp/B0BYX1HCTN
ISBN
(Paperback): 9798387610660
(Hardcover): 9798387611964
(Kindle Edition): CC BY-NC-ND 4.0
Other Publishers: @googlebooks @GooglePlay @AmazonKindle
Available at @WordPress @ResearchGate @Scribd @academia @ZENODO_ORG @Twitter
@facebook @LinkedIn @Amazon @googlebooks @GooglePlay @AmazonKindle

2023 139 | Stable-Neighbor In SuperHyperGraphs Amazon

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

[ADDRESSED CITATION]
[HG139b] Henry Garrett, “Stable-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023
(doi: 10.5281/zenodo.7742587).
@googlebooks:https://books.google.com/books/about?id=5y60EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=5y60EAAAQBAJ
@ResearchGate: https://www.researchgate.net/publication/369299197
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Stable-Neighbor-In-
SuperHyperGraphs/
@Scribd: https://www.scribd.com/document/-
@ZENODO_ORG: https://zenodo.org/record/7742587
@academia:https://www.academia.edu/98651864

(Paperback): https://www.amazon.com/dp/B0BYR5PWBJ
(Hardcover): https://www.amazon.com/dp/B0BYRBV5KL
(Kindle Edition): https://www.amazon.com/dp/B0BYVK1CCH
ISBN
(Paperback): 9798387498947
(Hardcover): 9798387510786
(Kindle Edition): CC BY-NC-ND 4.0
Other Publishers: @googlebooks @GooglePlay @AmazonKindle
Available at @WordPress @ResearchGate @Scribd @academia @ZENODO_ORG @Twitter
@facebook @LinkedIn @Amazon @googlebooks @GooglePlay @AmazonKindle

2023 138 | Stable-Decompositions In SuperHyperGraphs Amazon

[ADDRESSED CITATION]
[HG138b] Henry Garrett, “Stable-Decompositions In SuperHyperGraphs”. Dr. Henry Garrett,
2023 (doi: 10.5281/zenodo.7738635).
@googlebooks:https://books.google.com/books/about?id=q-CzEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=q-CzEAAAQBAJ
@ResearchGate: https://www.researchgate.net/publication/369261059
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Stable-Decompositions-In-
SuperHyperGraphs/
@Scribd: https://www.scribd.com/document/-
@ZENODO_ORG: https://zenodo.org/record/7738635
@academia:https://www.academia.edu/98588820

(Paperback): https://www.amazon.com/dp/B0BYR86GDV
(Hardcover): https://www.amazon.com/dp/B0BYR5GCRQ
(Kindle Edition): https://www.amazon.com/dp/B0BYVFCRJ3
ISBN
(Paperback): 9798387492839
(Hardcover): 9798387495489
(Kindle Edition): CC BY-NC-ND 4.0
Other Publishers: @googlebooks @GooglePlay @AmazonKindle
Available at @WordPress @ResearchGate @Scribd @academia @ZENODO_ORG @Twitter
@facebook @LinkedIn @Amazon @googlebooks @GooglePlay @AmazonKindle

2023 137 | Stable-Cut In SuperHyperGraphs Amazon

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

[ADDRESSED CITATION]
[HG137b] Henry Garrett, “Stable-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7734719).
@googlebooks:https://books.google.com/books/about?id=oKmzEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=oKmzEAAAQBAJ
@ResearchGate: https://www.researchgate.net/publication/369218730
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Stable-Cut-In-
SuperHyperGraphs/
@Scribd: https://www.scribd.com/document/-
@ZENODO_ORG: https://zenodo.org/record/7734719
@academia:https://www.academia.edu/98525953

(Paperback): https://www.amazon.com/dp/B0BYRNDT1Z
(Hardcover): https://www.amazon.com/dp/B0BYR5GF4P
(Kindle Edition): https://www.amazon.com/dp/B0BYS8MJD6
ISBN
(Paperback): 9798387367335
(Hardcover): 9798387369513
(Kindle Edition): CC BY-NC-ND 4.0
Other Publishers: @googlebooks @GooglePlay @AmazonKindle
Available at @WordPress @ResearchGate @Scribd @academia @ZENODO_ORG @Twitter
@facebook @LinkedIn @Amazon @googlebooks @GooglePlay @AmazonKindle

2023 136 | Clique-Neighbors In SuperHyperGraphs Amazon

[ADDRESSED CITATION]
[HG136b] Henry Garrett, “Clique-Neighbors In SuperHyperGraphs”. Dr. Henry Garrett, 2023
(doi: 10.5281/zenodo.7730484).
@googlebooks:https://books.google.com/books/about?id=NXyzEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=NXyzEAAAQBAJ
@ResearchGate: https://www.researchgate.net/publication/369197009
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Clique-Neighbors-In-
SuperHyperGraphs/
@Scribd: https://www.scribd.com/document/-
@ZENODO_ORG: https://zenodo.org/record/7730484
@academia:https://www.academia.edu/98461177

(Paperback): https://www.amazon.com/dp/B0BYM8JSFJ
(Hardcover): https://www.amazon.com/dp/B0BYLPSR1C
(Kindle Edition): https://www.amazon.com/dp/B0BYBQK51T
ISBN
(Paperback): 9798386938741
(Hardcover): 9798386938772
(Kindle Edition): CC BY-NC-ND 4.0
Other Publishers: @googlebooks @GooglePlay @AmazonKindle
Available at @WordPress @ResearchGate @Scribd @academia @ZENODO_ORG @Twitter
@facebook @LinkedIn @Amazon @googlebooks @GooglePlay @AmazonKindle

2023 135 | Clique-Decompositions In SuperHyperGraphs Amazon

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

[ADDRESSED CITATION]
[HG135b] Henry Garrett, “Clique-Decompositions In SuperHyperGraphs”. Dr. Henry Garrett,
2023 (doi: 10.5281/zenodo.7730469).
@googlebooks:https://books.google.com/books/about?id=D3yzEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=D3yzEAAAQBAJ
@ResearchGate: https://www.researchgate.net/publication/369196874
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Clique-Decompositions-In-
SuperHyperGraphs/
@Scribd: https://www.scribd.com/document/-
@ZENODO_ORG: https://zenodo.org/record/7730469
@academia:https://www.academia.edu/98460405

(Paperback): https://www.amazon.com/dp/B0BYM1CV3S
(Hardcover): https://www.amazon.com/dp/B0BYLXRXTJ
(Kindle Edition): https://www.amazon.com/dp/B0BY5R8ZGJ
ISBN
(Paperback): 9798386938598
(Hardcover): 9798386938635
(Kindle Edition): CC BY-NC-ND 4.0
Other Publishers: @googlebooks @GooglePlay @AmazonKindle
Available at @WordPress @ResearchGate @Scribd @academia @ZENODO_ORG @Twitter
@facebook @LinkedIn @Amazon @googlebooks @GooglePlay @AmazonKindle

2023 134 | Clique-Cut In SuperHyperGraphs Amazon

[ADDRESSED CITATION]
[HG134b] Henry Garrett, “Clique-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7722865).
@googlebooks:https://books.google.com/books/about?id=BEuzEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=BEuzEAAAQBAJ
@ResearchGate: https://www.researchgate.net/publication/369158764
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Clique-Cut-In-
SuperHyperGraphs/
@Scribd: https://www.scribd.com/document/-
@ZENODO_ORG: https://zenodo.org/record/7722865
@academia:https://www.academia.edu/98325436

(Paperback): https://www.amazon.com/dp/B0BYLPSHS5
(Hardcover): https://www.amazon.com/dp/B0BYM4QTKG
(Kindle Edition): https://www.amazon.com/dp/B0BY5R8ZGJ
ISBN
(Paperback): 9798386709860
(Hardcover): 9798386709891
(Kindle Edition): CC BY-NC-ND 4.0
Other Publishers: @googlebooks @GooglePlay @AmazonKindle
Available at @WordPress @ResearchGate @Scribd @academia @ZENODO_ORG @Twitter
@facebook @LinkedIn @Amazon @googlebooks @GooglePlay @AmazonKindle

2023 133 | Space In SuperHyperGraphs Amazon

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

[ADDRESSED CITATION]
[HG133b] Henry Garrett, “Space In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7713563).
@googlebooks:https://books.google.com/books/about?id=je-yEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=je-yEAAAQBAJ
@ResearchGate: https://www.researchgate.net/publication/369113296
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/List-Coloring-In-
SuperHyperGraphs/
@Scribd: https://www.scribd.com/document/-
@ZENODO_ORG: https://zenodo.org/record/7713563
@academia:https://www.academia.edu/98231645

(Paperback): https://www.amazon.com/dp/B0BXNPGDB5
(Hardcover): https://www.amazon.com/dp/B0BXNCSNBJ
(Kindle Edition): https://www.amazon.com/dp/B0BXYYCS5H
ISBN
(Paperback): 9798386468965
(Hardcover): 9798386469030
(Kindle Edition): CC BY-NC-ND 4.0
Other Publishers: @googlebooks @GooglePlay @AmazonKindle
Available at @WordPress @ResearchGate @Scribd @academia @ZENODO_ORG @Twitter
@facebook @LinkedIn @Amazon @googlebooks @GooglePlay @AmazonKindle

2023 0132 | Space In SuperHyperGraphs Amazon

[ADDRESSED CITATION]
[HG132b] Henry Garrett, “Space In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7709116).
@googlebooks:https://books.google.com/books/about?id=M56yEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=M56yEAAAQBAJ
@ResearchGate: https://www.researchgate.net/publication/369088066
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Space-In-
SuperHyperGraphs/
@Scribd: https://www.scribd.com/document/-
@ZENODO_ORG: https://zenodo.org/record/7709116
@academia:https://www.academia.edu/98169374

(Paperback): https://www.amazon.com/dp/B0BW35YC1H
(Hardcover): https://www.amazon.com/dp/B0BW35YC1Z
(Kindle Edition): https://www.amazon.com/dp/B0BWT68375
ISBN
(Paperback): 9798378898794
(Hardcover): 9798378899913
(Kindle Edition): CC BY-NC-ND 4.0
Other Publishers: @googlebooks @GooglePlay @AmazonKindle
Available at @WordPress @ResearchGate @Scribd @academia @ZENODO_ORG @Twitter
@facebook @LinkedIn @Amazon @googlebooks @GooglePlay @AmazonKindle

2023 131 | Edge-Connectivity In SuperHyperGraphs Amazon

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

[ADDRESSED CITATION]
[HG131b] Henry Garrett, “Edge-Connectivity In SuperHyperGraphs”. Dr. Henry Garrett, 2023
(doi: 10.5281/zenodo.7706415).
@googlebooks:https://books.google.com/books/about?id=9XKyEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=9XKyEAAAQBAJ
@ResearchGate: https://www.researchgate.net/publication/369061525
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Edge-Connectivity-In-
SuperHyperGraphs/
@Scribd: https://www.scribd.com/document/-
@ZENODO_ORG: https://zenodo.org/record/7706415
@academia:https://www.academia.edu/98110249

(Paperback): https://www.amazon.com/dp/B0BXNDNSNQ
(Hardcover): https://www.amazon.com/dp/B0BXN418BY
(Kindle Edition): https://www.amazon.com/dp/B0BXQTPCWV
ISBN
(Paperback): 9798386227593
(Hardcover): 9798386229306
(Kindle Edition): CC BY-NC-ND 4.0
Other Publishers: @googlebooks @GooglePlay @AmazonKindle
Available at @WordPress @ResearchGate @Scribd @academia @ZENODO_ORG @Twitter
@facebook @LinkedIn @Amazon @googlebooks @GooglePlay @AmazonKindle

2023 130 | Vertex-Connectivity In SuperHyperGraphs Amazon

[ADDRESSED CITATION]
[HG130b] Henry Garrett, “Vertex-Connectivity In SuperHyperGraphs”. Dr. Henry Garrett,
2023 (doi: 10.5281/zenodo.7706063).
@googlebooks:https://books.google.com/books/about?id=12myEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=12myEAAAQBAJ
@ResearchGate: https://www.researchgate.net/publication/369056407
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Vertex-Connectivity-In-
SuperHyperGraphs/
@Scribd: https://www.scribd.com/document/-
@ZENODO_ORG: https://zenodo.org/record/7706063
@academia:https://www.academia.edu/98106677

(Paperback): https://www.amazon.com/dp/B0BXN7F5VZ
(Hardcover): https://www.amazon.com/dp/B0BXN6NP8X
(Kindle Edition): https://www.amazon.com/dp/B0BXR1ZMKJ
ISBN
(Paperback): 9798386225056
(Hardcover): 9798386225872
(Kindle Edition): CC BY-NC-ND 4.0
Other Publishers: @googlebooks @GooglePlay @AmazonKindle
Available at @WordPress @ResearchGate @Scribd @academia @ZENODO_ORG @Twitter
@facebook @LinkedIn @Amazon @googlebooks @GooglePlay @AmazonKindle

2023 129 | Tree-Decomposition In SuperHyperGraphs Amazon

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

[ADDRESSED CITATION]
[HG129b] Henry Garrett, “Tree-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett,
2023 (doi: 10.5281/zenodo.7701906).
@googlebooks:https://books.google.com/books/about?id=FBmyEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=FBmyEAAAQBAJ
@ResearchGate: https://www.researchgate.net/publication/369030758
@WordPress: https://drhenrygarrett.wordpress.com/2023/02/04/22/Tree-Decomposition-In-
SuperHyperGraphs/
@Scribd: https://www.scribd.com/document/-
@ZENODO_ORG: https://zenodo.org/record/7701906
@academia:https://www.academia.edu/98028132

(Paperback): https://www.amazon.com/dp/B0BXN4X4MD
(Hardcover): https://www.amazon.com/dp/B0BXNK5C1D
(Kindle Edition): https://www.amazon.com/dp/B0BXM1FT1M
ISBN
(Paperback): 9798386069155
(Hardcover): 9798386070076
(Kindle Edition): CC BY-NC-ND 4.0
Other Publishers: @googlebooks @GooglePlay @AmazonKindle
Available at @WordPress @ResearchGate @Scribd @academia @ZENODO_ORG @Twitter
@facebook @LinkedIn @Amazon @googlebooks @GooglePlay @AmazonKindle

2023 128 | Chord In SuperHyperGraphs Amazon

[ADDRESSED CITATION]
[HG128b] Henry Garrett, “Chord In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7700205).
@googlebooks:https://books.google.com/books/about?id=mfSxEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=mfSxEAAAQBAJ
@ResearchGate: https://www.researchgate.net/publication/369020170
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Chord-In-
SuperHyperGraphs/
@Scribd: https://www.scribd.com/document/-
@ZENODO_ORG: https://zenodo.org/record/7700205
@academia:https://www.academia.edu/97979798

(Paperback): https://www.amazon.com/dp/B0BW3HR3CT
(Hardcover): https://www.amazon.com/dp/B0BW2KMGVJ
(Kindle Edition): https://www.amazon.com/dp/B0BXJYTWD3
ISBN
(Paperback): 9798385981755
(Hardcover): 9798385984046
(Kindle Edition): CC BY-NC-ND 4.0
Other Publishers: @googlebooks @GooglePlay @AmazonKindle
Available at @WordPress @ResearchGate @Scribd @academia @ZENODO_ORG @Twitter
@facebook @LinkedIn @Amazon @googlebooks @GooglePlay @AmazonKindle

2023 127 | (i,j)-Domination In SuperHyperGraphs Amazon

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

[ADDRESSED CITATION]
[HG127b] Henry Garrett, “(i,j)-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023
(doi: 10.5281/zenodo.7694876).
@googlebooks:https://books.google.com/books/about?id=QoexEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=QoexEAAAQBAJ
@ResearchGate: https://www.researchgate.net/publication/368926300
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/(i,j)-Number-In-
SuperHyperGraphs/
@Scribd: https://www.scribd.com/document/-
@ZENODO_ORG: https://zenodo.org/record/7694876
@academia:https://www.academia.edu/97844412

(Paperback): https://www.amazon.com/dp/B0BW2GWHR4
(Hardcover): https://www.amazon.com/dp/B0BW3HG682
(Kindle Edition): https://www.amazon.com/dp/B0BXDK4WLM
ISBN
(Paperback): 9798385701025
(Hardcover): 9798385701797
(Kindle Edition): CC BY-NC-ND 4.0
Other Publishers: @googlebooks @GooglePlay @AmazonKindle
Available at @WordPress @ResearchGate @Scribd @academia @ZENODO_ORG @Twitter
@facebook @LinkedIn @Amazon @googlebooks @GooglePlay @AmazonKindle

2023 0126 | Edge-Domination In SuperHyperGraphs Amazon

[ADDRESSED CITATION]
[HG126b] Henry Garrett, “Edge-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023
(doi: 10.5281/zenodo.7679410).
@googlebooks:https://books.google.com/books/about?id=PEiwEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=PEiwEAAAQBAJ
@ResearchGate: https://www.researchgate.net/publication/368825019
@WordPress: https://drhenrygarrett.wordpress.com/2023/02/28/Edge-Domination-In-
SuperHyperGraphs/
@Scribd: https://www.scribd.com/document/-
@ZENODO_ORG: https://zenodo.org/record/7679410
@academia:https://www.academia.edu/97585794

(Paperback): https://www.amazon.com/dp/B0BW2QM56Q
(Hardcover): https://www.amazon.com/dp/B0BW3GJNWL
(Kindle Edition): https://www.amazon.com/dp/B0BWWXGLX6
ISBN
(Paperback): 9798379089597
(Hardcover): 9798379090531
(Kindle Edition): CC BY-NC-ND 4.0
Other Publishers: @googlebooks @GooglePlay @AmazonKindle
Available at @WordPress @ResearchGate @Scribd @academia @ZENODO_ORG @Twitter
@facebook @LinkedIn @Amazon @googlebooks @GooglePlay @AmazonKindle

2023 0125 | K-Domination In SuperHyperGraphs Amazon

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

[ADDRESSED CITATION]
[HG125b] Henry Garrett, “K-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7675982).
@googlebooks:https://books.google.com/books/about?id=WyKwEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=WyKwEAAAQBAJ
@ResearchGate: https://www.researchgate.net/publication/368786505
@WordPress: https://drhenrygarrett.wordpress.com/2023/02/27/K-Number-In-
SuperHyperGraphs/
@Scribd: https://www.scribd.com/document/-
@ZENODO_ORG: https://zenodo.org/record/7675982
@academia:https://www.academia.edu/97486391

(Paperback): https://www.amazon.com/dp/B0BW35YC1H
(Hardcover): https://www.amazon.com/dp/B0BW35YC1Z
(Kindle Edition): https://www.amazon.com/dp/B0BWT68375
ISBN
(Paperback): 9798378898794
(Hardcover): 9798378899913
(Kindle Edition): CC BY-NC-ND 4.0
Other Publishers: @googlebooks @GooglePlay @AmazonKindle
Available at @WordPress @ResearchGate @Scribd @academia @ZENODO_ORG @Twitter
@facebook @LinkedIn @Amazon @googlebooks @GooglePlay @AmazonKindle

2023 124 | K-Number In SuperHyperGraphs Amazon

[ADDRESSED CITATION]
[HG124b] Henry Garrett, “K-Number In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7672388).
@googlebooks:https://books.google.com/books/about?id=TtCvEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=TtCvEAAAQBAJ
@ResearchGate: https://www.researchgate.net/publication/368754006
@WordPress: https://drhenrygarrett.wordpress.com/2023/02/25/K-Number-In-
SuperHyperGraphs/
@Scribd: https://www.scribd.com/document/- @ZENODO_ORG:
https://zenodo.org/record/7672388
@academia:https://www.academia.edu/97432495

(Paperback): https://www.amazon.com/dp/B0BW32LV1S
(Hardcover): https://www.amazon.com/dp/B0BW31GSZB
(Kindle Edition): https://www.amazon.com/dp/B0BWR36VFF
ISBN
(Paperback): 9798378775477
(Hardcover): 9798378776733
(Kindle Edition): CC BY-NC-ND 4.0
Other Publishers: @googlebooks @GooglePlay @AmazonKindle
Available at @WordPress @ResearchGate @Scribd @academia @ZENODO_ORG @Twitter
@facebook @LinkedIn @Amazon @googlebooks @GooglePlay @AmazonKindle

2023 123 | Order In SuperHyperGraphs Amazon

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

[ADDRESSED CITATION]
[HG123b] Henry Garrett, “Order In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7668648).
@googlebooks:https://books.google.com/books/about?id=U56vEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=U56vEAAAQBAJ
@ResearchGate: https://www.researchgate.net/publication/368719055
@WordPress: https://drhenrygarrett.wordpress.com/2023/02/25/Order-In-
SuperHyperGraphs/
@Scribd: https://www.scribd.com/document/-
@ZENODO_ORG: https://zenodo.org/record/7668648
@academia:https://www.academia.edu/97378945

(Paperback): https://www.amazon.com/dp/B0BW2KJKJD
(Hardcover): https://www.amazon.com/dp/B0BW2BSXTG
(Kindle Edition): https://www.amazon.com/dp/B0BWMKNH7H
ISBN
(Paperback): 9798378647705
(Hardcover): 9798378648146
(Kindle Edition): CC BY-NC-ND 4.0
Other Publishers: @googlebooks @GooglePlay @AmazonKindle
Available at @WordPress @ResearchGate @Scribd @academia @ZENODO_ORG @Twitter
@facebook @LinkedIn @Amazon @googlebooks @GooglePlay @AmazonKindle

2023 122 | Coloring In SuperHyperGraphs Amazon

[ADDRESSED CITATION]
[HG122b] Henry Garrett, “Coloring In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7662810).
@googlebooks:https://books.google.com/books/about?id=jGavEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=jGavEAAAQBAJ
@ResearchGate: https://www.researchgate.net/publication/368686304
@WordPress: https://drhenrygarrett.wordpress.com/2023/02/22/Coloring-In-
SuperHyperGraphs/
@Scribd: https://www.scribd.com/document/-
@ZENODO_ORG: https://zenodo.org/record/7662810
@academia:https://www.academia.edu/97307977

(Paperback): https://www.amazon.com/dp/B0BW28MKQP
(Hardcover): https://www.amazon.com/dp/B0BW35Y9YW
(Kindle Edition): https://www.amazon.com/dp/B0BWN81GT3
ISBN
(Paperback): 9798378499175
(Hardcover): 9798378499717
(Kindle Edition): CC BY-NC-ND 4.0
Other Publishers: @googlebooks @GooglePlay @AmazonKindle
Available at @WordPress @ResearchGate @Scribd @academia @ZENODO_ORG @Twitter
@facebook @LinkedIn @Amazon @googlebooks @GooglePlay @AmazonKindle

2023 121 || “Dimension In SuperHyperGraphs” Amazon

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

[ADDRESSED CITATION]
[HG9121b] Henry Garrett, “Dimension In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7659162).

@googlebooks:https://books.google.com/books/about?id=nAOvEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=nAOvEAAAQBAJ
@ResearchGate: https://www.researchgate.net/publication/368663443
@WordPress: https://drhenrygarrett.wordpress.com/2023/02/22/Dimension-In-
SuperHyperGraphs/
@Scribd: https://www.scribd.com/document/-
@ZENODO_ORG: https://zenodo.org/record/7659162
@academia:https://www.academia.edu/97246270
(Paperback): https://www.amazon.com/dp/B0BW38DB6M
(Hardcover): https://www.amazon.com/dp/B0BW2KMB1J
(Kindle Edition): https://www.amazon.com/dp/B0BWCW6KJL
ISBN
(Paperback): 9798378343188
(Hardcover): 9798378343812
(Kindle Edition): CC BY-NC-ND 4.0
Other Publishers: @googlebooks @GooglePlay @AmazonKindle
Available at @WordPress @ResearchGate @Scribd @academia @ZENODO_ORG @Twitter
@facebook @LinkedIn @Amazon @googlebooks @GooglePlay @AmazonKindle

2023 120 || “Cancer In SuperHyperGraphs” Amazon

[ADDRESSED CITATION]
[HG120b] Henry Garrett, “Cancer In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7653233).

@googlebooks:https://books.google.com/books/about?id=ZdmuEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=ZdmuEAAAQBAJ
@ResearchGate:https://www.researchgate.net/publication/368635240
@WordPress:https://drhenrygarrett.wordpress.com/2023/02/19/Cancer-in-
SuperHyperGraphs/
@Scribd:https://www.scribd.com/document/-
@ZENODO_ORG:https://zenodo.org/record/7653233
@academia:https://www.academia.edu/97119655
|| Cancer in SuperHyperGraphs
Link (Paperback): https://www.amazon.com/dp/B0BW3BK14G
(Hardcover): https://www.amazon.com/dp/B0BW2K9GPL (Kindle Edition):
https://www.amazon.com/dp/B0BW6JCNY1
ISBN (Paperback): 9798378064847 (Hardcover): 9798378065530 (Kindle Edition): CC BY-NC-
ND 4.0
Other Publishers: @googlebooks @GooglePlay @AmazonKindle
Available at @WordPress @ResearchGate @Scribd @academia @ZENODO_ORG @Twitter
@facebook @LinkedIn @Amazon @googlebooks @GooglePlay @AmazonKindle

2023 0119 || “SuperHyperWheel” Amazon

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

[ADDRESSED CITATION]
[HG119b] Henry Garrett, “SuperHyperWheel”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7653204).

SuperHyperWheel
@googlebooks:https://books.google.com/books/about?id=S9muEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=S9muEAAAQBAJ
@ResearchGate:https://www.researchgate.net/publication/368635238
@WordPress:https://drhenrygarrett.wordpress.com/2023/02/19/SuperHyperWheel/
@Scribd:https://www.scribd.com/document/-
@ZENODO_ORG:https://zenodo.org/record/7653204
@academia:https://www.academia.edu/97118644
|| SuperHyperWheel
Link (Paperback): https://www.amazon.com/dp/B0BW2BX6X1
(Hardcover): https://www.amazon.com/dp/B0BW23H1M2 (Kindle Edition):
https://www.amazon.com/dp/B0BW6H5TVG
ISBN (Paperback): 9798378062782 (Hardcover): 9798378063413 (Kindle Edition): CC BY-NC-
ND 4.0
Other Publishers: @googlebooks @GooglePlay @AmazonKindle
Available at @WordPress @ResearchGate @Scribd @academia @ZENODO_ORG @Twitter
@facebook @LinkedIn @Amazon @googlebooks @GooglePlay @AmazonKindle

2023 0118 || “SuperHyperMultipartite” Amazon

[ADDRESSED CITATION]
[HG118b] Henry Garrett, “SuperHyperMultipartite”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7653142).

SuperHyperMultipartite
@googlebooks:https://books.google.com/books/about?id=SdmuEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=SdmuEAAAQBAJ
@ResearchGate:https://www.researchgate.net/publication/368635237
@WordPress:https://drhenrygarrett.wordpress.com/2023/02/19/SuperHyperMultipartite/
@Scribd:https://www.scribd.com/document/-
@ZENODO_ORG:https://zenodo.org/record/7653142
@academia:https://www.academia.edu/97116637
|| SuperHyperMultipartite
Link (Paperback): https://www.amazon.com/dp/B0BW358WXN
(Hardcover): https://www.amazon.com/dp/B0BW2CR178 (Kindle Edition):
https://www.amazon.com/dp/B0BW6FTXNH
ISBN (Paperback): 9798378058433 (Hardcover): 9798378060603 (Kindle Edition): CC BY-NC-
ND 4.0

2023 0117 || “SuperHyperBipartite” Amazon

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

[ADDRESSED CITATION]
[HG117b] Henry Garrett, “SuperHyperBipartite”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7653117).

SuperHyperBipartite
@googlebooks:https://books.google.com/books/about?id=s9iuEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=s9iuEAAAQBAJ
@ResearchGate:https://www.researchgate.net/publication/368635080
@WordPress:https://drhenrygarrett.wordpress.com/2023/02/19/SuperHyperBipartite/
@Scribd: https://www.scribd.com/document/-
@ZENODO_ORG:https://zenodo.org/record/7653117
@academia:https://www.academia.edu/97115621
|| SuperHyperBipartite
Link (Paperback): https://www.amazon.com/dp/B0BW267JRF
(Hardcover): https://www.amazon.com/dp/B0BW2ZSL9D (Kindle Edition):
https://www.amazon.com/dp/B0BW6G294W
ISBN (Paperback): 9798378056668 (Hardcover): 9798378057382 (Kindle Edition): CC BY-NC-
ND 4.0
Other Publishers: @googlebooks @GooglePlay @AmazonKindle
Available at @WordPress @ResearchGate @Scribd @academia @ZENODO_ORG @Twitter
@facebook @LinkedIn @Amazon @googlebooks @GooglePlay @AmazonKindle

2023 0116 || “SuperHyperStar” Amazon

[ADDRESSED CITATION]
[HG116b] Henry Garrett, “SuperHyperStar”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7653089).

SuperHyperStar
@googlebooks:https://books.google.com/books/about?id=8deuEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=8deuEAAAQBAJ
@ResearchGate:https://www.researchgate.net/publication/368635077
@WordPress:https://drhenrygarrett.wordpress.com/2023/02/19/SuperHyperStar/
@Scribd: https://www.scribd.com/document/-
@ZENODO_ORG:https://zenodo.org/record/7653089
@academia:https://www.academia.edu/97114710
|| SuperHyperStar
Link (Paperback): https://www.amazon.com/dp/B0BW2XKM25
(Hardcover): https://www.amazon.com/dp/B0BW2RKDDX (Kindle Edition):
https://www.amazon.com/dp/B0BW6CTTXM
ISBN (Paperback): 9798378054114 (Hardcover): 9798378054794 (Kindle Edition): CC BY-NC-
ND 4.0

2023 0115 || “SuperHyperCycle” Amazon

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

[ADDRESSED CITATION]
[HG115b] Henry Garrett, “SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7651687).

SuperHyperCycle
@googlebooks:https://books.google.com/books/about?id=u8SuEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=u8SuEAAAQBAJ
@ResearchGate:https://www.researchgate.net/publication/368605636
@WordPress:https://drhenrygarrett.wordpress.com/2023/02/18/SuperHyperCycle/
@Scribd: https://www.scribd.com/document/-
@ZENODO_ORG:https://zenodo.org/record/7651687
@academia:https://www.academia.edu/97088922
|| SuperHyperCycle
Link (Paperback): https://www.amazon.com/dp/B0BW2XKLRW
(Hardcover): https://www.amazon.com/dp/B0BW2R9SSF (Kindle Edition):
https://www.amazon.com/dp/B0BW5G2J68
ISBN (Paperback): 9798377968702 (Hardcover): 9798377969389 (Kindle Edition): CC BY-NC-
ND 4.0

2023 0114 || “SuperHyperPath” Amazon

[ADDRESSED CITATION]
[HG114b] Henry Garrett, “SuperHyperPath”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7651619).

SuperHyperPath
@googlebooks:https://books.google.com/books/about?id=t8SuEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=t8SuEAAAQBAJ
@ResearchGate:https://www.researchgate.net/publication/368603223
@WordPress:https://drhenrygarrett.wordpress.com/2023/02/18/SuperHyperPath/
@Scribd: https://www.scribd.com/document/626446734
@ZENODO_ORG:https://zenodo.org/record/7651619
@academia:https://www.academia.edu/97086960
|| SuperHyperPath
Link (Paperback): https://www.amazon.com/dp/B0BW2B6DPZ
(Hardcover): https://www.amazon.com/dp/B0BW2B6DP3 (Kindle Edition):
https://www.amazon.com/dp/B0BW5D6T17
ISBN (Paperback): 9798377967279 (Hardcover): 9798377967736 (Kindle Edition): CC BY-NC-
ND 4.0
Other Publishers: @googlebooks @GooglePlay @AmazonKindle
Available at @WordPress @ResearchGate @Scribd @academia @ZENODO_ORG @Twitter
@facebook @LinkedIn @Amazon @googlebooks @GooglePlay @AmazonKindle

2023 0113 || “SuperHyperDomination” Amazon

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

[ADDRESSED CITATION]
[HG113b] Henry Garrett, “SuperHyperDomination”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7651439).

SuperHyperDomination
@googlebooks:https://books.google.com/books/about?id=scSuEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=scSuEAAAQBAJ
@ResearchGate:https://www.researchgate.net/publication/368600285
@WordPress:https://drhenrygarrett.wordpress.com/2023/02/18/SuperHyperDomination/
@Scribd: https://www.scribd.com/document/-
@ZENODO_ORG:https://zenodo.org/record/7651439
@academia:https://www.academia.edu/97082532
|| SuperHyperDomination
Link (Paperback): https://www.amazon.com/dp/B0BW2R9STC
(Hardcover): https://www.amazon.com/dp/B0BW3BJZRF (Kindle Edition):
https://www.amazon.com/dp/B0BW5FPZC8
ISBN (Paperback): 9798377964575 (Hardcover): 9798377965657 (Kindle Edition): CC BY-NC-
ND 4.0

2023 0112 || “SuperHyperDominating” Amazon

[ADDRESSED CITATION]
[HG112b] Henry Garrett, “SuperHyperDominating”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7650729).

SuperHyperDominating
@googlebooks:https://books.google.com/books/about?id=17uuEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=17uuEAAAQBAJ
@ResearchGate:https://www.researchgate.net/publication/368600285
@WordPress:https://drhenrygarrett.wordpress.com/2023/02/18/SuperHyperDominating/
@Scribd: https://www.scribd.com/document/626391525
@ZENODO_ORG:https://zenodo.org/record/7650729
@academia:https://www.academia.edu/97071295
|| SuperHyperDominating
Link (Paperback): https://www.amazon.com/dp/B0BW2K99NB (Hardcover):
https://www.amazon.com/dp/B0BW2PWT1G (Kindle Edition):
https://www.amazon.com/dp/B0BW4SFRXP
ISBN (Paperback): 9798377922339 (Hardcover): 9798377923053 (Kindle Edition): CC BY-
NC-ND 4.0
Other Publishers: @googlebooks @GooglePlay @AmazonKindle
Available at @WordPress @ResearchGate @Scribd @academia @ZENODO_ORG @Twitter
@facebook @LinkedIn @Amazon @googlebooks @GooglePlay @AmazonKindle

2023 0111 || “SuperHyperConnected” Amazon

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

[ADDRESSED CITATION]
[HG111b] Henry Garrett, “SuperHyperConnected”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7647868).

SuperHyperConnected
@googlebooks:https://books.google.com/books/about?id=AmquEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=AmquEAAAQBAJ
@ResearchGate:https://www.researchgate.net/publication/368571770
@WordPress:https://drhenrygarrett.wordpress.com/2023/02/17/SuperHyperConnected/
@Scribd: https://www.scribd.com/document/-
@ZENODO_ORG: https://zenodo.org/record/7647868
@academia:https://www.academia.edu/97033545
|| SuperHyperConnected
Link (Paperback): https://www.amazon.com/dp/B0BW2LMPN5
(Hardcover): https://www.amazon.com/dp/B0BW358DDG (Kindle Edition):
https://www.amazon.com/dp/B0BW2ZBHG7
ISBN (Paperback): 9798377841821 (Hardcover): 9798377842361 (Kindle Edition): CC BY-NC-
ND 4.0
Other Publishers: @googlebooks @GooglePlay @AmazonKindle
Available at @WordPress @ResearchGate @Scribd @academia @ZENODO_ORG @Twitter
@facebook @LinkedIn @Amazon @googlebooks @GooglePlay @AmazonKindle

2023 0110 || “SuperHyperTotal” Amazon

[ADDRESSED CITATION]
[HG110b] Henry Garrett, “SuperHyperTotal”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7647017).

SuperHyperTotal
@googlebooks:https://books.google.com/books/about?id=81uuEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=81uuEAAAQBAJ
@ResearchGate: https://www.researchgate.net/publication/368569569
@WordPress: https://drhenrygarrett.wordpress.com/2023/02/17/superhypertotal/
@Scribd: https://www.scribd.com/document/-
@ZENODO_ORG: https://zenodo.org/record/7647017
@academia:https://www.academia.edu/97015085
|| SuperHyperTotal
Link (Paperback): https://www.amazon.com/dp/B0BW35VNQS
(Hardcover): https://www.amazon.com/dp/B0BW2CQZJZ (Kindle Edition):
https://www.amazon.com/dp/B0BW1TZTPX
ISBN (Paperback): 9798377783084 (Hardcover): 9798377789796 (Kindle Edition): CC BY-NC-
ND 4.0
Other Publishers: @googlebooks @GooglePlay @AmazonKindle
Available at @WordPress @ResearchGate @Scribd @academia @ZENODO_ORG @Twitter
@facebook @LinkedIn @Amazon @googlebooks @GooglePlay @AmazonKindle

2023 0109 || “SuperHyperPerfect” Amazon

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

[ADDRESSED CITATION]
[HG109b] Henry Garrett, “SuperHyperPerfect”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7644894).

SuperHyperPerfect
@googlebooks:https://books.google.com/books/about?id=JymuEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=JymuEAAAQBAJ
@ResearchGate: https://www.researchgate.net/publication/368537745
@WordPress: https://drhenrygarrett.wordpress.com/2023/02/16/SuperHyperPerfect/
@Scribd: https://www.scribd.com/document/-
@ZENODO_ORG: https://zenodo.org/record/7644894
@academia:https://www.academia.edu/96976482
|| SuperHyperPerfect
Link (Paperback): https://www.amazon.com/dp/B0BVSXB7TC
(Hardcover): https://www.amazon.com/dp/B0BVT8FRC2 (Kindle Edition):
https://www.amazon.com/dp/B0BVY6CGKZ
ISBN (Paperback): 9798377701903 (Hardcover): 9798377703556 (Kindle Edition): CC BY-NC-
ND 4.0

2023 0108 || “SuperHyperJoin” Amazon

[ADDRESSED CITATION]
[HG108b] Henry Garrett, “SuperHyperJoin”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7641880).

SuperHyperJoin
@googlebooks:https://books.google.com/books/about?id=TeStEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=TeStEAAAQBAJ
@ResearchGate: https://www.researchgate.net/publication/368507224
@WordPress: https://drhenrygarrett.wordpress.com/2023/02/15/superhyperjoin/
@Scribd: https://www.scribd.com/document/625861795
@ZENODO_ORG: https://zenodo.org/record/7641880
@academia: https://www.academia.edu/96922889
|| SuperHyperJoin
Link (Paperback): https://www.amazon.com/dp/B0BVT7HJ1K
(Hardcover): https://www.amazon.com/dp/B0BVSXX9W5 (Kindle Edition):
https://www.amazon.com/dp/B0BVY6P9KC
ISBN (Paperback): 9798377481201 (Hardcover): 9798377481645 (Kindle Edition): CC BY-NC-
ND 4.0
Other Publishers: @googlebooks @GooglePlay @AmazonKindle
Available at @WordPress @ResearchGate @Scribd @academia @ZENODO_ORG @Twitter
@facebook @LinkedIn @Amazon @googlebooks @GooglePlay @AmazonKindle

2023 0107 || “Path SuperHyperColoring” Amazon

[ADDRESSED CITATION]
[HG107b] Henry Garrett, “Path SuperHyperColoring”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7632923).

|| Path SuperHyperColoring
@googlebooks: https://books.google.com/books/about?id=o3ytEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=o3ytEAAAQBAJ
@ResearchGate: https://www.researchgate.net/publication/368451772
@Scribd: https://www.scribd.com/document/625256605
@ZENODO_ORG: https://zenodo.org/record/7632923
@academia: https://www.academia.edu/96737450
Link (Paperback): https://www.amazon.com/dp/B0BVDRFXXF (Hardcover):
https://www.amazon.com/dp/B0BVDMJ5MJ (Kindle Edition):
ISBN (Paperback): 9798377115236 (Hardcover): 9798377115786 (Kindle Edition): CC BY-NC-
ND 4.0
Other Publishers: @googlebooks @GooglePlay @AmazonKindle
Available at @WordPress @ResearchGate @Scribd @academia @ZENODO_ORG @Twitter
@facebook @LinkedIn @Amazon @googlebooks @GooglePlay @AmazonKindle
 9144
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett @gmail.com · Manhattan, NY, USA
2023 0106 || “SuperHyperDensity” Amazon

[ADDRESSED CITATION]
[HG106b] Henry Garrett, “SuperHyperDensity”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7623459).

|| SuperHyperDensity
Link (Paperback): https://www.amazon.com/dp/B0BV49Y61R (Hardcover):
https://www.amazon.com/dp/B0BV4DYQZL (Kindle Edition):
ISBN (Paperback): 9798376742822 (Hardcover): 9798376743706 (Kindle Edition): CC BY-NC-
ND 4.0
@googlebooks: https://books.google.com/books/about?id=HdusEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=HdusEAAAQBAJ
@ResearchGate: https://www.researchgate.net/publication/368361919
@ZENODO_ORG: https://zenodo.org/record/7623459
@academia: https://www.academia.edu/96571852

2023 0105 || “Neutrosophic SuperHyperConnectivities” Amazon

[ADDRESSED CITATION]
[HG105b] Henry Garrett, “Neutrosophic SuperHyperConnectivities”. Dr. Henry Garrett, 2023.

Link (Paperback): https://www.amazon.com/dp/B0BTXCX57J (Hardcover):

https://www.amazon.com/dp/B0BTRXKGTX (Kindle Edition):
ISBN (Paperback): 9798376198186 (Hardcover): 9798376200612 (Kindle Edition): CC BY-NC-
ND 4.0
CC BY-NC-ND 4.0
@googlebooks:https://books.google.com/books/about?id=YeurEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=YeurEAAAQBAJ
@ResearchGate:https://www.researchgate.net/publication/368275740
@Scribd:https://www.scribd.com/document/623824611
@ZENODO_ORG:https://zenodo.org/record/7606434
@academia:https://www.academia.edu/96305174

2023 Book 104 || “Extreme SuperHyperConnectivities” Amazon

[ADDRESSED CITATION]
[HG104b] Henry Garrett, “Extreme SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7606416).

Link (Paperback): https://www.amazon.com/dp/B0BTRYB2S4 (Hardcover):

https://www.amazon.com/dp/B0BTT6VT96 (Kindle Edition):
ISBN (Paperback): 9798376198131 (Hardcover): 9798376200353 (Kindle Edition): CC BY-NC-
ND 4.0
CC BY-NC-ND 4.0
@googlebooks: https://books.google.com/books/about?id=X-urEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=X-urEAAAQBAJ
@ResearchGate: https://www.researchgate.net/publication/368275596
@Scribd: https://www.scribd.com/document/623823150
@ZENODO_ORG:https://zenodo.org/record/7606416
@academia:https://www.academia.edu/96304920

2023 Book 103 || “SuperHyperConnectivities” Amazon

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

[ADDRESSED CITATION]
[HG103b] Henry Garrett, “SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7606404).

CC BY-NC-ND 4.0
@googlebooks:https://books.google.com/books/about?id=UeurEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=UeurEAAAQBAJ
@ResearchGate: https://www.researchgate.net/publication/368275728
@Scribd: https://www.scribd.com/document/623822143
@ZENODO_ORG:https://zenodo.org/record/7606404
@academia: https://www.academia.edu/96304608

2023 Book 102 || “Neutrosophic SuperHyperCycle” Amazon

[ADDRESSED CITATION]
[HG102b] Henry Garrett, “Neutrosophic SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7580018).

Link (Paperback): https://www.amazon.com/dp/B0BT6ZXQ8V (Hardcover):

https://www.amazon.com/dp/B0BT7DZTBW (Kindle Edition):
ISBN (Paperback): 9798375329239 (Hardcover): 9798375330525 (Kindle Edition): CC BY-NC-
ND 4.0
CC BY-NC-ND 4.0
@googlebooks: https://books.google.com/books/about?id=OCeqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=OCeqEAAAQBAJ
@ResearchGate: https://www.researchgate.net/publication/367511605
@ZENODO_ORG: https://zenodo.org/record/7580018
@academia: https://www.academia.edu/95870656
@WordPress: -

2023 Book 101 || “Extreme SuperHyperCycle” Amazon

[ADDRESSED CITATION]
[HG101b] Henry Garrett, “Extreme SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7580018).

CC BY-NC-ND 4.0
@googlebooks: https://books.google.com/books/about?id=MCeqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=MCeqEAAAQBAJ
@ResearchGate: https://www.researchgate.net/publication/367511605
@ZENODO_ORG: https://zenodo.org/record/7580018
@academia: https://www.academia.edu/95870656
@WordPress: -

2023 Book 100 || “Extreme SuperHyperCycle” Amazon

[ADDRESSED CITATION]
[HG100b] Henry Garrett, “Extreme SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7580018).

Link (Paperback): https://www.amazon.com/dp/B0BT7HS2CD (Hardcover):

https://www.amazon.com/dp/B0BT75DHQ2 (Kindle Edition):
ISBN (Paperback): 9798375314822 (Hardcover): 9798375329970 (Kindle Edition): CC BY-NC-
ND 4.0

2023 Book 99 || “SuperHyperCycle” Amazon

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

[ADDRESSED CITATION]
[HG99b] Henry Garrett, “SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7579929).

CC BY-NC-ND 4.0
@googlebooks: https://books.google.com/books/about?id=LieqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=LieqEAAAQBAJ
@ResearchGate: https://www.researchgate.net/publication/367511616
@Scribd: https://www.scribd.com/document/623691106
@ZENODO_ORG: https://zenodo.org/record/7579929
@academia: https://www.academia.edu/95868812
@WordPress: -

2023 0098 | Neutrosophic SuperHyperGirth Amazon

[ADDRESSED CITATION]
[HG98b] Henry Garrett, “Neutrosophic SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7563170).

https://amazon.com/dp/B0BSV66BWV
https://amazon.com/dp/B0BSV7CZH4
9798374731323
9798374736922
CC BY-NC-ND 4.0
@googlebooks: http://books.google.com/books/about?id=yL-qEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=yL-qEAAAQBAJ
@WordPress: -
@Scribd: -
@ResearchGate: https://www.researchgate.net/publication/367351622
@ZENODO_ORG: https://zenodo.org/record/7563170
@academia: https://www.academia.edu/95563414

2023 0097 | Extreme SuperHyperGirth Amazon

[ADDRESSED CITATION]
[HG97b] Henry Garrett, “Extreme SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7563164).

https://www.amazon.com/dp/B0BSJPZV9J
https://www.amazon.com/dp/B0BSJPYVWJ
9798374731309
9798374736915
CC BY-NC-ND 4.0
@WordPress: -
@ResearchGate: https://www.researchgate.net/publication/367351526E xtremeS uperHyperGirth
@Scribd: -
@ZENODO_ORG: https://zenodo.org/record/7563164
@academia: https://www.academia.edu/95563241

2023 0096 | “SuperHyperGirth” Amazon

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

[ADDRESSED CITATION]
[HG96b] Henry Garrett, “SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7563160).

https://www.amazon.com/dp/B0BSLKY69Q
https://www.amazon.com/dp/B0BT3S4ZP5
9798374731361
9798374736854
CC BY-NC-ND 4.0
@WordPress: -
@Scribd: https://www.scribd.com/document/623689401
@ZENODOO RG : https : //zenodo.org/record/7563160
@academia: https://www.academia.edu/95562815
@ResearchGate: https://www.researchgate.net/publication/367351521

2023 0095 | “Extreme SuperHyperGirth” Amazon

[ADDRESSED CITATION]
[HG95b] Henry Garrett, “Extreme SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7563160).

@googlebooks: http://books.google.com/books/about?id=vL-qEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=vL-qEAAAQBAJ

2023 0094 | “Overlook On SuperHyperGirth” Amazon

[ADDRESSED CITATION]
[HG94b] Henry Garrett, “Overlook On SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7563160).

@googlebooks: http://books.google.com/books/about?id=rr-qEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=rr-qEAAAQBAJ

2023 0093 | “Neutrosophic SuperHyperMatching” Amazon

[ADDRESSED CITATION]
[HG93b] Henry Garrett, “Neutrosophic SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7557063).

@googlebooks: http://books.google.com/books/about?id=6bmqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=6bmqEAAAQBAJ
https://www.amazon.com/dp/B0BSJPZT7B https://www.amazon.com/dp/B0BSR4XZH5
9798374564273 9798374564792 CC BY-NC-ND 4.0
@ResearchGate: https://www.researchgate.net/publication/367326889
@Scribd: -
@ZENODO_ORG: https://zenodo.org/record/7557063
@academia: https://www.academia.edu/95421010
@WordPress: -

2023 0092 | “Extreme SuperHyperMatching” Amazon

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

[ADDRESSED CITATION]
[HG92b] Henry Garrett, “Extreme SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7557009).

@googlebooks: http://books.google.com/books/about?id=47mqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=47mqEAAAQBAJ
https://www.amazon.com/dp/B0BSJDJSN7
https://www.amazon.com/dp/B0BSLKWW3F
9798374564266
9798374564785
CC BY-NC-ND 4.0
@ResearchGate: https://www.researchgate.net/publication/367326611
@Scribd: -
@ZENODO_ORG: https://zenodo.org/record/7557009
@academia: https://www.academia.edu/95418790
@WordPress: -

2023 0091 | “Overlook On SuperHyperMatching” Amazon

[ADDRESSED CITATION]
[HG91b] Henry Garrett, “Overlook On SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7539484).

@googlebooks: http://books.google.com/books/about?id=kC-oEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=kC-oEAAAQBAJ

2023 0090 | “Neutrosophic Failed SuperHyperClique” Amazon

[ADDRESSED CITATION]
[HG90b] Henry Garrett, “Neutrosophic Failed SuperHyperClique”. Dr. Henry Garrett, 2023
(doi: 10.5281/zenodo.7523390).

@googlebooks: http://books.google.com/books/about?id=h7qqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=h7qqEAAAQBAJ

2023 0089 | “Extreme Failed SuperHyperClique” Amazon

[ADDRESSED CITATION]
[HG89b] Henry Garrett, “Extreme Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7523390).

@googlebooks: http://books.google.com/books/about?id=gbqqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=gbqqEAAAQBAJ

2023 0088 | “Overlook On Failed SuperHyperClique” Amazon

[ADDRESSED CITATION]
[HG88b] Henry Garrett, “Overlook On Failed SuperHyperClique”. Dr. Henry Garrett, 2023
(doi: 10.5281/zenodo.7523390).

@googlebooks: http://books.google.com/books/about?id=e7qqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=e7qqEAAAQBAJ
Other Publishers: @googlebooks @GooglePlay @AmazonKindle
Available at @WordPress @ResearchGate @Scribd @academia @ZENODO_ORG @Twitter
@facebook @LinkedIn @Amazon @googlebooks @GooglePlay @AmazonKindle

2023 0087 | “Extreme SuperHyperClique” Amazon

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

[ADDRESSED CITATION]
[HG87b] Henry Garrett, “Extreme SuperHyperClique”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7574952).

Link (Paperback): https://www.amazon.com/dp/B0BT6WSZLD (Hardcover):

https://www.amazon.com/dp/B0BT743MW2 (Kindle Edition): ISBN (Paperback):
9798375140049 (Hardcover): 9798375141510 (Kindle Edition): CC BY-NC-ND 4.0
CC BY-NC-ND 4.0
@googlebooks: https://books.google.com/books/about?id=52 pEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=52 pEAAAQBAJ
@ResearchGate: https://www.researchgate.net/publication/367463271
@ZENODO_ORG: https://zenodo.org/record/7574952
@academia: https://www.academia.edu/95769763
@WordPress: -
Other Publishers: @googlebooks @GooglePlay @AmazonKindle
Available at @WordPress @ResearchGate @Scribd @academia @ZENODO_ORG @Twitter
@facebook @LinkedIn @Amazon @googlebooks @GooglePlay @AmazonKindle

2023 0086 | “Neutrosophic SuperHyperClique” Amazon

[ADDRESSED CITATION]
[HG86b] Henry Garrett, “Neutrosophic SuperHyperClique”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7574992).

@googlebooks: http://books.google.com/books/about?id=7f2pEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=7f2pEAAAQBAJ
Link (Paperback): https://www.amazon.com/dp/B0BT6RD41C (Hardcover):
https://www.amazon.com/dp/B0BT733BB2 (Kindle Edition):
ISBN (Paperback): 9798375139920 (Hardcover): 9798375141473 (Kindle Edition): CC BY-NC-
ND 4.0
CC BY-NC-ND 4.0
@googlebooks: https://books.google.com/books/about?id=7f2pEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=7f2pEAAAQBAJ
@ResearchGate: https://www.researchgate.net/publication/367463285
@ZENODO_ORG: https://zenodo.org/record/7574992
@academia: https://www.academia.edu/95770247
@WordPress: -
Other Publishers: @googlebooks @GooglePlay @AmazonKindle
Available at @WordPress @ResearchGate @Scribd @academia @ZENODO_ORG @Twitter
@facebook @LinkedIn @Amazon @googlebooks @GooglePlay @AmazonKindle

2023 0085 | “Extreme SuperHyperClique” Amazon

[ADDRESSED CITATION]
[HG85b] Henry Garrett, “Extreme SuperHyperClique”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7523357).

@googlebooks: http://books.google.com/books/about?id=52 pEAAAQBAJ

@GooglePlay: https://play.google.com/store/books/details?id=52 pEAAAQBAJ

2023 0084 | “Overlook On SuperHyperClique” Amazon

[ADDRESSED CITATION]
[HG84b] Henry Garrett, “Overlook On SuperHyperClique”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7523357).

@googlebooks: http://books.google.com/books/about?id=Cf6pEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=Cf6pEAAAQBAJ
 9150
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett @gmail.com · Manhattan, NY, USA
2023 0083 | “Neutrosophic Failed SuperHyperStable” Amazon

[ADDRESSED CITATION]
[HG83b] Henry Garrett, “Neutrosophic Failed SuperHyperStable”. Dr. Henry Garrett, 2023
(doi: 10.5281/zenodo.7504782).

@googlebooks: http://books.google.com/books/about?id=cLuqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=cLuqEAAAQBAJ

2023 0082 | “Extreme Failed SuperHyperStable” Amazon

[ADDRESSED CITATION]
[HG82b] Henry Garrett, “Extreme Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7504782).

@googlebooks: http://books.google.com/books/about?id=aruqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=aruqEAAAQBAJ

2023 0081 | “Overlook On Failed SuperHyperStable” Amazon

[ADDRESSED CITATION]
[HG81b] Henry Garrett, “Overlook On Failed SuperHyperStable”. Dr. Henry Garrett, 2023
(doi: 10.5281/zenodo.7504782).

@googlebooks: http://books.google.com/books/about?id=YruqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=YruqEAAAQBAJ

2023 0080 | “Neutrosophic SuperHyperStable” Amazon

[ADDRESSED CITATION]
[HG80b] Henry Garrett, “Neutrosophic SuperHyperStable”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7499395).

@googlebooks: http://books.google.com/books/about?id=gLyqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=gLyqEAAAQBAJ

2023 0079 | “Extreme SuperHyperStable” Amazon

[ADDRESSED CITATION]
[HG79b] Henry Garrett, “Extreme SuperHyperStable”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7499395).

@googlebooks: http://books.google.com/books/about?id=CryqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=CryqEAAAQBAJ

2023 0078 | “Overlook On SuperHyperStable” Amazon

[ADDRESSED CITATION]
[HG78b] Henry Garrett, “Overlook On SuperHyperStable”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7499395).

@googlebooks: http://books.google.com/books/about?id=hLuqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=hLuqEAAAQBAJ

2023 0077 | Neutrosophic Failed SuperHyperForcing Amazon

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

“Neutrosophic Failed SuperHyperForcing”

[ADDRESSED CITATION]
[HG77b] Henry Garrett, “Neutrosophic Failed SuperHyperForcing”. Dr. Henry Garrett, 2023
(doi: 10.5281/zenodo.7497450).
@googlebooks: http://books.google.com/books/about?id=yLyqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=yLyqEAAAQBAJ

2023 0076 | Extreme Failed SuperHyperForcing Amazon

[ADDRESSED CITATION]
[HG76b] Henry Garrett, “Extreme Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7497450).
“Extreme Failed SuperHyperForcing”

@googlebooks: http://books.google.com/books/about?id=wLyqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=wLyqEAAAQBAJ

2023 0075 | Neutrosophic SuperHyperForcing Amazon

[ADDRESSED CITATION]
[HG75b] Henry Garrett, “Neutrosophic SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7494862).
“Neutrosophic SuperHyperForcing”

@googlebooks: http://books.google.com/books/about?id=5LyqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=5LyqEAAAQBAJ

2023 0074 | Extreme SuperHyperForcing Amazon

[ADDRESSED CITATION]
[HG74b] Henry Garrett, “Extreme SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7494862).
“Extreme SuperHyperForcing”

@googlebooks: http://books.google.com/books/about?id=3ryqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=3ryqEAAAQBAJ
Other Publishers: @googlebooks @GooglePlay @AmazonKindle
Available at @WordPress @ResearchGate @Scribd @academia @ZENODO_ORG @Twitter
@facebook @LinkedIn @Amazon @googlebooks @GooglePlay @AmazonKindle

2023 0073 | Overlook On SuperHyperForcing Amazon

[ADDRESSED CITATION]
[HG73b] Henry Garrett, “Overlook On SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7494862).
“Overlook On SuperHyperForcing”

@googlebooks: http://books.google.com/books/about?id=zryqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=zryqEAAAQBAJ
Other Publishers: @googlebooks @GooglePlay @AmazonKindle
Available at @WordPress @ResearchGate @Scribd @academia @ZENODO_ORG @Twitter
@facebook @LinkedIn @Amazon @googlebooks @GooglePlay @AmazonKindle

2023 0072 | Neutrosophic SuperHyperAlliances Amazon

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

[ADDRESSED CITATION]
[HG72b] Henry Garrett, “Neutrosophic SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7493845).
“Neutrosophic SuperHyperAlliances”

@googlebooks: http://books.google.com/books/about?id=cr2qEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=cr2qEAAAQBAJ

2023 0071 | Extreme SuperHyperAlliances Amazon

[ADDRESSED CITATION]
[HG71b] Henry Garrett, “Extreme SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7493845).
“Extreme SuperHyperAlliances”

@googlebooks: http://books.google.com/books/about?id=ZL2qEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=ZL2qEAAAQBAJ

2023 0070 | Overlook On SuperHyperAlliances Amazon

[ADDRESSED CITATION]
[HG70b] Henry Garrett, “Overlook On SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7493845).
“Overlook On SuperHyperAlliances”

@googlebooks: http://books.google.com/books/about?id=Sr2qEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=Sr2qEAAAQBAJ

2023 0069 | SuperHyperMatching Amazon

[ADDRESSED CITATION]
[HG69b] Henry Garrett, “SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7539484).

@googlebooks: https://books.google.com/books/about?id=kC-oEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=kC-oEAAAQBAJ
@ResearchGate: https://www.researchgate.net/publication/367165374
@Scribd:https://www.scribd.com/document/623688320
@ZENODOO RG : https : //zenodo.org/record/7539484
@academia:https://www.academia.edu/95049063
@WordPress:https://drhenrygarrett.wordpress.com/2023/01/16/superhypermatching-
published-version/
Link
(Paperback): https://www.amazon.com/dp/B0BSDPXX1P
(Hardcover): https://www.amazon.com/dp/B0BSDC1L66
(Kindle Edition):
ISBN
(Paperback): 9798373872683
(Hardcover): 9798373875424
(Kindle Edition): CC BY-NC-ND 4.0
ASIN : B0BSDPXX1P Publisher : Independently published (January 15, 2023) Language
: English Paperback : 582 pages ISBN-13 : 979-8373872683 Item Weight : 3.6 pounds
Dimensions : 8.5 x 1.37 x 11 inches
ASIN : B0BSDC1L66 Publisher : Independently published (January 16, 2023) Language
: English Hardcover : 548 pages ISBN-13 : 979-8373875424 Item Weight : 3.3 pounds
Dimensions : 8.25 x 1.48 x 11 inches
Other Publishers: @googlebooks @GooglePlay @AmazonKindle
Available at @WordPress @ResearchGate @Scribd @academia @ZENODO_ORG @Twitter
@facebook @LinkedIn @Amazon @googlebooks @GooglePlay @AmazonKindle
 9153
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett @gmail.com · Manhattan, NY, USA
2023 0068 | Failed SuperHyperClique Amazon

[ADDRESSED CITATION]
[HG68b] Henry Garrett, “Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7523390).

https://www.amazon.com/dp/B0BRZ67NYN
https://www.amazon.com/dp/B0BRYZTK24
9798373274227
9798373277273
@ResearchGate:https://www.researchgate.net/publication/366991079
@Scribd:https://www.scribd.com/document/623687651
@academia:https://www.academia.edu/94736027
@ZENODOO RG : https : //zenodo.org/record/7523390
@WordPress:https://drhenrygarrett.wordpress.com/2023/01/11/failed-superhyperclique-
published-version
ASIN : B0BRZ67NYN Publisher : Independently published (January 10, 2023) Language
: English Paperback : 454 pages ISBN-13 : 979-8373274227 Item Weight : 2.83 pounds
Dimensions : 8.5 x 1.07 x 11 inches
ASIN : B0BRYZTK24 Publisher : Independently published (January 10, 2023) Language
: English Hardcover : 460 pages ISBN-13 : 979-8373277273 Item Weight : 2.78 pounds
Dimensions : 8.25 x 1.27 x 11 inches
Other Publishers: @googlebooks @GooglePlay @AmazonKindle
Available at @WordPress @ResearchGate @Scribd @academia @ZENODO_ORG @Twitter
@facebook @LinkedIn @Amazon @googlebooks @GooglePlay @AmazonKindle

2023 0067 | SuperHyperClique Amazon

[ADDRESSED CITATION]
[HG67b] Henry Garrett, “SuperHyperClique”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7523357).

https://www.amazon.com/dp/B0BRWK4S1Y
https://www.amazon.com/dp/B0BRM24YJX
9798373040471
9798373041935
@ResearchGate: https://www.researchgate.net/publication/366956533
@Scribd: https://www.scribd.com/document/623686486
@academia:https://www.academia.edu/96257928
@ZENODOO RG : zenodo.org/record/7523357
@WordPress:https://drhenrygarrett.wordpress.com/2023/01/10/superhyperclique-published-
version-2/
ASIN : B0BRWK4S1Y Publisher : Independently published (January 8, 2023) Language
: English Paperback : 376 pages ISBN-13 : 979-8373040471 Item Weight : 2.36 pounds
Dimensions : 8.5 x 0.89 x 11 inches
ASIN : B0BRM24YJX Publisher : Independently published (January 8, 2023) Language :
English Hardcover : 388 pages ISBN-13 : 979-8373041935 Item Weight : 2.36 pounds Dimensions
: 8.25 x 1.1 x 11 inches
Other Publishers: @googlebooks @GooglePlay @AmazonKindle
Available at @WordPress @ResearchGate @Scribd @academia @ZENODO_ORG @Twitter
@facebook @LinkedIn @Amazon @googlebooks @GooglePlay @AmazonKindle

2023 0066 | Failed SuperHyperStable Amazon

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

[ADDRESSED CITATION]
[HG66b] Henry Garrett, “Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7504782).

https://www.amazon.com/dp/B0BRNG7DC8
https://www.amazon.com/dp/B0BRLVN39L
9798372597976
9798372599765
@ResearchGate:https://www.researchgate.net/publication/366867409
@Scribd:https://www.scribd.com/document/623685007
@academia:https://www.academia.edu/94347021
@ZENODOO RG : https : //zenodo.org/record/7504782
@WordPress:https://drhenrygarrett.wordpress.com/2023/01/06/failed-superhyperstable-
published-version/
ASIN : B0BRNG7DC8 Publisher : Independently published (January 4, 2023) Language
: English Paperback : 304 pages ISBN-13 : 979-8372597976 Item Weight : 1.93 pounds
Dimensions : 8.5 x 0.72 x 11 inches
ASIN : B0BRLVN39L Publisher : Independently published (January 4, 2023) Language :
English Hardcover : 306 pages ISBN-13 : 979-8372599765 Item Weight : 1.89 pounds Dimensions
: 8.25 x 0.91 x 11 inches
Other Publishers: @googlebooks @GooglePlay @AmazonKindle
Available at @WordPress @ResearchGate @Scribd @academia @ZENODO_ORG @Twitter
@facebook @LinkedIn @Amazon @googlebooks @GooglePlay @AmazonKindle

2023 0065 | SuperHyperStable Amazon

[ADDRESSED CITATION]
[HG65b] Henry Garrett, “SuperHyperStable”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7499395).

https://www.amazon.com/dp/B0BRDG5Z4Y
https://www.amazon.com/dp/B0BRJPG56M
9798372248519
9798372252011
@ResearchGate:https://www.researchgate.net/publication/366809008
@Scribd:https://www.scribd.com/document/617440737
@academia:https://www.academia.edu/94165188
@ZENODOO RG : https : //zenodo.org/record/7499395
@WordPress:https://drhenrygarrett.wordpress.com/2023/01/03/superhyperstable-published-
version/
ASIN : B0BRDG5Z4Y Publisher : Independently published (January 2, 2023) Language
: English Paperback : 294 pages ISBN-13 : 979-8372248519 Item Weight : 1.93 pounds
Dimensions : 8.27 x 0.7 x 11.69 inches
ASIN : B0BRJPG56M Publisher : Independently published (January 2, 2023) Language :
English Hardcover : 290 pages ISBN-13 : 979-8372252011 Item Weight : 1.79 pounds Dimensions
: 8.25 x 0.87 x 11 inches
Other Publishers: @googlebooks @GooglePlay @AmazonKindle
Available at @WordPress @ResearchGate @Scribd @academia @ZENODO_ORG @Twitter
@facebook @LinkedIn @Amazon @googlebooks @GooglePlay @AmazonKindle

2023 0064 | Failed SuperHyperForcing Amazon

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

[ADDRESSED CITATION]
[HG64b] Henry Garrett, “Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7497450).

@googlebooks: http://books.google.com/books/about?id=vryqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=vryqEAAAQBAJ
https://www.amazon.com/dp/B0BRH5B4QM
https://www.amazon.com/dp/B0BRGX4DBJ
9798372123649
9798372124509
@ResearchGate:https://www.researchgate.net/publication/366734162
@Scribd:https://www.scribd.com/document/61724247
@academia:https://www.academia.edu/94069071
@ZENODOO RG : https : //zenodo.org/record/7497450
@WordPress:https://drhenrygarrett.wordpress.com/2023/01/01/failed-superhyperforcing-
published-version/
ASIN : B0BRH5B4QM Publisher : Independently published (January 1, 2023) Language
: English Paperback : 337 pages ISBN-13 : 979-8372123649 Item Weight : 2.13 pounds
Dimensions : 8.5 x 0.8 x 11 inches
ASIN : B0BRGX4DBJ Publisher : Independently published (January 1, 2023) Language :
English Hardcover : 337 pages ISBN-13 : 979-8372124509 Item Weight : 2.07 pounds Dimensions
: 8.25 x 0.98 x 11 inches
Other Publishers: @googlebooks @GooglePlay @AmazonKindle
Available at @WordPress @ResearchGate @Scribd @academia @ZENODO_ORG @Twitter
@facebook @LinkedIn @Amazon @googlebooks @GooglePlay @AmazonKindle

2022 0063 | SuperHyperForcing Amazon

[ADDRESSED CITATION]
[HG63b] Henry Garrett, “SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7494862).

ASIN : B0BRDG1KN1 Publisher : Independently published (December 30, 2022) Language

: English Paperback : 285 pages ISBN-13 : 979-8371873347 Item Weight : 1.82 pounds
Dimensions : 8.5 x 0.67 x 11 inches
ASIN : B0BRDFFQMF Publisher : Independently published (December 30, 2022) Language :
English Hardcover : 285 pages ISBN-13 : 979-8371874092 Item Weight : 1.77 pounds Dimensions
: 8.25 x 0.86 x 11 inches
https://www.amazon.com/dp/B0BRDG1KN1 https://www.amazon.com/dp/B0BRDFFQMF
9798371873347 9798371874092
@ResearchGate:https://www.researchgate.net/publication/366696469
@Scribd:https://www.scribd.com/document/617079885
@academia:https://www.academia.edu/93995226
@ZENODOO RG : https : //zenodo.org/record/7494862
@WordPress:https://drhenrygarrett.wordpress.com/2022/12/30/superhyperforcing-
published-versian/
Other Publishers: @googlebooks @GooglePlay @AmazonKindle
Available at @WordPress @ResearchGate @Scribd @academia @ZENODO_ORG @Twitter
@facebook @LinkedIn @Amazon @googlebooks @GooglePlay @AmazonKindle

2022 0062 | SuperHyperAlliances Amazon

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

[ADDRESSED CITATION]
[HG62b] Henry Garrett, “SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7493845).

ASIN : B0BR6YC3HG Publisher : Independently published (December 27, 2022) Language

: English Paperback : 189 pages ISBN-13 : 979-8371488343 Item Weight : 1.24 pounds
Dimensions : 8.5 x 0.45 x 11 inches
ASIN : B0BR7CBTC6 Publisher : Independently published (December 27, 2022) Language :
English Hardcover : 189 pages ISBN-13 : 979-8371494849 Item Weight : 1.21 pounds Dimensions
: 8.25 x 0.64 x 11 inches
https://www.amazon.com/dp/B0BR6YC3HG https://www.amazon.com/dp/B0BR7CBTC6
9798371488343 9798371494849
@ResearchGate:https://www.researchgate.net/publication/366621489
@Scribd:https://www.scribd.com/document/617024953
@academia:https://www.academia.edu/93968814
@ZENODOO RG : https : //zenodo.org/record/7493845
@WordPress:https://drhenrygarrett.wordpress.com/2022/12/28/superhyperalliances-
published-version/
Other Publishers: @googlebooks @GooglePlay @AmazonKindle
Available at @WordPress @ResearchGate @Scribd @academia @ZENODO_ORG @Twitter
@facebook @LinkedIn @Amazon @googlebooks @GooglePlay @AmazonKindle

2022 0061 | SuperHyperGraphs Amazon

[ADDRESSED CITATION]
[HG61b] Henry Garrett, “SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7480110).

@googlebooks: http://books.google.com/books/about?id=iL2qEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=iL2qEAAAQBAJ
@ResearchGate:https://www.researchgate.net/publication/366565820
@Scribd:https://www.scribd.com/document/617022135
@academia:https://www.academia.edu/93605376
@ZENODOO RG : https : //zenodo.org/record/7480110
@WordPress:https://drhenrygarrett.wor
ASIN : B0BR1NHY4Z Publisher : Independently published (December 24, 2022) Language :
English Paperback : 117 pages ISBN-13 : 979-8371090133 Item Weight : 13 ounces Dimensions
: 8.5 x 0.28 x 11 inches
ASIN : B0BQXTHTXY Publisher : Independently published (December 24, 2022) Language :
English Hardcover : 117 pages ISBN-13 : 979-8371093240 Item Weight : 12.6 ounces Dimensions
: 8.25 x 0.47 x 11 inches
Link (Paperback): https://www.amazon.com/dp/B0BR1NHY4Z (Hardcover):
https://www.amazon.com/dp/B0BQXTHTXY (Kindle Edition):
ISBN (Paperback): 9798371090133 (Hardcover): 9798371093240 (Kindle Edition): CC BY-NC-
ND 4.0
Other Publishers: @googlebooks @GooglePlay @AmazonKindle
Available at @WordPress @ResearchGate @Scribd @academia @ZENODO_ORG @Twitter
@facebook @LinkedIn @Amazon @googlebooks @GooglePlay @AmazonKindle

2022 0060 | Neut. SuperHyperEdges Amazon

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

[ADDRESSED CITATION]
[HG60b] Henry Garrett, “Neut. SuperHyperEdges”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7378758).

@GooglePlay: https://play.google.com/store/books/details?id=rr2qEAAAQBAJ
@ResearchGate:https://www.researchgate.net/publication/365780867
@Scribd:https://www.scribd.com/document/611152330
@academia:https://www.academia.edu/91877217
@ZENODOO RG : https : //zenodo.org/record/7378758
@WordPress:https://drhenrygarrett.wordpress.com/2022/11/29/neut-superhyperedges-
published-version/
ASIN : B0BNH11ZDY Publisher : Independently published (November 27, 2022) Language :
English Paperback : 107 pages ISBN-13 : 979-8365922365 Item Weight : 12 ounces Dimensions
: 8.5 x 0.26 x 11 inches
ASIN : B0BNGZGPP6 Publisher : Independently published (November 27, 2022) Language :
English Hardcover : 107 pages ISBN-13 : 979-8365923980 Item Weight : 11.7 ounces Dimensions
: 8.25 x 0.45 x 11 inches
Link (Paperback): https://www.amazon.com/dp/B0BNH11ZDY (Hardcover):
https://www.amazon.com/dp/B0BNGZGPP6
ISBN (Paperback): 9798365922365 (Hardcover): 9798365923980 (Kindle Edition): CC BY-NC-
ND 4.0
Other Publishers: @googlebooks @GooglePlay @AmazonKindle
Available at @WordPress @ResearchGate @Scribd @academia @ZENODO_ORG @Twitter
@facebook @LinkedIn @Amazon @googlebooks @GooglePlay @AmazonKindle

2022 0059 | Neutrosophic k-Number Amazon

ASIN : B0BF3P5X4N Publisher : Independently published (September 14, 2022) Language

: English Paperback : 159 pages ISBN-13 : 979-8352590843 Item Weight : 1.06 pounds
Dimensions : 8.5 x 0.38 x 11 inches
ASIN : B0BF2XCDZM Publisher : Independently published (September 14, 2022) Language :
English Hardcover : 159 pages ISBN-13 : 979-8352593394 Item Weight : 1.04 pounds Dimensions
: 8.25 x 0.57 x 11 inches

2022 0058 | Neutrosophic Schedule Amazon

ASIN : B0BBJWJJZF Publisher : Independently published (August 22, 2022) Language

: English Paperback : 493 pages ISBN-13 : 979-8847885256 Item Weight : 3.07 pounds
Dimensions : 8.5 x 1.16 x 11 inches
ASIN : B0BBJLPWKH Publisher : Independently published (August 22, 2022) Language :
English Hardcover : 493 pages ISBN-13 : 979-8847886055 Item Weight : 2.98 pounds Dimensions
: 8.25 x 1.35 x 11 inches

2022 0057 | Neutrosophic Wheel Amazon

ASIN : B0BBJRHXXG Publisher : Independently published (August 22, 2022) Language

: English Paperback : 195 pages ISBN-13 : 979-8847865944 Item Weight : 1.28 pounds
Dimensions : 8.5 x 0.46 x 11 inches
ASIN : B0BBK3KG82 Publisher : Independently published (August 22, 2022) Language :
English Hardcover : 195 pages ISBN-13 : 979-8847867016 Item Weight : 1.25 pounds Dimensions
: 8.25 x 0.65 x 11 inches

2022 0056 | Neutrosophic t-partite Amazon

ASIN : B0BBJLZCHS Publisher : Independently published (August 22, 2022) Language

: English Paperback : 235 pages ISBN-13 : 979-8847834957 Item Weight : 1.52 pounds
Dimensions : 8.5 x 0.56 x 11 inches
ASIN : B0BBJDFGJS Publisher : Independently published (August 22, 2022) Language :
English Hardcover : 235 pages ISBN-13 : 979-8847838337 Item Weight : 1.48 pounds Dimensions
: 8.25 x 0.75 x 11 inches

2022 0055 | Neutrosophic Bipartite Amazon

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

ASIN : B0BB5Z9GHW Publisher : Independently published (August 22, 2022) Language

: English Paperback : 225 pages ISBN-13 : 979-8847820660 Item Weight : 1.46 pounds
Dimensions : 8.5 x 0.53 x 11 inches
ASIN : B0BBGG9RDZ Publisher : Independently published (August 22, 2022) Language :
English Hardcover : 225 pages ISBN-13 : 979-8847821667 Item Weight : 1.42 pounds Dimensions
: 8.25 x 0.72 x 11 inches

2022 0054 | Neutrosophic Star Amazon

ASIN : B0BB5ZHSSZ Publisher : Independently published (August 22, 2022) Language :

English Paperback : 215 pages ISBN-13 : 979-8847794374 Item Weight : 1.4 pounds Dimensions
: 8.5 x 0.51 x 11 inches
ASIN : B0BBC4BL9P Publisher : Independently published (August 22, 2022) Language :
English Hardcover : 215 pages ISBN-13 : 979-8847796941 Item Weight : 1.36 pounds Dimensions
: 8.25 x 0.7 x 11 inches

2022 0053 | Neutrosophic Cycle Amazon

ASIN : B0BB62NZQK Publisher : Independently published (August 22, 2022) Language

: English Paperback : 343 pages ISBN-13 : 979-8847780834 Item Weight : 2.17 pounds
Dimensions : 8.5 x 0.81 x 11 inches
ASIN : B0BB65QMKQ Publisher : Independently published (August 22, 2022) Language :
English Hardcover : 343 pages ISBN-13 : 979-8847782715 Item Weight : 2.11 pounds Dimensions
: 8.25 x 1 x 11 inches

2022 0052 | Neutrosophic Path Amazon

ASIN : B0BB67WCXL Publisher : Independently published (August 8, 2022) Language :

English Paperback : 315 pages ISBN-13 : 979-8847730570 Item Weight : 2 pounds Dimensions
: 8.5 x 0.74 x 11 inches
ASIN : B0BB5Z9FXL Publisher : Independently published (August 8, 2022) Language :
English Hardcover : 315 pages ISBN-13 : 979-8847731263 Item Weight : 1.95 pounds Dimensions
: 8.25 x 0.93 x 11 inches

2022 0051 | Neutrosophic Complete Amazon

ASIN : B0BB6191KN Publisher : Independently published (August 8, 2022) Language

: English Paperback : 227 pages ISBN-13 : 979-8847720878 Item Weight : 1.47 pounds
Dimensions : 8.5 x 0.54 x 11 inches
ASIN : B0BB5RRQN7 Publisher : Independently published (August 8, 2022) Language :
English Hardcover : 227 pages ISBN-13 : 979-8847721844 Item Weight : 1.43 pounds Dimensions
: 8.25 x 0.73 x 11 inches

2022 0050 | Neutrosophic Dominating Amazon

ASIN : B0BB5QV8WT Publisher : Independently published (August 8, 2022) Language

: English Paperback : 357 pages ISBN-13 : 979-8847592000 Item Weight : 2.25 pounds
Dimensions : 8.5 x 0.84 x 11 inches
ASIN : B0BB61WL9M Publisher : Independently published (August 8, 2022) Language :
English Hardcover : 357 pages ISBN-13 : 979-8847593755 Item Weight : 2.19 pounds Dimensions
: 8.25 x 1.03 x 11 inches

2022 0049 | Neutrosophic Resolving Amazon

ASIN : B0BBCJMRH8 Publisher : Independently published (August 8, 2022) Language

: English Paperback : 367 pages ISBN-13 : 979-8847587891 Item Weight : 2.31 pounds
Dimensions : 8.5 x 0.87 x 11 inches
ASIN : B0BBCB6DFC Publisher : Independently published (August 8, 2022) Language :
English Hardcover : 367 pages ISBN-13 : 979-8847589987 Item Weight : 2.25 pounds Dimensions
: 8.25 x 1.06 x 11 inches

2022 0048 | Neutrosophic Stable Amazon

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

ASIN : B0B7QGTNFW Publisher : Independently published (July 28, 2022) Language :

English Paperback : 133 pages ISBN-13 : 979-8842880348 Item Weight : 14.6 ounces Dimensions
: 8.5 x 0.32 x 11 inches
ASIN : B0B7QJWQ35 Publisher : Independently published (July 28, 2022) Language :
English Hardcover : 133 pages ISBN-13 : 979-8842881659 Item Weight : 14.2 ounces Dimensions
: 8.25 x 0.51 x 11 inches

2022 0047 | Neutrosophic Total Amazon

ASIN : B0B7GLB23F Publisher : Independently published (July 25, 2022) Language : English
Paperback : 137 pages ISBN-13 : 979-8842357741 Item Weight : 14.9 ounces Dimensions : 8.5
x 0.33 x 11 inches
ASIN : B0B6XVTDYC Publisher : Independently published (July 25, 2022) Language :
English Hardcover : 137 pages ISBN-13 : 979-8842358915 Item Weight : 14.6 ounces Dimensions
: 8.25 x 0.52 x 11 inches

2022 0046 | Neutrosophic Perfect Amazon

ASIN : B0B7CJHCYZ Publisher : Independently published (July 22, 2022) Language :

English Paperback : 127 pages ISBN-13 : 979-8842027330 Item Weight : 13.9 ounces Dimensions
: 8.5 x 0.3 x 11 inches
ASIN : B0B7C732Z1 Publisher : Independently published (July 22, 2022) Language : English
Hardcover : 127 pages ISBN-13 : 979-8842028757 Item Weight : 13.6 ounces Dimensions : 8.25
x 0.49 x 11 inches

2022 0045 | Neutrosophic Joint Set Amazon

ASIN : B0B6L8WJ77 Publisher : Independently published (July 15, 2022) Language : English
Paperback : 139 pages ISBN-13 : 979-8840802199 Item Weight : 15 ounces Dimensions : 8.5 x
0.33 x 11 inches
ASIN : B0B6L9GJWR Publisher : Independently published (July 15, 2022) Language :
English Hardcover : 139 pages ISBN-13 : 979-8840803295 Item Weight : 14.7 ounces Dimensions
: 8.25 x 0.52 x 11 inches

August 30, 0044 | Neutrosophic Duality GLOBAL

2022 KNOWLEDGE -
Publishing
House&Amazon&Google
Scholar&UNM

[ADDRESSED CITATION]
[HG44b] H. Garrett, “Neutrosophic Duality”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.6677173).
Neutrosophic Duality, GLOBAL KNOWLEDGE - Publishing House:
GLOBAL KNOWLEDGE - Publishing House 848 Brickell Ave Ste 950 Miami, Florida 33131
United States. ISBN: 978-1-59973-743-0
Henry Garrett, (2022). “Neutrosophic Duality”, Florida: GLOBAL KNOWLEDGE - Publishing
House 848 Brickell Ave Ste 950 Miami, Florida 33131 United States. ISBN: 978-1-59973-743-0
(http://fs.unm.edu/NeutrosophicDuality.pdf).
ASIN : B0B4SJ8Y44 Publisher : Independently published (June 22, 2022) Language : English
Paperback : 115 pages ISBN-13 : 979-8837647598 Item Weight : 12.8 ounces Dimensions : 8.5
x 0.27 x 11 inches
ASIN : B0B46B4CXT Publisher : Independently published (June 22, 2022) Language : English
Hardcover : 115 pages ISBN-13 : 979-8837649981 Item Weight : 12.5 ounces Dimensions : 8.25
x 0.46 x 11 inches
GLOBAL KNOWLEDGE - Publishing House: http://fs.unm.edu/NeutrosophicDuality.pdf
UNM: http://fs.unm.edu/NeutrosophicDuality.pdf
Google Scholar: https://books.google.com/books?id=dWWkEAAAQBAJ
Paperback: https://www.amazon.com/dp/B0B4SJ8Y44
Hardcover: https://www.amazon.com/dp/B0B46B4CXT
2022 0043 | Neutrosophic Path-Coloring Amazon
 9160
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett @gmail.com · Manhattan, NY, USA

ASIN : B0B3F2BZC4 Publisher : Independently published (June 7, 2022) Language : English

Paperback : 161 pages ISBN-13 : 979-8834894469 Item Weight : 1.08 pounds Dimensions : 8.5
x 0.38 x 11 inches
ASIN : B0B3FGPGQ3 Publisher : Independently published (June 7, 2022) Language :
English Hardcover : 161 pages ISBN-13 : 979-8834895954 Item Weight : 1.05 pounds Dimensions
: 8.25 x 0.57 x 11 inches

2022 0042 | Neutrosophic Density Amazon

ASIN : B0B19CDX7W Publisher : Independently published (May 15, 2022) Language :

English Paperback : 145 pages ISBN-13 : 979-8827498285 Item Weight : 15.7 ounces Dimensions
: 8.5 x 0.35 x 11 inches
ASIN : B0B14PLPGL Publisher : Independently published (May 15, 2022) Language :
English Hardcover : 145 pages ISBN-13 : 979-8827502944 Item Weight : 15.4 ounces Dimensions
: 8.25 x 0.53 x 11 inches

2022 0041 | Properties of SuperHyperGraph and Neutrosophic SuperHyperGraph Google Commerce Ltd

Publisher Infinite Study Seller Google Commerce Ltd Published on Apr 27, 2022 Pages
30 Features Original pages Best for web, tablet, phone, eReader Language English Genres
Antiques & Collectibles / Reference Content protection This content is DRM free GooglePlay
Properties of SuperHyperGraph and Neutrosophic SuperHyperGraph Front Cover Henry
Garrett Infinite Study, 27 Apr 2022 - Antiques & Collectibles - 30 pages GoogleBooks
Henry Garrett, “Properties of SuperHyperGraph and Neutrosophic SuperHyperGraph”,
Neutrosophic Sets and Systems 49 (2022) 531-561 (doi: 893 10.5281/zenodo.6456413).
(http://fs.unm.edu/NSS/NeutrosophicSuperHyperGraph34.pdf).

2022 0040 | Neutrosophic Connectivity Amazon

ASIN : B09YQJG2ZV Publisher : Independently published (April 26, 2022) Language :

English Paperback : 121 pages ISBN-13 : 979-8811310968 Item Weight : 13.4 ounces Dimensions
: 8.5 x 0.29 x 11 inches
ASIN : B09YQJG2DZ Publisher : Independently published (April 26, 2022) Language :
English Hardcover : 121 pages ISBN-13 : 979-8811316304 Item Weight : 13.1 ounces Dimensions
: 8.25 x 0.48 x 11 inches

2022 0039 | Neutrosophic Cycles Amazon

ASIN : B09X4KVLQG Publisher : Independently published (April 8, 2022) Language

: English Paperback : 169 pages ISBN-13 : 979-8449137098 Item Weight : 1.12 pounds
Dimensions : 8.5 x 0.4 x 11 inches
ASIN : B09X4LZ3HL Publisher : Independently published (April 8, 2022) Language : English
Hardcover : 169 pages ISBN-13 : 979-8449144157 Item Weight : 1.09 pounds Dimensions : 8.25
x 0.59 x 11 inches

2022 0038 | Girth in Neutrosophic Graphs Amazon

ASIN : B09WQ5PFV8 Publisher : Independently published (March 29, 2022) Language

: English Paperback : 163 pages ISBN-13 : 979-8442380538 Item Weight : 1.09 pounds
Dimensions : 8.5 x 0.39 x 11 inches
ASIN : B09WQQGXPZ Publisher : Independently published (March 29, 2022) Language :
English Hardcover : 163 pages ISBN-13 : 979-8442386592 Item Weight : 1.06 pounds Dimensions
: 8.25 x 0.58 x 11 inches

2022 0037 | Matching Number in Neutrosophic Graphs Amazon

ASIN : B09W7FT8GM Publisher : Independently published (March 22, 2022) Language

: English Paperback : 153 pages ISBN-13 : 979-8437529676 Item Weight : 1.03 pounds
Dimensions : 8.5 x 0.36 x 11 inches
ASIN : B09W4HF99L Publisher : Independently published (March 22, 2022) Language :
English Hardcover : 153 pages ISBN-13 : 979-8437539057 Item Weight : 1 pounds Dimensions
: 8.25 x 0.55 x 11 inches
 9161
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett @gmail.com · Manhattan, NY, USA
2022 0036 | Clique Number in Neutrosophic Graph Amazon

ASIN : B09TV82Q7T Publisher : Independently published (March 7, 2022) Language

: English Paperback : 155 pages ISBN-13 : 979-8428585957 Item Weight : 1.04 pounds
Dimensions : 8.5 x 0.37 x 11 inches
ASIN : B09TZBPWJG Publisher : Independently published (March 7, 2022) Language :
English Hardcover : 155 pages ISBN-13 : 979-8428590258 Item Weight : 1.01 pounds Dimensions
: 8.25 x 0.56 x 11 inches

2022 0035 | Independence in Neutrosophic Graphs Amazon

ASIN : B09TF227GG Publisher : Independently published (February 27, 2022) Language :

English Paperback : 149 pages ISBN-13 : 979-8424231681 Item Weight : 1 pounds Dimensions
: 8.5 x 0.35 x 11 inches
ASIN : B09TL1LSKD Publisher : Independently published (February 27, 2022) Language :
English Hardcover : 149 pages ISBN-13 : 979-8424234187 Item Weight : 15.7 ounces Dimensions
: 8.25 x 0.54 x 11 inches

2022 0034 | Zero Forcing Number in Neutrosophic Graphs Amazon

ASIN : B09SW2YVKB Publisher : Independently published (February 18, 2022) Language :

English Paperback : 147 pages ISBN-13 : 979-8419302082 Item Weight : 15.8 ounces Dimensions
: 8.5 x 0.35 x 11 inches
ASIN : B09SWLK7BG Publisher : Independently published (February 18, 2022) Language :
English Hardcover : 147 pages ISBN-13 : 979-8419313651 Item Weight : 15.5 ounces Dimensions
: 8.25 x 0.54 x 11 inches

2022 0033 | Neutrosophic Quasi-Order Amazon

ASIN : B09S3RXQ5C Publisher : Independently published (February 8, 2022) Language :

English Paperback : 107 pages ISBN-13 : 979-8414541165 Item Weight : 12 ounces Dimensions
: 8.5 x 0.26 x 11 inches
ASIN : B09S232DQH Publisher : Independently published (February 8, 2022) Language :
English Hardcover : 107 pages ISBN-13 : 979-8414545446 Item Weight : 11.7 ounces Dimensions
: 8.25 x 0.43 x 11 inches

Jan 29, 2022 0032 | Beyond Neutrosophic Graphs E-

publishing&Amazon&Google
Scholar&UNM

[HG32b] Henry Garrett, “Beyond Neutrosophic Graphs”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.6320305).
[ADDRESSED CITATION]
Beyond Neutrosophic Graphs, E-publishing:
Educational Publisher 1091 West 1st Ave Grandview Heights, Ohio 43212 United States
ISBN 978-1-59973-725-6
Henry Garrett, (2022). “Beyond Neutrosophic Graphs”, Ohio: E-publishing: Educational
Publisher 1091 West 1st Ave Grandview Heights, Ohio 43212 United States. ISBN: 978-1-
59973-725-6 (http://fs.unm.edu/BeyondNeutrosophicGraphs.pdf).
ASIN : B0BBCQJQG5 Publisher : Independently published (August 8, 2022) Language
: English Paperback : 257 pages ISBN-13 : 979-8847564885 Item Weight : 1.65 pounds
Dimensions : 8.5 x 0.61 x 11 inches
ASIN : B0BBC4BJZ5 Publisher : Independently published (August 8, 2022) Language : English
Hardcover : 257 pages ISBN-13 : 979-8847567497 Item Weight : 1.61 pounds Dimensions : 8.25
x 0.8 x 11 inches
E-publishing: Educational Publisher: http://fs.unm.edu/BeyondNeutrosophicGraphs.pdf
UNM: http://fs.unm.edu/BeyondNeutrosophicGraphs.pdf
Google Scholar:https://books.google.com/books?id=cWWkEAAAQBAJ
Paperback: https://www.amazon.com/gp/product/B0BBCQJQG5
Hardcover: https://www.amazon.com/Beyond-Neutrosophic-Graphs-Henry-
Garrett/dp/B0BBC4BJZ5

2022 0031 | Neutrosophic Alliances Amazon

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

ASIN : B09RB5XLVB Publisher : Independently published (January 26, 2022) Language :

English Paperback : 87 pages ISBN-13 : 979-8408627646 Item Weight : 10.1 ounces Dimensions
: 8.5 x 0.21 x 11 inches

ASIN : B09R39MTSW Publisher : Independently published (January 26, 2022) Language :

English Hardcover : 87 pages ISBN-13 : 979-8408632459 Item Weight : 9.9 ounces Dimensions
: 8.25 x 0.4 x 11 inches

2022 0030 | Neutrosophic Hypergraphs Amazon

ASIN : B09PMBKVD4 Publisher : Independently published (January 7, 2022) Language :

English Paperback : 79 pages ISBN-13 : 979-8797327974 Item Weight : 9.3 ounces Dimensions
: 8.5 x 0.19 x 11 inches
ASIN : B09PP8VZ3D Publisher : Independently published (January 7, 2022) Language :
English Hardcover : 79 pages ISBN-13 : 979-8797331483 Item Weight : 9.1 ounces Dimensions
: 8.25 x 0.38 x 11 inches

2022 0029 | Collections of Articles Amazon

-
ASIN : B09PHHDDQK Publisher : Independently published (January 2, 2022) Language :
English Hardcover : 543 pages ISBN-13 : 979-8794267204 Item Weight : 3.27 pounds Dimensions
: 8.25 x 1.47 x 11 inches

2022 0028 | Collections of Math Amazon

-
ASIN : B09PHBWT5D Publisher : Independently published (January 1, 2022) Language :
English Hardcover : 461 pages ISBN-13 : 979-8793793339 Item Weight : 2.8 pounds Dimensions
: 8.25 x 1.28 x 11 inches

2022 0027 | Collections of US Amazon

-
ASIN : B09PHBT924 Publisher : Independently published (December 31, 2021) Language :
English Hardcover : 261 pages ISBN-13 : 979-8793629645 Item Weight : 1.63 pounds Dimensions
: 8.25 x 0.81 x 11 inches

2021 0026 | Neutrosophic Chromatic Number Amazon

ASIN : B09NRD25MG Publisher : Independently published (December 20, 2021) Language

: English Paperback : 67 pages ISBN-13 : 979-8787858174 Item Weight : 8.2 ounces Dimensions
: 8.5 x 0.16 x 11 inches Language : English
-

2021 0025 | Simple Ideas Amazon

ASIN : B09MYTN6NT Publisher : Independently published (December 9, 2021) Language :

English Paperback : 45 pages ISBN-13 : 979-8782049430 Item Weight : 6.1 ounces Dimensions
: 8.5 x 0.11 x 11 inches
-

2021 0024 | Neutrosophic Graphs Amazon

ASIN : B09MYXVNF9 Publisher : Independently published (December 7, 2021) Language

: English Paperback : 55 pages ISBN-13 : 979-8780775652 Item Weight : 7 ounces Dimensions
: 8.5 x 0.13 x 11 inches
-
Other Publishers: @googlebooks @GooglePlay @AmazonKindle
Available at @WordPress @ResearchGate @Scribd @academia @ZENODO_ORG @Twitter
@facebook @LinkedIn @Amazon @googlebooks @GooglePlay @AmazonKindle

2021 0023 | List Amazon

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

ASIN : B09M554XCL Publisher : Independently published (November 20, 2021) Language :

English Paperback : 49 pages ISBN-13 : 979-8770762747 Item Weight : 6.4 ounces Dimensions
: 8.5 x 0.12 x 11 inches
-

2021 0022 | Theorems Amazon

ASIN : B09KDZXGPR Publisher : Independently published (October 28, 2021) Language :

English Paperback : 51 pages ISBN-13 : 979-8755453592 Item Weight : 6.7 ounces Dimensions
: 8.5 x 0.12 x 11 inches
-
Other Publishers: @googlebooks @GooglePlay @AmazonKindle
Available at @WordPress @ResearchGate @Scribd @academia @ZENODO_ORG @Twitter
@facebook @LinkedIn @Amazon @googlebooks @GooglePlay @AmazonKindle

2021 0021 | Dimension Amazon

ASIN : B09K2BBQG7 Publisher : Independently published (October 25, 2021) Language :

English Paperback : 55 pages ISBN-13 : 979-8753577146 Item Weight : 7 ounces Dimensions :
8.5 x 0.13 x 11 inches
-

2021 0020 | Beyond The Graph Theory Amazon

ASIN : B09KDZXGPR Publisher : Independently published (October 28, 2021) Language :

English Paperback : 51 pages ISBN-13 : 979-8755453592 Item Weight : 6.7 ounces Dimensions
: 8.5 x 0.12 x 11 inches
-

2021 0019 | Located Heart And Memories Amazon

ASIN : B09F14PL8T Publisher : Independently published (August 31, 2021) Language :

English Paperback : 56 pages ISBN-13 : 979-8468253816 Item Weight : 7 ounces Dimensions :
8.5 x 0.14 x 11 inches
-

2021 0018 | Number Graphs And Numbers Amazon

ASIN : B099BQRSF8 Publisher : Independently published (July 14, 2021) Language : English
Paperback : 32 pages ISBN-13 : 979-8537474135 Item Weight : 4.8 ounces Dimensions : 8.5 x
0.08 x 11 inches
-

2021 0017 | First Place Is Reserved Amazon

ASIN : B098CWD5PT Publisher : Independently published (June 30, 2021) Language :

English Paperback : 55 pages ISBN-13 : 979-8529508497 Item Weight : 7 ounces Dimensions :
8.5 x 0.13 x 11 inches
-

2021 0016 | Detail-oriented Groups And Ideas Amazon

ASIN : B098CYYG3Q Publisher : Independently published (June 30, 2021) Language :

English Paperback : 69 pages ISBN-13 : 979-8529401279 Item Weight : 8.3 ounces Dimensions
: 8.5 x 0.17 x 11 inches
-

2021 0015 | Definition And Its Necessities Amazon

ASIN : B098DHRJFD Publisher : Independently published (June 30, 2021) Language :

English Paperback : 79 pages ISBN-13 : 979-8529321416 Item Weight : 9.3 ounces Dimensions
: 8.5 x 0.19 x 11 inches
-
 9164
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett @gmail.com · Manhattan, NY, USA
2021 0014 | Words And Their Directionss Amazon

ASIN : B098CYS8G2 Publisher : Independently published (June 30, 2021) Language :

English Paperback : 65 pages ISBN-13 : 979-8529393758 Item Weight : 8 ounces Dimensions :
8.5 x 0.16 x 11 inches
-

2021 0013 | Tattooed Heart But Forever Amazon

ASIN : B098CR8HM6 Publisher : Independently published (June 30, 2021) Language :

English Paperback : 45 pages ISBN-13 : 979-8728873891 Item Weight : 6.1 ounces Dimensions
: 8.5 x 0.11 x 11 inches
-

2021 0012 | Metric Number In Dimension Amazon

ASIN : B0913597TV Publication date : March 24, 2021 Language : English File size : 28445
KB Text-to-Speech : Enabled Enhanced typesetting : Enabled X-Ray : Not Enabled Word
Wise : Not Enabled Print length : 48 pages Lending : Not Enabled Kindle
-

2021 0011 | Domination Theory And Beyond Amazon

ASIN : B098DMMZ87 Publisher : Independently published (June 30, 2021) Language

: English Paperback : 188 pages ISBN-13 : 979-8728100775 Item Weight : 1.23 pounds
Dimensions : 8.5 x 0.45 x 11 inches
-
Other Publishers: @googlebooks @GooglePlay @AmazonKindle
Available at @WordPress @ResearchGate @Scribd @academia @ZENODO_ORG @Twitter
@facebook @LinkedIn @Amazon @googlebooks @GooglePlay @AmazonKindle

2021 0010 | Vital Glory Amazon

ASIN : B08PVNJYRM Publication date : December 6, 2020 Language : English File size
: 1544 KB Simultaneous device usage : Unlimited Text-to-Speech : Enabled Screen Reader :
Supported Enhanced typesetting : Enabled X-Ray : Not Enabled Word Wise : Enabled Print
length : 24 pages Lending : Enabled Kindle
-

2021 0009 | Análisis de modelos y orientación más allá AmazonUK&MoreBooks

Análisis de modelos y orientación más allá Planteamiento y problemas en dos modelos

Ediciones Nuestro Conocimiento (2021-04-06) eligible for voucher ISBN-13: 978-620-3-59902-
2 ISBN-10:6203599026EAN:9786203599022Book language:Blurb/Shorttext:El enfoque para la
resolución de problemas es una selección obvia para hacer la investigación y el análisis de la
situación que puede provocar las perspectivas vagas que queremos no ser para extraer ideas
creativas y nuevas que queremos ser. Estudio simultáneamente dos modelos. Este estudio se
basa tanto en la investigación como en la discusión que el autor piensa que puede ser útil
para entender y hacer crecer nuestra fantası́a y la realidad juntas.Publishing house: Ediciones
Nuestro Conocimiento Website: https://sciencia-scripts.com By (author) : Henry Garrett
Number of pages:64Published on:2021-04-06Stock:Available Category: Mathematics Price:39.90
Keywords:Dos modelos, optimización de rutas y transporte, Two Models, Optimizing Routes
and Transportation
MoreBooks
https://www.morebooks.shop/store/gb/book/análisis-de-modelos-y-orientación-más-
allá/isbn/978-620-3-59902-2
Product details Publisher : Ediciones Nuestro Conocimiento (6 April 2021) Language :
Spanish ISBN-10 : 6203599026 ISBN-13 : 978-6203599022 Dimensions : 15 x 0.4 x 22 cm
Paperback:
https://www.amazon.co.uk/Análisis-modelos-orientación-allá-Planteamiento/dp/6203599026

2021 0008 | Анализ моделей и руководство за пределами Amazon&MoreBooks

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

Анализ моделей и руководство за пределами Подход и проблемы в двух моде-

лях Sciencia Scripts (2021-04-06) eligible for voucher ISBN-13: 978-620-3-59908-4 ISBN-
10:6203599085EAN:9786203599084Book language: Russian Blurb/Shorttext:Подход к реше-
нию проблем является очевидным выбором для проведения исследований и анализа си-
туации, которая может вызвать смутные перспективы, которыми мы не хотим быть для
извлечения творческих и новых идей, которыми мы хотим быть. Я одновременно изучаю
две модели. Это исследование основано как на исследовании, так и на обсуждении, кото-
рое, по мнению автора, может быть полезным для понимания и развития наших фантазий
и реальности вместе.Publishing house: Sciencia Scripts Website: https://sciencia-scripts.com
By (author) : Генри Гарретт Number of pages:68Published on:2021-04-06Stock:Available
Category: Mathematics Price:39.90 Keywords:Две модели, оптимизация маршрутов и
транспорта, Two Models, Optimizing Routes and Transportation
MoreBooks
https://www.morebooks.shop/store/gb/book/анализ-моделей-и-руководство-за-
пределами/isbn/978-620-3-59908-4

Анализ моделей и руководство за пределами: Подход и проблемы в двух моделях

(Russian Edition) Publisher : Sciencia Scripts (April 6, 2021) Language : Russian Paperback :
68 pages ISBN-10 : 6203599085 ISBN-13 : 978-6203599084 Item Weight : 5.3 ounces Dimensions
: 5.91 x 0.16 x 8.66 inches

2021 0007 | Análise e Orientação de Modelos Além Amazon | MoreBooks |

Walmart
Análise e Orientação de Modelos Além Abordagem e Problemas em Dois Modelos Edições
Nosso Conhecimento (2021-04-06 ) eligible for voucher ISBN-13: 978-620-3-59907-7 ISBN-
10:6203599077EAN:9786203599077Book language:Blurb/Shorttext:A abordagem para resolver
problemas é uma seleção óbvia para fazer pesquisa e análise da situação, que pode trazer
as perspectivas vagas que queremos não ser para extrair idéias criativas e novas idéias que
queremos ser. Eu estudo simultaneamente dois modelos. Este estudo é baseado tanto na
pesquisa como na discussão que o autor pensa que pode ser útil para compreender e fazer crescer
juntos a nossa fantasia e realidade.Publishing house: Edições Nosso Conhecimento Website:
https://sciencia-scripts.com By (author) : Henry Garrett Number of pages:64Published
on:2021-04-06Stock:Available Category: Mathematics Price:39.90 Keywords:Dois Modelos,
Otimização de Rotas e Transporte, Two Models, Optimizing Routes and Transportation
MoreBooks:
https://www.morebooks.shop/store/gb/book/análise-e-orientação-de-modelos-
além/isbn/978-620-3-59907-7
Henry Garrett Análise e Orientação de Modelos Além (Paperback) About this item
Product details
A abordagem para resolver problemas é uma seleção óbvia para fazer pesquisa e análise da
situação, que pode trazer as perspectivas vagas que queremos não ser para extrair idéias
criativas e novas idéias que queremos ser. Eu estudo simultaneamente dois modelos. Este
estudo é baseado tanto na pesquisa como na discussão que o autor pensa que pode ser útil
para compreender e fazer crescer juntos a nossa fantasia e realidade. Análise e Orientação de
Modelos Além (Paperback) We aim to show you accurate product information. Manufacturers,
suppliers and others provide what you see here, and we have not verified it. See our disclaimer
Specifications
Language Portuguese Publisher KS Omniscriptum Publishing Book Format Paperback Number
of Pages 64 Author Henry Garrett Title Análise e Orientação de Modelos Além ISBN-13
9786203599077 Publication Date April, 2021 Assembled Product Dimensions (L x W x H) 9.00
x 6.00 x 1.50 Inches ISBN-10 6203599077 Walmart

Análise e Orientação de Modelos Além: Abordagem e Problemas em Dois Modelos

(Portuguese Edition) Publisher : Edições Nosso Conhecimento (April 6, 2021) Language :
Portuguese Paperback : 64 pages ISBN-10 : 6203599077 ISBN-13 : 978-6203599077 Item Weight
: 3.67 ounces Dimensions : 5.91 x 0.15 x 8.66 inches

2021 0006 | Analizy modelowe i wytyczne wykraczaja˛ce poza Amazon&MoreBooks

 9166
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett @gmail.com · Manhattan, NY, USA
Analizy modelowe i wytyczne wykraczaja˛ce poza Podejście i problemy w dwóch
modelach Wydawnictwo Nasza Wiedza (2021-04-06 ) eligible for voucher ISBN-13: 978-620-3-
59906-0 ISBN-10:6203599069EAN:9786203599060Book language:Blurb/Shorttext:Podejście do
rozwia˛zywania problemów jest oczywistym wyborem do prowadzenia badań i analizowania
sytuacji, które moga˛ wywo lywać niejasne perspektywy, których nie chcemy dla wydobycia
kreatywnych i nowych pomys lów, które chcemy. I jednocześnie studiować dwa modele.
Badanie to oparte jest zarówno na badaniach jak i dyskusji, które zdaniem autora moga˛
być przydatne do zrozumienia i rozwoju naszych fantazji i rzeczywistości razem.Publishing
house: Wydawnictwo Nasza Wiedza Website: https://sciencia-scripts.com By (author) : Henry
Garrett Number of pages:64Published on:2021-04-06Stock:Available Category: Mathematics
Price:39.90 Keywords:Dwa modele, optymalizacja tras i transportu, Two Models, Optimizing
Routes and Transportation
MoreBooks:
https://www.morebooks.shop/store/gb/book/analizy-modelowe-i-wytyczne-wykraczaja˛ce-
poza/isbn/978-620-3-59906-0
Analizy modelowe i wytyczne wykraczaja˛ce poza: Podejście i problemy w dwóch modelach
(Polish Edition) Publisher : Wydawnictwo Nasza Wiedza (April 6, 2021) Language : Polish
Paperback : 64 pages ISBN-10 : 6203599069 ISBN-13 : 978-6203599060 Item Weight : 3.67
ounces Dimensions : 5.91 x 0.15 x 8.66 inches

2021 0005 | Modelanalyses en begeleiding daarna Amazon&MoreBooks

Modelanalyses en begeleiding daarna Aanpak en problemen in twee modellen

Uitgeverij Onze Kennis (2021-04-06 ) eligible for voucher ISBN-13: 978-620-3-59905-3
ISBN-10:6203599050EAN:9786203599053Book language:Blurb/Shorttext:De aanpak voor het
oplossen van problemen is een voor de hand liggende keuze voor het doen van onderzoek en het
analyseren van de situatie die de vage perspectieven kan oproepen die we niet willen zijn voor
het extraheren van creatieve en nieuwe ideeën die we willen zijn. Ik bestudeer tegelijkertijd twee
modellen. Deze studie is gebaseerd op zowel onderzoek als discussie waarvan de auteur denkt dat
ze nuttig kunnen zijn voor het begrijpen en laten groeien van onze fantasieën en de werkelijkheid
samen.Publishing house: Uitgeverij Onze Kennis Website: https://sciencia-scripts.com By
(author) : Henry Garrett Number of pages:64Published on:2021-04-06Stock:Available Category:
Mathematics Price:39.90 Keywords:Twee modellen, optimalisering van routes en transport,
Two Models, Optimizing Routes and Transportation
MoreBooks
Modelanalyses en begeleiding daarna: Aanpak en problemen in twee modellen (Dutch
Edition) Publisher : Uitgeverij Onze Kennis (April 6, 2021) Language : Dutch Paperback : 64
pages ISBN-10 : 6203599050 ISBN-13 : 978-6203599053 Item Weight : 3.99 ounces Dimensions
: 5.91 x 0.15 x 8.66 inches

2021 0004 | Analisi dei modelli e guida oltre Amazon | MoreBooks |

Walmart
 9167
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett @gmail.com · Manhattan, NY, USA
Analisi dei modelli e guida oltre Approccio e problemi in due modelli Edizioni
Sapienza (2021-04-06 ) eligible for voucher ISBN-13: 978-620-3-59904-6 ISBN-
10:6203599042EAN:9786203599046Book language:Blurb/Shorttext:L’approccio per risolvere
i problemi è una selezione ovvia per fare ricerca e analisi della situazione che può suscitare
le prospettive vaghe che non vogliamo essere per estrarre idee creative e nuove che vogliamo
essere. Studio contemporaneamente due modelli. Questo studio si basa sia sulla ricerca che
sulla discussione che l’autore pensa possa essere utile per capire e far crescere insieme la nostra
fantasia e la realtà.Publishing house: Edizioni Sapienza Website: https://sciencia-scripts.com
By (author) : Henry Garrett Number of pages:60Published on:2021-04-06Stock:Available
Category: Mathematics Price:39.90 Keywords:Due modelli, ottimizzazione dei percorsi e del
trasporto, Two Models, Optimizing Routes and Transportation
MoreBooks Henry Garrett Analisi dei modelli e guida oltre (Paperback) About this item
Product details
L’approccio per risolvere i problemi è una selezione ovvia per fare ricerca e analisi della
situazione che può suscitare le prospettive vaghe che non vogliamo essere per estrarre idee
creative e nuove che vogliamo essere. Studio contemporaneamente due modelli. Questo studio
si basa sia sulla ricerca che sulla discussione che l’autore pensa possa essere utile per capire e far
crescere insieme la nostra fantasia e la realtà. Analisi dei modelli e guida oltre (Paperback) We
aim to show you accurate product information. Manufacturers, suppliers and others provide
what you see here, and we have not verified it. See our disclaimer Specifications
Publisher KS Omniscriptum Publishing Book Format Paperback Number of Pages 60 Author
Henry Garrett Title Analisi dei modelli e guida oltre ISBN-13 9786203599046 Publication Date
April, 2021 Assembled Product Dimensions (L x W x H) 9.00 x 6.00 x 1.50 Inches ISBN-10
6203599042 Walmart
Analisi dei modelli e guida oltre: Approccio e problemi in due modelli (Italian Edition)
Publisher : Edizioni Sapienza (April 6, 2021) Language : Italian Paperback : 60 pages ISBN-10
: 6203599042 ISBN-13 : 978-6203599046 Item Weight : 3.53 ounces Dimensions : 5.91 x 0.14 x
8.66 inches

2021 0003 | Analyses de modèles et orientations au-delà Amazon | MoreBooks |

Walmart
Analyses de modèles et orientations au-delà Approche et problèmes dans deux
modèles Editions Notre Savoir (2021-04-06 ) eligible for voucher eligible for voucher
ISBN-13: 978-620-3-59903-9 ISBN-10:6203599034EAN:9786203599039Book language: French
Blurb/Shorttext:L’approche pour résoudre les problèmes est une sélection évidente pour faire
la recherche et l’analyse de la situation qui peut éliciter les perspectives vagues que nous ne
voulons pas être pour extraire des idées créatives et nouvelles que nous voulons être. J’étudie
simultanément deux modèles. Cette étude est basée à la fois sur la recherche et la discussion,
ce qui, selon l’auteur, peut être utile pour comprendre et développer nos fantasmes et la réalité
ensemble.Publishing house: Editions Notre Savoir Website: https://sciencia-scripts.com By
(author) : Henry Garrett Number of pages:64Published on:2021-04-06Stock:Available Category:
Mathematics Price:39.90 Keywords:Two Models, Optimizing Routes and Transportation, Deux
modèles, optimisation des itinéraires et des transports
MoreBooks:
https://www.morebooks.shop/store/gb/book/analyses-de-modèles-et-orientations-au-
delà/isbn/978-620-3-59903-9
Henry Garrett Analyses de modèles et orientations au-delà (Paperback) About this item
Product details
L’approche pour résoudre les problèmes est une sélection évidente pour faire la recherche et
l’analyse de la situation qui peut éliciter les perspectives vagues que nous ne voulons pas être
pour extraire des idées créatives et nouvelles que nous voulons être. J’étudie simultanément
deux modèles. Cette étude est basée à la fois sur la recherche et la discussion, ce qui, selon
l’auteur, peut être utile pour comprendre et développer nos fantasmes et la réalité ensemble.
Analyses de modèles et orientations au-delà (Paperback) We aim to show you accurate product
information. Manufacturers, suppliers and others provide what you see here, and we have not
verified it. See our disclaimer Specifications
Language French Publisher KS Omniscriptum Publishing Book Format Paperback Number of
Pages 64 Author Henry Garrett Title Analyses de modèles et orientations au-delà ISBN-13
9786203599039 Publication Date April, 2021 Assembled Product Dimensions (L x W x H) 9.00
x 6.00 x 1.50 Inches ISBN-10 6203599034 Walmart

Analyses de modèles et orientations au-delà: Approche et problèmes dans deux modèles

(French Edition) Publisher : Editions Notre Savoir (April 6, 2021) Language : French Paperback
: 64 pages ISBN-10 : 6203599034 ISBN-13 : 978-6203599039 Item Weight : 3.67 ounces
Dimensions : 5.91 x 0.15 x 8.66 inches
 9168
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett @gmail.com · Manhattan, NY, USA
2021 0002 | Modell-Analysen und Anleitungen darüber hinaus Amazon | MoreBooks |
Walmart | eBay
eligible for voucher ISBN-13: 978-620-3-59901-5 ISBN-
10:6203599018EAN:9786203599015Book language: German Blurb/Shorttext:Die
Herangehensweise zur Lösung von Problemen ist eine offensichtliche Auswahl für die
Forschung und Analyse der Situation, die die vagen Perspektiven, die wir nicht sein wollen,
für die Extraktion von kreativen und neuen Ideen, die wir sein wollen, hervorbringen kann.
Ich studiere gleichzeitig zwei Modelle. Diese Studie basiert sowohl auf der Forschung als
auch auf der Diskussion, von der der Autor denkt, dass sie für das Verständnis und das
Zusammenwachsen unserer Fantasie und Realität nützlich sein kann.Publishing house: Verlag
Unser Wissen Website: https://sciencia-scripts.com By (author) : Henry Garrett Number
of pages:68Published on:2021-04-06Stock:Available Category: Mathematics Price:39.90
Keywords:Zwei Modelle, Optimierung von Routen und Transport, Two Models, Optimizing
Routes and Transportation
MoreBooksHenry Garrett Modell-Analysen und Anleitungen darüber hinaus (Paperback)
About this item
Product details
Die Herangehensweise zur Lösung von Problemen ist eine offensichtliche Auswahl für die
Forschung und Analyse der Situation, die die vagen Perspektiven, die wir nicht sein wollen,
für die Extraktion von kreativen und neuen Ideen, die wir sein wollen, hervorbringen kann.
Ich studiere gleichzeitig zwei Modelle. Diese Studie basiert sowohl auf der Forschung als
auch auf der Diskussion, von der der Autor denkt, dass sie für das Verständnis und das
Zusammenwachsen unserer Fantasie und Realität nützlich sein kann. Modell-Analysen und
Anleitungen darüber hinaus (Paperback) We aim to show you accurate product information.
Manufacturers, suppliers and others provide what you see here, and we have not verified it.
See our disclaimer Specifications
Language German Publisher KS Omniscriptum Publishing Book Format Paperback Number
of Pages 68 Author Henry Garrett Title Modell-Analysen und Anleitungen darüber hinaus
ISBN-13 9786203599015 Publication Date April, 2021 Assembled Product Dimensions (L x W
x H) 9.00 x 6.00 x 1.50 Inches ISBN-10 6203599018
Walmart
Seller assumes all responsibility for this listing. Item specifics Condition: New: A new, unread,
unused book in perfect condition with no missing or damaged pages. See the ... Read
moreabout the condition ISBN: 9786203599015 EAN: 9786203599015 Publication Year: 2021
Type: Textbook Format: Paperback Language: German Publication Name: Modell-Analysen
Und Anleitungen Daruber Hinaus Item Height: 229mm Author: Henry Garrett Publisher:
Verlag Unser Wissen Item Width: 152mm Subject: Mathematics Item Weight: 113g Number of
Pages: 68 Pages About this product Product Information Die Herangehensweise zur Loesung
von Problemen ist eine offensichtliche Auswahl fur die Forschung und Analyse der Situation, die
die vagen Perspektiven, die wir nicht sein wollen, fur die Extraktion von kreativen und neuen
Ideen, die wir sein wollen, hervorbringen kann. Ich studiere gleichzeitig zwei Modelle. Diese
Studie basiert sowohl auf der Forschung als auch auf der Diskussion, von der der Autor denkt,
dass sie fur das Verstandnis und das Zusammenwachsen unserer Fantasie und Realitat nutzlich
sein kann. Product Identifiers Publisher Verlag Unser Wissen ISBN-13 9786203599015 eBay
Product ID (ePID) 11049032082 Product Key Features Publication Name Modell-Analysen
Und Anleitungen Daruber Hinaus Format Paperback Language German Subject Mathematics
Publication Year 2021 Type Textbook Author Henry Garrett Number of Pages 68 Pages
Dimensions Item Height 229mm Item Width 152mm Item Weight 113g Additional Product
Features Title
A uthorHenryGarrett
eBay
Modell-Analysen und Anleitungen darüber hinaus: Ansatz und Probleme in zwei Modellen
(German Edition) Publisher : Verlag Unser Wissen (April 6, 2021) Language : German
Paperback : 68 pages ISBN-10 : 6203599018 ISBN-13 : 978-6203599015 Item Weight : 3.99
ounces Dimensions : 5.91 x 0.16 x 8.66 inches Paperback

2021 0001 | Model Analyses and Guidance Beyond Amazon&MoreBooks

 9169
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett @gmail.com · Manhattan, NY, USA
Model Analyses and Guidance Beyond Approach and Problems in Two Models LAP
LAMBERT Academic Publishing (2020-12-02 ) eligible for voucher ISBN-13: 978-620-3-19506-
4 ISBN-10:6203195065EAN:9786203195064Book language: English Blurb/Shorttext:Approach
for solving problems is an obvious selection for doing research and analysis the situation
which may elicit the vague perspectives which we want not to be for extracting creative
and new ideas which we want to be. I simultaneously study two models. This study is based
both research and discussion which the author thinks that may be useful for understanding
and growing our fantasizing and reality together.Publishing house: LAP LAMBERT
Academic Publishing Website: https://www.lap-publishing.com/ By (author) : Henry Garrett
Number of pages:52Published on:2020-12-02Stock:Available Category: Mathematics Price:39.90
Keywords:Two Models, Optimizing Routes and Transportation
MoreBooks
Model Analyses and Guidance Beyond: Approach and Problems in Two Models Publisher :
LAP LAMBERT Academic Publishing (December 2, 2020) Language : English Paperback : 52
pages ISBN-10 : 6203195065 ISBN-13 : 978-6203195064 Item Weight : 3.39 ounces Dimensions
: 5.91 x 0.12 x 8.66 inches
 9170
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett @gmail.com · Manhattan, NY, USA

Participating in Seminars

I’ve participated in all virtual conferences which are listed below [Some of them without selective process].

–https://web.math.princeton.edu/ pds/onlinetalks/talks.html
...

Also, I’ve participated in following events [Some of them without selective process]:

-The Hidden NORMS seminar

-Talk Math With Your Friends (TMWYF)
-MATHEMATICS COLLOQUIUM: https://www.csulb.edu/mathematics-statistics/mathematics-colloquium
-Lathisms: Cafe Con Leche
-Big Math network
...

I’m in mailing list in following [Some of them without selective process] organizations:

-[Algebraic-graph-theory] AGT Seminar (lists-uwaterloo-ca)

-Combinatorics Lectures Online (https://web.math.princeton.edu/ pds/onlinetalks/talks.html)
-Women in Combinatorics
-CMSA-Seminar (unsw-au)
-OURFA2M2 Online Undergraduate Resource Fair for the Advancement and Alliance of Marginalized Mathematicians
...
 9171
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett @gmail.com · Manhattan, NY, USA

Social Accounts
I’ve listed my accounts below.

-My website [Covering all my contributions containing articles and books as free access to download with PDF
extension and more]: https://drhenrygarrett.wordpress.com

-Amazon [Some of my all books, here]: https://www.amzn.com/author/drhenrygarrett

-Twitter: @DrHenryGarrett (www.twitter.com/DrHenryGarrett)

– ResearchGate: https://www.researchgate.net/profile/Henry-Garrett-2

-Academia: https://independent.academia.edu/drhenrygarrett/

-Scribd: https://www.scribd.com/user/596815491/Henry-Garrett

-Scholar: https://scholar.google.com/citations?hl=enuser=SUjFCmcAAAAJview_op=list_workssortby=pubdate

-LinkedIn: https://www.linkedin.com/in/drhenrygarrett/
 9172
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett @gmail.com · Manhattan, NY, USA

References
2017-2022 Dr. Henry Garrett WEBSITE

Department of Mathematics, Independent Researcher, Manhattan, NY, USA.

E-mail address: DrHenryGarrett @gmail.com

2017-2022 Dr. Henry Garrett WEBSITE

Department of Mathematics, Independent Researcher, Manhattan, NY, USA.

E-mail address: HenryGarrettNY @gmail.com

DrHenryGarrett.wordpress.com · Twitter.com/DrHenryGarrett
9173