Hamiltonian-Cycle-

Neighbor In
SuperHyperGraphs
Ideas | Approaches | Accessibility | Availability

Dr. Henry Garrett

Report | Exposition | References | Research #22 2023
 Contents

Contents iii

List of Figures vi

List of Tables xi

1 ABSTRACT 1

2 Background 13

Bibliography 19

3 Acknowledgements 39

4 Cancer In Extreme SuperHyperGraph 41

5 Extreme Hamiltonian-Cycle-Neighbor 45

6 New Ideas On Super Nebulous By Hyper Nebbish Of Hamiltonian-Cycle-

Neighbor 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-Cycle-Neighbor 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-Cycle-Neighbor 245

26 New Ideas In Recognition of Cancer And Neutrosophic SuperHyper-

Graph By Hamiltonian-Cycle-Neighbor As Hyper Nebbish On Super
Nebulous 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-Cycle-Neighbor 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 323

33 Neutrosophic Applications in Cancer’s Neutrosophic Recognition 335

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

perBipartite as Neutrosophic SuperHyperModel 337

35 Case 2: The Increasing Neutrosophic Steps Toward Neutrosophic

SuperHyperMultipartite as Neutrosophic SuperHyperModel 339

36 Wondering Open Problems But As The Directions To Forming The

Motivations 341

37 Conclusion and Closing Remarks 343

38 Neutrosophic SuperHyperDuality But As The Extensions Excerpt From

Dense And Super Forms 345

39 Neutrosophic SuperHyperJoin But As The Extensions Excerpt From

Dense And Super Forms 359

40 Neutrosophic SuperHyperPerfect But As The Extensions Excerpt From

Dense And Super Forms 373

41 Neutrosophic SuperHyperTotal But As The Extensions Excerpt From

Dense And Super Forms 387

42 Neutrosophic SuperHyperConnected But As The Extensions Excerpt

From Dense And Super Forms 401

43 Background 415

Bibliography 421

44 Books’ Contributions 441

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

46 CV 477

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

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-Cycle-Neighbor in the Extreme Example (42.0.3) . . . . . . . . . 90
10.18The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
SuperHyperHamiltonian-Cycle-Neighbor in the Extreme Example (42.0.3) . . . . . . . . . 91
10.19The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
SuperHyperHamiltonian-Cycle-Neighbor in the Extreme Example (42.0.3) . . . . . . . . . 92
10.20The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
SuperHyperHamiltonian-Cycle-Neighbor in the Extreme Example (42.0.3) . . . . . . . . . 93
10.21The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
SuperHyperHamiltonian-Cycle-Neighbor in the Extreme Example (42.0.3) . . . . . . . . . 94
10.22The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
SuperHyperHamiltonian-Cycle-Neighbor in the Extreme Example (42.0.3) . . . . . . . . . 95

11.1 an Extreme SuperHyperPath Associated to the Notions of Extreme

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

14.1 an Extreme SuperHyperBipartite Associated to the Notions of Extreme

SuperHyperHamiltonian-Cycle-Neighbor . . . . . . . . . . . . . . . . . . . . . . . . . . . . 137

15.1 an Extreme SuperHyperMultipartite Associated to the Notions of Extreme

SuperHyperHamiltonian-Cycle-Neighbor . . . . . . . . . . . . . . . . . . . . . . . . . . . . 139

30.1 The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions

of Neutrosophic SuperHyperHamiltonian-Cycle-Neighbor in the Neutrosophic Example
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 277
30.2 The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions
of Neutrosophic SuperHyperHamiltonian-Cycle-Neighbor in the Neutrosophic Example
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 278
30.3 The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions
of Neutrosophic SuperHyperHamiltonian-Cycle-Neighbor in the Neutrosophic Example
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 279
30.4 The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions
of Neutrosophic SuperHyperHamiltonian-Cycle-Neighbor in the Neutrosophic Example
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 279
30.5 The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions
of Neutrosophic SuperHyperHamiltonian-Cycle-Neighbor 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-Cycle-Neighbor in the Neutrosophic Example
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 281
30.7 The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions
of Neutrosophic SuperHyperHamiltonian-Cycle-Neighbor in the Neutrosophic Example
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 282
30.8 The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions
of Neutrosophic SuperHyperHamiltonian-Cycle-Neighbor in the Neutrosophic Example
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 283
30.9 The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions
of Neutrosophic SuperHyperHamiltonian-Cycle-Neighbor in the Neutrosophic Example
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 284
30.10The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions
of Neutrosophic SuperHyperHamiltonian-Cycle-Neighbor in the Neutrosophic Example
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 284
30.11The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions
of Neutrosophic SuperHyperHamiltonian-Cycle-Neighbor in the Neutrosophic Example
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 285
30.12The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions
of Neutrosophic SuperHyperHamiltonian-Cycle-Neighbor in the Neutrosophic Example
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 286
30.13The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions
of Neutrosophic SuperHyperHamiltonian-Cycle-Neighbor in the Neutrosophic Example
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 287
30.14The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions
of Neutrosophic SuperHyperHamiltonian-Cycle-Neighbor in the Neutrosophic Example
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 288
30.15The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions
of Neutrosophic SuperHyperHamiltonian-Cycle-Neighbor in the Neutrosophic Example
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 289
30.16The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions
of Neutrosophic SuperHyperHamiltonian-Cycle-Neighbor in the Neutrosophic Example
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 290
30.17The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions
of Neutrosophic SuperHyperHamiltonian-Cycle-Neighbor in the Neutrosophic Example
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 290
30.18The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions
of Neutrosophic SuperHyperHamiltonian-Cycle-Neighbor in the Neutrosophic Example
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 291
30.19The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions
of Neutrosophic SuperHyperHamiltonian-Cycle-Neighbor in the Neutrosophic Example
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 292
30.20The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions
of Neutrosophic SuperHyperHamiltonian-Cycle-Neighbor 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-Cycle-Neighbor in the Neutrosophic Example
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 294
30.22The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions
of Neutrosophic SuperHyperHamiltonian-Cycle-Neighbor in the Neutrosophic Example
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 295

31.1 a Neutrosophic SuperHyperPath Associated to the Notions of Neutrosophic

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

34.1 a Neutrosophic SuperHyperBipartite Associated to the Notions of Neutrosophic

SuperHyperHamiltonian-Cycle-Neighbor . . . . . . . . . . . . . . . . . . . . . . . . . . . . 337

35.1 a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic

SuperHyperHamiltonian-Cycle-Neighbor . . . . . . . . . . . . . . . . . . . . . . . . . . . . 339

44.1 Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Hamiltonian-
Cycle-Neighbor In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”,
Zenodo 2023, (doi: 10.5281/zenodo.7796354). . . . . . . . . . . . . . . . . . . . . . 442
44.2 Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Hamiltonian-
Cycle-Neighbor In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”,
Zenodo 2023, (doi: 10.5281/zenodo.7796354). . . . . . . . . . . . . . . . . . . . . . 443
44.3 Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Hamiltonian-
Cycle-Neighbor In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”,
Zenodo 2023, (doi: 10.5281/zenodo.7796354). . . . . . . . . . . . . . . . . . . . . . 443
44.4 Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHy-
perGraph By Hamiltonian-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”,
Zenodo 2023, (doi: 10.5281/zenodo.7796334). . . . . . . . . . . . . . . . . . . . . . 444
44.5 Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHy-
perGraph By Hamiltonian-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”,
Zenodo 2023, (doi: 10.5281/zenodo.7796334). . . . . . . . . . . . . . . . . . . . . . 445
44.6 Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHy-
perGraph By Hamiltonian-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”,
Zenodo 2023, (doi: 10.5281/zenodo.7796334). . . . . . . . . . . . . . . . . . . . . . 445

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

Henry Garrett · 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 . . . . . . . . . . . . . . . . 451

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

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

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

Belong to The Neutrosophic SuperHyperMultipartite . . . . . . . . . . . . . . . . . 340

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

xi
 CHAPTER 1

ABSTRACT

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

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

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

more (Extremely/Neutrosophicly) understandable. 9

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

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

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

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

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

following expressions hold for the (Neutrosophic) cardinalities of SuperHyperNeighbors of 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-Cycle-Neighbor 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-Cycle-Neighbor In SuperHyperGraphs . Since there’s more ways to get type-results 43
to make a Hamiltonian-Cycle-Neighbor In SuperHyperGraphs more understandable. For the 44
sake of having Neutrosophic Hamiltonian-Cycle-Neighbor In SuperHyperGraphs, there’s a 45

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

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

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

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

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

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

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

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

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

holds. It’s useful to define “Neutrosophic” version of SuperHyperClasses. Since there’s more 75
ways to get Neutrosophic type-results to make a Neutrosophic Hamiltonian-Cycle-Neighbor In 76
SuperHyperGraphs more understandable. Assume a Neutrosophic SuperHyperGraph. There 77
are some Neutrosophic SuperHyperClasses if the intended Table holds. Thus SuperHyperPath, 78
Hamiltonian-Cycle-Neighbor In SuperHyperGraphs, SuperHyperStar, SuperHyperBipartite, 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

SuperHyperMultiPartite, and SuperHyperWheel, are “Neutrosophic SuperHyperPath”, “Neut- 80

rosophic Hamiltonian-Cycle-Neighbor In SuperHyperGraphs”, “Neutrosophic SuperHyperStar”, 81
“Neutrosophic SuperHyperBipartite”, “Neutrosophic SuperHyperMultiPartite”, and “Neutro- 82
sophic SuperHyperWheel” if the intended Table holds. A SuperHyperGraph has a “Neutrosophic 83
Hamiltonian-Cycle-Neighbor In SuperHyperGraphs” where it’s the strongest [the maximum 84
Neutrosophic value from all the Hamiltonian-Cycle-Neighbor In SuperHyperGraphs amid 85

the maximum value amid all SuperHyperVertices from a Hamiltonian-Cycle-Neighbor In 86

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

only one SuperVertex as intersection amid two given SuperHyperEdges; it’s SuperHyperStar it’s 92
only one SuperVertex as intersection amid all SuperHyperEdges; it’s SuperHyperBipartite it’s 93
only one SuperVertex as intersection amid two given SuperHyperEdges and these SuperVertices, 94
forming two separate sets, has no SuperHyperEdge in common; it’s SuperHyperMultiPartite it’s 95
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 112
be Neutrosophic SuperHyperGraph] to have convenient perception on what’s happened and 113
what’s done. There are some specific models, which are well-known and they’ve got the names, 114

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

longest Hamiltonian-Cycle-Neighbor In SuperHyperGraphs, called Hamiltonian-Cycle-Neighbor 121

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

Henry Garrett · 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-Cycle-Neighbor In SuperHyperGraphs. There isn’t any 126

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

Graphs, Cancer’s Recognition 132

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

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

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

upcoming research. The special case is up. The cells are viewed in the deemed ways. There are 146
different types of them. Some of them are individuals and some of them are well-modeled by 147
the group of cells. These types are all officially called “SuperHyperVertex” but the relations 148
amid them all officially called “SuperHyperEdge”. The frameworks “SuperHyperGraph” and 149
“Neutrosophic SuperHyperGraph” are chosen and elected to scientific research about “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 154
an “δ−Hamiltonian-Cycle-Neighbor In SuperHyperGraphs” is a maximal Hamiltonian-Cycle- 155
Neighbor In SuperHyperGraphs of SuperHyperVertices with maximum cardinality such that 156
either of the following expressions hold for the (Neutrosophic) cardinalities of SuperHyper- 157

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

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

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

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

having Neutrosophic Hamiltonian-Cycle-Neighbor 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-Cycle-Neighbor 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-Cycle-Neighbor In SuperHyperGraphs . It’s redefined Neut- 174
rosophic Hamiltonian-Cycle-Neighbor In SuperHyperGraphs if the mentioned Table holds, 175
concerning, “The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges 176

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

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

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

titled “Hamiltonian-Cycle-Neighbor 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-Cycle-Neighbor In SuperHyperGraphs . For the sake of 191
having Neutrosophic Hamiltonian-Cycle-Neighbor In SuperHyperGraphs, there’s a need to 192
“redefine” the notion of “Neutrosophic Hamiltonian-Cycle-Neighbor In SuperHyperGraphs” and 193
“Neutrosophic Hamiltonian-Cycle-Neighbor In SuperHyperGraphs ”. The SuperHyperVertices 194

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

to get Neutrosophic type-results to make Neutrosophic Hamiltonian-Cycle-Neighbor In Supe- 201

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

“Neutrosophic Hamiltonian-Cycle-Neighbor In SuperHyperGraphs”, “Neutrosophic Super- 206

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

In SuperHyperGraphs .] Hamiltonian-Cycle-Neighbor In SuperHyperGraphs . A graph is 212

SuperHyperUniform if it’s SuperHyperGraph and the number of elements of SuperHyperEdges 213
are the same. Assume a Neutrosophic SuperHyperGraph. There are some SuperHyperClasses as 214
follows. It’s SuperHyperPath if it’s only one SuperVertex as intersection amid two given Super- 215
HyperEdges with two exceptions; it’s Hamiltonian-Cycle-Neighbor 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-Cycle-Neighbor In SuperHyperGraphs, SuperHyperStar, Supe- 243
rHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find either the 244
longest Hamiltonian-Cycle-Neighbor In SuperHyperGraphs or the strongest Hamiltonian-Cycle- 245
Neighbor In SuperHyperGraphs in those Neutrosophic SuperHyperModels. For the longest 246

Hamiltonian-Cycle-Neighbor In SuperHyperGraphs, called Hamiltonian-Cycle-Neighbor In 247

SuperHyperGraphs, and the strongest Hamiltonian-Cycle-Neighbor In SuperHyperGraphs, 248
called Neutrosophic Hamiltonian-Cycle-Neighbor 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-Cycle-Neighbor In SuperHyperGraphs. There isn’t any 252

formation of any Hamiltonian-Cycle-Neighbor In SuperHyperGraphs but literarily, it’s the 253
deformation of any Hamiltonian-Cycle-Neighbor In SuperHyperGraphs. It, literarily, deforms 254
and it doesn’t form. A basic familiarity with SuperHyperGraph theory and Neutrosophic 255
SuperHyperGraph theory are proposed. 256
Keywords: Neutrosophic SuperHyperGraph, Neutrosophic Hamiltonian-Cycle-Neighbor 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-Cycle-Neighbor 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 Failed 382
SuperHyperClique on Cancer’s Recognition called Neutrosophic SuperHyperGraphs” in Ref. 383
[HG27] by Henry Garrett (2023), “Perfect Directions Toward Idealism in Cancer’s Neutrosophic 384

Recognition Forwarding Neutrosophic SuperHyperClique on Neutrosophic SuperHyperGraphs” 385

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

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

(Neutrosophic) SuperHyperGraphs” in Ref. [HG33] by Henry Garrett (2023), “Neutrosophic 1- 397

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

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

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

HG134; HG135; HG136; HG137; HG138; HG139; HG140; HG141; HG142; HG143; 414
HG144; HG145; HG146; HG147; HG148; HG149; HG150; HG151; HG152; HG153; 415
HG154; HG155; HG156; HG157; HG158; HG159; HG160; HG161; HG162; HG163; 416
HG164; HG165; HG166; HG167; HG168; HG169; HG170; HG171; HG172; HG173; 417
HG174; HG175; HG176; HG177; HG178; HG179; HG180; HG181; HG182; HG183; 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

HG184; HG185; HG186; HG187; HG188; HG189; HG190; HG191; HG192; HG193; 419
HG194; HG195; HG196; HG197; HG198; HG199; HG200; HG201; HG202; HG203; 420
HG204; HG205; HG206; HG207; HG208; HG209; HG210; HG211; HG212; HG213; 421
HG214; HG215; HG216; HG217; HG218; HG219; HG220; HG221; HG222; HG223; 422
HG224; HG225; HG226; HG228], there are some endeavors to formalize the basic Super- 423
HyperNotions about neutrosophic SuperHyperGraph and SuperHyperGraph alongside scientific 424

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

HG115b; HG116b; HG117b; HG118b; HG119b; HG120b; HG121b; HG122b; 431

HG123b; HG124b; HG125b; HG126b; HG127b; HG128b; HG129b; HG130b; 432
HG131b; HG132b; HG133b; HG134b; HG135b; HG136b; HG137b; HG138b; 433
HG139b; HG140b; HG141b; HG142b; HG143b; HG144b; HG145b; HG146b; 434
HG147b; HG148b; HG149b; HG150b; HG151b; HG152b; HG153b; HG154b]. Two 435
popular scientific research books in Scribd in the terms of high readers, 4190 and 5189 respect- 436

ively, on neutrosophic science is on [HG32b; HG44b]. 437

Some scientific studies and scientific researches about neutrosophic graphs, are proposed as 438
book in Ref. [HG71b] by Henry Garrett (2023) which is indexed by Google Scholar and has 439
more than 4190 readers in Scribd. It’s titled “Beyond Neutrosophic Graphs” and published 440
by Dr. Henry Garrett. This research book covers different types of notions and settings in 441
neutrosophic graph theory and neutrosophic SuperHyperGraph theory. 442

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

set and the intended set, simultaneously. It’s smart to consider a set but acting on its 449
complement that what’s done in this research book which is popular in the terms of high readers 450
in Scribd. 451
See the seminal scientific researches [HG1; HG2; HG3]. The formalization of the notions on 452
the framework of notions in SuperHyperGraphs, Neutrosophic notions in SuperHyperGraphs the- 453

ory, and (Neutrosophic) SuperHyperGraphs theory at [HG4; HG5; HG6; HG7; HG8; HG9; 454
HG10; HG11; HG12; HG13; HG14; HG15; HG16; HG17; HG18; HG19; HG20; 455
HG21; HG22; HG23; HG24; HG25; HG26; HG27; HG28; HG29; HG30; HG31; 456
HG32; HG33; HG34; HG35; HG36; HG37; HG38; HG94; HG942; HG95; HG952; 457
HG96; HG962; HG97; HG972; HG98; HG982; HG106; HG107; HG111; HG112; 458
HG115; HG116; HG120; HG121; HG122; HG123; HG124; HG125; HG126; HG127; 459

HG128; HG129; HG130; HG131; HG132; HG134; HG135; HG136; HG137; HG138; 460
HG139; HG140; HG141; HG142; HG143; HG144; HG145; HG146; HG147; HG148; 461
HG149; HG150; HG151; HG152; HG153; HG154; HG155; HG156; HG157; HG158; 462
HG159; HG160; HG161; HG162; HG163; HG164; HG165; HG166; HG167; HG168; 463
HG169; HG170; HG171; HG172; HG173; HG174; HG175; HG176; HG177; HG178; 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

HG179; HG180; HG181; HG182; HG183; HG184; HG185; HG186; HG187; HG188; 465
HG189; HG190; HG191; HG192; HG193; HG194; HG195; HG196; HG197; HG198; 466
HG199; HG200; HG201; HG202; HG203; HG204; HG205; HG206; HG207; HG208; 467
HG209; HG210; HG211; HG212; HG213; HG214; HG215; HG216; HG217; HG218; 468
HG219; HG220; HG221; HG222; HG223; HG224; HG225; HG226; HG228] alongside 469
scientific research books at [HG60b; HG61b; HG62b; HG63b; HG64b; HG65b; HG66b; 470

HG67b; HG68b; HG69b; HG70b; HG71b; HG72b; HG73b; HG74b; HG75b; HG76b; 471
HG77b; HG78b; HG79b; HG80b; HG81b; HG82b; HG83b; HG84b; HG85b; HG86b; 472
HG87b; HG88b; HG89b; HG90b; HG91b; HG92b; HG93b; HG94b; HG95b; HG96b; 473
HG97b; HG98b; HG99b; HG100b; HG101b; HG102b; HG103b; HG104b; HG105b; 474
HG106b; HG107b; HG108b; HG109b; HG110b; HG111b; HG112b; HG113b; 475
HG114b; HG115b; HG116b; HG117b; HG118b; HG119b; HG120b; HG121b; 476

HG122b; HG123b; HG124b; HG125b; HG126b; HG127b; HG128b; HG129b; 477

HG130b; HG131b; HG132b; HG133b; HG134b; HG135b; HG136b; HG137b; 478
HG138b; HG139b; HG140b; HG141b; HG142b; HG143b; HG144b; HG145b; 479
HG146b; HG147b; HG148b; HG149b; HG150b; HG151b; HG152b; HG153b; 480
HG154b]. Two popular scientific research books in Scribd in the terms of high readers, 481
4190 and 5189 respectively, on neutrosophic science is on [HG32b; HG44b]. 482

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

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

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

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

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

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

alongside-a.pdf) 496

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

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

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

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

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

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 512
Cancer’s Recognition as the Model in The Setting of (Neutrosophic) SuperHyperGraphs”, 513
Preprints 2023, 2023010308 (doi: 10.20944/preprints202301.0308.v1). 514

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Henry Garrett · 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 552
SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints”, 553
Preprints 2023, 2023010088 (doi: 10.20944/preprints202301.0088.v1). 554

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

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

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

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

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

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

HG228 [25] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph 571
By Hamiltonian-Cycle-Neighbor As Hyper Decompress On Super Decompensation”, 572

Zenodo 2023, (doi: 10.5281/zenodo.7793372). 573

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

HG225 [27] Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Cycle- 577

Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, 578

(doi: 10.5281/zenodo.7791982). 579

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

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

HG222 [30] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph 586
By Hamiltonian-Decomposition As Hyper Decompress On Super Decompensation”, Zenodo 587

2023, (doi: 10.5281/zenodo.7787066). 588

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

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

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

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

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

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

HG215 [36] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 604
By Trace-Decomposition As Hyper Decompress On Super Decompensation”, Zenodo 2023, 605
(doi: 10.5281/zenodo.7771831). 606

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

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

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

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

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

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

HG208 [43] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of 625
Edge-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 626

ResearchGate 2023, (doi: 10.13140/RG.2.2.29544.34564). 627

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

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

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

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

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

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

HG202 [49] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of 643
Vertex-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 644
ResearchGate 2023, (doi: 10.13140/RG.2.2.18468.76169). 645

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

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

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

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

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

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

HG195 [56] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyper- 664
Graph By Stable-Cut As Hyper Stain On Super Stagy”, ResearchGate 2023, (doi: 665

10.13140/RG.2.2.23525.68320). 666

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

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

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

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

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

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

HG189 [62] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyper- 682
Graph By Clique-Cut As Hyper Click On Super Cliche”, ResearchGate 2023, (doi: 683
10.13140/RG.2.2.26134.01603). 684

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

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

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

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

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

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

HG182 [69] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 703
By Edge-Connectivity As Hyper Disclosure On Super Closure”, ResearchGate 2023, (doi: 704

10.13140/RG.2.2.28552.29445). 705

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

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

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

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

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

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

HG176 [75] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyper- 721
Graph By Chord As Hyper Excellence On Super Excess”, ResearchGate 2023, (doi: 722
10.13140/RG.2.2.13059.58401). 723

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

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

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

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

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

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

HG169 [82] Henry Garrett, “New Ideas On Super Harmony By Hyper k-Function Of SuperHyperK- 742
Domination In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchG- 743

ate 2023, (doi: 10.13140/RG.2.2.23299.58404). 744

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

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

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

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

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

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

HG163 [88] Henry Garrett, “New Ideas On Super Relations By Hyper Identifications Of SuperHyper- 760
Coloring In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 761
2023, (doi: 10.13140/RG.2.2.34106.47047). 762

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

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

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

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

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

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

HG156 [95] Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of SuperHyperCon- 781
nected In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 782

2023, (doi: 10.13140/RG.2.2.31891.35367). 783

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

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

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

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

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

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

HG150 [101] Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of 799
SuperHyperJoin In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, 800
ResearchGate 2023, (doi: 10.13140/RG.2.2.17761.79206). 801

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

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

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

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

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

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

HG143 [108] Henry Garrett, “New Research On Cancer’s Recognition and Neutrosophic SuperHyper- 820
Graph By Eulerian SuperHyperCycles and Hamiltonian Sets As Hyper Covering Versus 821

Super separations-VI”, ResearchGate 2023, (doi: 10.13140/RG.2.2.29913.80482). 822

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

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

HG141 [110] Henry Garrett, “New Research On Cancer’s Recognition and Neutrosophic SuperHyper- 826
Graph By Eulerian SuperHyperCycles and Hamiltonian Sets As Hyper Covering Versus 827

Super separations-IV”, ResearchGate 2023, (doi: 10.13140/RG.2.2.34946.96960). 828

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

HG139 [112] Henry Garrett, “A Research On Cancer’s Recognition and Neutrosophic SuperHyperGraph 832

By Eulerian SuperHyperCycles and Hamiltonian Sets As Hyper Covering Versus Super 833
separations-II”, ResearchGate 2023, (doi: 10.13140/RG.2.2.15653.17125). 834

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

HG137 [114] Henry Garrett, “New Ideas On Super Disruptions In Cancer’s Extreme Recognition 838
As Neutrosophic SuperHyperGraph By Hyper Plans Called SuperHyperConnectivities”, 839
ResearchGate 2023, (doi: 10.13140/RG.2.2.29441.94562). 840

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

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

HG134 [117] Henry Garrett,“Eulerian and Hamiltonian In Cancer’s Neutrosophic Recognition and 847
Neutrosophic SuperHyperGraph On Super Interactions By Hyper Extensions of Cycles”, 848

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

HG132 [118] Henry Garrett,“SuperHyperGirth Type-Results on extreme SuperHyperGirth theory and 850
(Neutrosophic) SuperHyperGraphs Toward Cancer’s extreme Recognition”, Preprints 851
2023, 2023010396 (doi: 10.20944/preprints202301.0396.v1). 852

HG131 [119] Henry Garrett,“Neutrosophic SuperHyperGraphs Warns Hyper Landmark of neutrosophic 853

SuperHyperGirth In Super Type-Versions of Cancer’s neutrosophic Recognition”, Preprints 854

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

HG130 [120] Henry Garrett,“The Constructions of (Neutrosophic) SuperHyperGraphs on the Cancer’s 856
Recognition in The Confrontation With Super Attacks In Hyper Situations By 857
Implementing (Neutrosophic) 1-Failed SuperHyperForcing in The Technical Approaches to 858

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

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

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

Cancer’s Recognitions To Fail Forcing Style As the Super Classes With Hyper Effects 861
In The Background of the Framework is So-Called (Neutrosophic) SuperHyperGraphs”, 862
ResearchGate 2023, (doi: 10.13140/RG.2.2.12818.73925). 863

HG128 [122] Henry Garrett,“Super Actions On The Types of Hyper Levels In The Sensible 864
Neutrosophic SuperHyperGirth On Cancer’s Neutrosophic Recognition and Neutrosophic 865
SuperHyperGraph”, ResearchGate 2023,(doi: 10.13140/RG.2.2.26836.88960). 866

HG127 [123] Henry Garrett,“SuperHyperGirth Approaches on the Super Challenges on the Cancer’s 867
Recognition In the Hyper Model of (Neutrosophic) SuperHyperGraph”, ResearchGate 868
2023,(doi: 10.13140/RG.2.2.36745.93289). 869

HG126 [124] Henry Garrett,“Extreme SuperHyperClique as the Firm Scheme of Confrontation under 870

Cancer’s Recognition as the Model in The Setting of (Neutrosophic) SuperHyperGraphs”, 871

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

HG125 [125] Henry Garrett,“Uncertainty On The Act And Effect Of Cancer Alongside The Foggy 873
Positions Of Cells Toward Neutrosophic Failed SuperHyperClique inside Neutrosophic 874

SuperHyperGraphs Titled Cancer’s Recognition”, Preprints 2023, 2023010282 (doi: 875

10.20944/preprints202301.0282.v1). 876

HG124 [126] Henry Garrett,“Neutrosophic Version Of Separates Groups Of Cells In Cancer’s 877

Recognition On Neutrosophic SuperHyperGraphs”, Preprints 2023, 2023010267 (doi: 878

10.20944/preprints202301.0267.v1).). 879

HG123 [127] Henry Garrett, “The Shift Paradigm To Classify Separately The Cells and Affected 880
Cells Toward The Totality Under Cancer’s Recognition By New Multiple Definitions On 881

the Sets Polynomials Alongside Numbers In The (Neutrosophic) SuperHyperMatching 882

Theory Based on SuperHyperGraph and Neutrosophic SuperHyperGraph”, Preprints 883
2023, 2023010265 (doi: 10.20944/preprints202301.0265.v1). 884

HG122 [128] Henry Garrett,“Breaking the Continuity and Uniformity of Cancer In The Worst Case of 885

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

HG121 [129] Henry Garrett, “Neutrosophic Failed SuperHyperStable as the Survivors on the 889

Cancer’s Neutrosophic Recognition Based on Uncertainty to All Modes in Neutrosophic 890

SuperHyperGraphs”, Preprints 2023, 2023010240 (doi: 10.20944/preprints202301.0240.v1). 891

HG120 [130] Henry Garrett, “Extremism of the Attacked Body Under the Cancer’s Circumstances 892

Where Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 893

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

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

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

10.13140/RG.2.2.35061.65767). 897

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

HG25 [132] Henry Garrett,“The Focus on The Partitions Obtained By Parallel Moves In The 898
Cancer’s Extreme Recognition With Different Types of Extreme SuperHyperMatching 899
Set and Polynomial on (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 900
10.13140/RG.2.2.18494.15680). 901

HG26 [133] Henry Garrett,“Extreme Failed SuperHyperClique Decides the Failures on the Can- 902
cer’s Recognition in the Perfect Connections of Cancer’s Attacks By SuperHy- 903
perModels Named (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 904

10.13140/RG.2.2.32530.73922). 905

HG27 [134] Henry Garrett,“Indeterminacy On The All Possible Connections of Cells In Front 906
of Cancer’s Attacks In The Terms of Neutrosophic Failed SuperHyperClique on Can- 907
cer’s Recognition called Neutrosophic SuperHyperGraphs”, ResearchGate 2023, (doi: 908
10.13140/RG.2.2.15897.70243). 909

HG116 [135] Henry Garrett,“Extreme Failed SuperHyperClique Decides the Failures on the Can- 910
cer’s Recognition in the Perfect Connections of Cancer’s Attacks By SuperHy- 911

perModels Named (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 912

10.13140/RG.2.2.32530.73922). 913

HG115 [136] Henry Garrett, “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Recognitions 914
And (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010105 (doi: 10.20944/pre- 915
prints202301.0105.v1). 916

HG28 [137] Henry Garrett,“Perfect Directions Toward Idealism in Cancer’s Neutrosophic Recogni- 917
tion Forwarding Neutrosophic SuperHyperClique on Neutrosophic SuperHyperGraphs”, 918
ResearchGate 2023, (doi: 10.13140/RG.2.2.30092.80004). 919

HG29 [138] Henry Garrett,“Demonstrating Complete Connections in Every Embedded Regions 920

and Sub-Regions in the Terms of Cancer’s Recognition and (Neutrosophic) Su- 921
perHyperGraphs With (Neutrosophic) SuperHyperClique”, ResearchGate 2023, (doi: 922
10.13140/RG.2.2.23172.19849). 923

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

HG111 [140] Henry Garrett, “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic 927

SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints”, 928

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

HG30 [141] Henry Garrett,“Different Neutrosophic Types of Neutrosophic Regions titled neut- 930
rosophic Failed SuperHyperStable in Cancer’s Neutrosophic Recognition modeled 931
in the Form of Neutrosophic SuperHyperGraphs”, ResearchGate 2023, (doi: 932
10.13140/RG.2.2.17385.36968). 933

HG107 [142] Henry Garrett, “Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction 934
To Use Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition And 935

Beyond”, Preprints 2023, 2023010044 936

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

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

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

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

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

HG32 [145] Henry Garrett, “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic 943
SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints”, 944
ResearchGate 2023, (doi: 10.13140/RG.2.2.11447.80803). 945

HG33 [146] Henry Garrett, “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well- 946
SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 947
10.13140/RG.2.2.35774.77123). 948

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

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

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

10.13140/RG.2.2.29430.88642). 954

HG36 [149] Henry Garrett, “Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic) 955
SuperHyperModeling in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs”, 956
ResearchGate 2022, (doi: 10.13140/RG.2.2.11369.16487). 957

HG982 [150] Henry Garrett, “(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions Featuring 958
(Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, Preprints 2022, 2022120549 959
(doi: 10.20944/preprints202212.0549.v1). 960

HG98 [151] Henry Garrett, “(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions Featuring 961
(Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, ResearchGate 2022, (doi: 962
10.13140/RG.2.2.19380.94084). 963

HG972 [152] Henry Garrett, “(Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and 964

SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With 965

(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions And Related (Neutrosophic) 966
SuperHyperClasses”, Preprints 2022, 2022120540 (doi: 10.20944/preprints202212.0540.v1). 967

HG97 [153] Henry Garrett, “(Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and 968
SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With 969

(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions And Related (Neutrosophic) 970

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

HG962 [154] Henry Garrett, “SuperHyperGirth on SuperHyperGraph and Neutrosophic SuperHyper- 972
Graph With SuperHyperModeling of Cancer’s Recognitions”, Preprints 2022, 2022120500 973

(doi: 10.20944/preprints202212.0500.v1). 974

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

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

HG952 [156] Henry Garrett,“Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic Su- 978

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

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

HG95 [157] Henry Garrett, “Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic 981
SuperHyperGraphs And SuperHyperGraphs Alongside Applications in Cancer’s Treat- 982

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

HG942 [158] Henry Garrett, “SuperHyperDominating and SuperHyperResolving on Neutrosophic 984

SuperHyperGraphs And Their Directions in Game Theory and Neutrosophic SuperHyper- 985

Classes”, Preprints 2022, 2022110576 (doi: 10.20944/preprints202211.0576.v1). 986

HG94 [159] Henry Garrett, “SuperHyperDominating and SuperHyperResolving on Neutrosophic 987

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

HG37 [160] Henry Garrett, “Basic Neutrosophic Notions Concerning SuperHyperDominating and 990
Neutrosophic SuperHyperResolving in SuperHyperGraph”, ResearchGate 2022 (doi: 991
10.13140/RG.2.2.29173.86244). 992

HG38 [161] Henry Garrett, “Initial Material of Neutrosophic Preliminaries to Study Some Neutrosophic 993
Notions Based on Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic SuperHyper- 994
Graph (NSHG)”, ResearchGate 2022 (doi: 10.13140/RG.2.2.25385.88160). 995

HG154b [162] Henry Garrett, “Hamiltonian-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 996
2023 (doi: 10.5281/zenodo.7793875). 997

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

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

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

HG150b [166] Henry Garrett, “Hamiltonian-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1004

10.5281/zenodo.7783791). 1005

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

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

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

odo.7637762). 1011

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

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

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

HG144b [172] Henry Garrett, “Edge-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1016
(doi: 10.5281/zenodo.7758601). 1017

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

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

HG141b [175] Henry Garrett, “Vertex-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1022
(doi: 10.5281/zenodo.7749875). 1023

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

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

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

(doi: 10.5281/zenodo.7738635). 1029

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

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

HG135b [181] Henry Garrett, “Clique-Decompositions In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1034

(doi: 10.5281/zenodo.7730469). 1035

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

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

HG132b [184] Henry Garrett, “Space In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1040

odo.7709116). 1041

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

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

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

(doi: 10.5281/zenodo.7701906). 1047

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

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

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

HG126b [190] Henry Garrett, “Edge-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1052
10.5281/zenodo.7679410). 1053

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

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

HG123b [193] Henry Garrett, “Order In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1058
odo.7668648). 1059

HG122b [194] Henry Garrett, “Coloring In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1060
10.5281/zenodo.7662810). 1061

HG121b [195] Henry Garrett, “Dimension In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1062
10.5281/zenodo.7659162). 1063

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

odo.7653233). 1065

HG119b [197] Henry Garrett, “SuperHyperWheel”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1066
odo.7653204). 1067

HG118b [198] Henry Garrett, “SuperHyperMultipartite”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1068
odo.7653142). 1069

HG117b [199] Henry Garrett, “SuperHyperBipartite”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1070

odo.7653117). 1071

HG116b [200] Henry Garrett, “SuperHyperStar”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1072
odo.7653089). 1073

HG115b [201] Henry Garrett, “SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1074
odo.7651687). 1075

HG114b [202] Henry Garrett, “SuperHyperPath”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1076

odo.7651619). 1077

HG113b [203] Henry Garrett, “SuperHyperDomination”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1078
odo.7651439). 1079

HG112b [204] Henry Garrett, “SuperHyperDominating”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1080
odo.7650729). 1081

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

odo.7647868). 1083

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

HG110b [206] Henry Garrett, “SuperHyperTotal”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1084
odo.7647017). 1085

HG109b [207] Henry Garrett, “SuperHyperPerfect”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1086
odo.7644894). 1087

HG108b [208] Henry Garrett, “SuperHyperJoin”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1088
odo.7641880). 1089

HG107b [209] Henry Garrett, “Path SuperHyperColoring”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1090
odo.7632923). 1091

HG106b [210] Henry Garrett, “SuperHyperDensity”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1092
odo.7623459). 1093

HG105b [211] Henry Garrett, “Neutrosophic SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 1094
10.5281/zenodo.7606416). 1095

HG104b [212] Henry Garrett, “Extreme SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 1096
10.5281/zenodo.7606416). 1097

HG103b [213] Henry Garrett, “SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1098
odo.7606404). 1099

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

10.5281/zenodo.7580018). 1101

HG101b [215] Henry Garrett, “Extreme SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1102
odo.7580018). 1103

HG100b [216] Henry Garrett, “Extreme SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1104
odo.7580018). 1105

HG99b [217] Henry Garrett, “SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1106

odo.7579929). 1107

HG98b [218] Henry Garrett, “Neutrosophic SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 1108
10.5281/zenodo.7563170). 1109

HG97b [219] Henry Garrett, “Extreme SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1110
odo.7563164). 1111

HG96b [220] Henry Garrett, “SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1112

odo.7563160). 1113

HG95b [221] Henry Garrett, “Extreme SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1114
odo.7563160). 1115

HG94b [222] Henry Garrett, “Overlook On SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 1116
10.5281/zenodo.7563160). 1117

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

10.5281/zenodo.7557063). 1119

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

HG92b [224] Henry Garrett, “Extreme SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 1120
10.5281/zenodo.7557009). 1121

HG91b [225] Henry Garrett, “Overlook On SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 1122
10.5281/zenodo.7539484). 1123

HG90b [226] Henry Garrett, “Neutrosophic Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1124
10.5281/zenodo.7523390). 1125

HG89b [227] Henry Garrett, “Extreme Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1126
10.5281/zenodo.7523390). 1127

HG88b [228] Henry Garrett, “Overlook On Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1128
10.5281/zenodo.7523390). 1129

HG87b [229] Henry Garrett, “Extreme SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1130
odo.7574952). 1131

HG86b [230] Henry Garrett, “Neutrosophic SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1132
10.5281/zenodo.7574992). 1133

HG85b [231] Henry Garrett, “Extreme SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1134
odo.7523357). 1135

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

10.5281/zenodo.7523357). 1137

HG83b [233] Henry Garrett, “Neutrosophic Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1138
10.5281/zenodo.7504782). 1139

HG82b [234] Henry Garrett, “Extreme Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1140
10.5281/zenodo.7504782). 1141

HG81b [235] Henry Garrett, “Overlook On Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1142

10.5281/zenodo.7504782). 1143

HG80b [236] Henry Garrett, “Neutrosophic SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1144
10.5281/zenodo.7499395). 1145

HG79b [237] Henry Garrett, “Extreme SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1146
odo.7499395). 1147

HG78b [238] Henry Garrett, “Overlook On SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1148

10.5281/zenodo.7499395). 1149

HG77b [239] Henry Garrett, “Neutrosophic Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1150
10.5281/zenodo.7497450). 1151

HG76b [240] Henry Garrett, “Extreme Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1152
10.5281/zenodo.7497450). 1153

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

10.5281/zenodo.7494862). 1155

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

HG74b [242] Henry Garrett, “Extreme SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1156
odo.7494862). 1157

HG73b [243] Henry Garrett, “Overlook On SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1158
10.5281/zenodo.7494862). 1159

HG72b [244] Henry Garrett, “Neutrosophic SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 1160
10.5281/zenodo.7493845). 1161

HG71b [245] Henry Garrett, “Extreme SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 1162

10.5281/zenodo.7493845). 1163

HG70b [246] Henry Garrett, “Overlook On SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 1164
10.5281/zenodo.7493845). 1165

HG69b [247] Henry Garrett, “SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1166
odo.7539484). 1167

HG68b [248] Henry Garrett, “Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1168
odo.7523390). 1169

HG67b [249] Henry Garrett, “SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1170
odo.7523357). 1171

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

odo.7504782). 1173

HG65b [251] Henry Garrett, “SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1174
odo.7499395). 1175

HG64b [252] Henry Garrett, “Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1176
odo.7497450). 1177

HG63b [253] Henry Garrett, “SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1178
odo.7494862). 1179

HG62b [254] Henry Garrett, “SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1180
odo.7493845). 1181

HG61b [255] Henry Garrett, “SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1182

odo.7480110). 1183

HG60b [256] Henry Garrett, “Neut. SuperHyperEdges”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1184
odo.7378758). 1185

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

HG44b [258] Henry Garrett, “Neutrosophic Duality”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1188
odo.6677173). 1189

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

Acknowledgements 1191

The author is going to express his gratitude and his appreciation about the brains and their 1192
hands which are showing the importance of words in the framework of every wisdom, knowledge, 1193
arts, and emotions which are streaming in the lines from the words, notions, ideas and approaches The
1194 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
1195
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 1196
of acknowledgements
minds for surviving from them and making the outstanding experiences about the tools and the 1197
ideas to be on the star lines of words and shining like stars, forever. 1198

39
 CHAPTER 4 1199

Cancer In Extreme SuperHyperGraph 1200

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

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

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

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

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

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

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

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

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

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

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 1232
another motivation for us to do research on this SuperHyperModel based on the “Cancer’s 1233
Recognition”. Sometimes, the situations get worst. The situation is passed from the certainty 1234
and precise style. Thus it’s the beyond them. There are three descriptions, namely, the 1235
degrees of determinacy, indeterminacy and neutrality, for any object based on vague forms, 1236
namely, incomplete data, imprecise data, and uncertain analysis. The latter model could be 1237

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

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

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

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

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

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

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

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

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

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

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

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

Henry Garrett · 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 1277
amid this SuperHyperNotion with other SuperHyperNotions. It motivates us to get some 1278
instances and examples to make clarifications about the framework of this research. The general 1279
results and some results about some connections are some avenues to make key point of this 1280
research, “Cancer’s Recognition”, more understandable and more clear. 1281
Some SuperHyperClasses and some Extreme SuperHyperClasses are the cases of this research 1282

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

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

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

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

Extreme Hamiltonian-Cycle-Neighbor 1299

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

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

Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph By 1303
SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchGate 2023, 1304
(doi: 10.13140/RG.2.2.33275.80161). 1305
Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 1306
By SuperHyperJoin As Hyper Separations On Super Sorts”, ResearchGate 2023, (doi: 1307

10.13140/RG.2.2.11050.90569). 1308
Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of SuperHyperJoin 1309
In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 1310
10.13140/RG.2.2.17761.79206). 1311
Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 1312
By SuperHyperPerfect As Hyper Idealism On Super Vacancy”, ResearchGate 2023, (doi: 1313

10.13140/RG.2.2.19911.37285). 1314
Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect 1315
In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 1316
10.13140/RG.2.2.23266.81602). 1317
Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 1318
By SuperHyperTotal As Hyper Covering On Super Infections”, ResearchGate 2023, (doi: 1319

10.13140/RG.2.2.19360.87048). 1320
Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal 1321
In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 1322
10.13140/RG.2.2.32363.21286). 1323
Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 1324
By SuperHyperConnected As Hyper Group On Super Surge”, ResearchGate 2023, (doi: 1325

10.13140/RG.2.2.11758.69441). 1326
Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of SuperHyperConnected 1327
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 1328
10.13140/RG.2.2.31891.35367). 1329
Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 1330
By SuperHyperDominating As Hyper Closing On Super Messy”, ResearchGate 2023, (doi: 1331

10.13140/RG.2.2.21510.45125). 1332

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 1333
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 1334
10.13140/RG.2.2.13121.84321). 1335

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

New Ideas On Super Nebulous By Hyper 1337

Nebbish Of Hamiltonian-Cycle-Neighbor 1338

In Recognition of Cancer With 1339

(Neutrosophic) SuperHyperGraph 1340

47
 CHAPTER 7 1341

ABSTRACT 1342

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

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

Neighbor if the following expression is called Neutrosophic e-SuperHyperHamiltonian-Cycle-Neighbor 1347

criteria holds 1348

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

Neutrosophic re-SuperHyperHamiltonian-Cycle-Neighbor if the following expression is called Neutro- 1349

sophic e-SuperHyperHamiltonian-Cycle-Neighbor criteria holds 1350

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

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

SuperHyperHamiltonian-Cycle-Neighbor if the following expression is called Neutrosophic v- 1352
SuperHyperHamiltonian-Cycle-Neighbor criteria holds 1353

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

Neutrosophic rv-SuperHyperHamiltonian-Cycle-Neighbor if the following expression is called Neutro- 1354

sophic v-SuperHyperHamiltonian-Cycle-Neighbor criteria holds 1355

∀N (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 1356

SuperHyperHamiltonian-Cycle-Neighbor if it’s either of Neutrosophic e-SuperHyperHamiltonian-Cycle- 1357
Neighbor, Neutrosophic re-SuperHyperHamiltonian-Cycle-Neighbor, Neutrosophic v-SuperHyperHamiltonian- 1358
Cycle-Neighbor, and Neutrosophic rv-SuperHyperHamiltonian-Cycle-Neighbor. ((Neutrosophic) 1359
SuperHyperHamiltonian-Cycle-Neighbor). Assume a Neutrosophic SuperHyperGraph (NSHG) S 1360
is a pair S = (V, E). Consider a Neutrosophic SuperHyperEdge (NSHE) E = {V1 , V2 , . . . , Vs }. 1361

Then E is called an Extreme SuperHyperHamiltonian-Cycle-Neighbor if it’s either of Neutrosophic 1362

e-SuperHyperHamiltonian-Cycle-Neighbor, Neutrosophic re-SuperHyperHamiltonian-Cycle-Neighbor, Neut- 1363
rosophic v-SuperHyperHamiltonian-Cycle-Neighbor, and Neutrosophic rv-SuperHyperHamiltonian-Cycle- 1364
Neighbor and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum 1365
Extreme cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme 1366
SuperHyperEdges in the conseNeighborive Extreme sequence of Extreme SuperHyperEdges 1367

and Extreme SuperHyperVertices such that they form the Extreme SuperHyperHamiltonian- 1368
Cycle-Neighbor; a Neutrosophic SuperHyperHamiltonian-Cycle-Neighbor if it’s either of Neutrosophic 1369
e-SuperHyperHamiltonian-Cycle-Neighbor, Neutrosophic re-SuperHyperHamiltonian-Cycle-Neighbor, Neut- 1370
rosophic v-SuperHyperHamiltonian-Cycle-Neighbor, and Neutrosophic rv-SuperHyperHamiltonian-Cycle- 1371
Neighbor and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the max- 1372
imum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic 1373

SuperHyperSet S of high Neutrosophic cardinality conseNeighborive Neutrosophic Super- 1374

HyperEdges and Neutrosophic SuperHyperVertices such that they form the Neutrosophic 1375
SuperHyperHamiltonian-Cycle-Neighbor; an Extreme SuperHyperHamiltonian-Cycle-Neighbor SuperHyper- 1376
Polynomial if it’s either of Neutrosophic e-SuperHyperHamiltonian-Cycle-Neighbor, Neutrosophic 1377
re-SuperHyperHamiltonian-Cycle-Neighbor, Neutrosophic v-SuperHyperHamiltonian-Cycle-Neighbor, and 1378
Neutrosophic rv-SuperHyperHamiltonian-Cycle-Neighbor and C(N SHG) for an Extreme SuperHy- 1379

perGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme 1380
coefficients defined as the Extreme number of the maximum Extreme cardinality of the 1381
Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme cardinality 1382
conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 1383
form the Extreme SuperHyperHamiltonian-Cycle-Neighbor; and the Extreme power is corresponded 1384
to its Extreme coefficient; a Neutrosophic SuperHyperHamiltonian-Cycle-Neighbor SuperHyper- 1385

Polynomial if it’s either of Neutrosophic e-SuperHyperHamiltonian-Cycle-Neighbor, Neutrosophic 1386

re-SuperHyperHamiltonian-Cycle-Neighbor, Neutrosophic v-SuperHyperHamiltonian-Cycle-Neighbor, and 1387
Neutrosophic rv-SuperHyperHamiltonian-Cycle-Neighbor and C(N SHG) for a Neutrosophic SuperHy- 1388
perGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains the Neutrosophic 1389
coefficients defined as the Neutrosophic number of the maximum Neutrosophic cardinality of the 1390

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

ality conseNeighborive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices 1392
such that they form the Neutrosophic SuperHyperHamiltonian-Cycle-Neighbor; and the Neutrosophic 1393
power is corresponded to its Neutrosophic coefficient; an Extreme V-SuperHyperHamiltonian- 1394
Cycle-Neighbor if it’s either of Neutrosophic e-SuperHyperHamiltonian-Cycle-Neighbor, Neutrosophic 1395
re-SuperHyperHamiltonian-Cycle-Neighbor, Neutrosophic v-SuperHyperHamiltonian-Cycle-Neighbor, and 1396

Neutrosophic rv-SuperHyperHamiltonian-Cycle-Neighbor and C(N SHG) for an Extreme SuperHyper- 1397

Graph N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of 1398
high Extreme cardinality of the Extreme SuperHyperVertices in the conseNeighborive Extreme 1399
sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 1400
form the Extreme SuperHyperHamiltonian-Cycle-Neighbor; a Neutrosophic V-SuperHyperHamiltonian- 1401

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

Cycle-Neighbor if it’s either of Neutrosophic e-SuperHyperHamiltonian-Cycle-Neighbor, Neutrosophic 1402

re-SuperHyperHamiltonian-Cycle-Neighbor, Neutrosophic v-SuperHyperHamiltonian-Cycle-Neighbor, and 1403
Neutrosophic rv-SuperHyperHamiltonian-Cycle-Neighbor and C(N SHG) for a Neutrosophic Su- 1404
perHyperGraph N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neut- 1405
rosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic 1406
cardinality conseNeighborive Neutrosophic SuperHyperEdges and Neutrosophic SuperHy- 1407

perVertices such that they form the Neutrosophic SuperHyperHamiltonian-Cycle-Neighbor; an 1408

Extreme V-SuperHyperHamiltonian-Cycle-Neighbor SuperHyperPolynomial if it’s either of Neut- 1409
rosophic e-SuperHyperHamiltonian-Cycle-Neighbor, Neutrosophic re-SuperHyperHamiltonian-Cycle-Neighbor, 1410
Neutrosophic v-SuperHyperHamiltonian-Cycle-Neighbor, and Neutrosophic rv-SuperHyperHamiltonian- 1411
Cycle-Neighbor and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme 1412
SuperHyperPolynomial contains the Extreme coefficients defined as the Extreme number 1413

of the maximum Extreme cardinality of the Extreme SuperHyperVertices of an Extreme 1414

SuperHyperSet S of high Extreme cardinality conseNeighborive Extreme SuperHyperEdges 1415
and Extreme SuperHyperVertices such that they form the Extreme SuperHyperHamiltonian- 1416
Cycle-Neighbor; and the Extreme power is corresponded to its Extreme coefficient; a Neutro- 1417
sophic SuperHyperHamiltonian-Cycle-Neighbor SuperHyperPolynomial if it’s either of Neutrosophic 1418
e-SuperHyperHamiltonian-Cycle-Neighbor, Neutrosophic re-SuperHyperHamiltonian-Cycle-Neighbor, Neut- 1419

rosophic v-SuperHyperHamiltonian-Cycle-Neighbor, and Neutrosophic rv-SuperHyperHamiltonian-Cycle- 1420

Neighbor and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic 1421
SuperHyperPolynomial contains the Neutrosophic coefficients defined as the Neutrosophic 1422
number of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices 1423
of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality conseNeighborive Neut- 1424
rosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the 1425

Neutrosophic SuperHyperHamiltonian-Cycle-Neighbor; and the Neutrosophic power is correspon- 1426

ded to its Neutrosophic coefficient. In this scientific research, new setting is introduced 1427
for new SuperHyperNotions, namely, a SuperHyperHamiltonian-Cycle-Neighbor and Neutrosophic 1428
SuperHyperHamiltonian-Cycle-Neighbor. Two different types of SuperHyperDefinitions are debut 1429
for them but the research goes further and the SuperHyperNotion, SuperHyperUniform, and 1430
SuperHyperClass based on that are well-defined and well-reviewed. The literature review is 1431

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

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

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

Henry Garrett · 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 1448

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

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

and |S ∩ N (s)|N eutrosophic < |S ∩ (V \ N (s))|N eutrosophic + δ. The first Expression, holds 1455
if S is a Neutrosophic δ−SuperHyperOffensive. And the second Expression, holds if S 1456
is a Neutrosophic δ−SuperHyperDefensive It’s useful to define a “Neutrosophic” ver- 1457
sion of a SuperHyperHamiltonian-Cycle-Neighbor . Since there’s more ways to get type-results 1458
to make a SuperHyperHamiltonian-Cycle-Neighbor more understandable. For the sake of having 1459

Neutrosophic SuperHyperHamiltonian-Cycle-Neighbor, there’s a need to “redefine” the notion of a 1460

“SuperHyperHamiltonian-Cycle-Neighbor ”. The SuperHyperVertices and the SuperHyperEdges are 1461
assigned by the labels from the letters of the alphabets. In this procedure, there’s the usage 1462
of the position of labels to assign to the values. Assume a SuperHyperHamiltonian-Cycle-Neighbor . 1463
It’s redefined a Neutrosophic SuperHyperHamiltonian-Cycle-Neighbor if the mentioned Table holds, 1464
concerning, “The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges 1465

Belong to The Neutrosophic SuperHyperGraph” with the key points, “The Values of The 1466
Vertices & The Number of Position in Alphabet”, “The Values of The SuperVertices&The 1467
maximum Values of Its Vertices”, “The Values of The Edges&The maximum Values of Its 1468
Vertices”, “The Values of The HyperEdges&The maximum Values of Its Vertices”, “The 1469
Values of The SuperHyperEdges&The maximum Values of Its Endpoints”. To get structural 1470
examples and instances, I’m going to introduce the next SuperHyperClass of SuperHyperGraph 1471

based on a SuperHyperHamiltonian-Cycle-Neighbor . It’s the main. It’ll be disciplinary to have the 1472
foundation of previous definition in the kind of SuperHyperClass. If there’s a need to have all 1473
SuperHyperHamiltonian-Cycle-Neighbor until the SuperHyperHamiltonian-Cycle-Neighbor, then it’s officially 1474
called a “SuperHyperHamiltonian-Cycle-Neighbor” but otherwise, it isn’t a SuperHyperHamiltonian-Cycle- 1475
Neighbor . There are some instances about the clarifications for the main definition titled a 1476
“SuperHyperHamiltonian-Cycle-Neighbor ”. These two examples get more scrutiny and discernment 1477

since there are characterized in the disciplinary ways of the SuperHyperClass based on a 1478
SuperHyperHamiltonian-Cycle-Neighbor . For the sake of having a Neutrosophic SuperHyperHamiltonian- 1479
Cycle-Neighbor, there’s a need to “redefine” the notion of a “Neutrosophic SuperHyperHamiltonian- 1480
Cycle-Neighbor” and a “Neutrosophic SuperHyperHamiltonian-Cycle-Neighbor ”. The SuperHyperVertices 1481
and the SuperHyperEdges are assigned by the labels from the letters of the alphabets. In 1482

this procedure, there’s the usage of the position of labels to assign to the values. Assume 1483
a Neutrosophic SuperHyperGraph. It’s redefined “Neutrosophic SuperHyperGraph” if the 1484
intended Table holds. And a SuperHyperHamiltonian-Cycle-Neighbor are redefined to a “Neutrosophic 1485
SuperHyperHamiltonian-Cycle-Neighbor” if the intended Table holds. It’s useful to define “Neutro- 1486
sophic” version of SuperHyperClasses. Since there’s more ways to get Neutrosophic type-results 1487
to make a Neutrosophic SuperHyperHamiltonian-Cycle-Neighbor more understandable. Assume a 1488

Neutrosophic SuperHyperGraph. There are some Neutrosophic SuperHyperClasses if the inten- 1489
ded Table holds. Thus SuperHyperPath, SuperHyperHamiltonian-Cycle-Neighbor, SuperHyperStar, 1490
SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, are “Neutrosophic 1491
SuperHyperPath”, “Neutrosophic SuperHyperHamiltonian-Cycle-Neighbor”, “Neutrosophic SuperHy- 1492
perStar”, “Neutrosophic SuperHyperBipartite”, “Neutrosophic SuperHyperMultiPartite”, and 1493

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

“Neutrosophic SuperHyperWheel” if the intended Table holds. A SuperHyperGraph has a 1494

“Neutrosophic SuperHyperHamiltonian-Cycle-Neighbor” where it’s the strongest [the maximum Neut- 1495
rosophic value from all the SuperHyperHamiltonian-Cycle-Neighbor amid the maximum value amid 1496
all SuperHyperVertices from a SuperHyperHamiltonian-Cycle-Neighbor .] SuperHyperHamiltonian-Cycle- 1497
Neighbor . A graph is a SuperHyperUniform if it’s a SuperHyperGraph and the number of elements 1498
of SuperHyperEdges are the same. Assume a Neutrosophic SuperHyperGraph. There are some 1499

SuperHyperClasses as follows. It’s SuperHyperPath if it’s only one SuperVertex as intersection 1500
amid two given SuperHyperEdges with two exceptions; it’s SuperHyperHamiltonian-Cycle-Neighbor if 1501
it’s only one SuperVertex as intersection amid two given SuperHyperEdges; it’s SuperHyperStar 1502
it’s only one SuperVertex as intersection amid all SuperHyperEdges; it’s SuperHyperBipartite it’s 1503
only one SuperVertex as intersection amid two given SuperHyperEdges and these SuperVertices, 1504
forming two separate sets, has no SuperHyperEdge in common; it’s SuperHyperMultiPartite it’s 1505

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

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

in redeemed ways. The recognition of the cancer in the long-term function. The specific region 1518
has been assigned by the model [it’s called SuperHyperGraph] and the long cycle of the move 1519
from the cancer is identified by this research. Sometimes the move of the cancer hasn’t be easily 1520
identified since there are some determinacy, indeterminacy and neutrality about the moves 1521
and the effects of the cancer on that region; this event leads us to choose another model [it’s 1522
said to be Neutrosophic SuperHyperGraph] to have convenient perception on what’s happened 1523

and what’s done. There are some specific models, which are well-known and they’ve got the 1524
names, and some SuperHyperGeneral SuperHyperModels. The moves and the traces of the 1525
cancer on the complex tracks and between complicated groups of cells could be fantasized by a 1526
Neutrosophic SuperHyperPath(-/SuperHyperHamiltonian-Cycle-Neighbor, SuperHyperStar, SuperHy- 1527
perBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find either the longest 1528

SuperHyperHamiltonian-Cycle-Neighbor or the strongest SuperHyperHamiltonian-Cycle-Neighbor in those 1529

Neutrosophic SuperHyperModels. For the longest SuperHyperHamiltonian-Cycle-Neighbor, called 1530
SuperHyperHamiltonian-Cycle-Neighbor, and the strongest SuperHyperHamiltonian-Cycle-Neighbor, called 1531
Neutrosophic SuperHyperHamiltonian-Cycle-Neighbor, some general results are introduced. Beyond 1532
that in SuperHyperStar, all possible SuperHyperPaths have only two SuperHyperEdges but it’s 1533
not enough since it’s essential to have at least three SuperHyperEdges to form any style of a 1534

SuperHyperHamiltonian-Cycle-Neighbor. There isn’t any formation of any SuperHyperHamiltonian-Cycle- 1535

Neighbor but literarily, it’s the deformation of any SuperHyperHamiltonian-Cycle-Neighbor. It, literarily, 1536
deforms and it doesn’t form. A basic familiarity with Neutrosophic SuperHyperHamiltonian-Cycle- 1537
Neighbor theory, SuperHyperGraphs, and Neutrosophic SuperHyperGraphs theory are proposed. 1538
Keywords: Neutrosophic SuperHyperGraph, SuperHyperHamiltonian-Cycle-Neighbor, Cancer’s 1539

Henry Garrett · 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 Recognition 1540

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

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

Applied Notions Under The Scrutiny Of 1543

The Motivation Of This Scientific 1544

Research 1545

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

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

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

The latter model could be considered on the previous SuperHyperModel. It’s SuperHyperModel. 1562
It’s SuperHyperGraph but it’s officially called “Extreme SuperHyperGraphs”. The cancer is the 1563
disease but the model is going to figure out what’s going on this phenomenon. The special case 1564
of this disease is considered and as the consequences of the model, some parameters are used. 1565
The cells are under attack of this disease but the moves of the cancer in the special region are 1566
the matter of mind. The recognition of the cancer could help to find some treatments for this 1567

disease. The SuperHyperGraph and Extreme SuperHyperGraph are the SuperHyperModels on 1568
the “Cancer’s Recognition” and both bases are the background of this research. Sometimes the 1569
cancer has been happened on the region, full of cells, groups of cells and embedded styles. In this 1570
segment, the SuperHyperModel proposes some SuperHyperNotions based on the connectivities 1571
of the moves of the cancer in the forms of alliances’ styles with the formation of the design 1572
and the architecture are formally called “ SuperHyperHamiltonian-Cycle-Neighbor” in the themes 1573

of jargons and buzzwords. The prefix “SuperHyper” refers to the theme of the embedded 1574

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

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

have convenient perception on what’s happened and what’s done. There are some specific 1581
models, which are well-known and they’ve got the names, and some general models. The 1582
moves and the traces of the cancer on the complex tracks and between complicated groups of 1583
cells could be fantasized by an Extreme SuperHyperPath (-/SuperHyperHamiltonian-Cycle-Neighbor, 1584
SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is 1585
to find either the optimal SuperHyperHamiltonian-Cycle-Neighbor or the Extreme SuperHyperHamiltonian- 1586

Cycle-Neighbor in those Extreme SuperHyperModels. Some general results are introduced. Beyond 1587
that in SuperHyperStar, all possible Extreme SuperHyperPath s have only two SuperHyperEdges 1588
but it’s not enough since it’s essential to have at least three SuperHyperEdges to form any style 1589
of a SuperHyperHamiltonian-Cycle-Neighbor. There isn’t any formation of any SuperHyperHamiltonian- 1590
Cycle-Neighbor but literarily, it’s the deformation of any SuperHyperHamiltonian-Cycle-Neighbor. It, 1591
literarily, deforms and it doesn’t form. 1592

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

amount of SuperHyperHamiltonian-Cycle-Neighbor” of either individual of cells or the groups of cells 1594

based on the fixed cell or the fixed group of cells, extensively, the “amount of SuperHyperHamiltonian- 1595
Cycle-Neighbor” based on the fixed groups of cells or the fixed groups of group of cells? 1596

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

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

SuperHyperHamiltonian-Cycle-Neighbor” on “SuperHyperGraph” and “Extreme SuperHyperGraph”. 1601

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

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

SuperHyperHamiltonian-Cycle-Neighbor and Extreme SuperHyperHamiltonian-Cycle-Neighbor, are figured out 1613

in sections “ SuperHyperHamiltonian-Cycle-Neighbor” and “Extreme SuperHyperHamiltonian-Cycle-Neighbor”. 1614
In the sense of tackling on getting results and in Hamiltonian-Cycle-Neighbor to make sense about 1615
continuing the research, the ideas of SuperHyperUniform and Extreme SuperHyperUniform are 1616
introduced and as their consequences, corresponded SuperHyperClasses are figured out to debut 1617
what’s done in this section, titled “Results on SuperHyperClasses” and “Results on Extreme 1618

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

Henry Garrett · 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 common notions to extend the new notions in new frameworks, SuperHyperGraph and 1620
Extreme SuperHyperGraph, in the sections “Results on SuperHyperClasses” and “Results on 1621
Extreme SuperHyperClasses”. The starter research about the general SuperHyperRelations and 1622
as concluding and closing section of theoretical research are contained in the section “General 1623
Results”. Some general SuperHyperRelations are fundamental and they are well-known as 1624
fundamental SuperHyperNotions as elicited and discussed in the sections, “General Results”, 1625

“ SuperHyperHamiltonian-Cycle-Neighbor”, “Extreme SuperHyperHamiltonian-Cycle-Neighbor”, “Results on 1626

SuperHyperClasses” and “Results on Extreme SuperHyperClasses”. There are curious questions 1627
about what’s done about the SuperHyperNotions to make sense about excellency of this research 1628
and going to figure out the word “best” as the description and adjective for this research as 1629
presented in section, “ SuperHyperHamiltonian-Cycle-Neighbor”. The keyword of this research debut in 1630
the section “Applications in Cancer’s Recognition” with two cases and subsections “Case 1: The 1631

Initial Steps Toward SuperHyperBipartite as SuperHyperModel” and “Case 2: The Increasing 1632
Steps Toward SuperHyperMultipartite as SuperHyperModel”. In the section, “Open Problems”, 1633
there are some scrutiny and discernment on what’s done and what’s happened in this research 1634
in the terms of “questions” and “problems” to make sense to figure out this research in featured 1635
style. The advantages and the limitations of this research alongside about what’s done in this 1636
research to make sense and to get sense about what’s figured out are included in the section, 1637

“Conclusion and Closing Remarks”. 1638

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

Extreme Preliminaries Of This Scientific 1640

Research On the Redeemed Ways 1641

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

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

terization of the Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG38],Definition 2.7,p.3), 1645
[t-norm](Ref.[HG38], Definition 2.7, p.3), and [Characterization of the Neutrosophic SuperHy- 1646
perGraph (NSHG)](Ref.[HG38],Definition 2.7,p.3), [Neutrosophic Strength of the Neutrosophic 1647
SuperHyperPaths] (Ref.[HG38],Definition 5.3,p.7), and [Different Neutrosophic Types of Neut- 1648
rosophic SuperHyperEdges (NSHE)] (Ref.[HG38],Definition 5.4,p.7). Also, the new ideas and 1649

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

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

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

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

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

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

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

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

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

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). 1654
Assume V 0 is a given set. a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E), 1655
where 1656

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

(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); 1658

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

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

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

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

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

0 0
P
(viii) i0 supp(Ei ) = V, (i = 1, 2, . . . , n ); 1665
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 . 1666

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

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

falsity-membership the Neutrosophic SuperHyperVertex (NSHV) Vi to the Neutrosophic 1670
SuperHyperVertex (NSHV) V. TV0 (Ei0 ), TV0 (Ei0 ), and TV0 (Ei0 ) denote the degree of truth- 1671
membership, the degree of indeterminacy-membership and the degree of falsity-membership of 1672
the Neutrosophic SuperHyperEdge (NSHE) Ei0 to the Neutrosophic SuperHyperEdge (NSHE) 1673
E. Thus, the ii0 th element of the incidence matrix of Neutrosophic SuperHyperGraph (NSHG) 1674

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

Henry Garrett · 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)). 1676

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

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

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

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

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

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

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

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

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

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

(i) 1 ⊗ x = x; 1694

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

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

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

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

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

where 1700

Henry Garrett · 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 ; 1701

(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); 1702

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

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

1, 2, . . . , n0 ); 1705

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

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

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

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

Here the Neutrosophic SuperHyperEdges (NSHE) Ej 0 and the Neutrosophic SuperHyperVertices 1710
(NSHV) Vj are single valued Neutrosophic sets. TV 0 (Vi ), IV 0 (Vi ), and FV 0 (Vi ) denote the 1711
degree of truth-membership, the degree of indeterminacy-membership and the degree of 1712
falsity-membership the Neutrosophic SuperHyperVertex (NSHV) Vi to the Neutrosophic 1713
SuperHyperVertex (NSHV) V. TV0 (Ei0 ), TV0 (Ei0 ), and TV0 (Ei0 ) denote the degree of truth- 1714

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

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

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

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

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

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

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

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

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

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

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

makes the patterns and regularities. 1734

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

of elements of SuperHyperEdges are the same. 1736

Henry Garrett · 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 1737
makes to have SuperHyperUniform more understandable. 1738

Definition 9.0.13. Assume a Neutrosophic SuperHyperGraph. There are some SuperHyper- 1739
Classes as follows. 1740

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

two given SuperHyperEdges with two exceptions; 1742

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

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

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

in common; 1748

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

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

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 1755
(NSHV) V1 to Neutrosophic SuperHyperVertex (NSHV) Vs if either of following conditions hold: 1756

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

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

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

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

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

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

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

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

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

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

Henry Garrett · 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. 1766

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

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

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

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

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 1772

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

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

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

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

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

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

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

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

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

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

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

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

Henry Garrett · 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 1787

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

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

Definition 9.0.18. (Different Neutrosophic Types of Neutrosophic SuperHyperHamiltonian-Cycle- 1793

Neighbor). 1794
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider a 1795
Neutrosophic SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and E 0 = {E1 , E2 , . . . , Ez }. Then either V 0 1796

or E 0 is called 1797

(i) Neutrosophic e-SuperHyperHamiltonian-Cycle-Neighbor if the following expression is 1798

called Neutrosophic e-SuperHyperHamiltonian-Cycle-Neighbor criteria holds 1799

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

(ii) Neutrosophic re-SuperHyperHamiltonian-Cycle-Neighbor if the following expression is 1800

called Neutrosophic re-SuperHyperHamiltonian-Cycle-Neighbor criteria holds 1801

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

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

(iii) Neutrosophic v-SuperHyperHamiltonian-Cycle-Neighbor if the following expression is 1803

called Neutrosophic v-SuperHyperHamiltonian-Cycle-Neighbor criteria holds 1804

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

(iv) Neutrosophic rv-SuperHyperHamiltonian-Cycle-Neighbor if the following expression is 1805

called Neutrosophic v-SuperHyperHamiltonian-Cycle-Neighbor criteria holds 1806

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

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

Henry Garrett · 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-Cycle-Neighbor if it’s either of Neutro- 1808

sophic e-SuperHyperHamiltonian-Cycle-Neighbor, Neutrosophic re-SuperHyperHamiltonian- 1809
Cycle-Neighbor, Neutrosophic v-SuperHyperHamiltonian-Cycle-Neighbor, and Neutrosophic rv- 1810
SuperHyperHamiltonian-Cycle-Neighbor. 1811

Definition 9.0.19. ((Neutrosophic) SuperHyperHamiltonian-Cycle-Neighbor). 1812

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

(i) an Extreme SuperHyperHamiltonian-Cycle-Neighbor if it’s either of Neutro- 1815

sophic e-SuperHyperHamiltonian-Cycle-Neighbor, Neutrosophic re-SuperHyperHamiltonian- 1816
Cycle-Neighbor, Neutrosophic v-SuperHyperHamiltonian-Cycle-Neighbor, and Neutrosophic rv- 1817
SuperHyperHamiltonian-Cycle-Neighbor and C(N SHG) for an Extreme SuperHyperGraph 1818

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

of high Extreme cardinality of the Extreme SuperHyperEdges in the conseNeighborive 1820
Extreme sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such 1821
that they form the Extreme SuperHyperHamiltonian-Cycle-Neighbor; 1822

(ii) a Neutrosophic SuperHyperHamiltonian-Cycle-Neighbor if it’s either of Neutro- 1823

sophic e-SuperHyperHamiltonian-Cycle-Neighbor, Neutrosophic re-SuperHyperHamiltonian- 1824
Cycle-Neighbor, Neutrosophic v-SuperHyperHamiltonian-Cycle-Neighbor, and Neutrosophic rv- 1825
SuperHyperHamiltonian-Cycle-Neighbor and C(N SHG) for a Neutrosophic SuperHyperGraph 1826
N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic Su- 1827

perHyperEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 1828

conseNeighborive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices 1829
such that they form the Neutrosophic SuperHyperHamiltonian-Cycle-Neighbor; 1830

(iii) an Extreme SuperHyperHamiltonian-Cycle-Neighbor SuperHyperPolynomial if 1831

it’s either of Neutrosophic e-SuperHyperHamiltonian-Cycle-Neighbor, Neutrosophic re- 1832
SuperHyperHamiltonian-Cycle-Neighbor, Neutrosophic v-SuperHyperHamiltonian-Cycle-Neighbor, and 1833
Neutrosophic rv-SuperHyperHamiltonian-Cycle-Neighbor and C(N SHG) for an Extreme Super- 1834
HyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme 1835
coefficients defined as the Extreme number of the maximum Extreme cardinality of the 1836

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

conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVertices such 1838
that they form the Extreme SuperHyperHamiltonian-Cycle-Neighbor; and the Extreme power is 1839
corresponded to its Extreme coefficient; 1840

(iv) a Neutrosophic SuperHyperHamiltonian-Cycle-Neighbor SuperHyperPolynomial 1841

if it’s either of Neutrosophic e-SuperHyperHamiltonian-Cycle-Neighbor, Neutrosophic re- 1842
SuperHyperHamiltonian-Cycle-Neighbor, Neutrosophic v-SuperHyperHamiltonian-Cycle-Neighbor, and 1843
Neutrosophic rv-SuperHyperHamiltonian-Cycle-Neighbor and C(N SHG) for a Neutrosophic 1844

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

the Neutrosophic coefficients defined as the Neutrosophic number of the maximum 1846
Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic 1847
SuperHyperSet S of high Neutrosophic cardinality conseNeighborive Neutrosophic Super- 1848
HyperEdges and Neutrosophic SuperHyperVertices such that they form the Neutrosophic 1849
SuperHyperHamiltonian-Cycle-Neighbor; and the Neutrosophic power is corresponded to its 1850

Neutrosophic coefficient; 1851

Henry Garrett · 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-Cycle-Neighbor if it’s either of Neutro- 1852

sophic e-SuperHyperHamiltonian-Cycle-Neighbor, Neutrosophic re-SuperHyperHamiltonian- 1853
Cycle-Neighbor, Neutrosophic v-SuperHyperHamiltonian-Cycle-Neighbor, and Neutrosophic rv- 1854
SuperHyperHamiltonian-Cycle-Neighbor and C(N SHG) for an Extreme SuperHyperGraph 1855
N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of 1856
high Extreme cardinality of the Extreme SuperHyperVertices in the conseNeighborive 1857

Extreme sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such 1858

that they form the Extreme SuperHyperHamiltonian-Cycle-Neighbor; 1859

(vi) a Neutrosophic V-SuperHyperHamiltonian-Cycle-Neighbor if it’s either of Neut- 1860

rosophic e-SuperHyperHamiltonian-Cycle-Neighbor, Neutrosophic re-SuperHyperHamiltonian- 1861
Cycle-Neighbor, Neutrosophic v-SuperHyperHamiltonian-Cycle-Neighbor, and Neutrosophic rv- 1862

SuperHyperHamiltonian-Cycle-Neighbor and C(N SHG) for a Neutrosophic SuperHyperGraph 1863

N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic Supe- 1864
rHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 1865
conseNeighborive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices 1866
such that they form the Neutrosophic SuperHyperHamiltonian-Cycle-Neighbor; 1867

(vii) an Extreme V-SuperHyperHamiltonian-Cycle-Neighbor SuperHyperPolynomial 1868

if it’s either of Neutrosophic e-SuperHyperHamiltonian-Cycle-Neighbor, Neutrosophic re- 1869
SuperHyperHamiltonian-Cycle-Neighbor, Neutrosophic v-SuperHyperHamiltonian-Cycle-Neighbor, and 1870
Neutrosophic rv-SuperHyperHamiltonian-Cycle-Neighbor and C(N SHG) for an Extreme Super- 1871
HyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme 1872
coefficients defined as the Extreme number of the maximum Extreme cardinality of the 1873

Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality 1874

conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVertices such 1875
that they form the Extreme SuperHyperHamiltonian-Cycle-Neighbor; and the Extreme power is 1876
corresponded to its Extreme coefficient; 1877

(viii) a Neutrosophic SuperHyperHamiltonian-Cycle-Neighbor SuperHyperPolynomial 1878

if it’s either of Neutrosophic e-SuperHyperHamiltonian-Cycle-Neighbor, Neutrosophic re- 1879

SuperHyperHamiltonian-Cycle-Neighbor, Neutrosophic v-SuperHyperHamiltonian-Cycle-Neighbor, and 1880
Neutrosophic rv-SuperHyperHamiltonian-Cycle-Neighbor and C(N SHG) for a Neutrosophic 1881
SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains 1882
the Neutrosophic coefficients defined as the Neutrosophic number of the maximum 1883
Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic 1884

SuperHyperSet S of high Neutrosophic cardinality conseNeighborive Neutrosophic Super- 1885

HyperEdges and Neutrosophic SuperHyperVertices such that they form the Neutrosophic 1886
SuperHyperHamiltonian-Cycle-Neighbor; and the Neutrosophic power is corresponded to its 1887
Neutrosophic coefficient. 1888

Definition 9.0.20. ((Extreme/Neutrosophic)δ−SuperHyperHamiltonian-Cycle-Neighbor). 1889

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

(i) an δ−SuperHyperHamiltonian-Cycle-Neighbor is a Neutrosophic kind of Neutrosophic 1891

SuperHyperHamiltonian-Cycle-Neighbor such that either of the following expressions hold for the 1892

Henry Garrett · 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

Neutrosophic cardinalities of SuperHyperNeighbors of s ∈ S : 1893

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

(29.1), holds if S is an δ−SuperHyperDefensive; 1895

(ii) a Neutrosophic δ−SuperHyperHamiltonian-Cycle-Neighbor is a Neutrosophic kind of Neut- 1896

rosophic SuperHyperHamiltonian-Cycle-Neighbor such that either of the following Neutrosophic 1897
expressions hold for the Neutrosophic cardinalities of SuperHyperNeighbors of s ∈ S : 1898

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

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

For the sake of having a Neutrosophic SuperHyperHamiltonian-Cycle-Neighbor, there’s a need to 1901

“redefine” the notion of “Neutrosophic SuperHyperGraph”. The SuperHyperVertices and the 1902
SuperHyperEdges are assigned by the labels from the letters of the alphabets. In this procedure, 1903
there’s the usage of the position of labels to assign to the values. 1904

136DEF1 Definition 9.0.21. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 1905
It’s redefined Neutrosophic SuperHyperGraph if the Table (29.1) holds. 1906

It’s useful to define a “Neutrosophic” version of SuperHyperClasses. Since there’s more ways 1907
to get Neutrosophic type-results to make a Neutrosophic more understandable. 1908

136DEF2 Definition 9.0.22. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = 1909

(V, E). There are some Neutrosophic SuperHyperClasses if the Table (29.2) holds. 1910
Thus Neutrosophic SuperHyperPath , SuperHyperHamiltonian-Cycle-Neighbor, SuperHyperStar, 1911
SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, are Neutrosophic 1912
SuperHyperPath, Neutrosophic SuperHyperCycle, Neutrosophic SuperHyperStar, 1913
Neutrosophic SuperHyperBipartite, Neutrosophic SuperHyperMultiPartite, and 1914
Neutrosophic SuperHyperWheel if the Table (29.2) holds. 1915

It’s useful to define a “Neutrosophic” version of a Neutrosophic SuperHyperHamiltonian-Cycle- 1916

Neighbor. Since there’s more ways to get type-results to make a Neutrosophic SuperHyperHamiltonian- 1917

Cycle-Neighbor more Neutrosophicly understandable. 1918

Henry Garrett · 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

For the sake of having a Neutrosophic SuperHyperHamiltonian-Cycle-Neighbor, there’s a need to 1919

“redefine” the Neutrosophic notion of “Neutrosophic SuperHyperHamiltonian-Cycle-Neighbor”. The 1920
SuperHyperVertices and the SuperHyperEdges are assigned by the labels from the letters of the 1921
alphabets. In this procedure, there’s the usage of the position of labels to assign to the values. 1922

1923

136DEF1 Definition 9.0.23. Assume a SuperHyperHamiltonian-Cycle-Neighbor. It’s redefined a Neutrosophic 1924

SuperHyperHamiltonian-Cycle-Neighbor if the Table (29.3) holds. 1925

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 CHAPTER 10 1926

Extreme SuperHyper But As The Hamiltonian-Cycle-Neighbor 1927

Extensions Excerpt From Dense And 1928

Super Forms 1929

Definition 10.0.1. (Extreme event). 1930

Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) 1931
is a probability Hamiltonian-Cycle-Neighbor. Any Extreme k-subset of A of V is called Extreme 1932
k-event and if k = 2, then Extreme subset of A of V is called Extreme event. The following 1933
expression is called Extreme probability of A. 1934

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

Definition 10.0.2. (Extreme Independent). 1935

Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) 1936

is a probability Hamiltonian-Cycle-Neighbor. s Extreme k-events Ai , i ∈ I is called Extreme s- 1937

independent if the following expression is called Extreme s-independent criteria 1938

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 1939

following expression is called Extreme independent criteria 1940

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

Definition 10.0.3. (Extreme Variable). 1941

Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) 1942

is a probability Hamiltonian-Cycle-Neighbor. Any k-function Hamiltonian-Cycle-Neighbor like E is called 1943

Extreme k-Variable. If k = 2, then any 2-function Hamiltonian-Cycle-Neighbor like E is called 1944
Extreme Variable. 1945

The notion of independent on Extreme Variable is likewise. 1946

Definition 10.0.4. (Extreme Expectation). 1947

Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) is 1948

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

a probability Hamiltonian-Cycle-Neighbor. an Extreme k-Variable E has a number is called Extreme 1949

Expectation if the following expression is called Extreme Expectation criteria 1950

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

Definition 10.0.5. (Extreme Crossing). 1951

Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) is 1952

a probability Hamiltonian-Cycle-Neighbor. an Extreme number is called Extreme Crossing if the 1953

following expression is called Extreme Crossing criteria 1954

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 1955
S = (V, E) is a probability Hamiltonian-Cycle-Neighbor. Let m and n propose special Hamiltonian-Cycle- 1956
Neighbor. Then with m ≥ 4n, 1957

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-Cycle-Neighbor p := 4n/m, and set H := G[S] and H := G[S].
Define random variables X, Y, Z on V as follows: X is the Extreme number of SuperHyperVer-
tices, Y the Extreme number of SuperHyperEdges, and Z the Extreme number of crossings of H.
The trivial bound noted above, when applied to H, yields the inequality Z ≥ cr(H) ≥ Y − 3X.
By linearity of Extreme Expectation,

E(Z) ≥ E(Y ) − 3E(X).

Now E(X) = pn, E(Y ) = p2 m (each SuperHyperEdge having some SuperHyperEnds) and
E(Z) = p4 cr(G) (each crossing being defined by some SuperHyperVertices). Hence

p4 cr(G) ≥ p2 m − 3pn.

Dividing both sides by p4 , we have: 1958

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

 1959

Theorem 10.0.7. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). 1960
Consider S = (V, E) is a probability Hamiltonian-Cycle-Neighbor. Let P be a SuperHyperSet of n points 1961
in the plane, and let l be the Extreme number √ of SuperHyperLines in the plane passing through 1962
at least k + 1 of these points, where 1 ≤ k ≤ 2 2n. Then l < 32n2 /k 3 . 1963

Proof. Form an Extreme SuperHyperGraph G with SuperHyperVertex SuperHyperSet P whose 1964

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

Henry Garrett · 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). 1970
Consider S = (V, E) is a probability Hamiltonian-Cycle-Neighbor. Let P be a SuperHyperSet of n points 1971
in the plane, and let k be the number of pairs of points of P at unit SuperHyperDistance. Then 1972
k < 5n4/3 . 1973

Proof. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 1974
S = (V, E) is a probability Hamiltonian-Cycle-Neighbor. Draw a SuperHyperUnit SuperHyperCircle 1975
around each SuperHyperPoint of P. Let ni be the P Extreme number of these SuperHyperCircles 1976
i = 0n−1 ni = n and k = 12 i = 0n−1 ini .
P
passing through exactly i points of P. Then 1977

Now form an Extreme SuperHyperGraph H with SuperHyperVertex SuperHyperSet P whose 1978

SuperHyperEdges are the SuperHyperArcs between conseNeighborive SuperHyperPoints on the 1979
SuperHyperCircles that pass through at least three SuperHyperPoints of P. Then 1980

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 1981

SuperHyperEdges. Delete from H one of each SuperHyperPair of parallel SuperHyperEdges, so 1982

as to obtain a simple Extreme SuperHyperGraph G with e(G) ≥ k − n. Now cr(G) ≤ n(n − 1) 1983
because G is formed from at most n SuperHyperCircles, and any two SuperHyperCircles cross 1984
at most twice. Thus either e(G) < 4n, in which case k < 5n < 5n4/3 , or n2 > n(n − 1) ≥ 1985
3
cr(G) ≥ (k − n) /64n2 by the Extreme Crossing Lemma, and k < 4n4/3 + n < 5n4/3 .  1986

Proposition 10.0.9. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). 1987
Consider S = (V, E) is a probability Hamiltonian-Cycle-Neighbor. Let X be a nonnegative Extreme 1988
Variable and t a positive real number. Then 1989

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

Corollary 10.0.10. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). 1991
Consider S = (V, E) is a probability Hamiltonian-Cycle-Neighbor. Let Xn be a nonnegative integer- 1992

valued variable in a prob- ability Hamiltonian-Cycle-Neighbor (Vn , En ), n ≥ 1. If E(Xn ) → 0 as n → ∞, 1993

then P (Xn = 0) → 1 as n → ∞. 1994

Proof.  1995

Theorem 10.0.11. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). 1996
Consider S = (V, E) is a probability Hamiltonian-Cycle-Neighbor. A special SuperHyperGraph in Gn,p 1997

almost surely has stability number at most d2p−1 log ne. 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

Proof. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 1999
S = (V, E) is a probability Hamiltonian-Cycle-Neighbor. A special SuperHyperGraph in Gn,p is up. 2000
Let G ∈ Gn,p and let S be a given SuperHyperSet of k + 1 SuperHyperVertices of G, where 2001
k ∈ N. The probability that S is a stable SuperHyperSet of G is (1 − p)(k+1)choose2 , this 2002
being the probability that none of the (k + 1)choose2 pairs of SuperHyperVertices of S is a 2003
SuperHyperEdge of the Extreme SuperHyperGraph G. 2004

Let AS denote the event that S is a stable SuperHyperSet of G, and let XS denote the indicator 2005
Extreme Variable for this Extreme Event. By equation, we have 2006

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 2007

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

and so, by those, 2008

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

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

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

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 2011

least as fast as the logarithm of n, implies that E(X) → 0 as n → ∞. Because X is integer-valued 2012
and nonnegative, we deduce from Corollary that P (X = 0) → 1 as n → ∞. Consequently, an 2013
Extreme SuperHyperGraph in Gn,p almost surely has stability number at most k.  2014

Definition 10.0.12. (Extreme Variance). 2015

Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) is 2016
a probability Hamiltonian-Cycle-Neighbor. an Extreme k-Variable E has a number is called Extreme 2017

Variance if the following expression is called Extreme Variance criteria 2018

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

Theorem 10.0.13. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). 2019
Consider S = (V, E) is a probability Hamiltonian-Cycle-Neighbor. Let X be an Extreme Variable and 2020
let t be a positive real number. Then 2021

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 2022
S = (V, E) is a probability Hamiltonian-Cycle-Neighbor. Let X be an Extreme Variable and let t be a 2023
positive real number. Then 2024

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

Corollary 10.0.14. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). 2026

Consider S = (V, E) is a probability Hamiltonian-Cycle-Neighbor. Let Xn be an Extreme Variable in a 2027

probability Hamiltonian-Cycle-Neighbor (Vn , En ), n ≥ 1. If Ex(Xn ) 6= 0 and V (Xn ) << E 2 (Xn ), then 2028

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

Proof. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 2029
S = (V, E) is a probability Hamiltonian-Cycle-Neighbor. Set X := Xn and t := |Ex(Xn )| in 2030
Chebyshev’s Inequality, and observe that E(Xn = 0) ≤ E(|Xn − Ex(Xn )| ≥ |Ex(Xn )|) because 2031

|Xn − Ex(Xn )| = |Ex(Xn )| when Xn = 0.  2032

Theorem 10.0.15. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). 2033
Consider S = (V, E) is a probability Hamiltonian-Cycle-Neighbor. Let G ∈ Gn,1/2 . For 0 ≤ k ≤ n, set 2034

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 2035
one. Then almost surely α(G) takes one of the three values k ∗ − 2, k ∗ − 1, k ∗ . 2036

Proof. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 2037
S = (V, E) is a probability Hamiltonian-Cycle-Neighbor. As in the proof of related Theorem, the result 2038
is straightforward.  2039

Corollary 10.0.16. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). 2040
Consider S = (V, E) is a probability Hamiltonian-Cycle-Neighbor. Let G ∈ Gn,1/2 and let f and k ∗ be 2041
as defined in previous Theorem. Then either: 2042

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

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

Proof. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 2045
S = (V, E) is a probability Hamiltonian-Cycle-Neighbor. The latter is straightforward.  2046

Definition 10.0.17. (Extreme Threshold). 2047

Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) is 2048
a probability Hamiltonian-Cycle-Neighbor. Let P be a monotone property of SuperHyperGraphs (one 2049
which is preserved when SuperHyperEdges are added). Then a Extreme Threshold for P is 2050
a function f (n) such that: 2051

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

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

Henry Garrett · 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). 2054

Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) is 2055
a probability Hamiltonian-Cycle-Neighbor. Let F be a fixed Extreme SuperHyperGraph. Then 2056
there is a threshold function for the property of containing a copy of F as an Extreme 2057
SubSuperHyperGraph is called Extreme Balanced. 2058

Theorem 10.0.19. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). 2059
Consider S = (V, E) is a probability Hamiltonian-Cycle-Neighbor. Let F be a nonempty balanced 2060

Extreme SubSuperHyperGraph with k SuperHyperVertices and l SuperHyperEdges. Then n−k/l 2061

is a threshold function for the property of containing F as an Extreme SubSuperHyperGraph. 2062

Proof. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 2063
S = (V, E) is a probability Hamiltonian-Cycle-Neighbor. The latter is straightforward.  2064

136EXM1 Example 10.0.20. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E) in 2065
the mentioned Extreme Figures in every Extreme items. 2066

• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme 2067

SuperHyperHamiltonian-Cycle-Neighbor, is up. The Extreme Algorithm is Extremely straightfor- 2068
ward. E1 and E3 are some empty Extreme SuperHyperEdges but E2 is a loop Extreme 2069
SuperHyperEdge and E4 is an Extreme SuperHyperEdge. Thus in the terms of Extreme 2070
SuperHyperNeighbor, there’s only one Extreme SuperHyperEdge, namely, E4 . The 2071
Extreme SuperHyperVertex, V3 is Extreme isolated means that there’s no Extreme 2072

SuperHyperEdge has it as an Extreme endpoint. Thus the Extreme SuperHyperVertex, 2073

V3 , is excluded in every given Extreme SuperHyperHamiltonian-Cycle-Neighbor. 2074

C(N SHG)Extreme Hamiltonian-Cycle-Neighbor

= {E4 }.
C(N SHG)Extreme Hamiltonian-Cycle-Neighbor SuperHyperPolynomial
= z3.
C(N SHG)Extreme V-Hamiltonian-Cycle-Neighbor
= {V1 , V2 , V4 }.
C(N SHG)Extreme V-Hamiltonian-Cycle-Neighbor SuperHyperPolynomial
= z 5 + 2z 3 .

2075

• On the Figure (30.2), the Extreme SuperHyperNotion, namely, Extreme 2076

SuperHyperHamiltonian-Cycle-Neighbor, is up. The Extreme Algorithm is Extremely straightfor- 2077

ward. E1 , E2 and E3 are some empty Extreme SuperHyperEdges but E4 is an Extreme 2078
SuperHyperEdge. Thus in the terms of Extreme SuperHyperNeighbor, there’s only 2079
one Extreme SuperHyperEdge, namely, E4 . The Extreme SuperHyperVertex, V3 is 2080
Extreme isolated means that there’s no Extreme SuperHyperEdge has it as an Extreme 2081
endpoint. Thus the Extreme SuperHyperVertex, V3 , is excluded in every given Extreme 2082
SuperHyperHamiltonian-Cycle-Neighbor. 2083

C(N SHG)Extreme Hamiltonian-Cycle-Neighbor

Henry Garrett · 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-Cycle-Neighbor in the Extreme Example (42.0.3) 136NSHG1

= {E4 }.
C(N SHG)Extreme Hamiltonian-Cycle-Neighbor SuperHyperPolynomial
= z3.
C(N SHG)Extreme V-Hamiltonian-Cycle-Neighbor
= {V1 , V2 , V4 }.
C(N SHG)Extreme V-Hamiltonian-Cycle-Neighbor SuperHyperPolynomial
= z 5 + z 3 + z.
2084

• On the Figure (30.3), the Extreme SuperHyperNotion, namely, Extreme 2085

SuperHyperHamiltonian-Cycle-Neighbor, is up. The Extreme Algorithm is Extremely straight- 2086
forward. 2087

C(N SHG)Extreme Hamiltonian-Cycle-Neighbor

= {E4 }.
C(N SHG)Extreme Hamiltonian-Cycle-Neighbor SuperHyperPolynomial
= z3.
C(N SHG)Extreme V-Hamiltonian-Cycle-Neighbor
= {V1 , V2 , V3 }.
C(N SHG)Extreme V-Hamiltonian-Cycle-Neighbor SuperHyperPolynomial
= z8 + z4 + z3.
2088

Henry Garrett · 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-Cycle-Neighbor in the Extreme Example (42.0.3) 136NSHG2

Figure 10.3: The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
SuperHyperHamiltonian-Cycle-Neighbor 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-Cycle-Neighbor in the Extreme Example (42.0.3) 136NSHG4

• On the Figure (30.4), the Extreme SuperHyperNotion, namely, Extreme 2089

SuperHyperHamiltonian-Cycle-Neighbor, is up. The Extreme Algorithm is Extremely straight- 2090
forward. 2091

C(N SHG)Extreme Hamiltonian-Cycle-Neighbor

= {}.
C(N SHG)Extreme Hamiltonian-Cycle-Neighbor SuperHyperPolynomial
= 0z 0 .
C(N SHG)Extreme V-Hamiltonian-Cycle-Neighbor
= {}.
C(N SHG)Extreme V-Hamiltonian-Cycle-Neighbor SuperHyperPolynomial
= 0z 0 .

2092

• On the Figure (30.5), the Extreme SuperHyperNotion, namely, Extreme 2093

SuperHyperHamiltonian-Cycle-Neighbor, is up. The Extreme Algorithm is Extremely straight- 2094

forward. 2095

C(N SHG)Extreme Hamiltonian-Cycle-Neighbor

= {}.
C(N SHG)Extreme Hamiltonian-Cycle-Neighbor SuperHyperPolynomial
= 0z 0 .
C(N SHG)Extreme V-Hamiltonian-Cycle-Neighbor

Henry Garrett · 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-Cycle-Neighbor in the Extreme Example (42.0.3) 136NSHG5

= {}.
C(N SHG)Extreme V-Hamiltonian-Cycle-Neighbor SuperHyperPolynomial
= 0z 0 .

2096

• On the Figure (30.6), the Extreme SuperHyperNotion, namely, Extreme 2097

SuperHyperHamiltonian-Cycle-Neighbor, is up. The Extreme Algorithm is Extremely straight- 2098

forward. 2099

C(N SHG)Extreme Hamiltonian-Cycle-Neighbor

= {}.
C(N SHG)Extreme Hamiltonian-Cycle-Neighbor SuperHyperPolynomial
= 0z 0 .
C(N SHG)Extreme V-Hamiltonian-Cycle-Neighbor
= {}.
C(N SHG)Extreme V-Hamiltonian-Cycle-Neighbor SuperHyperPolynomial
= 0z 0 .

2100

Henry Garrett · 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-Cycle-Neighbor in the Extreme Example (42.0.3) 136NSHG6

• On the Figure (30.7), the Extreme SuperHyperNotion, namely, Extreme 2101

SuperHyperHamiltonian-Cycle-Neighbor, is up. The Extreme Algorithm is Extremely straight- 2102

forward. 2103

C(N SHG)Extreme Hamiltonian-Cycle-Neighbor

= {}.
C(N SHG)Extreme Hamiltonian-Cycle-Neighbor SuperHyperPolynomial
= 0z 0 .
C(N SHG)Extreme V-Hamiltonian-Cycle-Neighbor
= {}.
C(N SHG)Extreme V-Hamiltonian-Cycle-Neighbor SuperHyperPolynomial
= 0z 0 .

2104

• On the Figure (30.8), the Extreme SuperHyperNotion, namely, Extreme 2105

SuperHyperHamiltonian-Cycle-Neighbor, is up. The Extreme Algorithm is Extremely straight- 2106

forward. 2107

C(N SHG)Extreme Hamiltonian-Cycle-Neighbor

= {}.

Henry Garrett · 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-Cycle-Neighbor in the Extreme Example (42.0.3) 136NSHG7

C(N SHG)Extreme Hamiltonian-Cycle-Neighbor SuperHyperPolynomial

= 0z 0 .
C(N SHG)Extreme V-Hamiltonian-Cycle-Neighbor
= {}.
C(N SHG)Extreme V-Hamiltonian-Cycle-Neighbor SuperHyperPolynomial
= 0z 0 .

2108

• On the Figure (30.9), the Extreme SuperHyperNotion, namely, Extreme 2109

SuperHyperHamiltonian-Cycle-Neighbor, is up. The Extreme Algorithm is Extremely straight- 2110

forward. 2111

C(N SHG)Extreme Hamiltonian-Cycle-Neighbor

= {}.
C(N SHG)Extreme Hamiltonian-Cycle-Neighbor SuperHyperPolynomial
= 0z 0 .
C(N SHG)Extreme V-Hamiltonian-Cycle-Neighbor
= {}.
C(N SHG)Extreme V-Hamiltonian-Cycle-Neighbor SuperHyperPolynomial
= 0z 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

Figure 10.8: The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
SuperHyperHamiltonian-Cycle-Neighbor in the Extreme Example (42.0.3) 136NSHG8

2112

• On the Figure (30.10), the Extreme SuperHyperNotion, namely, Extreme 2113

SuperHyperHamiltonian-Cycle-Neighbor, is up. The Extreme Algorithm is Extremely straight- 2114
forward. 2115

C(N SHG)Extreme Hamiltonian-Cycle-Neighbor

= {}.
C(N SHG)Extreme Hamiltonian-Cycle-Neighbor SuperHyperPolynomial
= 0z 0 .
C(N SHG)Extreme V-Hamiltonian-Cycle-Neighbor
= {}.
C(N SHG)Extreme V-Hamiltonian-Cycle-Neighbor SuperHyperPolynomial
= 0z 0 .

2116

• On the Figure (30.11), the Extreme SuperHyperNotion, namely, Extreme 2117

SuperHyperHamiltonian-Cycle-Neighbor, is up. The Extreme Algorithm is Extremely straight- 2118

Henry Garrett · 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-Cycle-Neighbor in the Extreme Example (42.0.3) 136NSHG9

Figure 10.10: The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
SuperHyperHamiltonian-Cycle-Neighbor 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-Cycle-Neighbor in the Extreme Example (42.0.3) 136NSHG11

forward. 2119

C(N SHG)Extreme Hamiltonian-Cycle-Neighbor

= {}.
C(N SHG)Extreme Hamiltonian-Cycle-Neighbor SuperHyperPolynomial
= 0z 0 .
C(N SHG)Extreme V-Hamiltonian-Cycle-Neighbor
= {}.
C(N SHG)Extreme V-Hamiltonian-Cycle-Neighbor SuperHyperPolynomial
= 0z 0 .

2120

• On the Figure (30.12), the Extreme SuperHyperNotion, namely, Extreme 2121

SuperHyperHamiltonian-Cycle-Neighbor, is up. The Extreme Algorithm is Extremely straight- 2122

forward. 2123

C(N SHG)Extreme Hamiltonian-Cycle-Neighbor

= {}.
C(N SHG)Extreme Hamiltonian-Cycle-Neighbor SuperHyperPolynomial
= 0z 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

Figure 10.12: The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
SuperHyperHamiltonian-Cycle-Neighbor in the Extreme Example (42.0.3) 136NSHG12

C(N SHG)Extreme V-Hamiltonian-Cycle-Neighbor

= {}.
C(N SHG)Extreme V-Hamiltonian-Cycle-Neighbor SuperHyperPolynomial
= 0z 0 .

2124

• On the Figure (30.13), the Extreme SuperHyperNotion, namely, Extreme 2125

SuperHyperHamiltonian-Cycle-Neighbor, is up. The Extreme Algorithm is Extremely straight- 2126
forward. 2127

C(N SHG)Extreme Hamiltonian-Cycle-Neighbor

= {}.
C(N SHG)Extreme Hamiltonian-Cycle-Neighbor SuperHyperPolynomial
= 0z 0 .
C(N SHG)Extreme V-Hamiltonian-Cycle-Neighbor
= {}.
C(N SHG)Extreme V-Hamiltonian-Cycle-Neighbor SuperHyperPolynomial
= 0z 0 .

2128

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

Figure 10.13: The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
SuperHyperHamiltonian-Cycle-Neighbor in the Extreme Example (42.0.3) 136NSHG13

• On the Figure (30.14), the Extreme SuperHyperNotion, namely, Extreme 2129

SuperHyperHamiltonian-Cycle-Neighbor, is up. The Extreme Algorithm is Extremely straight- 2130
forward. 2131

C(N SHG)Extreme Hamiltonian-Cycle-Neighbor

= {}.
C(N SHG)Extreme Hamiltonian-Cycle-Neighbor SuperHyperPolynomial
= 0z 0 .
C(N SHG)Extreme V-Hamiltonian-Cycle-Neighbor
= {}.
C(N SHG)Extreme V-Hamiltonian-Cycle-Neighbor SuperHyperPolynomial
= 0z 0 .

2132

• On the Figure (30.15), the Extreme SuperHyperNotion, namely, Extreme 2133

SuperHyperHamiltonian-Cycle-Neighbor, is up. The Extreme Algorithm is Extremely straight- 2134

forward. 2135

C(N SHG)Extreme Hamiltonian-Cycle-Neighbor

= {}.
C(N SHG)Extreme Hamiltonian-Cycle-Neighbor 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-Cycle-Neighbor in the Extreme Example (42.0.3) 136NSHG14

= 0z 0 .
C(N SHG)Extreme V-Hamiltonian-Cycle-Neighbor
= {}.
C(N SHG)Extreme V-Hamiltonian-Cycle-Neighbor SuperHyperPolynomial
= 0z 0 .

2136

• On the Figure (30.16), the Extreme SuperHyperNotion, namely, Extreme 2137

SuperHyperHamiltonian-Cycle-Neighbor, is up. The Extreme Algorithm is Extremely straight- 2138
forward. 2139

C(N SHG)Extreme Hamiltonian-Cycle-Neighbor

= {}.
C(N SHG)Extreme Hamiltonian-Cycle-Neighbor 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-Cycle-Neighbor in the Extreme Example (42.0.3) 136NSHG15

= 0z 0 .
C(N SHG)Extreme V-Hamiltonian-Cycle-Neighbor
= {}.
C(N SHG)Extreme V-Hamiltonian-Cycle-Neighbor SuperHyperPolynomial
= 0z 0 .

2140

• On the Figure (30.17), the Extreme SuperHyperNotion, namely, Extreme 2141

SuperHyperHamiltonian-Cycle-Neighbor, is up. The Extreme Algorithm is Extremely straight- 2142
forward. 2143

C(N SHG)Extreme Hamiltonian-Cycle-Neighbor

= {}.
C(N SHG)Extreme Hamiltonian-Cycle-Neighbor SuperHyperPolynomial
= 0z 0 .
C(N SHG)Extreme V-Hamiltonian-Cycle-Neighbor
= {}.
C(N SHG)Extreme V-Hamiltonian-Cycle-Neighbor SuperHyperPolynomial
= 0z 0 .

2144

Henry Garrett · 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-Cycle-Neighbor in the Extreme Example (42.0.3) 136NSHG16

Figure 10.17: The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
SuperHyperHamiltonian-Cycle-Neighbor 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-Cycle-Neighbor in the Extreme Example (42.0.3) 136NSHG18

• On the Figure (30.18), the Extreme SuperHyperNotion, namely, Extreme 2145

SuperHyperHamiltonian-Cycle-Neighbor, is up. The Extreme Algorithm is Extremely straight- 2146
forward. 2147

C(N SHG)Extreme Hamiltonian-Cycle-Neighbor

= {}.
C(N SHG)Extreme Hamiltonian-Cycle-Neighbor SuperHyperPolynomial
= 0z 0 .
C(N SHG)Extreme V-Hamiltonian-Cycle-Neighbor
= {}.
C(N SHG)Extreme V-Hamiltonian-Cycle-Neighbor SuperHyperPolynomial
= 0z 0 .

2148

• On the Figure (30.19), the Extreme SuperHyperNotion, namely, Extreme 2149

SuperHyperHamiltonian-Cycle-Neighbor, is up. The Extreme Algorithm is Extremely straight- 2150

forward. 2151

C(N SHG)Extreme Hamiltonian-Cycle-Neighbor

= {}.

Henry Garrett · 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-Cycle-Neighbor in the Extreme Example (42.0.3) 136NSHG19

C(N SHG)Extreme Hamiltonian-Cycle-Neighbor SuperHyperPolynomial

= 0z 0 .
C(N SHG)Extreme V-Hamiltonian-Cycle-Neighbor
= {}.
C(N SHG)Extreme V-Hamiltonian-Cycle-Neighbor SuperHyperPolynomial
= 0z 0 .

2152

• On the Figure (30.20), the Extreme SuperHyperNotion, namely, Extreme 2153

SuperHyperHamiltonian-Cycle-Neighbor, is up. The Extreme Algorithm is Extremely straight- 2154
forward. 2155

C(N SHG)Extreme Hamiltonian-Cycle-Neighbor

= {}.
C(N SHG)Extreme Hamiltonian-Cycle-Neighbor SuperHyperPolynomial
= 0z 0 .
C(N SHG)Extreme V-Hamiltonian-Cycle-Neighbor
= {}.
C(N SHG)Extreme V-Hamiltonian-Cycle-Neighbor 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-Cycle-Neighbor in the Extreme Example (42.0.3) 136NSHG20

= 0z 0 .

2156

• On the Figure (30.21), the Extreme SuperHyperNotion, namely, Extreme 2157

SuperHyperHamiltonian-Cycle-Neighbor, is up. The Extreme Algorithm is Extremely straight- 2158
forward. 2159

C(N SHG)Extreme Hamiltonian-Cycle-Neighbor

= {E1 , E2 }.
C(N SHG)Extreme Hamiltonian-Cycle-Neighbor SuperHyperPolynomial
= z 10 + z 2 .
C(N SHG)Extreme V-Hamiltonian-Cycle-Neighbor
= {VE2 }.
C(N SHG)Extreme V-Hamiltonian-Cycle-Neighbor SuperHyperPolynomial
= z 5 + 2z 3 + 7z.

2160

• On the Figure (30.22), the Extreme SuperHyperNotion, namely, Extreme 2161

SuperHyperHamiltonian-Cycle-Neighbor, is up. The Extreme Algorithm is Extremely straight- 2162

Henry Garrett · 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-Cycle-Neighbor in the Extreme Example (42.0.3) 95NHG1

forward. 2163

C(N SHG)Extreme Hamiltonian-Cycle-Neighbor

= {}.
C(N SHG)Extreme Hamiltonian-Cycle-Neighbor SuperHyperPolynomial
= 0z 0 .
C(N SHG)Extreme V-Hamiltonian-Cycle-Neighbor
= {}.
C(N SHG)Extreme V-Hamiltonian-Cycle-Neighbor SuperHyperPolynomial
= 0z 0 .

2164

Proposition 10.0.21. Assume a connected Extreme SuperHyperGraph ESHG : (V, E). The all 2165

interior Extreme SuperHyperVertices belong to any Extreme quasi-R-Hamiltonian-Cycle-Neighbor if for 2166

Henry Garrett · 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-Cycle-Neighbor in the Extreme Example (42.0.3) 95NHG2

any of them, and any of other corresponded Extreme SuperHyperVertex, some interior Extreme 2167
SuperHyperVertices are mutually Extreme SuperHyperNeighbors with no Extreme exception at 2168
all minus all Extreme SuperHypeNeighbors to any amount of them. 2169

Proposition 10.0.22. Assume a connected non-obvious Extreme SuperHyperGraph ESHG : 2170

(V, E). There’s only one Extreme SuperHyperEdge E ∈ EESHG:(V,E) has only the maximum 2171
possibilities of the distinct interior Extreme SuperHyperVertices inside of any given Extreme 2172
quasi-R-Hamiltonian-Cycle-Neighbor minus all Extreme SuperHypeNeighbor to some of them but not 2173
all of them. In other words, there’s only an unique Extreme SuperHyperEdge E ∈ EESHG:(V,E) 2174
has only two distinct Extreme SuperHyperVertices in an Extreme quasi-R-Hamiltonian-Cycle-Neighbor, 2175
minus all Extreme SuperHypeNeighbor to some of them but not all of them. 2176

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-Cycle-Neighbor is at least

V \ (V \ {aE , bE , cE , . . . , zE }).

It’s straightforward that the Extreme cardinality of the Extreme R-Hamiltonian-Cycle-Neighbor is at least 2177
the maximum Extreme number of Extreme SuperHyperVertices of the Extreme SuperHyperEdges 2178
with the maximum number of the Extreme SuperHyperEdges. In other words, the maximum 2179
number of the Extreme SuperHyperEdges contains the maximum Extreme number of Extreme 2180
SuperHyperVertices are renamed to Extreme Hamiltonian-Cycle-Neighbor in some cases but the maximum 2181

number of the Extreme SuperHyperEdge with the maximum Extreme number of Extreme 2182

Henry Garrett · 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- 2183

Hamiltonian-Cycle-Neighbor. 2184

Proposition 10.0.24. Assume a simple Extreme SuperHyperGraph ESHG : (V, E). Then the
Extreme number of type-result-R-Hamiltonian-Cycle-Neighbor has, the least Extreme cardinality, the
lower sharp Extreme bound for Extreme cardinality, is the Extreme cardinality of

V \ V \ {aE , bE 0 , cE 00 , cE 000 }E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .

If there’s an Extreme type-result-R-Hamiltonian-Cycle-Neighbor with the least Extreme cardinality, the 2185
lower sharp Extreme bound for cardinality. 2186

Proposition 10.0.25. Assume a connected loopless Extreme SuperHyperGraph ESHG : (V, E). 2187
Then in the worst case, literally, 2188

C(N SHG)ExtremeQuasi−Hamiltonian−Cycle−N eighbor = {V1 , E1 , V2 , E2 , V3 , E3 , V4 , E4 , V1 }.

C(N SHG)ExtremeQuasi−Hamiltonian−Cycle−N eighborSuperHyperP olynomial = z 4 .
C(N SHG)ExtremeQuasi−Hamiltonian−Cycle−N eighbor = {V1 , V2 , V3 , V4 , V1 }.
C(N SHG)ExtremeR−Quasi−Hamiltonian−Cycle−N eighborSuperHyperP olynomial = z 5 .

Is an Extreme type-result-Hamiltonian-Cycle-Neighbor. In other words, the least cardinality, the lower 2189
sharp bound for the cardinality, of an Extreme type-result-Hamiltonian-Cycle-Neighbor is the cardinality 2190
of 2191

C(N SHG)ExtremeQuasi−Hamiltonian−Cycle−N eighbor = {V1 , E1 , V2 , E2 , V3 , E3 , V4 , E4 , V1 }.

C(N SHG)ExtremeQuasi−Hamiltonian−Cycle−N eighborSuperHyperP olynomial = z 4 .
C(N SHG)ExtremeQuasi−Hamiltonian−Cycle−N eighbor = {V1 , V2 , V3 , V4 , V1 }.
C(N SHG)ExtremeR−Quasi−Hamiltonian−Cycle−N eighborSuperHyperP olynomial = z 5 .

Proof. Assume a connected loopless Extreme SuperHyperGraph ESHG : (V, E). The
SuperHyperSet of the SuperHyperVertices V \ V \ {z} isn’t a quasi-R-Hamiltonian-Cycle-Neighbor
since neither amount of Extreme SuperHyperEdges nor amount of SuperHyperVertices where
amount refers to the Extreme number of SuperHyperVertices(-/SuperHyperEdges) more than
one to form any kind of SuperHyperEdges or any number of SuperHyperEdges. Let us consider
the Extreme SuperHyperSet

V \ V \ {aE , bE , cE , . . . , aE 0 , bE 0 , cE 0 , . . .}E,E 0 ={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .

This Extreme SuperHyperSet of the Extreme SuperHyperVertices has the eligibilities to propose
property such that there’s no Extreme SuperHyperVertex of an Extreme SuperHyperEdge is
common and there’s an Extreme SuperHyperEdge for all Extreme SuperHyperVertices but the
maximum Extreme cardinality indicates that these Extreme type-SuperHyperSets couldn’t give
us the Extreme lower bound in the term of Extreme sharpness. In other words, the Extreme
SuperHyperSet

V \ V \ {aE , bE , cE , . . . , aE 0 , bE 0 , cE 0 , . . .}E,E 0 ={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }}

Henry Garrett · 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-Cycle-Neighbor. In other words, the least cardinality, the lower sharp bound
for the cardinality, of a quasi-R-Hamiltonian-Cycle-Neighbor 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-Cycle-Neighbor. It’s the contradiction to that
fact on the generality. There are some counterexamples to deny this statement. One of them
comes from the setting of the graph titled path and cycle as the counterexamples-classes or
reversely direction star as the examples-classes, are well-known classes in that setting and they
could be considered as the examples-classes and counterexamples-classes for the tight bound of

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-Cycle-Neighbor decorates the Extreme
SuperHyperVertices don’t have received any Extreme connections so as this Extreme style
implies different versions of Extreme SuperHyperEdges with the maximum Extreme cardinality
in the terms of Extreme SuperHyperVertices are spotlight. The lower Extreme bound is to have
the maximum Extreme groups of Extreme SuperHyperVertices have perfect Extreme connections
inside each of SuperHyperEdges and the outside of this Extreme SuperHyperSet doesn’t matter
but regarding the connectedness of the used Extreme SuperHyperGraph arising from its
Extreme properties taken from the fact that it’s simple. If there’s no more than one Extreme
SuperHyperVertex in the targeted Extreme SuperHyperSet, then there’s no Extreme connection.
Furthermore, the Extreme existence of one Extreme SuperHyperVertex has no Extreme effect to
talk about the Extreme R-Hamiltonian-Cycle-Neighbor. Since at least two Extreme SuperHyperVertices
involve to make a title in the Extreme background of the Extreme SuperHyperGraph. The
Extreme SuperHyperGraph is obvious if it has no Extreme SuperHyperEdge but at least two

Henry Garrett · 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-Cycle-Neighbor has the Extreme cardinality of an Extreme
SuperHyperEdge. Thus, an Extreme R-Hamiltonian-Cycle-Neighbor has the Extreme cardinality at
least an Extreme SuperHyperEdge. Assume an Extreme SuperHyperSet V \ V \ {z}. This
Extreme SuperHyperSet isn’t an Extreme R-Hamiltonian-Cycle-Neighbor since either the Extreme
SuperHyperGraph is an obvious Extreme SuperHyperModel thus it never happens since there’s
no Extreme usage of this Extreme framework and even more there’s no Extreme connection
inside or the Extreme SuperHyperGraph isn’t obvious and as its consequences, there’s an
Extreme contradiction with the term “Extreme R-Hamiltonian-Cycle-Neighbor” since the maximum
Extreme cardinality never happens for this Extreme style of the Extreme SuperHyperSet and
beyond that there’s no Extreme connection inside as mentioned in first Extreme case in the
forms of drawback for this selected Extreme SuperHyperSet. Let

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-Cycle-Neighbor is the Extreme SuperHyperSet of the Extreme SuperHyperVertices such
that some Extreme amount of the Extreme SuperHyperVertices are on-quasi-triangle Extreme
style. The Extreme cardinality of the v SuperHypeSet

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-Cycle-Neighbor for the Extreme SuperHyperGraph as used Extreme

background in the Extreme terms of worst Extreme case and the common theme of the
lower Extreme bound occurred in the specific Extreme SuperHyperClasses of the Extreme
SuperHyperGraphs which are Extreme free-quasi-triangle.
Assume an Extreme SuperHyperEdge E ∈ EESHG:(V,E) has z Extreme number of the
Extreme SuperHyperVertices. Then every Extreme SuperHyperVertex has at least no
Extreme SuperHyperEdge with others in common. Thus those Extreme SuperHyperVertices
have the eligibles to be contained in an Extreme R-Hamiltonian-Cycle-Neighbor. Those Extreme
SuperHyperVertices are potentially included in an Extreme style-R-Hamiltonian-Cycle-Neighbor.
Formally, consider
V \ (V \ {aE , bE , cE , . . . , zE }).
Are the Extreme SuperHyperVertices of an Extreme SuperHyperEdge E ∈ EESHG:(V,E) . Thus

Zi ∼ Zj , i 6= j, i, j = 1, 2, . . . , z.

where the ∼ isn’t an equivalence relation but only the symmetric relation on the Extreme
SuperHyperVertices of the Extreme SuperHyperGraph. The formal definition is as follows.

Zi ∼ Zj , i 6= j, i, j = 1, 2, . . . , z

if and only if Zi and Zj are the Extreme SuperHyperVertices and there’s only and only one
Extreme SuperHyperEdge E ∈ EESHG:(V,E) between the Extreme SuperHyperVertices Zi and
Zj . The other definition for the Extreme SuperHyperEdge E ∈ EESHG:(V,E) in the terms of
Extreme R-Hamiltonian-Cycle-Neighbor is

{aE , bE , cE , . . . , zE } .

This definition coincides with the definition of the Extreme R-Hamiltonian-Cycle-Neighbor but
with slightly differences in the maximum Extreme cardinality amid those Extreme type-
SuperHyperSets of the Extreme SuperHyperVertices. Thus the Extreme SuperHyperSet of the
Extreme SuperHyperVertices,

max |{Z1 , Z2 , . . . , Zz | Zi ∼ Zj , i 6= j, i, j = 1, 2, . . . , z}|Extreme cardinality ,

z

Henry Garrett · 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-Cycle-Neighbor. Let

E
Zi ∼ Zj , be defined as Zi and Zj are the Extreme SuperHyperVertices belong to the Extreme
SuperHyperEdge E ∈ EESHG:(V,E) . Thus,

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

Or
{aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .

But with the slightly differences, 2192

Extreme R-Hamiltonian-Cycle-Neighbor =
E
{Z1 , Z2 , . . . , Zz | ∀i 6= j, i, j = 1, 2, . . . , z, ∃Ex , Zi ∼x Zj , }.
2193

Extreme R-Hamiltonian-Cycle-Neighbor =
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-Cycle-Neighbor where E ∈ EESHG:(V,E)

is fixed that means Ex = E ∈ EESHG:(V,E) . for all Extreme intended SuperHyperVertices
but in an Extreme Hamiltonian-Cycle-Neighbor, Ex = E ∈ EESHG:(V,E) could be different and it’s
not unique. To sum them up, in a connected Extreme SuperHyperGraph ESHG : (V, E). If
an Extreme SuperHyperEdge E ∈ EESHG:(V,E) has z Extreme SuperHyperVertices, then the
Extreme cardinality of the Extreme R-Hamiltonian-Cycle-Neighbor is at least

V \ (V \ {aE , bE , cE , . . . , zE }).

It’s straightforward that the Extreme cardinality of the Extreme R-Hamiltonian-Cycle-Neighbor is 2194
at least the maximum Extreme number of Extreme SuperHyperVertices of the Extreme 2195
SuperHyperEdges with the maximum number of the Extreme SuperHyperEdges. In other 2196
words, the maximum number of the Extreme SuperHyperEdges contains the maximum Extreme 2197

number of Extreme SuperHyperVertices are renamed to Extreme Hamiltonian-Cycle-Neighbor in some 2198

cases but the maximum number of the Extreme SuperHyperEdge with the maximum Extreme 2199
number of Extreme SuperHyperVertices, has the Extreme SuperHyperVertices are contained in 2200
an Extreme R-Hamiltonian-Cycle-Neighbor. 2201
The obvious SuperHyperGraph has no Extreme SuperHyperEdges. But the non-obvious 2202
Extreme SuperHyperModel is up. The quasi-SuperHyperModel addresses some issues about 2203

the Extreme optimal SuperHyperObject. It specially delivers some remarks on the Extreme 2204
SuperHyperSet of the Extreme SuperHyperVertices such that there’s distinct amount of Extreme 2205
SuperHyperEdges for distinct amount of Extreme SuperHyperVertices up to all taken from that 2206
Extreme SuperHyperSet of the Extreme SuperHyperVertices but this Extreme SuperHyperSet of 2207
the Extreme SuperHyperVertices is either has the maximum Extreme SuperHyperCardinality or 2208
it doesn’t have maximum Extreme SuperHyperCardinality. In a non-obvious SuperHyperModel, 2209

there’s at least one Extreme SuperHyperEdge containing at least all Extreme SuperHyperVertices. 2210

Henry Garrett · 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-Cycle-Neighbor where the Extreme completion of the 2211
Extreme incidence is up in that. Thus it’s, literarily, an Extreme embedded R-Hamiltonian- 2212
Cycle-Neighbor. The SuperHyperNotions of embedded SuperHyperSet and quasi-SuperHyperSet 2213
coincide. In the original setting, these types of SuperHyperSets only don’t satisfy on the 2214
maximum SuperHyperCardinality. Thus the embedded setting is elected such that those 2215
SuperHyperSets have the maximum Extreme SuperHyperCardinality and they’re Extreme 2216

SuperHyperOptimal. The less than two distinct types of Extreme SuperHyperVertices are 2217
included in the minimum Extreme style of the embedded Extreme R-Hamiltonian-Cycle-Neighbor. The 2218
interior types of the Extreme SuperHyperVertices are deciders. Since the Extreme number 2219
of SuperHyperNeighbors are only affected by the interior Extreme SuperHyperVertices. The 2220
common connections, more precise and more formal, the perfect unique connections inside 2221
the Extreme SuperHyperSet for any distinct types of Extreme SuperHyperVertices pose the 2222

Extreme R-Hamiltonian-Cycle-Neighbor. Thus Extreme exterior SuperHyperVertices could be used 2223

only in one Extreme SuperHyperEdge and in Extreme SuperHyperRelation with the interior 2224
Extreme SuperHyperVertices in that Extreme SuperHyperEdge. In the embedded Extreme 2225
Hamiltonian-Cycle-Neighbor, there’s the usage of exterior Extreme SuperHyperVertices since they’ve 2226
more connections inside more than outside. Thus the title “exterior” is more relevant than 2227
the title “interior”. One Extreme SuperHyperVertex has no connection, inside. Thus, the 2228

Extreme SuperHyperSet of the Extreme SuperHyperVertices with one SuperHyperElement has 2229
been ignored in the exploring to lead on the optimal case implying the Extreme R-Hamiltonian- 2230
Cycle-Neighbor. The Extreme R-Hamiltonian-Cycle-Neighbor with the exclusion of the exclusion of all 2231
Extreme SuperHyperVertices in one Extreme SuperHyperEdge and with other terms, the 2232
Extreme R-Hamiltonian-Cycle-Neighbor with the inclusion of all Extreme SuperHyperVertices in one 2233
Extreme SuperHyperEdge, is an Extreme quasi-R-Hamiltonian-Cycle-Neighbor. To sum them up, 2234

in a connected non-obvious Extreme SuperHyperGraph ESHG : (V, E). There’s only one 2235
Extreme SuperHyperEdge E ∈ EESHG:(V,E) has only the maximum possibilities of the distinct 2236
interior Extreme SuperHyperVertices inside of any given Extreme quasi-R-Hamiltonian-Cycle-Neighbor 2237
minus all Extreme SuperHypeNeighbor to some of them but not all of them. In other words, 2238
there’s only an unique Extreme SuperHyperEdge E ∈ EESHG:(V,E) has only two distinct 2239
Extreme SuperHyperVertices in an Extreme quasi-R-Hamiltonian-Cycle-Neighbor, minus all Extreme 2240

SuperHypeNeighbor to some of them but not all of them. 2241

The main definition of the Extreme R-Hamiltonian-Cycle-Neighbor has two titles. an Extreme quasi-R- 2242
Hamiltonian-Cycle-Neighbor and its corresponded quasi-maximum Extreme R-SuperHyperCardinality 2243
are two titles in the terms of quasi-R-styles. For any Extreme number, there’s an Extreme 2244
quasi-R-Hamiltonian-Cycle-Neighbor with that quasi-maximum Extreme SuperHyperCardinality in 2245

the terms of the embedded Extreme SuperHyperGraph. If there’s an embedded Extreme 2246
SuperHyperGraph, then the Extreme quasi-SuperHyperNotions lead us to take the collection of 2247
all the Extreme quasi-R-Hamiltonian-Cycle-Neighbors for all Extreme numbers less than its Extreme 2248
corresponded maximum number. The essence of the Extreme Hamiltonian-Cycle-Neighbor ends up 2249
but this essence starts up in the terms of the Extreme quasi-R-Hamiltonian-Cycle-Neighbor, again and 2250
more in the operations of collecting all the Extreme quasi-R-Hamiltonian-Cycle-Neighbors acted on the 2251

all possible used formations of the Extreme SuperHyperGraph to achieve one Extreme number. 2252
This Extreme number is 2253
considered as the equivalence class for all corresponded quasi-R-Hamiltonian-Cycle-Neighbors. 2254
Let zExtreme Number , SExtreme SuperHyperSet and GExtreme Hamiltonian-Cycle-Neighbor be an Extreme 2255

Henry Garrett · 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-Cycle-Neighbor . Then 2256

[zExtreme Number ]Extreme Class = {SExtreme SuperHyperSet |

SExtreme SuperHyperSet = GExtreme Hamiltonian-Cycle-Neighbor ,
|SExtreme SuperHyperSet |Extreme Cardinality
= zExtreme Number }.

As its consequences, the formal definition of the Extreme Hamiltonian-Cycle-Neighbor is re-formalized 2257
and redefined as follows. 2258

GExtreme Hamiltonian-Cycle-Neighbor ∈ ∪zExtreme Number [zExtreme Number ]Extreme Class =

∪zExtreme Number {SExtreme SuperHyperSet |
SExtreme SuperHyperSet = GExtreme Hamiltonian-Cycle-Neighbor ,
|SExtreme SuperHyperSet |Extreme Cardinality
= zExtreme Number }.

To get more precise perceptions, the follow-up expressions propose another formal technical 2259
definition for the Extreme Hamiltonian-Cycle-Neighbor. 2260

GExtreme Hamiltonian-Cycle-Neighbor =
{S ∈ ∪zExtreme Number [zExtreme Number ]Extreme Class =
∪zExtreme Number {SExtreme SuperHyperSet |
SExtreme SuperHyperSet = GExtreme Hamiltonian-Cycle-Neighbor ,
|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- 2261
poses the upcoming expressions.
Cycle-Neighbor 2262

GExtreme Hamiltonian-Cycle-Neighbor =
{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. 2263

GExtreme Hamiltonian-Cycle-Neighbor =
{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, 2264

GExtreme Hamiltonian-Cycle-Neighbor =
{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. 2265

GExtreme Hamiltonian-Cycle-Neighbor ∈ ∪zExtreme Number [zExtreme Number ]Extreme Class =

∪zExtreme Number {SExtreme SuperHyperSet |
SExtreme SuperHyperSet = GExtreme Hamiltonian-Cycle-Neighbor ,
|SExtreme SuperHyperSet |Extreme Cardinality

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

GExtreme Hamiltonian-Cycle-Neighbor =
{S ∈ ∪zExtreme Number [zExtreme Number ]Extreme Class =
∪zExtreme Number {SExtreme SuperHyperSet |
SExtreme SuperHyperSet = GExtreme Hamiltonian-Cycle-Neighbor ,
|SExtreme SuperHyperSet |Extreme Cardinality
= zExtreme Number |
|SExtreme SuperHyperSet |Extreme Cardinality

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

GExtreme Hamiltonian-Cycle-Neighbor =
{S ∈ ∪zExtreme Number [zExtreme Number ]Extreme Class |
|SExtreme SuperHyperSet |Extreme Cardinality
= max zExtreme Number
[zExtreme Number ]Extreme Class

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

GExtreme Hamiltonian-Cycle-Neighbor =
{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- 2269

HyperNeighborhood”, could be redefined as the collection of the Extreme SuperHyperVertices 2270

Henry Garrett · 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- 2271
perEdge. It’s, literarily, another name for “Extreme Quasi-Hamiltonian-Cycle-Neighbor” but, precisely, 2272
it’s the generalization of “Extreme Quasi-Hamiltonian-Cycle-Neighbor” since “Extreme Quasi-Hamiltonian- 2273
Cycle-Neighbor” happens “Extreme Hamiltonian-Cycle-Neighbor” in an Extreme SuperHyperGraph as 2274
initial framework and background but “Extreme SuperHyperNeighborhood” may not happens 2275
“Extreme Hamiltonian-Cycle-Neighbor” in an Extreme SuperHyperGraph as initial framework and 2276

preliminarily background since there are some ambiguities about the Extreme SuperHyperCar- 2277
dinality arise from it. To get orderly keywords, the terms, “Extreme SuperHyperNeighborhood”, 2278
“Extreme Quasi-Hamiltonian-Cycle-Neighbor”, and “Extreme Hamiltonian-Cycle-Neighbor” are up. 2279
Thus, let zExtreme Number , NExtreme SuperHyperNeighborhood and GExtreme Hamiltonian-Cycle-Neighbor be 2280
an Extreme number, an Extreme SuperHyperNeighborhood and an Extreme Hamiltonian-Cycle- 2281
Neighbor and the new terms are up. 2282

GExtreme Hamiltonian-Cycle-Neighbor ∈ ∪zExtreme Number [zExtreme Number ]Extreme Class =

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

2283

GExtreme Hamiltonian-Cycle-Neighbor =
{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

2284

GExtreme Hamiltonian-Cycle-Neighbor =
{NExtreme SuperHyperNeighborhood
∈ ∪zExtreme Number [zExtreme Number ]Extreme Class |
|NExtreme SuperHyperNeighborhood |Extreme Cardinality
= max zExtreme Number }.
[zExtreme Number ]Extreme Class

2285

GExtreme Hamiltonian-Cycle-Neighbor =
{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, 2286

GExtreme Hamiltonian-Cycle-Neighbor ∈ ∪zExtreme Number [zExtreme Number ]Extreme Class =

∪zExtreme Number {NExtreme SuperHyperNeighborhood |
|NExtreme SuperHyperNeighborhood |Extreme Cardinality

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

GExtreme Hamiltonian-Cycle-Neighbor =
{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) }.
2288

GExtreme Hamiltonian-Cycle-Neighbor =
{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) }.
2289

GExtreme Hamiltonian-Cycle-Neighbor =
{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-Cycle-Neighbor if for any of
them, and any of other corresponded Extreme SuperHyperVertex, some interior Extreme
SuperHyperVertices are mutually Extreme SuperHyperNeighbors with no Extreme exception at
all minus all Extreme SuperHypeNeighbors to any amount of them.
To make sense with the precise words in the terms of “R-’, the follow-up illustrations are coming
up.
The following Extreme SuperHyperSet of Extreme SuperHyperVertices is the simple Extreme
type-SuperHyperSet of the Extreme R-Hamiltonian-Cycle-Neighbor.

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-Cycle-Neighbor. 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-Cycle-Neighbor C(ESHG) for an Extreme SuperHyperGraph

ESHG : (V, E) is an Extreme type-SuperHyperSet with

the maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme Su-

perHyperVertices such that there’s no an Extreme SuperHyperEdge amid some Extreme
SuperHyperVertices instead of all given by Extreme Hamiltonian-Cycle-Neighbor 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-Cycle-Neighbor is up. The obvious simple Extreme
type-SuperHyperSet called the Extreme Hamiltonian-Cycle-Neighbor 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-Cycle-Neighbor 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-Cycle-Neighbor.

Since the Extreme SuperHyperSet of the Extreme SuperHyperVertices,

(V \ V \ {x, z}) ∪ {xy}

or
(V \ V \ {x, z}) ∪ {zy}
is an Extreme R-Hamiltonian-Cycle-Neighbor C(ESHG) for an Extreme SuperHyperGraph
ESHG : (V, E) is the Extreme SuperHyperSet S of Extreme SuperHyperVertices such
that there’s no an Extreme SuperHyperEdge for some Extreme SuperHyperVertices instead of
all given by that Extreme type-SuperHyperSet called the Extreme Hamiltonian-Cycle-Neighbor and
it’s an Extreme Hamiltonian-Cycle-Neighbor. 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-Cycle-Neighbor. 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-Cycle-Neighbor,

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

Neighbor, 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 2290
ESHG : (V, E) but it’s impossible in the case, they’ve corresponded to an SuperHyperEdge. 2291
It’s interesting to mention that the only non-obvious simple Extreme type-SuperHyperSet called 2292
the 2293

“Extreme R-Hamiltonian-Cycle-Neighbor” 2294

amid those obvious[non-obvious] simple Extreme type-SuperHyperSets called the 2295

Extreme R-Hamiltonian-Cycle-Neighbor, 2296

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-Cycle-Neighbor amid those obvious simple Extreme type-SuperHyperSets of
the Extreme Hamiltonian-Cycle-Neighbor, 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-Cycle-Neighbor. In other words, the least cardinality, the lower sharp
bound for the cardinality, of an Extreme R-Hamiltonian-Cycle-Neighbor is the cardinality of

V \ V \ {aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .

2297
To sum them up, in a connected Extreme SuperHyperGraph ESHG : (V, E). The all interior 2298
Extreme SuperHyperVertices belong to any Extreme quasi-R-Hamiltonian-Cycle-Neighbor if for any 2299
of them, and any of other corresponded Extreme SuperHyperVertex, some interior Extreme 2300
SuperHyperVertices are mutually Extreme SuperHyperNeighbors with no Extreme exception at 2301
all minus all Extreme SuperHypeNeighbors to any amount of them. 2302

Assume a connected Extreme SuperHyperGraph ESHG : (V, E). Let an Extreme SuperHy- 2303
perEdge ESHE : E ∈ EESHG:(V,E) has some Extreme SuperHyperVertices r. Consider all 2304
Extreme numbers of those Extreme SuperHyperVertices from that Extreme SuperHyperEdge 2305
excluding excluding more than r distinct Extreme SuperHyperVertices, exclude to any given 2306
Extreme SuperHyperSet of the Extreme SuperHyperVertices. Consider there’s an Extreme 2307

R-Hamiltonian-Cycle-Neighbor with the least cardinality, the lower sharp Extreme bound for Extreme 2308
cardinality. Assume a connected Extreme SuperHyperGraph ESHG : (V, E). The Extreme 2309
SuperHyperSet of the Extreme SuperHyperVertices VESHE \ {z} is an Extreme SuperHyperSet 2310
S of the Extreme SuperHyperVertices such that there’s an Extreme SuperHyperEdge to have 2311
some Extreme SuperHyperVertices uniquely but it isn’t an Extreme R-Hamiltonian-Cycle-Neighbor. 2312
Since it doesn’t have 2313

2314
the maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme SuperHy- 2315
perVertices such that there’s an Extreme SuperHyperEdge to have some SuperHyperVertices 2316
uniquely. The Extreme SuperHyperSet of the Extreme SuperHyperVertices VESHE ∪ {z} is 2317
the maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme SuperHyper- 2318
Vertices but it isn’t an Extreme R-Hamiltonian-Cycle-Neighbor. Since it doesn’t do the Extreme 2319

procedure such that such that there’s an Extreme SuperHyperEdge to have some Extreme 2320
SuperHyperVertices uniquely [there are at least one Extreme SuperHyperVertex outside 2321
implying there’s, sometimes in the connected Extreme SuperHyperGraph ESHG : (V, E), 2322
an Extreme SuperHyperVertex, titled its Extreme SuperHyperNeighbor, to that Extreme 2323
SuperHyperVertex in the Extreme SuperHyperSet S so as S doesn’t do “the Extreme pro- 2324
cedure”.]. There’s only one Extreme SuperHyperVertex outside the intended Extreme 2325

SuperHyperSet, VESHE ∪ {z}, in the terms of Extreme SuperHyperNeighborhood. Thus the 2326
obvious Extreme R-Hamiltonian-Cycle-Neighbor, VESHE is up. The obvious simple Extreme type- 2327
SuperHyperSet of the Extreme R-Hamiltonian-Cycle-Neighbor, VESHE , is an Extreme SuperHyperSet, 2328
VESHE , includes only all Extreme SuperHyperVertices does forms any kind of Extreme 2329
pairs are titled Extreme SuperHyperNeighbors in a connected Extreme SuperHyperGraph 2330
ESHG : (V, E). Since the Extreme SuperHyperSet of the Extreme SuperHyperVertices VESHE , 2331

is the maximum Extreme SuperHyperCardinality of an Extreme SuperHyperSet S of 2332

Extreme SuperHyperVertices such that there’s an Extreme SuperHyperEdge to have some 2333
Extreme SuperHyperVertices uniquely. Thus, in a connected Extreme SuperHyperGraph 2334
ESHG : (V, E). Any Extreme R-Hamiltonian-Cycle-Neighbor only contains all interior Extreme 2335
SuperHyperVertices and all exterior Extreme SuperHyperVertices from the unique Extreme 2336
SuperHyperEdge where there’s any of them has all possible Extreme SuperHyperNeighbors in 2337

and there’s all Extreme SuperHyperNeighborhoods in with no exception minus all Extreme 2338

Henry Garrett · 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 2339
SuperHyperNeighborhoods and Extreme SuperHyperNeighbors out. 2340
The SuperHyperNotion, namely, Hamiltonian-Cycle-Neighbor, is up. There’s neither empty Su- 2341
perHyperEdge nor loop SuperHyperEdge. The following Extreme SuperHyperSet of Ex- 2342
treme SuperHyperEdges[SuperHyperVertices] is the simple Extreme type-SuperHyperSet 2343
of the Extreme Hamiltonian-Cycle-Neighbor. The Extreme SuperHyperSet of Extreme SuperHy- 2344

perEdges[SuperHyperVertices], 2345

C(N SHG)ExtremeQuasi−Hamiltonian−Cycle−N eighbor

|EESHG:(V,E) |Extreme Cardinality
b c
= {E2i−1 }i=1 2
.
C(N SHG)ExtremeQuasi−Hamiltonian−Cycle−N eighborSuperHyperP olynomial
|EESHG:(V,E) |Extreme Cardinality
= 2z b 2 c
.
C(N SHG)ExtremeR−Quasi−Hamiltonian−Cycle−N eighbor = {Vi }si=1 , {Vj }tj=1 .
C(N SHG)ExtremeR−Quasi−Hamiltonian−Cycle−N eighborSuperHyperP olynomial = az s + bz t .

is the simple Extreme type-SuperHyperSet of the Extreme Hamiltonian-Cycle-Neighbor. The Extreme 2346

SuperHyperSet of the Extreme SuperHyperEdges[SuperHyperVertices], 2347

C(N SHG)ExtremeQuasi−Hamiltonian−Cycle−N eighbor

|EESHG:(V,E) |Extreme Cardinality
b c
= {E2i−1 }i=1 2
.
C(N SHG)ExtremeQuasi−Hamiltonian−Cycle−N eighborSuperHyperP olynomial
|EESHG:(V,E) |Extreme Cardinality
= 2z b 2 c
.
C(N SHG)ExtremeR−Quasi−Hamiltonian−Cycle−N eighbor = {Vi }si=1 , {Vj }tj=1 .
C(N SHG)ExtremeR−Quasi−Hamiltonian−Cycle−N eighborSuperHyperP olynomial = az s + bz t .

Is an Extreme Hamiltonian-Cycle-Neighbor C(ESHG) for an Extreme SuperHyperGraph 2348

ESHG : (V, E) is an Extreme type-SuperHyperSet with 2349

2350
the maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme Su- 2351
perHyperEdges[SuperHyperVertices] such that there’s no Extreme SuperHyperVertex of an 2352
Extreme SuperHyperEdge is common and there’s an Extreme SuperHyperEdge for all Extreme 2353
SuperHyperVertices. There are not only two Extreme SuperHyperVertices inside the intended 2354

Extreme SuperHyperSet. Thus the non-obvious Extreme Hamiltonian-Cycle-Neighbor is up. The 2355
obvious simple Extreme type-SuperHyperSet called the Extreme Hamiltonian-Cycle-Neighbor is an 2356
Extreme SuperHyperSet includes only two Extreme SuperHyperVertices. But the Extreme 2357
SuperHyperSet of the Extreme SuperHyperEdges[SuperHyperVertices], 2358

C(N SHG)ExtremeQuasi−Hamiltonian−Cycle−N eighbor

|EESHG:(V,E) |Extreme Cardinality
b c
= {E2i−1 }i=1 2
.
C(N SHG)ExtremeQuasi−Hamiltonian−Cycle−N eighborSuperHyperP 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−Cycle−N eighbor = {Vi }si=1 , {Vj }tj=1 .

C(N SHG)ExtremeR−Quasi−Hamiltonian−Cycle−N eighborSuperHyperP olynomial = az s + bz t .

Doesn’t have less than three SuperHyperVertices inside the intended Extreme SuperHyper- 2359
Set. Thus the non-obvious simple Extreme type-SuperHyperSet of the Extreme Hamiltonian- 2360
Cycle-Neighbor is up. To sum them up, the Extreme SuperHyperSet of the Extreme SuperHy- 2361
perEdges[SuperHyperVertices], 2362

C(N SHG)ExtremeQuasi−Hamiltonian−Cycle−N eighbor

|EESHG:(V,E) |Extreme Cardinality
b c
= {E2i−1 }i=1 2
.
C(N SHG)ExtremeQuasi−Hamiltonian−Cycle−N eighborSuperHyperP olynomial
|EESHG:(V,E) |Extreme Cardinality
= 2z b 2 c
.
C(N SHG)ExtremeR−Quasi−Hamiltonian−Cycle−N eighbor = {Vi }si=1 , {Vj }tj=1 .
C(N SHG)ExtremeR−Quasi−Hamiltonian−Cycle−N eighborSuperHyperP olynomial = az s + bz t .

Is the non-obvious simple Extreme type-SuperHyperSet of the Extreme Hamiltonian-Cycle-Neighbor. 2363

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

C(N SHG)ExtremeQuasi−Hamiltonian−Cycle−N eighbor

|EESHG:(V,E) |Extreme Cardinality
b c
= {E2i−1 }i=1 2
.
C(N SHG)ExtremeQuasi−Hamiltonian−Cycle−N eighborSuperHyperP olynomial
|EESHG:(V,E) |Extreme Cardinality
= 2z b 2 c
.
C(N SHG)ExtremeR−Quasi−Hamiltonian−Cycle−N eighbor = {Vi }si=1 , {Vj }tj=1 .
C(N SHG)ExtremeR−Quasi−Hamiltonian−Cycle−N eighborSuperHyperP olynomial = az s + bz t .

Is an Extreme Hamiltonian-Cycle-Neighbor C(ESHG) for an Extreme SuperHyperGraph ESHG : 2365

(V, E) is the Extreme SuperHyperSet S of Extreme SuperHyperVertices such that there’s 2366
no an Extreme SuperHyperEdge for some Extreme SuperHyperVertices given by that Ex- 2367
treme type-SuperHyperSet called the Extreme Hamiltonian-Cycle-Neighbor and it’s an Extreme 2368

Hamiltonian-Cycle-Neighbor. Since it’s 2369

2370
the maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme Su- 2371
perHyperEdges[SuperHyperVertices] such that there’s no Extreme SuperHyperVertex of an 2372
Extreme SuperHyperEdge is common and there’s an Extreme SuperHyperEdge for all Extreme 2373
SuperHyperVertices. There aren’t only less than three Extreme SuperHyperVertices inside the 2374

intended Extreme SuperHyperSet, 2375

C(N SHG)ExtremeQuasi−Hamiltonian−Cycle−N eighbor

|EESHG:(V,E) |Extreme Cardinality
b c
= {E2i−1 }i=1 2
.
C(N SHG)ExtremeQuasi−Hamiltonian−Cycle−N eighborSuperHyperP 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−Cycle−N eighbor = {Vi }si=1 , {Vj }tj=1 .

C(N SHG)ExtremeR−Quasi−Hamiltonian−Cycle−N eighborSuperHyperP olynomial = az s + bz t .

Thus the non-obvious Extreme Hamiltonian-Cycle-Neighbor , 2376

C(N SHG)ExtremeQuasi−Hamiltonian−Cycle−N eighbor

|EESHG:(V,E) |Extreme Cardinality
b c
= {E2i−1 }i=1 2
.
C(N SHG)ExtremeQuasi−Hamiltonian−Cycle−N eighborSuperHyperP olynomial
|EESHG:(V,E) |Extreme Cardinality
= 2z b 2 c
.
C(N SHG)ExtremeR−Quasi−Hamiltonian−Cycle−N eighbor = {Vi }si=1 , {Vj }tj=1 .
C(N SHG)ExtremeR−Quasi−Hamiltonian−Cycle−N eighborSuperHyperP olynomial = az s + bz t .

Is up. The obvious simple Extreme type-SuperHyperSet of the Extreme Hamiltonian-Cycle-Neighbor , 2377
not: 2378

C(N SHG)ExtremeQuasi−Hamiltonian−Cycle−N eighbor

|EESHG:(V,E) |Extreme Cardinality
b c
= {E2i−1 }i=1 2
.
C(N SHG)ExtremeQuasi−Hamiltonian−Cycle−N eighborSuperHyperP olynomial
|EESHG:(V,E) |Extreme Cardinality
= 2z b 2 c
.
C(N SHG)ExtremeR−Quasi−Hamiltonian−Cycle−N eighbor = {Vi }si=1 , {Vj }tj=1 .
C(N SHG)ExtremeR−Quasi−Hamiltonian−Cycle−N eighborSuperHyperP olynomial = az s + bz t .

Is the Extreme SuperHyperSet, not: 2379

C(N SHG)ExtremeQuasi−Hamiltonian−Cycle−N eighbor

|EESHG:(V,E) |Extreme Cardinality
b c
= {E2i−1 }i=1 2
.
C(N SHG)ExtremeQuasi−Hamiltonian−Cycle−N eighborSuperHyperP olynomial
|EESHG:(V,E) |Extreme Cardinality
= 2z b 2 c
.
C(N SHG)ExtremeR−Quasi−Hamiltonian−Cycle−N eighbor = {Vi }si=1 , {Vj }tj=1 .
C(N SHG)ExtremeR−Quasi−Hamiltonian−Cycle−N eighborSuperHyperP olynomial = az s + bz t .

Does includes only less than three SuperHyperVertices in a connected Extreme SuperHyperGraph 2380
ESHG : (V, E). It’s interesting to mention that the only non-obvious simple Extreme type- 2381
SuperHyperSet called the 2382

“Extreme Hamiltonian-Cycle-Neighbor ” 2383

amid those obvious[non-obvious] simple Extreme type-SuperHyperSets called the 2384

Extreme Hamiltonian-Cycle-Neighbor , 2385

Henry Garrett · 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 2386

C(N SHG)ExtremeQuasi−Hamiltonian−Cycle−N eighbor

|EESHG:(V,E) |Extreme Cardinality
b c
= {E2i−1 }i=1 2
.
C(N SHG)ExtremeQuasi−Hamiltonian−Cycle−N eighborSuperHyperP olynomial
|EESHG:(V,E) |Extreme Cardinality
= 2z b 2 c
.
C(N SHG)ExtremeR−Quasi−Hamiltonian−Cycle−N eighbor = {Vi }si=1 , {Vj }tj=1 .
C(N SHG)ExtremeR−Quasi−Hamiltonian−Cycle−N eighborSuperHyperP olynomial = az s + bz t .

In a connected Extreme SuperHyperGraph ESHG : (V, E).  2387

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 CHAPTER 11 2388

The Extreme Departures on The 2389

Theoretical Results Toward Theoretical 2390

Motivations 2391

The previous Extreme approach apply on the upcoming Extreme results on Extreme 2392
SuperHyperClasses. 2393

Proposition 11.0.1. Assume a connected Extreme SuperHyperPath ESHP : (V, E). Then 2394

C(N SHG)Extreme Hamiltonian-Cycle-Neighbor

= {}.
C(N SHG)Extreme Hamiltonian-Cycle-Neighbor SuperHyperPolynomial
= 0z 0 .
C(N SHG)Extreme V-Hamiltonian-Cycle-Neighbor
= {}.
C(N SHG)Extreme V-Hamiltonian-Cycle-Neighbor SuperHyperPolynomial
= 0z 0 .
Proof. Let 2395

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V |EN SHG |
, E |EN SHG |
3 3
2396

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-Cycle-Neighbor in the Example (42.0.5) 136NSHG18a

be a longest path taken from a connected Extreme SuperHyperPath ESHP : (V, E). There’s a 2397
new way to redefine as 2398

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 2399
to ViEXT ERN AL in the literatures of SuperHyperHamiltonian-Cycle-Neighbor. The latter is 2400
straightforward.  2401

136EXM18a Example 11.0.2. In the Figure (31.1), the connected Extreme SuperHyperPath ESHP : (V, E), 2402
is highlighted and featured. The Extreme SuperHyperSet, in the Extreme SuperHyperModel 2403
(31.1), is the SuperHyperHamiltonian-Cycle-Neighbor. 2404

Proposition 11.0.3. Assume a connected Extreme SuperHyperCycle ESHC : (V, E). Then 2405

C(N SHG)Extreme Hamiltonian-Cycle-Neighbor

= {}.
C(N SHG)Extreme Hamiltonian-Cycle-Neighbor SuperHyperPolynomial
= 0z 0 .
C(N SHG)Extreme V-Hamiltonian-Cycle-Neighbor

Henry Garrett · 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-Cycle-Neighbor SuperHyperPolynomial
= 0z 0 .
2406

Proof. Let 2407

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V |EN SHG |
, E |EN SHG |
3 3
2408

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 2409
new way to redefine as 2410

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 2411
to ViEXT ERN AL in the literatures of SuperHyperHamiltonian-Cycle-Neighbor. The latter is 2412
straightforward.  2413

136EXM19a Example 11.0.4. In the Figure (31.2), the connected Extreme SuperHyperCycle N SHC : 2414
(V, E), is highlighted and featured. The obtained Extreme SuperHyperSet, in the Extreme 2415

SuperHyperModel (31.2), is the Extreme SuperHyperHamiltonian-Cycle-Neighbor. 2416

Proposition 11.0.5. Assume a connected Extreme SuperHyperStar ESHS : (V, E). Then 2417

C(N SHG)Extreme Hamiltonian-Cycle-Neighbor

= {}.
C(N SHG)Extreme Hamiltonian-Cycle-Neighbor SuperHyperPolynomial
= 0z 0 .
C(N SHG)Extreme V-Hamiltonian-Cycle-Neighbor
= {}.
C(N SHG)Extreme V-Hamiltonian-Cycle-Neighbor SuperHyperPolynomial
= 0z 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

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

SuperHyperHamiltonian-Cycle-Neighbor in the Extreme Example (42.0.7) 136NSHG19a

Proof. Let 2418

P :
V1EXT ERN AL , E1 ,
CEN T ER, E2
2419

P :
E1 , V1EXT ERN AL ,
E2 , CEN T ER

be a longest path taken a connected Extreme SuperHyperStar ESHS : (V, E). There’s a new 2420
way to redefine as 2421

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 2422
to ViEXT ERN AL in the literatures of SuperHyperHamiltonian-Cycle-Neighbor. The latter is 2423

straightforward.  2424

Henry Garrett · 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-Cycle-Neighbor in the Extreme Example (42.0.9) 136NSHG20a

136EXM20a Example 11.0.6. In the Figure (31.3), the connected Extreme SuperHyperStar ESHS : (V, E), 2425
is highlighted and featured. The obtained Extreme SuperHyperSet, by the Algorithm in previous 2426
Extreme result, of the Extreme SuperHyperVertices of the connected Extreme SuperHyperStar 2427
ESHS : (V, E), in the Extreme SuperHyperModel (31.3), is the Extreme SuperHyperHamiltonian- 2428
Cycle-Neighbor. 2429

Proposition 11.0.7. Assume a connected Extreme SuperHyperBipartite ESHB : (V, E). Then 2430

C(N SHG)Extreme Hamiltonian-Cycle-Neighbor

= {}.
C(N SHG)Extreme Hamiltonian-Cycle-Neighbor SuperHyperPolynomial
= 0z 0 .
C(N SHG)Extreme V-Hamiltonian-Cycle-Neighbor
= {}.
C(N SHG)Extreme V-Hamiltonian-Cycle-Neighbor SuperHyperPolynomial
= 0z 0 .
Proof. Let 2431

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
V|Pi |=minP ∈E |Pj | , E|Pi |=minPj ∈EN SHG |Pj | .
j N SHG

2432

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 2433
a new way to redefine as 2434

ViEXT ERN AL ∼ VjEXT ERN AL ≡

∃!Ez ∈ EESHG:(V,E) , ViEXT ERN AL , VjEXT ERN AL ∈ Ez ≡
∃!Ez ∈ EESHG:(V,E) , {ViEXT ERN AL , VjEXT ERN AL } ⊆ Ez .

The term “EXTERNAL” implies |N (ViEXT ERN AL )| ≥ |N (Vj )| where Vj is corresponded 2435
to ViEXT ERN AL in the literatures of SuperHyperHamiltonian-Cycle-Neighbor. The latter is 2436

straightforward. Then there’s no at least one SuperHyperHamiltonian-Cycle-Neighbor. Thus the 2437

notion of quasi may be up but the SuperHyperNotions based on SuperHyperHamiltonian-Cycle- 2438
Neighbor could be applied. There are only two SuperHyperParts. Thus every SuperHyperPart 2439
could have one SuperHyperVertex as the representative in the 2440

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

is a longest SuperHyperHamiltonian-Cycle-Neighbor taken from a connected Extreme SuperHyperBi- 2441

partite ESHB : (V, E). Thus only some SuperHyperVertices and only minimum-Extreme-of- 2442
SuperHyperPart SuperHyperEdges are attained in any solution 2443

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

The latter is straightforward.  2444

136EXM21a Example 11.0.8. In the Extreme Figure (31.4), the connected Extreme SuperHyperBipartite 2445
ESHB : (V, E), is Extreme highlighted and Extreme featured. The obtained Extreme 2446
SuperHyperSet, by the Extreme Algorithm in previous Extreme result, of the Extreme 2447
SuperHyperVertices of the connected Extreme SuperHyperBipartite ESHB : (V, E), in the 2448

Extreme SuperHyperModel (31.4), is the Extreme SuperHyperHamiltonian-Cycle-Neighbor. 2449

Henry Garrett · 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-Cycle-Neighbor in the Example (42.0.11) 136NSHG21a

Proposition 11.0.9. Assume a connected Extreme SuperHyperMultipartite ESHM : (V, E). 2450
Then 2451

C(N SHG)Extreme Hamiltonian-Cycle-Neighbor

= {}.
C(N SHG)Extreme Hamiltonian-Cycle-Neighbor SuperHyperPolynomial
= 0z 0 .
C(N SHG)Extreme V-Hamiltonian-Cycle-Neighbor
= {}.
C(N SHG)Extreme V-Hamiltonian-Cycle-Neighbor SuperHyperPolynomial
= 0z 0 .

Proof. Let 2452

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

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

2453

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-Cycle-Neighbor taken from a connected Extreme SuperHyperMul- 2454

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

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 2456
to ViEXT ERN AL in the literatures of SuperHyperHamiltonian-Cycle-Neighbor. The latter is 2457
straightforward. Then there’s no at least one SuperHyperHamiltonian-Cycle-Neighbor. Thus the 2458
notion of quasi may be up but the SuperHyperNotions based on SuperHyperHamiltonian-Cycle- 2459
0
Neighbor could be applied. There are only z SuperHyperParts. Thus every SuperHyperPart 2460
could have one SuperHyperVertex as the representative in the 2461

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

is a longest path taken from a connected Extreme SuperHyperMultipartite ESHM : 2462

(V, E). Thus only some SuperHyperVertices and only minimum-Extreme-of-SuperHyperPart 2463
SuperHyperEdges are attained in any solution 2464

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

is a longest path taken from a connected Extreme SuperHyperMultipartite ESHM : (V, E). 2465

The latter is straightforward.  2466

136EXM22a Example 11.0.10. In the Figure (31.5), the connected Extreme SuperHyperMultipartite 2467

ESHM : (V, E), is highlighted and Extreme featured. The obtained Extreme SuperHyperSet, by 2468
the Algorithm in previous Extreme result, of the Extreme SuperHyperVertices of the connected 2469
Extreme SuperHyperMultipartite ESHM : (V, E), in the Extreme SuperHyperModel (31.5), is 2470
the Extreme SuperHyperHamiltonian-Cycle-Neighbor. 2471

Proposition 11.0.11. Assume a connected Extreme SuperHyperWheel ESHW : (V, E). Then, 2472

C(N SHG)Extreme Hamiltonian-Cycle-Neighbor

Henry Garrett · 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-Cycle-Neighbor in the Example (42.0.13) 136NSHG22a

= {}.
C(N SHG)Extreme Hamiltonian-Cycle-Neighbor SuperHyperPolynomial
= 0z 0 .
C(N SHG)Extreme V-Hamiltonian-Cycle-Neighbor
= {CEN T ER}.
C(N SHG)Extreme V-Hamiltonian-Cycle-Neighbor SuperHyperPolynomial
= za.
Proof. Let 2473

P :
V1EXT ERN AL , E1∗ ,
CEN T ER, E2∗
2474

P :
E1∗ , V1EXT ERN AL ,
E2∗ , CEN T ER
is a longest SuperHyperHamiltonian-Cycle-Neighbor taken from a connected Extreme SuperHyperWheel 2475
ESHW : (V, E). There’s a new way to redefine as 2476

ViEXT ERN AL ∼ VjEXT ERN AL ≡

∃!Ez ∈ EESHG:(V,E) , ViEXT ERN AL , VjEXT ERN AL ∈ Ez ≡
∃!Ez ∈ EESHG:(V,E) , {ViEXT ERN AL , VjEXT ERN AL } ⊆ Ez .

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

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

Extreme SuperHyperHamiltonian-Cycle-Neighbor in the Extreme Example (42.0.15) 136NSHG23a

The term “EXTERNAL” implies |N (ViEXT ERN AL )| ≥ |N (Vj )| where Vj is corresponded 2477
to ViEXT ERN AL in the literatures of SuperHyperHamiltonian-Cycle-Neighbor. The latter is 2478

straightforward. Then there’s at least one SuperHyperHamiltonian-Cycle-Neighbor. Thus the notion 2479
of quasi isn’t up and the SuperHyperNotions based on SuperHyperHamiltonian-Cycle-Neighbor 2480
could be applied. The unique embedded SuperHyperHamiltonian-Cycle-Neighbor proposes some 2481
longest SuperHyperHamiltonian-Cycle-Neighbor excerpt from some representatives. The latter is 2482
straightforward.  2483

136EXM23a Example 11.0.12. In the Extreme Figure (31.6), the connected Extreme SuperHyperWheel 2484
N SHW : (V, E), is Extreme highlighted and featured. The obtained Extreme SuperHyperSet, 2485
by the Algorithm in previous result, of the Extreme SuperHyperVertices of the connected 2486

Extreme SuperHyperWheel ESHW : (V, E), in the Extreme SuperHyperModel (31.6), is the 2487
Extreme SuperHyperHamiltonian-Cycle-Neighbor. 2488

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 CHAPTER 12 2489

The Surveys of Mathematical Sets On 2490

The Results But As The Initial Motivation 2491

For the SuperHyperHamiltonian-Cycle-Neighbor, Extreme SuperHyperHamiltonian-Cycle-Neighbor, and the 2492

Extreme SuperHyperHamiltonian-Cycle-Neighbor, some general results are introduced. 2493

Remark 12.0.1. Let remind that the Extreme SuperHyperHamiltonian-Cycle-Neighbor is “redefined” 2494
on the positions of the alphabets. 2495

Corollary 12.0.2. Assume Extreme SuperHyperHamiltonian-Cycle-Neighbor. Then 2496

Extreme SuperHyperHamiltonian − Cycle − N eighbor =

{theSuperHyperHamiltonian − Cycle − N eighborof theSuperHyperV ertices |
max |SuperHyperOf f ensive
SuperHyperHamiltonian − Cycle − N eighbor
|ExtremecardinalityamidthoseSuperHyperHamiltonian−Cycle−N eighbor. }

plus one Extreme SuperHypeNeighbor to one. Where σi is the unary operation on the 2497
SuperHyperVertices of the SuperHyperGraph to assign the determinacy, the indeterminacy 2498
and the neutrality, for i = 1, 2, 3, respectively. 2499

Corollary 12.0.3. Assume an Extreme SuperHyperGraph on the same identical letter of the 2500
alphabet. Then the notion of Extreme SuperHyperHamiltonian-Cycle-Neighbor and SuperHyperHamiltonian- 2501

Cycle-Neighbor coincide. 2502

Corollary 12.0.4. Assume an Extreme SuperHyperGraph on the same identical letter of 2503
the alphabet. Then a conseNeighborive sequence of the SuperHyperVertices is an Extreme 2504
SuperHyperHamiltonian-Cycle-Neighbor if and only if it’s a SuperHyperHamiltonian-Cycle-Neighbor. 2505

Corollary 12.0.5. Assume an Extreme SuperHyperGraph on the same identical letter of 2506
the alphabet. Then a conseNeighborive sequence of the SuperHyperVertices is a strongest 2507
SuperHyperHamiltonian-Cycle-Neighbor if and only if it’s a longest SuperHyperHamiltonian-Cycle-Neighbor. 2508

Corollary 12.0.6. Assume SuperHyperClasses of an Extreme SuperHyperGraph on the same 2509

identical letter of the alphabet. Then its Extreme SuperHyperHamiltonian-Cycle-Neighbor is its 2510
SuperHyperHamiltonian-Cycle-Neighbor and reversely. 2511

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

Corollary 12.0.7. Assume an Extreme SuperHyperPath(-/SuperHyperHamiltonian-Cycle-Neighbor, 2512

SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel) on the same 2513
identical letter of the alphabet. Then its Extreme SuperHyperHamiltonian-Cycle-Neighbor is its 2514
SuperHyperHamiltonian-Cycle-Neighbor and reversely. 2515

Corollary 12.0.8. Assume an Extreme SuperHyperGraph. Then its Extreme SuperHyperHamiltonian- 2516
isn’t well-defined if and only if its SuperHyperHamiltonian-Cycle-Neighbor isn’t well-defined.
Cycle-Neighbor 2517

Corollary 12.0.9. Assume SuperHyperClasses of an Extreme SuperHyperGraph. Then its 2518

Extreme SuperHyperHamiltonian-Cycle-Neighbor isn’t well-defined if and only if its SuperHyperHamiltonian- 2519

Cycle-Neighbor isn’t well-defined. 2520

Corollary 12.0.10. Assume an Extreme SuperHyperPath(-/SuperHyperHamiltonian-Cycle-Neighbor, 2521

SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). Then its 2522
Extreme SuperHyperHamiltonian-Cycle-Neighbor isn’t well-defined if and only if its SuperHyperHamiltonian- 2523
Cycle-Neighbor isn’t well-defined. 2524

Corollary 12.0.11. Assume an Extreme SuperHyperGraph. Then its Extreme SuperHyperHamiltonian-2525

is well-defined if and only if its SuperHyperHamiltonian-Cycle-Neighbor is well-defined.
Cycle-Neighbor 2526

Corollary 12.0.12. Assume SuperHyperClasses of an Extreme SuperHyperGraph. Then its 2527

Extreme SuperHyperHamiltonian-Cycle-Neighbor is well-defined if and only if its SuperHyperHamiltonian- 2528
Cycle-Neighbor is well-defined. 2529

Corollary 12.0.13. Assume an Extreme SuperHyperPath(-/SuperHyperHamiltonian-Cycle-Neighbor, 2530

SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). Then its 2531
Extreme SuperHyperHamiltonian-Cycle-Neighbor is well-defined if and only if its SuperHyperHamiltonian- 2532
Cycle-Neighbor is well-defined. 2533

Proposition 12.0.14. Let ESHG : (V, E) be an Extreme SuperHyperGraph. Then V is 2534

(i) : the dual SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 2535

(ii) : the strong dual SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 2536

(iii) : the connected dual SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 2537

(iv) : the δ-dual SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 2538

(v) : the strong δ-dual SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 2539

(vi) : the connected δ-dual SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor. 2540

Proposition 12.0.15. Let N T G : (V, E, σ, µ) be an Extreme SuperHyperGraph. Then ∅ is 2541

(i) : the SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 2542

(ii) : the strong SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 2543

(iii) : the connected defensive SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 2544

(iv) : the δ-SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 2545

(v) : the strong δ-SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 2546

Henry Garrett · 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-Cycle-Neighbor. 2547

Proposition 12.0.16. Let ESHG : (V, E) be an Extreme SuperHyperGraph. Then an 2548

independent SuperHyperSet is 2549

(i) : the SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 2550

(ii) : the strong SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 2551

(iii) : the connected SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 2552

(iv) : the δ-SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 2553

(v) : the strong δ-SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 2554

(vi) : the connected δ-SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor. 2555

Proposition 12.0.17. Let ESHG : (V, E) be an Extreme SuperHyperUniform SuperHyperGraph 2556

which is a SuperHyperHamiltonian-Cycle-Neighbor/SuperHyperPath. Then V is a maximal 2557

(i) : SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 2558

(ii) : strong SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 2559

(iii) : connected SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 2560

(iv) : O(ESHG)-SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 2561

(v) : strong O(ESHG)-SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 2562

(vi) : connected O(ESHG)-SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 2563

Where the exterior SuperHyperVertices and the interior SuperHyperVertices coincide. 2564

Proposition 12.0.18. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is a 2565

SuperHyperUniform SuperHyperWheel. Then V is a maximal 2566

(i) : dual SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 2567

(ii) : strong dual SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 2568

(iii) : connected dual SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 2569

(iv) : O(ESHG)-dual SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 2570

(v) : strong O(ESHG)-dual SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 2571

(vi) : connected O(ESHG)-dual SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 2572

Where the exterior SuperHyperVertices and the interior SuperHyperVertices coincide. 2573

Proposition 12.0.19. Let ESHG : (V, E) be an Extreme SuperHyperUniform SuperHyperGraph 2574

which is a SuperHyperHamiltonian-Cycle-Neighbor/SuperHyperPath. Then the number of 2575

(i) : the SuperHyperHamiltonian-Cycle-Neighbor; 2576

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

(ii) : the SuperHyperHamiltonian-Cycle-Neighbor; 2577

(iii) : the connected SuperHyperHamiltonian-Cycle-Neighbor; 2578

(iv) : the O(ESHG)-SuperHyperHamiltonian-Cycle-Neighbor; 2579

(v) : the strong O(ESHG)-SuperHyperHamiltonian-Cycle-Neighbor; 2580

(vi) : the connected O(ESHG)-SuperHyperHamiltonian-Cycle-Neighbor. 2581

is one and it’s only V. Where the exterior SuperHyperVertices and the interior SuperHyperVertices 2582
coincide. 2583

Proposition 12.0.20. Let ESHG : (V, E) be an Extreme SuperHyperUniform SuperHyperGraph 2584

which is a SuperHyperWheel. Then the number of 2585

(i) : the dual SuperHyperHamiltonian-Cycle-Neighbor; 2586

(ii) : the dual SuperHyperHamiltonian-Cycle-Neighbor; 2587

(iii) : the dual connected SuperHyperHamiltonian-Cycle-Neighbor; 2588

(iv) : the dual O(ESHG)-SuperHyperHamiltonian-Cycle-Neighbor; 2589

(v) : the strong dual O(ESHG)-SuperHyperHamiltonian-Cycle-Neighbor; 2590

(vi) : the connected dual O(ESHG)-SuperHyperHamiltonian-Cycle-Neighbor. 2591

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

coincide. 2593

Proposition 12.0.21. Let ESHG : (V, E) be an Extreme SuperHyperUniform SuperHyperGraph 2594

which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperComplete 2595

SuperHyperMultipartite. Then a SuperHyperSet contains [the SuperHyperCenter and] the half of 2596
multiplying r with the number of all the SuperHyperEdges plus one of all the SuperHyperVertices 2597
is a 2598

(i) : dual SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 2599

(ii) : strong dual SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 2600

(iii) : connected dual SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 2601

O(ESHG)
(iv) : 2 + 1-dual SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 2602

O(ESHG)
(v) : strong 2 + 1-dual SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 2603

O(ESHG)
(vi) : connected 2 + 1-dual SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor. 2604

Proposition 12.0.22. Let ESHG : (V, E) be an Extreme SuperHyperUniform SuperHyperGraph 2605

which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperComplete 2606
SuperHyperMultipartite. Then a SuperHyperSet contains the half of multiplying r with the 2607
number of all the SuperHyperEdges plus one of all the SuperHyperVertices in the biggest 2608

SuperHyperPart is a 2609

Henry Garrett · 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-Cycle-Neighbor; 2610

(ii) : strong SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 2611

(iii) : connected SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 2612

(iv) : δ-SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 2613

(v) : strong δ-SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 2614

(vi) : connected δ-SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor. 2615

Proposition 12.0.23. Let ESHG : (V, E) be an Extreme SuperHyperUniform SuperHyperGraph 2616

which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperComplete 2617
SuperHyperMultipartite. Then Then the number of 2618

(i) : dual SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 2619

(ii) : strong dual SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 2620

(iii) : connected dual SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 2621

O(ESHG)
(iv) : 2 + 1-dual SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 2622

O(ESHG)
(v) : strong 2 + 1-dual SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 2623

O(ESHG)
(vi) : connected 2 + 1-dual SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor. 2624

is one and it’s only S, 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

Where the exterior SuperHyperVertices and the interior SuperHyperVertices coincide. 2627

Proposition 12.0.24. Let ESHG : (V, E) be an Extreme SuperHyperGraph. The number of 2628

connected component is |V − S| if there’s a SuperHyperSet which is a dual 2629

(i) : SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 2630

(ii) : strong SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 2631

(iii) : connected SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 2632

(iv) : SuperHyperHamiltonian-Cycle-Neighbor; 2633

(v) : strong 1-SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 2634

(vi) : connected 1-SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor. 2635

Proposition 12.0.25. Let ESHG : (V, E) be an Extreme SuperHyperGraph. Then the number 2636
is at most O(ESHG) and the Extreme number is at most On (ESHG). 2637

Proposition 12.0.26. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is 2638

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

min Σv∈{v1 ,v2 ,··· ,vt } O(ESHG:(V,E)) ⊆V σ(v), in the setting of dual 2640
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-Cycle-Neighbor; 2641

(ii) : strong SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 2642

(iii) : connected SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 2643

(iv) : ( O(ESHG:(V,E))
2 + 1)-SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 2644

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

2 + 1)-SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 2645

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

2 + 1)-SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor. 2646

Proposition 12.0.27. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is ∅. The 2647
number is 0 and the Extreme number is 0, for an independent SuperHyperSet in the setting of 2648
dual 2649

(i) : SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 2650

(ii) : strong SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 2651

(iii) : connected SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 2652

(iv) : 0-SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 2653

(v) : strong 0-SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 2654

(vi) : connected 0-SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor. 2655

Proposition 12.0.28. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is SuperHy- 2656
perComplete. Then there’s no independent SuperHyperSet. 2657

Proposition 12.0.29. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is 2658

SuperHyperHamiltonian-Cycle-Neighbor/SuperHyperPath/SuperHyperWheel. The number is O(ESHG : 2659

(V, E)) and the Extreme number is On (ESHG : (V, E)), in the setting of a dual 2660

(i) : SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 2661

(ii) : strong SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 2662

(iii) : connected SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 2663

(iv) : O(ESHG : (V, E))-SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 2664

(v) : strong O(ESHG : (V, E))-SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 2665

(vi) : connected O(ESHG : (V, E))-SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor. 2666

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

(i) : SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 2671

Henry Garrett · 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-Cycle-Neighbor; 2672

(iii) : connected SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 2673

(iv) : ( O(ESHG:(V,E))
2 + 1)-SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 2674

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

2 + 1)-SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 2675

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

2 + 1)-SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor. 2676

Proposition 12.0.31. Let N SHF : (V, E) be a SuperHyperFamily of the ESHGs : (V, E) 2677
Extreme SuperHyperGraphs which are from one-type SuperHyperClass which the result is obtained 2678
for the individuals. Then the results also hold for the SuperHyperFamily N SHF : (V, E) of 2679
these specific SuperHyperClasses of the Extreme SuperHyperGraphs. 2680

Proposition 12.0.32. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph. If S is a dual 2681
SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor, then ∀v ∈ V \ S, ∃x ∈ S such that 2682

(i) v ∈ Ns (x); 2683

(ii) vx ∈ E. 2684

Proposition 12.0.33. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph. If S is a dual 2685
SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor, then 2686

(i) S is SuperHyperHamiltonian-Cycle-Neighbor set; 2687

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

Proposition 12.0.34. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph. Then 2689

(i) Γ ≤ O; 2690

(ii) Γs ≤ On . 2691

Proposition 12.0.35. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph which is 2692
connected. Then 2693

(i) Γ ≤ O − 1; 2694

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

Proposition 12.0.36. Let ESHG : (V, E) be an odd SuperHyperPath. Then 2696

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

SuperHyperHamiltonian-Cycle-Neighbor; 2698

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

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

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

SuperHyperHamiltonian-Cycle-Neighbor. 2702

Henry Garrett · 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 2703

(i) the set S = {v2 , v4 , · · · .vn } is a dual SuperHyperDefensive SuperHyperHamiltonian-Cycle- 2704

Neighbor; 2705

(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · .vn } and {v1 , v3 , · · · .vn−1 }; 2706

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

(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 2708
SuperHyperHamiltonian-Cycle-Neighbor. 2709

Proposition 12.0.38. Let ESHG : (V, E) be an even SuperHyperHamiltonian-Cycle-Neighbor. Then 2710

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

Cycle-Neighbor; 2712

(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · , vn } and {v1 , v3 , · · · , vn−1 }; 2713

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

(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn } and S2 = {v1 , v3 , · · · , vn−1 } are only dual 2715
SuperHyperHamiltonian-Cycle-Neighbor. 2716

Proposition 12.0.39. Let ESHG : (V, E) be an odd SuperHyperHamiltonian-Cycle-Neighbor. Then 2717

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

SuperHyperHamiltonian-Cycle-Neighbor; 2719

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

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

(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn−1 } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 2722
SuperHyperHamiltonian-Cycle-Neighbor. 2723

Proposition 12.0.40. Let ESHG : (V, E) be SuperHyperStar. Then 2724

(i) the SuperHyperSet S = {c} is a dual maximal SuperHyperHamiltonian-Cycle-Neighbor; 2725

(ii) Γ = 1; 2726

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

(iv) the SuperHyperSets S = {c} and S ⊂ S 0 are only dual SuperHyperHamiltonian-Cycle-Neighbor. 2728

Proposition 12.0.41. Let ESHG : (V, E) be SuperHyperWheel. Then 2729

6+3(i−1)≤n
(i) the SuperHyperSet S = {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is a dual maximal 2730
SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 2731

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

(iii) Γs = Σ{v1 ,v3 }∪{v6 ,v9 ··· ,vi+6 ,··· ,vn }6+3(i−1)≤n Σ3i=1 σi (s); 2733
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 2734

SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor. 2735

Proposition 12.0.42. Let ESHG : (V, E) be an odd SuperHyperComplete. Then 2736

b n c+1
(i) the SuperHyperSet S = {vi }i=1
2
is a dual SuperHyperDefensive SuperHyperHamiltonian- 2737
Cycle-Neighbor; 2738

(ii) Γ = b n2 c + 1; 2739

(iii) Γs = min{Σs∈S Σ3i=1 σi (s)} b n c+1

2
; 2740
S={vi }i=1

b n c+1
(iv) the SuperHyperSet S = {vi }i=1
2
is only a dual SuperHyperDefensive SuperHyperHamiltonian- 2741

Cycle-Neighbor. 2742

Proposition 12.0.43. Let ESHG : (V, E) be an even SuperHyperComplete. Then 2743

bnc
(i) the SuperHyperSet S = {vi }i=1
2
is a dual SuperHyperDefensive SuperHyperHamiltonian-Cycle- 2744
Neighbor; 2745

(ii) Γ = b n2 c; 2746

(iii) Γs = min{Σs∈S Σ3i=1 σi (s)} bnc

2
; 2747
S={vi }i=1

bnc
(iv) the SuperHyperSet S = {vi }i=1 2
is only a dual maximal SuperHyperDefensive 2748

SuperHyperHamiltonian-Cycle-Neighbor. 2749

Proposition 12.0.44. Let N SHF : (V, E) be a m-SuperHyperFamily of Extreme SuperHyper- 2750

Stars with common Extreme SuperHyperVertex SuperHyperSet. Then 2751

(i) the SuperHyperSet S = {c1 , c2 , · · · , cm } is a dual SuperHyperDefensive SuperHyperHamiltonian- 2752

Cycle-Neighbor for N SHF; 2753

(ii) Γ = m for N SHF : (V, E); 2754

(iii) Γs = Σm 3
i=1 Σj=1 σj (ci ) for N SHF : (V, E); 2755

(iv) the SuperHyperSets S = {c1 , c2 , · · · , cm } and S ⊂ S 0 are only dual SuperHyperHamiltonian- 2756
Cycle-Neighbor for N SHF : (V, E). 2757

Proposition 12.0.45. Let N SHF : (V, E) be an m-SuperHyperFamily of odd SuperHyperCom- 2758

plete SuperHyperGraphs with common Extreme SuperHyperVertex SuperHyperSet. Then 2759

b n c+1
(i) the SuperHyperSet S = {vi }i=1 2
is a dual maximal SuperHyperDefensive 2760
SuperHyperHamiltonian-Cycle-Neighbor for N SHF; 2761

(ii) Γ = b n2 c + 1 for N SHF : (V, E); 2762

(iii) Γs = min{Σs∈S Σ3i=1 σi (s)} b n c+1

2
for N SHF : (V, E); 2763
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-Cycle- 2764

Neighbor for N SHF : (V, E). 2765

Proposition 12.0.46. Let N SHF : (V, E) be a m-SuperHyperFamily of even SuperHyperCom- 2766

plete SuperHyperGraphs with common Extreme SuperHyperVertex SuperHyperSet. Then 2767

bnc
(i) the SuperHyperSet S = {vi }i=1
2
is a dual SuperHyperDefensive SuperHyperHamiltonian-Cycle- 2768
Neighbor for N SHF : (V, E); 2769

(ii) Γ = b n2 c for N SHF : (V, E); 2770

(iii) Γs = min{Σs∈S Σ3i=1 σi (s)} 2

bnc for N SHF : (V, E); 2771
S={vi }i=1

bnc
(iv) the SuperHyperSets S = {vi }i=1
2
are only dual maximal SuperHyperHamiltonian-Cycle-Neighbor 2772
for N SHF : (V, E). 2773

Proposition 12.0.47. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph. Then 2774
following statements hold; 2775

(i) if s ≥ t and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 2776

SuperHyperHamiltonian-Cycle-Neighbor, then S is an s-SuperHyperDefensive SuperHyperHamiltonian- 2777
Cycle-Neighbor; 2778

(ii) if s ≤ t and a SuperHyperSet S of SuperHyperVertices is a dual t-SuperHyperDefensive 2779

SuperHyperHamiltonian-Cycle-Neighbor, then S is a dual s-SuperHyperDefensive SuperHyperHamiltonian-
2780
Cycle-Neighbor. 2781

Proposition 12.0.48. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph. Then 2782

following statements hold; 2783

(i) if s ≥ t + 2 and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 2784

SuperHyperHamiltonian-Cycle-Neighbor, then S is an s-SuperHyperPowerful SuperHyperHamiltonian- 2785
Cycle-Neighbor; 2786

(ii) if s ≤ t and a SuperHyperSet S of SuperHyperVertices is a dual t-SuperHyperDefensive 2787

SuperHyperHamiltonian-Cycle-Neighbor, then S is a dual s-SuperHyperPowerful SuperHyperHamiltonian-2788
Cycle-Neighbor. 2789

Proposition 12.0.49. Let ESHG : (V, E) be a[an] [V-]SuperHyperUniform-strong-Extreme 2790

SuperHyperGraph. Then following statements hold; 2791

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

SuperHyperHamiltonian-Cycle-Neighbor; 2793

(ii) if ∀a ∈ V \ S, |Ns (a) ∩ S| > b 2r c + 1, then ESHG : (V, E) is a dual 2-SuperHyperDefensive 2794
SuperHyperHamiltonian-Cycle-Neighbor; 2795

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

SuperHyperHamiltonian-Cycle-Neighbor; 2797

Henry Garrett · 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 2798

SuperHyperHamiltonian-Cycle-Neighbor. 2799

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

SuperHyperGraph. Then following statements hold; 2801

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

SuperHyperHamiltonian-Cycle-Neighbor; 2803

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

SuperHyperHamiltonian-Cycle-Neighbor; 2805

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

SuperHyperHamiltonian-Cycle-Neighbor; 2807

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

SuperHyperHamiltonian-Cycle-Neighbor. 2809

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

SuperHyperGraph which is a SuperHyperComplete. Then following statements hold; 2811

(i) ∀a ∈ S, |Ns (a) ∩ S| < b O−1 2 c + 1 if ESHG : (V, E) is an 2-SuperHyperDefensive 2812

SuperHyperHamiltonian-Cycle-Neighbor; 2813

(ii) ∀a ∈ V \ S, |Ns (a) ∩ S| >b O−1

2 c + 1 if ESHG : (V, E) is a dual 2-SuperHyperDefensive 2814
SuperHyperHamiltonian-Cycle-Neighbor; 2815

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

SuperHyperHamiltonian-Cycle-Neighbor; 2817

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

SuperHyperHamiltonian-Cycle-Neighbor. 2819

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

SuperHyperGraph which is a SuperHyperComplete. Then following statements hold; 2821

(i) if ∀a ∈ S, |Ns (a) ∩ S| < b O−1 2 c + 1, then ESHG : (V, E) is an 2-SuperHyperDefensive 2822
SuperHyperHamiltonian-Cycle-Neighbor; 2823

(ii) if ∀a ∈ V \ S, |Ns (a) ∩ S| > b O−1 2 c + 1, then ESHG : (V, E) is a dual 2- 2824
SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 2825

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

SuperHyperHamiltonian-Cycle-Neighbor; 2827

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

SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor. 2829

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

SuperHyperGraph which is SuperHyperHamiltonian-Cycle-Neighbor. Then following statements hold; 2831

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

SuperHyperHamiltonian-Cycle-Neighbor; 2833

Henry Garrett · 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 2834

SuperHyperHamiltonian-Cycle-Neighbor; 2835

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

SuperHyperHamiltonian-Cycle-Neighbor; 2837

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

SuperHyperHamiltonian-Cycle-Neighbor. 2839

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

SuperHyperGraph which is SuperHyperHamiltonian-Cycle-Neighbor. Then following statements hold; 2841

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

SuperHyperHamiltonian-Cycle-Neighbor; 2843

(ii) if ∀a ∈ V \ S, |Ns (a) ∩ S| > 2, then ESHG : (V, E) is a dual 2-SuperHyperDefensive 2844
SuperHyperHamiltonian-Cycle-Neighbor; 2845

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

SuperHyperHamiltonian-Cycle-Neighbor; 2847

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

SuperHyperHamiltonian-Cycle-Neighbor. 2849

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 CHAPTER 13 2850

Extreme Applications in Cancer’s 2851

Extreme Recognition 2852

The cancer is the Extreme disease but the Extreme model is going to figure out what’s going on 2853
this Extreme phenomenon. The special Extreme case of this Extreme disease is considered and 2854
as the consequences of the model, some parameters are used. The cells are under attack of this 2855

disease but the moves of the cancer in the special region are the matter of mind. The Extreme 2856
recognition of the cancer could help to find some Extreme treatments for this Extreme disease. 2857
In the following, some Extreme steps are Extreme devised on this disease. 2858

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

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

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

Step 3. (Extreme Model) There are some specific Extreme models, which are well-known 2868
and they’ve got the names, and some general Extreme models. The moves and the 2869
Extreme traces of the cancer on the complex tracks and between complicated groups 2870
of cells could be fantasized by an Extreme SuperHyperPath(-/SuperHyperHamiltonian-Cycle- 2871
Neighbor, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). 2872
The aim is to find either the Extreme SuperHyperHamiltonian-Cycle-Neighbor or the Extreme 2873

SuperHyperHamiltonian-Cycle-Neighbor in those Extreme Extreme SuperHyperModels. 2874

135
 CHAPTER 14 2875

Case 1: The Initial Extreme Steps 2876

Toward Extreme SuperHyperBipartite 2877

as Extreme SuperHyperModel 2878

Step 4. (Extreme Solution) In the Extreme Figure (34.1), the Extreme SuperHyperBipartite 2879
is Extreme highlighted and Extreme featured. 2880

By using the Extreme Figure (34.1) and the Table (34.1), the Extreme SuperHyperBipartite 2881
is obtained. 2882
The obtained Extreme SuperHyperSet, by the Extreme Algorithm in previous Extreme result, 2883

Figure 14.1: an Extreme SuperHyperBipartite Associated to the Notions of Extreme

SuperHyperHamiltonian-Cycle-Neighbor 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 : 2884

(V, E), in the Extreme SuperHyperModel (34.1), is the Extreme SuperHyperHamiltonian-Cycle- 2885
Neighbor. 2886

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 CHAPTER 15 2887

Case 2: The Increasing Extreme Steps 2888

Toward Extreme 2889

SuperHyperMultipartite as Extreme 2890

SuperHyperModel 2891

Step 4. (Extreme Solution) In the Extreme Figure (35.1), the Extreme SuperHyperMultipartite 2892
is Extreme highlighted and Extreme featured. 2893

By using the Extreme Figure (35.1) and the Table (35.1), the Extreme SuperHyperMulti- 2894
partite is obtained. 2895
The obtained Extreme SuperHyperSet, by the Extreme Algorithm in previous result, of the 2896

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

SuperHyperHamiltonian-Cycle-Neighbor 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 : 2897

(V, E), in the Extreme SuperHyperModel (35.1), is the Extreme SuperHyperHamiltonian-Cycle- 2898
Neighbor. 2899

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 CHAPTER 16 2900

Wondering Open Problems But As The 2901

Directions To Forming The Motivations 2902

In what follows, some “problems” and some “questions” are proposed. 2903
The SuperHyperHamiltonian-Cycle-Neighbor and the Extreme SuperHyperHamiltonian-Cycle-Neighbor are 2904
defined on a real-world application, titled “Cancer’s Recognitions”. 2905

Question 16.0.1. Which the else SuperHyperModels could be defined based on Cancer’s 2906
recognitions? 2907

Question 16.0.2. Are there some SuperHyperNotions related to SuperHyperHamiltonian-Cycle-Neighbor 2908

and the Extreme SuperHyperHamiltonian-Cycle-Neighbor? 2909

Question 16.0.3. Are there some Algorithms to be defined on the SuperHyperModels to compute 2910
them? 2911

Question 16.0.4. Which the SuperHyperNotions are related to beyond the SuperHyperHamiltonian- 2912
and the Extreme SuperHyperHamiltonian-Cycle-Neighbor?
Cycle-Neighbor 2913

Problem 16.0.5. The SuperHyperHamiltonian-Cycle-Neighbor and the Extreme SuperHyperHamiltonian- 2914

do a SuperHyperModel for the Cancer’s recognitions and they’re based on
Cycle-Neighbor 2915
SuperHyperHamiltonian-Cycle-Neighbor, are there else? 2916

Problem 16.0.6. Which the fundamental SuperHyperNumbers are related to these SuperHyper- 2917
Numbers types-results? 2918

Problem 16.0.7. What’s the independent research based on Cancer’s recognitions concerning 2919
the multiple types of SuperHyperNotions? 2920

141
 CHAPTER 17 2921

Conclusion and Closing Remarks 2922

In this section, concluding remarks and closing remarks are represented. The drawbacks of this 2923

research are illustrated. Some benefits and some advantages of this research are highlighted. 2924
This research uses some approaches to make Extreme SuperHyperGraphs more understandable. 2925
In this endeavor, two SuperHyperNotions are defined on the SuperHyperHamiltonian-Cycle-Neighbor. 2926
For that sake in the second definition, the main definition of the Extreme SuperHyperGraph 2927
is redefined on the position of the alphabets. Based on the new definition for the Extreme 2928
SuperHyperGraph, the new SuperHyperNotion, Extreme SuperHyperHamiltonian-Cycle-Neighbor, finds 2929

the convenient background to implement some results based on that. Some SuperHyperClasses 2930
and some Extreme SuperHyperClasses are the cases of this research on the modeling of the 2931
regions where are under the attacks of the cancer to recognize this disease as it’s mentioned 2932
on the title “Cancer’s Recognitions”. To formalize the instances on the SuperHyperNotion, 2933
SuperHyperHamiltonian-Cycle-Neighbor, the new SuperHyperClasses and SuperHyperClasses, are 2934
introduced. Some general results are gathered in the section on the SuperHyperHamiltonian-Cycle- 2935

Neighbor and the Extreme SuperHyperHamiltonian-Cycle-Neighbor. The clarifications, instances and 2936
literature reviews have taken the whole way through. In this research, the literature reviews 2937
have fulfilled the lines containing the notions and the results. The SuperHyperGraph and 2938
Extreme SuperHyperGraph are the SuperHyperModels on the “Cancer’s Recognitions” and both 2939
bases are the background of this research. Sometimes the cancer has been happened on the 2940
region, full of cells, groups of cells and embedded styles. In this segment, the SuperHyperModel 2941

proposes some SuperHyperNotions based on the connectivities of the moves of the cancer in the 2942
longest and strongest styles with the formation of the design and the architecture are formally 2943
called “ SuperHyperHamiltonian-Cycle-Neighbor” in the themes of jargons and buzzwords. The prefix 2944
“SuperHyper” refers to the theme of the embedded styles to figure out the background for the 2945
SuperHyperNotions. In the Table (37.1), benefits and avenues for this research are, figured out, 2946
pointed out and spoken out. 2947

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

3. Extreme SuperHyperHamiltonian-Cycle-Neighbor 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 2948

Extreme SuperHyperDuality But As The 2949

Extensions Excerpt From Dense And 2950

Super Forms 2951

Definition 18.0.1. (Different Extreme Types of Extreme SuperHyperDuality). 2952

Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider an Extreme 2953
SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and E 0 = {E1 , E2 , . . . , Ez }. Then either V 0 or E 0 is called 2954

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

Va ∈ Ei , Ej ; 2956

(ii) Extreme re-SuperHyperDuality if ∀Ei ∈ E 0 , ∃Ej ∈ EESHG:(V,E) \ E 0 such that 2957

Va ∈ Ei , Ej and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 2958

(iii) Extreme v-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 2959

Vi , Vj ∈ Ea ; 2960

(iv) Extreme rv-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 2961

Vi , Vj ∈ Ea and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; 2962

(v) Extreme SuperHyperDuality if it’s either of Extreme e-SuperHyperDuality, 2963

Extreme re-SuperHyperDuality, Extreme v-SuperHyperDuality, and Extreme rv- 2964

SuperHyperDuality. 2965

Definition 18.0.2. ((Extreme) SuperHyperDuality). 2966

Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider an Extreme 2967
SuperHyperEdge (NSHE) E = {V1 , V2 , . . . , Vs }. Then E is called 2968

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

Extreme re-SuperHyperDuality, Extreme v-SuperHyperDuality, and Extreme rv- 2970
SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 2971
is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Extreme 2972
cardinality of the Extreme SuperHyperEdges in the conseNeighborive Extreme sequence 2973
of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 2974

Extreme SuperHyperDuality; 2975

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 2976

re-SuperHyperDuality, Extreme v-SuperHyperDuality, and Extreme rv-SuperHyperDuality 2977
and C(N SHG) for a Extreme SuperHyperGraph N SHG : (V, E) is the maximum 2978
Extreme cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S 2979
of high Extreme cardinality conseNeighborive Extreme SuperHyperEdges and Extreme 2980
SuperHyperVertices such that they form the Extreme SuperHyperDuality; 2981

(iii) an Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of Extreme 2982

e-SuperHyperDuality, Extreme re-SuperHyperDuality, Extreme v-SuperHyperDuality, 2983

and Extreme rv-SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph 2984
N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients 2985
defined as the Extreme number of the maximum Extreme cardinality of the Extreme 2986
SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme cardinality conseNeigh- 2987
borive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form 2988
the Extreme SuperHyperDuality; and the Extreme power is corresponded to its Extreme 2989

coefficient; 2990

(iv) a Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of Extreme 2991

e-SuperHyperDuality, Extreme re-SuperHyperDuality, Extreme v-SuperHyperDuality, 2992

and Extreme rv-SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph 2993
N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients 2994
defined as the Extreme number of the maximum Extreme cardinality of the Extreme 2995
SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme cardinality conseNeigh- 2996
borive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form 2997
the Extreme SuperHyperDuality; and the Extreme power is corresponded to its Extreme 2998

coefficient; 2999

(v) an Extreme R-SuperHyperDuality if it’s either of Extreme e-SuperHyperDuality, 3000

Extreme re-SuperHyperDuality, Extreme v-SuperHyperDuality, and Extreme rv- 3001

SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3002
is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Extreme 3003
cardinality of the Extreme SuperHyperVertices in the conseNeighborive Extreme sequence 3004
of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 3005
Extreme SuperHyperDuality; 3006

(vi) a Extreme R-SuperHyperDuality if it’s either of Extreme e-SuperHyperDuality, 3007

Extreme re-SuperHyperDuality, Extreme v-SuperHyperDuality, and Extreme rv- 3008
SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is 3009

the maximum Extreme cardinality of the Extreme SuperHyperVertices of an Extreme Su- 3010
perHyperSet S of high Extreme cardinality conseNeighborive Extreme SuperHyperEdges 3011
and Extreme SuperHyperVertices such that they form the Extreme SuperHyperDuality; 3012

(vii) an Extreme R-SuperHyperDuality SuperHyperPolynomial if it’s either 3013

of Extreme e-SuperHyperDuality, Extreme re-SuperHyperDuality, Extreme v- 3014
SuperHyperDuality, and Extreme rv-SuperHyperDuality and C(N SHG) for an Extreme 3015
SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the 3016
Extreme coefficients defined as the Extreme number of the maximum Extreme cardinality 3017

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

Henry Garrett · 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- 3019

tices such that they form the Extreme SuperHyperDuality; and the Extreme power is 3020
corresponded to its Extreme coefficient; 3021

(viii) a Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of Extreme 3022

e-SuperHyperDuality, Extreme re-SuperHyperDuality, Extreme v-SuperHyperDuality, 3023

and Extreme rv-SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph 3024
N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients 3025
defined as the Extreme number of the maximum Extreme cardinality of the Extreme 3026
SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality 3027
conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVertices such 3028

that they form the Extreme SuperHyperDuality; and the Extreme power is corresponded 3029
to its Extreme coefficient. 3030

136EXM1 Example 18.0.3. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E) in the 3031
mentioned Extreme Figures in every Extreme items. 3032

• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperDu- 3033
ality, is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are some 3034
empty Extreme SuperHyperEdges but E2 is a loop Extreme SuperHyperEdge and E4 is 3035
an Extreme SuperHyperEdge. Thus in the terms of Extreme SuperHyperNeighbor, there’s 3036
only one Extreme SuperHyperEdge, namely, E4 . The Extreme SuperHyperVertex, V3 is 3037

Extreme isolated means that there’s no Extreme SuperHyperEdge has it as an Extreme 3038
endpoint. Thus the Extreme SuperHyperVertex, V3 , is excluded in every given Extreme 3039
SuperHyperDuality. 3040

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- 3041
Duality, is up. The Extreme Algorithm is Extremely straightforward. E1 , E2 and E3 3042
are some empty Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. 3043

Thus in the terms of Extreme SuperHyperNeighbor, there’s only one Extreme SuperHy- 3044
perEdge, namely, E4 . The Extreme SuperHyperVertex, V3 is Extreme isolated means that 3045
there’s no Extreme SuperHyperEdge has it as an Extreme endpoint. Thus the Extreme 3046
SuperHyperVertex, V3 , is excluded in every given Extreme SuperHyperDuality. 3047

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- 3048
ality, is up. The Extreme Algorithm is Extremely straightforward. 3049

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- 3050
ality, is up. The Extreme Algorithm is Extremely straightforward. 3051

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- 3052
ality, is up. The Extreme Algorithm is Extremely straightforward. 3053

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- 3054
ality, is up. The Extreme Algorithm is Extremely straightforward. 3055

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

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

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

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

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- 3060
ality, is up. The Extreme Algorithm is Extremely straightforward. 3061

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- 3062
ality, is up. The Extreme Algorithm is Extremely straightforward. 3063

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- 3064
ality, is up. The Extreme Algorithm is Extremely straightforward. 3065

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- 3066
ality, is up. The Extreme Algorithm is Extremely straightforward. 3067

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- 3068
ality, is up. The Extreme Algorithm is Extremely straightforward. 3069

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- 3070
ality, is up. The Extreme Algorithm is Extremely straightforward. 3071

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- 3072
ality, is up. The Extreme Algorithm is Extremely straightforward. 3073

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- 3074
ality, is up. The Extreme Algorithm is Extremely straightforward. 3075

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- 3076
ality, is up. The Extreme Algorithm is Extremely straightforward. 3077

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- 3078
ality, is up. The Extreme Algorithm is Extremely straightforward. 3079

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- 3080
ality, is up. The Extreme Algorithm is Extremely straightforward. 3081

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- 3082
ality, is up. The Extreme Algorithm is Extremely straightforward. 3083

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

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

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- 3086
ality, is up. The Extreme Algorithm is Extremely straightforward. 3087

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 3088

SuperHyperClasses. 3089

Henry Garrett · 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 3090

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 3091

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 3092
new way to redefine as 3093

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 3094
ViEXT ERN AL in the literatures of SuperHyperDuality. The latter is straightforward.  3095

136EXM18a Example 18.0.5. In the Figure (31.1), the connected Extreme SuperHyperPath ESHP : (V, E), 3096
is highlighted and featured. The Extreme SuperHyperSet, in the Extreme SuperHyperModel 3097
(31.1), is the SuperHyperDuality. 3098

Proposition 18.0.6. Assume a connected Extreme SuperHyperCycle ESHC : (V, E). Then 3099

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 3100

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 3101

new way to redefine as 3102

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 3103
ViEXT ERN AL in the literatures of SuperHyperDuality. The latter is straightforward.  3104

136EXM19a Example 18.0.7. In the Figure (31.2), the connected Extreme SuperHyperCycle N SHC : 3105
(V, E), is highlighted and featured. The obtained Extreme SuperHyperSet, in the Extreme 3106
SuperHyperModel (31.2), is the Extreme SuperHyperDuality. 3107

Proposition 18.0.8. Assume a connected Extreme SuperHyperStar ESHS : (V, E). Then 3108

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 3109

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 3110
way to redefine as 3111

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 3112

ViEXT ERN AL in the literatures of SuperHyperDuality. The latter is straightforward.  3113

Henry Garrett · 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), 3114
is highlighted and featured. The obtained Extreme SuperHyperSet, by the Algorithm in previous 3115
Extreme result, of the Extreme SuperHyperVertices of the connected Extreme SuperHyperStar 3116
ESHS : (V, E), in the Extreme SuperHyperModel (31.3), is the Extreme SuperHyperDuality. 3117

Proposition 18.0.10. Assume a connected Extreme SuperHyperBipartite ESHB : (V, E). Then 3118

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 3119

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 3120
a new way to redefine as 3121

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 3122
to ViEXT ERN AL in the literatures of SuperHyperDuality. The latter is straightforward. 3123
Then there’s at least one SuperHyperDuality. Thus the notion of quasi isn’t up and the 3124

SuperHyperNotions based on SuperHyperDuality could be applied. There are only two 3125
SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as the 3126
representative in the 3127

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

(V, E). Thus only some SuperHyperVertices and only minimum-Extreme-of-SuperHyperPart 3129

SuperHyperEdges are attained in any solution 3130

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

136EXM21a Example 18.0.11. In the Extreme Figure (31.4), the connected Extreme SuperHyperBipartite 3132

ESHB : (V, E), is Extreme highlighted and Extreme featured. The obtained Extreme 3133
SuperHyperSet, by the Extreme Algorithm in previous Extreme result, of the Extreme 3134
SuperHyperVertices of the connected Extreme SuperHyperBipartite ESHB : (V, E), in the 3135
Extreme SuperHyperModel (31.4), is the Extreme SuperHyperDuality. 3136

Proposition 18.0.12. Assume a connected Extreme SuperHyperMultipartite ESHM : (V, E). 3137
Then 3138

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 3139

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 3140

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

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 3142
to ViEXT ERN AL in the literatures of SuperHyperDuality. The latter is straightforward. 3143
Then there’s at least one SuperHyperDuality. Thus the notion of quasi isn’t up and 3144
the SuperHyperNotions based on SuperHyperDuality could be applied. There are only z 0 3145

SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as the 3146
representative in the 3147

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

(V, E). Thus only some SuperHyperVertices and only minimum-Extreme-of-SuperHyperPart 3149
SuperHyperEdges are attained in any solution 3150

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). 3151
The latter is straightforward.  3152

136EXM22a Example 18.0.13. In the Figure (31.5), the connected Extreme SuperHyperMultipartite 3153
ESHM : (V, E), is highlighted and Extreme featured. The obtained Extreme SuperHyperSet, by 3154

the Algorithm in previous Extreme result, of the Extreme SuperHyperVertices of the connected 3155
Extreme SuperHyperMultipartite ESHM : (V, E), in the Extreme SuperHyperModel (31.5), is 3156
the Extreme SuperHyperDuality. 3157

Proposition 18.0.14. Assume a connected Extreme SuperHyperWheel ESHW : (V, E). Then, 3158

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 3159

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

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

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 3162

to ViEXT ERN AL in the literatures of SuperHyperDuality. The latter is straightforward. 3163

Then there’s at least one SuperHyperDuality. Thus the notion of quasi isn’t up and the 3164
SuperHyperNotions based on SuperHyperDuality could be applied. The unique embedded 3165
SuperHyperDuality proposes some longest SuperHyperDuality excerpt from some representatives. 3166
The latter is straightforward.  3167

136EXM23a Example 18.0.15. In the Extreme Figure (31.6), the connected Extreme SuperHyperWheel 3168
N SHW : (V, E), is Extreme highlighted and featured. The obtained Extreme SuperHyperSet, 3169
by the Algorithm in previous result, of the Extreme SuperHyperVertices of the connected 3170

Extreme SuperHyperWheel ESHW : (V, E), in the Extreme SuperHyperModel (31.6), is the 3171
Extreme SuperHyperDuality. 3172

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 CHAPTER 19 3173

Extreme SuperHyperJoin But As The 3174

Extensions Excerpt From Dense And 3175

Super Forms 3176

Definition 19.0.1. (Different Extreme Types of Extreme SuperHyperJoin). 3177

Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider an Extreme 3178
SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and E 0 = {E1 , E2 , . . . , Ez }. Then either V 0 or E 0 is called 3179

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

Va ∈ Ei , Ej ; and ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; 3181

(ii) Extreme re-SuperHyperJoin if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such that 3182

Va ∈ Ei , Ej ; ∀Ei , Ej ∈ E 0 , such that Va ∈

6 Ei , Ej ; and |Ei |NEUTROSOPIC CARDINALITY = 3183
|Ej |NEUTROSOPIC CARDINALITY ; 3184

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

Vi , Vj 6∈ Ea ; and ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; 3186

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

Vi , Vj ∈ Ea ; ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; and |Vi |NEUTROSOPIC CARDINALITY = 3188
|Vj |NEUTROSOPIC CARDINALITY ; 3189

(v) Extreme SuperHyperJoin if it’s either of Extreme e-SuperHyperJoin, Extreme re- 3190
SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme rv-SuperHyperJoin. 3191

Definition 19.0.2. ((Extreme) SuperHyperJoin). 3192

Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider an Extreme 3193

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

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

re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme rv-SuperHyperJoin and 3196
C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme 3197
cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme 3198
SuperHyperEdges in the conseNeighborive Extreme sequence of Extreme SuperHyperEdges 3199

and Extreme SuperHyperVertices such that they form the Extreme SuperHyperJoin; 3200

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 3201

re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme rv-SuperHyperJoin and 3202
C(N SHG) for a Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme 3203
cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of 3204
high Extreme cardinality conseNeighborive Extreme SuperHyperEdges and Extreme 3205
SuperHyperVertices such that they form the Extreme SuperHyperJoin; 3206

(iii) an Extreme SuperHyperJoin SuperHyperPolynomial if it’s either of Extreme e- 3207

SuperHyperJoin, Extreme re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme 3208

rv-SuperHyperJoin and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3209
is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined as the 3210
Extreme number of the maximum Extreme cardinality of the Extreme SuperHyperEdges 3211
of an Extreme SuperHyperSet S of high Extreme cardinality conseNeighborive Extreme 3212
SuperHyperEdges and Extreme SuperHyperVertices such that they form the Extreme 3213
SuperHyperJoin; and the Extreme power is corresponded to its Extreme coefficient; 3214

(iv) a Extreme SuperHyperJoin SuperHyperPolynomial if it’s either of Extreme e- 3215

SuperHyperJoin, Extreme re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme 3216
rv-SuperHyperJoin and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3217

is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined as the 3218
Extreme number of the maximum Extreme cardinality of the Extreme SuperHyperEdges 3219
of an Extreme SuperHyperSet S of high Extreme cardinality conseNeighborive Extreme 3220
SuperHyperEdges and Extreme SuperHyperVertices such that they form the Extreme 3221
SuperHyperJoin; and the Extreme power is corresponded to its Extreme coefficient; 3222

(v) an Extreme R-SuperHyperJoin if it’s either of Extreme e-SuperHyperJoin, Extreme 3223

re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme rv-SuperHyperJoin and 3224
C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme 3225

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

Extreme SuperHyperVertices in the conseNeighborive Extreme sequence of Extreme 3227
SuperHyperEdges and Extreme SuperHyperVertices such that they form the Extreme 3228
SuperHyperJoin; 3229

(vi) a Extreme R-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 an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme 3232
cardinality of the Extreme SuperHyperVertices 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

(vii) an Extreme R-SuperHyperJoin SuperHyperPolynomial if it’s either of Extreme 3236

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

Henry Garrett · 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- 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 SuperHyperVertices 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

136EXM1 Example 19.0.3. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E) in the 3252
mentioned Extreme Figures in every Extreme items. 3253

• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperJoin, 3254
is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are some empty 3255
Extreme SuperHyperEdges but E2 is a loop Extreme SuperHyperEdge and E4 is an 3256
Extreme SuperHyperEdge. Thus in the terms of Extreme SuperHyperNeighbor, there’s 3257

only one Extreme SuperHyperEdge, namely, E4 . The Extreme SuperHyperVertex, V3 is 3258

Extreme isolated means that there’s no Extreme SuperHyperEdge has it as an Extreme 3259
endpoint. Thus the Extreme SuperHyperVertex, V3 , is excluded in every given Extreme 3260
SuperHyperJoin. 3261

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, 3262
is up. The Extreme Algorithm is Extremely straightforward. E1 , E2 and E3 are some empty 3263
Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. Thus in the terms of 3264
Extreme SuperHyperNeighbor, there’s only one Extreme SuperHyperEdge, namely, E4 . 3265
The Extreme SuperHyperVertex, V3 is Extreme isolated means that there’s no Extreme 3266
SuperHyperEdge has it as an Extreme endpoint. Thus the Extreme SuperHyperVertex, 3267

V3 , is excluded in every given Extreme SuperHyperJoin. 3268

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, 3269
is up. The Extreme Algorithm is Extremely straightforward. 3270

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, 3271
is up. The Extreme Algorithm is Extremely straightforward. 3272

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, 3273
is up. The Extreme Algorithm is Extremely straightforward. 3274

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, 3275
is up. The Extreme Algorithm is Extremely straightforward. 3276

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, 3277
is up. The Extreme Algorithm is Extremely straightforward. 3278

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, 3279
is up. The Extreme Algorithm is Extremely straightforward. 3280

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, 3281
is up. The Extreme Algorithm is Extremely straightforward. 3282

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, 3283
is up. The Extreme Algorithm is Extremely straightforward. 3284

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, 3285
is up. The Extreme Algorithm is Extremely straightforward. 3286

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

is up. The Extreme Algorithm is Extremely straightforward. 3288

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, 3289
is up. The Extreme Algorithm is Extremely straightforward. 3290

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, 3291
is up. The Extreme Algorithm is Extremely straightforward. 3292

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, 3293
is up. The Extreme Algorithm is Extremely straightforward. 3294

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, 3295
is up. The Extreme Algorithm is Extremely straightforward. 3296

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, 3297
is up. The Extreme Algorithm is Extremely straightforward. 3298

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, 3299
is up. The Extreme Algorithm is Extremely straightforward. 3300

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, 3301
is up. The Extreme Algorithm is Extremely straightforward. 3302

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, 3303
is up. The Extreme Algorithm is Extremely straightforward. 3304

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, 3305
is up. The Extreme Algorithm is Extremely straightforward. 3306

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, 3307
is up. The Extreme Algorithm is Extremely straightforward. 3308

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 3309
SuperHyperClasses. 3310

Henry Garrett · 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 3311

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 3312

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 3313
new way to redefine as 3314

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 3315
ViEXT ERN AL in the literatures of SuperHyperJoin. The latter is straightforward.  3316

136EXM18a Example 19.0.5. In the Figure (31.1), the connected Extreme SuperHyperPath ESHP : (V, E), 3317
is highlighted and featured. The Extreme SuperHyperSet, in the Extreme SuperHyperModel 3318
(31.1), is the SuperHyperJoin. 3319

Proposition 19.0.6. Assume a connected Extreme SuperHyperCycle ESHC : (V, E). Then 3320

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 3321

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 3322

new way to redefine as 3323

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 3324
ViEXT ERN AL in the literatures of SuperHyperJoin. The latter is straightforward.  3325

136EXM19a Example 19.0.7. In the Figure (31.2), the connected Extreme SuperHyperCycle N SHC : 3326
(V, E), is highlighted and featured. The obtained Extreme SuperHyperSet, in the Extreme 3327
SuperHyperModel (31.2), is the Extreme SuperHyperJoin. 3328

Proposition 19.0.8. Assume a connected Extreme SuperHyperStar ESHS : (V, E). Then 3329

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 3330

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 3331
way to redefine as 3332

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 3333

ViEXT ERN AL in the literatures of SuperHyperJoin. The latter is straightforward.  3334

Henry Garrett · 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), 3335
is highlighted and featured. The obtained Extreme SuperHyperSet, by the Algorithm in previous 3336
Extreme result, of the Extreme SuperHyperVertices of the connected Extreme SuperHyperStar 3337
ESHS : (V, E), in the Extreme SuperHyperModel (31.3), is the Extreme SuperHyperJoin. 3338

Proposition 19.0.10. Assume a connected Extreme SuperHyperBipartite ESHB : (V, E). Then 3339

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 3340

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 3341

Henry Garrett · 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 3342

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 3343
ViEXT ERN AL in the literatures of SuperHyperJoin. The latter is straightforward. Then there’s 3344
no at least one SuperHyperJoin. Thus the notion of quasi may be up but the SuperHyperNotions 3345

based on SuperHyperJoin could be applied. There are only two SuperHyperParts. Thus every 3346
SuperHyperPart could have one SuperHyperVertex as the representative in the 3347

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

(V, E). Thus only some SuperHyperVertices and only minimum-Extreme-of-SuperHyperPart 3349
SuperHyperEdges are attained in any solution 3350

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

136EXM21a Example 19.0.11. In the Extreme Figure (31.4), the connected Extreme SuperHyperBipartite 3352
ESHB : (V, E), is Extreme highlighted and Extreme featured. The obtained Extreme 3353
SuperHyperSet, by the Extreme Algorithm in previous Extreme result, of the Extreme 3354
SuperHyperVertices of the connected Extreme SuperHyperBipartite ESHB : (V, E), in the 3355

Extreme SuperHyperModel (31.4), is the Extreme SuperHyperJoin. 3356

Proposition 19.0.12. Assume a connected Extreme SuperHyperMultipartite ESHM : (V, E). 3357
Then 3358

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 3359

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

(V, E). There’s a new 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. Then there’s 3363

no at least one SuperHyperJoin. Thus the notion of quasi may be up but the SuperHyperNotions 3364
based on SuperHyperJoin could be applied. There are only z 0 SuperHyperParts. Thus every 3365
SuperHyperPart could have one SuperHyperVertex as the representative in the 3366

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

(V, E). Thus only some SuperHyperVertices and only minimum-Extreme-of-SuperHyperPart 3368
SuperHyperEdges are attained in any solution 3369

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). 3370
The latter is straightforward.  3371

136EXM22a Example 19.0.13. In the Figure (31.5), the connected Extreme SuperHyperMultipartite 3372
ESHM : (V, E), is highlighted and Extreme featured. The obtained Extreme SuperHyperSet, by 3373

the Algorithm in previous Extreme result, of the Extreme SuperHyperVertices of the connected 3374
Extreme SuperHyperMultipartite ESHM : (V, E), in the Extreme SuperHyperModel (31.5), is 3375
the Extreme SuperHyperJoin. 3376

Proposition 19.0.14. Assume a connected Extreme SuperHyperWheel ESHW : (V, E). Then, 3377

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 3378

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). 3379
There’s a new way to redefine as 3380

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 3381
ViEXT ERN AL in the literatures of SuperHyperJoin. The latter is straightforward. Then there’s 3382

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

136EXM23a Example 19.0.15. In the Extreme Figure (31.6), the connected Extreme SuperHyperWheel 3386
N SHW : (V, E), is Extreme highlighted and featured. The obtained Extreme SuperHyperSet, 3387
by the Algorithm in previous result, of the Extreme SuperHyperVertices of the connected 3388
Extreme SuperHyperWheel ESHW : (V, E), in the Extreme SuperHyperModel (31.6), is the 3389
Extreme SuperHyperJoin. 3390

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 CHAPTER 20 3391

Extreme SuperHyperPerfect But As The 3392

Extensions Excerpt From Dense And 3393

Super Forms 3394

Definition 20.0.1. (Different Extreme Types of Extreme SuperHyperPerfect). 3395

Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider an Extreme 3396

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

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

Va ∈ Ei , Ej ; 3399

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

Va ∈ Ei , Ej ; and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 3401

(iii) Extreme v-SuperHyperPerfect if ∀Vi ∈ VESHG:(V,E) \ V 0 , ∃!Vj ∈ V 0 , such that 3402

Vi , Vj ∈ Ea ; 3403

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

Vi , Vj ∈ Ea ; and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; 3405

(v) Extreme SuperHyperPerfect if it’s either of Extreme e-SuperHyperPerfect, Extreme 3406

re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, and Extreme rv-SuperHyperPerfect. 3407

Definition 20.0.2. ((Extreme) SuperHyperPerfect). 3408

Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider an Extreme 3409

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

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

Extreme re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, and Extreme rv- 3412
SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3413
is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Extreme 3414
cardinality of the Extreme SuperHyperEdges in the conseNeighborive Extreme sequence 3415
of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 3416

Extreme SuperHyperPerfect; 3417

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 3418

re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, and Extreme rv-SuperHyperPerfect 3419
and C(N SHG) for a Extreme SuperHyperGraph N SHG : (V, E) is the maximum 3420
Extreme cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S 3421
of high Extreme cardinality conseNeighborive Extreme SuperHyperEdges and Extreme 3422
SuperHyperVertices such that they form the Extreme SuperHyperPerfect; 3423

(iii) an Extreme SuperHyperPerfect SuperHyperPolynomial if it’s either of Extreme 3424

e-SuperHyperPerfect, Extreme re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, 3425

and Extreme rv-SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph 3426
N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients 3427
defined as the Extreme number of the maximum Extreme cardinality of the Extreme 3428
SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme cardinality conseNeigh- 3429
borive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form 3430
the Extreme SuperHyperPerfect; and the Extreme power is corresponded to its Extreme 3431

coefficient; 3432

(iv) a Extreme SuperHyperPerfect SuperHyperPolynomial if it’s either of Extreme 3433

e-SuperHyperPerfect, Extreme re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, 3434

and Extreme rv-SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph 3435
N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients 3436
defined as the Extreme number of the maximum Extreme cardinality of the Extreme 3437
SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme cardinality conseNeigh- 3438
borive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form 3439
the Extreme SuperHyperPerfect; and the Extreme power is corresponded to its Extreme 3440

coefficient; 3441

(v) an Extreme R-SuperHyperPerfect if it’s either of Extreme e-SuperHyperPerfect, 3442

Extreme re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, and Extreme rv- 3443

SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3444
is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Extreme 3445
cardinality of the Extreme SuperHyperVertices in the conseNeighborive Extreme sequence 3446
of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 3447
Extreme SuperHyperPerfect; 3448

(vi) a Extreme R-SuperHyperPerfect if it’s either of Extreme e-SuperHyperPerfect, 3449

Extreme re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, and Extreme rv- 3450
SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is 3451

the maximum Extreme cardinality of the Extreme SuperHyperVertices of an Extreme Su- 3452
perHyperSet S of high Extreme cardinality conseNeighborive Extreme SuperHyperEdges 3453
and Extreme SuperHyperVertices such that they form the Extreme SuperHyperPerfect; 3454

(vii) an Extreme R-SuperHyperPerfect SuperHyperPolynomial if it’s either 3455

of Extreme e-SuperHyperPerfect, Extreme re-SuperHyperPerfect, Extreme v- 3456
SuperHyperPerfect, and Extreme rv-SuperHyperPerfect and C(N SHG) for an Extreme 3457
SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the 3458
Extreme coefficients defined as the Extreme number of the maximum Extreme cardinality 3459

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

Henry Garrett · 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- 3461

tices such that they form the Extreme SuperHyperPerfect; and the Extreme power is 3462
corresponded to its Extreme coefficient; 3463

(viii) a Extreme SuperHyperPerfect SuperHyperPolynomial if it’s either of Extreme 3464

e-SuperHyperPerfect, Extreme re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, 3465

and Extreme rv-SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph 3466
N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients 3467
defined as the Extreme number of the maximum Extreme cardinality of the Extreme 3468
SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality 3469
conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVertices such 3470

that they form the Extreme SuperHyperPerfect; and the Extreme power is corresponded 3471
to its Extreme coefficient. 3472

136EXM1 Example 20.0.3. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E) in the 3473
mentioned Extreme Figures in every Extreme items. 3474

• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperPer- 3475
fect, is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are some 3476
empty Extreme SuperHyperEdges but E2 is a loop Extreme SuperHyperEdge and E4 is 3477
an Extreme SuperHyperEdge. Thus in the terms of Extreme SuperHyperNeighbor, there’s 3478
only one Extreme SuperHyperEdge, namely, E4 . The Extreme SuperHyperVertex, V3 is 3479

Extreme isolated means that there’s no Extreme SuperHyperEdge has it as an Extreme 3480
endpoint. Thus the Extreme SuperHyperVertex, V3 , is excluded in every given Extreme 3481
SuperHyperPerfect. 3482

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- 3483
Perfect, is up. The Extreme Algorithm is Extremely straightforward. E1 , E2 and E3 3484
are some empty Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. 3485

Thus in the terms of Extreme SuperHyperNeighbor, there’s only one Extreme SuperHy- 3486
perEdge, namely, E4 . The Extreme SuperHyperVertex, V3 is Extreme isolated means that 3487
there’s no Extreme SuperHyperEdge has it as an Extreme endpoint. Thus the Extreme 3488
SuperHyperVertex, V3 , is excluded in every given Extreme SuperHyperPerfect. 3489

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- 3490
fect, is up. The Extreme Algorithm is Extremely straightforward. 3491

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- 3492
fect, is up. The Extreme Algorithm is Extremely straightforward. 3493

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- 3494
fect, is up. The Extreme Algorithm is Extremely straightforward. 3495

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- 3496
fect, is up. The Extreme Algorithm is Extremely straightforward. 3497

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

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

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

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

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- 3502
fect, is up. The Extreme Algorithm is Extremely straightforward. 3503

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- 3504
fect, is up. The Extreme Algorithm is Extremely straightforward. 3505

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- 3506
fect, is up. The Extreme Algorithm is Extremely straightforward. 3507

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- 3508
fect, is up. The Extreme Algorithm is Extremely straightforward. 3509

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- 3510
fect, is up. The Extreme Algorithm is Extremely straightforward. 3511

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- 3512
fect, is up. The Extreme Algorithm is Extremely straightforward. 3513

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- 3514
fect, is up. The Extreme Algorithm is Extremely straightforward. 3515

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- 3516
fect, is up. The Extreme Algorithm is Extremely straightforward. 3517

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- 3518
fect, is up. The Extreme Algorithm is Extremely straightforward. 3519

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- 3520
fect, is up. The Extreme Algorithm is Extremely straightforward. 3521

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- 3522
fect, is up. The Extreme Algorithm is Extremely straightforward. 3523

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- 3524
fect, is up. The Extreme Algorithm is Extremely straightforward. 3525

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

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

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- 3528
fect, is up. The Extreme Algorithm is Extremely straightforward. 3529

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 3530

SuperHyperClasses. 3531

Henry Garrett · 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 3532

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 3533

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 3534
new way to redefine as 3535

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 3536
ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is straightforward.  3537

136EXM18a Example 20.0.5. In the Figure (31.1), the connected Extreme SuperHyperPath ESHP : (V, E), 3538
is highlighted and featured. The Extreme SuperHyperSet, in the Extreme SuperHyperModel 3539
(31.1), is the SuperHyperPerfect. 3540

Proposition 20.0.6. Assume a connected Extreme SuperHyperCycle ESHC : (V, E). Then 3541

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 3542

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 3543

new way to redefine as 3544

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 3545
ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is straightforward.  3546

136EXM19a Example 20.0.7. In the Figure (31.2), the connected Extreme SuperHyperCycle N SHC : 3547
(V, E), is highlighted and featured. The obtained Extreme SuperHyperSet, in the Extreme 3548
SuperHyperModel (31.2), is the Extreme SuperHyperPerfect. 3549

Proposition 20.0.8. Assume a connected Extreme SuperHyperStar ESHS : (V, E). Then 3550

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 3551

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 3552
way to redefine as 3553

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 3554

ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is straightforward.  3555

Henry Garrett · 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), 3556
is highlighted and featured. The obtained Extreme SuperHyperSet, by the Algorithm in previous 3557
Extreme result, of the Extreme SuperHyperVertices of the connected Extreme SuperHyperStar 3558
ESHS : (V, E), in the Extreme SuperHyperModel (31.3), is the Extreme SuperHyperPerfect. 3559

Proposition 20.0.10. Assume a connected Extreme SuperHyperBipartite ESHB : (V, E). Then 3560

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 3561

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 3562

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

a new way to redefine as 3563

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 3564

ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is straightforward. Then 3565
there’s no at least one SuperHyperPerfect. Thus the notion of quasi may be up but the 3566
SuperHyperNotions based on SuperHyperPerfect could be applied. There are only two 3567
SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as the 3568
representative in the 3569

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

(V, E). Thus only some SuperHyperVertices and only minimum-Extreme-of-SuperHyperPart 3571
SuperHyperEdges are attained in any solution 3572

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

136EXM21a Example 20.0.11. In the Extreme Figure (31.4), the connected Extreme SuperHyperBipartite 3574
ESHB : (V, E), is Extreme highlighted and Extreme featured. The obtained Extreme 3575
SuperHyperSet, by the Extreme Algorithm in previous Extreme result, of the Extreme 3576
SuperHyperVertices of the connected Extreme SuperHyperBipartite ESHB : (V, E), in the 3577
Extreme SuperHyperModel (31.4), is the Extreme SuperHyperPerfect. 3578

Proposition 20.0.12. Assume a connected Extreme SuperHyperMultipartite ESHM : (V, E). 3579

Henry Garrett · 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 3580

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 3581

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 3582

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

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 3584
to ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is straightforward. 3585
Then there’s no at least one SuperHyperPerfect. Thus the notion of quasi may be up but 3586
the SuperHyperNotions based on SuperHyperPerfect could be applied. There are only z 0 3587
SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as the 3588
representative in the 3589

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

(V, E). Thus only some SuperHyperVertices and only minimum-Extreme-of-SuperHyperPart 3591
SuperHyperEdges are attained in any solution 3592

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). 3593
The latter is straightforward.  3594

136EXM22a Example 20.0.13. In the Figure (31.5), the connected Extreme SuperHyperMultipartite 3595
ESHM : (V, E), is highlighted and Extreme featured. The obtained Extreme SuperHyperSet, by 3596
the Algorithm in previous Extreme result, of the Extreme SuperHyperVertices of the connected 3597
Extreme SuperHyperMultipartite ESHM : (V, E), in the Extreme SuperHyperModel (31.5), is 3598

the Extreme SuperHyperPerfect. 3599

Proposition 20.0.14. Assume a connected Extreme SuperHyperWheel ESHW : (V, E). Then, 3600

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 3601

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

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

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 3604
ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is straightforward. Then there’s 3605

at least one SuperHyperPerfect. Thus the notion of quasi isn’t up and the SuperHyperNotions 3606
based on SuperHyperPerfect could be applied. The unique embedded SuperHyperPerfect 3607
proposes some longest SuperHyperPerfect excerpt from some representatives. The latter is 3608
straightforward.  3609

136EXM23a Example 20.0.15. In the Extreme Figure (31.6), the connected Extreme SuperHyperWheel 3610
N SHW : (V, E), is Extreme highlighted and featured. The obtained Extreme SuperHyperSet, 3611
by the Algorithm in previous result, of the Extreme SuperHyperVertices of the connected 3612
Extreme SuperHyperWheel ESHW : (V, E), in the Extreme SuperHyperModel (31.6), is the 3613
Extreme SuperHyperPerfect. 3614

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 CHAPTER 21 3615

Extreme SuperHyperTotal But As The 3616

Extensions Excerpt From Dense And 3617

Super Forms 3618

Definition 21.0.1. (Different Extreme Types of Extreme SuperHyperTotal). 3619

Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider an Extreme 3620
SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and E 0 = {E1 , E2 , . . . , Ez }. Then either V 0 or E 0 is called 3621

(i) Extreme e-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that Va ∈ Ei , Ej ; 3622

(ii) Extreme re-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that Va ∈ 3623

Ei , Ej ; and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 3624

(iii) Extreme v-SuperHyperTotal if ∀Vi ∈ VESHG:(V,E) , ∃!Vj ∈ V 0 , such that Vi , Vj ∈ Ea ; 3625

(iv) Extreme rv-SuperHyperTotal if ∀Vi ∈ VESHG:(V,E) , ∃!Vj ∈ V 0 , such that Vi , Vj ∈ Ea ; 3626

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

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

re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Extreme rv-SuperHyperTotal. 3629

Definition 21.0.2. ((Extreme) SuperHyperTotal). 3630

Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider an Extreme 3631
SuperHyperEdge (NSHE) E = {V1 , V2 , . . . , Vs }. Then E is called 3632

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

re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Extreme rv-SuperHyperTotal and 3634
C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme 3635
cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme 3636
SuperHyperEdges in the conseNeighborive Extreme sequence of Extreme SuperHyperEdges 3637

and Extreme SuperHyperVertices such that they form the Extreme SuperHyperTotal; 3638

(ii) a Extreme SuperHyperTotal if it’s either of Extreme e-SuperHyperTotal, Extreme 3639

re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Extreme rv-SuperHyperTotal 3640
and C(N SHG) for a Extreme SuperHyperGraph N SHG : (V, E) is the maximum 3641

Extreme cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S 3642

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

of high Extreme cardinality conseNeighborive Extreme SuperHyperEdges and Extreme 3643

SuperHyperVertices such that they form the Extreme SuperHyperTotal; 3644

(iii) an Extreme SuperHyperTotal SuperHyperPolynomial if it’s either of Extreme 3645

e-SuperHyperTotal, Extreme re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Ex- 3646
treme rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph N SHG : 3647
(V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined 3648
as the Extreme number of the maximum Extreme cardinality of the Extreme SuperHy- 3649
perEdges of an Extreme SuperHyperSet S of high Extreme cardinality conseNeighborive 3650

Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 3651
Extreme SuperHyperTotal; and the Extreme power is corresponded to its Extreme coeffi- 3652
cient; 3653

(iv) a Extreme SuperHyperTotal SuperHyperPolynomial if it’s either of Extreme e- 3654

SuperHyperTotal, Extreme re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Ex- 3655
treme rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph N SHG : 3656
(V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined 3657
as the Extreme number of the maximum Extreme cardinality of the Extreme SuperHy- 3658

perEdges of an Extreme SuperHyperSet S of high Extreme cardinality conseNeighborive 3659

Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 3660
Extreme SuperHyperTotal; and the Extreme power is corresponded to its Extreme coeffi- 3661
cient; 3662

(v) an Extreme R-SuperHyperTotal if it’s either of Extreme e-SuperHyperTotal, Extreme 3663

re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Extreme rv-SuperHyperTotal 3664
and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum 3665
Extreme cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of 3666
the Extreme SuperHyperVertices in the conseNeighborive Extreme sequence of Extreme 3667

SuperHyperEdges and Extreme SuperHyperVertices such that they form the Extreme 3668
SuperHyperTotal; 3669

(vi) a Extreme R-SuperHyperTotal if it’s either of Extreme e-SuperHyperTotal, Extreme 3670

re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Extreme rv-SuperHyperTotal 3671
and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum 3672
Extreme cardinality of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S 3673
of high Extreme cardinality conseNeighborive Extreme SuperHyperEdges and Extreme 3674
SuperHyperVertices such that they form the Extreme SuperHyperTotal; 3675

(vii) an Extreme R-SuperHyperTotal SuperHyperPolynomial if it’s either of Ex- 3676

treme e-SuperHyperTotal, Extreme re-SuperHyperTotal, Extreme v-SuperHyperTotal, 3677

and Extreme rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph 3678
N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients 3679
defined as the Extreme number of the maximum Extreme cardinality of the Extreme 3680
SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality con- 3681
seNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that 3682
they form the Extreme SuperHyperTotal; and the Extreme power is corresponded to its 3683

Extreme coefficient; 3684

Henry Garrett · 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- 3685

SuperHyperTotal, Extreme re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Ex- 3686
treme rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph N SHG : 3687
(V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined as 3688
the Extreme number of the maximum Extreme cardinality of the Extreme SuperHyper- 3689
Vertices of an Extreme SuperHyperSet S of high Extreme cardinality conseNeighborive 3690

Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 3691
Extreme SuperHyperTotal; and the Extreme power is corresponded to its Extreme coeffi- 3692
cient. 3693

136EXM1 Example 21.0.3. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E) in the 3694
mentioned Extreme Figures in every Extreme items. 3695

• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperTotal, 3696
is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are some empty 3697
Extreme SuperHyperEdges but E2 is a loop Extreme SuperHyperEdge and E4 is an 3698
Extreme SuperHyperEdge. Thus in the terms of Extreme SuperHyperNeighbor, there’s 3699
only one Extreme SuperHyperEdge, namely, E4 . The Extreme SuperHyperVertex, V3 is 3700
Extreme isolated means that there’s no Extreme SuperHyperEdge has it as an Extreme 3701

endpoint. Thus the Extreme SuperHyperVertex, V3 , is excluded in every given Extreme 3702
SuperHyperTotal. 3703

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, 3704
is up. The Extreme Algorithm is Extremely straightforward. E1 , E2 and E3 are some empty 3705
Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. Thus in the terms of 3706
Extreme SuperHyperNeighbor, there’s only one Extreme SuperHyperEdge, namely, E4 . 3707
The Extreme SuperHyperVertex, V3 is Extreme isolated means that there’s no Extreme 3708

SuperHyperEdge has it as an Extreme endpoint. Thus the Extreme SuperHyperVertex, 3709

V3 , is excluded in every given Extreme SuperHyperTotal. 3710

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, 3711
is up. The Extreme Algorithm is Extremely straightforward. 3712

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, 3713
is up. The Extreme Algorithm is Extremely straightforward. 3714

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, 3715
is up. The Extreme Algorithm is Extremely straightforward. 3716

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, 3717
is up. The Extreme Algorithm is Extremely straightforward. 3718

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

is up. The Extreme Algorithm is Extremely straightforward. 3720

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

is up. The Extreme Algorithm is Extremely straightforward. 3722

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

is up. The Extreme Algorithm is Extremely straightforward. 3724

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, 3725
is up. The Extreme Algorithm is Extremely straightforward. 3726

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, 3727
is up. The Extreme Algorithm is Extremely straightforward. 3728

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, 3729
is up. The Extreme Algorithm is Extremely straightforward. 3730

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, 3731
is up. The Extreme Algorithm is Extremely straightforward. 3732

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, 3733
is up. The Extreme Algorithm is Extremely straightforward. 3734

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, 3735
is up. The Extreme Algorithm is Extremely straightforward. 3736

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

is up. The Extreme Algorithm is Extremely straightforward. 3738

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, 3739
is up. The Extreme Algorithm is Extremely straightforward. 3740

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, 3741
is up. The Extreme Algorithm is Extremely straightforward. 3742

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, 3743
is up. The Extreme Algorithm is Extremely straightforward. 3744

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, 3745
is up. The Extreme Algorithm is Extremely straightforward. 3746

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, 3747
is up. The Extreme Algorithm is Extremely straightforward. 3748

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

is up. The Extreme Algorithm is Extremely straightforward. 3750

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 3751
SuperHyperClasses. 3752

Proposition 21.0.4. Assume a connected Extreme SuperHyperPath ESHP : (V, E). Then 3753

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 3754

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 3755

new way to redefine as 3756

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 3757

ViEXT ERN AL in the literatures of SuperHyperTotal. The latter is straightforward.  3758

136EXM18a Example 21.0.5. In the Figure (31.1), the connected Extreme SuperHyperPath ESHP : (V, E), 3759
is highlighted and featured. The Extreme SuperHyperSet, in the Extreme SuperHyperModel 3760
(31.1), is the SuperHyperTotal. 3761

Proposition 21.0.6. Assume a connected Extreme SuperHyperCycle ESHC : (V, E). Then 3762

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 3763

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 3764
new way to redefine as 3765

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 3766

ViEXT ERN AL in the literatures of SuperHyperTotal. The latter is straightforward.  3767

136EXM19a Example 21.0.7. In the Figure (31.2), the connected Extreme SuperHyperCycle N SHC : 3768
(V, E), is highlighted and featured. The obtained Extreme SuperHyperSet, in the Extreme 3769
SuperHyperModel (31.2), is the Extreme SuperHyperTotal. 3770

Proposition 21.0.8. Assume a connected Extreme SuperHyperStar ESHS : (V, E). Then 3771

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 3772

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 3773

way to redefine as 3774

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 3775
ViEXT ERN AL in the literatures of SuperHyperTotal. The latter is straightforward.  3776

136EXM20a Example 21.0.9. In the Figure (31.3), the connected Extreme SuperHyperStar ESHS : (V, E), 3777
is highlighted and featured. The obtained Extreme SuperHyperSet, by the Algorithm in previous 3778
Extreme result, of the Extreme SuperHyperVertices of the connected Extreme SuperHyperStar 3779
ESHS : (V, E), in the Extreme SuperHyperModel (31.3), is the Extreme SuperHyperTotal. 3780

Henry Garrett · 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 3781

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 3782

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest path taken from a connected Extreme SuperHyperBipartite ESHB : (V, E). There’s 3783
a new way to redefine as 3784

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 3785
ViEXT ERN AL in the literatures of SuperHyperTotal. The latter is straightforward. Then there’s 3786
no at least one SuperHyperTotal. Thus the notion of quasi may be up but the SuperHyperNotions 3787
based on SuperHyperTotal could be applied. There are only two SuperHyperParts. Thus every 3788
SuperHyperPart could have one SuperHyperVertex as the representative in the 3789

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperTotal taken from a connected Extreme SuperHyperBipartite ESHB : 3790
(V, E). Thus only some SuperHyperVertices and only minimum-Extreme-of-SuperHyperPart 3791
SuperHyperEdges are attained in any solution 3792

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

136EXM21a Example 21.0.11. In the Extreme Figure (31.4), the connected Extreme SuperHyperBipartite 3794
ESHB : (V, E), is Extreme highlighted and Extreme featured. The obtained Extreme 3795

SuperHyperSet, by the Extreme Algorithm in previous Extreme result, of the Extreme 3796
SuperHyperVertices of the connected Extreme SuperHyperBipartite ESHB : (V, E), in the 3797
Extreme SuperHyperModel (31.4), is the Extreme SuperHyperTotal. 3798

Proposition 21.0.12. Assume a connected Extreme SuperHyperMultipartite ESHM : (V, E). 3799
Then 3800

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 3801

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

is a longest SuperHyperTotal taken from a connected Extreme SuperHyperMultipartite 3802

ESHM : (V, E). There’s a new 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. Then there’s 3805

Henry Garrett · 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 3806
based on SuperHyperTotal could be applied. There are only z 0 SuperHyperParts. Thus every 3807
SuperHyperPart could have one SuperHyperVertex as the representative in the 3808

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

is a longest path taken from a connected Extreme SuperHyperMultipartite ESHM : 3809

(V, E). Thus only some SuperHyperVertices and only minimum-Extreme-of-SuperHyperPart 3810
SuperHyperEdges are attained in any solution 3811

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

is a longest path taken from a connected Extreme SuperHyperMultipartite ESHM : (V, E). 3812
The latter is straightforward.  3813

136EXM22a Example 21.0.13. In the Figure (31.5), the connected Extreme SuperHyperMultipartite 3814
ESHM : (V, E), is highlighted and Extreme featured. The obtained Extreme SuperHyperSet, by 3815
the Algorithm in previous Extreme result, of the Extreme SuperHyperVertices of the connected 3816
Extreme SuperHyperMultipartite ESHM : (V, E), in the Extreme SuperHyperModel (31.5), is 3817

the Extreme SuperHyperTotal. 3818

Proposition 21.0.14. Assume a connected Extreme SuperHyperWheel ESHW : (V, E). Then, 3819

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

P : ViEXT ERN AL , Ei∗ , CEN T ER, Ej .

is a longest SuperHyperTotal taken from a connected Extreme SuperHyperWheel ESHW : 3821

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

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 3823
ViEXT ERN AL in the literatures of SuperHyperTotal. The latter is straightforward. Then there’s 3824
at least one SuperHyperTotal. Thus the notion of quasi isn’t up and the SuperHyperNotions 3825
based on SuperHyperTotal could be applied. The unique embedded SuperHyperTotal 3826
proposes some longest SuperHyperTotal excerpt from some representatives. The latter is 3827
straightforward.  3828

136EXM23a Example 21.0.15. In the Extreme Figure (31.6), the connected Extreme SuperHyperWheel 3829
N SHW : (V, E), is Extreme highlighted and featured. The obtained Extreme SuperHyperSet, 3830

by the Algorithm in previous result, of the Extreme SuperHyperVertices of the connected 3831
Extreme SuperHyperWheel ESHW : (V, E), in the Extreme SuperHyperModel (31.6), is the 3832
Extreme SuperHyperTotal. 3833

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 CHAPTER 22 3834

Extreme SuperHyperConnected But As 3835

The Extensions Excerpt From Dense And 3836

Super Forms 3837

Definition 22.0.1. (Different Extreme Types of Extreme SuperHyperConnected). 3838

Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider an Extreme 3839
SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and E 0 = {E1 , E2 , . . . , Ez }. Then either V 0 or E 0 is called 3840

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

Va ∈ Ei , Ej ; and ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; 3842

(ii) Extreme re-SuperHyperConnected if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such that 3843

Va ∈ Ei , Ej ; ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; and |Ei |NEUTROSOPIC CARDINALITY = 3844

|Ej |NEUTROSOPIC CARDINALITY ; 3845

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

Vi , Vj 6∈ Ea ; and ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; 3847

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

Vi , Vj ∈ Ea ; ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; and |Vi |NEUTROSOPIC CARDINALITY = 3849
|Vj |NEUTROSOPIC CARDINALITY ; 3850

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

Extreme re-SuperHyperConnected, Extreme v-SuperHyperConnected, and Extreme rv- 3852
SuperHyperConnected. 3853

Definition 22.0.2. ((Extreme) SuperHyperConnected). 3854

Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider an Extreme 3855
SuperHyperEdge (NSHE) E = {V1 , V2 , . . . , Vs }. Then E is called 3856

(i) an Extreme SuperHyperConnected if it’s either of Extreme e-SuperHyperConnected, 3857

Extreme re-SuperHyperConnected, Extreme v-SuperHyperConnected, and Extreme rv- 3858
SuperHyperConnected and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3859
is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Extreme 3860

cardinality of the Extreme SuperHyperEdges in the conseNeighborive Extreme sequence 3861

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 3862
Extreme SuperHyperConnected; 3863

(ii) a Extreme SuperHyperConnected if it’s either of Extreme e-SuperHyperConnected, 3864

Extreme re-SuperHyperConnected, Extreme v-SuperHyperConnected, and Extreme rv- 3865

SuperHyperConnected and C(N SHG) for a Extreme SuperHyperGraph N SHG : (V, E) 3866
is the maximum Extreme cardinality of the Extreme SuperHyperEdges of an Extreme 3867
SuperHyperSet S of high Extreme cardinality conseNeighborive Extreme SuperHyperEdges 3868
and Extreme SuperHyperVertices such that they form the Extreme SuperHyperConnected; 3869

(iii) an Extreme SuperHyperConnected SuperHyperPolynomial if it’s either of 3870

Extreme e-SuperHyperConnected, Extreme re-SuperHyperConnected, Extreme v- 3871
SuperHyperConnected, and Extreme rv-SuperHyperConnected and C(N SHG) for an 3872
Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial con- 3873

tains the Extreme coefficients defined as the Extreme number of the maximum Extreme 3874
cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high 3875
Extreme cardinality conseNeighborive Extreme SuperHyperEdges and Extreme SuperHy- 3876
perVertices such that they form the Extreme SuperHyperConnected; and the Extreme 3877
power is corresponded to its Extreme coefficient; 3878

(iv) a Extreme SuperHyperConnected SuperHyperPolynomial if it’s either of 3879

Extreme e-SuperHyperConnected, Extreme re-SuperHyperConnected, Extreme v- 3880
SuperHyperConnected, and Extreme rv-SuperHyperConnected and C(N SHG) for an 3881

Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial con- 3882

tains the Extreme coefficients defined as the Extreme number of the maximum Extreme 3883
cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high 3884
Extreme cardinality conseNeighborive Extreme SuperHyperEdges and Extreme SuperHy- 3885
perVertices such that they form the Extreme SuperHyperConnected; and the Extreme 3886
power is corresponded to its Extreme coefficient; 3887

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

Extreme re-SuperHyperConnected, Extreme v-SuperHyperConnected, and Extreme rv- 3889
SuperHyperConnected and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3890
is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Extreme 3891
cardinality of the Extreme SuperHyperVertices in the conseNeighborive Extreme sequence 3892
of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 3893
Extreme SuperHyperConnected; 3894

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

Extreme re-SuperHyperConnected, Extreme v-SuperHyperConnected, and Extreme rv- 3896
SuperHyperConnected and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3897
is the maximum Extreme cardinality of the Extreme SuperHyperVertices of an Extreme Su- 3898
perHyperSet S of high Extreme cardinality conseNeighborive Extreme SuperHyperEdges 3899

and Extreme SuperHyperVertices such that they form the Extreme SuperHyperConnected; 3900

(vii) an Extreme R-SuperHyperConnected SuperHyperPolynomial if it’s either 3901

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

SuperHyperConnected, and Extreme rv-SuperHyperConnected and C(N SHG) for an 3903

Henry Garrett · 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 3904

contains the Extreme coefficients defined as the Extreme number of the maximum 3905
Extreme cardinality of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S 3906
of high Extreme cardinality conseNeighborive Extreme SuperHyperEdges and Extreme 3907
SuperHyperVertices such that they form the Extreme SuperHyperConnected; and the 3908
Extreme power is corresponded to its Extreme coefficient; 3909

(viii) a Extreme SuperHyperConnected SuperHyperPolynomial if it’s either of 3910

Extreme e-SuperHyperConnected, Extreme re-SuperHyperConnected, Extreme v- 3911
SuperHyperConnected, and Extreme rv-SuperHyperConnected and C(N SHG) for an 3912
Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial con- 3913
tains the Extreme coefficients defined as the Extreme number of the maximum Extreme 3914

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

Extreme cardinality conseNeighborive Extreme SuperHyperEdges and Extreme SuperHy- 3916
perVertices such that they form the Extreme SuperHyperConnected; and the Extreme 3917
power is corresponded to its Extreme coefficient. 3918

136EXM1 Example 22.0.3. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E) in the 3919

mentioned Extreme Figures in every Extreme items. 3920

• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperCon- 3921
nected, is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are some 3922
empty Extreme SuperHyperEdges but E2 is a loop Extreme SuperHyperEdge and E4 is 3923

an Extreme SuperHyperEdge. Thus in the terms of Extreme SuperHyperNeighbor, there’s 3924

only one Extreme SuperHyperEdge, namely, E4 . The Extreme SuperHyperVertex, V3 is 3925
Extreme isolated means that there’s no Extreme SuperHyperEdge has it as an Extreme 3926
endpoint. Thus the Extreme SuperHyperVertex, V3 , is excluded in every given Extreme 3927
SuperHyperConnected. 3928

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- 3929
Connected, is up. The Extreme Algorithm is Extremely straightforward. E1 , E2 and 3930
E3 are some empty Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. 3931
Thus in the terms of Extreme SuperHyperNeighbor, there’s only one Extreme SuperHy- 3932
perEdge, namely, E4 . The Extreme SuperHyperVertex, V3 is Extreme isolated means that 3933
there’s no Extreme SuperHyperEdge has it as an Extreme endpoint. Thus the Extreme 3934

SuperHyperVertex, V3 , is excluded in every given Extreme SuperHyperConnected. 3935

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- 3936
nected, is up. The Extreme Algorithm is Extremely straightforward. 3937

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

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

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- 3940
nected, is up. The Extreme Algorithm is Extremely straightforward. 3941

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- 3942
nected, is up. The Extreme Algorithm is Extremely straightforward. 3943

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

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

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- 3946
nected, is up. The Extreme Algorithm is Extremely straightforward. 3947

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- 3948
nected, is up. The Extreme Algorithm is Extremely straightforward. 3949

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- 3950
Connected, is up. The Extreme Algorithm is Extremely straightforward. 3951

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- 3952
Connected, is up. The Extreme Algorithm is Extremely straightforward. 3953

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- 3954
Connected, is up. The Extreme Algorithm is Extremely straightforward. 3955

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- 3956
Connected, is up. The Extreme Algorithm is Extremely straightforward. 3957

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- 3958
Connected, is up. The Extreme Algorithm is Extremely straightforward. 3959

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- 3960
Connected, is up. The Extreme Algorithm is Extremely straightforward. 3961

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- 3962
Connected, is up. The Extreme Algorithm is Extremely straightforward. 3963

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- 3964
Connected, is up. The Extreme Algorithm is Extremely straightforward. 3965

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- 3966
Connected, is up. The Extreme Algorithm is Extremely straightforward. 3967

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- 3968
Connected, is up. The Extreme Algorithm is Extremely straightforward. 3969

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- 3970
Connected, is up. The Extreme Algorithm is Extremely straightforward. 3971

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- 3972
Connected, is up. The Extreme Algorithm is Extremely straightforward. 3973

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- 3974
Connected, is up. The Extreme Algorithm is Extremely straightforward. 3975

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 3976
SuperHyperClasses. 3977

Henry Garrett · 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 3978

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 3979

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 3980
new way to redefine as 3981

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 3982
ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is straightforward.  3983

136EXM18a Example 22.0.5. In the Figure (31.1), the connected Extreme SuperHyperPath ESHP : (V, E), 3984
is highlighted and featured. The Extreme SuperHyperSet, in the Extreme SuperHyperModel 3985
(31.1), is the SuperHyperConnected. 3986

Proposition 22.0.6. Assume a connected Extreme SuperHyperCycle ESHC : (V, E). Then 3987

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 3988

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 3989
new way to redefine as 3990

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 3991
ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is straightforward.  3992

136EXM19a Example 22.0.7. In the Figure (31.2), the connected Extreme SuperHyperCycle N SHC : 3993
(V, E), is highlighted and featured. The obtained Extreme SuperHyperSet, in the Extreme 3994
SuperHyperModel (31.2), is the Extreme SuperHyperConnected. 3995

Proposition 22.0.8. Assume a connected Extreme SuperHyperStar ESHS : (V, E). Then 3996

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 3997

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 3998

way to redefine as 3999

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 4000

ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is straightforward.  4001

Henry Garrett · 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), 4002
is highlighted and featured. The obtained Extreme SuperHyperSet, by the Algorithm in previous 4003
Extreme result, of the Extreme SuperHyperVertices of the connected Extreme SuperHyperStar 4004
ESHS : (V, E), in the Extreme SuperHyperModel (31.3), is the Extreme SuperHyperConnected. 4005

Proposition 22.0.10. Assume a connected Extreme SuperHyperBipartite ESHB : (V, E). Then 4006

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 4007

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

is a longest path taken from a connected Extreme SuperHyperBipartite ESHB : (V, E). There’s 4008
a new way to redefine as 4009

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 4010
ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is straightforward. Then 4011
there’s no at least one SuperHyperConnected. Thus the notion of quasi may be up but the 4012
SuperHyperNotions based on SuperHyperConnected could be applied. There are only two 4013
SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as the 4014
representative in the 4015

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 4016

ESHB : (V, E). Thus only some SuperHyperVertices and only minimum-Extreme-of- 4017
SuperHyperPart SuperHyperEdges are attained in any solution 4018

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
The latter is straightforward.  4019

136EXM21a Example 22.0.11. In the Extreme Figure (31.4), the connected Extreme SuperHyperBipartite 4020
ESHB : (V, E), is Extreme highlighted and Extreme featured. The obtained Extreme 4021
SuperHyperSet, by the Extreme Algorithm in previous Extreme result, of the Extreme 4022
SuperHyperVertices of the connected Extreme SuperHyperBipartite ESHB : (V, E), in the 4023
Extreme SuperHyperModel (31.4), is the Extreme SuperHyperConnected. 4024

Proposition 22.0.12. Assume a connected Extreme SuperHyperMultipartite ESHM : (V, E). 4025
Then 4026

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 4027

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperConnected taken from a connected Extreme SuperHyperMultipartite 4028
ESHM : (V, E). There’s a new way to redefine as 4029

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 4030
ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is straightforward. Then 4031
there’s no at least one SuperHyperConnected. Thus the notion of quasi may be up but 4032
the SuperHyperNotions based on SuperHyperConnected could be applied. There are only 4033
z 0 SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as the 4034
representative in the 4035

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

is a longest path taken from a connected Extreme SuperHyperMultipartite ESHM : 4036

(V, E). Thus only some SuperHyperVertices and only minimum-Extreme-of-SuperHyperPart 4037
SuperHyperEdges are attained in any solution 4038

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

is a longest path taken from a connected Extreme SuperHyperMultipartite ESHM : (V, E). 4039
The latter is straightforward.  4040

136EXM22a Example 22.0.13. In the Figure (31.5), the connected Extreme SuperHyperMultipartite 4041
ESHM : (V, E), is highlighted and Extreme featured. The obtained Extreme SuperHyperSet, by 4042

the Algorithm in previous Extreme result, of the Extreme SuperHyperVertices of the connected 4043
Extreme SuperHyperMultipartite ESHM : (V, E), in the Extreme SuperHyperModel (31.5), is 4044
the Extreme SuperHyperConnected. 4045

Proposition 22.0.14. Assume a connected Extreme SuperHyperWheel ESHW : (V, E). Then, 4046

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

P : V EXT ERN AL i , E ∗ i , CEN T ER, Ej .

is a longest SuperHyperConnected taken from a connected Extreme SuperHyperWheel 4048

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

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 4050
to ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is straightforward. 4051
Then there’s at least one SuperHyperConnected. Thus the notion of quasi isn’t up and 4052
the SuperHyperNotions based on SuperHyperConnected could be applied. The unique 4053
embedded SuperHyperConnected proposes some longest SuperHyperConnected excerpt from 4054
some representatives. The latter is straightforward.  4055

136EXM23a Example 22.0.15. In the Extreme Figure (31.6), the connected Extreme SuperHyperWheel 4056
N SHW : (V, E), is Extreme highlighted and featured. The obtained Extreme SuperHyperSet, 4057

by the Algorithm in previous result, of the Extreme SuperHyperVertices of the connected 4058
Extreme SuperHyperWheel ESHW : (V, E), in the Extreme SuperHyperModel (31.6), is the 4059
Extreme SuperHyperConnected. 4060

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 CHAPTER 23 4061

Background 4062

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

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

Research (JCTCSR)” with ISO abbreviation “J Curr Trends Comp Sci Res” in volume 1 4071
and issue 1 with pages 06-14. The research article studies deeply with choosing neutrosophic 4072
hypergraphs instead of neutrosophic SuperHyperGraph. It’s the breakthrough toward independent 4073
results based on initial background. 4074
The seminal paper and groundbreaking article is titled “Super Hyper Dominating and Super 4075
Hyper Resolving on Neutrosophic Super Hyper Graphs and Their Directions in Game Theory and 4076

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

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

article, a novel approach is implemented on SuperHyperGraph and neutrosophic SuperHy- 4089

perGraph based on fundamental notions and using vital tools in Cancer’s Treatments. It’s 4090
published in prestigious and fancy journal is entitled “Journal of Mathematical Techniques and 4091
Computational Mathematics(JMTCM)” with ISO abbreviation “J Math Techniques Comput 4092
Math” in volume 2 and issue 1 with pages 35-47. The research article studies deeply with 4093
choosing directly neutrosophic SuperHyperGraph and SuperHyperGraph. It’s the breakthrough 4094

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

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 4096
(Dual)Resolving and (Dual)Coloring alongside (Dual)Dominating in (Neutrosophic)n- 4097
SuperHyperGraph” in Ref. [HG4] by Henry Garrett (2022), “0049 | (Failed)1-Zero-Forcing 4098
Number in Neutrosophic Graphs” in Ref. [HG5] by Henry Garrett (2022), “Extreme SuperHy- 4099
perClique as the Firm Scheme of Confrontation under Cancer’s Recognition as the Model in 4100
The Setting of (Neutrosophic) SuperHyperGraphs” in Ref. [HG6] by Henry Garrett (2022), 4101

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

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

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

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

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

Neutrosophic Recognitions In Special ViewPoints” in Ref. [HG14] by Henry Garrett (2022), 4120
“Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To Use Neutrosophic 4121
SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond” in Ref. [HG15] by 4122
Henry Garrett (2022), “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well- 4123
SuperHyperModelled (Neutrosophic) SuperHyperGraphs ” in Ref. [HG16] by Henry Garrett 4124
(2022), “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic SuperHyperStable 4125

To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints” in Ref. [HG12] by 4126

Henry Garrett (2022), “Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutro- 4127
sophic) SuperHyperModeling in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs” 4128
in Ref. [HG17] by Henry Garrett (2022), “Neutrosophic Messy-Style SuperHyperGraphs To 4129
Form Neutrosophic SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special 4130

ViewPoints” in Ref. [HG18] by Henry Garrett (2022),“(Neutrosophic) SuperHyperModeling of 4131

Cancer’s Recognitions Featuring (Neutrosophic) SuperHyperDefensive SuperHyperAlliances” in 4132
Ref. [HG19] by Henry Garrett (2022), “(Neutrosophic) SuperHyperAlliances With SuperHyper- 4133
Defensive and SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph 4134
With (Neutrosophic) SuperHyperModeling of Cancer’s Recognitions And Related (Neutrosophic) 4135
SuperHyperClasses” in Ref. [HG20] by Henry Garrett (2022), “SuperHyperGirth on Su- 4136

perHyperGraph and Neutrosophic SuperHyperGraph With SuperHyperModeling of Cancer’s 4137

Recognitions” in Ref. [HG21] by Henry Garrett (2022), “Some SuperHyperDegrees and 4138
Co-SuperHyperDegrees on Neutrosophic SuperHyperGraphs and SuperHyperGraphs Alongside 4139
Applications in Cancer’s Treatments” in Ref. [HG22] by Henry Garrett (2022), “Super- 4140
HyperDominating and SuperHyperResolving on Neutrosophic SuperHyperGraphs And Their 4141

Henry Garrett · 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 4142
Garrett (2022), “SuperHyperMatching By (R-)Definitions And Polynomials To Monitor Cancer’s 4143
Recognition In Neutrosophic SuperHyperGraphs” in Ref. [HG24] by Henry Garrett (2023), 4144
“The Focus on The Partitions Obtained By Parallel Moves In The Cancer’s Extreme Recognition 4145
With Different Types of Extreme SuperHyperMatching Set and Polynomial on (Neutrosophic) Su- 4146
perHyperGraphs” in Ref. [HG25] by Henry Garrett (2023), “Extreme Failed SuperHyperClique 4147

Decides the Failures on the Cancer’s Recognition in the Perfect Connections of Cancer’s Attacks 4148
By SuperHyperModels Named (Neutrosophic) SuperHyperGraphs” in Ref. [HG26] by Henry 4149
Garrett (2023), “Indeterminacy On The All Possible Connections of Cells In Front of Cancer’s 4150
Attacks In The Terms of Neutrosophic Failed SuperHyperClique on Cancer’s Recognition 4151
called Neutrosophic SuperHyperGraphs” in Ref. [HG27] by Henry Garrett (2023), “Perfect 4152
Directions Toward Idealism in Cancer’s Neutrosophic Recognition Forwarding Neutrosophic 4153

SuperHyperClique on Neutrosophic SuperHyperGraphs” in Ref. [HG28] by Henry Garrett 4154

(2023), “Demonstrating Complete Connections in Every Embedded Regions and Sub-Regions in 4155
the Terms of Cancer’s Recognition and (Neutrosophic) SuperHyperGraphs With (Neutrosophic) 4156
SuperHyperClique” in Ref. [HG29] by Henry Garrett (2023), “Different Neutrosophic Types 4157
of Neutrosophic Regions titled neutrosophic Failed SuperHyperStable in Cancer’s Neutrosophic 4158
Recognition modeled in the Form of Neutrosophic SuperHyperGraphs” in Ref. [HG30] by 4159

Henry Garrett (2023), “Using the Tool As (Neutrosophic) Failed SuperHyperStable To SuperHy- 4160
perModel Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs” in Ref. [HG31] by 4161
Henry Garrett (2023), “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic 4162
SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints” in Ref. 4163
[HG32] by Henry Garrett (2023), “(Neutrosophic) SuperHyperStable on Cancer’s Recognition 4164
by Well-SuperHyperModelled (Neutrosophic) SuperHyperGraphs” in Ref. [HG33] by Henry 4165

Garrett (2023), “Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To Use 4166

Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond” in Ref. 4167
[HG34] by Henry Garrett (2022), “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s 4168
Recognitions And (Neutrosophic) SuperHyperGraphs” in Ref. [HG35] by Henry Garrett 4169
(2022), “Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic) SuperHyper- 4170
Modeling in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs” in Ref. [HG36] 4171

by Henry Garrett (2022), “Basic Neutrosophic Notions Concerning SuperHyperDominating 4172

and Neutrosophic SuperHyperResolving in SuperHyperGraph” in Ref. [HG37] by Henry 4173
Garrett (2022), “Initial Material of Neutrosophic Preliminaries to Study Some Neutrosophic 4174
Notions Based on Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic SuperHyperGraph 4175
(NSHG)” in Ref. [HG38] by Henry Garrett (2022), and [HG4; HG5; HG6; HG7; HG8; 4176

HG9; HG10; HG11; HG12; HG13; HG14; HG15; HG16; HG17; HG18; HG19; 4177
HG20; HG21; HG22; HG23; HG24; HG25; HG26; HG27; HG28; HG29; HG30; 4178
HG31; HG32; HG33; HG34; HG35; HG36; HG37; HG38; HG94; HG942; HG95; 4179
HG952; HG96; HG962; HG97; HG972; HG98; HG982; HG106; HG107; HG111; 4180
HG112; HG115; HG116; HG120; HG121; HG122; HG123; HG124; HG125; HG126; 4181
HG127; HG128; HG129; HG130; HG131; HG132; HG134; HG135; HG136; HG137; 4182

HG138; HG139; HG140; HG141; HG142; HG143; HG144; HG145; HG146; HG147; 4183
HG148; HG149; HG150; HG151; HG152; HG153; HG154; HG155; HG156; HG157; 4184
HG158; HG159; HG160; HG161; HG162; HG163; HG164; HG165; HG166; HG167; 4185
HG168; HG169; HG170; HG171; HG172; HG173; HG174; HG175; HG176; HG177; 4186
HG178; HG179; HG180; HG181; HG182; HG183; HG184; HG185; HG186; HG187; 4187

Henry Garrett · 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; HG189; HG190; HG191; HG192; HG193; HG194; HG195; HG196; HG197; 4188
HG198; HG199; HG200; HG201; HG202; HG203; HG204; HG205; HG206; HG207; 4189
HG208; HG209; HG210; HG211; HG212; HG213; HG214; HG215; HG216; HG217; 4190
HG218; HG219; HG220; HG221; HG222; HG223; HG224; HG225; HG226; HG228; 4191
HG230; HG231; HG232; HG233; HG234], there are some endeavors to formalize the 4192
basic SuperHyperNotions about neutrosophic SuperHyperGraph and SuperHyperGraph along- 4193

side scientific research books at [HG60b; HG61b; HG62b; HG63b; HG64b; HG65b; 4194
HG66b; HG67b; HG68b; HG69b; HG70b; HG71b; HG72b; HG73b; HG74b; 4195
HG75b; HG76b; HG77b; HG78b; HG79b; HG80b; HG81b; HG82b; HG83b; 4196
HG84b; HG85b; HG86b; HG87b; HG88b; HG89b; HG90b; HG91b; HG92b; 4197
HG93b; HG94b; HG95b; HG96b; HG97b; HG98b; HG99b; HG100b; HG101b; 4198
HG102b; HG103b; HG104b; HG105b; HG106b; HG107b; HG108b; HG109b; 4199

HG110b; HG111b; HG112b; HG113b; HG114b; HG115b; HG116b; HG117b; 4200

HG118b; HG119b; HG120b; HG121b; HG122b; HG123b; HG124b; HG125b; 4201
HG126b; HG127b; HG128b; HG129b; HG130b; HG131b; HG132b; HG133b; 4202
HG134b; HG135b; HG136b; HG137b; HG138b; HG139b; HG140b; HG141b; 4203
HG142b; HG143b; HG144b; HG145b; HG146b; HG147b; HG148b; HG149b; 4204
HG150b; HG151b; HG152b; HG153b; HG154b; HG155b]. Two popular scientific 4205

research books in Scribd in the terms of high readers, 4190 and 5189 respectively, on neutro- 4206
sophic science is on [HG32b; HG44b]. 4207
Some scientific studies and scientific researches about neutrosophic graphs, are proposed as book 4208
in Ref. [HG71b] by Henry Garrett (2023) which is indexed by Google Scholar and has more 4209
than 4190 readers in Scribd. It’s titled “Beyond Neutrosophic Graphs” and published by Dr. 4210
Henry Garrett. This research book covers different types of notions and settings in neutrosophic 4211

graph theory and neutrosophic SuperHyperGraph theory. 4212

Also, some scientific studies and scientific researches about neutrosophic graphs, are proposed 4213
as book in Ref. [HG70b] by Henry Garrett (2023) which is indexed by Google Scholar and 4214
has more than 5189 readers in Scribd. It’s titled “Neutrosophic Duality” and published by Dr. 4215
Henry Garrett. This research book presents different types of notions SuperHyperResolving and 4216
SuperHyperDominating in the setting of duality in neutrosophic graph theory and neutrosophic 4217

SuperHyperGraph theory. This research book has scrutiny on the complement of the intended set 4218
and the intended set, simultaneously. It’s smart to consider a set but acting on its complement 4219
that what’s done in this research book which is popular in the terms of high readers in Scribd. 4220
See the seminal scientific researches [HG1; HG2; HG3]. The formalization of the notions 4221
on the framework of notions in SuperHyperGraphs, Neutrosophic notions in SuperHyper- 4222

Graphs theory, and (Neutrosophic) SuperHyperGraphs theory at [HG4; HG5; HG6; HG7; 4223
HG8; HG9; HG10; HG11; HG12; HG13; HG14; HG15; HG16; HG17; HG18; 4224
HG19; HG20; HG21; HG22; HG23; HG24; HG25; HG26; HG27; HG28; HG29; 4225
HG30; HG31; HG32; HG33; HG34; HG35; HG36; HG37; HG38; HG94; HG942; 4226
HG95; HG952; HG96; HG962; HG97; HG972; HG98; HG982; HG106; HG107; 4227
HG111; HG112; HG115; HG116; HG120; HG121; HG122; HG123; HG124; HG125; 4228

HG126; HG127; HG128; HG129; HG130; HG131; HG132; HG134; HG135; HG136; 4229
HG137; HG138; HG139; HG140; HG141; HG142; HG143; HG144; HG145; HG146; 4230
HG147; HG148; HG149; HG150; HG151; HG152; HG153; HG154; HG155; HG156; 4231
HG157; HG158; HG159; HG160; HG161; HG162; HG163; HG164; HG165; HG166; 4232
HG167; HG168; HG169; HG170; HG171; HG172; HG173; HG174; HG175; HG176; 4233

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

HG177; HG178; HG179; HG180; HG181; HG182; HG183; HG184; HG185; HG186; 4234
HG187; HG188; HG189; HG190; HG191; HG192; HG193; HG194; HG195; HG196; 4235
HG197; HG198; HG199; HG200; HG201; HG202; HG203; HG204; HG205; HG206; 4236
HG207; HG208; HG209; HG210; HG211; HG212; HG213; HG214; HG215; HG216; 4237
HG217; HG218; HG219; HG220; HG221; HG222; HG223; HG224; HG225; HG226; 4238
HG228; HG230; HG231; HG232; HG233; HG234] alongside scientific research books 4239

at [HG60b; HG61b; HG62b; HG63b; HG64b; HG65b; HG66b; HG67b; HG68b; 4240
HG69b; HG70b; HG71b; HG72b; HG73b; HG74b; HG75b; HG76b; HG77b; 4241
HG78b; HG79b; HG80b; HG81b; HG82b; HG83b; HG84b; HG85b; HG86b; 4242
HG87b; HG88b; HG89b; HG90b; HG91b; HG92b; HG93b; HG94b; HG95b; 4243
HG96b; HG97b; HG98b; HG99b; HG100b; HG101b; HG102b; HG103b; HG104b; 4244
HG105b; HG106b; HG107b; HG108b; HG109b; HG110b; HG111b; HG112b; 4245

HG113b; HG114b; HG115b; HG116b; HG117b; HG118b; HG119b; HG120b; 4246

HG121b; HG122b; HG123b; HG124b; HG125b; HG126b; HG127b; HG128b; 4247
HG129b; HG130b; HG131b; HG132b; HG133b; HG134b; HG135b; HG136b; 4248
HG137b; HG138b; HG139b; HG140b; HG141b; HG142b; HG143b; HG144b; 4249
HG145b; HG146b; HG147b; HG148b; HG149b; HG150b; HG151b; HG152b; 4250
HG153b; HG154b; HG155b]. Two popular scientific research books in Scribd in the 4251

terms of high readers, 4190 and 5189 respectively, on neutrosophic science is on [HG32b; 4252
HG44b]. 4253

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

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

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

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

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

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

alongside-a.pdf) 4267

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

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

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

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

tps://oa.mg/work/10.13140/rg.2.2.35241.26724 4282

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 4283
Cancer’s Recognition as the Model in The Setting of (Neutrosophic) SuperHyperGraphs”, 4284
Preprints 2023, 2023010308 (doi: 10.20944/preprints202301.0308.v1). 4285

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

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

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

Theory Based on SuperHyperGraph and Neutrosophic SuperHyperGraph”, Preprints 2023, 4296

2023010265 (doi: 10.20944/preprints202301.0265.v1). 4297

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

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

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

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

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

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

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

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

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

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

Henry Garrett · 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 4323
SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints”, 4324
Preprints 2023, 2023010088 (doi: 10.20944/preprints202301.0088.v1). 4325

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

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

HG20 [21] Henry Garrett, “(Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and Su- 4329
perHyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With (Neut- 4330
rosophic) SuperHyperModeling of Cancer’s Recognitions And Related (Neutrosophic) Su- 4331
perHyperClasses”, Preprints 2022, 2022120540 (doi: 10.20944/preprints202212.0540.v1). 4332

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

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

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

HG234 [25] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph 4342
By Hamiltonian-Type-Cycle-Decomposition As Hyper Decompress On Super Decompensa- 4343

tion”, Zenodo 2023, (doi: 10.5281/zenodo.7804238). 4344

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

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

By Hamiltonian-Type-Cycle-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, 4349

(doi: 10.5281/zenodo.7799902). 4350

HG231 [28] Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Type- 4351
Cycle-Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 4352
2023, (doi: 10.5281/zenodo.7804218). 4353

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

HG228 [30] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph 4357
By Hamiltonian-Cycle-Decomposition As Hyper Decompress On Super Decompensation”, 4358

Zenodo 2023, (doi: 10.5281/zenodo.7793372). 4359

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

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

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

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

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

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

HG221 [36] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of 4375
Hamiltonian-Decomposition In Recognition of Cancer With (Neutrosophic) SuperHy- 4376
perGraph”, Zenodo 2023, (doi: 10.5281/zenodo.7787094). 4377

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

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

HG218 [39] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyper- 4384
Graph By Trace-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 4385
10.5281/zenodo.7777857). 4386

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

HG215 [41] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 4390
By Trace-Decomposition As Hyper Decompress On Super Decompensation”, Zenodo 2023, 4391
(doi: 10.5281/zenodo.7771831). 4392

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

HG213 [43] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 4396
By Trace-Cut As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 4397

10.13140/RG.2.2.20913.25446). 4398

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

HG212 [44] Henry Garrett, “New Ideas On Super Tract By Hyper Track Of Trace-Cut In Cancer’s 4399
Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zen- 4400
odo.7764916). 4401

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

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

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

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

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

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

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

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

HG203 [53] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 4426
By Vertex-Decomposition As Hyper Decompress On Super Decompensation”, ResearchGate 4427
2023, (doi: 10.13140/RG.2.2.30212.81289). 4428

HG202 [54] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of 4429
Vertex-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 4430
ResearchGate 2023, (doi: 10.13140/RG.2.2.18468.76169). 4431

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

HG200 [56] Henry Garrett, “New Ideas On Super Vertigo By Hyper Vertu Of Vertex-Cut In 4435
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 4436

10.13140/RG.2.2.32467.25124). 4437

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

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

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

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

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

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

HG194 [62] Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Cut In Can- 4453
cer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 4454
10.13140/RG.2.2.20170.24000). 4455

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

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

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

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

HG189 [67] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyper- 4468
Graph By Clique-Cut As Hyper Click On Super Cliche”, ResearchGate 2023, (doi: 4469
10.13140/RG.2.2.26134.01603). 4470

HG188 [68] Henry Garrett, “New Ideas On Super Cliff By Hyper Cling Of Clique-Cut In Can- 4471
cer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 4472
10.13140/RG.2.2.27392.30721). 4473

HG187 [69] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHy- 4474
perGraph By Space As Hyper Spin On Super Spacy”, ResearchGate 2023, (doi: 4475

10.13140/RG.2.2.33028.40321). 4476

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

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

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

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

HG183 [73] Henry Garrett, “New Ideas On Super Solidarity By Hyper Soul Of Space In 4486
Cancer’s Recognition With (Extreme) SuperHyperGraph”, ResearchGate 2023, (doi: 4487
10.13140/RG.2.2.30983.68009). 4488

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

HG181 [75] Henry Garrett, “New Ideas On Super Uniform By Hyper Deformation Of Edge- 4492
Connectivity In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchG- 4493
ate 2023, (doi: 10.13140/RG.2.2.10936.21761). 4494

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

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

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

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

HG176 [80] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyper- 4507
Graph By Chord As Hyper Excellence On Super Excess”, ResearchGate 2023, (doi: 4508
10.13140/RG.2.2.13059.58401). 4509

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

HG174 [82] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 4513
By SuperHyper(i,j)-Domination As Hyper Controller On Super Waves”, ResearchGate 4514

2023, (doi: 10.13140/RG.2.2.22011.80165). 4515

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

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

HG172 [84] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 4519
By SuperHyperEdge-Domination As Hyper Reversion On Super Indirection”, ResearchGate 4520
2023, (doi: 10.13140/RG.2.2.10493.84962). 4521

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

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

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

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

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

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

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

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

HG163 [93] Henry Garrett, “New Ideas On Super Relations By Hyper Identifications Of SuperHyper- 4546
Coloring In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 4547
2023, (doi: 10.13140/RG.2.2.34106.47047). 4548

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

HG161 [95] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 4552
By SuperHyperDimension As Hyper Distinguishing On Super Distances”, ResearchGate 4553

2023, (doi: 10.13140/RG.2.2.31956.88961). 4554

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

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

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

HG158 [98] Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDom- 4561
inating In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 4562
2023, (doi: 10.13140/RG.2.2.13121.84321). 4563

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

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

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

HG154 [102] Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal 4573
In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 4574
10.13140/RG.2.2.32363.21286). 4575

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

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

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

HG150 [106] Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of SuperHy- 4585
perJoin In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 4586
2023, (doi: 10.13140/RG.2.2.17761.79206). 4587

HG149 [107] Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of Super- 4588
HyperDuality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 4589
ResearchGate 2023, (doi: 10.13140/RG.2.2.34953.52320). 4590

HG148 [108] Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph 4591
By SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchG- 4592

ate 2023, (doi: 10.13140/RG.2.2.33275.80161). 4593

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

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

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

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

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

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

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

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

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

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

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

HG137 [119] Henry Garrett, “New Ideas On Super Disruptions In Cancer’s Extreme Recognition 4624
As Neutrosophic SuperHyperGraph By Hyper Plans Called SuperHyperConnectivities”, 4625
ResearchGate 2023, (doi: 10.13140/RG.2.2.29441.94562). 4626

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

HG135 [121] Henry Garrett,“Cancer’s Recognition and (Neutrosophic) SuperHyperGraph By the 4630
Criteria of Eulerian and Hamiltonian Type-Sets As Hyper Modified Cycles On Super 4631

Mess”, ResearchGate 2023,(doi: 10.13140/RG.2.2.16652.59525). 4632

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

HG134 [122] Henry Garrett,“Eulerian and Hamiltonian In Cancer’s Neutrosophic Recognition and 4633
Neutrosophic SuperHyperGraph On Super Interactions By Hyper Extensions of Cycles”, 4634
ResearchGate 2023,(doi: 10.13140/RG.2.2.34583.24485). 4635

HG132 [123] Henry Garrett,“SuperHyperGirth Type-Results on extreme SuperHyperGirth theory and 4636

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

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

HG131 [124] Henry Garrett,“Neutrosophic SuperHyperGraphs Warns Hyper Landmark of neutrosophic 4639

SuperHyperGirth In Super Type-Versions of Cancer’s neutrosophic Recognition”, Preprints 4640

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

HG130 [125] Henry Garrett,“The Constructions of (Neutrosophic) SuperHyperGraphs on the Cancer’s 4642
Recognition in The Confrontation With Super Attacks In Hyper Situations By Implement- 4643

ing (Neutrosophic) 1-Failed SuperHyperForcing in The Technical Approaches to Neutralize 4644

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

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

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

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

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

HG128 [127] Henry Garrett,“Super Actions On The Types of Hyper Levels In The Sensible Neutrosophic 4650

SuperHyperGirth On Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyper- 4651

Graph”, ResearchGate 2023,(doi: 10.13140/RG.2.2.26836.88960). 4652

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

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

HG126 [129] Henry Garrett,“Extreme SuperHyperClique as the Firm Scheme of Confrontation under 4656
Cancer’s Recognition as the Model in The Setting of (Neutrosophic) SuperHyperGraphs”, 4657
Preprints 2023, 2023010308 (doi: 10.20944/preprints202301.0308.v1). 4658

HG125 [130] Henry Garrett,“Uncertainty On The Act And Effect Of Cancer Alongside The Foggy 4659
Positions Of Cells Toward Neutrosophic Failed SuperHyperClique inside Neutrosophic 4660
SuperHyperGraphs Titled Cancer’s Recognition”, Preprints 2023, 2023010282 (doi: 4661
10.20944/preprints202301.0282.v1). 4662

HG124 [131] Henry Garrett,“Neutrosophic Version Of Separates Groups Of Cells In Cancer’s 4663
Recognition On Neutrosophic SuperHyperGraphs”, Preprints 2023, 2023010267 (doi: 4664
10.20944/preprints202301.0267.v1).). 4665

HG123 [132] Henry Garrett, “The Shift Paradigm To Classify Separately The Cells and Affected 4666
Cells Toward The Totality Under Cancer’s Recognition By New Multiple Definitions On 4667
the Sets Polynomials Alongside Numbers In The (Neutrosophic) SuperHyperMatching 4668
Theory Based on SuperHyperGraph and Neutrosophic SuperHyperGraph”, Preprints 2023, 4669

2023010265 (doi: 10.20944/preprints202301.0265.v1). 4670

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

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

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

HG120 [135] Henry Garrett, “Extremism of the Attacked Body Under the Cancer’s Circumstances 4678

Where Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 4679

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

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

Cancer’s Recognition In Neutrosophic SuperHyperGraphs”, ResearchGate 2023,(doi: 4682
10.13140/RG.2.2.35061.65767). 4683

HG25 [137] Henry Garrett,“The Focus on The Partitions Obtained By Parallel Moves In The 4684
Cancer’s Extreme Recognition With Different Types of Extreme SuperHyperMatching 4685

Set and Polynomial on (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 4686

10.13140/RG.2.2.18494.15680). 4687

HG26 [138] Henry Garrett,“Extreme Failed SuperHyperClique Decides the Failures on the Can- 4688
cer’s Recognition in the Perfect Connections of Cancer’s Attacks By SuperHy- 4689
perModels Named (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 4690
10.13140/RG.2.2.32530.73922). 4691

HG27 [139] Henry Garrett,“Indeterminacy On The All Possible Connections of Cells In Front 4692
of Cancer’s Attacks In The Terms of Neutrosophic Failed SuperHyperClique on 4693

Cancer’s Recognition called Neutrosophic SuperHyperGraphs”, ResearchGate 2023, (doi: 4694

10.13140/RG.2.2.15897.70243). 4695

HG116 [140] Henry Garrett,“Extreme Failed SuperHyperClique Decides the Failures on the Can- 4696
cer’s Recognition in the Perfect Connections of Cancer’s Attacks By SuperHy- 4697
perModels Named (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 4698
10.13140/RG.2.2.32530.73922). 4699

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

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

prints202301.0105.v1). 4702

HG28 [142] Henry Garrett,“Perfect Directions Toward Idealism in Cancer’s Neutrosophic Recogni- 4703
tion Forwarding Neutrosophic SuperHyperClique on Neutrosophic SuperHyperGraphs”, 4704
ResearchGate 2023, (doi: 10.13140/RG.2.2.30092.80004). 4705

HG29 [143] Henry Garrett,“Demonstrating Complete Connections in Every Embedded Regions 4706
and Sub-Regions in the Terms of Cancer’s Recognition and (Neutrosophic) Su- 4707
perHyperGraphs With (Neutrosophic) SuperHyperClique”, ResearchGate 2023, (doi: 4708

10.13140/RG.2.2.23172.19849). 4709

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

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

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

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

HG30 [146] Henry Garrett,“Different Neutrosophic Types of Neutrosophic Regions titled neut- 4716
rosophic Failed SuperHyperStable in Cancer’s Neutrosophic Recognition modeled 4717
in the Form of Neutrosophic SuperHyperGraphs”, ResearchGate 2023, (doi: 4718
10.13140/RG.2.2.17385.36968). 4719

HG107 [147] Henry Garrett, “Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To 4720
Use Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond”, 4721
Preprints 2023, 2023010044 4722

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

HG31 [149] Henry Garrett, “Using the Tool As (Neutrosophic) Failed SuperHyperStable To SuperHy- 4726
perModel Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs”, ResearchGate 4727
2023, (doi: 10.13140/RG.2.2.28945.92007). 4728

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

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

HG33 [151] Henry Garrett, “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well- 4732
SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 4733
10.13140/RG.2.2.35774.77123). 4734

HG34 [152] Henry Garrett, “Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To 4735

Use Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond”, 4736

ResearchGate 2022, (doi: 10.13140/RG.2.2.36141.77287). 4737

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

HG36 [154] Henry Garrett, “Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic) 4741
SuperHyperModeling in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs”, 4742
ResearchGate 2022, (doi: 10.13140/RG.2.2.11369.16487). 4743

HG982 [155] Henry Garrett, “(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions Featuring 4744
(Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, Preprints 2022, 2022120549 4745

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

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

HG98 [156] Henry Garrett, “(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions Featuring 4747
(Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, ResearchGate 2022, (doi: 4748
10.13140/RG.2.2.19380.94084). 4749

HG972 [157] Henry Garrett, “(Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and Su- 4750
perHyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With (Neut- 4751
rosophic) SuperHyperModeling of Cancer’s Recognitions And Related (Neutrosophic) Su- 4752
perHyperClasses”, Preprints 2022, 2022120540 (doi: 10.20944/preprints202212.0540.v1). 4753

HG97 [158] Henry Garrett, “(Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and 4754
SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With 4755
(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions And Related (Neutrosophic) 4756
SuperHyperClasses”, ResearchGate 2022, (doi: 10.13140/RG.2.2.14426.41923). 4757

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

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

HG952 [161] Henry Garrett,“Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic 4764

SuperHyperGraphs and SuperHyperGraphs Alongside Applications in Cancer’s Treatments”, 4765

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

HG95 [162] Henry Garrett, “Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic Su- 4767
perHyperGraphs And SuperHyperGraphs Alongside Applications in Cancer’s Treatments”, 4768

ResearchGate 2022 (doi: 10.13140/RG.2.2.23123.04641). 4769

HG942 [163] Henry Garrett, “SuperHyperDominating and SuperHyperResolving on Neutrosophic Super- 4770
HyperGraphs And Their Directions in Game Theory and Neutrosophic SuperHyperClasses”, 4771

Preprints 2022, 2022110576 (doi: 10.20944/preprints202211.0576.v1). 4772

HG94 [164] Henry Garrett, “SuperHyperDominating and SuperHyperResolving on Neutrosophic Super- 4773

HyperGraphs And Their Directions in Game Theory and Neutrosophic SuperHyperClasses”, 4774
ResearchGate 2022 (doi: 10.13140/RG.2.2.23324.56966). 4775

HG37 [165] Henry Garrett, “Basic Neutrosophic Notions Concerning SuperHyperDominating and 4776

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

10.13140/RG.2.2.29173.86244). 4778

HG38 [166] Henry Garrett, “Initial Material of Neutrosophic Preliminaries to Study Some Neutro- 4779

sophic Notions Based on Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic Super- 4780

HyperGraph (NSHG)”, ResearchGate 2022 (doi: 10.13140/RG.2.2.25385.88160). 4781

HG155b [167] Henry Garrett, “Hamiltonian-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 4782

2023 (doi: 10.5281/zenodo.7804449). 4783

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

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

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

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

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

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

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

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

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

HG147b [175] Henry Garrett, “SuperHyperDuality”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4798
odo.7637762). 4799

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

HG145b [177] Henry Garrett, “Edge-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 4802

10.5281/zenodo.7762232). 4803

HG144b [178] Henry Garrett, “Edge-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 4804
(doi: 10.5281/zenodo.7758601). 4805

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

HG142b [180] Henry Garrett, “Vertex-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 4808

10.5281/zenodo.7750995) . 4809

HG141b [181] Henry Garrett, “Vertex-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 4810
(doi: 10.5281/zenodo.7749875). 4811

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

HG139b [183] Henry Garrett, “Stable-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 4814

10.5281/zenodo.7742587). 4815

HG138b [184] Henry Garrett, “Stable-Decompositions In SuperHyperGraphs”. Dr. Henry Garrett, 2023 4816
(doi: 10.5281/zenodo.7738635). 4817

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

HG136b [186] Henry Garrett, “Clique-Neighbors In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 4820

10.5281/zenodo.7730484). 4821

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

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

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

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

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

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

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

HG129b [193] Henry Garrett, “Tree-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 4834
(doi: 10.5281/zenodo.7701906). 4835

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

HG127b [195] Henry Garrett, “(i,j)-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 4838

10.5281/zenodo.7694876). 4839

HG126b [196] Henry Garrett, “Edge-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 4840
10.5281/zenodo.7679410). 4841

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

HG124b [198] Henry Garrett, “K-Number In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 4844

10.5281/zenodo.7672388). 4845

HG123b [199] Henry Garrett, “Order In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4846
odo.7668648). 4847

HG122b [200] Henry Garrett, “Coloring In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 4848
10.5281/zenodo.7662810). 4849

HG121b [201] Henry Garrett, “Dimension In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 4850

10.5281/zenodo.7659162). 4851

HG120b [202] Henry Garrett, “Cancer In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 4852
10.5281/zenodo.7653233). 4853

HG119b [203] Henry Garrett, “SuperHyperWheel”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4854
odo.7653204). 4855

HG118b [204] Henry Garrett, “SuperHyperMultipartite”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4856

odo.7653142). 4857

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

HG117b [205] Henry Garrett, “SuperHyperBipartite”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4858
odo.7653117). 4859

HG116b [206] Henry Garrett, “SuperHyperStar”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4860
odo.7653089). 4861

HG115b [207] Henry Garrett, “SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4862
odo.7651687). 4863

HG114b [208] Henry Garrett, “SuperHyperPath”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4864
odo.7651619). 4865

HG113b [209] Henry Garrett, “SuperHyperDomination”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4866
odo.7651439). 4867

HG112b [210] Henry Garrett, “SuperHyperDominating”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4868
odo.7650729). 4869

HG111b [211] Henry Garrett, “SuperHyperConnected”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4870
odo.7647868). 4871

HG110b [212] Henry Garrett, “SuperHyperTotal”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4872
odo.7647017). 4873

HG109b [213] Henry Garrett, “SuperHyperPerfect”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4874

odo.7644894). 4875

HG108b [214] Henry Garrett, “SuperHyperJoin”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4876
odo.7641880). 4877

HG107b [215] Henry Garrett, “Path SuperHyperColoring”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4878
odo.7632923). 4879

HG106b [216] Henry Garrett, “SuperHyperDensity”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4880

odo.7623459). 4881

HG105b [217] Henry Garrett, “Neutrosophic SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 4882
10.5281/zenodo.7606416). 4883

HG104b [218] Henry Garrett, “Extreme SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 4884
10.5281/zenodo.7606416). 4885

HG103b [219] Henry Garrett, “SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4886

odo.7606404). 4887

HG102b [220] Henry Garrett, “Neutrosophic SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 4888
10.5281/zenodo.7580018). 4889

HG101b [221] Henry Garrett, “Extreme SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4890
odo.7580018). 4891

HG100b [222] Henry Garrett, “Extreme SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4892

odo.7580018). 4893

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

HG99b [223] Henry Garrett, “SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4894
odo.7579929). 4895

HG98b [224] Henry Garrett, “Neutrosophic SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 4896
10.5281/zenodo.7563170). 4897

HG97b [225] Henry Garrett, “Extreme SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4898
odo.7563164). 4899

HG96b [226] Henry Garrett, “SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4900
odo.7563160). 4901

HG95b [227] Henry Garrett, “Extreme SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4902
odo.7563160). 4903

HG94b [228] Henry Garrett, “Overlook On SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 4904
10.5281/zenodo.7563160). 4905

HG93b [229] Henry Garrett, “Neutrosophic SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 4906
10.5281/zenodo.7557063). 4907

HG92b [230] Henry Garrett, “Extreme SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 4908
10.5281/zenodo.7557009). 4909

HG91b [231] Henry Garrett, “Overlook On SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 4910

10.5281/zenodo.7539484). 4911

HG90b [232] Henry Garrett, “Neutrosophic Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 4912
10.5281/zenodo.7523390). 4913

HG89b [233] Henry Garrett, “Extreme Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 4914
10.5281/zenodo.7523390). 4915

HG88b [234] Henry Garrett, “Overlook On Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 4916

10.5281/zenodo.7523390). 4917

HG87b [235] Henry Garrett, “Extreme SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4918
odo.7574952). 4919

HG86b [236] Henry Garrett, “Neutrosophic SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 4920
10.5281/zenodo.7574992). 4921

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

odo.7523357). 4923

HG84b [238] Henry Garrett, “Overlook On SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 4924
10.5281/zenodo.7523357). 4925

HG83b [239] Henry Garrett, “Neutrosophic Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 4926
10.5281/zenodo.7504782). 4927

HG82b [240] Henry Garrett, “Extreme Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 4928

10.5281/zenodo.7504782). 4929

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

HG81b [241] Henry Garrett, “Overlook On Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 4930
10.5281/zenodo.7504782). 4931

HG80b [242] Henry Garrett, “Neutrosophic SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 4932
10.5281/zenodo.7499395). 4933

HG79b [243] Henry Garrett, “Extreme SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4934
odo.7499395). 4935

HG78b [244] Henry Garrett, “Overlook On SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 4936
10.5281/zenodo.7499395). 4937

HG77b [245] Henry Garrett, “Neutrosophic Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 4938
10.5281/zenodo.7497450). 4939

HG76b [246] Henry Garrett, “Extreme Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 4940
10.5281/zenodo.7497450). 4941

HG75b [247] Henry Garrett, “Neutrosophic SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 4942
10.5281/zenodo.7494862). 4943

HG74b [248] Henry Garrett, “Extreme SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4944
odo.7494862). 4945

HG73b [249] Henry Garrett, “Overlook On SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 4946

10.5281/zenodo.7494862). 4947

HG72b [250] Henry Garrett, “Neutrosophic SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 4948
10.5281/zenodo.7493845). 4949

HG71b [251] Henry Garrett, “Extreme SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 4950
10.5281/zenodo.7493845). 4951

HG70b [252] Henry Garrett, “Overlook On SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 4952

10.5281/zenodo.7493845). 4953

HG69b [253] Henry Garrett, “SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4954
odo.7539484). 4955

HG68b [254] Henry Garrett, “Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4956
odo.7523390). 4957

HG67b [255] Henry Garrett, “SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4958

odo.7523357). 4959

HG66b [256] Henry Garrett, “Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4960
odo.7504782). 4961

HG65b [257] Henry Garrett, “SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4962
odo.7499395). 4963

HG64b [258] Henry Garrett, “Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4964

odo.7497450). 4965

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

HG63b [259] Henry Garrett, “SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4966
odo.7494862). 4967

HG62b [260] Henry Garrett, “SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4968
odo.7493845). 4969

HG61b [261] Henry Garrett, “SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4970
odo.7480110). 4971

HG60b [262] Henry Garrett, “Neut. SuperHyperEdges”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4972

odo.7378758). 4973

HG32b [263] Henry Garrett, “Beyond Neutrosophic Graphs”. Dr. Henry Garrett, 2023 (doi: 4974
10.5281/zenodo.6320305). 4975

HG44b [264] Henry Garrett, “Neutrosophic Duality”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4976
odo.6677173). 4977

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 CHAPTER 24 4978

Cancer In Neutrosophic 4979

SuperHyperGraph 4980

The cancer is the Neutrosophic disease but the Neutrosophic model is going to figure out what’s 4981
going on this Neutrosophic phenomenon. The special Neutrosophic case of this Neutrosophic 4982
disease is considered and as the consequences of the model, some parameters are used. The 4983
cells are under attack of this disease but the moves of the cancer in the special region are the 4984

matter of mind. The Neutrosophic recognition of the cancer could help to find some Neutrosophic 4985
treatments for this Neutrosophic disease. 4986
In the following, some Neutrosophic steps are Neutrosophic devised on this disease. 4987

Step 1. (Neutrosophic Definition) The Neutrosophic recognition of the cancer in the long-term 4988
Neutrosophic function. 4989

Step 2. (Neutrosophic Issue) The specific region has been assigned by the Neutrosophic model 4990
[it’s called Neutrosophic SuperHyperGraph] and the long Neutrosophic cycle of the move 4991
from the cancer is identified by this research. Sometimes the move of the cancer hasn’t be 4992
easily identified since there are some determinacy, indeterminacy and neutrality about the 4993

moves and the effects of the cancer on that region; this event leads us to choose another 4994
model [it’s said to be Neutrosophic SuperHyperGraph] to have convenient perception on 4995
what’s happened and what’s done. 4996

Step 3. (Neutrosophic Model) There are some specific Neutrosophic models, which are well- 4997

known and they’ve got the names, and some general Neutrosophic models. The moves and 4998
the Neutrosophic traces of the cancer on the complex tracks and between complicated groups 4999
of cells could be fantasized by a Neutrosophic SuperHyperPath(-/SuperHyperK-Domination, 5000
SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The 5001
aim is to find either the Neutrosophic SuperHyperK-Domination or the Neutrosophic 5002
SuperHyperK-Domination in those Neutrosophic Neutrosophic SuperHyperModels. 5003

Some cells have been faced with some attacks from the situation which is caused by the 5004
cancer’s attacks. In this case, there are some embedded analysis on the ongoing situations 5005
which in that, the cells could be labelled as some groups and some groups or individuals have 5006
excessive labels which all are raised from the behaviors to overcome the cancer’s attacks. In 5007
the embedded situations, the individuals of cells and the groups of cells could be considered 5008

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

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 5010
called “SuperHyperGraphs” and “Neutrosophic SuperHyperGraphs”. In this SuperHyperModel, 5011
the cells and the groups of cells are defined as “SuperHyperVertices” and the relations between 5012
the individuals of cells and the groups of cells are defined as “SuperHyperEdges”. Thus it’s 5013
another motivation for us to do research on this SuperHyperModel based on the “Cancer’s 5014
Recognition”. Sometimes, the situations get worst. The situation is passed from the certainty 5015

and precise style. Thus it’s the beyond them. There are three descriptions, namely, the degrees 5016
of determinacy, indeterminacy and neutrality, for any object based on vague forms, namely, 5017
incomplete data, imprecise data, and uncertain analysis. The latter model could be considered on 5018
the previous SuperHyperModel. It’s SuperHyperModel. It’s SuperHyperGraph but it’s officially 5019
called “Neutrosophic SuperHyperGraphs”. The cancer is the disease but the model is going to 5020
figure out what’s going on this phenomenon. The special case of this disease is considered and 5021

as the consequences of the model, some parameters are used. The cells are under attack of this 5022
disease but the moves of the cancer in the special region are the matter of mind. The recognition 5023
of the cancer could help to find some treatments for this disease. The SuperHyperGraph and 5024
Neutrosophic SuperHyperGraph are the SuperHyperModels on the “Cancer’s Recognition” and 5025
both bases are the background of this research. Sometimes the cancer has been happened on the 5026
region, full of cells, groups of cells and embedded styles. In this segment, the SuperHyperModel 5027

proposes some SuperHyperNotions based on the connectivities of the moves of the cancer in the 5028
forms of alliances’ styles with the formation of the design and the architecture are formally called 5029
“ SuperHyperK-Domination” in the themes of jargons and buzzwords. The prefix “SuperHyper” 5030
refers to the theme of the embedded styles to figure out the background for the SuperHyperNotions. 5031
The recognition of the cancer in the long-term function. The specific region has been assigned 5032
by the model [it’s called SuperHyperGraph] and the long cycle of the move from the cancer is 5033

identified by this research. Sometimes the move of the cancer hasn’t be easily identified since 5034
there are some determinacy, indeterminacy and neutrality about the moves and the effects of the 5035
cancer on that region; this event leads us to choose another model [it’s said to be Neutrosophic 5036
SuperHyperGraph] to have convenient perception on what’s happened and what’s done. There are 5037
some specific models, which are well-known and they’ve got the names, and some general models. 5038
The moves and the traces of the cancer on the complex tracks and between complicated groups 5039

of cells could be fantasized by a Neutrosophic SuperHyperPath (-/SuperHyperK-Domination, 5040

SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim 5041
is to find either the optimal SuperHyperK-Domination or the Neutrosophic SuperHyperK- 5042
Domination in those Neutrosophic SuperHyperModels. Some general results are introduced. 5043
Beyond that in SuperHyperStar, all possible Neutrosophic SuperHyperPath s have only two 5044

SuperHyperEdges but it’s not enough since it’s essential to have at least three SuperHyperEdges 5045
to form any style of a SuperHyperK-Domination. There isn’t any formation of any SuperHyperK- 5046
Domination but literarily, it’s the deformation of any SuperHyperK-Domination. It, literarily, 5047
deforms and it doesn’t form. 5048

Question 24.0.1. How to define the SuperHyperNotions and to do research on them to find the “ 5049
amount of SuperHyperK-Domination” of either individual of cells or the groups of cells based on 5050
the fixed cell or the fixed group of cells, extensively, the “amount of SuperHyperK-Domination” 5051
based on the fixed groups of cells or the fixed groups of group of cells? 5052

Question 24.0.2. What are the best descriptions for the “Cancer’s Recognition” in terms of 5053

these messy and dense SuperHyperModels where embedded notions are illustrated? 5054

Henry Garrett · 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 5055
it motivates us to define different types of “ SuperHyperK-Domination” and “Neutrosophic 5056
SuperHyperK-Domination” on “SuperHyperGraph” and “Neutrosophic SuperHyperGraph”. Then 5057
the research has taken more motivations to define SuperHyperClasses and to find some 5058
connections amid this SuperHyperNotion with other SuperHyperNotions. It motivates us to get 5059
some instances and examples to make clarifications about the framework of this research. The 5060

general results and some results about some connections are some avenues to make key point of 5061
this research, “Cancer’s Recognition”, more understandable and more clear. 5062
Some SuperHyperClasses and some Neutrosophic SuperHyperClasses are the cases of this 5063
research on the modeling of the regions where are under the attacks of the cancer to 5064
recognize this disease as it’s mentioned on the title “Cancer’s Recognitions”. To formalize 5065
the instances on the SuperHyperNotion, SuperHyperK-Domination, the new SuperHyperClasses 5066

and SuperHyperClasses, are introduced. Some general results are gathered in the section on the 5067
SuperHyperK-Domination and the Neutrosophic SuperHyperK-Domination. The clarifications, 5068
instances and literature reviews have taken the whole way through. In this scientific research, 5069
the literature reviews have fulfilled the lines containing the notions and the results. The 5070
SuperHyperGraph and Neutrosophic SuperHyperGraph are the SuperHyperModels on the 5071
“Cancer’s Recognitions” and both bases are the background of this research. Sometimes the 5072

cancer has been happened on the region, full of cells, groups of cells and embedded styles. In 5073
this scientific segment, the SuperHyperModel proposes some SuperHyperNotions based on the 5074
connectivities of the moves of the cancer in the longest and strongest styles with the formation 5075
of the design and the architecture are formally called “ SuperHyperK-Domination” in the themes 5076
of jargons and buzzwords. The prefix “SuperHyper” refers to the theme of the embedded styles to 5077
figure out the background for the SuperHyperNotions. 5078

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 CHAPTER 25 5079

Neutrosophic 5080

Hamiltonian-Cycle-Neighbor 5081

Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of SuperHyperDu- 5082
ality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, ResearchGate 5083
2023, (doi: 10.13140/RG.2.2.34953.52320). 5084
Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph By 5085
SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchGate 2023, 5086
(doi: 10.13140/RG.2.2.33275.80161). 5087

Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 5088
By SuperHyperJoin As Hyper Separations On Super Sorts”, ResearchGate 2023, (doi: 5089
10.13140/RG.2.2.11050.90569). 5090
Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of SuperHyperJoin 5091
In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 5092
10.13140/RG.2.2.17761.79206). 5093

Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 5094
By SuperHyperPerfect As Hyper Idealism On Super Vacancy”, ResearchGate 2023, (doi: 5095
10.13140/RG.2.2.19911.37285). 5096
Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect 5097
In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 5098
10.13140/RG.2.2.23266.81602). 5099

Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 5100
By SuperHyperTotal As Hyper Covering On Super Infections”, ResearchGate 2023, (doi: 5101
10.13140/RG.2.2.19360.87048). 5102
Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal 5103
In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 5104
10.13140/RG.2.2.32363.21286). 5105

Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 5106
By SuperHyperConnected As Hyper Group On Super Surge”, ResearchGate 2023, (doi: 5107
10.13140/RG.2.2.11758.69441). 5108
Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of SuperHyperConnected 5109
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 5110
10.13140/RG.2.2.31891.35367). 5111

Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 5112

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

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

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 CHAPTER 26 5118

New Ideas In Recognition of Cancer And 5119

Neutrosophic SuperHyperGraph By 5120

Hamiltonian-Cycle-Neighbor As Hyper 5121

Nebbish On Super Nebulous 5122

247
 CHAPTER 27 5123

ABSTRACT 5124

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

Cycle-Neighbor ). Assume a Neutrosophic SuperHyperGraph (NSHG) S is a Hamiltonian-Cycle-Neighbor 5126

pair S = (V, E). Consider a Neutrosophic SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and E 0 = 5127
{E1 , E2 , . . . , Ez }. Then either V 0 or E 0 is called Neutrosophic e-SuperHyperHamiltonian-Cycle-Neighbor 5128
if the following expression is called Neutrosophic e-SuperHyperHamiltonian-Cycle-Neighbor criteria holds 5129

∀N (Ea ) ∈ C : C is
a SuperHyperCycle and it has
the maximum number of SuperHyperVertices;
Neutrosophic re-SuperHyperHamiltonian-Cycle-Neighbor if the following expression is called Neutrosophic 5130

e-SuperHyperHamiltonian-Cycle-Neighbor criteria holds 5131

∀N (Ea ) ∈ C : C is
a SuperHyperCycle and it has
the maximum number of SuperHyperVertices;
and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; Neutrosophic 5132
v-SuperHyperHamiltonian-Cycle-Neighbor if the following expression is called Neutrosophic v- 5133
SuperHyperHamiltonian-Cycle-Neighbor criteria holds 5134

∀N (Va ) ∈ C : C is
a SuperHyperCycle and it has
the maximum number of SuperHyperVertices;
Neutrosophic rv-SuperHyperHamiltonian-Cycle-Neighbor if the following expression is called Neutro- 5135
sophic v-SuperHyperHamiltonian-Cycle-Neighbor criteria holds 5136

∀N (Va ) ∈ C : C is
a SuperHyperCycle and it has
the maximum number of SuperHyperVertices;
and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; Neutrosophic 5137
SuperHyperHamiltonian-Cycle-Neighbor if it’s either of Neutrosophic e-SuperHyperHamiltonian-Cycle- 5138
Neighbor, Neutrosophic re-SuperHyperHamiltonian-Cycle-Neighbor, Neutrosophic v-SuperHyperHamiltonian- 5139

Cycle-Neighbor, and Neutrosophic rv-SuperHyperHamiltonian-Cycle-Neighbor. ((Neutrosophic) 5140

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

SuperHyperHamiltonian-Cycle-Neighbor). Assume a Neutrosophic SuperHyperGraph (NSHG) S is 5141

a pair S = (V, E). Consider a Neutrosophic SuperHyperEdge (NSHE) E = {V1 , V2 , . . . , Vs }. 5142
Then E is called an Extreme SuperHyperHamiltonian-Cycle-Neighbor if it’s either of Neutrosophic 5143
e-SuperHyperHamiltonian-Cycle-Neighbor, Neutrosophic re-SuperHyperHamiltonian-Cycle-Neighbor, Neutro- 5144
sophic v-SuperHyperHamiltonian-Cycle-Neighbor, and Neutrosophic rv-SuperHyperHamiltonian-Cycle-Neighbor 5145
and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme 5146

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

SuperHyperEdges in the conseNeighborive Extreme sequence of Extreme SuperHyperEdges 5148
and Extreme SuperHyperVertices such that they form the Extreme SuperHyperHamiltonian- 5149
Cycle-Neighbor; a Neutrosophic SuperHyperHamiltonian-Cycle-Neighbor if it’s either of Neutrosophic 5150
e-SuperHyperHamiltonian-Cycle-Neighbor, Neutrosophic re-SuperHyperHamiltonian-Cycle-Neighbor, Neutro- 5151
sophic v-SuperHyperHamiltonian-Cycle-Neighbor, and Neutrosophic rv-SuperHyperHamiltonian-Cycle-Neighbor 5152

and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutro- 5153
sophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of 5154
high Neutrosophic cardinality conseNeighborive Neutrosophic SuperHyperEdges and Neutrosophic 5155
SuperHyperVertices such that they form the Neutrosophic SuperHyperHamiltonian-Cycle-Neighbor; an 5156
Extreme SuperHyperHamiltonian-Cycle-Neighbor SuperHyperPolynomial if it’s either of Neutrosophic 5157
e-SuperHyperHamiltonian-Cycle-Neighbor, Neutrosophic re-SuperHyperHamiltonian-Cycle-Neighbor, Neutro- 5158

sophic v-SuperHyperHamiltonian-Cycle-Neighbor, and Neutrosophic rv-SuperHyperHamiltonian-Cycle-Neighbor 5159

and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyper- 5160
Polynomial contains the Extreme coefficients defined as the Extreme number of the maximum 5161
Extreme cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high 5162
Extreme cardinality conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyper- 5163
Vertices such that they form the Extreme SuperHyperHamiltonian-Cycle-Neighbor; and the Extreme 5164

power is corresponded to its Extreme coefficient; a Neutrosophic SuperHyperHamiltonian-Cycle-Neighbor 5165

SuperHyperPolynomial if it’s either of Neutrosophic e-SuperHyperHamiltonian-Cycle-Neighbor, Neut- 5166
rosophic re-SuperHyperHamiltonian-Cycle-Neighbor, Neutrosophic v-SuperHyperHamiltonian-Cycle-Neighbor, 5167
and Neutrosophic rv-SuperHyperHamiltonian-Cycle-Neighbor and C(N SHG) for a Neutrosophic Su- 5168
perHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains the 5169
Neutrosophic coefficients defined as the Neutrosophic number of the maximum Neutrosophic 5170

cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of high 5171

Neutrosophic cardinality conseNeighborive Neutrosophic SuperHyperEdges and Neutrosophic 5172
SuperHyperVertices such that they form the Neutrosophic SuperHyperHamiltonian-Cycle-Neighbor; 5173
and the Neutrosophic power is corresponded to its Neutrosophic coefficient; an Extreme V- 5174
SuperHyperHamiltonian-Cycle-Neighbor if it’s either of Neutrosophic e-SuperHyperHamiltonian-Cycle-Neighbor, 5175

Neutrosophic re-SuperHyperHamiltonian-Cycle-Neighbor, Neutrosophic v-SuperHyperHamiltonian-Cycle- 5176

Neighbor, and Neutrosophic rv-SuperHyperHamiltonian-Cycle-Neighbor and C(N SHG) for an Extreme 5177
SuperHyperGraph N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHy- 5178
perSet S of high Extreme cardinality of the Extreme SuperHyperVertices in the conseNeighborive 5179
Extreme sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that 5180
they form the Extreme SuperHyperHamiltonian-Cycle-Neighbor; a Neutrosophic V-SuperHyperHamiltonian- 5181

Cycle-Neighbor if it’s either of Neutrosophic e-SuperHyperHamiltonian-Cycle-Neighbor, Neutrosophic 5182

re-SuperHyperHamiltonian-Cycle-Neighbor, Neutrosophic v-SuperHyperHamiltonian-Cycle-Neighbor, and Neut- 5183
rosophic rv-SuperHyperHamiltonian-Cycle-Neighbor and C(N SHG) for a Neutrosophic SuperHyperGraph 5184
N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVer- 5185
tices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality conseNeighborive 5186

Henry Garrett · 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 SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form 5187
the Neutrosophic SuperHyperHamiltonian-Cycle-Neighbor; an Extreme V-SuperHyperHamiltonian-Cycle- 5188
Neighbor SuperHyperPolynomial if it’s either of Neutrosophic e-SuperHyperHamiltonian-Cycle-Neighbor, 5189
Neutrosophic re-SuperHyperHamiltonian-Cycle-Neighbor, Neutrosophic v-SuperHyperHamiltonian-Cycle- 5190
Neighbor, and Neutrosophic rv-SuperHyperHamiltonian-Cycle-Neighbor and C(N SHG) for an Extreme 5191
SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Ex- 5192

treme coefficients defined as the Extreme number of the maximum Extreme cardinality of 5193
the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinal- 5194
ity conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that 5195
they form the Extreme SuperHyperHamiltonian-Cycle-Neighbor; and the Extreme power is corres- 5196
ponded to its Extreme coefficient; a Neutrosophic SuperHyperHamiltonian-Cycle-Neighbor SuperHy- 5197
perPolynomial if it’s either of Neutrosophic e-SuperHyperHamiltonian-Cycle-Neighbor, Neutrosophic 5198

re-SuperHyperHamiltonian-Cycle-Neighbor, Neutrosophic v-SuperHyperHamiltonian-Cycle-Neighbor, and Neut- 5199

rosophic rv-SuperHyperHamiltonian-Cycle-Neighbor and C(N SHG) for a Neutrosophic SuperHyper- 5200
Graph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains the Neutrosophic 5201
coefficients defined as the Neutrosophic number of the maximum Neutrosophic cardinality of the 5202
Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic car- 5203
dinality conseNeighborive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices 5204

such that they form the Neutrosophic SuperHyperHamiltonian-Cycle-Neighbor; and the Neutrosophic 5205
power is corresponded to its Neutrosophic coefficient. In this scientific research, new setting 5206
is introduced for new SuperHyperNotions, namely, a SuperHyperHamiltonian-Cycle-Neighbor and 5207
Neutrosophic SuperHyperHamiltonian-Cycle-Neighbor. Two different types of SuperHyperDefinitions are 5208
debut for them but the research goes further and the SuperHyperNotion, SuperHyperUniform, 5209
and SuperHyperClass based on that are well-defined and well-reviewed. The literature review is 5210

implemented in the whole of this research. For shining the elegancy and the significancy of this 5211
research, the comparison between this SuperHyperNotion with other SuperHyperNotions and 5212
fundamental SuperHyperNumbers are featured. The definitions are followed by the examples 5213
and the instances thus the clarifications are driven with different tools. The applications are 5214
figured out to make sense about the theoretical aspect of this ongoing research. The “Cancer’s 5215
Recognition” are the under research to figure out the challenges make sense about ongoing and 5216

upcoming research. The special case is up. The cells are viewed in the deemed ways. There 5217
are different types of them. Some of them are individuals and some of them are well-modeled 5218
by the group of cells. These types are all officially called “SuperHyperVertex” but the relations 5219
amid them all officially called “SuperHyperEdge”. The frameworks “SuperHyperGraph” and 5220
“Neutrosophic SuperHyperGraph” are chosen and elected to research about “Cancer’s Recog- 5221

nition”. Thus these complex and dense SuperHyperModels open up some avenues to research 5222
on theoretical segments and “Cancer’s Recognition”. Some avenues are posed to pursue this 5223
research. It’s also officially collected in the form of some questions and some problems. Assume 5224
a SuperHyperGraph. Assume a SuperHyperGraph. Then δ−SuperHyperHamiltonian-Cycle-Neighbor 5225
is a maximal of SuperHyperVertices with a maximum cardinality such that either of the 5226
following expressions hold for the (Neutrosophic) cardinalities of SuperHyperNeighbors of 5227

s ∈ S : there are |S ∩ N (s)| > |S ∩ (V \ N (s))| + δ; and |S ∩ N (s)| < |S ∩ (V \ N (s))| + δ. The 5228
first Expression, holds if S is an δ−SuperHyperOffensive. And the second Expression, holds 5229
if S is an δ−SuperHyperDefensive; a Neutrosophic δ−SuperHyperHamiltonian-Cycle-Neighbor is a 5230
maximal Neutrosophic of SuperHyperVertices with maximum Neutrosophic cardinality such 5231
that either of the following expressions hold for the Neutrosophic cardinalities of SuperHy- 5232

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

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

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

Neighbor, there’s a need to “redefine” the notion of a “SuperHyperHamiltonian-Cycle-Neighbor ”. The 5239

SuperHyperVertices and the SuperHyperEdges are assigned by the labels from the letters of the 5240
alphabets. In this procedure, there’s the usage of the position of labels to assign to the values. 5241
Assume a SuperHyperHamiltonian-Cycle-Neighbor . It’s redefined a Neutrosophic SuperHyperHamiltonian- 5242
Cycle-Neighbor if the mentioned Table holds, concerning, “The Values of Vertices, SuperVertices, 5243
Edges, HyperEdges, and SuperHyperEdges Belong to The Neutrosophic SuperHyperGraph” 5244

with the key points, “The Values of The Vertices & The Number of Position in Alphabet”, 5245
“The Values of The SuperVertices&The maximum Values of Its Vertices”, “The Values of 5246
The Edges&The maximum Values of Its Vertices”, “The Values of The HyperEdges&The 5247
maximum Values of Its Vertices”, “The Values of The SuperHyperEdges&The maximum 5248
Values of Its Endpoints”. To get structural examples and instances, I’m going to introduce 5249
the next SuperHyperClass of SuperHyperGraph based on a SuperHyperHamiltonian-Cycle-Neighbor . 5250

It’s the main. It’ll be disciplinary to have the foundation of previous definition in the kind 5251
of SuperHyperClass. If there’s a need to have all SuperHyperHamiltonian-Cycle-Neighbor until the 5252
SuperHyperHamiltonian-Cycle-Neighbor, then it’s officially called a “SuperHyperHamiltonian-Cycle-Neighbor” 5253
but otherwise, it isn’t a SuperHyperHamiltonian-Cycle-Neighbor . There are some instances about the 5254
clarifications for the main definition titled a “SuperHyperHamiltonian-Cycle-Neighbor ”. These two 5255
examples get more scrutiny and discernment since there are characterized in the disciplinary 5256

ways of the SuperHyperClass based on a SuperHyperHamiltonian-Cycle-Neighbor . For the sake of 5257

having a Neutrosophic SuperHyperHamiltonian-Cycle-Neighbor, there’s a need to “redefine” the notion 5258
of a “Neutrosophic SuperHyperHamiltonian-Cycle-Neighbor” and a “Neutrosophic SuperHyperHamiltonian- 5259
Cycle-Neighbor ”. The SuperHyperVertices and the SuperHyperEdges are assigned by the labels from 5260
the letters of the alphabets. In this procedure, there’s the usage of the position of labels to assign 5261
to the values. Assume a Neutrosophic SuperHyperGraph. It’s redefined “Neutrosophic SuperHy- 5262

perGraph” if the intended Table holds. And a SuperHyperHamiltonian-Cycle-Neighbor are redefined to a 5263
“Neutrosophic SuperHyperHamiltonian-Cycle-Neighbor” if the intended Table holds. It’s useful to define 5264
“Neutrosophic” version of SuperHyperClasses. Since there’s more ways to get Neutrosophic 5265
type-results to make a Neutrosophic SuperHyperHamiltonian-Cycle-Neighbor more understandable. As- 5266
sume a Neutrosophic SuperHyperGraph. There are some Neutrosophic SuperHyperClasses if the 5267

intended Table holds. Thus SuperHyperPath, SuperHyperHamiltonian-Cycle-Neighbor, SuperHyperStar, 5268

SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, are “Neutrosophic 5269
SuperHyperPath”, “Neutrosophic SuperHyperHamiltonian-Cycle-Neighbor”, “Neutrosophic SuperHy- 5270
perStar”, “Neutrosophic SuperHyperBipartite”, “Neutrosophic SuperHyperMultiPartite”, and 5271
“Neutrosophic SuperHyperWheel” if the intended Table holds. A SuperHyperGraph has a 5272
“Neutrosophic SuperHyperHamiltonian-Cycle-Neighbor” where it’s the strongest [the maximum Neutro- 5273

sophic value from all the SuperHyperHamiltonian-Cycle-Neighbor amid the maximum value amid all 5274
SuperHyperVertices from a SuperHyperHamiltonian-Cycle-Neighbor .] SuperHyperHamiltonian-Cycle-Neighbor 5275
. A graph is a SuperHyperUniform if it’s a SuperHyperGraph and the number of elements of 5276
SuperHyperEdges are the same. Assume a Neutrosophic SuperHyperGraph. There are some 5277
SuperHyperClasses as follows. It’s SuperHyperPath if it’s only one SuperVertex as intersection 5278

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

amid two given SuperHyperEdges with two exceptions; it’s SuperHyperHamiltonian-Cycle-Neighbor if it’s 5279
only one SuperVertex as intersection amid two given SuperHyperEdges; it’s SuperHyperStar it’s 5280
only one SuperVertex as intersection amid all SuperHyperEdges; it’s SuperHyperBipartite it’s 5281
only one SuperVertex as intersection amid two given SuperHyperEdges and these SuperVertices, 5282
forming two separate sets, has no SuperHyperEdge in common; it’s SuperHyperMultiPartite it’s 5283
only one SuperVertex as intersection amid two given SuperHyperEdges and these SuperVertices, 5284

forming multi separate sets, has no SuperHyperEdge in common; it’s a SuperHyperWheel if it’s 5285
only one SuperVertex as intersection amid two given SuperHyperEdges and one SuperVertex 5286
has one SuperHyperEdge with any common SuperVertex. The SuperHyperModel proposes 5287
the specific designs and the specific architectures. The SuperHyperModel is officially called 5288
“SuperHyperGraph” and “Neutrosophic SuperHyperGraph”. In this SuperHyperModel, The 5289
“specific” cells and “specific group” of cells are SuperHyperModeled as “SuperHyperVertices” and 5290

the common and intended properties between “specific” cells and “specific group” of cells are 5291
SuperHyperModeled as “SuperHyperEdges”. Sometimes, it’s useful to have some degrees of 5292
determinacy, indeterminacy, and neutrality to have more precise SuperHyperModel which in 5293
this case the SuperHyperModel is called “Neutrosophic”. In the future research, the foundation 5294
will be based on the “Cancer’s Recognition” and the results and the definitions will be introduced 5295
in redeemed ways. The recognition of the cancer in the long-term function. The specific region 5296

has been assigned by the model [it’s called SuperHyperGraph] and the long cycle of the move 5297
from the cancer is identified by this research. Sometimes the move of the cancer hasn’t be 5298
easily identified since there are some determinacy, indeterminacy and neutrality about the 5299
moves and the effects of the cancer on that region; this event leads us to choose another 5300
model [it’s said to be Neutrosophic SuperHyperGraph] to have convenient perception on what’s 5301
happened and what’s done. There are some specific models, which are well-known and they’ve 5302

got the names, and some SuperHyperGeneral SuperHyperModels. The moves and the traces 5303
of the cancer on the complex tracks and between complicated groups of cells could be fantas- 5304
ized by a Neutrosophic SuperHyperPath(-/SuperHyperHamiltonian-Cycle-Neighbor, SuperHyperStar, 5305
SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find either 5306
the longest SuperHyperHamiltonian-Cycle-Neighbor or the strongest SuperHyperHamiltonian-Cycle-Neighbor 5307
in those Neutrosophic SuperHyperModels. For the longest SuperHyperHamiltonian-Cycle-Neighbor, 5308

called SuperHyperHamiltonian-Cycle-Neighbor, and the strongest SuperHyperHamiltonian-Cycle-Neighbor, called 5309

Neutrosophic SuperHyperHamiltonian-Cycle-Neighbor, some general results are introduced. Beyond 5310
that in SuperHyperStar, all possible SuperHyperPaths have only two SuperHyperEdges but it’s 5311
not enough since it’s essential to have at least three SuperHyperEdges to form any style of a 5312
SuperHyperHamiltonian-Cycle-Neighbor. There isn’t any formation of any SuperHyperHamiltonian-Cycle- 5313

Neighbor but literarily, it’s the deformation of any SuperHyperHamiltonian-Cycle-Neighbor. It, literarily, 5314
deforms and it doesn’t form. A basic familiarity with Neutrosophic SuperHyperHamiltonian-Cycle- 5315
Neighbor theory, SuperHyperGraphs, and Neutrosophic SuperHyperGraphs theory are proposed. 5316
Keywords: Neutrosophic SuperHyperGraph, SuperHyperHamiltonian-Cycle-Neighbor, Cancer’s Neut- 5317

rosophic Recognition 5318

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

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 CHAPTER 28 5320

Applied Notions Under The Scrutiny Of 5321

The Motivation Of This Scientific 5322

Research 5323

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

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

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

The latter model could be considered on the previous SuperHyperModel. It’s SuperHyperModel. 5340
It’s SuperHyperGraph but it’s officially called “Neutrosophic SuperHyperGraphs”. The cancer is 5341
the disease but the model is going to figure out what’s going on this phenomenon. The special 5342
case of this disease is considered and as the consequences of the model, some parameters 5343
are used. The cells are under attack of this disease but the moves of the cancer in the 5344
special region are the matter of mind. The recognition of the cancer could help to find some 5345

treatments for this disease. The SuperHyperGraph and Neutrosophic SuperHyperGraph are the 5346
SuperHyperModels on the “Cancer’s Recognition” and both bases are the background of this 5347
research. Sometimes the cancer has been happened on the region, full of cells, groups of cells 5348
and embedded styles. In this segment, the SuperHyperModel proposes some SuperHyperNotions 5349
based on the connectivities of the moves of the cancer in the forms of alliances’ styles with 5350
the formation of the design and the architecture are formally called “ SuperHyperHamiltonian- 5351

Cycle-Neighbor” in the themes of jargons and buzzwords. The prefix “SuperHyper” refers to the 5352

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 5353
recognition of the cancer in the long-term function. The specific region has been assigned by 5354
the model [it’s called SuperHyperGraph] and the long cycle of the move from the cancer is 5355
identified by this research. Sometimes the move of the cancer hasn’t be easily identified since 5356
there are some determinacy, indeterminacy and neutrality about the moves and the effects of the 5357
cancer on that region; this event leads us to choose another model [it’s said to be Neutrosophic 5358

SuperHyperGraph] to have convenient perception on what’s happened and what’s done. There 5359
are some specific models, which are well-known and they’ve got the names, and some general 5360
models. The moves and the traces of the cancer on the complex tracks and between complicated 5361
groups of cells could be fantasized by a Neutrosophic SuperHyperPath (-/SuperHyperHamiltonian- 5362
Cycle-Neighbor, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). 5363
The aim is to find either the optimal SuperHyperHamiltonian-Cycle-Neighbor or the Neutrosophic 5364

SuperHyperHamiltonian-Cycle-Neighbor in those Neutrosophic SuperHyperModels. Some general results 5365

are introduced. Beyond that in SuperHyperStar, all possible Neutrosophic SuperHyperPath 5366
s have only two SuperHyperEdges but it’s not enough since it’s essential to have at least 5367
three SuperHyperEdges to form any style of a SuperHyperHamiltonian-Cycle-Neighbor. There isn’t any 5368
formation of any SuperHyperHamiltonian-Cycle-Neighbor but literarily, it’s the deformation of any 5369
SuperHyperHamiltonian-Cycle-Neighbor. It, literarily, deforms and it doesn’t form. 5370

Question 28.0.1. How to define the SuperHyperNotions and to do research on them to find the 5371

“ amount of SuperHyperHamiltonian-Cycle-Neighbor” of either individual of cells or the groups of cells 5372

based on the fixed cell or the fixed group of cells, extensively, the “amount of SuperHyperHamiltonian- 5373
Cycle-Neighbor” based on the fixed groups of cells or the fixed groups of group of cells? 5374

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

It’s motivation to find notions to use in this dense model is titled “SuperHyperGraphs”. Thus 5377
it motivates us to define different types of “ SuperHyperHamiltonian-Cycle-Neighbor” and “Neutrosophic 5378

SuperHyperHamiltonian-Cycle-Neighbor” on “SuperHyperGraph” and “Neutrosophic SuperHyperGraph”. 5379

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

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

SuperHyperHamiltonian-Cycle-Neighbor and Neutrosophic SuperHyperHamiltonian-Cycle-Neighbor, are figured 5391

out in sections “ SuperHyperHamiltonian-Cycle-Neighbor” and “Neutrosophic SuperHyperHamiltonian- 5392
Cycle-Neighbor”. In the sense of tackling on getting results and in Hamiltonian-Cycle-Neighbor to make 5393
sense about continuing the research, the ideas of SuperHyperUniform and Neutrosophic 5394
SuperHyperUniform are introduced and as their consequences, corresponded SuperHyperClasses 5395
are figured out to debut what’s done in this section, titled “Results on SuperHyperClasses” 5396

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

Henry Garrett · 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 5398
frameworks, SuperHyperGraph and Neutrosophic SuperHyperGraph, in the sections “Results on 5399
SuperHyperClasses” and “Results on Neutrosophic SuperHyperClasses”. The starter research 5400
about the general SuperHyperRelations and as concluding and closing section of theoretical 5401
research are contained in the section “General Results”. Some general SuperHyperRelations 5402
are fundamental and they are well-known as fundamental SuperHyperNotions as elicited and 5403

discussed in the sections, “General Results”, “ SuperHyperHamiltonian-Cycle-Neighbor”, “Neutrosophic 5404

SuperHyperHamiltonian-Cycle-Neighbor”, “Results on SuperHyperClasses” and “Results on Neutrosophic 5405
SuperHyperClasses”. There are curious questions about what’s done about the SuperHyperNotions 5406
to make sense about excellency of this research and going to figure out the word “best” as the 5407
description and adjective for this research as presented in section, “ SuperHyperHamiltonian-Cycle- 5408
Neighbor”. The keyword of this research debut in the section “Applications in Cancer’s Recognition” 5409

with two cases and subsections “Case 1: The Initial Steps Toward SuperHyperBipartite as 5410
SuperHyperModel” and “Case 2: The Increasing Steps Toward SuperHyperMultipartite as 5411
SuperHyperModel”. In the section, “Open Problems”, there are some scrutiny and discernment 5412
on what’s done and what’s happened in this research in the terms of “questions” and “problems” 5413
to make sense to figure out this research in featured style. The advantages and the limitations of 5414
this research alongside about what’s done in this research to make sense and to get sense about 5415

what’s figured out are included in the section, “Conclusion and Closing Remarks”. 5416

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 CHAPTER 29 5417

Neutrosophic Preliminaries Of This 5418

Scientific Research On the Redeemed 5419

Ways 5420

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

Neutrosophic Set](Ref.[HG38],Definition 2.2,p.2), [Neutrosophic Set](Ref.[HG38],Definition 5422

2.1,p.1), [Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG38],Definition 2.5,p.2), [Char- 5423
acterization of the Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG38],Definition 2.7,p.3), 5424
[t-norm](Ref.[HG38], Definition 2.7, p.3), and [Characterization of the Neutrosophic SuperHy- 5425
perGraph (NSHG)](Ref.[HG38],Definition 2.7,p.3), [Neutrosophic Strength of the Neutrosophic 5426
SuperHyperPaths] (Ref.[HG38],Definition 5.3,p.7), and [Different Neutrosophic Types of Neut- 5427

rosophic SuperHyperEdges (NSHE)] (Ref.[HG38],Definition 5.4,p.7). Also, the new ideas and 5428
their clarifications are addressed to Ref.[HG38]. 5429
In this subsection, the basic material which is used in this scientific research, is presented. Also, 5430
the new ideas and their clarifications are elicited. 5431

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

Let X be a Hamiltonian-Cycle-Neighbor of points (objects) with generic elements in X denoted by x;
then the Neutrosophic set A (NS A) is an object having the form
A = {< x : TA (x), IA (x), FA (x) >, x ∈ X}
+
where the functions T, I, F : X →]− 0, 1 [ define respectively the a truth-membership
function, an indeterminacy-membership function, and a falsity-membership function
of the element x ∈ X to the set A with the condition
−
0 ≤ TA (x) + IA (x) + FA (x) ≤ 3+ .
+
The functions TA (x), IA (x) and FA (x) are real standard or nonstandard subsets of ]− 0, 1 [. 5432

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

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

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). 5433
Assume V 0 is a given set. a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E), 5434
where 5435

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

(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); 5437

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

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

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

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

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

0 0
P
(viii) i0 supp(Ei ) = V, (i = 1, 2, . . . , n ); 5444
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 . 5445

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

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

falsity-membership the Neutrosophic SuperHyperVertex (NSHV) Vi to the Neutrosophic 5449
SuperHyperVertex (NSHV) V. TV0 (Ei0 ), TV0 (Ei0 ), and TV0 (Ei0 ) denote the degree of truth- 5450
membership, the degree of indeterminacy-membership and the degree of falsity-membership of 5451
the Neutrosophic SuperHyperEdge (NSHE) Ei0 to the Neutrosophic SuperHyperEdge (NSHE) 5452
E. Thus, the ii0 th element of the incidence matrix of Neutrosophic SuperHyperGraph (NSHG) 5453

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

Henry Garrett · 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)). 5455

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

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

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

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

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

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

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

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

Definition 29.0.7 (t-norm). (Ref.[HG38], Definition 2.7, p.3). 5470

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

(i) 1 ⊗ x = x; 5473

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

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

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

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

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

where 5479

Henry Garrett · 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 ; 5480

(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); 5481

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

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

1, 2, . . . , n0 ); 5484

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

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

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

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

Here the Neutrosophic SuperHyperEdges (NSHE) Ej 0 and the Neutrosophic SuperHyperVertices 5489
(NSHV) Vj are single valued Neutrosophic sets. TV 0 (Vi ), IV 0 (Vi ), and FV 0 (Vi ) denote the 5490
degree of truth-membership, the degree of indeterminacy-membership and the degree of 5491
falsity-membership the Neutrosophic SuperHyperVertex (NSHV) Vi to the Neutrosophic 5492
SuperHyperVertex (NSHV) V. TV0 (Ei0 ), TV0 (Ei0 ), and TV0 (Ei0 ) denote the degree of truth- 5493

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

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

Definition 29.0.11 (Characterization of the Neutrosophic SuperHyperGraph (NSHG)). 5498

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

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

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

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

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

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

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

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

makes the patterns and regularities. 5513

Definition 29.0.12. A graph is SuperHyperUniform if it’s SuperHyperGraph and the number 5514

of elements of SuperHyperEdges are the same. 5515

Henry Garrett · 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 5516
makes to have SuperHyperUniform more understandable. 5517

Definition 29.0.13. Assume a Neutrosophic SuperHyperGraph. There are some SuperHyper- 5518
Classes as follows. 5519

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

two given SuperHyperEdges with two exceptions; 5521

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

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

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

in common; 5527

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

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

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 5534
(NSHV) V1 to Neutrosophic SuperHyperVertex (NSHV) Vs if either of following conditions hold: 5535

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

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

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

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

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

(vi) there are a vertex vi ∈ Vi and a vertex vi+1 ∈ Vi+1 such that vi , vi+1 ∈ Ei0 ; 5541

0 0
(vii) there are a vertex vi ∈ Vi and a SuperVertex Vi+1 ∈ Vi+1 such that vi , Vi+1 ∈ Ei0 ; 5542

(viii) there are a SuperVertex Vi0 ∈ Vi and a vertex vi+1 ∈ Vi+1 such that Vi0 , vi+1 ∈ Ei0 ; 5543

(ix) there are a SuperVertex Vi0 ∈ Vi and a SuperVertex Vi+1

0
∈ Vi+1 such that Vi0 , Vi+1
0
∈ Ei0 . 5544

Henry Garrett · 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. 5545

(i) If for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | = 2, then NSHP is called path; 5546

(ii) if for all Ej 0 , |Ej 0 | = 2, and there’s Vi , |Vi | ≥ 1, then NSHP is called SuperPath; 5547

(iii) if for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | ≥ 2, then NSHP is called HyperPath; 5548

(iv) if there are Vi , Ej 0 , |Vi | ≥ 1, |Ej 0 | ≥ 2, then NSHP is called Neutrosophic SuperHy- 5549
perPath . 5550

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 5551

(i) Neutrosophic t-strength (min{T (Vi )}, m, n)si=1 ; 5552

(ii) Neutrosophic i-strength (m, min{I(Vi )}, n)si=1 ; 5553

(iii) Neutrosophic f-strength (m, n, min{F (Vi )})si=1 ; 5554

(iv) Neutrosophic strength (min{T (Vi )}, min{I(Vi )}, min{F (Vi )})si=1 . 5555

Definition 29.0.17 (Different Neutrosophic Types of Neutrosophic SuperHyperEdges (NSHE)). 5556

(Ref.[HG38],Definition 5.4,p.7). 5557
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider a 5558
Neutrosophic SuperHyperEdge (NSHE) E = {V1 , V2 , . . . , Vs }. Then E is called 5559

(ix) Neutrosophic t-connective if T (E) ≥ maximum number of Neutrosophic t-strength 5560

of SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex (NSHV) Vi to 5561

Neutrosophic SuperHyperVertex (NSHV) Vj where 1 ≤ i, j ≤ s; 5562

(x) Neutrosophic i-connective if I(E) ≥ maximum number of Neutrosophic i-strength 5563

of SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex (NSHV) Vi to 5564

Neutrosophic SuperHyperVertex (NSHV) Vj where 1 ≤ i, j ≤ s; 5565

Henry Garrett · 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 5566

of SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex (NSHV) Vi to 5567
Neutrosophic SuperHyperVertex (NSHV) Vj where 1 ≤ i, j ≤ s; 5568

(xii) Neutrosophic connective if (T (E), I(E), F (E)) ≥ maximum number of Neutrosophic 5569
strength of SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex (NSHV) Vi 5570
to Neutrosophic SuperHyperVertex (NSHV) Vj where 1 ≤ i, j ≤ s. 5571

Definition 29.0.18. (Different Neutrosophic Types of Neutrosophic SuperHyperHamiltonian-Cycle- 5572

Neighbor). 5573
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider a 5574
Neutrosophic SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and E 0 = {E1 , E2 , . . . , Ez }. Then either V 0 5575

or E 0 is called 5576

(i) Neutrosophic e-SuperHyperHamiltonian-Cycle-Neighbor if the following expression is 5577

called Neutrosophic e-SuperHyperHamiltonian-Cycle-Neighbor criteria holds 5578

∀N (Ea ) ∈ C : C is
a SuperHyperCycle and it has
the maximum number of SuperHyperVertices;

(ii) Neutrosophic re-SuperHyperHamiltonian-Cycle-Neighbor if the following expression is 5579

called Neutrosophic re-SuperHyperHamiltonian-Cycle-Neighbor criteria holds 5580

∀N (Ea ) ∈ C : C is
a SuperHyperCycle and it has
the maximum number of SuperHyperVertices;

and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 5581

(iii) Neutrosophic v-SuperHyperHamiltonian-Cycle-Neighbor if the following expression is 5582

called Neutrosophic v-SuperHyperHamiltonian-Cycle-Neighbor criteria holds 5583

∀N (Va ) ∈ C : C is
a SuperHyperCycle and it has
the maximum number of SuperHyperVertices;

(iv) Neutrosophic rv-SuperHyperHamiltonian-Cycle-Neighbor if the following expression is 5584

called Neutrosophic v-SuperHyperHamiltonian-Cycle-Neighbor criteria holds 5585

∀N (Va ) ∈ C : C is
a SuperHyperCycle and it has
the maximum number of SuperHyperVertices;

and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; 5586

Henry Garrett · 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-Cycle-Neighbor if it’s either of Neutro- 5587

sophic e-SuperHyperHamiltonian-Cycle-Neighbor, Neutrosophic re-SuperHyperHamiltonian- 5588
Cycle-Neighbor, Neutrosophic v-SuperHyperHamiltonian-Cycle-Neighbor, and Neutrosophic rv- 5589
SuperHyperHamiltonian-Cycle-Neighbor. 5590

Definition 29.0.19. ((Neutrosophic) SuperHyperHamiltonian-Cycle-Neighbor). 5591

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider a 5592
Neutrosophic SuperHyperEdge (NSHE) E = {V1 , V2 , . . . , Vs }. Then E is called 5593

(i) an Extreme SuperHyperHamiltonian-Cycle-Neighbor if it’s either of Neutro- 5594

sophic e-SuperHyperHamiltonian-Cycle-Neighbor, Neutrosophic re-SuperHyperHamiltonian- 5595
Cycle-Neighbor, Neutrosophic v-SuperHyperHamiltonian-Cycle-Neighbor, and Neutrosophic rv- 5596
SuperHyperHamiltonian-Cycle-Neighbor and C(N SHG) for an Extreme SuperHyperGraph 5597

N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S 5598

of high Extreme cardinality of the Extreme SuperHyperEdges in the conseNeighborive 5599
Extreme sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such 5600
that they form the Extreme SuperHyperHamiltonian-Cycle-Neighbor; 5601

(ii) a Neutrosophic SuperHyperHamiltonian-Cycle-Neighbor if it’s either of Neutro- 5602

sophic e-SuperHyperHamiltonian-Cycle-Neighbor, Neutrosophic re-SuperHyperHamiltonian- 5603
Cycle-Neighbor, Neutrosophic v-SuperHyperHamiltonian-Cycle-Neighbor, and Neutrosophic rv- 5604
SuperHyperHamiltonian-Cycle-Neighbor and C(N SHG) for a Neutrosophic SuperHyperGraph 5605
N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic Su- 5606

perHyperEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 5607

conseNeighborive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices 5608
such that they form the Neutrosophic SuperHyperHamiltonian-Cycle-Neighbor; 5609

(iii) an Extreme SuperHyperHamiltonian-Cycle-Neighbor SuperHyperPolynomial if 5610

it’s either of Neutrosophic e-SuperHyperHamiltonian-Cycle-Neighbor, Neutrosophic re- 5611
SuperHyperHamiltonian-Cycle-Neighbor, Neutrosophic v-SuperHyperHamiltonian-Cycle-Neighbor, and 5612
Neutrosophic rv-SuperHyperHamiltonian-Cycle-Neighbor and C(N SHG) for an Extreme Super- 5613
HyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme 5614
coefficients defined as the Extreme number of the maximum Extreme cardinality of the 5615

Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme cardinality 5616

conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVertices such 5617
that they form the Extreme SuperHyperHamiltonian-Cycle-Neighbor; and the Extreme power is 5618
corresponded to its Extreme coefficient; 5619

(iv) a Neutrosophic SuperHyperHamiltonian-Cycle-Neighbor SuperHyperPolynomial 5620

if it’s either of Neutrosophic e-SuperHyperHamiltonian-Cycle-Neighbor, Neutrosophic re- 5621
SuperHyperHamiltonian-Cycle-Neighbor, Neutrosophic v-SuperHyperHamiltonian-Cycle-Neighbor, and 5622
Neutrosophic rv-SuperHyperHamiltonian-Cycle-Neighbor and C(N SHG) for a Neutrosophic 5623

SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains 5624

the Neutrosophic coefficients defined as the Neutrosophic number of the maximum 5625
Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic 5626
SuperHyperSet S of high Neutrosophic cardinality conseNeighborive Neutrosophic Super- 5627
HyperEdges and Neutrosophic SuperHyperVertices such that they form the Neutrosophic 5628
SuperHyperHamiltonian-Cycle-Neighbor; and the Neutrosophic power is corresponded to its 5629

Neutrosophic coefficient; 5630

Henry Garrett · 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-Cycle-Neighbor if it’s either of Neutro- 5631

sophic e-SuperHyperHamiltonian-Cycle-Neighbor, Neutrosophic re-SuperHyperHamiltonian- 5632
Cycle-Neighbor, Neutrosophic v-SuperHyperHamiltonian-Cycle-Neighbor, and Neutrosophic rv- 5633
SuperHyperHamiltonian-Cycle-Neighbor and C(N SHG) for an Extreme SuperHyperGraph 5634
N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of 5635
high Extreme cardinality of the Extreme SuperHyperVertices in the conseNeighborive 5636

Extreme sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such 5637

that they form the Extreme SuperHyperHamiltonian-Cycle-Neighbor; 5638

(vi) a Neutrosophic V-SuperHyperHamiltonian-Cycle-Neighbor if it’s either of Neut- 5639

rosophic e-SuperHyperHamiltonian-Cycle-Neighbor, Neutrosophic re-SuperHyperHamiltonian- 5640
Cycle-Neighbor, Neutrosophic v-SuperHyperHamiltonian-Cycle-Neighbor, and Neutrosophic rv- 5641

SuperHyperHamiltonian-Cycle-Neighbor and C(N SHG) for a Neutrosophic SuperHyperGraph 5642

N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic Supe- 5643
rHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 5644
conseNeighborive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices 5645
such that they form the Neutrosophic SuperHyperHamiltonian-Cycle-Neighbor; 5646

(vii) an Extreme V-SuperHyperHamiltonian-Cycle-Neighbor SuperHyperPolynomial 5647

if it’s either of Neutrosophic e-SuperHyperHamiltonian-Cycle-Neighbor, Neutrosophic re- 5648
SuperHyperHamiltonian-Cycle-Neighbor, Neutrosophic v-SuperHyperHamiltonian-Cycle-Neighbor, and 5649
Neutrosophic rv-SuperHyperHamiltonian-Cycle-Neighbor and C(N SHG) for an Extreme Super- 5650
HyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme 5651
coefficients defined as the Extreme number of the maximum Extreme cardinality of the 5652

Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality 5653

conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVertices such 5654
that they form the Extreme SuperHyperHamiltonian-Cycle-Neighbor; and the Extreme power is 5655
corresponded to its Extreme coefficient; 5656

(viii) a Neutrosophic SuperHyperHamiltonian-Cycle-Neighbor SuperHyperPolynomial 5657

if it’s either of Neutrosophic e-SuperHyperHamiltonian-Cycle-Neighbor, Neutrosophic re- 5658

SuperHyperHamiltonian-Cycle-Neighbor, Neutrosophic v-SuperHyperHamiltonian-Cycle-Neighbor, and 5659
Neutrosophic rv-SuperHyperHamiltonian-Cycle-Neighbor and C(N SHG) for a Neutrosophic 5660
SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains 5661
the Neutrosophic coefficients defined as the Neutrosophic number of the maximum 5662
Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic 5663

SuperHyperSet S of high Neutrosophic cardinality conseNeighborive Neutrosophic Super- 5664

HyperEdges and Neutrosophic SuperHyperVertices such that they form the Neutrosophic 5665
SuperHyperHamiltonian-Cycle-Neighbor; and the Neutrosophic power is corresponded to its 5666
Neutrosophic coefficient. 5667

Definition 29.0.20. ((Extreme/Neutrosophic)δ−SuperHyperHamiltonian-Cycle-Neighbor). 5668

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Then 5669

(i) an δ−SuperHyperHamiltonian-Cycle-Neighbor is a Neutrosophic kind of Neutrosophic 5670

SuperHyperHamiltonian-Cycle-Neighbor such that either of the following expressions hold for the 5671

Henry Garrett · 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

Neutrosophic cardinalities of SuperHyperNeighbors of s ∈ S : 5672

|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 5673

(29.1), holds if S is an δ−SuperHyperDefensive; 5674

(ii) a Neutrosophic δ−SuperHyperHamiltonian-Cycle-Neighbor is a Neutrosophic kind of Neut- 5675

rosophic SuperHyperHamiltonian-Cycle-Neighbor such that either of the following Neutrosophic 5676
expressions hold for the Neutrosophic cardinalities of SuperHyperNeighbors of s ∈ S : 5677

|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 5678

the Expression (29.1), holds if S is a Neutrosophic δ−SuperHyperDefensive. 5679

For the sake of having a Neutrosophic SuperHyperHamiltonian-Cycle-Neighbor, there’s a need to 5680

“redefine” the notion of “Neutrosophic SuperHyperGraph”. The SuperHyperVertices and the 5681
SuperHyperEdges are assigned by the labels from the letters of the alphabets. In this procedure, 5682
there’s the usage of the position of labels to assign to the values. 5683

136DEF1 Definition 29.0.21. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 5684
It’s redefined Neutrosophic SuperHyperGraph if the Table (29.1) holds. 5685

It’s useful to define a “Neutrosophic” version of SuperHyperClasses. Since there’s more ways 5686
to get Neutrosophic type-results to make a Neutrosophic more understandable. 5687

136DEF2 Definition 29.0.22. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = 5688

(V, E). There are some Neutrosophic SuperHyperClasses if the Table (29.2) holds. 5689
Thus Neutrosophic SuperHyperPath , SuperHyperHamiltonian-Cycle-Neighbor, SuperHyperStar, 5690
SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, are Neutrosophic 5691
SuperHyperPath, Neutrosophic SuperHyperCycle, Neutrosophic SuperHyperStar, 5692
Neutrosophic SuperHyperBipartite, Neutrosophic SuperHyperMultiPartite, and 5693
Neutrosophic SuperHyperWheel if the Table (29.2) holds. 5694

It’s useful to define a “Neutrosophic” version of a Neutrosophic SuperHyperHamiltonian-Cycle- 5695

Neighbor. Since there’s more ways to get type-results to make a Neutrosophic SuperHyperHamiltonian- 5696

Cycle-Neighbor more Neutrosophicly understandable. 5697

Henry Garrett · 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

For the sake of having a Neutrosophic SuperHyperHamiltonian-Cycle-Neighbor, there’s a need to 5698

“redefine” the Neutrosophic notion of “Neutrosophic SuperHyperHamiltonian-Cycle-Neighbor”. The 5699
SuperHyperVertices and the SuperHyperEdges are assigned by the labels from the letters of the 5700
alphabets. In this procedure, there’s the usage of the position of labels to assign to the values. 5701

136DEF1 Definition 29.0.23. Assume a SuperHyperHamiltonian-Cycle-Neighbor. It’s redefined a Neutro- 5702

sophic SuperHyperHamiltonian-Cycle-Neighbor if the Table (29.3) holds. 5703

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 CHAPTER 30 5704

Neutrosophic SuperHyper But As Hamiltonian-Cycle-Neighbor 5705

The Extensions Excerpt From Dense And 5706

Super Forms 5707

Definition 30.0.1. (Neutrosophic event). 5708

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 5709

S = (V, E) is a probability Hamiltonian-Cycle-Neighbor. Any Neutrosophic k-subset of A of V is 5710
called Neutrosophic k-event and if k = 2, then Neutrosophic subset of A of V is called 5711
Neutrosophic event. The following expression is called Neutrosophic probability of A. 5712

X
E(A) = E(a). (30.1)
a∈A

Definition 30.0.2. (Neutrosophic Independent). 5713

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) 5714

is a probability Hamiltonian-Cycle-Neighbor. s Neutrosophic k-events Ai , i ∈ I is called Neutrosophic 5715

s-independent if the following expression is called Neutrosophic s-independent criteria 5716

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. 5717

The following expression is called Neutrosophic independent criteria 5718

E(A ∩ B) = P (A)P (B). (30.2)

Definition 30.0.3. (Neutrosophic Variable). 5719

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) 5720

is a probability Hamiltonian-Cycle-Neighbor. Any k-function Hamiltonian-Cycle-Neighbor like E is called 5721

Neutrosophic k-Variable. If k = 2, then any 2-function Hamiltonian-Cycle-Neighbor like E is called 5722
Neutrosophic Variable. 5723

The notion of independent on Neutrosophic Variable is likewise. 5724

Definition 30.0.4. (Neutrosophic Expectation). 5725

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) 5726

271
Henry Garrett · Independent Researcher · Department of Mathematics ·
DrHenryGarrett@gmail.com · Manhattan, NY, USA

is a probability Hamiltonian-Cycle-Neighbor. A Neutrosophic k-Variable E has a number is called 5727

Neutrosophic Expectation if the following expression is called Neutrosophic Expectation 5728
criteria 5729
X
Ex(E) = E(α)P (α).
α∈V

Definition 30.0.5. (Neutrosophic Crossing). 5730

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) is 5731
a probability Hamiltonian-Cycle-Neighbor. A Neutrosophic number is called Neutrosophic Crossing 5732
if the following expression is called Neutrosophic Crossing criteria 5733

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). 5734
Consider S = (V, E) is a probability Hamiltonian-Cycle-Neighbor. Let m and n propose special Hamiltonian- 5735
Cycle-Neighbor. Then with m ≥ 4n, 5736

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-Cycle-Neighbor p := 4n/m, and set H := G[S] and
H := G[S].
Define random variables X, Y, Z on V as follows: X is the Neutrosophic number of
SuperHyperVertices, Y the Neutrosophic number of SuperHyperEdges, and Z the Neutrosophic
number of crossings of H. The trivial bound noted above, when applied to H, yields the
inequality Z ≥ cr(H) ≥ Y − 3X. By linearity of Neutrosophic Expectation,
E(Z) ≥ E(Y ) − 3E(X).
2
Now E(X) = pn, E(Y ) = p m (each SuperHyperEdge having some SuperHyperEnds) and
E(Z) = p4 cr(G) (each crossing being defined by some SuperHyperVertices). Hence
p4 cr(G) ≥ p2 m − 3pn.
Dividing both sides by p4 , we have: 5737

pm − 3n n 1 3 2
cr(G) ≥ = 3 = 64 m n .
p3 (4n/m)
 5738

Theorem 30.0.7. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 5739
Consider S = (V, E) is a probability Hamiltonian-Cycle-Neighbor. Let P be a SuperHyperSet of n points 5740
in the plane, and let l be the Neutrosophic number of√SuperHyperLines in the plane passing 5741

through at least k + 1 of these points, where 1 ≤ k ≤ 2 2n. Then l < 32n2 /k 3 . 5742

Proof. Form a Neutrosophic SuperHyperGraph G with SuperHyperVertex SuperHyperSet 5743

P whose SuperHyperEdge are the segments between conseNeighborive points on the 5744
SuperHyperLines which pass through at least k + 1 points of P. This Neutrosophic 5745
SuperHyperGraph has at least kl SuperHyperEdges and Neutrosophic crossing at most l 5746
choose two. Thus either kl < 4n, in which case l < 4n/k ≤ 32n2 /k 3 , or l2 /2 > l choose 2 ≥ 5747
3
cr(G) ≥ (kl) /64n2 by the Neutrosophic Crossing Lemma, and again l < 32n2 /k 3 .  5748

Henry Garrett · 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). 5749
Consider S = (V, E) is a probability Hamiltonian-Cycle-Neighbor. Let P be a SuperHyperSet of n points 5750
in the plane, and let k be the number of pairs of points of P at unit SuperHyperDistance. Then 5751
k < 5n4/3 . 5752

Proof. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = 5753

(V, E) is a probability Hamiltonian-Cycle-Neighbor. Draw a SuperHyperUnit SuperHyperCircle around 5754

each SuperHyperPoint of P. Let ni be the Neutrosophic number of thesePSuperHyperCircles 5755
i = 0n−1 ni = n and k = 12 i = 0n−1 ini . Now
P
passing through exactly i points of P. Then 5756
form a Neutrosophic SuperHyperGraph H with SuperHyperVertex SuperHyperSet P whose 5757
SuperHyperEdges are the SuperHyperArcs between conseNeighborive SuperHyperPoints on the 5758
SuperHyperCircles that pass through at least three SuperHyperPoints of P. Then 5759

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 5760

SuperHyperEdges. Delete from H one of each SuperHyperPair of parallel SuperHyperEdges, 5761
so as to obtain a simple Neutrosophic SuperHyperGraph G with e(G) ≥ k − n. Now 5762

cr(G) ≤ n(n − 1) because G is formed from at most n SuperHyperCircles, and any two 5763
SuperHyperCircles cross at most twice. Thus either e(G) < 4n, in which case k < 5n < 5n4/3 , 5764
3
or n2 > n(n − 1) ≥ cr(G) ≥ (k − n) /64n2 by the Neutrosophic Crossing Lemma, and 5765
4/3 4/3
k < 4n + n < 5n .  5766

Proposition 30.0.9. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 5767
Consider S = (V, E) is a probability Hamiltonian-Cycle-Neighbor. Let X be a nonnegative Neutrosophic 5768

Variable and t a positive real number. Then 5769

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.  5770

Corollary 30.0.10. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 5771
Consider S = (V, E) is a probability Hamiltonian-Cycle-Neighbor. Let Xn be a nonnegative integer- 5772

valued variable in a prob- ability Hamiltonian-Cycle-Neighbor (Vn , En ), n ≥ 1. If E(Xn ) → 0 as n → ∞, 5773

then P (Xn = 0) → 1 as n → ∞. 5774

Proof.  5775

Theorem 30.0.11. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 5776
Consider S = (V, E) is a probability Hamiltonian-Cycle-Neighbor. A special SuperHyperGraph in Gn,p 5777

almost surely has stability number at most d2p−1 log ne. 5778

Henry Garrett · 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 5779
S = (V, E) is a probability Hamiltonian-Cycle-Neighbor. A special SuperHyperGraph in Gn,p is up. 5780
Let G ∈ Gn,p and let S be a given SuperHyperSet of k + 1 SuperHyperVertices of G, where 5781
k ∈ N. The probability that S is a stable SuperHyperSet of G is (1 − p)(k+1)choose2 , this 5782
being the probability that none of the (k + 1)choose2 pairs of SuperHyperVertices of S is a 5783
SuperHyperEdge of the Neutrosophic SuperHyperGraph G. 5784

Let AS denote the event that S is a stable SuperHyperSet of G, and let XS denote the indicator 5785
Neutrosophic Variable for this Neutrosophic Event. By equation, we have 5786

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 5787

X
X= {XS : S ⊆ V, |S| = k + 1}

and so, by those, 5788

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: 5789

nk+1
(n choose k+1) ≤ and1 − p ≤ e−p .
(k + 1)!

This yields the following upper bound on E(X). 5790

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 5791
least as fast as the logarithm of n, implies that E(X) → 0 as n → ∞. Because X is integer-valued 5792
and nonnegative, we deduce from Corollary that P (X = 0) → 1 as n → ∞. Consequently, a 5793
Neutrosophic SuperHyperGraph in Gn,p almost surely has stability number at most k.  5794

Definition 30.0.12. (Neutrosophic Variance). 5795

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) 5796
is a probability Hamiltonian-Cycle-Neighbor. A Neutrosophic k-Variable E has a number is called 5797
Neutrosophic Variance if the following expression is called Neutrosophic Variance 5798
criteria 5799

2
V x(E) = Ex((X − Ex(X)) ).

Theorem 30.0.13. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 5800
Consider S = (V, E) is a probability Hamiltonian-Cycle-Neighbor. Let X be a Neutrosophic Variable 5801
and let t be a positive real number. Then 5802

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 5803
S = (V, E) is a probability Hamiltonian-Cycle-Neighbor. Let X be a Neutrosophic Variable and let t 5804
be a positive real number. Then 5805

2
2 Ex((X − Ex(X)) ) V (X)
E(|X − Ex(X)| ≥ t) = E((X − Ex(X)) ≥ t2 ) ≤ 2
= .
t t2
 5806

Corollary 30.0.14. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 5807
Consider S = (V, E) is a probability Hamiltonian-Cycle-Neighbor. Let Xn be a Neutrosophic Variable 5808
in a probability Hamiltonian-Cycle-Neighbor (Vn , En ), n ≥ 1. If Ex(Xn ) 6= 0 and V (Xn ) << E 2 (Xn ), 5809
then 5810

E(Xn = 0) → 0 as n → ∞

Proof. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 5811
S = (V, E) is a probability Hamiltonian-Cycle-Neighbor. Set X := Xn and t := |Ex(Xn )| in 5812
Chebyshev’s Inequality, and observe that E(Xn = 0) ≤ E(|Xn − Ex(Xn )| ≥ |Ex(Xn )|) because 5813
|Xn − Ex(Xn )| = |Ex(Xn )| when Xn = 0.  5814

Theorem 30.0.15. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 5815
Consider S = (V, E) is a probability Hamiltonian-Cycle-Neighbor. Let G ∈ Gn,1/2 . For 0 ≤ k ≤ n, set 5816

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 5817
one. Then almost surely α(G) takes one of the three values k ∗ − 2, k ∗ − 1, k ∗ . 5818

Proof. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 5819
S = (V, E) is a probability Hamiltonian-Cycle-Neighbor. As in the proof of related Theorem, the result 5820
is straightforward.  5821

Corollary 30.0.16. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 5822
Consider S = (V, E) is a probability Hamiltonian-Cycle-Neighbor. Let G ∈ Gn,1/2 and let f and k ∗ be 5823
as defined in previous Theorem. Then either: 5824

(i). f (k ∗ ) << 1, in which case almost surely α(G) is equal to either k ∗ − 2 or k ∗ − 1, or 5825

(ii). f (k ∗ − 1) >> 1, in which case almost surely α(G) is equal to either k ∗ − 1 or k ∗ . 5826

Proof. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 5827

S = (V, E) is a probability Hamiltonian-Cycle-Neighbor. The latter is straightforward.  5828

Definition 30.0.17. (Neutrosophic Threshold). 5829

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) 5830
is a probability Hamiltonian-Cycle-Neighbor. Let P be a monotone property of SuperHyperGraphs 5831
(one which is preserved when SuperHyperEdges are added). Then a Neutrosophic Threshold 5832

for P is a function f (n) such that: 5833

(i). if p << f (n), then G ∈ Gn,p almost surely does not have P, 5834

(ii). if p >> f (n), then G ∈ Gn,p almost surely has P. 5835

Henry Garrett · 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). 5836

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) 5837
is a probability Hamiltonian-Cycle-Neighbor. Let F be a fixed Neutrosophic SuperHyperGraph. Then 5838
there is a threshold function for the property of containing a copy of F as a Neutrosophic 5839
SubSuperHyperGraph is called Neutrosophic Balanced. 5840

Theorem 30.0.19. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = 5841

(V, E). Consider S = (V, E) is a probability Hamiltonian-Cycle-Neighbor. Let F be a nonempty 5842
balanced Neutrosophic SubSuperHyperGraph with k SuperHyperVertices and l SuperHyperEdges. 5843
Then n−k/l is a threshold function for the property of containing F as a Neutrosophic 5844
SubSuperHyperGraph. 5845

Proof. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 5846
S = (V, E) is a probability Hamiltonian-Cycle-Neighbor. The latter is straightforward.  5847

136EXM1 Example 30.0.20. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E) 5848
in the mentioned Neutrosophic Figures in every Neutrosophic items. 5849

• On the Figure (30.1), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 5850

SuperHyperHamiltonian-Cycle-Neighbor, is up. The Neutrosophic Algorithm is Neutrosophicly 5851
straightforward. E1 and E3 are some empty Neutrosophic SuperHyperEdges but E2 5852

is a loop Neutrosophic SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. 5853

Thus in the terms of Neutrosophic SuperHyperNeighbor, there’s only one Neutrosophic 5854
SuperHyperEdge, namely, E4 . The Neutrosophic SuperHyperVertex, V3 is Neutrosophic 5855
isolated means that there’s no Neutrosophic SuperHyperEdge has it as a Neutrosophic 5856
endpoint. Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in every given 5857
Neutrosophic SuperHyperHamiltonian-Cycle-Neighbor. 5858

C(N SHG)Neutrosophic Hamiltonian-Cycle-Neighbor

= {E4 }.
C(N SHG)Neutrosophic Hamiltonian-Cycle-Neighbor SuperHyperPolynomial
= z3.
C(N SHG)Neutrosophic V-Hamiltonian-Cycle-Neighbor
= {V1 , V2 , V4 }.
C(N SHG)Neutrosophic V-Hamiltonian-Cycle-Neighbor SuperHyperPolynomial
= z 5 + 2z 3 .

5859

• On the Figure (30.2), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 5860

SuperHyperHamiltonian-Cycle-Neighbor, is up. The Neutrosophic Algorithm is Neutrosophicly 5861
straightforward. E1 , E2 and E3 are some empty Neutrosophic SuperHyperEdges 5862
but E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of Neutrosophic 5863
SuperHyperNeighbor, there’s only one Neutrosophic SuperHyperEdge, namely, E4 . The 5864
Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means that there’s no 5865

Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. Thus the Neutrosophic 5866

Henry Garrett · 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-Cycle-Neighbor in the Neutrosophic Example (42.0.3) 136NSHG1

SuperHyperVertex, V3 , is excluded in every given Neutrosophic SuperHyperHamiltonian-Cycle- 5867

Neighbor. 5868

C(N SHG)Neutrosophic Hamiltonian-Cycle-Neighbor

= {E4 }.
C(N SHG)Neutrosophic Hamiltonian-Cycle-Neighbor SuperHyperPolynomial
= z3.
C(N SHG)Neutrosophic V-Hamiltonian-Cycle-Neighbor
= {V1 , V2 , V4 }.
C(N SHG)Neutrosophic V-Hamiltonian-Cycle-Neighbor SuperHyperPolynomial
= z 5 + z 3 + z.

5869

• On the Figure (30.3), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 5870

SuperHyperHamiltonian-Cycle-Neighbor, is up. The Neutrosophic Algorithm is Neutrosophicly 5871

straightforward. 5872

C(N SHG)Neutrosophic Hamiltonian-Cycle-Neighbor

= {E4 }.
C(N SHG)Neutrosophic Hamiltonian-Cycle-Neighbor SuperHyperPolynomial
= z3.
C(N SHG)Neutrosophic V-Hamiltonian-Cycle-Neighbor
= {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-Cycle-Neighbor in the Neutrosophic Example (42.0.3) 136NSHG2

C(N SHG)Neutrosophic V-Hamiltonian-Cycle-Neighbor SuperHyperPolynomial

= z8 + z4 + z3.

5873

• On the Figure (30.4), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 5874

SuperHyperHamiltonian-Cycle-Neighbor, is up. The Neutrosophic Algorithm is Neutrosophicly 5875
straightforward. 5876

C(N SHG)Neutrosophic Hamiltonian-Cycle-Neighbor

= {}.
C(N SHG)Neutrosophic Hamiltonian-Cycle-Neighbor SuperHyperPolynomial
= 0z 0 .
C(N SHG)Neutrosophic V-Hamiltonian-Cycle-Neighbor
= {}.
C(N SHG)Neutrosophic V-Hamiltonian-Cycle-Neighbor SuperHyperPolynomial
= 0z 0 .

5877

• On the Figure (30.5), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 5878

SuperHyperHamiltonian-Cycle-Neighbor, is up. The Neutrosophic Algorithm is Neutrosophicly 5879

Henry Garrett · 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-Cycle-Neighbor in the Neutrosophic Example (42.0.3) 136NSHG3

Figure 30.4: The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of

Neutrosophic SuperHyperHamiltonian-Cycle-Neighbor 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-Cycle-Neighbor in the Neutrosophic Example (42.0.3) 136NSHG5

straightforward. 5880

C(N SHG)Neutrosophic Hamiltonian-Cycle-Neighbor

= {}.
C(N SHG)Neutrosophic Hamiltonian-Cycle-Neighbor SuperHyperPolynomial
= 0z 0 .
C(N SHG)Neutrosophic V-Hamiltonian-Cycle-Neighbor
= {}.
C(N SHG)Neutrosophic V-Hamiltonian-Cycle-Neighbor SuperHyperPolynomial
= 0z 0 .

5881

• On the Figure (30.6), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 5882

SuperHyperHamiltonian-Cycle-Neighbor, is up. The Neutrosophic Algorithm is Neutrosophicly 5883
straightforward. 5884

C(N SHG)Neutrosophic Hamiltonian-Cycle-Neighbor

= {}.
C(N SHG)Neutrosophic Hamiltonian-Cycle-Neighbor SuperHyperPolynomial
= 0z 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

Figure 30.6: The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of

Neutrosophic SuperHyperHamiltonian-Cycle-Neighbor in the Neutrosophic Example (42.0.3) 136NSHG6

C(N SHG)Neutrosophic V-Hamiltonian-Cycle-Neighbor

= {}.
C(N SHG)Neutrosophic V-Hamiltonian-Cycle-Neighbor SuperHyperPolynomial
= 0z 0 .

5885

• On the Figure (30.7), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 5886

SuperHyperHamiltonian-Cycle-Neighbor, is up. The Neutrosophic Algorithm is Neutrosophicly 5887
straightforward. 5888

C(N SHG)Neutrosophic Hamiltonian-Cycle-Neighbor

= {}.
C(N SHG)Neutrosophic Hamiltonian-Cycle-Neighbor SuperHyperPolynomial
= 0z 0 .
C(N SHG)Neutrosophic V-Hamiltonian-Cycle-Neighbor
= {}.
C(N SHG)Neutrosophic V-Hamiltonian-Cycle-Neighbor SuperHyperPolynomial
= 0z 0 .

5889

Henry Garrett · 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-Cycle-Neighbor in the Neutrosophic Example (42.0.3) 136NSHG7

• On the Figure (30.8), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 5890

SuperHyperHamiltonian-Cycle-Neighbor, is up. The Neutrosophic Algorithm is Neutrosophicly 5891
straightforward. 5892

C(N SHG)Neutrosophic Hamiltonian-Cycle-Neighbor

= {}.
C(N SHG)Neutrosophic Hamiltonian-Cycle-Neighbor SuperHyperPolynomial
= 0z 0 .
C(N SHG)Neutrosophic V-Hamiltonian-Cycle-Neighbor
= {}.
C(N SHG)Neutrosophic V-Hamiltonian-Cycle-Neighbor SuperHyperPolynomial
= 0z 0 .

5893

• On the Figure (30.9), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 5894

SuperHyperHamiltonian-Cycle-Neighbor, is up. The Neutrosophic Algorithm is Neutrosophicly 5895
straightforward. 5896

C(N SHG)Neutrosophic Hamiltonian-Cycle-Neighbor

= {}.
C(N SHG)Neutrosophic Hamiltonian-Cycle-Neighbor 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-Cycle-Neighbor in the Neutrosophic Example (42.0.3) 136NSHG8

= 0z 0 .
C(N SHG)Neutrosophic V-Hamiltonian-Cycle-Neighbor
= {}.
C(N SHG)Neutrosophic V-Hamiltonian-Cycle-Neighbor SuperHyperPolynomial
= 0z 0 .
5897

• On the Figure (30.10), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 5898

SuperHyperHamiltonian-Cycle-Neighbor, is up. The Neutrosophic Algorithm is Neutrosophicly 5899

straightforward. 5900

C(N SHG)Neutrosophic Hamiltonian-Cycle-Neighbor

= {}.
C(N SHG)Neutrosophic Hamiltonian-Cycle-Neighbor SuperHyperPolynomial
= 0z 0 .
C(N SHG)Neutrosophic V-Hamiltonian-Cycle-Neighbor
= {}.
C(N SHG)Neutrosophic V-Hamiltonian-Cycle-Neighbor SuperHyperPolynomial
= 0z 0 .
5901

Henry Garrett · 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-Cycle-Neighbor in the Neutrosophic Example (42.0.3) 136NSHG9

Figure 30.10: The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of

Neutrosophic SuperHyperHamiltonian-Cycle-Neighbor 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-Cycle-Neighbor in the Neutrosophic Example (42.0.3) 136NSHG11

• On the Figure (30.11), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 5902

SuperHyperHamiltonian-Cycle-Neighbor, is up. The Neutrosophic Algorithm is Neutrosophicly 5903
straightforward. 5904

C(N SHG)Neutrosophic Hamiltonian-Cycle-Neighbor

= {}.
C(N SHG)Neutrosophic Hamiltonian-Cycle-Neighbor SuperHyperPolynomial
= 0z 0 .
C(N SHG)Neutrosophic V-Hamiltonian-Cycle-Neighbor
= {}.
C(N SHG)Neutrosophic V-Hamiltonian-Cycle-Neighbor SuperHyperPolynomial
= 0z 0 .
5905

• On the Figure (30.12), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 5906

SuperHyperHamiltonian-Cycle-Neighbor, is up. The Neutrosophic Algorithm is Neutrosophicly 5907
straightforward. 5908

C(N SHG)Neutrosophic Hamiltonian-Cycle-Neighbor

= {}.
C(N SHG)Neutrosophic Hamiltonian-Cycle-Neighbor 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.12: The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of

Neutrosophic SuperHyperHamiltonian-Cycle-Neighbor in the Neutrosophic Example (42.0.3) 136NSHG12

= 0z 0 .
C(N SHG)Neutrosophic V-Hamiltonian-Cycle-Neighbor
= {}.
C(N SHG)Neutrosophic V-Hamiltonian-Cycle-Neighbor SuperHyperPolynomial
= 0z 0 .
5909

• On the Figure (30.13), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 5910

SuperHyperHamiltonian-Cycle-Neighbor, is up. The Neutrosophic Algorithm is Neutrosophicly 5911

straightforward. 5912

C(N SHG)Neutrosophic Hamiltonian-Cycle-Neighbor

= {}.
C(N SHG)Neutrosophic Hamiltonian-Cycle-Neighbor SuperHyperPolynomial
= 0z 0 .
C(N SHG)Neutrosophic V-Hamiltonian-Cycle-Neighbor
= {}.
C(N SHG)Neutrosophic V-Hamiltonian-Cycle-Neighbor SuperHyperPolynomial
= 0z 0 .
5913

Henry Garrett · 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-Cycle-Neighbor in the Neutrosophic Example (42.0.3) 136NSHG13

• On the Figure (30.14), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 5914

SuperHyperHamiltonian-Cycle-Neighbor, is up. The Neutrosophic Algorithm is Neutrosophicly 5915
straightforward. 5916

C(N SHG)Neutrosophic Hamiltonian-Cycle-Neighbor

= {}.
C(N SHG)Neutrosophic Hamiltonian-Cycle-Neighbor SuperHyperPolynomial
= 0z 0 .
C(N SHG)Neutrosophic V-Hamiltonian-Cycle-Neighbor
= {}.
C(N SHG)Neutrosophic V-Hamiltonian-Cycle-Neighbor SuperHyperPolynomial
= 0z 0 .

5917

• On the Figure (30.15), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 5918

SuperHyperHamiltonian-Cycle-Neighbor, is up. The Neutrosophic Algorithm is Neutrosophicly 5919

straightforward. 5920

C(N SHG)Neutrosophic Hamiltonian-Cycle-Neighbor

= {}.
C(N SHG)Neutrosophic Hamiltonian-Cycle-Neighbor 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.14: The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of

Neutrosophic SuperHyperHamiltonian-Cycle-Neighbor in the Neutrosophic Example (42.0.3) 136NSHG14

= 0z 0 .
C(N SHG)Neutrosophic V-Hamiltonian-Cycle-Neighbor
= {}.
C(N SHG)Neutrosophic V-Hamiltonian-Cycle-Neighbor SuperHyperPolynomial
= 0z 0 .

5921

• On the Figure (30.16), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 5922

SuperHyperHamiltonian-Cycle-Neighbor, is up. The Neutrosophic Algorithm is Neutrosophicly 5923
straightforward. 5924

C(N SHG)Neutrosophic Hamiltonian-Cycle-Neighbor

= {}.
C(N SHG)Neutrosophic Hamiltonian-Cycle-Neighbor 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.15: The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of

Neutrosophic SuperHyperHamiltonian-Cycle-Neighbor in the Neutrosophic Example (42.0.3) 136NSHG15

= 0z 0 .
C(N SHG)Neutrosophic V-Hamiltonian-Cycle-Neighbor
= {}.
C(N SHG)Neutrosophic V-Hamiltonian-Cycle-Neighbor SuperHyperPolynomial
= 0z 0 .

5925

• On the Figure (30.17), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 5926

SuperHyperHamiltonian-Cycle-Neighbor, is up. The Neutrosophic Algorithm is Neutrosophicly 5927
straightforward. 5928

C(N SHG)Neutrosophic Hamiltonian-Cycle-Neighbor

= {}.
C(N SHG)Neutrosophic Hamiltonian-Cycle-Neighbor SuperHyperPolynomial
= 0z 0 .
C(N SHG)Neutrosophic V-Hamiltonian-Cycle-Neighbor
= {}.
C(N SHG)Neutrosophic V-Hamiltonian-Cycle-Neighbor SuperHyperPolynomial
= 0z 0 .

5929

Henry Garrett · 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-Cycle-Neighbor in the Neutrosophic Example (42.0.3) 136NSHG16

Figure 30.17: The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of

Neutrosophic SuperHyperHamiltonian-Cycle-Neighbor in the Neutrosophic 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 30.18: The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of

Neutrosophic SuperHyperHamiltonian-Cycle-Neighbor in the Neutrosophic Example (42.0.3) 136NSHG18

• On the Figure (30.18), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 5930

SuperHyperHamiltonian-Cycle-Neighbor, is up. The Neutrosophic Algorithm is Neutrosophicly 5931
straightforward. 5932

C(N SHG)Neutrosophic Hamiltonian-Cycle-Neighbor

= {}.
C(N SHG)Neutrosophic Hamiltonian-Cycle-Neighbor SuperHyperPolynomial
= 0z 0 .
C(N SHG)Neutrosophic V-Hamiltonian-Cycle-Neighbor
= {}.
C(N SHG)Neutrosophic V-Hamiltonian-Cycle-Neighbor SuperHyperPolynomial
= 0z 0 .

5933

• On the Figure (30.19), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 5934

SuperHyperHamiltonian-Cycle-Neighbor, is up. The Neutrosophic Algorithm is Neutrosophicly 5935

straightforward. 5936

C(N SHG)Neutrosophic Hamiltonian-Cycle-Neighbor

= {}.

Henry Garrett · 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-Cycle-Neighbor in the Neutrosophic Example (42.0.3) 136NSHG19

C(N SHG)Neutrosophic Hamiltonian-Cycle-Neighbor SuperHyperPolynomial

= 0z 0 .
C(N SHG)Neutrosophic V-Hamiltonian-Cycle-Neighbor
= {}.
C(N SHG)Neutrosophic V-Hamiltonian-Cycle-Neighbor SuperHyperPolynomial
= 0z 0 .

5937

• On the Figure (30.20), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 5938

SuperHyperHamiltonian-Cycle-Neighbor, is up. The Neutrosophic Algorithm is Neutrosophicly 5939
straightforward. 5940

C(N SHG)Neutrosophic Hamiltonian-Cycle-Neighbor

= {}.
C(N SHG)Neutrosophic Hamiltonian-Cycle-Neighbor SuperHyperPolynomial
= 0z 0 .
C(N SHG)Neutrosophic V-Hamiltonian-Cycle-Neighbor
= {}.
C(N SHG)Neutrosophic V-Hamiltonian-Cycle-Neighbor 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-Cycle-Neighbor in the Neutrosophic Example (42.0.3) 136NSHG20

= 0z 0 .

5941

• On the Figure (30.21), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 5942

SuperHyperHamiltonian-Cycle-Neighbor, is up. The Neutrosophic Algorithm is Neutrosophicly 5943
straightforward. 5944

C(N SHG)Neutrosophic Hamiltonian-Cycle-Neighbor

= {E1 , E2 }.
C(N SHG)Neutrosophic Hamiltonian-Cycle-Neighbor SuperHyperPolynomial
= z 10 + z 2 .
C(N SHG)Neutrosophic V-Hamiltonian-Cycle-Neighbor
= {VE2 }.
C(N SHG)Neutrosophic V-Hamiltonian-Cycle-Neighbor SuperHyperPolynomial
= z 5 + 2z 3 + 7z.

5945

• On the Figure (30.22), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 5946

SuperHyperHamiltonian-Cycle-Neighbor, is up. The Neutrosophic Algorithm is Neutrosophicly 5947

Henry Garrett · 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-Cycle-Neighbor in the Neutrosophic Example (42.0.3) 95NHG1

straightforward. 5948

C(N SHG)Neutrosophic Hamiltonian-Cycle-Neighbor

= {}.
C(N SHG)Neutrosophic Hamiltonian-Cycle-Neighbor SuperHyperPolynomial
= 0z 0 .
C(N SHG)Neutrosophic V-Hamiltonian-Cycle-Neighbor
= {}.
C(N SHG)Neutrosophic V-Hamiltonian-Cycle-Neighbor SuperHyperPolynomial
= 0z 0 .

5949

Proposition 30.0.21. Assume a connected Neutrosophic SuperHyperGraph ESHG : (V, E). The 5950

all interior Neutrosophic SuperHyperVertices belong to any Neutrosophic quasi-R-Hamiltonian-Cycle- 5951

Henry Garrett · 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-Cycle-Neighbor in the Neutrosophic Example (42.0.3) 95NHG2

Neighbor if for any of them, and any of other corresponded Neutrosophic SuperHyperVertex, some 5952
interior Neutrosophic SuperHyperVertices are mutually Neutrosophic SuperHyperNeighbors with 5953

no Neutrosophic exception at all minus all Neutrosophic SuperHypeNeighbors to any amount of 5954
them. 5955

Proposition 30.0.22. Assume a connected non-obvious Neutrosophic SuperHyperGraph ESHG : 5956

(V, E). There’s only one Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) has only the maximum 5957
possibilities of the distinct interior Neutrosophic SuperHyperVertices inside of any given 5958
Neutrosophic quasi-R-Hamiltonian-Cycle-Neighbor minus all Neutrosophic SuperHypeNeighbor to some 5959
of them but not all of them. In other words, there’s only an unique Neutrosophic SuperHyperEdge 5960
E ∈ EESHG:(V,E) has only two distinct Neutrosophic SuperHyperVertices in an Neutrosophic 5961
quasi-R-Hamiltonian-Cycle-Neighbor, minus all Neutrosophic SuperHypeNeighbor to some of them but 5962

not all of them. 5963

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-Cycle-Neighbor is at least
V \ (V \ {aE , bE , cE , . . . , zE }).
It’s straightforward that the Neutrosophic cardinality of the Neutrosophic R-Hamiltonian-Cycle- 5964
Neighbor is at least the maximum Neutrosophic number of Neutrosophic SuperHyperVertices 5965
of the Neutrosophic SuperHyperEdges with the maximum number of the Neutrosophic 5966
SuperHyperEdges. In other words, the maximum number of the Neutrosophic SuperHyperEdges 5967

contains the maximum Neutrosophic number of Neutrosophic SuperHyperVertices are renamed to 5968

Henry Garrett · 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 Hamiltonian-Cycle-Neighbor in some cases but the maximum number of the Neutrosophic 5969
SuperHyperEdge with the maximum Neutrosophic number of Neutrosophic SuperHyperVertices, 5970
has the Neutrosophic SuperHyperVertices are contained in a Neutrosophic R-Hamiltonian-Cycle- 5971
Neighbor. 5972

Proposition 30.0.24. Assume a simple Neutrosophic SuperHyperGraph ESHG : (V, E). Then
the Neutrosophic number of type-result-R-Hamiltonian-Cycle-Neighbor has, the least Neutrosophic
cardinality, the lower sharp Neutrosophic bound for Neutrosophic cardinality, is the Neutrosophic
cardinality of
V \ V \ {aE , bE 0 , cE 00 , cE 000 }E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .

If there’s a Neutrosophic type-result-R-Hamiltonian-Cycle-Neighbor with the least Neutrosophic cardin- 5973

ality, the lower sharp Neutrosophic bound for cardinality. 5974

Proposition 30.0.25. Assume a connected loopless Neutrosophic SuperHyperGraph ESHG : 5975

(V, E). Then in the worst case, literally, 5976

C(N SHG)N eutrosophicQuasi−Hamiltonian−Cycle−N eighbor = {V1 , E1 , V2 , E2 , V3 , E3 , V4 , E4 , V1 }.

C(N SHG)N eutrosophicQuasi−Hamiltonian−Cycle−N eighborSuperHyperP olynomial = z 4 .
C(N SHG)N eutrosophicQuasi−Hamiltonian−Cycle−N eighbor = {V1 , V2 , V3 , V4 , V1 }.
C(N SHG)N eutrosophicR−Quasi−Hamiltonian−Cycle−N eighborSuperHyperP olynomial = z 5 .
Is a Neutrosophic type-result-Hamiltonian-Cycle-Neighbor. In other words, the least cardinality, the 5977
lower sharp bound for the cardinality, of a Neutrosophic type-result-Hamiltonian-Cycle-Neighbor is the 5978

cardinality of 5979

C(N SHG)N eutrosophicQuasi−Hamiltonian−Cycle−N eighbor = {V1 , E1 , V2 , E2 , V3 , E3 , V4 , E4 , V1 }.

C(N SHG)N eutrosophicQuasi−Hamiltonian−Cycle−N eighborSuperHyperP olynomial = z 4 .
C(N SHG)N eutrosophicQuasi−Hamiltonian−Cycle−N eighbor = {V1 , V2 , V3 , V4 , V1 }.
C(N SHG)N eutrosophicR−Quasi−Hamiltonian−Cycle−N eighborSuperHyperP olynomial = z 5 .
Proof. Assume a connected loopless Neutrosophic SuperHyperGraph ESHG : (V, E). The
SuperHyperSet of the SuperHyperVertices V \ V \ {z} isn’t a quasi-R-Hamiltonian-Cycle-Neighbor
since neither amount of Neutrosophic SuperHyperEdges nor amount of SuperHyperVertices
where amount refers to the Neutrosophic number of SuperHyperVertices(-/SuperHyperEdges)
more than one to form any kind of SuperHyperEdges or any number of SuperHyperEdges. Let
us consider the Neutrosophic SuperHyperSet
V \ V \ {aE , bE , cE , . . . , aE 0 , bE 0 , cE 0 , . . .}E,E 0 ={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .

This Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices has the eligibilities

to propose property such that there’s no Neutrosophic SuperHyperVertex of a Neutrosophic
SuperHyperEdge is common and there’s an Neutrosophic SuperHyperEdge for all Neutrosophic
SuperHyperVertices but the maximum Neutrosophic cardinality indicates that these Neutro-
sophic type-SuperHyperSets couldn’t give us the Neutrosophic lower bound in the term of
Neutrosophic sharpness. In other words, the Neutrosophic SuperHyperSet
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 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-Cycle-Neighbor. In other words, the least cardinality, the lower sharp bound
for the cardinality, of a quasi-R-Hamiltonian-Cycle-Neighbor 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-Cycle-Neighbor. It’s the contradiction
to that fact on the generality. There are some counterexamples to deny this statement. One of
them comes from the setting of the graph titled path and cycle as the counterexamples-classes or
reversely direction star as the examples-classes, are well-known classes in that setting and they
could be considered as the examples-classes and counterexamples-classes for the tight bound of

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-Cycle-Neighbor decorates the Neut-
rosophic SuperHyperVertices don’t have received any Neutrosophic connections so as this
Neutrosophic style implies different versions of Neutrosophic SuperHyperEdges with the max-
imum Neutrosophic cardinality in the terms of Neutrosophic SuperHyperVertices are spotlight.
The lower Neutrosophic bound is to have the maximum Neutrosophic groups of Neutrosophic
SuperHyperVertices have perfect Neutrosophic connections inside each of SuperHyperEdges and
the outside of this Neutrosophic SuperHyperSet doesn’t matter but regarding the connectedness
of the used Neutrosophic SuperHyperGraph arising from its Neutrosophic properties taken from
the fact that it’s simple. If there’s no more than one Neutrosophic SuperHyperVertex in the
targeted Neutrosophic SuperHyperSet, then there’s no Neutrosophic connection. Furthermore,
the Neutrosophic existence of one Neutrosophic SuperHyperVertex has no Neutrosophic effect
to talk about the Neutrosophic R-Hamiltonian-Cycle-Neighbor. Since at least two Neutrosophic Su-
perHyperVertices involve to make a title in the Neutrosophic background of the 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

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 Neut-
rosophic 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-Cycle-Neighbor has
the Neutrosophic cardinality of a Neutrosophic SuperHyperEdge. Thus, a Neutrosophic R-
Hamiltonian-Cycle-Neighbor has the Neutrosophic cardinality at least a Neutrosophic SuperHyperEdge.
Assume a Neutrosophic SuperHyperSet V \ V \ {z}. This Neutrosophic SuperHyperSet isn’t
a Neutrosophic R-Hamiltonian-Cycle-Neighbor since either the Neutrosophic SuperHyperGraph is an
obvious Neutrosophic SuperHyperModel thus it never happens since there’s no Neutrosophic
usage of this Neutrosophic framework and even more there’s no Neutrosophic connection inside
or the Neutrosophic SuperHyperGraph isn’t obvious and as its consequences, there’s a Neutro-
sophic contradiction with the term “Neutrosophic R-Hamiltonian-Cycle-Neighbor” since the maximum
Neutrosophic cardinality never happens for this Neutrosophic style of the Neutrosophic Supe-
rHyperSet 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-Cycle-Neighbor is the Neutrosophic SuperHyperSet of the
Neutrosophic SuperHyperVertices such that some Neutrosophic amount of the Neutrosophic
SuperHyperVertices are on-quasi-triangle Neutrosophic style. The Neutrosophic cardinality of
the v SuperHypeSet
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
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

Henry Garrett · 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 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-Cycle-Neighbor for the Neutrosophic SuperHyperGraph as used

Neutrosophic background in the Neutrosophic terms of worst Neutrosophic case and the common
theme of the lower Neutrosophic bound occurred in the specific Neutrosophic SuperHyperClasses
of the Neutrosophic SuperHyperGraphs which are Neutrosophic free-quasi-triangle.
Assume a Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) has z Neutrosophic number of
the Neutrosophic SuperHyperVertices. Then every Neutrosophic SuperHyperVertex has at
least no Neutrosophic SuperHyperEdge with others in common. Thus those Neutrosophic
SuperHyperVertices have the eligibles to be contained in a Neutrosophic R-Hamiltonian-Cycle-
Neighbor. Those Neutrosophic SuperHyperVertices are potentially included in a Neutrosophic
style-R-Hamiltonian-Cycle-Neighbor. Formally, consider

V \ (V \ {aE , bE , cE , . . . , zE }).

Are the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) .

Thus
Zi ∼ Zj , i 6= j, i, j = 1, 2, . . . , z.
where the ∼ isn’t an equivalence relation but only the symmetric relation on the Neutrosophic
SuperHyperVertices of the Neutrosophic SuperHyperGraph. The formal definition is as follows.

Zi ∼ Zj , i 6= j, i, j = 1, 2, . . . , z

if and only if Zi and Zj are the Neutrosophic SuperHyperVertices and there’s only and only one
Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) between the Neutrosophic SuperHyperVertices
Zi and Zj . The other definition for the Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) in the
terms of Neutrosophic R-Hamiltonian-Cycle-Neighbor is

{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

This definition coincides with the definition of the Neutrosophic R-Hamiltonian-Cycle-Neighbor but
with slightly differences in the maximum Neutrosophic cardinality amid those Neutrosophic type-
SuperHyperSets of the Neutrosophic SuperHyperVertices. Thus the Neutrosophic SuperHyperSet
of the Neutrosophic SuperHyperVertices,

max |{Z1 , Z2 , . . . , Zz | Zi ∼ Zj , i 6= j, i, j = 1, 2, . . . , z}|Neutrosophic cardinality ,

z

and
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-Cycle-Neighbor. Let

E
Zi ∼ Zj , be defined as Zi and Zj are the Neutrosophic SuperHyperVertices belong to the
Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) . Thus,

E
E = {Z1 , Z2 , . . . , Zz | Zi ∼ Zj , i 6= j, i, j = 1, 2, . . . , z}.

Or
{aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .

But with the slightly differences, 5980

Neutrosophic R-Hamiltonian-Cycle-Neighbor =
E
{Z1 , Z2 , . . . , Zz | ∀i 6= j, i, j = 1, 2, . . . , z, ∃Ex , Zi ∼x Zj , }.
5981

Neutrosophic R-Hamiltonian-Cycle-Neighbor =
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-Cycle-Neighbor where E ∈ EESHG:(V,E)

is fixed that means Ex = E ∈ EESHG:(V,E) . for all Neutrosophic intended SuperHyperVertices
but in a Neutrosophic Hamiltonian-Cycle-Neighbor, Ex = E ∈ EESHG:(V,E) could be different and it’s
not unique. To sum them up, in a connected Neutrosophic SuperHyperGraph ESHG : (V, E).
If a Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) has z Neutrosophic SuperHyperVertices,
then the Neutrosophic cardinality of the Neutrosophic R-Hamiltonian-Cycle-Neighbor is at least

V \ (V \ {aE , bE , cE , . . . , zE }).

It’s straightforward that the Neutrosophic cardinality of the Neutrosophic R-Hamiltonian-Cycle- 5982
Neighbor is at least the maximum Neutrosophic number of Neutrosophic SuperHyperVertices of 5983
the Neutrosophic SuperHyperEdges with the maximum number of the Neutrosophic SuperHy- 5984

perEdges. In other words, the maximum number of the Neutrosophic SuperHyperEdges contains 5985
the maximum Neutrosophic number of Neutrosophic SuperHyperVertices are renamed to Neut- 5986
rosophic Hamiltonian-Cycle-Neighbor in some cases but the maximum number of the Neutrosophic 5987
SuperHyperEdge with the maximum Neutrosophic number of Neutrosophic SuperHyperVertices, 5988
has the Neutrosophic SuperHyperVertices are contained in a Neutrosophic R-Hamiltonian-Cycle- 5989
Neighbor. 5990

The obvious SuperHyperGraph has no Neutrosophic SuperHyperEdges. But the non-obvious 5991

Henry Garrett · 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 SuperHyperModel is up. The quasi-SuperHyperModel addresses some issues 5992

about the Neutrosophic optimal SuperHyperObject. It specially delivers some remarks on 5993
the Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices such that there’s 5994
distinct amount of Neutrosophic SuperHyperEdges for distinct amount of Neutrosophic Supe- 5995
rHyperVertices up to all taken from that Neutrosophic SuperHyperSet of the Neutrosophic 5996
SuperHyperVertices but this Neutrosophic SuperHyperSet of the Neutrosophic SuperHyper- 5997

Vertices is either has the maximum Neutrosophic SuperHyperCardinality or it doesn’t have 5998
maximum Neutrosophic SuperHyperCardinality. In a non-obvious SuperHyperModel, there’s 5999
at least one Neutrosophic SuperHyperEdge containing at least all Neutrosophic SuperHyper- 6000
Vertices. Thus it forms a Neutrosophic quasi-R-Hamiltonian-Cycle-Neighbor where the Neutrosophic 6001
completion of the Neutrosophic incidence is up in that. Thus it’s, literarily, a Neutrosophic 6002
embedded R-Hamiltonian-Cycle-Neighbor. The SuperHyperNotions of embedded SuperHyperSet and 6003

quasi-SuperHyperSet coincide. In the original setting, these types of SuperHyperSets only don’t 6004
satisfy on the maximum SuperHyperCardinality. Thus the embedded setting is elected such that 6005
those SuperHyperSets have the maximum Neutrosophic SuperHyperCardinality and they’re 6006
Neutrosophic SuperHyperOptimal. The less than two distinct types of Neutrosophic SuperHy- 6007
perVertices are included in the minimum Neutrosophic style of the embedded Neutrosophic 6008
R-Hamiltonian-Cycle-Neighbor. The interior types of the Neutrosophic SuperHyperVertices are de- 6009

ciders. Since the Neutrosophic number of SuperHyperNeighbors are only affected by the interior 6010
Neutrosophic SuperHyperVertices. The common connections, more precise and more formal, 6011
the perfect unique connections inside the Neutrosophic SuperHyperSet for any distinct types of 6012
Neutrosophic SuperHyperVertices pose the Neutrosophic R-Hamiltonian-Cycle-Neighbor. Thus Neut- 6013
rosophic exterior SuperHyperVertices could be used only in one Neutrosophic SuperHyperEdge 6014
and in Neutrosophic SuperHyperRelation with the interior Neutrosophic SuperHyperVertices 6015

in that Neutrosophic SuperHyperEdge. In the embedded Neutrosophic Hamiltonian-Cycle-Neighbor, 6016

there’s the usage of exterior Neutrosophic SuperHyperVertices since they’ve more connections 6017
inside more than outside. Thus the title “exterior” is more relevant than the title “interior”. One 6018
Neutrosophic SuperHyperVertex has no connection, inside. Thus, the Neutrosophic SuperHy- 6019
perSet of the Neutrosophic SuperHyperVertices with one SuperHyperElement has been ignored 6020
in the exploring to lead on the optimal case implying the Neutrosophic R-Hamiltonian-Cycle-Neighbor. 6021

The Neutrosophic R-Hamiltonian-Cycle-Neighbor with the exclusion of the exclusion of all Neutro- 6022
sophic SuperHyperVertices in one Neutrosophic SuperHyperEdge and with other terms, the 6023
Neutrosophic R-Hamiltonian-Cycle-Neighbor with the inclusion of all Neutrosophic SuperHyperVertices 6024
in one Neutrosophic SuperHyperEdge, is a Neutrosophic quasi-R-Hamiltonian-Cycle-Neighbor. To sum 6025
them up, in a connected non-obvious Neutrosophic SuperHyperGraph ESHG : (V, E). There’s 6026

only one Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) has only the maximum possibilities 6027
of the distinct interior Neutrosophic SuperHyperVertices inside of any given Neutrosophic 6028
quasi-R-Hamiltonian-Cycle-Neighbor minus all Neutrosophic SuperHypeNeighbor to some of them 6029
but not all of them. In other words, there’s only an unique Neutrosophic SuperHyperEdge 6030
E ∈ EESHG:(V,E) has only two distinct Neutrosophic SuperHyperVertices in an Neutrosophic 6031
quasi-R-Hamiltonian-Cycle-Neighbor, minus all Neutrosophic SuperHypeNeighbor to some of them but 6032

not all of them. 6033

The main definition of the Neutrosophic R-Hamiltonian-Cycle-Neighbor has two titles. a Neutro- 6034
sophic quasi-R-Hamiltonian-Cycle-Neighbor and its corresponded quasi-maximum Neutrosophic R- 6035
SuperHyperCardinality are two titles in the terms of quasi-R-styles. For any Neutrosophic 6036
number, there’s a Neutrosophic quasi-R-Hamiltonian-Cycle-Neighbor with that quasi-maximum Neut- 6037

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics ·
DrHenryGarrett@gmail.com · Manhattan, NY, USA

rosophic SuperHyperCardinality in the terms of the embedded Neutrosophic SuperHyper- 6038

Graph. If there’s an embedded Neutrosophic SuperHyperGraph, then the Neutrosophic quasi- 6039
SuperHyperNotions lead us to take the collection of all the Neutrosophic quasi-R-Hamiltonian-Cycle- 6040
Neighbors for all Neutrosophic numbers less than its Neutrosophic corresponded maximum number. 6041
The essence of the Neutrosophic Hamiltonian-Cycle-Neighbor ends up but this essence starts up in the 6042
terms of the Neutrosophic quasi-R-Hamiltonian-Cycle-Neighbor, again and more in the operations of 6043

collecting all the Neutrosophic quasi-R-Hamiltonian-Cycle-Neighbors acted on the all possible used 6044
formations of the Neutrosophic SuperHyperGraph to achieve one Neutrosophic number. This 6045
Neutrosophic number is 6046
considered as the equivalence class for all corresponded quasi-R-Hamiltonian-Cycle-Neighbors. Let 6047
zNeutrosophic Number , SNeutrosophic SuperHyperSet and GNeutrosophic Hamiltonian-Cycle-Neighbor be a Neut- 6048
rosophic number, a Neutrosophic SuperHyperSet and a Neutrosophic Hamiltonian-Cycle-Neighbor. 6049

Then 6050

[zNeutrosophic Number ]Neutrosophic Class = {SNeutrosophic SuperHyperSet |

SNeutrosophic SuperHyperSet = GNeutrosophic Hamiltonian-Cycle-Neighbor ,
|SNeutrosophic SuperHyperSet |Neutrosophic Cardinality
= zNeutrosophic Number }.

As its consequences, the formal definition of the Neutrosophic Hamiltonian-Cycle-Neighbor is re- 6051
formalized and redefined as follows. 6052

GNeutrosophic Hamiltonian-Cycle-Neighbor ∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class =

∪zNeutrosophic Number {SNeutrosophic SuperHyperSet |
SNeutrosophic SuperHyperSet = GNeutrosophic Hamiltonian-Cycle-Neighbor ,
|SNeutrosophic SuperHyperSet |Neutrosophic Cardinality
= zNeutrosophic Number }.

To get more precise perceptions, the follow-up expressions propose another formal technical 6053
definition for the Neutrosophic Hamiltonian-Cycle-Neighbor. 6054

GNeutrosophic Hamiltonian-Cycle-Neighbor =
{S ∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class =
∪zNeutrosophic Number {SNeutrosophic SuperHyperSet |
SNeutrosophic SuperHyperSet = GNeutrosophic Hamiltonian-Cycle-Neighbor ,
|SNeutrosophic SuperHyperSet |Neutrosophic Cardinality
= zNeutrosophic Number |
|SNeutrosophic SuperHyperSet |Neutrosophic Cardinality
= max zNeutrosophic Number }.
[zNeutrosophic Number ]Neutrosophic Class

In more concise and more convenient ways, the modified definition for the Neutrosophic 6055
poses the upcoming expressions.
Hamiltonian-Cycle-Neighbor 6056

GNeutrosophic Hamiltonian-Cycle-Neighbor =

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 Henry Garrett · Independent Researcher · Department of Mathematics ·
DrHenryGarrett@gmail.com · Manhattan, NY, USA

{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. 6057

GNeutrosophic Hamiltonian-Cycle-Neighbor =
{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, 6058

GNeutrosophic Hamiltonian-Cycle-Neighbor =
{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. 6059

GNeutrosophic Hamiltonian-Cycle-Neighbor ∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class =

∪zNeutrosophic Number {SNeutrosophic SuperHyperSet |
SNeutrosophic SuperHyperSet = GNeutrosophic Hamiltonian-Cycle-Neighbor ,
|SNeutrosophic SuperHyperSet |Neutrosophic Cardinality

= max |E| | E ∈ EESHG:(V,E) }.
6060

GNeutrosophic Hamiltonian-Cycle-Neighbor =
{S ∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class =
∪zNeutrosophic Number {SNeutrosophic SuperHyperSet |
SNeutrosophic SuperHyperSet = GNeutrosophic Hamiltonian-Cycle-Neighbor ,
|SNeutrosophic SuperHyperSet |Neutrosophic Cardinality
= zNeutrosophic Number |
|SNeutrosophic SuperHyperSet |Neutrosophic Cardinality

= max |E| | E ∈ EESHG:(V,E) }.
6061

GNeutrosophic Hamiltonian-Cycle-Neighbor =
{S ∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class |
|SNeutrosophic SuperHyperSet |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

6062

GNeutrosophic Hamiltonian-Cycle-Neighbor =
{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 6063
SuperHyperNeighborhood”, could be redefined as the collection of the Neutrosophic SuperHy- 6064
perVertices such that any amount of its Neutrosophic SuperHyperVertices are incident to a 6065
Neutrosophic SuperHyperEdge. It’s, literarily, another name for “Neutrosophic Quasi-Hamiltonian- 6066
Cycle-Neighbor” but, precisely, it’s the generalization of “Neutrosophic Quasi-Hamiltonian-Cycle-Neighbor” 6067
since “Neutrosophic Quasi-Hamiltonian-Cycle-Neighbor” happens “Neutrosophic Hamiltonian-Cycle-Neighbor” 6068
in a Neutrosophic SuperHyperGraph as initial framework and background but “Neutrosophic 6069
SuperHyperNeighborhood” may not happens “Neutrosophic Hamiltonian-Cycle-Neighbor” in a Neutro- 6070
sophic SuperHyperGraph as initial framework and preliminarily background since there are 6071
some ambiguities about the Neutrosophic SuperHyperCardinality arise from it. To get orderly 6072
keywords, the terms, “Neutrosophic SuperHyperNeighborhood”, “Neutrosophic Quasi-Hamiltonian- 6073
Cycle-Neighbor”, and “Neutrosophic Hamiltonian-Cycle-Neighbor” are up. 6074
Thus, let zNeutrosophic Number , NNeutrosophic SuperHyperNeighborhood and GNeutrosophic Hamiltonian-Cycle-Neighbor
6075
be a Neutrosophic number, a Neutrosophic SuperHyperNeighborhood and a Neutrosophic 6076
Hamiltonian-Cycle-Neighbor and the new terms are up. 6077

GNeutrosophic Hamiltonian-Cycle-Neighbor ∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class =

∪zNeutrosophic Number {NNeutrosophic SuperHyperNeighborhood |
|NNeutrosophic SuperHyperNeighborhood |Neutrosophic Cardinality
= max zNeutrosophic Number }.
[zNeutrosophic Number ]Neutrosophic Class

6078

GNeutrosophic Hamiltonian-Cycle-Neighbor =
{NNeutrosophic SuperHyperNeighborhood
∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class =
∪zNeutrosophic Number {NNeutrosophic SuperHyperNeighborhood |
|NNeutrosophic SuperHyperSet |Neutrosophic Cardinality
= zNeutrosophic Number |
|NNeutrosophic SuperHyperNeighborhood |Neutrosophic Cardinality
= max zNeutrosophic Number }.
[zNeutrosophic Number ]Neutrosophic Class

6079

GNeutrosophic Hamiltonian-Cycle-Neighbor =
{NNeutrosophic SuperHyperNeighborhood
∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class |
|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
6080

GNeutrosophic Hamiltonian-Cycle-Neighbor =
{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, 6081

GNeutrosophic Hamiltonian-Cycle-Neighbor ∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class =

∪zNeutrosophic Number {NNeutrosophic SuperHyperNeighborhood |
|NNeutrosophic SuperHyperNeighborhood |Neutrosophic Cardinality

= max |E| | E ∈ EESHG:(V,E) }.
6082

GNeutrosophic Hamiltonian-Cycle-Neighbor =
{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) }.
6083

GNeutrosophic Hamiltonian-Cycle-Neighbor =
{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) }.
6084

GNeutrosophic Hamiltonian-Cycle-Neighbor =
{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-Cycle-Neighbor if

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics ·
DrHenryGarrett@gmail.com · Manhattan, NY, USA

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-Cycle-Neighbor.

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-Cycle-Neighbor.

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-Cycle-Neighbor C(ESHG) for an Neutrosophic SuperHyper-

Graph ESHG : (V, E) is a Neutrosophic type-SuperHyperSet with

the maximum Neutrosophic cardinality of a Neutrosophic SuperHyperSet S of Neutro-

sophic SuperHyperVertices such that there’s no a Neutrosophic SuperHyperEdge amid some Neut-
rosophic SuperHyperVertices instead of all given by Neutrosophic Hamiltonian-Cycle-Neighbor 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-Cycle-Neighbor is up. The obvious
simple Neutrosophic type-SuperHyperSet called the Neutrosophic Hamiltonian-Cycle-Neighbor is a
Neutrosophic SuperHyperSet includes only one Neutrosophic SuperHyperVertex. But the
Neutrosophic SuperHyperSet of Neutrosophic SuperHyperVertices,

V \ V \ {aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .

doesn’t have less than two SuperHyperVertices inside the intended Neutrosophic SuperHyperSet
since they’ve come from at least so far an SuperHyperEdge. Thus the non-obvious simple
Neutrosophic type-SuperHyperSet of the Neutrosophic R-Hamiltonian-Cycle-Neighbor 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,
Cycle-Neighbor

(V \ V \ {x, z}) ∪ {xy}

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 Henry Garrett · Independent Researcher · Department of Mathematics ·
DrHenryGarrett@gmail.com · Manhattan, NY, USA

or
(V \ V \ {x, z}) ∪ {zy}
is an Neutrosophic R-Hamiltonian-Cycle-Neighbor C(ESHG) for an Neutrosophic SuperHyperGraph
ESHG : (V, E) is the Neutrosophic SuperHyperSet S of Neutrosophic SuperHyperVertices
such that there’s no a Neutrosophic SuperHyperEdge for some Neutrosophic SuperHyperVer-
tices instead of all given by that Neutrosophic type-SuperHyperSet called the Neutrosophic
Hamiltonian-Cycle-Neighbor and it’s an Neutrosophic Hamiltonian-Cycle-Neighbor. Since it’s

the maximum Neutrosophic cardinality of a Neutrosophic SuperHyperSet S of Neut-

rosophic SuperHyperVertices such that there’s no a Neutrosophic SuperHyperEdge for some
amount Neutrosophic SuperHyperVertices instead of all given by that Neutrosophic type-
SuperHyperSet called the Neutrosophic Hamiltonian-Cycle-Neighbor. 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-Cycle-Neighbor,

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:
Cycle-Neighbor

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- 6085
HyperGraph ESHG : (V, E) but it’s impossible in the case, they’ve corresponded to an 6086

SuperHyperEdge. It’s interesting to mention that the only non-obvious simple Neutrosophic 6087
type-SuperHyperSet called the 6088

“Neutrosophic R-Hamiltonian-Cycle-Neighbor” 6089

amid those obvious[non-obvious] simple Neutrosophic type-SuperHyperSets called the 6090

Neutrosophic R-Hamiltonian-Cycle-Neighbor, 6091

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

Henry Garrett · 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 Neutrosophic R-Hamiltonian-Cycle-Neighbor amid those obvious simple Neutrosophic type-

SuperHyperSets of the Neutrosophic Hamiltonian-Cycle-Neighbor, 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-Cycle-Neighbor. In other words, the least cardinality, the lower sharp
bound for the cardinality, of a Neutrosophic R-Hamiltonian-Cycle-Neighbor is the cardinality of

V \ V \ {aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .

6092
To sum them up, in a connected Neutrosophic SuperHyperGraph ESHG : (V, E). The all 6093
interior Neutrosophic SuperHyperVertices belong to any Neutrosophic quasi-R-Hamiltonian-Cycle- 6094
Neighbor if for any of them, and any of other corresponded Neutrosophic SuperHyperVertex, some 6095
interior Neutrosophic SuperHyperVertices are mutually Neutrosophic SuperHyperNeighbors 6096
with no Neutrosophic exception at all minus all Neutrosophic SuperHypeNeighbors to any 6097

amount of them. 6098

Assume a connected Neutrosophic SuperHyperGraph ESHG : (V, E). Let a Neutrosophic Supe- 6099
rHyperEdge ESHE : E ∈ EESHG:(V,E) has some Neutrosophic SuperHyperVertices r. Consider 6100
all Neutrosophic numbers of those Neutrosophic SuperHyperVertices from that Neutrosophic 6101
SuperHyperEdge excluding excluding more than r distinct Neutrosophic SuperHyperVertices, 6102
exclude to any given Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices. 6103

Consider there’s a Neutrosophic R-Hamiltonian-Cycle-Neighbor with the least cardinality, the lower 6104
sharp Neutrosophic bound for Neutrosophic cardinality. Assume a connected Neutrosophic 6105
SuperHyperGraph ESHG : (V, E). The Neutrosophic SuperHyperSet of the Neutrosophic 6106
SuperHyperVertices VESHE \ {z} is a Neutrosophic SuperHyperSet S of the Neutrosophic 6107
SuperHyperVertices such that there’s a Neutrosophic SuperHyperEdge to have some Neutro- 6108
sophic SuperHyperVertices uniquely but it isn’t a Neutrosophic R-Hamiltonian-Cycle-Neighbor. Since 6109

it doesn’t have 6110

6111
the maximum Neutrosophic cardinality of a Neutrosophic SuperHyperSet S of Neut- 6112
rosophic SuperHyperVertices such that there’s a Neutrosophic SuperHyperEdge to have some 6113
SuperHyperVertices uniquely. The Neutrosophic SuperHyperSet of the Neutrosophic Supe- 6114
rHyperVertices VESHE ∪ {z} is the maximum Neutrosophic cardinality of a Neutrosophic 6115

SuperHyperSet S of Neutrosophic SuperHyperVertices but it isn’t a Neutrosophic R-Hamiltonian- 6116

Cycle-Neighbor. Since it doesn’t do the Neutrosophic procedure such that such that there’s a 6117
Neutrosophic SuperHyperEdge to have some Neutrosophic SuperHyperVertices uniquely [there 6118
are at least one Neutrosophic SuperHyperVertex outside implying there’s, sometimes in the 6119
connected Neutrosophic SuperHyperGraph ESHG : (V, E), a Neutrosophic SuperHyperVer- 6120
tex, titled its Neutrosophic SuperHyperNeighbor, to that Neutrosophic SuperHyperVertex 6121

in the Neutrosophic SuperHyperSet S so as S doesn’t do “the Neutrosophic procedure”.]. 6122

Henry Garrett · 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’s only one Neutrosophic SuperHyperVertex outside the intended Neutrosophic Super- 6123
HyperSet, VESHE ∪ {z}, in the terms of Neutrosophic SuperHyperNeighborhood. Thus the 6124
obvious Neutrosophic R-Hamiltonian-Cycle-Neighbor, VESHE is up. The obvious simple Neutrosophic 6125
type-SuperHyperSet of the Neutrosophic R-Hamiltonian-Cycle-Neighbor, VESHE , is a Neutrosophic Su- 6126
perHyperSet, VESHE , includes only all Neutrosophic SuperHyperVertices does forms any kind 6127
of Neutrosophic pairs are titled Neutrosophic SuperHyperNeighbors in a connected Neutrosophic 6128

SuperHyperGraph ESHG : (V, E). Since the Neutrosophic SuperHyperSet of the Neutrosophic 6129
SuperHyperVertices VESHE , is the maximum Neutrosophic SuperHyperCardinality of 6130
a Neutrosophic SuperHyperSet S of Neutrosophic SuperHyperVertices such that there’s 6131
a Neutrosophic SuperHyperEdge to have some Neutrosophic SuperHyperVertices uniquely. 6132
Thus, in a connected Neutrosophic SuperHyperGraph ESHG : (V, E). Any Neutrosophic 6133
R-Hamiltonian-Cycle-Neighbor only contains all interior Neutrosophic SuperHyperVertices and all 6134

exterior Neutrosophic SuperHyperVertices from the unique Neutrosophic SuperHyperEdge 6135

where there’s any of them has all possible Neutrosophic SuperHyperNeighbors in and there’s all 6136
Neutrosophic SuperHyperNeighborhoods in with no exception minus all Neutrosophic SuperHy- 6137
peNeighbors to some of them not all of them but everything is possible about Neutrosophic 6138
SuperHyperNeighborhoods and Neutrosophic SuperHyperNeighbors out. 6139
The SuperHyperNotion, namely, Hamiltonian-Cycle-Neighbor, is up. There’s neither empty SuperHy- 6140

perEdge nor loop SuperHyperEdge. The following Neutrosophic SuperHyperSet of Neutrosophic 6141
SuperHyperEdges[SuperHyperVertices] is the simple Neutrosophic type-SuperHyperSet of 6142
the Neutrosophic Hamiltonian-Cycle-Neighbor. The Neutrosophic SuperHyperSet of Neutrosophic 6143
SuperHyperEdges[SuperHyperVertices], 6144

C(N SHG)N eutrosophicQuasi−Hamiltonian−Cycle−N eighbor

|EESHG:(V,E) |Neutrosophic Cardinality
b c
= {E2i−1 }i=1 2
.
C(N SHG)N eutrosophicQuasi−Hamiltonian−Cycle−N eighborSuperHyperP olynomial
|EESHG:(V,E) |Neutrosophic Cardinality
= 2z b 2 c
.
C(N SHG)N eutrosophicR−Quasi−Hamiltonian−Cycle−N eighbor = {Vi }si=1 , {Vj }tj=1 .
C(N SHG)N eutrosophicR−Quasi−Hamiltonian−Cycle−N eighborSuperHyperP olynomial = az s + bz t .

is the simple Neutrosophic type-SuperHyperSet of the Neutrosophic Hamiltonian-Cycle-Neighbor. The 6145

Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperEdges[SuperHyperVertices], 6146

C(N SHG)N eutrosophicQuasi−Hamiltonian−Cycle−N eighbor

|EESHG:(V,E) |Neutrosophic Cardinality
b c
= {E2i−1 }i=1 2
.
C(N SHG)N eutrosophicQuasi−Hamiltonian−Cycle−N eighborSuperHyperP olynomial
|EESHG:(V,E) |Neutrosophic Cardinality
= 2z b 2 c
.
C(N SHG)N eutrosophicR−Quasi−Hamiltonian−Cycle−N eighbor = {Vi }si=1 , {Vj }tj=1 .
C(N SHG)N eutrosophicR−Quasi−Hamiltonian−Cycle−N eighborSuperHyperP olynomial = az s + bz t .

Is an Neutrosophic Hamiltonian-Cycle-Neighbor C(ESHG) for an Neutrosophic SuperHyper- 6147

Graph ESHG : (V, E) is a Neutrosophic type-SuperHyperSet with 6148

6149

Henry Garrett · 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- 6150

rosophic SuperHyperEdges[SuperHyperVertices] such that there’s no Neutrosophic Super- 6151
HyperVertex of a Neutrosophic SuperHyperEdge is common and there’s an Neutrosophic 6152
SuperHyperEdge for all Neutrosophic SuperHyperVertices. There are not only two Neut- 6153
rosophic SuperHyperVertices inside the intended Neutrosophic SuperHyperSet. Thus the 6154
non-obvious Neutrosophic Hamiltonian-Cycle-Neighbor is up. The obvious simple Neutrosophic type- 6155

SuperHyperSet called the Neutrosophic Hamiltonian-Cycle-Neighbor is a Neutrosophic SuperHyperSet 6156

includes only two Neutrosophic SuperHyperVertices. But the Neutrosophic SuperHyperSet of 6157
the Neutrosophic SuperHyperEdges[SuperHyperVertices], 6158

C(N SHG)N eutrosophicQuasi−Hamiltonian−Cycle−N eighbor

|EESHG:(V,E) |Neutrosophic Cardinality
b c
= {E2i−1 }i=1 2
.
C(N SHG)N eutrosophicQuasi−Hamiltonian−Cycle−N eighborSuperHyperP olynomial
|EESHG:(V,E) |Neutrosophic Cardinality
= 2z b 2 c
.
C(N SHG)N eutrosophicR−Quasi−Hamiltonian−Cycle−N eighbor = {Vi }si=1 , {Vj }tj=1 .
C(N SHG)N eutrosophicR−Quasi−Hamiltonian−Cycle−N eighborSuperHyperP olynomial = az s + bz t .
Doesn’t have less than three SuperHyperVertices inside the intended Neutrosophic SuperHy- 6159

perSet. Thus the non-obvious simple Neutrosophic type-SuperHyperSet of the Neutrosophic 6160
Hamiltonian-Cycle-Neighbor is up. To sum them up, the Neutrosophic SuperHyperSet of the Neutro- 6161
sophic SuperHyperEdges[SuperHyperVertices], 6162

C(N SHG)N eutrosophicQuasi−Hamiltonian−Cycle−N eighbor

|EESHG:(V,E) |Neutrosophic Cardinality
b c
= {E2i−1 }i=1 2
.
C(N SHG)N eutrosophicQuasi−Hamiltonian−Cycle−N eighborSuperHyperP olynomial
|EESHG:(V,E) |Neutrosophic Cardinality
= 2z b 2 c
.
C(N SHG)N eutrosophicR−Quasi−Hamiltonian−Cycle−N eighbor = {Vi }si=1 , {Vj }tj=1 .
C(N SHG)N eutrosophicR−Quasi−Hamiltonian−Cycle−N eighborSuperHyperP olynomial = az s + bz t .
Is the non-obvious simple Neutrosophic type-SuperHyperSet of the Neutrosophic Hamiltonian- 6163
.
Cycle-Neighbor Since the Neutrosophic SuperHyperSet of the Neutrosophic SuperHy- 6164
perEdges[SuperHyperVertices], 6165

C(N SHG)N eutrosophicQuasi−Hamiltonian−Cycle−N eighbor

|EESHG:(V,E) |Neutrosophic Cardinality
b c
= {E2i−1 }i=1 2
.
C(N SHG)N eutrosophicQuasi−Hamiltonian−Cycle−N eighborSuperHyperP olynomial
|EESHG:(V,E) |Neutrosophic Cardinality
= 2z b 2 c
.
C(N SHG)N eutrosophicR−Quasi−Hamiltonian−Cycle−N eighbor = {Vi }si=1 , {Vj }tj=1 .
C(N SHG)N eutrosophicR−Quasi−Hamiltonian−Cycle−N eighborSuperHyperP olynomial = az s + bz t .
Is an Neutrosophic Hamiltonian-Cycle-Neighbor C(ESHG) for an Neutrosophic SuperHyperGraph 6166

ESHG : (V, E) is the Neutrosophic SuperHyperSet S of Neutrosophic SuperHyperVertices such 6167

Henry Garrett · 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 there’s no a Neutrosophic SuperHyperEdge for some Neutrosophic SuperHyperVertices 6168

given by that Neutrosophic type-SuperHyperSet called the Neutrosophic Hamiltonian-Cycle-Neighbor 6169
and it’s an Neutrosophic Hamiltonian-Cycle-Neighbor. Since it’s 6170
6171
the maximum Neutrosophic cardinality of a Neutrosophic SuperHyperSet S of Neut- 6172
rosophic SuperHyperEdges[SuperHyperVertices] such that there’s no Neutrosophic Super- 6173

HyperVertex of a Neutrosophic SuperHyperEdge is common and there’s an Neutrosophic 6174

SuperHyperEdge for all Neutrosophic SuperHyperVertices. There aren’t only less than three 6175
Neutrosophic SuperHyperVertices inside the intended Neutrosophic SuperHyperSet, 6176

C(N SHG)N eutrosophicQuasi−Hamiltonian−Cycle−N eighbor

|EESHG:(V,E) |Neutrosophic Cardinality
b c
= {E2i−1 }i=1 2
.
C(N SHG)N eutrosophicQuasi−Hamiltonian−Cycle−N eighborSuperHyperP olynomial
|EESHG:(V,E) |Neutrosophic Cardinality
= 2z b 2 c
.
C(N SHG)N eutrosophicR−Quasi−Hamiltonian−Cycle−N eighbor = {Vi }si=1 , {Vj }tj=1 .
C(N SHG)N eutrosophicR−Quasi−Hamiltonian−Cycle−N eighborSuperHyperP olynomial = az s + bz t .

Thus the non-obvious Neutrosophic Hamiltonian-Cycle-Neighbor , 6177

C(N SHG)N eutrosophicQuasi−Hamiltonian−Cycle−N eighbor

|EESHG:(V,E) |Neutrosophic Cardinality
b c
= {E2i−1 }i=1 2
.
C(N SHG)N eutrosophicQuasi−Hamiltonian−Cycle−N eighborSuperHyperP olynomial
|EESHG:(V,E) |Neutrosophic Cardinality
= 2z b 2 c
.
C(N SHG)N eutrosophicR−Quasi−Hamiltonian−Cycle−N eighbor = {Vi }si=1 , {Vj }tj=1 .
C(N SHG)N eutrosophicR−Quasi−Hamiltonian−Cycle−N eighborSuperHyperP olynomial = az s + bz t .

Is up. The obvious simple Neutrosophic type-SuperHyperSet of the Neutrosophic Hamiltonian- 6178
, not:
Cycle-Neighbor 6179

C(N SHG)N eutrosophicQuasi−Hamiltonian−Cycle−N eighbor

|EESHG:(V,E) |Neutrosophic Cardinality
b c
= {E2i−1 }i=1 2
.
C(N SHG)N eutrosophicQuasi−Hamiltonian−Cycle−N eighborSuperHyperP olynomial
|EESHG:(V,E) |Neutrosophic Cardinality
= 2z b 2 c
.
C(N SHG)N eutrosophicR−Quasi−Hamiltonian−Cycle−N eighbor = {Vi }si=1 , {Vj }tj=1 .
C(N SHG)N eutrosophicR−Quasi−Hamiltonian−Cycle−N eighborSuperHyperP olynomial = az s + bz t .

Is the Neutrosophic SuperHyperSet, not: 6180

C(N SHG)N eutrosophicQuasi−Hamiltonian−Cycle−N eighbor

|EESHG:(V,E) |Neutrosophic Cardinality
b c
= {E2i−1 }i=1 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)N eutrosophicQuasi−Hamiltonian−Cycle−N eighborSuperHyperP olynomial

|EESHG:(V,E) |Neutrosophic Cardinality
= 2z b 2 c
.
C(N SHG)N eutrosophicR−Quasi−Hamiltonian−Cycle−N eighbor = {Vi }si=1 , {Vj }tj=1 .
C(N SHG)N eutrosophicR−Quasi−Hamiltonian−Cycle−N eighborSuperHyperP olynomial = az s + bz t .

Does includes only less than three SuperHyperVertices in a connected Neutrosophic Super- 6181
HyperGraph ESHG : (V, E). It’s interesting to mention that the only non-obvious simple 6182
Neutrosophic type-SuperHyperSet called the 6183

“Neutrosophic Hamiltonian-Cycle-Neighbor ” 6184

amid those obvious[non-obvious] simple Neutrosophic type-SuperHyperSets called the 6185

Neutrosophic ,
Hamiltonian-Cycle-Neighbor 6186

is only and only 6187

C(N SHG)N eutrosophicQuasi−Hamiltonian−Cycle−N eighbor

|EESHG:(V,E) |Neutrosophic Cardinality
b c
= {E2i−1 }i=1 2
.
C(N SHG)N eutrosophicQuasi−Hamiltonian−Cycle−N eighborSuperHyperP olynomial
|EESHG:(V,E) |Neutrosophic Cardinality
= 2z b 2 c
.
C(N SHG)N eutrosophicR−Quasi−Hamiltonian−Cycle−N eighbor = {Vi }si=1 , {Vj }tj=1 .
C(N SHG)N eutrosophicR−Quasi−Hamiltonian−Cycle−N eighborSuperHyperP olynomial = az s + bz t .

In a connected Neutrosophic SuperHyperGraph ESHG : (V, E).  6188

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 CHAPTER 31 6189

The Neutrosophic Departures on The 6190

Theoretical Results Toward Theoretical 6191

Motivations 6192

The previous Neutrosophic approach apply on the upcoming Neutrosophic results on Neutrosophic 6193
SuperHyperClasses. 6194

Proposition 31.0.1. Assume a connected Neutrosophic SuperHyperPath ESHP : (V, E). Then 6195

C(N SHG)Neutrosophic Hamiltonian-Cycle-Neighbor

= {}.
C(N SHG)Neutrosophic Hamiltonian-Cycle-Neighbor SuperHyperPolynomial
= 0z 0 .
C(N SHG)Neutrosophic V-Hamiltonian-Cycle-Neighbor
= {}.
C(N SHG)Neutrosophic V-Hamiltonian-Cycle-Neighbor SuperHyperPolynomial
= 0z 0 .
Proof. Let 6196

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V |EN SHG |
, E |EN SHG |
3 3
6197

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-Cycle-Neighbor in the Example (42.0.5) 136NSHG18a

be a longest path taken from a connected Neutrosophic SuperHyperPath ESHP : (V, E). 6198
There’s a new way to redefine as 6199

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 6200
to ViEXT ERN AL in the literatures of SuperHyperHamiltonian-Cycle-Neighbor. The latter is 6201
straightforward.  6202

136EXM18a Example 31.0.2. In the Figure (31.1), the connected Neutrosophic SuperHyperPath ESHP : 6203
(V, E), is highlighted and featured. The Neutrosophic SuperHyperSet, in the Neutrosophic 6204
SuperHyperModel (31.1), is the SuperHyperHamiltonian-Cycle-Neighbor. 6205

Proposition 31.0.3. Assume a connected Neutrosophic SuperHyperCycle ESHC : (V, E). Then 6206

C(N SHG)Neutrosophic Hamiltonian-Cycle-Neighbor

= {}.
C(N SHG)Neutrosophic Hamiltonian-Cycle-Neighbor SuperHyperPolynomial
= 0z 0 .
C(N SHG)Neutrosophic V-Hamiltonian-Cycle-Neighbor

Henry Garrett · 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-Cycle-Neighbor SuperHyperPolynomial
= 0z 0 .
6207

Proof. Let 6208

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V |EN SHG |
, E |EN SHG |
3 3
6209

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). 6210
There’s a new way to redefine as 6211

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 6212
to ViEXT ERN AL in the literatures of SuperHyperHamiltonian-Cycle-Neighbor. The latter is 6213
straightforward.  6214

136EXM19a Example 31.0.4. In the Figure (31.2), the connected Neutrosophic SuperHyperCycle N SHC : 6215
(V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, in the 6216

Neutrosophic SuperHyperModel (31.2), is the Neutrosophic SuperHyperHamiltonian-Cycle-Neighbor. 6217

Proposition 31.0.5. Assume a connected Neutrosophic SuperHyperStar ESHS : (V, E). Then 6218

C(N SHG)Neutrosophic Hamiltonian-Cycle-Neighbor

= {}.
C(N SHG)Neutrosophic Hamiltonian-Cycle-Neighbor SuperHyperPolynomial
= 0z 0 .
C(N SHG)Neutrosophic V-Hamiltonian-Cycle-Neighbor
= {}.
C(N SHG)Neutrosophic V-Hamiltonian-Cycle-Neighbor SuperHyperPolynomial
= 0z 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

Figure 31.2: a Neutrosophic SuperHyperCycle Associated to the Neutrosophic Notions of

Neutrosophic SuperHyperHamiltonian-Cycle-Neighbor in the Neutrosophic Example (42.0.7) 136NSHG19a

Proof. Let 6219

P :
V1EXT ERN AL , E1 ,
CEN T ER, E2
6220

P :
E1 , V1EXT ERN AL ,
E2 , CEN T ER

be a longest path taken a connected Neutrosophic SuperHyperStar ESHS : (V, E). There’s a 6221
new way to redefine as 6222

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 6223
to ViEXT ERN AL in the literatures of SuperHyperHamiltonian-Cycle-Neighbor. The latter is 6224

straightforward.  6225

Henry Garrett · 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-Cycle-Neighbor in the Neutrosophic Example (42.0.9) 136NSHG20a

136EXM20a Example 31.0.6. In the Figure (31.3), the connected Neutrosophic SuperHyperStar ESHS : 6226
(V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, by the Algorithm 6227
in previous Neutrosophic result, of the Neutrosophic SuperHyperVertices of the connected 6228
Neutrosophic SuperHyperStar ESHS : (V, E), in the Neutrosophic SuperHyperModel (31.3), is 6229
the Neutrosophic SuperHyperHamiltonian-Cycle-Neighbor. 6230

Proposition 31.0.7. Assume a connected Neutrosophic SuperHyperBipartite ESHB : (V, E). 6231
Then 6232

C(N SHG)Neutrosophic Hamiltonian-Cycle-Neighbor

= {}.
C(N SHG)Neutrosophic Hamiltonian-Cycle-Neighbor SuperHyperPolynomial
= 0z 0 .
C(N SHG)Neutrosophic V-Hamiltonian-Cycle-Neighbor
= {}.
C(N SHG)Neutrosophic V-Hamiltonian-Cycle-Neighbor SuperHyperPolynomial
= 0z 0 .

Proof. Let 6233

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
V|Pi |=minP ∈E |Pj | , E|Pi |=minPj ∈EN SHG |Pj | .
j N SHG
6234

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). 6235
There’s a new way to redefine as 6236

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 6237
to ViEXT ERN AL in the literatures of SuperHyperHamiltonian-Cycle-Neighbor. The latter is 6238

straightforward. Then there’s no at least one SuperHyperHamiltonian-Cycle-Neighbor. Thus the 6239

notion of quasi may be up but the SuperHyperNotions based on SuperHyperHamiltonian-Cycle- 6240
Neighbor could be applied. There are only two SuperHyperParts. Thus every SuperHyperPart 6241
could have one SuperHyperVertex as the representative in the 6242

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperHamiltonian-Cycle-Neighbor taken from a connected Neutrosophic SuperHyper- 6243
Bipartite ESHB : (V, E). Thus only some SuperHyperVertices and only minimum-Neutrosophic- 6244
of-SuperHyperPart SuperHyperEdges are attained in any solution 6245

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
The latter is straightforward.  6246

136EXM21a Example 31.0.8. In the Neutrosophic Figure (31.4), the connected Neutrosophic SuperHy- 6247
perBipartite ESHB : (V, E), is Neutrosophic highlighted and Neutrosophic featured. The 6248
obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous Neutrosophic 6249
result, of the Neutrosophic SuperHyperVertices of the connected Neutrosophic SuperHyper- 6250
Bipartite ESHB : (V, E), in the Neutrosophic SuperHyperModel (31.4), is the Neutrosophic 6251

SuperHyperHamiltonian-Cycle-Neighbor. 6252

Henry Garrett · 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-Cycle-Neighbor in the Example (42.0.11) 136NSHG21a

Proposition 31.0.9. Assume a connected Neutrosophic SuperHyperMultipartite ESHM : (V, E). 6253
Then 6254

C(N SHG)Neutrosophic Hamiltonian-Cycle-Neighbor

= {}.
C(N SHG)Neutrosophic Hamiltonian-Cycle-Neighbor SuperHyperPolynomial
= 0z 0 .
C(N SHG)Neutrosophic V-Hamiltonian-Cycle-Neighbor
= {}.
C(N SHG)Neutrosophic V-Hamiltonian-Cycle-Neighbor SuperHyperPolynomial
= 0z 0 .

Proof. Let 6255

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

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 Henry Garrett · Independent Researcher · Department of Mathematics ·
DrHenryGarrett@gmail.com · Manhattan, NY, USA

6256

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-Cycle-Neighbor taken from a connected Neutrosophic SuperHy- 6257

perMultipartite ESHM : (V, E). There’s a 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-Cycle-Neighbor. The latter is 6260
straightforward. Then there’s no at least one SuperHyperHamiltonian-Cycle-Neighbor. Thus the 6261
notion of quasi may be up but the SuperHyperNotions based on SuperHyperHamiltonian-Cycle- 6262
0
Neighbor could be applied. There are only z SuperHyperParts. Thus every SuperHyperPart 6263

could have one SuperHyperVertex as the representative in the 6264

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest path taken from a connected Neutrosophic SuperHyperMultipartite ESHM : (V, E). 6265
Thus only some SuperHyperVertices and only minimum-Neutrosophic-of-SuperHyperPart 6266
SuperHyperEdges are attained in any solution 6267

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest path taken from a connected Neutrosophic SuperHyperMultipartite ESHM : (V, E). 6268
The latter is straightforward.  6269

136EXM22a Example 31.0.10. In the Figure (31.5), the connected Neutrosophic SuperHyperMultipartite 6270
ESHM : (V, E), is highlighted and Neutrosophic featured. The obtained Neutrosophic 6271
SuperHyperSet, by the Algorithm in previous Neutrosophic result, of the Neutrosophic 6272
SuperHyperVertices of the connected Neutrosophic SuperHyperMultipartite ESHM : (V, E), 6273
in the Neutrosophic SuperHyperModel (31.5), is the Neutrosophic SuperHyperHamiltonian-Cycle- 6274
Neighbor. 6275

Proposition 31.0.11. Assume a connected Neutrosophic SuperHyperWheel ESHW : (V, E). 6276
Then, 6277

C(N SHG)Neutrosophic Hamiltonian-Cycle-Neighbor

Henry Garrett · 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-Cycle-Neighbor in the Example (42.0.13) 136NSHG22a

= {}.
C(N SHG)Neutrosophic Hamiltonian-Cycle-Neighbor SuperHyperPolynomial
= 0z 0 .
C(N SHG)Neutrosophic V-Hamiltonian-Cycle-Neighbor
= {CEN T ER}.
C(N SHG)Neutrosophic V-Hamiltonian-Cycle-Neighbor SuperHyperPolynomial
= za.
Proof. Let 6278

P :
V1EXT ERN AL , E1∗ ,
CEN T ER, E2∗
6279

P :
E1∗ , V1EXT ERN AL ,
E2∗ , CEN T ER
is a longest SuperHyperHamiltonian-Cycle-Neighbor taken from a connected Neutrosophic SuperHy- 6280
perWheel ESHW : (V, E). There’s a new way to redefine as 6281

ViEXT ERN AL ∼ VjEXT ERN AL ≡

∃!Ez ∈ EESHG:(V,E) , ViEXT ERN AL , VjEXT ERN AL ∈ Ez ≡
∃!Ez ∈ EESHG:(V,E) , {ViEXT ERN AL , VjEXT ERN AL } ⊆ Ez .

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 Henry Garrett · Independent Researcher · Department of Mathematics ·
DrHenryGarrett@gmail.com · Manhattan, NY, USA

Figure 31.6: a Neutrosophic SuperHyperWheel Neutrosophic Associated to the Neutrosophic

Notions of Neutrosophic SuperHyperHamiltonian-Cycle-Neighbor in the Neutrosophic Example
(42.0.15) 136NSHG23a

The term “EXTERNAL” implies |N (ViEXT ERN AL )| ≥ |N (Vj )| where Vj is corresponded 6282

to ViEXT ERN AL in the literatures of SuperHyperHamiltonian-Cycle-Neighbor. The latter is 6283

straightforward. Then there’s at least one SuperHyperHamiltonian-Cycle-Neighbor. Thus the notion 6284
of quasi isn’t up and the SuperHyperNotions based on SuperHyperHamiltonian-Cycle-Neighbor 6285
could be applied. The unique embedded SuperHyperHamiltonian-Cycle-Neighbor proposes some 6286
longest SuperHyperHamiltonian-Cycle-Neighbor excerpt from some representatives. The latter is 6287
straightforward.  6288

136EXM23a Example 31.0.12. In the Neutrosophic Figure (31.6), the connected Neutrosophic SuperHyper- 6289
Wheel N SHW : (V, E), is Neutrosophic highlighted and featured. The obtained Neutrosophic 6290

SuperHyperSet, by the Algorithm in previous result, of the Neutrosophic SuperHyperVer- 6291

tices of the connected Neutrosophic SuperHyperWheel ESHW : (V, E), in the Neutrosophic 6292
SuperHyperModel (31.6), is the Neutrosophic SuperHyperHamiltonian-Cycle-Neighbor. 6293

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 CHAPTER 32 6294

The Surveys of Mathematical Sets On 6295

The Results But As The Initial Motivation 6296

For the SuperHyperHamiltonian-Cycle-Neighbor, Neutrosophic SuperHyperHamiltonian-Cycle-Neighbor, and the 6297

Neutrosophic SuperHyperHamiltonian-Cycle-Neighbor, some general results are introduced. 6298

Remark 32.0.1. Let remind that the Neutrosophic SuperHyperHamiltonian-Cycle-Neighbor is “redefined” 6299
on the positions of the alphabets. 6300

Corollary 32.0.2. Assume Neutrosophic SuperHyperHamiltonian-Cycle-Neighbor. Then 6301

N eutrosophic SuperHyperHamiltonian − Cycle − N eighbor =

{theSuperHyperHamiltonian − Cycle − N eighborof theSuperHyperV ertices |
max |SuperHyperOf f ensive
SuperHyperHamiltonian − Cycle − N eighbor
|N eutrosophiccardinalityamidthoseSuperHyperHamiltonian−Cycle−N eighbor. }

plus one Neutrosophic SuperHypeNeighbor to one. Where σi is the unary operation on the 6302
SuperHyperVertices of the SuperHyperGraph to assign the determinacy, the indeterminacy and 6303
the neutrality, for i = 1, 2, 3, respectively. 6304

Corollary 32.0.3. Assume a Neutrosophic SuperHyperGraph on the same identical letter 6305
of the alphabet. Then the notion of Neutrosophic SuperHyperHamiltonian-Cycle-Neighbor and 6306

SuperHyperHamiltonian-Cycle-Neighbor coincide. 6307

Corollary 32.0.4. Assume a Neutrosophic SuperHyperGraph on the same identical letter of 6308
the alphabet. Then a conseNeighborive sequence of the SuperHyperVertices is a Neutrosophic 6309
SuperHyperHamiltonian-Cycle-Neighbor if and only if it’s a SuperHyperHamiltonian-Cycle-Neighbor. 6310

Corollary 32.0.5. Assume a Neutrosophic SuperHyperGraph on the same identical letter of 6311
the alphabet. Then a conseNeighborive sequence of the SuperHyperVertices is a strongest 6312
SuperHyperHamiltonian-Cycle-Neighbor if and only if it’s a longest SuperHyperHamiltonian-Cycle-Neighbor. 6313

Corollary 32.0.6. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph on the same 6314

identical letter of the alphabet. Then its Neutrosophic SuperHyperHamiltonian-Cycle-Neighbor is its 6315
SuperHyperHamiltonian-Cycle-Neighbor and reversely. 6316

323
Henry Garrett · Independent Researcher · Department of Mathematics ·
DrHenryGarrett@gmail.com · Manhattan, NY, USA

Corollary 32.0.7. Assume a Neutrosophic SuperHyperPath(-/SuperHyperHamiltonian-Cycle-Neighbor, 6317

SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel) on the same 6318
identical letter of the alphabet. Then its Neutrosophic SuperHyperHamiltonian-Cycle-Neighbor is its 6319
SuperHyperHamiltonian-Cycle-Neighbor and reversely. 6320

Corollary 32.0.8. Assume a Neutrosophic SuperHyperGraph. Then its Neutrosophic 6321

SuperHyperHamiltonian-Cycle-Neighbor isn’t well-defined if and only if its SuperHyperHamiltonian-Cycle- 6322
Neighbor isn’t well-defined. 6323

Corollary 32.0.9. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph. Then 6324

its Neutrosophic SuperHyperHamiltonian-Cycle-Neighbor isn’t well-defined if and only if its 6325
SuperHyperHamiltonian-Cycle-Neighbor isn’t well-defined. 6326

Corollary 32.0.10. Assume a Neutrosophic SuperHyperPath(-/SuperHyperHamiltonian-Cycle- 6327

, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel).
Neighbor 6328
Then its Neutrosophic SuperHyperHamiltonian-Cycle-Neighbor isn’t well-defined if and only if its 6329

SuperHyperHamiltonian-Cycle-Neighbor isn’t well-defined. 6330

Corollary 32.0.11. Assume a Neutrosophic SuperHyperGraph. Then its Neutrosophic 6331

SuperHyperHamiltonian-Cycle-Neighbor is well-defined if and only if its SuperHyperHamiltonian-Cycle-Neighbor 6332

is well-defined. 6333

Corollary 32.0.12. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph. 6334

Then its Neutrosophic SuperHyperHamiltonian-Cycle-Neighbor is well-defined if and only if its 6335

SuperHyperHamiltonian-Cycle-Neighbor is well-defined. 6336

Corollary 32.0.13. Assume a Neutrosophic SuperHyperPath(-/SuperHyperHamiltonian-Cycle- 6337

, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel).

Neighbor 6338
Then its Neutrosophic SuperHyperHamiltonian-Cycle-Neighbor is well-defined if and only if its 6339
SuperHyperHamiltonian-Cycle-Neighbor is well-defined. 6340

Proposition 32.0.14. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. Then V is 6341

(i) : the dual SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 6342

(ii) : the strong dual SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 6343

(iii) : the connected dual SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 6344

(iv) : the δ-dual SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 6345

(v) : the strong δ-dual SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 6346

(vi) : the connected δ-dual SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor. 6347

Proposition 32.0.15. Let N T G : (V, E, σ, µ) be a Neutrosophic SuperHyperGraph. Then ∅ is 6348

(i) : the SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 6349

(ii) : the strong SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 6350

(iii) : the connected defensive SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 6351

(iv) : the δ-SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 6352

Henry Garrett · 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-Cycle-Neighbor; 6353

(vi) : the connected δ-SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor. 6354

Proposition 32.0.16. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. Then an 6355

independent SuperHyperSet is 6356

(i) : the SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 6357

(ii) : the strong SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 6358

(iii) : the connected SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 6359

(iv) : the δ-SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 6360

(v) : the strong δ-SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 6361

(vi) : the connected δ-SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor. 6362

Proposition 32.0.17. Let ESHG : (V, E) be a Neutrosophic SuperHyperUniform SuperHyper- 6363

Graph which is a SuperHyperHamiltonian-Cycle-Neighbor/SuperHyperPath. Then V is a maximal 6364

(i) : SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 6365

(ii) : strong SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 6366

(iii) : connected SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 6367

(iv) : O(ESHG)-SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 6368

(v) : strong O(ESHG)-SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 6369

(vi) : connected O(ESHG)-SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 6370

Where the exterior SuperHyperVertices and the interior SuperHyperVertices coincide. 6371

Proposition 32.0.18. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is a 6372

SuperHyperUniform SuperHyperWheel. Then V is a maximal 6373

(i) : dual SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 6374

(ii) : strong dual SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 6375

(iii) : connected dual SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 6376

(iv) : O(ESHG)-dual SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 6377

(v) : strong O(ESHG)-dual SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 6378

(vi) : connected O(ESHG)-dual SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 6379

Where the exterior SuperHyperVertices and the interior SuperHyperVertices coincide. 6380

Proposition 32.0.19. Let ESHG : (V, E) be a Neutrosophic SuperHyperUniform SuperHyper- 6381

Graph which is a SuperHyperHamiltonian-Cycle-Neighbor/SuperHyperPath. Then the number of 6382

Henry Garrett · 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-Cycle-Neighbor; 6383

(ii) : the SuperHyperHamiltonian-Cycle-Neighbor; 6384

(iii) : the connected SuperHyperHamiltonian-Cycle-Neighbor; 6385

(iv) : the O(ESHG)-SuperHyperHamiltonian-Cycle-Neighbor; 6386

(v) : the strong O(ESHG)-SuperHyperHamiltonian-Cycle-Neighbor; 6387

(vi) : the connected O(ESHG)-SuperHyperHamiltonian-Cycle-Neighbor. 6388

is one and it’s only V. Where the exterior SuperHyperVertices and the interior SuperHyperVertices 6389
coincide. 6390

Proposition 32.0.20. Let ESHG : (V, E) be a Neutrosophic SuperHyperUniform SuperHyper- 6391

Graph which is a SuperHyperWheel. Then the number of 6392

(i) : the dual SuperHyperHamiltonian-Cycle-Neighbor; 6393

(ii) : the dual SuperHyperHamiltonian-Cycle-Neighbor; 6394

(iii) : the dual connected SuperHyperHamiltonian-Cycle-Neighbor; 6395

(iv) : the dual O(ESHG)-SuperHyperHamiltonian-Cycle-Neighbor; 6396

(v) : the strong dual O(ESHG)-SuperHyperHamiltonian-Cycle-Neighbor; 6397

(vi) : the connected dual O(ESHG)-SuperHyperHamiltonian-Cycle-Neighbor. 6398

is one and it’s only V. Where the exterior SuperHyperVertices and the interior SuperHyperVertices 6399
coincide. 6400

Proposition 32.0.21. Let ESHG : (V, E) be a Neutrosophic SuperHyperUniform SuperHy- 6401

perGraph which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyper- 6402
Complete SuperHyperMultipartite. Then a SuperHyperSet contains [the SuperHyperCenter 6403

and] the half of multiplying r with the number of all the SuperHyperEdges plus one of all the 6404
SuperHyperVertices is a 6405

(i) : dual SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 6406

(ii) : strong dual SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 6407

(iii) : connected dual SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 6408

O(ESHG)
(iv) : 2 + 1-dual SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 6409

O(ESHG)
(v) : strong 2 + 1-dual SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 6410

O(ESHG)
(vi) : connected 2 + 1-dual SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor. 6411

Henry Garrett · 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- 6412

Graph which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperCom- 6413
plete SuperHyperMultipartite. Then a SuperHyperSet contains the half of multiplying r with 6414
the number of all the SuperHyperEdges plus one of all the SuperHyperVertices in the biggest 6415
SuperHyperPart is a 6416

(i) : SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 6417

(ii) : strong SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 6418

(iii) : connected SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 6419

(iv) : δ-SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 6420

(v) : strong δ-SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 6421

(vi) : connected δ-SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor. 6422

Proposition 32.0.23. Let ESHG : (V, E) be a Neutrosophic SuperHyperUniform SuperHyper- 6423

Graph which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperCom- 6424

plete SuperHyperMultipartite. Then Then the number of 6425

(i) : dual SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 6426

(ii) : strong dual SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 6427

(iii) : connected dual SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 6428

O(ESHG)
(iv) : 2 + 1-dual SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 6429

O(ESHG)
(v) : strong 2 + 1-dual SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 6430

O(ESHG)
(vi) : connected 2 + 1-dual SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor. 6431

is one and it’s only S, a SuperHyperSet contains [the SuperHyperCenter and] the half of 6432
multiplying r with the number of all the SuperHyperEdges plus one of all the SuperHyperVertices. 6433
Where the exterior SuperHyperVertices and the interior SuperHyperVertices coincide. 6434

Proposition 32.0.24. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. The number of 6435
connected component is |V − S| if there’s a SuperHyperSet which is a dual 6436

(i) : SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 6437

(ii) : strong SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 6438

(iii) : connected SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 6439

(iv) : SuperHyperHamiltonian-Cycle-Neighbor; 6440

(v) : strong 1-SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 6441

(vi) : connected 1-SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor. 6442

Henry Garrett · 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 6443
number is at most O(ESHG) and the Neutrosophic number is at most On (ESHG). 6444

Proposition 32.0.26. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is 6445

SuperHyperComplete. The number is O(ESHG:(V,E)) 2 + 1 and the Neutrosophic number is 6446

min Σv∈{v1 ,v2 ,··· ,vt } O(ESHG:(V,E)) ⊆V σ(v), in the setting of dual 6447
t>
2

(i) : SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 6448

(ii) : strong SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 6449

(iii) : connected SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 6450

(iv) : ( O(ESHG:(V,E))
2 + 1)-SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 6451

(v) : strong ( O(ESHG:(V,E))

2 + 1)-SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 6452

(vi) : connected ( O(ESHG:(V,E))

2 + 1)-SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor. 6453

Proposition 32.0.27. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is ∅. The 6454
number is 0 and the Neutrosophic number is 0, for an independent SuperHyperSet in the setting 6455
of dual 6456

(i) : SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 6457

(ii) : strong SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 6458

(iii) : connected SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 6459

(iv) : 0-SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 6460

(v) : strong 0-SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 6461

(vi) : connected 0-SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor. 6462

Proposition 32.0.28. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is 6463

SuperHyperComplete. Then there’s no independent SuperHyperSet. 6464

Proposition 32.0.29. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is 6465

SuperHyperHamiltonian-Cycle-Neighbor/SuperHyperPath/SuperHyperWheel. The number is O(ESHG : 6466

(V, E)) and the Neutrosophic number is On (ESHG : (V, E)), in the setting of a dual 6467

(i) : SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 6468

(ii) : strong SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 6469

(iii) : connected SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 6470

(iv) : O(ESHG : (V, E))-SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 6471

(v) : strong O(ESHG : (V, E))-SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 6472

(vi) : connected O(ESHG : (V, E))-SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor. 6473

Henry Garrett · 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 6474

SuperHyperStar/complete SuperHyperBipartite/complete SuperHyperMultiPartite. The number 6475

is O(ESHG:(V,E))
2 + 1 and the Neutrosophic number is min Σv∈{v1 ,v2 ,··· ,vt } O(ESHG:(V,E)) ⊆V σ(v), 6476
t>
2
in the setting of a dual 6477

(i) : SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 6478

(ii) : strong SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 6479

(iii) : connected SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 6480

(iv) : ( O(ESHG:(V,E))
2 + 1)-SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 6481

(v) : strong ( O(ESHG:(V,E))

2 + 1)-SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 6482

(vi) : connected ( O(ESHG:(V,E))

2 + 1)-SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor. 6483

Proposition 32.0.31. Let N SHF : (V, E) be a SuperHyperFamily of the ESHGs : (V, E) 6484
Neutrosophic SuperHyperGraphs which are from one-type SuperHyperClass which the result is 6485

obtained for the individuals. Then the results also hold for the SuperHyperFamily N SHF : (V, E) 6486
of these specific SuperHyperClasses of the Neutrosophic SuperHyperGraphs. 6487

Proposition 32.0.32. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph. If S is a 6488

dual SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor, then ∀v ∈ V \ S, ∃x ∈ S such that 6489

(i) v ∈ Ns (x); 6490

(ii) vx ∈ E. 6491

Proposition 32.0.33. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph. If S is 6492

a dual SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor, then 6493

(i) S is SuperHyperHamiltonian-Cycle-Neighbor set; 6494

(ii) there’s S ⊆ S 0 such that |S 0 | is SuperHyperChromatic number. 6495

Proposition 32.0.34. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph. Then 6496

(i) Γ ≤ O; 6497

(ii) Γs ≤ On . 6498

Proposition 32.0.35. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph which is 6499
connected. Then 6500

(i) Γ ≤ O − 1; 6501

(ii) Γs ≤ On − Σ3i=1 σi (x). 6502

Proposition 32.0.36. Let ESHG : (V, E) be an odd SuperHyperPath. Then 6503

(i) the SuperHyperSet S = {v2 , v4 , · · · , vn−1 } is a dual SuperHyperDefensive 6504

SuperHyperHamiltonian-Cycle-Neighbor; 6505

Henry Garrett · 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 }; 6506

(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· ,vn−1 } Σ3i=1 σi (s)}; 6507

(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn−1 } and S2 = {v1 , v3 , · · · , vn−1 } are only a dual 6508
SuperHyperHamiltonian-Cycle-Neighbor. 6509

Proposition 32.0.37. Let ESHG : (V, E) be an even SuperHyperPath. Then 6510

(i) the set S = {v2 , v4 , · · · .vn } is a dual SuperHyperDefensive SuperHyperHamiltonian-Cycle- 6511

Neighbor; 6512

(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · .vn } and {v1 , v3 , · · · .vn−1 }; 6513

(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 6514

(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 6515
SuperHyperHamiltonian-Cycle-Neighbor. 6516

Proposition 32.0.38. Let ESHG : (V, E) be an even SuperHyperHamiltonian-Cycle-Neighbor. Then 6517

(i) the SuperHyperSet S = {v2 , v4 , · · · , vn } is a dual SuperHyperDefensive SuperHyperHamiltonian- 6518

Cycle-Neighbor; 6519

(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · , vn } and {v1 , v3 , · · · , vn−1 }; 6520

(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } σ(s), Σs∈S={v1 ,v3 ,··· ,vn−1 } σ(s)}; 6521

(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn } and S2 = {v1 , v3 , · · · , vn−1 } are only dual 6522
SuperHyperHamiltonian-Cycle-Neighbor. 6523

Proposition 32.0.39. Let ESHG : (V, E) be an odd SuperHyperHamiltonian-Cycle-Neighbor. Then 6524

(i) the SuperHyperSet S = {v2 , v4 , · · · , vn−1 } is a dual SuperHyperDefensive 6525

SuperHyperHamiltonian-Cycle-Neighbor; 6526

(ii) Γ = b n2 c + 1 and corresponded SuperHyperSet is S = {v2 , v4 , · · · , vn−1 }; 6527

(iii) Γs = min{Σs∈S={v2 ,v4 ,··· .vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 6528

(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn−1 } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 6529
SuperHyperHamiltonian-Cycle-Neighbor. 6530

Proposition 32.0.40. Let ESHG : (V, E) be SuperHyperStar. Then 6531

(i) the SuperHyperSet S = {c} is a dual maximal SuperHyperHamiltonian-Cycle-Neighbor; 6532

(ii) Γ = 1; 6533

(iii) Γs = Σ3i=1 σi (c); 6534

(iv) the SuperHyperSets S = {c} and S ⊂ S 0 are only dual SuperHyperHamiltonian-Cycle-Neighbor. 6535

Proposition 32.0.41. Let ESHG : (V, E) be SuperHyperWheel. Then 6536

Henry Garrett · 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 6537

SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 6538

6+3(i−1)≤n
(ii) Γ = |{v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 |; 6539

(iii) Γs = Σ{v1 ,v3 }∪{v6 ,v9 ··· ,vi+6 ,··· ,vn }6+3(i−1)≤n Σ3i=1 σi (s); 6540
i=1

6+3(i−1)≤n
(iv) the SuperHyperSet {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is only a dual maximal 6541
SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor. 6542

Proposition 32.0.42. Let ESHG : (V, E) be an odd SuperHyperComplete. Then 6543

b n c+1
(i) the SuperHyperSet S = {vi }i=1
2
is a dual SuperHyperDefensive SuperHyperHamiltonian- 6544
Cycle-Neighbor; 6545

(ii) Γ = b n2 c + 1; 6546

(iii) Γs = min{Σs∈S Σ3i=1 σi (s)} 2

b n c+1 ; 6547
S={vi }i=1

b n c+1
(iv) the SuperHyperSet S = {vi }i=1
2
is only a dual SuperHyperDefensive SuperHyperHamiltonian- 6548
Cycle-Neighbor. 6549

Proposition 32.0.43. Let ESHG : (V, E) be an even SuperHyperComplete. Then 6550

bnc
(i) the SuperHyperSet S = {vi }i=1
2
is a dual SuperHyperDefensive SuperHyperHamiltonian-Cycle- 6551
Neighbor; 6552

(ii) Γ = b n2 c; 6553

(iii) Γs = min{Σs∈S Σ3i=1 σi (s)} 2

bnc ; 6554
S={vi }i=1

bnc
(iv) the SuperHyperSet S = {vi }i=1 2
is only a dual maximal SuperHyperDefensive 6555
SuperHyperHamiltonian-Cycle-Neighbor. 6556

Proposition 32.0.44. Let N SHF : (V, E) be a m-SuperHyperFamily of Neutrosophic SuperHy- 6557

perStars with common Neutrosophic SuperHyperVertex SuperHyperSet. Then 6558

(i) the SuperHyperSet S = {c1 , c2 , · · · , cm } is a dual SuperHyperDefensive SuperHyperHamiltonian- 6559

Cycle-Neighbor for N SHF; 6560

(ii) Γ = m for N SHF : (V, E); 6561

(iii) Γs = Σm 3
i=1 Σj=1 σj (ci ) for N SHF : (V, E); 6562

(iv) the SuperHyperSets S = {c1 , c2 , · · · , cm } and S ⊂ S 0 are only dual SuperHyperHamiltonian- 6563
Cycle-Neighbor for N SHF : (V, E). 6564

Proposition 32.0.45. Let N SHF : (V, E) be an m-SuperHyperFamily of odd SuperHyperCom- 6565

plete SuperHyperGraphs with common Neutrosophic SuperHyperVertex SuperHyperSet. Then 6566

Henry Garrett · 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 6567

SuperHyperHamiltonian-Cycle-Neighbor for N SHF; 6568

(ii) Γ = b n2 c + 1 for N SHF : (V, E); 6569

(iii) Γs = min{Σs∈S Σ3i=1 σi (s)} 2

b n c+1 for N SHF : (V, E); 6570
S={vi }i=1

b n c+1
(iv) the SuperHyperSets S = {vi }i=1
2
are only a dual maximal SuperHyperHamiltonian-Cycle- 6571

Neighbor for N SHF : (V, E). 6572

Proposition 32.0.46. Let N SHF : (V, E) be a m-SuperHyperFamily of even SuperHyperCom- 6573

plete SuperHyperGraphs with common Neutrosophic SuperHyperVertex SuperHyperSet. Then 6574

bnc
(i) the SuperHyperSet S = {vi }i=1
2
is a dual SuperHyperDefensive SuperHyperHamiltonian-Cycle- 6575
Neighbor for N SHF : (V, E); 6576

(ii) Γ = b n2 c for N SHF : (V, E); 6577

(iii) Γs = min{Σs∈S Σ3i=1 σi (s)} 2

bnc for N SHF : (V, E); 6578
S={vi }i=1

bnc
(iv) the SuperHyperSets S = {vi }i=1
2
are only dual maximal SuperHyperHamiltonian-Cycle-Neighbor 6579
for N SHF : (V, E). 6580

Proposition 32.0.47. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph. Then 6581

following statements hold; 6582

(i) if s ≥ t and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 6583

SuperHyperHamiltonian-Cycle-Neighbor, then S is an s-SuperHyperDefensive SuperHyperHamiltonian- 6584

Cycle-Neighbor; 6585

(ii) if s ≤ t and a SuperHyperSet S of SuperHyperVertices is a dual t-SuperHyperDefensive 6586

SuperHyperHamiltonian-Cycle-Neighbor, then S is a dual s-SuperHyperDefensive SuperHyperHamiltonian-
6587
Cycle-Neighbor. 6588

Proposition 32.0.48. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph. Then 6589
following statements hold; 6590

(i) if s ≥ t + 2 and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 6591

SuperHyperHamiltonian-Cycle-Neighbor, then S is an s-SuperHyperPowerful SuperHyperHamiltonian- 6592

Cycle-Neighbor; 6593

(ii) if s ≤ t and a SuperHyperSet S of SuperHyperVertices is a dual t-SuperHyperDefensive 6594

SuperHyperHamiltonian-Cycle-Neighbor, then S is a dual s-SuperHyperPowerful SuperHyperHamiltonian-6595
Cycle-Neighbor. 6596

Proposition 32.0.49. Let ESHG : (V, E) be a[an] [V-]SuperHyperUniform-strong-Neutrosophic 6597

SuperHyperGraph. Then following statements hold; 6598

(i) if ∀a ∈ S, |Ns (a) ∩ S| < b 2r c + 1, then ESHG : (V, E) is an 2-SuperHyperDefensive 6599

SuperHyperHamiltonian-Cycle-Neighbor; 6600

Henry Garrett · 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 6601
SuperHyperHamiltonian-Cycle-Neighbor; 6602

(iii) if ∀a ∈ S, |Ns (a) ∩ V \ S| = 0, then ESHG : (V, E) is an V-SuperHyperDefensive 6603

SuperHyperHamiltonian-Cycle-Neighbor; 6604

(iv) if ∀a ∈ V \ S, |Ns (a) ∩ V \ S| = 0, then ESHG : (V, E) is a dual V-SuperHyperDefensive 6605

SuperHyperHamiltonian-Cycle-Neighbor. 6606

Proposition 32.0.50. Let ESHG : (V, E) is a[an] [V-]SuperHyperUniform-strong-Neutrosophic 6607

SuperHyperGraph. Then following statements hold; 6608

(i) ∀a ∈ S, |Ns (a) ∩ S| < b 2r c + 1 if ESHG : (V, E) is an 2-SuperHyperDefensive 6609

SuperHyperHamiltonian-Cycle-Neighbor; 6610

(ii) ∀a ∈ V \ S, |Ns (a) ∩ S| > b 2r c + 1 if ESHG : (V, E) is a dual 2-SuperHyperDefensive 6611

SuperHyperHamiltonian-Cycle-Neighbor; 6612

(iii) ∀a ∈ S, |Ns (a) ∩ V \ S| = 0 if ESHG : (V, E) is an V-SuperHyperDefensive 6613

SuperHyperHamiltonian-Cycle-Neighbor; 6614

(iv) ∀a ∈ V \ S, |Ns (a) ∩ V \ S| = 0 if ESHG : (V, E) is a dual V-SuperHyperDefensive 6615

SuperHyperHamiltonian-Cycle-Neighbor. 6616

Proposition 32.0.51. Let ESHG : (V, E) is a[an] [V-]SuperHyperUniform-strong-Neutrosophic 6617

SuperHyperGraph which is a SuperHyperComplete. Then following statements hold; 6618

(i) ∀a ∈ S, |Ns (a) ∩ S| < b O−1 2 c + 1 if ESHG : (V, E) is an 2-SuperHyperDefensive 6619

SuperHyperHamiltonian-Cycle-Neighbor; 6620

(ii) ∀a ∈ V \ S, |Ns (a) ∩ S| > b O−1 2 c + 1 if ESHG : (V, E) is a dual 2-SuperHyperDefensive 6621
SuperHyperHamiltonian-Cycle-Neighbor; 6622

(iii) ∀a ∈ S, |Ns (a) ∩ V \ S| = 0 if ESHG : (V, E) is an (O − 1)-SuperHyperDefensive 6623

SuperHyperHamiltonian-Cycle-Neighbor; 6624

(iv) ∀a ∈ V \ S, |Ns (a) ∩ V \ S| = 0 if ESHG : (V, E) is a dual (O − 1)-SuperHyperDefensive 6625

SuperHyperHamiltonian-Cycle-Neighbor. 6626

Proposition 32.0.52. Let ESHG : (V, E) is a[an] [V-]SuperHyperUniform-strong-Neutrosophic 6627

SuperHyperGraph which is a SuperHyperComplete. Then following statements hold; 6628

(i) if ∀a ∈ S, |Ns (a) ∩ S| < b O−1

2 c + 1, then ESHG : (V, E) is an 2-SuperHyperDefensive 6629

SuperHyperHamiltonian-Cycle-Neighbor; 6630

(ii) if ∀a ∈ V \ S, |Ns (a) ∩ S| > b O−1 2 c + 1, then ESHG : (V, E) is a dual 2- 6631
SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor; 6632

(iii) if ∀a ∈ S, |Ns (a) ∩ V \ S| = 0, then ESHG : (V, E) is (O − 1)-SuperHyperDefensive 6633

SuperHyperHamiltonian-Cycle-Neighbor; 6634

(iv) if ∀a ∈ V \ S, |Ns (a) ∩ V \ S| = 0, then ESHG : (V, E) is a dual (O − 1)- 6635

SuperHyperDefensive SuperHyperHamiltonian-Cycle-Neighbor. 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

Proposition 32.0.53. Let ESHG : (V, E) is a[an] [V-]SuperHyperUniform-strong-Neutrosophic 6637

SuperHyperGraph which is SuperHyperHamiltonian-Cycle-Neighbor. Then following statements hold; 6638

(i) ∀a ∈ S, |Ns (a) ∩ S| < 2 if ESHG : (V, E)) is an 2-SuperHyperDefensive 6639

SuperHyperHamiltonian-Cycle-Neighbor; 6640

(ii) ∀a ∈ V \ S, |Ns (a) ∩ S| > 2 if ESHG : (V, E) is a dual 2-SuperHyperDefensive 6641

SuperHyperHamiltonian-Cycle-Neighbor; 6642

(iii) ∀a ∈ S, |Ns (a) ∩ V \ S| = 0 if ESHG : (V, E) is an 2-SuperHyperDefensive 6643

SuperHyperHamiltonian-Cycle-Neighbor; 6644

(iv) ∀a ∈ V \ S, |Ns (a) ∩ V \ S| = 0 if ESHG : (V, E) is a dual 2-SuperHyperDefensive 6645

SuperHyperHamiltonian-Cycle-Neighbor. 6646

Proposition 32.0.54. Let ESHG : (V, E) is a[an] [V-]SuperHyperUniform-strong-Neutrosophic 6647

SuperHyperGraph which is SuperHyperHamiltonian-Cycle-Neighbor. Then following statements hold; 6648

(i) if ∀a ∈ S, |Ns (a) ∩ S| < 2, then ESHG : (V, E) is an 2-SuperHyperDefensive 6649

SuperHyperHamiltonian-Cycle-Neighbor; 6650

(ii) if ∀a ∈ V \ S, |Ns (a) ∩ S| > 2, then ESHG : (V, E) is a dual 2-SuperHyperDefensive 6651
SuperHyperHamiltonian-Cycle-Neighbor; 6652

(iii) if ∀a ∈ S, |Ns (a) ∩ V \ S| = 0, then ESHG : (V, E) is an 2-SuperHyperDefensive 6653

SuperHyperHamiltonian-Cycle-Neighbor; 6654

(iv) if ∀a ∈ V \ S, |Ns (a) ∩ V \ S| = 0, then ESHG : (V, E) is a dual 2-SuperHyperDefensive 6655

SuperHyperHamiltonian-Cycle-Neighbor. 6656

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 CHAPTER 33 6657

Neutrosophic Applications in Cancer’s 6658

Neutrosophic Recognition 6659

The cancer is the Neutrosophic disease but the Neutrosophic model is going to figure out what’s 6660
going on this Neutrosophic phenomenon. The special Neutrosophic case of this Neutrosophic 6661
disease is considered and as the consequences of the model, some parameters are used. The 6662

cells are under attack of this disease but the moves of the cancer in the special region are the 6663
matter of mind. The Neutrosophic recognition of the cancer could help to find some Neutrosophic 6664
treatments for this Neutrosophic disease. 6665
In the following, some Neutrosophic steps are Neutrosophic devised on this disease. 6666

Step 1. (Neutrosophic Definition) The Neutrosophic recognition of the cancer in the long-term 6667
Neutrosophic function. 6668

Step 2. (Neutrosophic Issue) The specific region has been assigned by the Neutrosophic model 6669

[it’s called Neutrosophic SuperHyperGraph] and the long Neutrosophic cycle of the move 6670
from the cancer is identified by this research. Sometimes the move of the cancer hasn’t be 6671
easily identified since there are some determinacy, indeterminacy and neutrality about the 6672
moves and the effects of the cancer on that region; this event leads us to choose another 6673
model [it’s said to be Neutrosophic SuperHyperGraph] to have convenient perception on 6674
what’s happened and what’s done. 6675

Step 3. (Neutrosophic Model) There are some specific Neutrosophic models, which are well- 6676
known and they’ve got the names, and some general Neutrosophic models. The moves and 6677
the Neutrosophic traces of the cancer on the complex tracks and between complicated groups 6678
of cells could be fantasized by a Neutrosophic SuperHyperPath(-/SuperHyperHamiltonian-Cycle- 6679
Neighbor, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). 6680

The aim is to find either the Neutrosophic SuperHyperHamiltonian-Cycle-Neighbor or the Neutro- 6681
sophic SuperHyperHamiltonian-Cycle-Neighbor in those Neutrosophic Neutrosophic SuperHyper- 6682
Models. 6683

335
 CHAPTER 34 6684

Case 1: The Initial Neutrosophic Steps 6685

Toward Neutrosophic 6686

SuperHyperBipartite as Neutrosophic 6687

SuperHyperModel 6688

Step 4. (Neutrosophic Solution) In the Neutrosophic Figure (34.1), the Neutrosophic Super- 6689
HyperBipartite is Neutrosophic highlighted and Neutrosophic featured. 6690

Figure 34.1: a Neutrosophic SuperHyperBipartite Associated to the Notions of Neutrosophic

SuperHyperHamiltonian-Cycle-Neighbor 136NSHGaa21aa

337
 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- 6691
perBipartite is obtained. 6692
The obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous 6693
Neutrosophic result, of the Neutrosophic SuperHyperVertices of the connected Neutrosophic 6694
SuperHyperBipartite ESHB : (V, E), in the Neutrosophic SuperHyperModel (34.1), is the 6695

Neutrosophic SuperHyperHamiltonian-Cycle-Neighbor. 6696

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 CHAPTER 35 6697

Case 2: The Increasing Neutrosophic 6698

Steps Toward Neutrosophic 6699

SuperHyperMultipartite as 6700

Neutrosophic SuperHyperModel 6701

Step 4. (Neutrosophic Solution) In the Neutrosophic Figure (35.1), the Neutrosophic Super- 6702
HyperMultipartite is Neutrosophic highlighted and Neutrosophic featured. 6703

By using the Neutrosophic Figure (35.1) and the Table (35.1), the Neutrosophic SuperHy- 6704
perMultipartite is obtained. 6705
The obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous 6706

Figure 35.1: a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic

SuperHyperHamiltonian-Cycle-Neighbor 136NSHGaa22aa

339
 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- 6707

perMultipartite ESHM : (V, E), in the Neutrosophic SuperHyperModel (35.1), is the 6708
Neutrosophic SuperHyperHamiltonian-Cycle-Neighbor. 6709

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 CHAPTER 36 6710

Wondering Open Problems But As The 6711

Directions To Forming The Motivations 6712

In what follows, some “problems” and some “questions” are proposed. 6713
The SuperHyperHamiltonian-Cycle-Neighbor and the Neutrosophic SuperHyperHamiltonian-Cycle-Neighbor are 6714
defined on a real-world application, titled “Cancer’s Recognitions”. 6715

Question 36.0.1. Which the else SuperHyperModels could be defined based on Cancer’s 6716
recognitions? 6717

Question 36.0.2. Are there some SuperHyperNotions related to SuperHyperHamiltonian-Cycle-Neighbor 6718

and the Neutrosophic SuperHyperHamiltonian-Cycle-Neighbor? 6719

Question 36.0.3. Are there some Algorithms to be defined on the SuperHyperModels to compute 6720
them? 6721

Question 36.0.4. Which the SuperHyperNotions are related to beyond the SuperHyperHamiltonian- 6722
and the Neutrosophic SuperHyperHamiltonian-Cycle-Neighbor?
Cycle-Neighbor 6723

Problem 36.0.5. The SuperHyperHamiltonian-Cycle-Neighbor and the Neutrosophic SuperHyperHamiltonian- 6724

do a SuperHyperModel for the Cancer’s recognitions and they’re based on 6725
Cycle-Neighbor
SuperHyperHamiltonian-Cycle-Neighbor, are there else? 6726

Problem 36.0.6. Which the fundamental SuperHyperNumbers are related to these SuperHyper- 6727
Numbers types-results? 6728

Problem 36.0.7. What’s the independent research based on Cancer’s recognitions concerning 6729
the multiple types of SuperHyperNotions? 6730

341
 CHAPTER 37 6731

Conclusion and Closing Remarks 6732

In this section, concluding remarks and closing remarks are represented. The drawbacks of this 6733

research are illustrated. Some benefits and some advantages of this research are highlighted. 6734
This research uses some approaches to make Neutrosophic SuperHyperGraphs more under- 6735
standable. In this endeavor, two SuperHyperNotions are defined on the SuperHyperHamiltonian- 6736
Cycle-Neighbor. For that sake in the second definition, the main definition of the Neutrosophic 6737
SuperHyperGraph is redefined on the position of the alphabets. Based on the new definition for the 6738
Neutrosophic SuperHyperGraph, the new SuperHyperNotion, Neutrosophic SuperHyperHamiltonian- 6739

Cycle-Neighbor, finds the convenient background to implement some results based on that. Some 6740
SuperHyperClasses and some Neutrosophic SuperHyperClasses are the cases of this research on 6741
the modeling of the regions where are under the attacks of the cancer to recognize this disease as 6742
it’s mentioned on the title “Cancer’s Recognitions”. To formalize the instances on the SuperHy- 6743
perNotion, SuperHyperHamiltonian-Cycle-Neighbor, the new SuperHyperClasses and SuperHyperClasses, 6744
are introduced. Some general results are gathered in the section on the SuperHyperHamiltonian- 6745

Cycle-Neighbor and the Neutrosophic SuperHyperHamiltonian-Cycle-Neighbor. The clarifications, instances 6746

and literature reviews have taken the whole way through. In this research, the literature re- 6747
views have fulfilled the lines containing the notions and the results. The SuperHyperGraph and 6748
Neutrosophic SuperHyperGraph are the SuperHyperModels on the “Cancer’s Recognitions” and 6749
both bases are the background of this research. Sometimes the cancer has been happened on the 6750
region, full of cells, groups of cells and embedded styles. In this segment, the SuperHyperModel 6751

proposes some SuperHyperNotions based on the connectivities of the moves of the cancer in the 6752
longest and strongest styles with the formation of the design and the architecture are formally 6753
called “ SuperHyperHamiltonian-Cycle-Neighbor” in the themes of jargons and buzzwords. The prefix 6754
“SuperHyper” refers to the theme of the embedded styles to figure out the background for the 6755
SuperHyperNotions. In the Table (37.1), benefits and avenues for this research are, figured out, 6756
pointed out and spoken out. 6757

343
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-Cycle-Neighbor

3. Neutrosophic SuperHyperHamiltonian-Cycle-Neighbor 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 6758

Neutrosophic SuperHyperDuality But As 6759

The Extensions Excerpt From Dense And 6760

Super Forms 6761

Definition 38.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperDuality). 6762

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider a 6763

Neutrosophic SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and E 0 = {E1 , E2 , . . . , Ez }. Then either V 0 6764
or E 0 is called 6765

(i) Neutrosophic e-SuperHyperDuality if ∀Ei ∈ E 0 , ∃Ej ∈ EESHG:(V,E) \ E 0 such that 6766

Va ∈ Ei , Ej ; 6767

(ii) Neutrosophic re-SuperHyperDuality if ∀Ei ∈ E 0 , ∃Ej ∈ EESHG:(V,E) \ E 0 such that 6768

Va ∈ Ei , Ej and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 6769

(iii) Neutrosophic v-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 6770

Vi , Vj ∈ Ea ; 6771

(iv) Neutrosophic rv-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 6772

Vi , Vj ∈ Ea and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; 6773

(v) Neutrosophic SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 6774

Neutrosophic re-SuperHyperDuality, Neutrosophic v-SuperHyperDuality, and Neutro- 6775

sophic rv-SuperHyperDuality. 6776

Definition 38.0.2. ((Neutrosophic) SuperHyperDuality). 6777

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider a 6778

Neutrosophic SuperHyperEdge (NSHE) E = {V1 , V2 , . . . , Vs }. Then E is called 6779

(i) an Extreme SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 6780

Neutrosophic re-SuperHyperDuality, Neutrosophic v-SuperHyperDuality, and Neutro- 6781
sophic rv-SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : 6782
(V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high 6783
Extreme cardinality of the Extreme SuperHyperEdges in the conseNeighborive Extreme 6784
sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 6785

form the Extreme SuperHyperDuality; 6786

345
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, 6787

Neutrosophic re-SuperHyperDuality, Neutrosophic v-SuperHyperDuality, and Neutro- 6788
sophic rv-SuperHyperDuality and C(N SHG) for a Neutrosophic SuperHyperGraph 6789
N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic Su- 6790
perHyperEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 6791
conseNeighborive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices 6792

such that they form the Neutrosophic SuperHyperDuality; 6793

(iii) an Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of Neut- 6794

rosophic e-SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic v- 6795

SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for an Ex- 6796
treme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains 6797
the Extreme coefficients defined as the Extreme number of the maximum Extreme cardin- 6798
ality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme 6799
cardinality conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVer- 6800

tices such that they form the Extreme SuperHyperDuality; and the Extreme power is 6801
corresponded to its Extreme coefficient; 6802

(iv) a Neutrosophic SuperHyperDuality SuperHyperPolynomial if it’s either of Neut- 6803

rosophic e-SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic v- 6804

SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for a Neut- 6805
rosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 6806
contains the Neutrosophic coefficients defined as the Neutrosophic number of the max- 6807
imum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic 6808
SuperHyperSet S of high Neutrosophic cardinality conseNeighborive Neutrosophic Super- 6809

HyperEdges and Neutrosophic SuperHyperVertices such that they form the Neutrosophic 6810
SuperHyperDuality; and the Neutrosophic power is corresponded to its Neutrosophic 6811
coefficient; 6812

(v) an Extreme R-SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 6813

Neutrosophic re-SuperHyperDuality, Neutrosophic v-SuperHyperDuality, and Neutro- 6814
sophic rv-SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : 6815
(V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high 6816
Extreme cardinality of the Extreme SuperHyperVertices in the conseNeighborive Extreme 6817

sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 6818
form the Extreme SuperHyperDuality; 6819

(vi) a Neutrosophic R-SuperHyperDuality if it’s either of Neutrosophic e- 6820

SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic v-SuperHyperDuality,6821
and Neutrosophic rv-SuperHyperDuality and C(N SHG) for a Neutrosophic SuperHyper- 6822
Graph N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic 6823
SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 6824
conseNeighborive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices 6825
such that they form the Neutrosophic SuperHyperDuality; 6826

(vii) an Extreme R-SuperHyperDuality SuperHyperPolynomial if it’s either of 6827

Neutrosophic e-SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic 6828

v-SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for an 6829

Henry Garrett · 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 6830

contains the Extreme coefficients defined as the Extreme number of the maximum 6831
Extreme cardinality of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S 6832
of high Extreme cardinality conseNeighborive Extreme SuperHyperEdges and Extreme 6833
SuperHyperVertices such that they form the Extreme SuperHyperDuality; and the Extreme 6834
power is corresponded to its Extreme coefficient; 6835

(viii) a Neutrosophic SuperHyperDuality SuperHyperPolynomial if it’s either of Neut- 6836

rosophic e-SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic v- 6837
SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for a Neut- 6838

rosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 6839

contains the Neutrosophic coefficients defined as the Neutrosophic number of the max- 6840
imum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic 6841
SuperHyperSet S of high Neutrosophic cardinality conseNeighborive Neutrosophic Super- 6842
HyperEdges and Neutrosophic SuperHyperVertices such that they form the Neutrosophic 6843
SuperHyperDuality; and the Neutrosophic power is corresponded to its Neutrosophic 6844

coefficient. 6845

136EXM1 Example 38.0.3. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E) in 6846
the mentioned Neutrosophic Figures in every Neutrosophic items. 6847

• On the Figure (30.1), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 6848

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 6849

E1 and E3 are some empty Extreme SuperHyperEdges but E2 is a loop Neutrosophic 6850
SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of 6851
Neutrosophic SuperHyperNeighbor, there’s only one Neutrosophic SuperHyperEdge, 6852
namely, E4 . The Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means 6853
that there’s no Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. 6854
Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in every given Neutrosophic 6855

SuperHyperDuality. 6856

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 6857

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 6858
E1 , E2 and E3 are some empty Neutrosophic SuperHyperEdges but E4 is a Neutrosophic 6859
SuperHyperEdge. Thus in the terms of Neutrosophic SuperHyperNeighbor, there’s only 6860
one Neutrosophic SuperHyperEdge, namely, E4 . The Neutrosophic SuperHyperVertex, V3 6861
is Neutrosophic isolated means that there’s no Neutrosophic SuperHyperEdge has it as 6862

a Neutrosophic endpoint. Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in 6863

Henry Garrett · 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. 6864

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 6865

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 6866

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 6867

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 6868

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 6869

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 6870

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 6871

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 6872

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 6873

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 6874

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 6875

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 6876

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 6877

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 6878

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 6879

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 6880

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 6881

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 6882

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 6883

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 6884

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 6885

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 6886

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 6887

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 6888

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 6889

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 6890

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 6891

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 6892

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 6893

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 6894

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 6895

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 6896

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 6897

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 6898

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 6899

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 6900

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 6901

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 6902

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 6903

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 6904

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 6905
Neutrosophic SuperHyperClasses. 6906

Proposition 38.0.4. Assume a connected Neutrosophic SuperHyperPath ESHP : (V, E). Then 6907

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 6908

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). 6909

There’s a new way to redefine as 6910

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 6911

ViEXT ERN AL in the literatures of SuperHyperDuality. The latter is straightforward.  6912

Henry Garrett · 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 : 6913
(V, E), is highlighted and featured. The Neutrosophic SuperHyperSet, in the Neutrosophic 6914
SuperHyperModel (31.1), is the SuperHyperDuality. 6915

Proposition 38.0.6. Assume a connected Neutrosophic SuperHyperCycle ESHC : (V, E). Then 6916

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 6917

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). 6918
There’s a new way to redefine as 6919

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 6920
ViEXT ERN AL in the literatures of SuperHyperDuality. The latter is straightforward.  6921

136EXM19a Example 38.0.7. In the Figure (31.2), the connected Neutrosophic SuperHyperCycle N SHC : 6922

(V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, in the 6923
Neutrosophic SuperHyperModel (31.2), is the Neutrosophic SuperHyperDuality. 6924

Proposition 38.0.8. Assume a connected Neutrosophic SuperHyperStar ESHS : (V, E). Then 6925

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 6926

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 6927

new way to redefine as 6928

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 6929
ViEXT ERN AL in the literatures of SuperHyperDuality. The latter is straightforward.  6930

136EXM20a Example 38.0.9. In the Figure (31.3), the connected Neutrosophic SuperHyperStar ESHS : 6931
(V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, by the Algorithm 6932

in previous Neutrosophic result, of the Neutrosophic SuperHyperVertices of the connected 6933

Neutrosophic SuperHyperStar ESHS : (V, E), in the Neutrosophic SuperHyperModel (31.3), is 6934
the Neutrosophic SuperHyperDuality. 6935

Proposition 38.0.10. Assume a connected Neutrosophic SuperHyperBipartite ESHB : (V, E). 6936
Then 6937

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 6938

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). 6939
There’s a new way to redefine as 6940

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 6941
to ViEXT ERN AL in the literatures of SuperHyperDuality. The latter is straightforward. 6942

Then there’s at least one SuperHyperDuality. Thus the notion of quasi isn’t up and the 6943
SuperHyperNotions based on SuperHyperDuality could be applied. There are only two 6944
SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as the 6945
representative in the 6946

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 6947

ESHB : (V, E). Thus only some SuperHyperVertices and only minimum-Neutrosophic-of- 6948
SuperHyperPart SuperHyperEdges are attained in any solution 6949

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.  6950

136EXM21a Example 38.0.11. In the Neutrosophic Figure (31.4), the connected Neutrosophic SuperHy- 6951

perBipartite ESHB : (V, E), is Neutrosophic highlighted and Neutrosophic featured. The 6952
obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous Neutrosophic 6953
result, of the Neutrosophic SuperHyperVertices of the connected Neutrosophic SuperHyper- 6954
Bipartite ESHB : (V, E), in the Neutrosophic SuperHyperModel (31.4), is the Neutrosophic 6955
SuperHyperDuality. 6956

Proposition 38.0.12. Assume a connected Neutrosophic SuperHyperMultipartite ESHM : 6957

Henry Garrett · 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 6958

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 6959

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 6960

ESHM : (V, E). There’s a new way to redefine as 6961

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 6962
to ViEXT ERN AL in the literatures of SuperHyperDuality. The latter is straightforward. 6963
Then there’s at least one SuperHyperDuality. Thus the notion of quasi isn’t up and 6964
the SuperHyperNotions based on SuperHyperDuality could be applied. There are only z 0 6965
SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as the 6966

representative in the 6967

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). 6968
Thus only some SuperHyperVertices and only minimum-Neutrosophic-of-SuperHyperPart 6969
SuperHyperEdges are attained in any solution 6970

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). 6971
The latter is straightforward.  6972

136EXM22a Example 38.0.13. In the Figure (31.5), the connected Neutrosophic SuperHyperMultipartite 6973
ESHM : (V, E), is highlighted and Neutrosophic featured. The obtained Neutrosophic 6974

SuperHyperSet, by the Algorithm in previous Neutrosophic result, of the Neutrosophic 6975

SuperHyperVertices of the connected Neutrosophic SuperHyperMultipartite ESHM : (V, E), 6976
in the Neutrosophic SuperHyperModel (31.5), is the Neutrosophic SuperHyperDuality. 6977

Proposition 38.0.14. Assume a connected Neutrosophic SuperHyperWheel ESHW : (V, E). 6978
Then, 6979

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 6980

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 6981

ESHW : (V, E). There’s a new way to redefine as 6982

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 6983

to ViEXT ERN AL in the literatures of SuperHyperDuality. The latter is straightforward. 6984

Henry Garrett · 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 6985
SuperHyperNotions based on SuperHyperDuality could be applied. The unique embedded 6986
SuperHyperDuality proposes some longest SuperHyperDuality excerpt from some representatives. 6987
The latter is straightforward.  6988

136EXM23a Example 38.0.15. In the Neutrosophic Figure (31.6), the connected Neutrosophic SuperHyper- 6989
Wheel N SHW : (V, E), is Neutrosophic highlighted and featured. The obtained Neutrosophic 6990
SuperHyperSet, by the Algorithm in previous result, of the Neutrosophic SuperHyperVer- 6991
tices of the connected Neutrosophic SuperHyperWheel ESHW : (V, E), in the Neutrosophic 6992

SuperHyperModel (31.6), is the Neutrosophic SuperHyperDuality. 6993

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 CHAPTER 39 6994

Neutrosophic SuperHyperJoin But As 6995

The Extensions Excerpt From Dense And 6996

Super Forms 6997

Definition 39.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperJoin). 6998

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider a 6999
Neutrosophic SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and E 0 = {E1 , E2 , . . . , Ez }. Then either V 0 7000
or E 0 is called 7001

(i) Neutrosophic e-SuperHyperJoin if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such that 7002

Va ∈ Ei , Ej ; and ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; 7003

(ii) Neutrosophic re-SuperHyperJoin if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such that 7004

Va ∈ Ei , Ej ; ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; and |Ei |NEUTROSOPIC CARDINALITY = 7005
|Ej |NEUTROSOPIC CARDINALITY ; 7006

(iii) Neutrosophic v-SuperHyperJoin if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such that 7007

Vi , Vj 6∈ Ea ; and ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; 7008

(iv) Neutrosophic rv-SuperHyperJoin if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such that 7009

Vi , Vj ∈ Ea ; ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; and |Vi |NEUTROSOPIC CARDINALITY = 7010
|Vj |NEUTROSOPIC CARDINALITY ; 7011

(v) Neutrosophic SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 7012

Neutrosophic re-SuperHyperJoin, Neutrosophic v-SuperHyperJoin, and Neutrosophic 7013
rv-SuperHyperJoin. 7014

Definition 39.0.2. ((Neutrosophic) SuperHyperJoin). 7015

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider a 7016
Neutrosophic SuperHyperEdge (NSHE) E = {V1 , V2 , . . . , Vs }. Then E is called 7017

(i) an Extreme SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 7018

Neutrosophic re-SuperHyperJoin, Neutrosophic v-SuperHyperJoin, and Neutrosophic 7019
rv-SuperHyperJoin and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 7020

is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Extreme 7021

359
Henry Garrett · Independent Researcher · Department of Mathematics ·
DrHenryGarrett@gmail.com · Manhattan, NY, USA

cardinality of the Extreme SuperHyperEdges in the conseNeighborive Extreme sequence 7022

of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 7023
Extreme SuperHyperJoin; 7024

(ii) a Neutrosophic SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 7025

Neutrosophic re-SuperHyperJoin, Neutrosophic v-SuperHyperJoin, and Neutrosophic 7026
rv-SuperHyperJoin and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7027
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of 7028
a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality conseNeighborive 7029

Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they 7030

form the Neutrosophic SuperHyperJoin; 7031

(iii) an Extreme SuperHyperJoin SuperHyperPolynomial if it’s either of Neutrosophic 7032

e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic v-SuperHyperJoin, 7033
and Neutrosophic rv-SuperHyperJoin and C(N SHG) for an Extreme SuperHyperGraph 7034
N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients 7035
defined as the Extreme number of the maximum Extreme cardinality of the Extreme 7036
SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme cardinality conseNeigh- 7037

borive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form 7038
the Extreme SuperHyperJoin; and the Extreme power is corresponded to its Extreme 7039
coefficient; 7040

(iv) a Neutrosophic SuperHyperJoin SuperHyperPolynomial if it’s either of 7041

Neutrosophic e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic v- 7042
SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for a Neutrosophic 7043
SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains 7044
the Neutrosophic coefficients defined as the Neutrosophic number of the maximum Neutro- 7045
sophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet 7046

S of high Neutrosophic cardinality conseNeighborive Neutrosophic SuperHyperEdges and 7047

Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperJoin; 7048
and the Neutrosophic power is corresponded to its Neutrosophic coefficient; 7049

(v) an Extreme R-SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 7050

Neutrosophic re-SuperHyperJoin, Neutrosophic v-SuperHyperJoin, and Neutrosophic 7051
rv-SuperHyperJoin and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 7052
is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Extreme 7053
cardinality of the Extreme SuperHyperVertices in the conseNeighborive Extreme sequence 7054

of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 7055
Extreme SuperHyperJoin; 7056

(vi) a Neutrosophic R-SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 7057

Neutrosophic re-SuperHyperJoin, Neutrosophic v-SuperHyperJoin, and Neutrosophic 7058
rv-SuperHyperJoin and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7059
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of 7060
a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality conseNeighborive 7061
Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they 7062

form the Neutrosophic SuperHyperJoin; 7063

Henry Garrett · 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 7064

Neutrosophic e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic v- 7065
SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for an Extreme 7066
SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the 7067
Extreme coefficients defined as the Extreme number of the maximum Extreme cardinality 7068
of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme 7069

cardinality conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVertices 7070

such that they form the Extreme SuperHyperJoin; and the Extreme power is corresponded 7071
to its Extreme coefficient; 7072

(viii) a Neutrosophic SuperHyperJoin SuperHyperPolynomial if it’s either of 7073

Neutrosophic e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic v- 7074
SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for a Neutrosophic 7075

SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains 7076

the Neutrosophic coefficients defined as the Neutrosophic number of the maximum 7077
Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic 7078
SuperHyperSet S of high Neutrosophic cardinality conseNeighborive Neutrosophic Super- 7079
HyperEdges and Neutrosophic SuperHyperVertices such that they form the Neutrosophic 7080
SuperHyperJoin; and the Neutrosophic power is corresponded to its Neutrosophic 7081

coefficient. 7082

136EXM1 Example 39.0.3. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E) in 7083

the mentioned Neutrosophic Figures in every Neutrosophic items. 7084

• On the Figure (30.1), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 7085

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7086

E1 and E3 are some empty Neutrosophic SuperHyperEdges but E2 is a loop Neutrosophic 7087
SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of 7088
Neutrosophic SuperHyperNeighbor, there’s only one Neutrosophic SuperHyperEdge, 7089
namely, E4 . The Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means 7090
that there’s no Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. 7091

Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in every given Neutrosophic 7092

SuperHyperJoin. 7093

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 7094

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7095
E1 , E2 and E3 are some empty Neutrosophic SuperHyperEdges but E4 is a Neutrosophic 7096
SuperHyperEdge. Thus in the terms of Neutrosophic SuperHyperNeighbor, there’s only 7097
one Neutrosophic SuperHyperEdge, namely, E4 . The Neutrosophic SuperHyperVertex, V3 7098
is Neutrosophic isolated means that there’s no Neutrosophic SuperHyperEdge has it as 7099

a Neutrosophic endpoint. Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in 7100

Henry Garrett · 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. 7101

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 7102

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7103

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 7104

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7105

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 7106

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7107

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 7108

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7109

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 7110

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7111

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 7112

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7113

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 7114

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7115

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 7116

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7117

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 7118

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7119

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 7120

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7121

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 7122

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7123

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 7124

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7125

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 7126

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7127

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 7128

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7129

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 7130

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7131

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 7132

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7133

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 7134

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7135

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 7136

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7137

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 7138

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7139

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 7140

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7141

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 7142
Neutrosophic SuperHyperClasses. 7143

Proposition 39.0.4. Assume a connected Neutrosophic SuperHyperPath ESHP : (V, E). Then 7144

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 7145

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). 7146

There’s a new way to redefine as 7147

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 7148

ViEXT ERN AL in the literatures of SuperHyperJoin. The latter is straightforward.  7149

Henry Garrett · 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 : 7150
(V, E), is highlighted and featured. The Neutrosophic SuperHyperSet, in the Neutrosophic 7151
SuperHyperModel (31.1), is the SuperHyperJoin. 7152

Proposition 39.0.6. Assume a connected Neutrosophic SuperHyperCycle ESHC : (V, E). Then 7153

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 7154

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). 7155
There’s a new way to redefine as 7156

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 7157
ViEXT ERN AL in the literatures of SuperHyperJoin. The latter is straightforward.  7158

136EXM19a Example 39.0.7. In the Figure (31.2), the connected Neutrosophic SuperHyperCycle N SHC : 7159

(V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, in the 7160
Neutrosophic SuperHyperModel (31.2), is the Neutrosophic SuperHyperJoin. 7161

Proposition 39.0.8. Assume a connected Neutrosophic SuperHyperStar ESHS : (V, E). Then 7162

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 7163

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 7164

new way to redefine as 7165

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 7166
ViEXT ERN AL in the literatures of SuperHyperJoin. The latter is straightforward.  7167

136EXM20a Example 39.0.9. In the Figure (31.3), the connected Neutrosophic SuperHyperStar ESHS : 7168
(V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, by the Algorithm 7169

in previous Neutrosophic result, of the Neutrosophic SuperHyperVertices of the connected 7170

Neutrosophic SuperHyperStar ESHS : (V, E), in the Neutrosophic SuperHyperModel (31.3), is 7171
the Neutrosophic SuperHyperJoin. 7172

Proposition 39.0.10. Assume a connected Neutrosophic SuperHyperBipartite ESHB : (V, E). 7173
Then 7174

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 7175

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). 7176
There’s a new way to redefine as 7177

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 7178

ViEXT ERN AL in the literatures of SuperHyperJoin. The latter is straightforward. Then there’s 7179
no at least one SuperHyperJoin. Thus the notion of quasi may be up but the SuperHyperNotions 7180
based on SuperHyperJoin could be applied. There are only two SuperHyperParts. Thus every 7181
SuperHyperPart could have one SuperHyperVertex as the representative in the 7182

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 7183

ESHB : (V, E). Thus only some SuperHyperVertices and only minimum-Neutrosophic-of- 7184
SuperHyperPart SuperHyperEdges are attained in any solution 7185

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.  7186

Henry Garrett · 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- 7187
perBipartite ESHB : (V, E), is Neutrosophic highlighted and Neutrosophic featured. The 7188
obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous Neutrosophic 7189
result, of the Neutrosophic SuperHyperVertices of the connected Neutrosophic SuperHyper- 7190
Bipartite ESHB : (V, E), in the Neutrosophic SuperHyperModel (31.4), is the Neutrosophic 7191
SuperHyperJoin. 7192

Proposition 39.0.12. Assume a connected Neutrosophic SuperHyperMultipartite ESHM : 7193

(V, E). Then 7194

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 7195

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 7196

ESHM : (V, E). There’s a new way to redefine as 7197

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 7198
ViEXT ERN AL in the literatures of SuperHyperJoin. The latter is straightforward. Then there’s 7199
no at least one SuperHyperJoin. Thus the notion of quasi may be up but the SuperHyperNotions 7200

based on SuperHyperJoin could be applied. There are only z 0 SuperHyperParts. Thus every 7201
SuperHyperPart could have one SuperHyperVertex as the representative in the 7202

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). 7203
Thus only some SuperHyperVertices and only minimum-Neutrosophic-of-SuperHyperPart 7204
SuperHyperEdges are attained in any solution 7205

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). 7206
The latter is straightforward.  7207

136EXM22a Example 39.0.13. In the Figure (31.5), the connected Neutrosophic SuperHyperMultipartite 7208
ESHM : (V, E), is highlighted and Neutrosophic featured. The obtained Neutrosophic 7209
SuperHyperSet, by the Algorithm in previous Neutrosophic result, of the Neutrosophic 7210

SuperHyperVertices of the connected Neutrosophic SuperHyperMultipartite ESHM : (V, E), 7211

in the Neutrosophic SuperHyperModel (31.5), is the Neutrosophic SuperHyperJoin. 7212

Proposition 39.0.14. Assume a connected Neutrosophic SuperHyperWheel ESHW : (V, E). 7213

Henry Garrett · 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, 7214

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 7215

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 : 7216

(V, E). There’s a new way to redefine as 7217

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 7218

ViEXT ERN AL in the literatures of SuperHyperJoin. The latter is straightforward. Then there’s 7219
at least one SuperHyperJoin. Thus the notion of quasi isn’t up and the SuperHyperNotions based 7220
on SuperHyperJoin could be applied. The unique embedded SuperHyperJoin proposes some 7221
longest SuperHyperJoin excerpt from some representatives. The latter is straightforward.  7222

136EXM23a Example 39.0.15. In the Neutrosophic Figure (31.6), the connected Neutrosophic SuperHyper- 7223
Wheel N SHW : (V, E), is Neutrosophic highlighted and featured. The obtained Neutrosophic 7224
SuperHyperSet, by the Algorithm in previous result, of the Neutrosophic SuperHyperVer- 7225
tices of the connected Neutrosophic SuperHyperWheel ESHW : (V, E), in the Neutrosophic 7226
SuperHyperModel (31.6), is the Neutrosophic SuperHyperJoin. 7227

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 CHAPTER 40 7228

Neutrosophic SuperHyperPerfect But As 7229

The Extensions Excerpt From Dense And 7230

Super Forms 7231

Definition 40.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperPerfect). 7232

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider a 7233

Neutrosophic SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and E 0 = {E1 , E2 , . . . , Ez }. Then either V 0 7234
or E 0 is called 7235

(i) Neutrosophic e-SuperHyperPerfect if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃!Ej ∈ E 0 , such that 7236

Va ∈ Ei , Ej ; 7237

(ii) Neutrosophic re-SuperHyperPerfect if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃!Ej ∈ E 0 , such 7238

that Va ∈ Ei , Ej ; and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 7239

(iii) Neutrosophic v-SuperHyperPerfect if ∀Vi ∈ VESHG:(V,E) \ V 0 , ∃!Vj ∈ V 0 , such that 7240

Vi , Vj ∈ Ea ; 7241

(iv) Neutrosophic rv-SuperHyperPerfect if ∀Vi ∈ VESHG:(V,E) \ V 0 , ∃!Vj ∈ V 0 , such that 7242

Vi , Vj ∈ Ea ; and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; 7243

(v) Neutrosophic SuperHyperPerfect if it’s either of Neutrosophic e-SuperHyperPerfect, 7244

Neutrosophic re-SuperHyperPerfect, Neutrosophic v-SuperHyperPerfect, and Neutrosophic 7245

rv-SuperHyperPerfect. 7246

Definition 40.0.2. ((Neutrosophic) SuperHyperPerfect). 7247

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider a 7248

Neutrosophic SuperHyperEdge (NSHE) E = {V1 , V2 , . . . , Vs }. Then E is called 7249

(i) an Extreme SuperHyperPerfect if it’s either of Neutrosophic e-SuperHyperPerfect, 7250

Neutrosophic re-SuperHyperPerfect, Neutrosophic v-SuperHyperPerfect, and Neutrosophic 7251
rv-SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 7252
is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Extreme 7253
cardinality of the Extreme SuperHyperEdges in the conseNeighborive Extreme sequence 7254
of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 7255

Extreme SuperHyperPerfect; 7256

373
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, 7257

Neutrosophic re-SuperHyperPerfect, Neutrosophic v-SuperHyperPerfect, and Neutrosophic 7258
rv-SuperHyperPerfect and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : 7259
(V, E) is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges 7260
of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality conseNeighborive 7261
Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they 7262

form the Neutrosophic SuperHyperPerfect; 7263

(iii) an Extreme SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7264

rosophic e-SuperHyperPerfect, Neutrosophic re-SuperHyperPerfect, Neutrosophic v- 7265

SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for an Ex- 7266
treme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains 7267
the Extreme coefficients defined as the Extreme number of the maximum Extreme cardin- 7268
ality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme 7269
cardinality conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVer- 7270

tices such that they form the Extreme SuperHyperPerfect; and the Extreme power is 7271
corresponded to its Extreme coefficient; 7272

(iv) a Neutrosophic SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7273

rosophic e-SuperHyperPerfect, Neutrosophic re-SuperHyperPerfect, Neutrosophic v- 7274

SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for a Neut- 7275
rosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 7276
contains the Neutrosophic coefficients defined as the Neutrosophic number of the max- 7277
imum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic 7278
SuperHyperSet S of high Neutrosophic cardinality conseNeighborive Neutrosophic Super- 7279

HyperEdges and Neutrosophic SuperHyperVertices such that they form the Neutrosophic 7280
SuperHyperPerfect; and the Neutrosophic power is corresponded to its Neutrosophic 7281
coefficient; 7282

(v) an Extreme R-SuperHyperPerfect if it’s either of Neutrosophic e-SuperHyperPerfect, 7283

Neutrosophic re-SuperHyperPerfect, Neutrosophic v-SuperHyperPerfect, and Neutrosophic 7284
rv-SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 7285
is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Extreme 7286
cardinality of the Extreme SuperHyperVertices in the conseNeighborive Extreme sequence 7287
of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 7288

Extreme SuperHyperPerfect; 7289

(vi) a Neutrosophic R-SuperHyperPerfect if it’s either of Neutrosophic e- 7290

SuperHyperPerfect, Neutrosophic re-SuperHyperPerfect, Neutrosophic v-SuperHyperPerfect,7291
and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for a Neutrosophic SuperHyper- 7292
Graph N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic 7293
SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 7294
conseNeighborive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices 7295
such that they form the Neutrosophic SuperHyperPerfect; 7296

(vii) an Extreme R-SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7297

rosophic e-SuperHyperPerfect, Neutrosophic re-SuperHyperPerfect, Neutrosophic v- 7298
SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for an Ex- 7299

treme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains 7300

Henry Garrett · 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- 7301
ality of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme 7302
cardinality conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVer- 7303
tices such that they form the Extreme SuperHyperPerfect; and the Extreme power is 7304
corresponded to its Extreme coefficient; 7305

(viii) a Neutrosophic SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7306

rosophic e-SuperHyperPerfect, Neutrosophic re-SuperHyperPerfect, Neutrosophic v- 7307
SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for a Neut- 7308
rosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 7309
contains the Neutrosophic coefficients defined as the Neutrosophic number of the max- 7310

imum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic 7311

SuperHyperSet S of high Neutrosophic cardinality conseNeighborive Neutrosophic Super- 7312
HyperEdges and Neutrosophic SuperHyperVertices such that they form the Neutrosophic 7313
SuperHyperPerfect; and the Neutrosophic power is corresponded to its Neutrosophic 7314
coefficient. 7315

136EXM1 Example 40.0.3. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E) in 7316
the mentioned Neutrosophic Figures in every Neutrosophic items. 7317

• On the Figure (30.1), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 7318

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7319
E1 and E3 are some empty Neutrosophic SuperHyperEdges but E2 is a loop Neutrosophic 7320
SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of 7321
Neutrosophic SuperHyperNeighbor, there’s only one Neutrosophic SuperHyperEdge, 7322

namely, E4 . The Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means 7323

that there’s no Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. 7324
Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in every given Neutrosophic 7325
SuperHyperPerfect. 7326

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 7327

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7328
E1 , E2 and E3 are some empty Neutrosophic SuperHyperEdges but E4 is a Neutrosophic 7329

SuperHyperEdge. Thus in the terms of Neutrosophic SuperHyperNeighbor, there’s only 7330

one Neutrosophic SuperHyperEdge, namely, E4 . The Neutrosophic SuperHyperVertex, V3 7331
is Neutrosophic isolated means that there’s no Neutrosophic SuperHyperEdge has it as 7332
a Neutrosophic endpoint. Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in 7333
every given Neutrosophic SuperHyperPerfect. 7334

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 7335

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7336

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 7337

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7338

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 7339

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7340

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 7341

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7342

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 7343

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7344

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 7345

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7346

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 7347

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7348

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 7349

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7350

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 7351

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7352

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 7353

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7354

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 7355

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7356

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 7357

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7358

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 7359

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7360

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 7361

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7362

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 7363

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7364

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 7365

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7366

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 7367

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7368

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 7369

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7370

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 7371

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7372

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 7373

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7374

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 7375

Neutrosophic SuperHyperClasses. 7376

Henry Garrett · 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 7377

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 7378

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). 7379
There’s a new way to redefine as 7380

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 7381
ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is straightforward.  7382

136EXM18a Example 40.0.5. In the Figure (31.1), the connected Neutrosophic SuperHyperPath ESHP : 7383
(V, E), is highlighted and featured. The Neutrosophic SuperHyperSet, in the Neutrosophic 7384
SuperHyperModel (31.1), is the SuperHyperPerfect. 7385

Proposition 40.0.6. Assume a connected Neutrosophic SuperHyperCycle ESHC : (V, E). Then 7386

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 7387

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). 7388

There’s a new way to redefine as 7389

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 7390
ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is straightforward.  7391

136EXM19a Example 40.0.7. In the Figure (31.2), the connected Neutrosophic SuperHyperCycle N SHC : 7392
(V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, in the 7393
Neutrosophic SuperHyperModel (31.2), is the Neutrosophic SuperHyperPerfect. 7394

Proposition 40.0.8. Assume a connected Neutrosophic SuperHyperStar ESHS : (V, E). Then 7395

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 7396

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 7397
new way to redefine as 7398

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 7399

ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is straightforward.  7400

Henry Garrett · 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 : 7401
(V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, by the Algorithm 7402
in previous Neutrosophic result, of the Neutrosophic SuperHyperVertices of the connected 7403
Neutrosophic SuperHyperStar ESHS : (V, E), in the Neutrosophic SuperHyperModel (31.3), is 7404
the Neutrosophic SuperHyperPerfect. 7405

Proposition 40.0.10. Assume a connected Neutrosophic SuperHyperBipartite ESHB : (V, E). 7406
Then 7407

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 7408

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). 7409
There’s a new way to redefine as 7410

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 7411
ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is straightforward. Then 7412

there’s no at least one SuperHyperPerfect. Thus the notion of quasi may be up but the 7413
SuperHyperNotions based on SuperHyperPerfect could be applied. There are only two 7414
SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as the 7415
representative in the 7416

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 7417

ESHB : (V, E). Thus only some SuperHyperVertices and only minimum-Neutrosophic-of- 7418
SuperHyperPart SuperHyperEdges are attained in any solution 7419

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.  7420

136EXM21a Example 40.0.11. In the Neutrosophic Figure (31.4), the connected Neutrosophic SuperHy- 7421

perBipartite ESHB : (V, E), is Neutrosophic highlighted and Neutrosophic featured. The 7422
obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous Neutrosophic 7423
result, of the Neutrosophic SuperHyperVertices of the connected Neutrosophic SuperHyper- 7424
Bipartite ESHB : (V, E), in the Neutrosophic SuperHyperModel (31.4), is the Neutrosophic 7425
SuperHyperPerfect. 7426

Proposition 40.0.12. Assume a connected Neutrosophic SuperHyperMultipartite ESHM : 7427

Henry Garrett · 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 7428

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 7429

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 7430

ESHM : (V, E). There’s a new way to redefine as 7431

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 7432
to ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is straightforward. 7433
Then there’s no at least one SuperHyperPerfect. Thus the notion of quasi may be up but 7434
the SuperHyperNotions based on SuperHyperPerfect could be applied. There are only z 0 7435
SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as the 7436
representative in the 7437

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). 7438
Thus only some SuperHyperVertices and only minimum-Neutrosophic-of-SuperHyperPart 7439
SuperHyperEdges are attained in any solution 7440

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). 7441
The latter is straightforward.  7442

136EXM22a Example 40.0.13. In the Figure (31.5), the connected Neutrosophic SuperHyperMultipartite 7443
ESHM : (V, E), is highlighted and Neutrosophic featured. The obtained Neutrosophic 7444
SuperHyperSet, by the Algorithm in previous Neutrosophic result, of the Neutrosophic 7445

SuperHyperVertices of the connected Neutrosophic SuperHyperMultipartite ESHM : (V, E), 7446

in the Neutrosophic SuperHyperModel (31.5), is the Neutrosophic SuperHyperPerfect. 7447

Proposition 40.0.14. Assume a connected Neutrosophic SuperHyperWheel ESHW : (V, E). 7448
Then, 7449

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 7450

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 7451

ESHW : (V, E). There’s a new way to redefine as 7452

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 7453
ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is straightforward. Then there’s 7454

at least one SuperHyperPerfect. Thus the notion of quasi isn’t up and the SuperHyperNotions 7455
based on SuperHyperPerfect could be applied. The unique embedded SuperHyperPerfect 7456
proposes some longest SuperHyperPerfect excerpt from some representatives. The latter is 7457
straightforward.  7458

136EXM23a Example 40.0.15. In the Neutrosophic Figure (31.6), the connected Neutrosophic SuperHyper- 7459
Wheel N SHW : (V, E), is Neutrosophic highlighted and featured. The obtained Neutrosophic 7460
SuperHyperSet, by the Algorithm in previous result, of the Neutrosophic SuperHyperVer- 7461
tices of the connected Neutrosophic SuperHyperWheel ESHW : (V, E), in the Neutrosophic 7462
SuperHyperModel (31.6), is the Neutrosophic SuperHyperPerfect. 7463

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 CHAPTER 41 7464

Neutrosophic SuperHyperTotal But As 7465

The Extensions Excerpt From Dense And 7466

Super Forms 7467

Definition 41.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperTotal). 7468

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider a 7469

Neutrosophic SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and E 0 = {E1 , E2 , . . . , Ez }. Then either V 0 7470
or E 0 is called 7471

(i) Neutrosophic e-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that 7472

Va ∈ Ei , Ej ; 7473

(ii) Neutrosophic re-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that 7474

Va ∈ Ei , Ej ; and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 7475

(iii) Neutrosophic v-SuperHyperTotal if ∀Vi ∈ VESHG:(V,E) , ∃!Vj ∈ V 0 , such that 7476

Vi , Vj ∈ Ea ; 7477

(iv) Neutrosophic rv-SuperHyperTotal if ∀Vi ∈ VESHG:(V,E) , ∃!Vj ∈ V 0 , such that 7478

Vi , Vj ∈ Ea ; and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; 7479

(v) Neutrosophic SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 7480

Neutrosophic re-SuperHyperTotal, Neutrosophic v-SuperHyperTotal, and Neutrosophic 7481

rv-SuperHyperTotal. 7482

Definition 41.0.2. ((Neutrosophic) SuperHyperTotal). 7483

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider a 7484

Neutrosophic SuperHyperEdge (NSHE) E = {V1 , V2 , . . . , Vs }. Then E is called 7485

(i) an Extreme SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 7486

Neutrosophic re-SuperHyperTotal, Neutrosophic v-SuperHyperTotal, and Neutrosophic 7487
rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 7488
is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Extreme 7489
cardinality of the Extreme SuperHyperEdges in the conseNeighborive Extreme sequence 7490
of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 7491

Extreme SuperHyperTotal; 7492

387
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, 7493

Neutrosophic re-SuperHyperTotal, Neutrosophic v-SuperHyperTotal, and Neutrosophic 7494
rv-SuperHyperTotal and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7495
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of 7496
a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality conseNeighborive 7497
Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they 7498

form the Neutrosophic SuperHyperTotal; 7499

(iii) an Extreme SuperHyperTotal SuperHyperPolynomial if it’s either of Neutrosophic 7500

e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v-SuperHyperTotal, 7501

and Neutrosophic rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph 7502
N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients 7503
defined as the Extreme number of the maximum Extreme cardinality of the Extreme 7504
SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme cardinality conseNeigh- 7505
borive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form 7506

the Extreme SuperHyperTotal; and the Extreme power is corresponded to its Extreme 7507
coefficient; 7508

(iv) a Neutrosophic SuperHyperTotal SuperHyperPolynomial if it’s either of 7509

Neutrosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v- 7510

SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for a Neutro- 7511
sophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 7512
contains the Neutrosophic coefficients defined as the Neutrosophic number of the max- 7513
imum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic 7514
SuperHyperSet S of high Neutrosophic cardinality conseNeighborive Neutrosophic Super- 7515

HyperEdges and Neutrosophic SuperHyperVertices such that they form the Neutrosophic 7516
SuperHyperTotal; and the Neutrosophic power is corresponded to its Neutrosophic coeffi- 7517
cient; 7518

(v) an Extreme R-SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 7519

Neutrosophic re-SuperHyperTotal, Neutrosophic v-SuperHyperTotal, and Neutrosophic 7520
rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 7521
is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Extreme 7522
cardinality of the Extreme SuperHyperVertices in the conseNeighborive Extreme sequence 7523

of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 7524
Extreme SuperHyperTotal; 7525

(vi) a Neutrosophic R-SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 7526

Neutrosophic re-SuperHyperTotal, Neutrosophic v-SuperHyperTotal, and Neutrosophic 7527

rv-SuperHyperTotal and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7528
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of 7529
a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality conseNeighborive 7530
Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they 7531
form the Neutrosophic SuperHyperTotal; 7532

(vii) an Extreme R-SuperHyperTotal SuperHyperPolynomial if it’s either of Neut- 7533

rosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v- 7534

SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for an Extreme 7535

Henry Garrett · 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 7536

Extreme coefficients defined as the Extreme number of the maximum Extreme cardinality 7537
of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme 7538
cardinality conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVer- 7539
tices such that they form the Extreme SuperHyperTotal; and the Extreme power is 7540
corresponded to its Extreme coefficient; 7541

(viii) a Neutrosophic SuperHyperTotal SuperHyperPolynomial if it’s either of 7542

Neutrosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v- 7543
SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for a Neutro- 7544

sophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 7545

contains the Neutrosophic coefficients defined as the Neutrosophic number of the max- 7546
imum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic 7547
SuperHyperSet S of high Neutrosophic cardinality conseNeighborive Neutrosophic Super- 7548
HyperEdges and Neutrosophic SuperHyperVertices such that they form the Neutrosophic 7549
SuperHyperTotal; and the Neutrosophic power is corresponded to its Neutrosophic coeffi- 7550

cient. 7551

136EXM1 Example 41.0.3. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E) in 7552
the mentioned Neutrosophic Figures in every Neutrosophic items. 7553

• On the Figure (30.1), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 7554

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7555

E1 and E3 are some empty Neutrosophic SuperHyperEdges but E2 is a loop Neutrosophic 7556
SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of 7557
Neutrosophic SuperHyperNeighbor, there’s only one Neutrosophic SuperHyperEdge, 7558
namely, E4 . The Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means 7559
that there’s no Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. 7560
Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in every given Neutrosophic 7561

SuperHyperTotal. 7562

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 7563

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7564
E1 , E2 and E3 are some empty Neutrosophic SuperHyperEdges but E4 is a Neutrosophic 7565
SuperHyperEdge. Thus in the terms of Neutrosophic SuperHyperNeighbor, there’s only 7566
one Neutrosophic SuperHyperEdge, namely, E4 . The Neutrosophic SuperHyperVertex, V3 7567
is Neutrosophic isolated means that there’s no Neutrosophic SuperHyperEdge has it as 7568

a Neutrosophic endpoint. Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in 7569

Henry Garrett · 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. 7570

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 7571

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7572

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 7573

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7574

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 7575

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7576

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 7577

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7578

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 7579

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7580

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 7581

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7582

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 7583

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7584

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 7585

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7586

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 7587

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7588

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 7589

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7590

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 7591

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7592

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 7593

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7594

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 7595

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7596

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 7597

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7598

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 7599

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7600

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 7601

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7602

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 7603

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7604

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 7605

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7606

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 7607

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7608

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 7609

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7610

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 7611
Neutrosophic SuperHyperClasses. 7612

Proposition 41.0.4. Assume a connected Neutrosophic SuperHyperPath ESHP : (V, E). Then 7613

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 7614

P :
V2EXT ERN AL , E2 ,
V3EXT ERN AL , E3 ,
...

be a longest path taken from a connected Neutrosophic SuperHyperPath ESHP : (V, E). 7615
There’s a new way to redefine as 7616

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 7617
ViEXT ERN AL in the literatures of SuperHyperTotal. The latter is straightforward.  7618

136EXM18a Example 41.0.5. In the Figure (31.1), the connected Neutrosophic SuperHyperPath ESHP : 7619

(V, E), is highlighted and featured. The Neutrosophic SuperHyperSet, in the Neutrosophic 7620
SuperHyperModel (31.1), is the SuperHyperTotal. 7621

Proposition 41.0.6. Assume a connected Neutrosophic SuperHyperCycle ESHC : (V, E). Then 7622

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 7623

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). 7624
There’s a new way to redefine as 7625

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 7626
ViEXT ERN AL in the literatures of SuperHyperTotal. The latter is straightforward.  7627

136EXM19a Example 41.0.7. In the Figure (31.2), the connected Neutrosophic SuperHyperCycle N SHC : 7628
(V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, in the 7629
Neutrosophic SuperHyperModel (31.2), is the Neutrosophic SuperHyperTotal. 7630

Proposition 41.0.8. Assume a connected Neutrosophic SuperHyperStar ESHS : (V, E). Then 7631

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 7632

P : ViEXT ERN AL , Ei , CEN T ER, Ej .

be a longest path taken a connected Neutrosophic SuperHyperStar ESHS : (V, E). There’s a 7633
new way to redefine as 7634

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 7635
ViEXT ERN AL in the literatures of SuperHyperTotal. The latter is straightforward.  7636

136EXM20a Example 41.0.9. In the Figure (31.3), the connected Neutrosophic SuperHyperStar ESHS : 7637
(V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, by the Algorithm 7638
in previous Neutrosophic result, of the Neutrosophic SuperHyperVertices of the connected 7639

Neutrosophic SuperHyperStar ESHS : (V, E), in the Neutrosophic SuperHyperModel (31.3), is 7640
the Neutrosophic SuperHyperTotal. 7641

Proposition 41.0.10. Assume a connected Neutrosophic SuperHyperBipartite ESHB : (V, E). 7642
Then 7643

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 7644

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

is a longest path taken from a connected Neutrosophic SuperHyperBipartite ESHB : (V, E). 7645
There’s a new way to redefine as 7646

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 7647
ViEXT ERN AL in the literatures of SuperHyperTotal. The latter is straightforward. Then there’s 7648

no at least one SuperHyperTotal. Thus the notion of quasi may be up but the SuperHyperNotions 7649

Henry Garrett · 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 7650
SuperHyperPart could have one SuperHyperVertex as the representative in the 7651

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

is a longest SuperHyperTotal taken from a connected Neutrosophic SuperHyperBipartite 7652

ESHB : (V, E). Thus only some SuperHyperVertices and only minimum-Neutrosophic-of- 7653
SuperHyperPart SuperHyperEdges are attained in any solution 7654

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

The latter is straightforward.  7655

136EXM21a Example 41.0.11. In the Neutrosophic Figure (31.4), the connected Neutrosophic SuperHy- 7656
perBipartite ESHB : (V, E), is Neutrosophic highlighted and Neutrosophic featured. The 7657
obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous Neutrosophic 7658
result, of the Neutrosophic SuperHyperVertices of the connected Neutrosophic SuperHyper- 7659

Bipartite ESHB : (V, E), in the Neutrosophic SuperHyperModel (31.4), is the Neutrosophic 7660
SuperHyperTotal. 7661

Proposition 41.0.12. Assume a connected Neutrosophic SuperHyperMultipartite ESHM : 7662

(V, E). Then 7663

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 7664

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

is a longest SuperHyperTotal taken from a connected Neutrosophic SuperHyperMultipartite 7665

ESHM : (V, E). There’s a new way to redefine as 7666

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 7667
ViEXT ERN AL in the literatures of SuperHyperTotal. The latter is straightforward. Then there’s 7668
no at least one SuperHyperTotal. Thus the notion of quasi may be up but the SuperHyperNotions 7669

based on SuperHyperTotal could be applied. There are only z 0 SuperHyperParts. Thus every 7670
SuperHyperPart could have one SuperHyperVertex as the representative in the 7671

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

is a longest path taken from a connected Neutrosophic SuperHyperMultipartite ESHM : (V, E). 7672
Thus only some SuperHyperVertices and only minimum-Neutrosophic-of-SuperHyperPart 7673
SuperHyperEdges are attained in any solution 7674

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

is a longest path taken from a connected Neutrosophic SuperHyperMultipartite ESHM : (V, E). 7675
The latter is straightforward.  7676

136EXM22a Example 41.0.13. In the Figure (31.5), the connected Neutrosophic SuperHyperMultipartite 7677

ESHM : (V, E), is highlighted and Neutrosophic featured. The obtained Neutrosophic 7678
SuperHyperSet, by the Algorithm in previous Neutrosophic result, of the Neutrosophic 7679
SuperHyperVertices of the connected Neutrosophic SuperHyperMultipartite ESHM : (V, E), 7680
in the Neutrosophic SuperHyperModel (31.5), is the Neutrosophic SuperHyperTotal. 7681

Proposition 41.0.14. Assume a connected Neutrosophic SuperHyperWheel ESHW : (V, E). 7682
Then, 7683

∗
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 7684

P : ViEXT ERN AL , Ei∗ , CEN T ER, Ej .

is a longest SuperHyperTotal taken from a connected Neutrosophic SuperHyperWheel ESHW : 7685

(V, E). There’s a new way to redefine as 7686

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 7687
ViEXT ERN AL in the literatures of SuperHyperTotal. The latter is straightforward. Then there’s 7688
at least one SuperHyperTotal. Thus the notion of quasi isn’t up and the SuperHyperNotions 7689

based on SuperHyperTotal could be applied. The unique embedded SuperHyperTotal 7690

proposes some longest SuperHyperTotal excerpt from some representatives. The latter is 7691
straightforward.  7692

136EXM23a Example 41.0.15. In the Neutrosophic Figure (31.6), the connected Neutrosophic SuperHyper- 7693
Wheel N SHW : (V, E), is Neutrosophic highlighted and featured. The obtained Neutrosophic 7694
SuperHyperSet, by the Algorithm in previous result, of the Neutrosophic SuperHyperVer- 7695
tices of the connected Neutrosophic SuperHyperWheel ESHW : (V, E), in the Neutrosophic 7696
SuperHyperModel (31.6), is the Neutrosophic SuperHyperTotal. 7697

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 CHAPTER 42 7698

Neutrosophic SuperHyperConnected But 7699

As The Extensions Excerpt From Dense 7700

And Super Forms 7701

Definition 42.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperConnected). 7702

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider a 7703
Neutrosophic SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and E 0 = {E1 , E2 , . . . , Ez }. Then either V 0 7704
or E 0 is called 7705

(i) Neutrosophic e-SuperHyperConnected if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such 7706

that Va ∈ Ei , Ej ; and ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; 7707

(ii) Neutrosophic re-SuperHyperConnected if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ 7708

E 0 , such that Va ∈ Ei , Ej ; ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; and 7709
|Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 7710

(iii) Neutrosophic v-SuperHyperConnected if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such 7711

that Vi , Vj 6∈ Ea ; and ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; 7712

(iv) Neutrosophic rv-SuperHyperConnected if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ 7713

V 0 , such that Vi , Vj ∈ Ea ; ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; and 7714
|Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; 7715

(v) Neutrosophic SuperHyperConnected if it’s either of Neutrosophic e-SuperHyperConnected,

7716
Neutrosophic re-SuperHyperConnected, Neutrosophic v-SuperHyperConnected, and Neut- 7717
rosophic rv-SuperHyperConnected. 7718

Definition 42.0.2. ((Neutrosophic) SuperHyperConnected). 7719

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider a 7720
Neutrosophic SuperHyperEdge (NSHE) E = {V1 , V2 , . . . , Vs }. Then E is called 7721

(i) an Extreme SuperHyperConnected if it’s either of Neutrosophic e-SuperHyperConnected,

7722
Neutrosophic re-SuperHyperConnected, Neutrosophic v-SuperHyperConnected, and Neut- 7723
rosophic rv-SuperHyperConnected and C(N SHG) for an Extreme SuperHyperGraph 7724
N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S 7725

401
Henry Garrett · Independent Researcher · Department of Mathematics ·
DrHenryGarrett@gmail.com · Manhattan, NY, USA

of high Extreme cardinality of the Extreme SuperHyperEdges in the conseNeighborive 7726

Extreme sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such 7727
that they form the Extreme SuperHyperConnected; 7728

(ii) a Neutrosophic SuperHyperConnected if it’s either of Neutrosophic e- 7729

SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neutrosophic v- 7730
SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) 7731
for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic 7732
cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S 7733

of high Neutrosophic cardinality conseNeighborive Neutrosophic SuperHyperEdges and 7734

Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperCon- 7735
nected; 7736

(iii) an Extreme SuperHyperConnected SuperHyperPolynomial if it’s either of Neut- 7737

rosophic e-SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neutrosophic 7738
v-SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) for 7739
an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial 7740
contains the Extreme coefficients defined as the Extreme number of the maximum Ex- 7741
treme cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S 7742

of high Extreme cardinality conseNeighborive Extreme SuperHyperEdges and Extreme 7743

SuperHyperVertices such that they form the Extreme SuperHyperConnected; and the 7744
Extreme power is corresponded to its Extreme coefficient; 7745

(iv) a Neutrosophic SuperHyperConnected SuperHyperPolynomial if it’s either of 7746

Neutrosophic e-SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neut- 7747
rosophic v-SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and 7748
C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic 7749
SuperHyperPolynomial contains the Neutrosophic coefficients defined as the Neutrosophic 7750

number of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges 7751

of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality conseNeighborive 7752
Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form 7753
the Neutrosophic SuperHyperConnected; and the Neutrosophic power is corresponded to 7754
its Neutrosophic coefficient; 7755

(v) an Extreme R-SuperHyperConnected if it’s either of Neutrosophic e- 7756

SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neutrosophic v- 7757
SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) 7758
for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme cardinality 7759

of an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme SuperHyper- 7760

Vertices in the conseNeighborive Extreme sequence of Extreme SuperHyperEdges and 7761
Extreme SuperHyperVertices such that they form the Extreme SuperHyperConnected; 7762

(vi) a Neutrosophic R-SuperHyperConnected if it’s either of Neutrosophic e- 7763

SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neutrosophic v- 7764
SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) 7765
for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic 7766
cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S 7767

of high Neutrosophic cardinality conseNeighborive Neutrosophic SuperHyperEdges and 7768

Henry Garrett · 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- 7769
nected; 7770

(vii) an Extreme R-SuperHyperConnected SuperHyperPolynomial if it’s either of 7771

Neutrosophic e-SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neut- 7772
rosophic v-SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and 7773
C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme Super- 7774
HyperPolynomial contains the Extreme coefficients defined as the Extreme number of the 7775
maximum Extreme cardinality of the Extreme SuperHyperVertices of an Extreme Super- 7776

HyperSet S of high Extreme cardinality conseNeighborive Extreme SuperHyperEdges and 7777

Extreme SuperHyperVertices such that they form the Extreme SuperHyperConnected; 7778
and the Extreme power is corresponded to its Extreme coefficient; 7779

(viii) a Neutrosophic SuperHyperConnected SuperHyperPolynomial if it’s either of 7780

Neutrosophic e-SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neut- 7781
rosophic v-SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and 7782
C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic 7783

SuperHyperPolynomial contains the Neutrosophic coefficients defined as the Neutrosophic 7784

number of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices 7785
of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality conseNeighborive 7786
Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form 7787
the Neutrosophic SuperHyperConnected; and the Neutrosophic power is corresponded to 7788
its Neutrosophic coefficient. 7789

136EXM1 Example 42.0.3. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E) in 7790
the mentioned Neutrosophic Figures in every Neutrosophic items. 7791

• On the Figure (30.1), the Neutrosophic SuperHyperNotion, namely, Neutrosophic Super- 7792
HyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7793

E1 and E3 are some empty Neutrosophic SuperHyperEdges but E2 is a loop Neutrosophic 7794
SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of Neutro- 7795
sophic SuperHyperNeighbor, there’s only one Neutrosophic SuperHyperEdge, namely, E4 . 7796
The Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means that there’s no 7797
Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. Thus the Neutrosophic 7798

SuperHyperVertex, V3 , is excluded in every given Neutrosophic SuperHyperConnected. 7799

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- 7800
HyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7801
E1 , E2 and E3 are some empty Neutrosophic SuperHyperEdges but E4 is a Neutrosophic 7802
SuperHyperEdge. Thus in the terms of Neutrosophic SuperHyperNeighbor, there’s only 7803
one Neutrosophic SuperHyperEdge, namely, E4 . The Neutrosophic SuperHyperVertex, V3 7804

is Neutrosophic isolated means that there’s no Neutrosophic SuperHyperEdge has it as 7805

Henry Garrett · 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 7806

every given Neutrosophic SuperHyperConnected. 7807

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- 7808

HyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7809

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- 7810
HyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7811

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- 7812
HyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7813

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- 7814
HyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7815

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- 7816
HyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7817

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- 7818
HyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7819

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- 7820
HyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7821

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- 7822
HyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7823

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- 7824
HyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7825

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- 7826
HyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7827

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- 7828
HyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7829

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- 7830
HyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7831

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- 7832
HyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7833

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- 7834
HyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7835

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- 7836

HyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7837

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- 7838
HyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7839

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- 7840
HyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7841

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- 7842
HyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7843

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- 7844

HyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7845

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- 7846
HyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7847

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 7848

Neutrosophic SuperHyperClasses. 7849

Henry Garrett · 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 7850

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 7851

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). 7852
There’s a new way to redefine as 7853

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 7854
ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is straightforward.  7855

136EXM18a Example 42.0.5. In the Figure (31.1), the connected Neutrosophic SuperHyperPath ESHP : 7856
(V, E), is highlighted and featured. The Neutrosophic SuperHyperSet, in the Neutrosophic 7857
SuperHyperModel (31.1), is the SuperHyperConnected. 7858

Proposition 42.0.6. Assume a connected Neutrosophic SuperHyperCycle ESHC : (V, E). Then 7859

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 7860

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). 7861
There’s a new way to redefine as 7862

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 7863
ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is straightforward.  7864

136EXM19a Example 42.0.7. In the Figure (31.2), the connected Neutrosophic SuperHyperCycle N SHC : 7865
(V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, in the 7866
Neutrosophic SuperHyperModel (31.2), is the Neutrosophic SuperHyperConnected. 7867

Proposition 42.0.8. Assume a connected Neutrosophic SuperHyperStar ESHS : (V, E). Then 7868

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 7869

P : ViEXT ERN AL , Ei , CEN T ER, Ej .

be a longest path taken a connected Neutrosophic SuperHyperStar ESHS : (V, E). There’s a 7870

new way to redefine as 7871

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 7872

ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is straightforward.  7873

Henry Garrett · 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 : 7874
(V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, by the Algorithm 7875
in previous Neutrosophic result, of the Neutrosophic SuperHyperVertices of the connected 7876
Neutrosophic SuperHyperStar ESHS : (V, E), in the Neutrosophic SuperHyperModel (31.3), is 7877
the Neutrosophic SuperHyperConnected. 7878

Proposition 42.0.10. Assume a connected Neutrosophic SuperHyperBipartite ESHB : (V, E). 7879
Then 7880

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 7881

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

is a longest path taken from a connected Neutrosophic SuperHyperBipartite ESHB : (V, E). 7882
There’s a new way to redefine as 7883

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 7884
ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is straightforward. Then 7885
there’s no at least one SuperHyperConnected. Thus the notion of quasi may be up but the 7886
SuperHyperNotions based on SuperHyperConnected could be applied. There are only two 7887
SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as the 7888
representative in the 7889

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 7890

ESHB : (V, E). Thus only some SuperHyperVertices and only minimum-Neutrosophic-of- 7891
SuperHyperPart SuperHyperEdges are attained in any solution 7892

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

The latter is straightforward.  7893

136EXM21a Example 42.0.11. In the Neutrosophic Figure (31.4), the connected Neutrosophic SuperHy- 7894

perBipartite ESHB : (V, E), is Neutrosophic highlighted and Neutrosophic featured. The 7895
obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous Neutrosophic 7896
result, of the Neutrosophic SuperHyperVertices of the connected Neutrosophic SuperHyper- 7897
Bipartite ESHB : (V, E), in the Neutrosophic SuperHyperModel (31.4), is the Neutrosophic 7898
SuperHyperConnected. 7899

Proposition 42.0.12. Assume a connected Neutrosophic SuperHyperMultipartite ESHM : 7900

(V, E). Then 7901

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 7902

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 7903

ESHM : (V, E). There’s a new way to redefine as 7904

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 7905
ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is straightforward. Then 7906
there’s no at least one SuperHyperConnected. Thus the notion of quasi may be up but 7907
the SuperHyperNotions based on SuperHyperConnected could be applied. There are only 7908

z 0 SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as the 7909
representative in the 7910

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

is a longest path taken from a connected Neutrosophic SuperHyperMultipartite ESHM : (V, E). 7911
Thus only some SuperHyperVertices and only minimum-Neutrosophic-of-SuperHyperPart 7912
SuperHyperEdges are attained in any solution 7913

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

is a longest path taken from a connected Neutrosophic SuperHyperMultipartite ESHM : (V, E). 7914

The latter is straightforward.  7915

136EXM22a Example 42.0.13. In the Figure (31.5), the connected Neutrosophic SuperHyperMultipartite 7916
ESHM : (V, E), is highlighted and Neutrosophic featured. The obtained Neutrosophic 7917

SuperHyperSet, by the Algorithm in previous Neutrosophic result, of the Neutrosophic 7918

SuperHyperVertices of the connected Neutrosophic SuperHyperMultipartite ESHM : (V, E), 7919
in the Neutrosophic SuperHyperModel (31.5), is the Neutrosophic SuperHyperConnected. 7920

Proposition 42.0.14. Assume a connected Neutrosophic SuperHyperWheel ESHW : (V, E). 7921
Then, 7922

∗
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 7923

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 7924

ESHW : (V, E). There’s a new way to redefine as 7925

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 7926
to ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is straightforward. 7927

Then there’s at least one SuperHyperConnected. Thus the notion of quasi isn’t up and 7928
the SuperHyperNotions based on SuperHyperConnected could be applied. The unique 7929
embedded SuperHyperConnected proposes some longest SuperHyperConnected excerpt from 7930
some representatives. The latter is straightforward.  7931

136EXM23a Example 42.0.15. In the Neutrosophic Figure (31.6), the connected Neutrosophic SuperHyper- 7932
Wheel N SHW : (V, E), is Neutrosophic highlighted and featured. The obtained Neutrosophic 7933
SuperHyperSet, by the Algorithm in previous result, of the Neutrosophic SuperHyperVer- 7934
tices of the connected Neutrosophic SuperHyperWheel ESHW : (V, E), in the Neutrosophic 7935
SuperHyperModel (31.6), is the Neutrosophic SuperHyperConnected. 7936

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 CHAPTER 43 7937

Background 7938

There are some scientific researches covering the topic of this research. In what follows, there 7939
are some discussion and literature reviews about them. 7940

The seminal paper and groundbreaking article is titled “neutrosophic co-degree and neutrosophic 7941
degree alongside chromatic numbers in the setting of some classes related to neutrosophic 7942
hypergraphs” in Ref. [HG1] by Henry Garrett (2022). In this research article, a novel approach 7943
is implemented on SuperHyperGraph and neutrosophic SuperHyperGraph based on general 7944
forms without using neutrosophic classes of neutrosophic SuperHyperGraph. It’s published 7945
in prestigious and fancy journal is entitled “Journal of Current Trends in Computer Science 7946

Research (JCTCSR)” with ISO abbreviation “J Curr Trends Comp Sci Res” in volume 1 7947
and issue 1 with pages 06-14. The research article studies deeply with choosing neutrosophic 7948
hypergraphs instead of neutrosophic SuperHyperGraph. It’s the breakthrough toward independent 7949
results based on initial background. 7950
The seminal paper and groundbreaking article is titled “Super Hyper Dominating and Super 7951
Hyper Resolving on Neutrosophic Super Hyper Graphs and Their Directions in Game Theory and 7952

Neutrosophic Super Hyper Classes” in Ref. [HG2] by Henry Garrett (2022). In this research 7953
article, a novel approach is implemented on SuperHyperGraph and neutrosophic SuperHyper- 7954
Graph based on fundamental SuperHyperNumber and using neutrosophic SuperHyperClasses 7955
of neutrosophic SuperHyperGraph. It’s published in prestigious and fancy journal is entitled 7956
“Journal of Mathematical Techniques and Computational Mathematics(JMTCM)” with ISO 7957
abbreviation “J Math Techniques Comput Math” in volume 1 and issue 3 with pages 242-263. 7958

The research article studies deeply with choosing directly neutrosophic SuperHyperGraph and 7959
SuperHyperGraph. It’s the breakthrough toward independent results based on initial background 7960
and fundamental SuperHyperNumbers. 7961
The seminal paper and groundbreaking article is titled “Some Super Hyper Degrees and Co-Super 7962
Hyper Degrees on Neutrosophic Super Hyper Graphs And Super Hyper Graphs Alongside 7963
Applications in Cancer’s Treatments” in Ref. [HG3] by Henry Garrett (2023). In this research 7964

article, a novel approach is implemented on SuperHyperGraph and neutrosophic SuperHy- 7965

perGraph based on fundamental notions and using vital tools in Cancer’s Treatments. It’s 7966
published in prestigious and fancy journal is entitled “Journal of Mathematical Techniques and 7967
Computational Mathematics(JMTCM)” with ISO abbreviation “J Math Techniques Comput 7968
Math” in volume 2 and issue 1 with pages 35-47. The research article studies deeply with 7969
choosing directly neutrosophic SuperHyperGraph and SuperHyperGraph. It’s the breakthrough 7970

toward independent results based on initial background and fundamental SuperHyperNumbers. 7971

415
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 7972
(Dual)Resolving and (Dual)Coloring alongside (Dual)Dominating in (Neutrosophic)n- 7973
SuperHyperGraph” in Ref. [HG4] by Henry Garrett (2022), “0049 | (Failed)1-Zero-Forcing 7974
Number in Neutrosophic Graphs” in Ref. [HG5] by Henry Garrett (2022), “Extreme SuperHy- 7975
perClique as the Firm Scheme of Confrontation under Cancer’s Recognition as the Model in 7976
The Setting of (Neutrosophic) SuperHyperGraphs” in Ref. [HG6] by Henry Garrett (2022), 7977

“Uncertainty On The Act And Effect Of Cancer Alongside The Foggy Positions Of Cells Toward 7978
Neutrosophic Failed SuperHyperClique inside Neutrosophic SuperHyperGraphs Titled Cancer’s 7979
Recognition” in Ref. [HG7] by Henry Garrett (2022), “Neutrosophic Version Of Separates 7980
Groups Of Cells In Cancer’s Recognition On Neutrosophic SuperHyperGraphs” in Ref. [HG8] 7981
by Henry Garrett (2022), “The Shift Paradigm To Classify Separately The Cells and Affected 7982
Cells Toward The Totality Under Cancer’s Recognition By New Multiple Definitions On the 7983

Sets Polynomials Alongside Numbers In The (Neutrosophic) SuperHyperMatching Theory 7984

Based on SuperHyperGraph and Neutrosophic SuperHyperGraph” in Ref. [HG9] by Henry 7985
Garrett (2022), “Breaking the Continuity and Uniformity of Cancer In The Worst Case of 7986
Full Connections With Extreme Failed SuperHyperClique In Cancer’s Recognition Applied in 7987
(Neutrosophic) SuperHyperGraphs” in Ref. [HG10] by Henry Garrett (2022), “Neutrosophic 7988
Failed SuperHyperStable as the Survivors on the Cancer’s Neutrosophic Recognition Based 7989

on Uncertainty to All Modes in Neutrosophic SuperHyperGraphs” in Ref. [HG11] by Henry 7990

Garrett (2022), “Extremism of the Attacked Body Under the Cancer’s Circumstances Where 7991
Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs” in Ref. [HG12] by Henry 7992
Garrett (2022), “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Recognitions And 7993
(Neutrosophic) SuperHyperGraphs” in Ref. [HG13] by Henry Garrett (2022), “Neutrosophic 7994
Messy-Style SuperHyperGraphs To Form Neutrosophic SuperHyperStable To Act on Cancer’s 7995

Neutrosophic Recognitions In Special ViewPoints” in Ref. [HG14] by Henry Garrett (2022), 7996
“Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To Use Neutrosophic 7997
SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond” in Ref. [HG15] by 7998
Henry Garrett (2022), “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well- 7999
SuperHyperModelled (Neutrosophic) SuperHyperGraphs ” in Ref. [HG16] by Henry Garrett 8000
(2022), “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic SuperHyperStable 8001

To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints” in Ref. [HG12] by 8002

Henry Garrett (2022), “Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutro- 8003
sophic) SuperHyperModeling in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs” 8004
in Ref. [HG17] by Henry Garrett (2022), “Neutrosophic Messy-Style SuperHyperGraphs To 8005
Form Neutrosophic SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special 8006

ViewPoints” in Ref. [HG18] by Henry Garrett (2022),“(Neutrosophic) SuperHyperModeling of 8007

Cancer’s Recognitions Featuring (Neutrosophic) SuperHyperDefensive SuperHyperAlliances” in 8008
Ref. [HG19] by Henry Garrett (2022), “(Neutrosophic) SuperHyperAlliances With SuperHyper- 8009
Defensive and SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph 8010
With (Neutrosophic) SuperHyperModeling of Cancer’s Recognitions And Related (Neutrosophic) 8011
SuperHyperClasses” in Ref. [HG20] by Henry Garrett (2022), “SuperHyperGirth on Su- 8012

perHyperGraph and Neutrosophic SuperHyperGraph With SuperHyperModeling of Cancer’s 8013

Recognitions” in Ref. [HG21] by Henry Garrett (2022), “Some SuperHyperDegrees and 8014
Co-SuperHyperDegrees on Neutrosophic SuperHyperGraphs and SuperHyperGraphs Alongside 8015
Applications in Cancer’s Treatments” in Ref. [HG22] by Henry Garrett (2022), “Super- 8016
HyperDominating and SuperHyperResolving on Neutrosophic SuperHyperGraphs And Their 8017

Henry Garrett · 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 8018
Garrett (2022), “SuperHyperMatching By (R-)Definitions And Polynomials To Monitor Cancer’s 8019
Recognition In Neutrosophic SuperHyperGraphs” in Ref. [HG24] by Henry Garrett (2023), 8020
“The Focus on The Partitions Obtained By Parallel Moves In The Cancer’s Extreme Recognition 8021
With Different Types of Extreme SuperHyperMatching Set and Polynomial on (Neutrosophic) Su- 8022
perHyperGraphs” in Ref. [HG25] by Henry Garrett (2023), “Extreme Failed SuperHyperClique 8023

Decides the Failures on the Cancer’s Recognition in the Perfect Connections of Cancer’s Attacks 8024
By SuperHyperModels Named (Neutrosophic) SuperHyperGraphs” in Ref. [HG26] by Henry 8025
Garrett (2023), “Indeterminacy On The All Possible Connections of Cells In Front of Cancer’s 8026
Attacks In The Terms of Neutrosophic Failed SuperHyperClique on Cancer’s Recognition 8027
called Neutrosophic SuperHyperGraphs” in Ref. [HG27] by Henry Garrett (2023), “Perfect 8028
Directions Toward Idealism in Cancer’s Neutrosophic Recognition Forwarding Neutrosophic 8029

SuperHyperClique on Neutrosophic SuperHyperGraphs” in Ref. [HG28] by Henry Garrett 8030

(2023), “Demonstrating Complete Connections in Every Embedded Regions and Sub-Regions in 8031
the Terms of Cancer’s Recognition and (Neutrosophic) SuperHyperGraphs With (Neutrosophic) 8032
SuperHyperClique” in Ref. [HG29] by Henry Garrett (2023), “Different Neutrosophic Types 8033
of Neutrosophic Regions titled neutrosophic Failed SuperHyperStable in Cancer’s Neutrosophic 8034
Recognition modeled in the Form of Neutrosophic SuperHyperGraphs” in Ref. [HG30] by 8035

Henry Garrett (2023), “Using the Tool As (Neutrosophic) Failed SuperHyperStable To SuperHy- 8036
perModel Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs” in Ref. [HG31] by 8037
Henry Garrett (2023), “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic 8038
SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints” in Ref. 8039
[HG32] by Henry Garrett (2023), “(Neutrosophic) SuperHyperStable on Cancer’s Recognition 8040
by Well-SuperHyperModelled (Neutrosophic) SuperHyperGraphs” in Ref. [HG33] by Henry 8041

Garrett (2023), “Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To Use 8042

Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond” in Ref. 8043
[HG34] by Henry Garrett (2022), “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s 8044
Recognitions And (Neutrosophic) SuperHyperGraphs” in Ref. [HG35] by Henry Garrett 8045
(2022), “Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic) SuperHyper- 8046
Modeling in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs” in Ref. [HG36] 8047

by Henry Garrett (2022), “Basic Neutrosophic Notions Concerning SuperHyperDominating 8048

and Neutrosophic SuperHyperResolving in SuperHyperGraph” in Ref. [HG37] by Henry 8049
Garrett (2022), “Initial Material of Neutrosophic Preliminaries to Study Some Neutrosophic 8050
Notions Based on Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic SuperHyperGraph 8051
(NSHG)” in Ref. [HG38] by Henry Garrett (2022), and [HG4; HG5; HG6; HG7; HG8; 8052

HG9; HG10; HG11; HG12; HG13; HG14; HG15; HG16; HG17; HG18; HG19; 8053
HG20; HG21; HG22; HG23; HG24; HG25; HG26; HG27; HG28; HG29; HG30; 8054
HG31; HG32; HG33; HG34; HG35; HG36; HG37; HG38; HG94; HG942; HG95; 8055
HG952; HG96; HG962; HG97; HG972; HG98; HG982; HG106; HG107; HG111; 8056
HG112; HG115; HG116; HG120; HG121; HG122; HG123; HG124; HG125; HG126; 8057
HG127; HG128; HG129; HG130; HG131; HG132; HG134; HG135; HG136; HG137; 8058

HG138; HG139; HG140; HG141; HG142; HG143; HG144; HG145; HG146; HG147; 8059
HG148; HG149; HG150; HG151; HG152; HG153; HG154; HG155; HG156; HG157; 8060
HG158; HG159; HG160; HG161; HG162; HG163; HG164; HG165; HG166; HG167; 8061
HG168; HG169; HG170; HG171; HG172; HG173; HG174; HG175; HG176; HG177; 8062
HG178; HG179; HG180; HG181; HG182; HG183; HG184; HG185; HG186; HG187; 8063

Henry Garrett · 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; HG189; HG190; HG191; HG192; HG193; HG194; HG195; HG196; HG197; 8064
HG198; HG199; HG200; HG201; HG202; HG203; HG204; HG205; HG206; HG207; 8065
HG208; HG209; HG210; HG211; HG212; HG213; HG214; HG215; HG216; HG217; 8066
HG218; HG219; HG220; HG221; HG222; HG223; HG224; HG225; HG226; HG228; 8067
HG230; HG231; HG232; HG233; HG234], there are some endeavors to formalize the 8068
basic SuperHyperNotions about neutrosophic SuperHyperGraph and SuperHyperGraph along- 8069

side scientific research books at [HG60b; HG61b; HG62b; HG63b; HG64b; HG65b; 8070
HG66b; HG67b; HG68b; HG69b; HG70b; HG71b; HG72b; HG73b; HG74b; 8071
HG75b; HG76b; HG77b; HG78b; HG79b; HG80b; HG81b; HG82b; HG83b; 8072
HG84b; HG85b; HG86b; HG87b; HG88b; HG89b; HG90b; HG91b; HG92b; 8073
HG93b; HG94b; HG95b; HG96b; HG97b; HG98b; HG99b; HG100b; HG101b; 8074
HG102b; HG103b; HG104b; HG105b; HG106b; HG107b; HG108b; HG109b; 8075

HG110b; HG111b; HG112b; HG113b; HG114b; HG115b; HG116b; HG117b; 8076

HG118b; HG119b; HG120b; HG121b; HG122b; HG123b; HG124b; HG125b; 8077
HG126b; HG127b; HG128b; HG129b; HG130b; HG131b; HG132b; HG133b; 8078
HG134b; HG135b; HG136b; HG137b; HG138b; HG139b; HG140b; HG141b; 8079
HG142b; HG143b; HG144b; HG145b; HG146b; HG147b; HG148b; HG149b; 8080
HG150b; HG151b; HG152b; HG153b; HG154b; HG155b]. Two popular scientific 8081

research books in Scribd in the terms of high readers, 4190 and 5189 respectively, on neutro- 8082
sophic science is on [HG32b; HG44b]. 8083
Some scientific studies and scientific researches about neutrosophic graphs, are proposed as book 8084
in Ref. [HG71b] by Henry Garrett (2023) which is indexed by Google Scholar and has more 8085
than 4190 readers in Scribd. It’s titled “Beyond Neutrosophic Graphs” and published by Dr. 8086
Henry Garrett. This research book covers different types of notions and settings in neutrosophic 8087

graph theory and neutrosophic SuperHyperGraph theory. 8088

Also, some scientific studies and scientific researches about neutrosophic graphs, are proposed 8089
as book in Ref. [HG70b] by Henry Garrett (2023) which is indexed by Google Scholar and 8090
has more than 5189 readers in Scribd. It’s titled “Neutrosophic Duality” and published by Dr. 8091
Henry Garrett. This research book presents different types of notions SuperHyperResolving and 8092
SuperHyperDominating in the setting of duality in neutrosophic graph theory and neutrosophic 8093

SuperHyperGraph theory. This research book has scrutiny on the complement of the intended set 8094
and the intended set, simultaneously. It’s smart to consider a set but acting on its complement 8095
that what’s done in this research book which is popular in the terms of high readers in Scribd. 8096
See the seminal scientific researches [HG1; HG2; HG3]. The formalization of the notions 8097
on the framework of notions in SuperHyperGraphs, Neutrosophic notions in SuperHyper- 8098

Graphs theory, and (Neutrosophic) SuperHyperGraphs theory at [HG4; HG5; HG6; HG7; 8099
HG8; HG9; HG10; HG11; HG12; HG13; HG14; HG15; HG16; HG17; HG18; 8100
HG19; HG20; HG21; HG22; HG23; HG24; HG25; HG26; HG27; HG28; HG29; 8101
HG30; HG31; HG32; HG33; HG34; HG35; HG36; HG37; HG38; HG94; HG942; 8102
HG95; HG952; HG96; HG962; HG97; HG972; HG98; HG982; HG106; HG107; 8103
HG111; HG112; HG115; HG116; HG120; HG121; HG122; HG123; HG124; HG125; 8104

HG126; HG127; HG128; HG129; HG130; HG131; HG132; HG134; HG135; HG136; 8105
HG137; HG138; HG139; HG140; HG141; HG142; HG143; HG144; HG145; HG146; 8106
HG147; HG148; HG149; HG150; HG151; HG152; HG153; HG154; HG155; HG156; 8107
HG157; HG158; HG159; HG160; HG161; HG162; HG163; HG164; HG165; HG166; 8108
HG167; HG168; HG169; HG170; HG171; HG172; HG173; HG174; HG175; HG176; 8109

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 Henry Garrett · Independent Researcher · Department of Mathematics ·
DrHenryGarrett@gmail.com · Manhattan, NY, USA

HG177; HG178; HG179; HG180; HG181; HG182; HG183; HG184; HG185; HG186; 8110
HG187; HG188; HG189; HG190; HG191; HG192; HG193; HG194; HG195; HG196; 8111
HG197; HG198; HG199; HG200; HG201; HG202; HG203; HG204; HG205; HG206; 8112
HG207; HG208; HG209; HG210; HG211; HG212; HG213; HG214; HG215; HG216; 8113
HG217; HG218; HG219; HG220; HG221; HG222; HG223; HG224; HG225; HG226; 8114
HG228; HG230; HG231; HG232; HG233; HG234] alongside scientific research books 8115

at [HG60b; HG61b; HG62b; HG63b; HG64b; HG65b; HG66b; HG67b; HG68b; 8116
HG69b; HG70b; HG71b; HG72b; HG73b; HG74b; HG75b; HG76b; HG77b; 8117
HG78b; HG79b; HG80b; HG81b; HG82b; HG83b; HG84b; HG85b; HG86b; 8118
HG87b; HG88b; HG89b; HG90b; HG91b; HG92b; HG93b; HG94b; HG95b; 8119
HG96b; HG97b; HG98b; HG99b; HG100b; HG101b; HG102b; HG103b; HG104b; 8120
HG105b; HG106b; HG107b; HG108b; HG109b; HG110b; HG111b; HG112b; 8121

HG113b; HG114b; HG115b; HG116b; HG117b; HG118b; HG119b; HG120b; 8122

HG121b; HG122b; HG123b; HG124b; HG125b; HG126b; HG127b; HG128b; 8123
HG129b; HG130b; HG131b; HG132b; HG133b; HG134b; HG135b; HG136b; 8124
HG137b; HG138b; HG139b; HG140b; HG141b; HG142b; HG143b; HG144b; 8125
HG145b; HG146b; HG147b; HG148b; HG149b; HG150b; HG151b; HG152b; 8126
HG153b; HG154b; HG155b]. Two popular scientific research books in Scribd in the 8127

terms of high readers, 4190 and 5189 respectively, on neutrosophic science is on [HG32b; 8128
HG44b]. 8129

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 Bibliography 8130

HG1 [1] Henry Garrett, “Neutrosophic Co-degree and Neutrosophic Degree alongside Chromatic 8131

Numbers in the Setting of Some Classes Related to Neutrosophic Hypergraphs”, J Curr 8132
Trends Comp Sci Res 1(1) (2022) 06-14. 8133

HG2 [2] Henry Garrett, “Super Hyper Dominating and Super Hyper Resolving on Neutro- 8134

sophic Super Hyper Graphs and Their Directions in Game Theory and Neutrosophic 8135
Super Hyper Classes”, J Math Techniques Comput Math 1(3) (2022) 242-263. (doi: 8136
10.33140/JMTCM.01.03.09) 8137

HG3 [3] Henry Garrett, “Some Super Hyper Degrees and Co-Super Hyper Degrees on Neut- 8138
rosophic Super Hyper Graphs And Super Hyper Graphs Alongside Applications 8139
in Cancer’s Treatments”, J Math Techniques Comput Math 2(1) (2023) 35-47. 8140
(https://www.opastpublishers.com/open-access-articles/some-super-hyper-degrees-and- 8141
cosuper-hyper-degrees-on-neutrosophic-super-hyper-graphs-and-super-hyper-graphs- 8142

alongside-a.pdf) 8143

HG216 [4] Henry Garrett, “A Research on Cancers Recognition and Neutrosophic Super 8144
Hypergraph by Eulerian Super Hyper Cycles and Hamiltonian Sets as Hyper Cov- 8145

ering Versus Super separations”, J Math Techniques Comput Math 2(3) (2023) 8146
136-148. (https://www.opastpublishers.com/open-access-articles/a-research-on-cancers- 8147
recognition-and-neutrosophic-super-hypergraph-by-eulerian-super-hyper-cycles-and- 8148
hamiltonian-sets-.pdf) 8149

HG4 [5] Garrett, Henry. “0039 | Closing Numbers and Super-Closing Numbers as (Dual)Resolving 8150
and (Dual)Coloring alongside (Dual)Dominating in (Neutrosophic)n-SuperHyperGraph.” 8151
CERN European Organization for Nuclear Research - Zenodo, Nov. 2022. CERN 8152
European Organization for Nuclear Research, https://doi.org/10.5281/zenodo.6319942. 8153
https://oa.mg/work/10.5281/zenodo.6319942 8154

HG5 [6] Garrett, Henry. “0049 | (Failed)1-Zero-Forcing Number in Neutrosophic Graphs.” CERN 8155
European Organization for Nuclear Research - Zenodo, Feb. 2022. CERN European 8156
Organization for Nuclear Research, https://doi.org/10.13140/rg.2.2.35241.26724. ht- 8157

tps://oa.mg/work/10.13140/rg.2.2.35241.26724 8158

421
 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 8159
Cancer’s Recognition as the Model in The Setting of (Neutrosophic) SuperHyperGraphs”, 8160
Preprints 2023, 2023010308 (doi: 10.20944/preprints202301.0308.v1). 8161

HG7 [8] Henry Garrett, “Uncertainty On The Act And Effect Of Cancer Alongside The Foggy 8162
Positions Of Cells Toward Neutrosophic Failed SuperHyperClique inside Neutrosophic 8163
SuperHyperGraphs Titled Cancer’s Recognition”, Preprints 2023, 2023010282 (doi: 8164
10.20944/preprints202301.0282.v1). 8165

HG8 [9] Henry Garrett, “Neutrosophic Version Of Separates Groups Of Cells In Cancer’s 8166
Recognition On Neutrosophic SuperHyperGraphs”, Preprints 2023, 2023010267 (doi: 8167
10.20944/preprints202301.0267.v1). 8168

HG9 [10] Henry Garrett, “The Shift Paradigm To Classify Separately The Cells and Affected 8169
Cells Toward The Totality Under Cancer’s Recognition By New Multiple Definitions On 8170
the Sets Polynomials Alongside Numbers In The (Neutrosophic) SuperHyperMatching 8171

Theory Based on SuperHyperGraph and Neutrosophic SuperHyperGraph”, Preprints 2023, 8172

2023010265 (doi: 10.20944/preprints202301.0265.v1). 8173

HG10 [11] Henry Garrett, “Breaking the Continuity and Uniformity of Cancer In The Worst Case of 8174

Full Connections With Extreme Failed SuperHyperClique In Cancer’s Recognition Applied 8175
in (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010262,(doi: 10.20944/pre- 8176
prints202301.0262.v1). 8177

HG11 [12] Henry Garrett, “Neutrosophic Failed SuperHyperStable as the Survivors on the Cancer’s 8178
Neutrosophic Recognition Based on Uncertainty to All Modes in Neutrosophic SuperHy- 8179
perGraphs”, Preprints 2023, 2023010240 (doi: 10.20944/preprints202301.0240.v1). 8180

HG12 [13] Henry Garrett, “Extremism of the Attacked Body Under the Cancer’s Circumstances 8181
Where Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 8182
2023010224, (doi: 10.20944/preprints202301.0224.v1). 8183

HG13 [14] Henry Garrett, “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Recognitions 8184
And (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010105 (doi: 10.20944/pre- 8185
prints202301.0105.v1). 8186

HG14 [15] Henry Garrett, “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic 8187
SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints”, 8188
Preprints 2023, 2023010088 (doi: 10.20944/preprints202301.0088.v1). 8189

HG15 [16] Henry Garrett, “Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To 8190
Use Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond”, 8191
Preprints 2023, 2023010044 8192

HG16 [17] Henry Garrett, “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well- 8193
SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010043 8194
(doi: 10.20944/preprints202301.0043.v1). 8195

HG17 [18] Henry Garrett, “Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic) 8196
SuperHyperModeling in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs”, 8197

Preprints 2023, 2023010105 (doi: 10.20944/preprints202301.0105.v1). 8198

Henry Garrett · 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 8199
SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints”, 8200
Preprints 2023, 2023010088 (doi: 10.20944/preprints202301.0088.v1). 8201

HG19 [20] Henry Garrett, “(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions Featuring 8202
(Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, Preprints 2022, 2022120549 8203

(doi: 10.20944/preprints202212.0549.v1). 8204

HG20 [21] Henry Garrett, “(Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and Su- 8205
perHyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With (Neut- 8206
rosophic) SuperHyperModeling of Cancer’s Recognitions And Related (Neutrosophic) Su- 8207
perHyperClasses”, Preprints 2022, 2022120540 (doi: 10.20944/preprints202212.0540.v1). 8208

HG21 [22] Henry Garrett, “SuperHyperGirth on SuperHyperGraph and Neutrosophic SuperHyper- 8209
Graph With SuperHyperModeling of Cancer’s Recognitions”, Preprints 2022, 2022120500 8210
(doi: 10.20944/preprints202212.0500.v1). 8211

HG22 [23] Henry Garrett, “Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic 8212
SuperHyperGraphs and SuperHyperGraphs Alongside Applications in Cancer’s Treatments”, 8213
Preprints 2022, 2022120324 (doi: 10.20944/preprints202212.0324.v1). 8214

HG23 [24] Henry Garrett, “SuperHyperDominating and SuperHyperResolving on Neutrosophic Super- 8215
HyperGraphs And Their Directions in Game Theory and Neutrosophic SuperHyperClasses”, 8216
Preprints 2022, 2022110576 (doi: 10.20944/preprints202211.0576.v1). 8217

HG234 [25] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph 8218
By Hamiltonian-Type-Cycle-Decomposition As Hyper Decompress On Super Decompensa- 8219

tion”, Zenodo 2023, (doi: 10.5281/zenodo.7804238). 8220

HG233 [26] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of 8221
Hamiltonian-Type-Cycle-Decomposition In Cancer’s Recognition With (Neutrosophic) 8222
SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zenodo.7804228). 8223

HG232 [27] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph 8224

By Hamiltonian-Type-Cycle-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, 8225

(doi: 10.5281/zenodo.7799902). 8226

HG231 [28] Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Type- 8227
Cycle-Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 8228
2023, (doi: 10.5281/zenodo.7804218). 8229

HG230 [29] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph 8230
By Hamiltonian-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, 8231
(doi: 10.5281/zenodo.7796334). 8232

HG228 [30] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph 8233
By Hamiltonian-Cycle-Decomposition As Hyper Decompress On Super Decompensation”, 8234

Zenodo 2023, (doi: 10.5281/zenodo.7793372). 8235

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 Henry Garrett · Independent Researcher · Department of Mathematics ·
DrHenryGarrett@gmail.com · Manhattan, NY, USA

HG226 [31] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph 8236
By Hamiltonian-Cycle-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi: 8237
10.5281/zenodo.7791952). 8238

HG225 [32] Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Cycle- 8239
Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 8240
10.5281/zenodo.7791982). 8241

HG224 [33] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph 8242
By Hamiltonian-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 8243
10.5281/zenodo.7790026). 8244

HG223 [34] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Hamiltonian-Neighbor 8245
In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 8246
10.5281/zenodo.7790052). 8247

HG222 [35] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph 8248
By Hamiltonian-Decomposition As Hyper Decompress On Super Decompensation”, Zenodo 8249
2023, (doi: 10.5281/zenodo.7787066). 8250

HG221 [36] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of 8251
Hamiltonian-Decomposition In Recognition of Cancer With (Neutrosophic) SuperHy- 8252
perGraph”, Zenodo 2023, (doi: 10.5281/zenodo.7787094). 8253

HG220 [37] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph 8254
By Hamiltonian-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi: 8255
10.5281/zenodo.7781476). 8256

HG219 [38] Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Cut 8257
In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 8258
10.5281/zenodo.7783082). 8259

HG218 [39] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyper- 8260
Graph By Trace-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 8261
10.5281/zenodo.7777857). 8262

HG217 [40] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Trace-Neighbor 8263
In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 8264
10.5281/zenodo.7779286). 8265

HG215 [41] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 8266
By Trace-Decomposition As Hyper Decompress On Super Decompensation”, Zenodo 2023, 8267
(doi: 10.5281/zenodo.7771831). 8268

HG214 [42] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of Trace- 8269
Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 8270
2023, (doi: 10.5281/zenodo.7772468). 8271

HG213 [43] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 8272
By Trace-Cut As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 8273

10.13140/RG.2.2.20913.25446). 8274

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 Henry Garrett · Independent Researcher · Department of Mathematics ·
DrHenryGarrett@gmail.com · Manhattan, NY, USA

HG212 [44] Henry Garrett, “New Ideas On Super Tract By Hyper Track Of Trace-Cut In Cancer’s 8275
Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zen- 8276
odo.7764916). 8277

HG211 [45] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 8278
By Edge-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 8279
10.13140/RG.2.2.11770.98247). 8280

HG210 [46] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Edge-Neighbor In 8281
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 8282
10.13140/RG.2.2.12400.12808). 8283

HG209 [47] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 8284
By Edge-Decomposition As Hyper Decompress On Super Decompensation”, ResearchGate 8285
2023, (doi: 10.13140/RG.2.2.22545.10089). 8286

HG208 [48] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of 8287
Edge-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 8288
ResearchGate 2023, (doi: 10.13140/RG.2.2.29544.34564). 8289

HG207 [49] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyper- 8290
Graph By Edge-Cut As Hyper Edify On Super Eddy”, ResearchGate 2023, (doi: 8291
10.13140/RG.2.2.11377.76644). 8292

HG206 [50] Henry Garrett, “New Ideas On Super Eddy By Hyper Edify Of Edge-Cut In Can- 8293
cer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 8294
10.13140/RG.2.2.23750.96329). 8295

HG205 [51] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 8296
By Vertex-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 8297
10.13140/RG.2.2.31366.24641). 8298

HG204 [52] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Vertex-Neighbor In 8299
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 8300
10.13140/RG.2.2.34721.68960). 8301

HG203 [53] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 8302
By Vertex-Decomposition As Hyper Decompress On Super Decompensation”, ResearchGate 8303
2023, (doi: 10.13140/RG.2.2.30212.81289). 8304

HG202 [54] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of 8305
Vertex-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 8306
ResearchGate 2023, (doi: 10.13140/RG.2.2.18468.76169). 8307

HG201 [55] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyper- 8308
Graph By Vertex-Cut As Hyper Vertu On Super Vertigo”, ResearchGate 2023, (doi: 8309
10.13140/RG.2.2.24288.35842). 8310

HG200 [56] Henry Garrett, “New Ideas On Super Vertigo By Hyper Vertu Of Vertex-Cut In 8311
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 8312

10.13140/RG.2.2.32467.25124). 8313

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 Henry Garrett · Independent Researcher · Department of Mathematics ·
DrHenryGarrett@gmail.com · Manhattan, NY, USA

HG199 [57] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 8314
By Stable-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 8315
10.13140/RG.2.2.31025.45925). 8316

HG198 [58] Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of Stable-Neighbor In 8317
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 8318
10.13140/RG.2.2.17184.25602). 8319

HG197 [59] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 8320
By Stable-Decompositions As Hyper Stain On Super Stagy”, ResearchGate 2023, (doi: 8321
10.13140/RG.2.2.23423.28327). 8322

HG196 [60] Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Decompositions In 8323
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 8324
10.13140/RG.2.2.28456.44805). 8325

HG195 [61] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyper- 8326
Graph By Stable-Cut As Hyper Stain On Super Stagy”, ResearchGate 2023, (doi: 8327
10.13140/RG.2.2.23525.68320). 8328

HG194 [62] Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Cut In Can- 8329
cer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 8330
10.13140/RG.2.2.20170.24000). 8331

HG193 [63] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 8332
By Clique-Neighbors As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 8333
10.13140/RG.2.2.36475.59683). 8334

HG192 [64] Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of Clique-Neighbors In 8335
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 8336
10.13140/RG.2.2.29764.71046). 8337

HG191 [65] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 8338
By Clique-Decompositions As Hyper Decompile On Super Decommission”, ResearchGate 8339
2023, (doi: 10.13140/RG.2.2.18780.87683). 8340

HG190 [66] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of 8341
Clique- Decompositions In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 8342
ResearchGate 2023, (doi: 10.13140/RG.2.2.27169.48487). 8343

HG189 [67] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyper- 8344
Graph By Clique-Cut As Hyper Click On Super Cliche”, ResearchGate 2023, (doi: 8345
10.13140/RG.2.2.26134.01603). 8346

HG188 [68] Henry Garrett, “New Ideas On Super Cliff By Hyper Cling Of Clique-Cut In Can- 8347
cer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 8348
10.13140/RG.2.2.27392.30721). 8349

HG187 [69] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHy- 8350
perGraph By Space As Hyper Spin On Super Spacy”, ResearchGate 2023, (doi: 8351

10.13140/RG.2.2.33028.40321). 8352

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 Henry Garrett · Independent Researcher · Department of Mathematics ·
DrHenryGarrett@gmail.com · Manhattan, NY, USA

HG186 [70] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyper- 8353
Graph By List- Coloring As Hyper List On Super Lisle”, ResearchGate 2023, (doi: 8354
10.13140/RG.2.2.21389.20966). 8355

HG185 [71] Henry Garrett, “New Ideas On Super Lith By Hyper Lite Of List-Coloring In 8356
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 8357
10.13140/RG.2.2.16356.04489). 8358

HG184 [72] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHy- 8359
perGraph By Space As Hyper Sparse On Super Spark”, ResearchGate 2023, (doi: 8360
10.13140/RG.2.2.21756.21129). 8361

HG183 [73] Henry Garrett, “New Ideas On Super Solidarity By Hyper Soul Of Space In 8362
Cancer’s Recognition With (Extreme) SuperHyperGraph”, ResearchGate 2023, (doi: 8363
10.13140/RG.2.2.30983.68009). 8364

HG182 [74] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 8365
By Edge-Connectivity As Hyper Disclosure On Super Closure”, ResearchGate 2023, (doi: 8366
10.13140/RG.2.2.28552.29445). 8367

HG181 [75] Henry Garrett, “New Ideas On Super Uniform By Hyper Deformation Of Edge- 8368
Connectivity In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchG- 8369
ate 2023, (doi: 10.13140/RG.2.2.10936.21761). 8370

HG180 [76] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 8371
By Vertex-Connectivity As Hyper Leak On Super Structure”, ResearchGate 2023, (doi: 8372
10.13140/RG.2.2.35105.89447). 8373

HG179 [77] Henry Garrett, “New Ideas On Super System By Hyper Explosions Of Vertex-Connectivity 8374
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, 8375
(doi: 10.13140/RG.2.2.30072.72960). 8376

HG178 [78] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 8377
By Tree-Decomposition As Hyper Forward On Super Returns”, ResearchGate 2023, (doi: 8378
10.13140/RG.2.2.31147.52003). 8379

HG177 [79] Henry Garrett, “New Ideas On Super Nodes By Hyper Moves Of Tree-Decomposition In 8380
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 8381
10.13140/RG.2.2.32825.24163). 8382

HG176 [80] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyper- 8383
Graph By Chord As Hyper Excellence On Super Excess”, ResearchGate 2023, (doi: 8384
10.13140/RG.2.2.13059.58401). 8385

HG175 [81] Henry Garrett, “New Ideas On Super Gap By Hyper Navigations Of Chord In 8386
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 8387
10.13140/RG.2.2.11172.14720). 8388

HG174 [82] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 8389
By SuperHyper(i,j)-Domination As Hyper Controller On Super Waves”, ResearchGate 8390

2023, (doi: 10.13140/RG.2.2.22011.80165). 8391

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 Henry Garrett · Independent Researcher · Department of Mathematics ·
DrHenryGarrett@gmail.com · Manhattan, NY, USA

HG173 [83] Henry Garrett, “New Ideas On Super Coincidence By Hyper Routes Of SuperHyper(i,j)- 8392
Domination In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchG- 8393
ate 2023, (doi: 10.13140/RG.2.2.30819.84003). 8394

HG172 [84] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 8395
By SuperHyperEdge-Domination As Hyper Reversion On Super Indirection”, ResearchGate 8396
2023, (doi: 10.13140/RG.2.2.10493.84962). 8397

HG171 [85] Henry Garrett, “New Ideas On Super Obstacles By Hyper Model Of SuperHyperEdge- 8398
Domination In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchG- 8399
ate 2023, (doi: 10.13140/RG.2.2.13849.29280). 8400

HG170 [86] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 8401
By SuperHyperK-Domination As Hyper k-Actions On Super Patterns”, ResearchGate 8402
2023, (doi: 10.13140/RG.2.2.19944.14086). 8403

HG169 [87] Henry Garrett, “New Ideas On Super Harmony By Hyper k-Function Of SuperHyperK- 8404
Domination In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchG- 8405
ate 2023, (doi: 10.13140/RG.2.2.23299.58404). 8406

HG168 [88] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 8407
By SuperHyperK-Number As Hyper k-Partition On Super Layers”, ResearchGate 2023, 8408
(doi: 10.13140/RG.2.2.33103.76968). 8409

HG167 [89] Henry Garrett, “New Ideas On Super Gradient By Hyper k-Class Of SuperHyperK-Number 8410
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, 8411
(doi: 10.13140/RG.2.2.23037.44003). 8412

HG166 [90] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 8413
By SuperHyperOrder As Hyper Enumerations On Super Landmarks”, ResearchGate 2023, 8414
(doi: 10.13140/RG.2.2.35646.56641). 8415

HG165 [91] Henry Garrett, “New Ideas On Super Analogous By Hyper Visions Of SuperHyperOrder 8416
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, 8417
(doi: 10.13140/RG.2.2.18030.48967). 8418

HG164 [92] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 8419
By SuperHyperColoring As Hyper Categories On Super Neighbors”, ResearchGate 2023, 8420
(doi: 10.13140/RG.2.2.13973.81121). 8421

HG163 [93] Henry Garrett, “New Ideas On Super Relations By Hyper Identifications Of SuperHyper- 8422
Coloring In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 8423
2023, (doi: 10.13140/RG.2.2.34106.47047). 8424

HG162 [94] Henry Garrett, “New Ideas On Super Contradiction By Hyper Detection of SuperHyper- 8425
Defensive In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 8426
ResearchGate 2023, (doi: 10.13140/RG.2.2.13397.09446). 8427

HG161 [95] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 8428
By SuperHyperDimension As Hyper Distinguishing On Super Distances”, ResearchGate 8429

2023, (doi: 10.13140/RG.2.2.31956.88961). 8430

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 Henry Garrett · Independent Researcher · Department of Mathematics ·
DrHenryGarrett@gmail.com · Manhattan, NY, USA

HG160 [96] Henry Garrett, “New Ideas On Super Locations By Hyper Differing Of SuperHyperDi- 8431
mension In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 8432
2023, (doi: 10.13140/RG.2.2.15179.67361). 8433

HG159 [97] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 8434
By SuperHyperDominating As Hyper Closing On Super Messy”, ResearchGate 2023, (doi: 8435
10.13140/RG.2.2.21510.45125). 8436

HG158 [98] Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDom- 8437
inating In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 8438
2023, (doi: 10.13140/RG.2.2.13121.84321). 8439

HG157 [99] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 8440
By SuperHyperConnected As Hyper Group On Super Surge”, ResearchGate 2023, (doi: 8441
10.13140/RG.2.2.11758.69441). 8442

HG156 [100] Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of SuperHyperCon- 8443
nected In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 8444
2023, (doi: 10.13140/RG.2.2.31891.35367). 8445

HG155 [101] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 8446
By SuperHyperTotal As Hyper Covering On Super Infections”, ResearchGate 2023, (doi: 8447
10.13140/RG.2.2.19360.87048). 8448

HG154 [102] Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal 8449
In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 8450
10.13140/RG.2.2.32363.21286). 8451

HG153 [103] Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect 8452
In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 8453
10.13140/RG.2.2.23266.81602). 8454

HG152 [104] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 8455
By SuperHyperPerfect As Hyper Idealism On Super Vacancy”, ResearchGate 2023, (doi: 8456
10.13140/RG.2.2.19911.37285). 8457

HG151 [105] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 8458
By SuperHyperJoin As Hyper Separations On Super Sorts”, ResearchGate 2023, (doi: 8459
10.13140/RG.2.2.11050.90569). 8460

HG150 [106] Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of SuperHy- 8461
perJoin In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 8462
2023, (doi: 10.13140/RG.2.2.17761.79206). 8463

HG149 [107] Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of Super- 8464
HyperDuality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 8465
ResearchGate 2023, (doi: 10.13140/RG.2.2.34953.52320). 8466

HG148 [108] Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph 8467
By SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchG- 8468

ate 2023, (doi: 10.13140/RG.2.2.33275.80161). 8469

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 Henry Garrett · Independent Researcher · Department of Mathematics ·
DrHenryGarrett@gmail.com · Manhattan, NY, USA

HG147 [109] Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph 8470
By Path SuperHyperColoring As Hyper Correction On Super Faults”, ResearchGate 2023, 8471
(doi: 10.13140/RG.2.2.30182.50241). 8472

HG146 [110] Henry Garrett, “New Ideas On Super Reflections By Hyper Rotations Of Path SuperHy- 8473
perColoring In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 8474
ResearchGate 2023, (doi: 10.13140/RG.2.2.33459.30243). 8475

HG145 [111] Henry Garrett, “New Ideas As Hyper Deformations On Super Chains In Cancer’s 8476
Neutrosophic Recognition and Neutrosophic SuperHyperGraph By SuperHyperDensity”, 8477
ResearchGate 2023, (doi: 10.13140/RG.2.2.13444.60806). 8478

HG144 [112] Henry Garrett, “New Ideas As Hyper Ignorance By SuperHyperDensity On Super 8479
Resistances In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 8480
ResearchGate 2023, (doi:10.13140/RG.2.2.16800.05123). 8481

HG143 [113] Henry Garrett, “New Research On Cancer’s Recognition and Neutrosophic SuperHyper- 8482
Graph By Eulerian SuperHyperCycles and Hamiltonian Sets As Hyper Covering Versus 8483
Super separations-VI”, ResearchGate 2023, (doi: 10.13140/RG.2.2.29913.80482). 8484

HG142 [114] Henry Garrett, “New Research On Cancer’s Recognition and Neutrosophic SuperHyper- 8485
Graph By Eulerian SuperHyperCycles and Hamiltonian Sets As Hyper Covering Versus 8486
Super separations-V”, ResearchGate 2023, (doi: 10.13140/RG.2.2.33269.24809). 8487

HG141 [115] Henry Garrett, “New Research On Cancer’s Recognition and Neutrosophic SuperHyper- 8488
Graph By Eulerian SuperHyperCycles and Hamiltonian Sets As Hyper Covering Versus 8489
Super separations-IV”, ResearchGate 2023, (doi: 10.13140/RG.2.2.34946.96960). 8490

HG140 [116] Henry Garrett, “A Research On Cancer’s Recognition and Neutrosophic SuperHyperGraph 8491
By Eulerian SuperHyperCycles and Hamiltonian Sets As Hyper Covering Versus Super 8492
separations-III”, ResearchGate 2023, (doi: 10.13140/RG.2.2.14814.31040). 8493

HG139 [117] Henry Garrett, “A Research On Cancer’s Recognition and Neutrosophic SuperHyperGraph 8494
By Eulerian SuperHyperCycles and Hamiltonian Sets As Hyper Covering Versus Super 8495
separations-II”, ResearchGate 2023, (doi: 10.13140/RG.2.2.15653.17125). 8496

HG138 [118] Henry Garrett, “A Research On Cancer’s Recognition and Neutrosophic SuperHyperGraph 8497
By Eulerian SuperHyperCycles and Hamiltonian Sets As Hyper Covering Versus Super 8498
separations-I”, ResearchGate 2023, (doi: 10.13140/RG.2.2.25719.50089). 8499

HG137 [119] Henry Garrett, “New Ideas On Super Disruptions In Cancer’s Extreme Recognition 8500
As Neutrosophic SuperHyperGraph By Hyper Plans Called SuperHyperConnectivities”, 8501
ResearchGate 2023, (doi: 10.13140/RG.2.2.29441.94562). 8502

HG136 [120] Henry Garrett, “Cancer’s Neutrosophic Recognition As Neutrosophic SuperHyperGraph 8503
By SuperHyperConnectivities As Hyper Diagnosis On Super Mechanism”, ResearchGate 8504
2023, (doi: 10.13140/RG.2.2.17252.24968). 8505

HG135 [121] Henry Garrett,“Cancer’s Recognition and (Neutrosophic) SuperHyperGraph By the 8506
Criteria of Eulerian and Hamiltonian Type-Sets As Hyper Modified Cycles On Super 8507

Mess”, ResearchGate 2023,(doi: 10.13140/RG.2.2.16652.59525). 8508

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 Henry Garrett · Independent Researcher · Department of Mathematics ·
DrHenryGarrett@gmail.com · Manhattan, NY, USA

HG134 [122] Henry Garrett,“Eulerian and Hamiltonian In Cancer’s Neutrosophic Recognition and 8509
Neutrosophic SuperHyperGraph On Super Interactions By Hyper Extensions of Cycles”, 8510
ResearchGate 2023,(doi: 10.13140/RG.2.2.34583.24485). 8511

HG132 [123] Henry Garrett,“SuperHyperGirth Type-Results on extreme SuperHyperGirth theory and 8512

(Neutrosophic) SuperHyperGraphs Toward Cancer’s extreme Recognition”, Preprints 2023, 8513

2023010396 (doi: 10.20944/preprints202301.0396.v1). 8514

HG131 [124] Henry Garrett,“Neutrosophic SuperHyperGraphs Warns Hyper Landmark of neutrosophic 8515

SuperHyperGirth In Super Type-Versions of Cancer’s neutrosophic Recognition”, Preprints 8516

2023, 2023010395 (doi: 10.20944/preprints202301.0395.v1). 8517

HG130 [125] Henry Garrett,“The Constructions of (Neutrosophic) SuperHyperGraphs on the Cancer’s 8518
Recognition in The Confrontation With Super Attacks In Hyper Situations By Implement- 8519

ing (Neutrosophic) 1-Failed SuperHyperForcing in The Technical Approaches to Neutralize 8520

SuperHyperViews”, ResearchGate 2023, (doi: 10.13140/RG.2.2.26240.51204). 8521

HG129 [126] Henry Garrett,“(Neutrosophic) 1-Failed SuperHyperForcing As the Entrepreneurs on 8522

Cancer’s Recognitions To Fail Forcing Style As the Super Classes With Hyper Effects 8523

In The Background of the Framework is So-Called (Neutrosophic) SuperHyperGraphs”, 8524

ResearchGate 2023, (doi: 10.13140/RG.2.2.12818.73925). 8525

HG128 [127] Henry Garrett,“Super Actions On The Types of Hyper Levels In The Sensible Neutrosophic 8526

SuperHyperGirth On Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyper- 8527

Graph”, ResearchGate 2023,(doi: 10.13140/RG.2.2.26836.88960). 8528

HG127 [128] Henry Garrett,“SuperHyperGirth Approaches on the Super Challenges on the Cancer’s 8529
Recognition In the Hyper Model of (Neutrosophic) SuperHyperGraph”, ResearchGate 8530

2023,(doi: 10.13140/RG.2.2.36745.93289). 8531

HG126 [129] Henry Garrett,“Extreme SuperHyperClique as the Firm Scheme of Confrontation under 8532
Cancer’s Recognition as the Model in The Setting of (Neutrosophic) SuperHyperGraphs”, 8533
Preprints 2023, 2023010308 (doi: 10.20944/preprints202301.0308.v1). 8534

HG125 [130] Henry Garrett,“Uncertainty On The Act And Effect Of Cancer Alongside The Foggy 8535
Positions Of Cells Toward Neutrosophic Failed SuperHyperClique inside Neutrosophic 8536
SuperHyperGraphs Titled Cancer’s Recognition”, Preprints 2023, 2023010282 (doi: 8537
10.20944/preprints202301.0282.v1). 8538

HG124 [131] Henry Garrett,“Neutrosophic Version Of Separates Groups Of Cells In Cancer’s 8539
Recognition On Neutrosophic SuperHyperGraphs”, Preprints 2023, 2023010267 (doi: 8540
10.20944/preprints202301.0267.v1).). 8541

HG123 [132] Henry Garrett, “The Shift Paradigm To Classify Separately The Cells and Affected 8542
Cells Toward The Totality Under Cancer’s Recognition By New Multiple Definitions On 8543
the Sets Polynomials Alongside Numbers In The (Neutrosophic) SuperHyperMatching 8544
Theory Based on SuperHyperGraph and Neutrosophic SuperHyperGraph”, Preprints 2023, 8545

2023010265 (doi: 10.20944/preprints202301.0265.v1). 8546

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 Henry Garrett · Independent Researcher · Department of Mathematics ·
DrHenryGarrett@gmail.com · Manhattan, NY, USA

HG122 [133] Henry Garrett,“Breaking the Continuity and Uniformity of Cancer In The Worst Case of 8547
Full Connections With Extreme Failed SuperHyperClique In Cancer’s Recognition Applied 8548
in (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010262,(doi: 10.20944/pre- 8549
prints202301.0262.v1). 8550

HG121 [134] Henry Garrett, “Neutrosophic Failed SuperHyperStable as the Survivors on the Cancer’s 8551
Neutrosophic Recognition Based on Uncertainty to All Modes in Neutrosophic SuperHy- 8552
perGraphs”, Preprints 2023, 2023010240 (doi: 10.20944/preprints202301.0240.v1). 8553

HG120 [135] Henry Garrett, “Extremism of the Attacked Body Under the Cancer’s Circumstances 8554

Where Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 8555

2023010224, (doi: 10.20944/preprints202301.0224.v1). 8556

HG24 [136] Henry Garrett,“SuperHyperMatching By (R-)Definitions And Polynomials To Monitor 8557

Cancer’s Recognition In Neutrosophic SuperHyperGraphs”, ResearchGate 2023,(doi: 8558
10.13140/RG.2.2.35061.65767). 8559

HG25 [137] Henry Garrett,“The Focus on The Partitions Obtained By Parallel Moves In The 8560
Cancer’s Extreme Recognition With Different Types of Extreme SuperHyperMatching 8561

Set and Polynomial on (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 8562

10.13140/RG.2.2.18494.15680). 8563

HG26 [138] Henry Garrett,“Extreme Failed SuperHyperClique Decides the Failures on the Can- 8564
cer’s Recognition in the Perfect Connections of Cancer’s Attacks By SuperHy- 8565
perModels Named (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 8566
10.13140/RG.2.2.32530.73922). 8567

HG27 [139] Henry Garrett,“Indeterminacy On The All Possible Connections of Cells In Front 8568
of Cancer’s Attacks In The Terms of Neutrosophic Failed SuperHyperClique on 8569

Cancer’s Recognition called Neutrosophic SuperHyperGraphs”, ResearchGate 2023, (doi: 8570

10.13140/RG.2.2.15897.70243). 8571

HG116 [140] Henry Garrett,“Extreme Failed SuperHyperClique Decides the Failures on the Can- 8572
cer’s Recognition in the Perfect Connections of Cancer’s Attacks By SuperHy- 8573
perModels Named (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 8574
10.13140/RG.2.2.32530.73922). 8575

HG115 [141] Henry Garrett, “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Recognitions 8576

And (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010105 (doi: 10.20944/pre- 8577

prints202301.0105.v1). 8578

HG28 [142] Henry Garrett,“Perfect Directions Toward Idealism in Cancer’s Neutrosophic Recogni- 8579
tion Forwarding Neutrosophic SuperHyperClique on Neutrosophic SuperHyperGraphs”, 8580
ResearchGate 2023, (doi: 10.13140/RG.2.2.30092.80004). 8581

HG29 [143] Henry Garrett,“Demonstrating Complete Connections in Every Embedded Regions 8582
and Sub-Regions in the Terms of Cancer’s Recognition and (Neutrosophic) Su- 8583
perHyperGraphs With (Neutrosophic) SuperHyperClique”, ResearchGate 2023, (doi: 8584

10.13140/RG.2.2.23172.19849). 8585

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 Henry Garrett · Independent Researcher · Department of Mathematics ·
DrHenryGarrett@gmail.com · Manhattan, NY, USA

HG112 [144] Henry Garrett, “Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic) 8586
SuperHyperModeling in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs”, 8587
Preprints 2023, 2023010105 (doi: 10.20944/preprints202301.0105.v1). 8588

HG111 [145] Henry Garrett, “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic 8589
SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints”, 8590

Preprints 2023, 2023010088 (doi: 10.20944/preprints202301.0088.v1). 8591

HG30 [146] Henry Garrett,“Different Neutrosophic Types of Neutrosophic Regions titled neut- 8592
rosophic Failed SuperHyperStable in Cancer’s Neutrosophic Recognition modeled 8593
in the Form of Neutrosophic SuperHyperGraphs”, ResearchGate 2023, (doi: 8594
10.13140/RG.2.2.17385.36968). 8595

HG107 [147] Henry Garrett, “Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To 8596
Use Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond”, 8597
Preprints 2023, 2023010044 8598

HG106 [148] Henry Garrett, “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well- 8599
SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010043 8600
(doi: 10.20944/preprints202301.0043.v1). 8601

HG31 [149] Henry Garrett, “Using the Tool As (Neutrosophic) Failed SuperHyperStable To SuperHy- 8602
perModel Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs”, ResearchGate 8603
2023, (doi: 10.13140/RG.2.2.28945.92007). 8604

HG32 [150] Henry Garrett, “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic 8605
SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints”, 8606

ResearchGate 2023, (doi: 10.13140/RG.2.2.11447.80803). 8607

HG33 [151] Henry Garrett, “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well- 8608
SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 8609
10.13140/RG.2.2.35774.77123). 8610

HG34 [152] Henry Garrett, “Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To 8611

Use Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond”, 8612

ResearchGate 2022, (doi: 10.13140/RG.2.2.36141.77287). 8613

HG35 [153] Henry Garrett, “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Re- 8614
cognitions And (Neutrosophic) SuperHyperGraphs”, ResearchGate 2022, (doi: 8615
10.13140/RG.2.2.29430.88642). 8616

HG36 [154] Henry Garrett, “Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic) 8617
SuperHyperModeling in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs”, 8618
ResearchGate 2022, (doi: 10.13140/RG.2.2.11369.16487). 8619

HG982 [155] Henry Garrett, “(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions Featuring 8620
(Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, Preprints 2022, 2022120549 8621

(doi: 10.20944/preprints202212.0549.v1). 8622

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 Henry Garrett · Independent Researcher · Department of Mathematics ·
DrHenryGarrett@gmail.com · Manhattan, NY, USA

HG98 [156] Henry Garrett, “(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions Featuring 8623
(Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, ResearchGate 2022, (doi: 8624
10.13140/RG.2.2.19380.94084). 8625

HG972 [157] Henry Garrett, “(Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and Su- 8626
perHyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With (Neut- 8627
rosophic) SuperHyperModeling of Cancer’s Recognitions And Related (Neutrosophic) Su- 8628
perHyperClasses”, Preprints 2022, 2022120540 (doi: 10.20944/preprints202212.0540.v1). 8629

HG97 [158] Henry Garrett, “(Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and 8630
SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With 8631
(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions And Related (Neutrosophic) 8632
SuperHyperClasses”, ResearchGate 2022, (doi: 10.13140/RG.2.2.14426.41923). 8633

HG962 [159] Henry Garrett, “SuperHyperGirth on SuperHyperGraph and Neutrosophic SuperHyper- 8634
Graph With SuperHyperModeling of Cancer’s Recognitions”, Preprints 2022, 2022120500 8635
(doi: 10.20944/preprints202212.0500.v1). 8636

HG96 [160] Henry Garrett, “SuperHyperGirth on SuperHyperGraph and Neutrosophic SuperHyper- 8637
Graph With SuperHyperModeling of Cancer’s Recognitions”, ResearchGate 2022 (doi: 8638
10.13140/RG.2.2.20993.12640). 8639

HG952 [161] Henry Garrett,“Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic 8640

SuperHyperGraphs and SuperHyperGraphs Alongside Applications in Cancer’s Treatments”, 8641

Preprints 2022, 2022120324 (doi: 10.20944/preprints202212.0324.v1). 8642

HG95 [162] Henry Garrett, “Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic Su- 8643
perHyperGraphs And SuperHyperGraphs Alongside Applications in Cancer’s Treatments”, 8644

ResearchGate 2022 (doi: 10.13140/RG.2.2.23123.04641). 8645

HG942 [163] Henry Garrett, “SuperHyperDominating and SuperHyperResolving on Neutrosophic Super- 8646
HyperGraphs And Their Directions in Game Theory and Neutrosophic SuperHyperClasses”, 8647

Preprints 2022, 2022110576 (doi: 10.20944/preprints202211.0576.v1). 8648

HG94 [164] Henry Garrett, “SuperHyperDominating and SuperHyperResolving on Neutrosophic Super- 8649

HyperGraphs And Their Directions in Game Theory and Neutrosophic SuperHyperClasses”, 8650
ResearchGate 2022 (doi: 10.13140/RG.2.2.23324.56966). 8651

HG37 [165] Henry Garrett, “Basic Neutrosophic Notions Concerning SuperHyperDominating and 8652

Neutrosophic SuperHyperResolving in SuperHyperGraph”, ResearchGate 2022 (doi: 8653

10.13140/RG.2.2.29173.86244). 8654

HG38 [166] Henry Garrett, “Initial Material of Neutrosophic Preliminaries to Study Some Neutro- 8655

sophic Notions Based on Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic Super- 8656

HyperGraph (NSHG)”, ResearchGate 2022 (doi: 10.13140/RG.2.2.25385.88160). 8657

HG155b [167] Henry Garrett, “Hamiltonian-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 8658

2023 (doi: 10.5281/zenodo.7804449). 8659

HG154b [168] Henry Garrett, “Hamiltonian-Cycle-Decomposition In SuperHyperGraphs”. Dr. Henry 8660

Garrett, 2023 (doi: 10.5281/zenodo.7793875). 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

HG153b [169] Henry Garrett, “Hamiltonian-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 8662
(doi: 10.5281/zenodo.7792307). 8663

HG152b [170] Henry Garrett, “Hamiltonian-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 8664
(doi: 10.5281/zenodo.7790728). 8665

HG151b [171] Henry Garrett, “Hamiltonian-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 8666
2023 (doi: 10.5281/zenodo.7787712). 8667

HG150b [172] Henry Garrett, “Hamiltonian-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 8668
10.5281/zenodo.7783791). 8669

HG149b [173] Henry Garrett, “Trace-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 8670
10.5281/zenodo.7780123). 8671

HG148b [174] Henry Garrett, “Trace-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 8672
(doi: 10.5281/zenodo.7773119). 8673

HG147b [175] Henry Garrett, “SuperHyperDuality”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8674
odo.7637762). 8675

HG146b [176] Henry Garrett, “Trace-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 8676
10.5281/zenodo.7766174). 8677

HG145b [177] Henry Garrett, “Edge-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 8678

10.5281/zenodo.7762232). 8679

HG144b [178] Henry Garrett, “Edge-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 8680
(doi: 10.5281/zenodo.7758601). 8681

HG143b [179] Henry Garrett, “Edge-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 8682
10.5281/zenodo.7754661). 8683

HG142b [180] Henry Garrett, “Vertex-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 8684

10.5281/zenodo.7750995) . 8685

HG141b [181] Henry Garrett, “Vertex-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 8686
(doi: 10.5281/zenodo.7749875). 8687

HG140b [182] Henry Garrett, “Vertex-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 8688
10.5281/zenodo.7747236). 8689

HG139b [183] Henry Garrett, “Stable-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 8690

10.5281/zenodo.7742587). 8691

HG138b [184] Henry Garrett, “Stable-Decompositions In SuperHyperGraphs”. Dr. Henry Garrett, 2023 8692
(doi: 10.5281/zenodo.7738635). 8693

HG137b [185] Henry Garrett, “Stable-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 8694
10.5281/zenodo.7734719). 8695

HG136b [186] Henry Garrett, “Clique-Neighbors In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 8696

10.5281/zenodo.7730484). 8697

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 Henry Garrett · Independent Researcher · Department of Mathematics ·
DrHenryGarrett@gmail.com · Manhattan, NY, USA

HG135b [187] Henry Garrett, “Clique-Decompositions In SuperHyperGraphs”. Dr. Henry Garrett, 2023 8698
(doi: 10.5281/zenodo.7730469). 8699

HG134b [188] Henry Garrett, “Clique-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 8700
10.5281/zenodo.7722865). 8701

HG133b [189] Henry Garrett, “Space In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8702
odo.7713563). 8703

HG132b [190] Henry Garrett, “Space In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8704
odo.7709116). 8705

HG131b [191] Henry Garrett, “Edge-Connectivity In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 8706
10.5281/zenodo.7706415). 8707

HG130b [192] Henry Garrett, “Vertex-Connectivity In SuperHyperGraphs”. Dr. Henry Garrett, 2023 8708
(doi: 10.5281/zenodo.7706063). 8709

HG129b [193] Henry Garrett, “Tree-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 8710
(doi: 10.5281/zenodo.7701906). 8711

HG128b [194] Henry Garrett, “Chord In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8712
odo.7700205). 8713

HG127b [195] Henry Garrett, “(i,j)-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 8714

10.5281/zenodo.7694876). 8715

HG126b [196] Henry Garrett, “Edge-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 8716
10.5281/zenodo.7679410). 8717

HG125b [197] Henry Garrett, “K-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 8718
10.5281/zenodo.7675982). 8719

HG124b [198] Henry Garrett, “K-Number In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 8720

10.5281/zenodo.7672388). 8721

HG123b [199] Henry Garrett, “Order In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8722
odo.7668648). 8723

HG122b [200] Henry Garrett, “Coloring In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 8724
10.5281/zenodo.7662810). 8725

HG121b [201] Henry Garrett, “Dimension In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 8726

10.5281/zenodo.7659162). 8727

HG120b [202] Henry Garrett, “Cancer In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 8728
10.5281/zenodo.7653233). 8729

HG119b [203] Henry Garrett, “SuperHyperWheel”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8730
odo.7653204). 8731

HG118b [204] Henry Garrett, “SuperHyperMultipartite”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8732

odo.7653142). 8733

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 Henry Garrett · Independent Researcher · Department of Mathematics ·
DrHenryGarrett@gmail.com · Manhattan, NY, USA

HG117b [205] Henry Garrett, “SuperHyperBipartite”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8734
odo.7653117). 8735

HG116b [206] Henry Garrett, “SuperHyperStar”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8736
odo.7653089). 8737

HG115b [207] Henry Garrett, “SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8738
odo.7651687). 8739

HG114b [208] Henry Garrett, “SuperHyperPath”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8740
odo.7651619). 8741

HG113b [209] Henry Garrett, “SuperHyperDomination”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8742
odo.7651439). 8743

HG112b [210] Henry Garrett, “SuperHyperDominating”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8744
odo.7650729). 8745

HG111b [211] Henry Garrett, “SuperHyperConnected”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8746
odo.7647868). 8747

HG110b [212] Henry Garrett, “SuperHyperTotal”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8748
odo.7647017). 8749

HG109b [213] Henry Garrett, “SuperHyperPerfect”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8750

odo.7644894). 8751

HG108b [214] Henry Garrett, “SuperHyperJoin”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8752
odo.7641880). 8753

HG107b [215] Henry Garrett, “Path SuperHyperColoring”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8754
odo.7632923). 8755

HG106b [216] Henry Garrett, “SuperHyperDensity”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8756

odo.7623459). 8757

HG105b [217] Henry Garrett, “Neutrosophic SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 8758
10.5281/zenodo.7606416). 8759

HG104b [218] Henry Garrett, “Extreme SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 8760
10.5281/zenodo.7606416). 8761

HG103b [219] Henry Garrett, “SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8762

odo.7606404). 8763

HG102b [220] Henry Garrett, “Neutrosophic SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 8764
10.5281/zenodo.7580018). 8765

HG101b [221] Henry Garrett, “Extreme SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8766
odo.7580018). 8767

HG100b [222] Henry Garrett, “Extreme SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8768

odo.7580018). 8769

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 Henry Garrett · Independent Researcher · Department of Mathematics ·
DrHenryGarrett@gmail.com · Manhattan, NY, USA

HG99b [223] Henry Garrett, “SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8770
odo.7579929). 8771

HG98b [224] Henry Garrett, “Neutrosophic SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 8772
10.5281/zenodo.7563170). 8773

HG97b [225] Henry Garrett, “Extreme SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8774
odo.7563164). 8775

HG96b [226] Henry Garrett, “SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8776
odo.7563160). 8777

HG95b [227] Henry Garrett, “Extreme SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8778
odo.7563160). 8779

HG94b [228] Henry Garrett, “Overlook On SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 8780
10.5281/zenodo.7563160). 8781

HG93b [229] Henry Garrett, “Neutrosophic SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 8782
10.5281/zenodo.7557063). 8783

HG92b [230] Henry Garrett, “Extreme SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 8784
10.5281/zenodo.7557009). 8785

HG91b [231] Henry Garrett, “Overlook On SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 8786

10.5281/zenodo.7539484). 8787

HG90b [232] Henry Garrett, “Neutrosophic Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 8788
10.5281/zenodo.7523390). 8789

HG89b [233] Henry Garrett, “Extreme Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 8790
10.5281/zenodo.7523390). 8791

HG88b [234] Henry Garrett, “Overlook On Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 8792

10.5281/zenodo.7523390). 8793

HG87b [235] Henry Garrett, “Extreme SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8794
odo.7574952). 8795

HG86b [236] Henry Garrett, “Neutrosophic SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 8796
10.5281/zenodo.7574992). 8797

HG85b [237] Henry Garrett, “Extreme SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8798

odo.7523357). 8799

HG84b [238] Henry Garrett, “Overlook On SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 8800
10.5281/zenodo.7523357). 8801

HG83b [239] Henry Garrett, “Neutrosophic Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 8802
10.5281/zenodo.7504782). 8803

HG82b [240] Henry Garrett, “Extreme Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 8804

10.5281/zenodo.7504782). 8805

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 Henry Garrett · Independent Researcher · Department of Mathematics ·
DrHenryGarrett@gmail.com · Manhattan, NY, USA

HG81b [241] Henry Garrett, “Overlook On Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 8806
10.5281/zenodo.7504782). 8807

HG80b [242] Henry Garrett, “Neutrosophic SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 8808
10.5281/zenodo.7499395). 8809

HG79b [243] Henry Garrett, “Extreme SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8810
odo.7499395). 8811

HG78b [244] Henry Garrett, “Overlook On SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 8812
10.5281/zenodo.7499395). 8813

HG77b [245] Henry Garrett, “Neutrosophic Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 8814
10.5281/zenodo.7497450). 8815

HG76b [246] Henry Garrett, “Extreme Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 8816
10.5281/zenodo.7497450). 8817

HG75b [247] Henry Garrett, “Neutrosophic SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 8818
10.5281/zenodo.7494862). 8819

HG74b [248] Henry Garrett, “Extreme SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8820
odo.7494862). 8821

HG73b [249] Henry Garrett, “Overlook On SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 8822

10.5281/zenodo.7494862). 8823

HG72b [250] Henry Garrett, “Neutrosophic SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 8824
10.5281/zenodo.7493845). 8825

HG71b [251] Henry Garrett, “Extreme SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 8826
10.5281/zenodo.7493845). 8827

HG70b [252] Henry Garrett, “Overlook On SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 8828

10.5281/zenodo.7493845). 8829

HG69b [253] Henry Garrett, “SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8830
odo.7539484). 8831

HG68b [254] Henry Garrett, “Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8832
odo.7523390). 8833

HG67b [255] Henry Garrett, “SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8834

odo.7523357). 8835

HG66b [256] Henry Garrett, “Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8836
odo.7504782). 8837

HG65b [257] Henry Garrett, “SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8838
odo.7499395). 8839

HG64b [258] Henry Garrett, “Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8840

odo.7497450). 8841

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 Henry Garrett · Independent Researcher · Department of Mathematics ·
DrHenryGarrett@gmail.com · Manhattan, NY, USA

HG63b [259] Henry Garrett, “SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8842
odo.7494862). 8843

HG62b [260] Henry Garrett, “SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8844
odo.7493845). 8845

HG61b [261] Henry Garrett, “SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8846
odo.7480110). 8847

HG60b [262] Henry Garrett, “Neut. SuperHyperEdges”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8848

odo.7378758). 8849

HG32b [263] Henry Garrett, “Beyond Neutrosophic Graphs”. Dr. Henry Garrett, 2023 (doi: 8850
10.5281/zenodo.6320305). 8851

HG44b [264] Henry Garrett, “Neutrosophic Duality”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8852
odo.6677173). 8853

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 CHAPTER 44 8854

Books’ Contributions 8855

“Books’ Contributions”: | Featured Threads 8856

The following references are cited by chapters. 8857

8858
[Ref229] 8859
Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Hamiltonian-Cycle- 8860
Neighbor In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 8861
10.5281/zenodo.7796354). 8862
8863

[Ref230] 8864
Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph 8865
By Hamiltonian-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 8866
10.5281/zenodo.7796334). 8867
8868
The links to the contributions of this scientific research book are listed below. 8869

[HG229 8870
Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Hamiltonian-Cycle- 8871
Neighbor In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 8872
10.5281/zenodo.7796354). 8873
8874
[TITLE] “New Ideas On Super Nebulous By Hyper Nebbish Of Hamiltonian-Cycle-Neighbor In 8875

Recognition of Cancer With (Neutrosophic) SuperHyperGraph” 8876

8877
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ResearchGate”] 8878
https://www.researchgate.net/publication/369754679 8879
8880
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “Scribd”:] 8881

https://www.scribd.com/document/635866644 8882
8883
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ZENODO_ORG”:] 8884
https://zenodo.org/record/7796354 8885
8886
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “academia”:] 8887

https://www.academia.edu/99599873 8888

441
Henry Garrett · Independent Researcher · Department of Mathematics ·
DrHenryGarrett@gmail.com · Manhattan, NY, USA

Figure 44.1: Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Hamiltonian-
Cycle-Neighbor In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo
2023, (doi: 10.5281/zenodo.7796354).

8889
[ADDRESSED CITATION] 8890
Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Hamiltonian-Cycle- 8891
Neighbor In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 8892
10.5281/zenodo.7796354). 8893
[ASSIGNED NUMBER] #229 Article 8894

[DATE] April 2023 8895

[DOI] 10.5281/zenodo.7796354 8896
[LICENSE] CC BY-NC-ND 4.0 8897
[PROJECT] Neutrosophic SuperHyperGraphs and SuperHyperGraphs 8898
[AVAILABLE AT TWITTER’S IDS] WordPress ResearchGate Scribd academia ZEN- 8899
ODO_ORG Twitter facebook LinkedIn Amazon googlebooks GooglePlay 8900

8901
[HG230] 8902
Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph 8903
By Hamiltonian-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 8904
10.5281/zenodo.7796334). 8905
8906

[TITLE] “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph By 8907

Hamiltonian-Cycle-Neighbor As Hyper Nebbish On Super Nebulous” 8908
8909
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ResearchGate”] 8910
https://www.researchgate.net/publication/369754406 8911
8912

[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “Scribd”:] 8913

Henry Garrett · 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 Nebulous By Hyper Nebbish Of Hamiltonian-
Cycle-Neighbor In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo
2023, (doi: 10.5281/zenodo.7796354).

Figure 44.3: Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Hamiltonian-
Cycle-Neighbor In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo
2023, (doi: 10.5281/zenodo.7796354).

Henry Garrett · 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-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”,
Zenodo 2023, (doi: 10.5281/zenodo.7796334).

https://www.scribd.com/document/635863463 8914
8915
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ZENODO_ORG”:] 8916
https://zenodo.org/record/7796334 8917
8918
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “academia”:] 8919

https://www.academia.edu/99599161 8920
8921
[ADDRESSED CITATION] 8922
Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph 8923
By Hamiltonian-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 8924
10.5281/zenodo.7796334). 8925

[ASSIGNED NUMBER] #230 Article 8926

[DATE] April 2023 8927
[DOI] 10.5281/zenodo.7796334 8928
[LICENSE] CC BY-NC-ND 4.0 8929
[PROJECT] Neutrosophic SuperHyperGraphs and SuperHyperGraphs 8930
[AVAILABLE AT TWITTER’S IDS] 8931

WordPress ResearchGate Scribd academia ZENODO_ORG Twitter facebook LinkedIn Amazon 8932
googlebooks GooglePlay 8933
8934
[ASSIGNED NUMBER] | Book #155 8935
[ADDRESSED CITATION] 8936
Henry Garrett, “Hamiltonian-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 8937

(doi: 10.5281/zenodo.7804449). 8938

Henry Garrett · 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-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”,
Zenodo 2023, (doi: 10.5281/zenodo.7796334).

Figure 44.6: Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic
SuperHyperGraph By Hamiltonian-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”,
Zenodo 2023, (doi: 10.5281/zenodo.7796334).

Henry Garrett · 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-Cycle-Neighbor In SuperHyperGraphs 8939

#Latest_Updates 8940
#The_Links 8941
[AVAILABLE AT TWITTER’S IDS] 8942
WordPress ResearchGate Scribd academia ZENODO_ORG Twitter facebook LinkedIn Amazon 8943
googlebooks GooglePlay 8944

8945
#Latest_Updates 8946
8947
#The_Links 8948
8949

[ASSIGNED NUMBER] | Book #155 8950

8951
[TITLE] Hamiltonian-Cycle-Neighbor In SuperHyperGraphs 8952
8953
[AVAILABLE AT TWITTER’S IDS] 8954
WordPress ResearchGate Scribd academia ZENODO_ORG Twitter facebook LinkedIn Amazon 8955
googlebooks GooglePlay 8956

8957
– 8958
8959
[PUBLISHER] 8960
(Paperback): https://www.amazon.com/dp/- 8961

(Hardcover): https://www.amazon.com/dp/- 8962

(Kindle Edition): https://www.amazon.com/dp/- 8963
8964
– 8965
8966
[ISBN] 8967

(Paperback): - 8968
(Hardcover): - 8969
(Kindle Edition): CC BY-NC-ND 4.0 8970
(EBook): CC BY-NC-ND 4.0 8971
8972
– 8973

8974
[PRINT LENGTH] 8975
(Paperback): - pages 8976
(Hardcover): - pages 8977
(Kindle Edition): - pages 8978
(E-Book): - pages 8979

8980
– 8981
8982
#Latest_Updates 8983
8984

Henry Garrett · 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 8985
8986
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ResearchGate”] 8987
https://www.researchgate.net/publication/- 8988
8989
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “WordPress”] 8990

https://drhenrygarrett.wordpress.com/2023/04/22/ 8991
Hamiltonian-Cycle-Neighbor-In-SuperHyperGraphs/ 8992
8993
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “Scribd”] 8994
https://www.scribd.com/document/- 8995

8996
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “academia”] 8997
https://www.academia.edu/- 8998
8999
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ZENODO_ORG”] 9000
https://zenodo.org/record/7804449 9001

9002
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “googlebooks”] 9003
https://books.google.com/books/about?id=- 9004
9005
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “GooglePlay”] 9006
https://play.google.com/store/books/details?id=- 9007

Henry Garrett · 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-Cycle-Neighbor In SuperHyperGraphs (Published Version) 9008

9009
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “WordPress”] 9010
9011
https://drhenrygarrett.wordpress.com/2023/04/22/ 9012
Hamiltonian-Cycle-Neighbor-In-SuperHyperGraphs/ 9013

9014
– 9015
9016
[POSTED BY] Dr. Henry Garrett 9017
9018

[DATE] April 006, 2023 9019

9020
[POSTED IN] 155 | Hamiltonian-Cycle-Neighbor In SuperHyperGraphs 9021
9022
[TAGS] 9023
Applications, Applied Mathematics, Applied Research, Cancer, Cancer’s Recognitions, Combin- 9024
atorics, Edge, Edges, Graph Theory, Graphs, Latest Research, Literature Reviews, Modeling, 9025

Neutrosophic Graph, Neutrosophic Graph Theory, Neutrosophic Science, Neutrosophic Su- 9026
perHyperClasses, Neutrosophic SuperHyperGraph, Neutrosophic SuperHyperGraph Theory, 9027
neutrosophic SuperHyperGraphs, Neutrosophic Hamiltonian-Cycle-Neighbor In SuperHyper- 9028
Graphs, Open Problems, Open Questions, Problems, Pure Math, Pure Mathematics, Questions, 9029
Real-World Applications, Recent Research, Recognitions, Research, scientific research Article, 9030
scientific research Articles, scientific research Book, scientific research Chapter, scientific 9031

research Chapters, Review, SuperHyperClasses, SuperHyperEdges, SuperHyperGraph, Super- 9032

HyperGraph Theory, SuperHyperGraphs, Hamiltonian-Cycle-Neighbor In SuperHyperGraphs, 9033
SuperHyperModeling, SuperHyperVertices, Theoretical Research, Vertex, Vertices. 9034
In this scientific research book, there are some scientific research chapters on “Extreme 9035
Hamiltonian-Cycle-Neighbor In SuperHyperGraphs” and “Neutrosophic Hamiltonian-Cycle- 9036
Neighbor In SuperHyperGraphs” about some scientific research on Hamiltonian-Cycle-Neighbor 9037

In SuperHyperGraphs by two (Extreme/Neutrosophic) notions, namely, Extreme Hamiltonian- 9038

Cycle-Neighbor In SuperHyperGraphs and Neutrosophic Hamiltonian-Cycle-Neighbor In Su- 9039
perHyperGraphs. With scientific research on the basic scientific research properties, the 9040
scientific research book starts to make Extreme Hamiltonian-Cycle-Neighbor In SuperHyper- 9041
Graphs theory and Neutrosophic Hamiltonian-Cycle-Neighbor In SuperHyperGraphs theory more 9042

(Extremely/Neutrosophicly) understandable. 9043

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 CHAPTER 45 9044

“SuperHyperGraph-Based Books”: | 9045

Featured Tweets 9046

“SuperHyperGraph-Based Books”: | Featured Tweets 9047

449
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 9048

CV 9049

477
 9050
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

 9051
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)
 9052
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

 9053
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

 9054
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

 9055
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

 9056
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

 9057
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

 9058
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

 9059
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

 9060
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

 9061
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

 9062
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
 9063
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

 9064
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

 9065
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

 9066
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

 9067
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
 9068
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
 9069
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
 9070
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
 9071
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
 9072
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
 9073
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
 9074
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
 9075
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
 9076
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
 9077
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
 9078
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
 9079
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
 9080
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
 9081
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
 9082
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

 9083
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

 9084
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

 9085
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

 9086
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

 9087
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

 9088
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

 9089
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

 9090
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

 9091
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

 9092
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

 9093
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

 9094
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

 9095
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

 9096
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

 9097
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

 9098
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

 9099
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

 9100
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

 9101
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
 9102
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

 9103
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

 9104
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

 9105
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

 9106
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

 9107
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
 9108
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

 9109
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

 9110
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
 9111
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

 9112
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

 9113
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

 9114
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

 9115
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

 9116
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

 9117
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
 9118
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
 9119
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

 9120
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

 9121
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
-
 9122
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

 9123
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

 9124
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
 9125
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
 9126
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

 9127
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
 9128
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
...
 9129
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/
 9130
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
9131