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

Bibliography 17

3 Acknowledgements 35

4 Cancer In Extreme SuperHyperGraph 37

5 Extreme Trace-Neighbor 41

6 New Ideas On Super Nebulous By Hyper Nebbish Of Trace-Neighbor In

Recognition of Cancer With (Neutrosophic) SuperHyperGraph 43

7 ABSTRACT 45

8 Applied Notions Under The Scrutiny Of The Motivation Of This

Scientific Research 51

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

10 Extreme SuperHyperTrace-Decomposition But As The Extensions

Excerpt From Dense And Super Forms 67

11 The Extreme Departures on The Theoretical Results Toward Theoretical

Motivations 109

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 119

13 Extreme Applications in Cancer’s Extreme Recognition 131

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

ite as Extreme SuperHyperModel 133

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

Multipartite as Extreme SuperHyperModel 135

16 Wondering Open Problems But As The Directions To Forming The

Motivations 137

17 Conclusion and Closing Remarks 139

18 Extreme SuperHyperDuality But As The Extensions Excerpt From

Dense And Super Forms 141

19 Extreme SuperHyperJoin But As The Extensions Excerpt From Dense

And Super Forms 155

20 Extreme SuperHyperPerfect But As The Extensions Excerpt From

Dense And Super Forms 169

21 Extreme SuperHyperTotal But As The Extensions Excerpt From Dense

And Super Forms 183

22 Extreme SuperHyperConnected But As The Extensions Excerpt From

Dense And Super Forms 197

23 Background 211

Bibliography 217

24 Cancer In Neutrosophic SuperHyperGraph 235

25 Neutrosophic Trace-Neighbor 239

26 New Ideas In Recognition of Cancer And Neutrosophic SuperHyper-

Graph By Trace-Neighbor As Hyper Nebbish On Super Nebulous 241

27 ABSTRACT 243

28 Applied Notions Under The Scrutiny Of The Motivation Of This

Scientific Research 249

29 Neutrosophic Preliminaries Of This Scientific Research On the Re-

deemed Ways 253

Henry Garrett · 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 Neutrosophic SuperHyperTrace-Decomposition But As The Extensions

Excerpt From Dense And Super Forms 265

31 The Neutrosophic Departures on The Theoretical Results Toward

Theoretical Motivations 307

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

Motivation 317

33 Neutrosophic Applications in Cancer’s Neutrosophic Recognition 329

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

perBipartite as Neutrosophic SuperHyperModel 331

35 Case 2: The Increasing Neutrosophic Steps Toward Neutrosophic

SuperHyperMultipartite as Neutrosophic SuperHyperModel 333

36 Wondering Open Problems But As The Directions To Forming The

Motivations 335

37 Conclusion and Closing Remarks 337

38 Neutrosophic SuperHyperDuality But As The Extensions Excerpt From

Dense And Super Forms 339

39 Neutrosophic SuperHyperJoin But As The Extensions Excerpt From

Dense And Super Forms 353

40 Neutrosophic SuperHyperPerfect But As The Extensions Excerpt From

Dense And Super Forms 367

41 Neutrosophic SuperHyperTotal But As The Extensions Excerpt From

Dense And Super Forms 381

42 Neutrosophic SuperHyperConnected But As The Extensions Excerpt

From Dense And Super Forms 395

43 Background 409

Bibliography 415

44 Books’ Contributions 433

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

46 CV 471

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

SuperHyperTrace-Decomposition in the Extreme Example (42.0.3) . . . . . . . . . 73
10.2 The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
SuperHyperTrace-Decomposition in the Extreme Example (42.0.3) . . . . . . . . . 74
10.3 The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
SuperHyperTrace-Decomposition in the Extreme Example (42.0.3) . . . . . . . . . 74
10.4 The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
SuperHyperTrace-Decomposition in the Extreme Example (42.0.3) . . . . . . . . . 75
10.5 The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
SuperHyperTrace-Decomposition in the Extreme Example (42.0.3) . . . . . . . . . 76
10.6 The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
SuperHyperTrace-Decomposition in the Extreme Example (42.0.3) . . . . . . . . . 77
10.7 The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
SuperHyperTrace-Decomposition in the Extreme Example (42.0.3) . . . . . . . . . 78
10.8 The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
SuperHyperTrace-Decomposition in the Extreme Example (42.0.3) . . . . . . . . . 79
10.9 The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
SuperHyperTrace-Decomposition in the Extreme Example (42.0.3) . . . . . . . . . 79
10.10The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
SuperHyperTrace-Decomposition in the Extreme Example (42.0.3) . . . . . . . . . 80
10.11The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
SuperHyperTrace-Decomposition in the Extreme Example (42.0.3) . . . . . . . . . 81
10.12The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
SuperHyperTrace-Decomposition in the Extreme Example (42.0.3) . . . . . . . . . 82
10.13The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
SuperHyperTrace-Decomposition in the Extreme Example (42.0.3) . . . . . . . . . 83
10.14The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
SuperHyperTrace-Decomposition in the Extreme Example (42.0.3) . . . . . . . . . 84
10.15The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
SuperHyperTrace-Decomposition in the Extreme Example (42.0.3) . . . . . . . . . 85
10.16The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
SuperHyperTrace-Decomposition in the Extreme Example (42.0.3) . . . . . . . . . 85

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

SuperHyperTrace-Decomposition in the Extreme Example (42.0.3) . . . . . . . . . 86
10.18The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
SuperHyperTrace-Decomposition in the Extreme Example (42.0.3) . . . . . . . . . 87
10.19The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
SuperHyperTrace-Decomposition in the Extreme Example (42.0.3) . . . . . . . . . 88
10.20The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
SuperHyperTrace-Decomposition in the Extreme Example (42.0.3) . . . . . . . . . 89
10.21The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
SuperHyperTrace-Decomposition in the Extreme Example (42.0.3) . . . . . . . . . 90
10.22The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
SuperHyperTrace-Decomposition in the Extreme Example (42.0.3) . . . . . . . . . 91

11.1 an Extreme SuperHyperPath Associated to the Notions of Extreme

SuperHyperTrace-Decomposition in the Example (42.0.5) . . . . . . . . . . . . . . 110
11.2 an Extreme SuperHyperCycle Associated to the Extreme Notions of Extreme
SuperHyperTrace-Decomposition in the Extreme Example (42.0.7) . . . . . . . . . 112
11.3 an Extreme SuperHyperStar Associated to the Extreme Notions of Extreme
SuperHyperTrace-Decomposition in the Extreme Example (42.0.9) . . . . . . . . . 113
11.4 Extreme SuperHyperBipartite Extreme Associated to the Extreme Notions of
Extreme SuperHyperTrace-Decomposition in the Example (42.0.11) . . . . . . . . 115
11.5 an Extreme SuperHyperMultipartite Associated to the Notions of Extreme
SuperHyperTrace-Decomposition in the Example (42.0.13) . . . . . . . . . . . . . . 117
11.6 an Extreme SuperHyperWheel Extreme Associated to the Extreme Notions of
Extreme SuperHyperTrace-Decomposition in the Extreme Example (42.0.15) . . . 118

14.1 an Extreme SuperHyperBipartite Associated to the Notions of Extreme

SuperHyperTrace-Decomposition . . . . . . . . . . . . . . . . . . . . . . . . . . . . 133

15.1 an Extreme SuperHyperMultipartite Associated to the Notions of Extreme

SuperHyperTrace-Decomposition . . . . . . . . . . . . . . . . . . . . . . . . . . . . 135

30.1 The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions

of Neutrosophic SuperHyperTrace-Decomposition in the Neutrosophic Example
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 271
30.2 The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions
of Neutrosophic SuperHyperTrace-Decomposition in the Neutrosophic Example
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 272
30.3 The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions
of Neutrosophic SuperHyperTrace-Decomposition in the Neutrosophic Example
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 273
30.4 The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions
of Neutrosophic SuperHyperTrace-Decomposition in the Neutrosophic Example
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 273
30.5 The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions
of Neutrosophic SuperHyperTrace-Decomposition in the Neutrosophic Example
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 274

Henry Garrett · 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 SuperHyperTrace-Decomposition in the Neutrosophic Example
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 275
30.7 The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions
of Neutrosophic SuperHyperTrace-Decomposition in the Neutrosophic Example
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 276
30.8 The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions
of Neutrosophic SuperHyperTrace-Decomposition in the Neutrosophic Example
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 277
30.9 The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions
of Neutrosophic SuperHyperTrace-Decomposition in the Neutrosophic Example
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 278
30.10The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions
of Neutrosophic SuperHyperTrace-Decomposition in the Neutrosophic Example
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 279
30.11The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions
of Neutrosophic SuperHyperTrace-Decomposition in the Neutrosophic Example
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 279
30.12The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions
of Neutrosophic SuperHyperTrace-Decomposition in the Neutrosophic Example
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 280
30.13The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions
of Neutrosophic SuperHyperTrace-Decomposition in the Neutrosophic Example
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 281
30.14The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions
of Neutrosophic SuperHyperTrace-Decomposition in the Neutrosophic Example
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 282
30.15The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions
of Neutrosophic SuperHyperTrace-Decomposition in the Neutrosophic Example
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 283
30.16The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions
of Neutrosophic SuperHyperTrace-Decomposition in the Neutrosophic Example
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 284
30.17The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions
of Neutrosophic SuperHyperTrace-Decomposition in the Neutrosophic Example
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 285
30.18The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions
of Neutrosophic SuperHyperTrace-Decomposition in the Neutrosophic Example
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 285
30.19The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions
of Neutrosophic SuperHyperTrace-Decomposition in the Neutrosophic Example
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 286
30.20The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions
of Neutrosophic SuperHyperTrace-Decomposition in the Neutrosophic Example
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 287

Henry Garrett · 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 SuperHyperTrace-Decomposition in the Neutrosophic Example
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 288
30.22The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions
of Neutrosophic SuperHyperTrace-Decomposition in the Neutrosophic Example
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 289

31.1 a Neutrosophic SuperHyperPath Associated to the Notions of Neutrosophic

SuperHyperTrace-Decomposition in the Example (42.0.5) . . . . . . . . . . . . . . 308
31.2 a Neutrosophic SuperHyperCycle Associated to the Neutrosophic Notions of
Neutrosophic SuperHyperTrace-Decomposition in the Neutrosophic Example (42.0.7) 310
31.3 a Neutrosophic SuperHyperStar Associated to the Neutrosophic Notions of
Neutrosophic SuperHyperTrace-Decomposition in the Neutrosophic Example (42.0.9) 311
31.4 Neutrosophic SuperHyperBipartite Neutrosophic Associated to the Neutrosophic
Notions of Neutrosophic SuperHyperTrace-Decomposition in the Example (42.0.11) 313
31.5 a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic
SuperHyperTrace-Decomposition in the Example (42.0.13) . . . . . . . . . . . . . . 315
31.6 a Neutrosophic SuperHyperWheel Neutrosophic Associated to the Neutrosophic
Notions of Neutrosophic SuperHyperTrace-Decomposition in the Neutrosophic
Example (42.0.15) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 316

34.1 a Neutrosophic SuperHyperBipartite Associated to the Notions of Neutrosophic

SuperHyperTrace-Decomposition . . . . . . . . . . . . . . . . . . . . . . . . . . . . 331

35.1 a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic

SuperHyperTrace-Decomposition . . . . . . . . . . . . . . . . . . . . . . . . . . . . 333

44.1 Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Trace-
Neighbor In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo
2023, (doi: 10.5281/zenodo.7779286). . . . . . . . . . . . . . . . . . . . . . . . . . . 434
44.2 Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Trace-
Neighbor In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo
2023, (doi: 10.5281/zenodo.7779286). . . . . . . . . . . . . . . . . . . . . . . . . . . 435
44.3 Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Trace-
Neighbor In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo
2023, (doi: 10.5281/zenodo.7779286). . . . . . . . . . . . . . . . . . . . . . . . . . . 435
44.4 Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic Super-
HyperGraph By Trace-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo
2023, (doi: 10.5281/zenodo.7777857). . . . . . . . . . . . . . . . . . . . . . . . . . . 436
44.5 Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic Super-
HyperGraph By Trace-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo
2023, (doi: 10.5281/zenodo.7777857). . . . . . . . . . . . . . . . . . . . . . . . . . . 437
44.6 Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic Super-
HyperGraph By Trace-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo
2023, (doi: 10.5281/zenodo.7777857). . . . . . . . . . . . . . . . . . . . . . . . . . . 437
44.7 [HG148b] Henry Garrett, “Trace-Neighbor In SuperHyperGraphs”. Dr. Henry
Garrett, 2023 (doi: 10.5281/zenodo.7773119). . . . . . . . . . . . . . . . . . . . . . 440

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

44.8 [HG148b] Henry Garrett, “Trace-Neighbor In SuperHyperGraphs”. Dr. Henry

Garrett, 2023 (doi: 10.5281/zenodo.7773119). . . . . . . . . . . . . . . . . . . . . . 441
44.9 [HG148b] Henry Garrett, “Trace-Neighbor In SuperHyperGraphs”. Dr. Henry
Garrett, 2023 (doi: 10.5281/zenodo.7773119). . . . . . . . . . . . . . . . . . . . . . 441

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

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

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) 64
9.2 The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges
Belong to The Neutrosophic SuperHyperGraph, Mentioned in the Definition (29.0.22) 65
9.3 The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges
Belong to The Neutrosophic SuperHyperGraph Mentioned in the Definition (29.0.23) 65

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

Belong to The Extreme SuperHyperBipartite . . . . . . . . . . . . . . . . . . . . . 134

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

Belong to The Extreme SuperHyperMultipartite . . . . . . . . . . . . . . . . . . . 136

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

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

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

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

Belong to The Neutrosophic SuperHyperBipartite . . . . . . . . . . . . . . . . . . 332

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

Belong to The Neutrosophic SuperHyperMultipartite . . . . . . . . . . . . . . . . . 334

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

xi
 CHAPTER 1

ABSTRACT

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

Graphs” about some scientific research on Trace-Neighbor In SuperHyperGraphs by two 3

(Extreme/Neutrosophic) notions, namely, Extreme Trace-Neighbor In SuperHyperGraphs and 4
Neutrosophic Trace-Neighbor In SuperHyperGraphs. With scientific research on the basic 5
scientific research properties, the scientific research book starts to make Extreme Trace-Neighbor 6
In SuperHyperGraphs theory and Neutrosophic Trace-Neighbor In SuperHyperGraphs theory 7
more (Extremely/Neutrosophicly) understandable. 8

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

implemented in the whole of this research. For shining the elegancy and the significancy of this 15
research, the comparison between this SuperHyperNotion with other SuperHyperNotions and 16
fundamental SuperHyperNumbers are featured. The definitions are followed by the examples 17
and the instances thus the clarifications are driven with different tools. The applications are 18
figured out to make sense about the theoretical aspect of this ongoing research. The “Cancer’s 19
Recognition” are the under scientific research to figure out the challenges make sense about 20

ongoing and upcoming research. The special case is up. The cells are viewed in the deemed 21
ways. There are different types of them. Some of them are individuals and some of them are 22
well-modeled by the group of cells. These types are all officially called “SuperHyperVertex” but 23
the relations amid them all officially called “SuperHyperEdge”. The frameworks “SuperHyper- 24
Graph” and “Neutrosophic SuperHyperGraph” are chosen and elected to scientific research 25
about “Cancer’s Recognition”. Thus these complex and dense SuperHyperModels open up some 26

avenues to scientific research on theoretical segments and “Cancer’s Recognition”. Some avenues 27
are posed to pursue this research. It’s also officially collected in the form of some questions and 28
some problems. Assume a SuperHyperGraph. Then δ−Trace-Neighbor In SuperHyperGraphs 29
is a maximal of SuperHyperVertices with a maximum cardinality such that either of the 30
following expressions hold for the (Neutrosophic) cardinalities of SuperHyperNeighbors of 31
s ∈ S : there are |S ∩ N (s)| > |S ∩ (V \ N (s))| + δ; and |S ∩ N (s)| < |S ∩ (V \ N (s))| + δ. The 32

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

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

S is an δ−SuperHyperDefensive; a Neutrosophic δ−Trace-Neighbor In SuperHyperGraphs is a 34

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

δ−SuperHyperDefensive It’s useful to define a “Neutrosophic” version of a Trace-Neighbor In 40

SuperHyperGraphs . Since there’s more ways to get type-results to make a Trace-Neighbor In 41
SuperHyperGraphs more understandable. For the sake of having Neutrosophic Trace-Neighbor 42
In SuperHyperGraphs, there’s a need to “redefine” the notion of a “Trace-Neighbor In Super- 43
HyperGraphs ”. The SuperHyperVertices and the SuperHyperEdges are assigned by the labels 44
from the letters of the alphabets. In this procedure, there’s the usage of the position of labels 45

to assign to the values. Assume a Trace-Neighbor In SuperHyperGraphs . It’s redefined a 46

Neutrosophic Trace-Neighbor In SuperHyperGraphs if the mentioned Table holds, concerning, 47
“The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges Belong 48
to The Neutrosophic SuperHyperGraph” with the key points, “The Values of The Vertices 49
& The Number of Position in Alphabet”, “The Values of The SuperVertices&The maximum 50
Values of Its Vertices”, “The Values of The Edges&The maximum Values of Its Vertices”, 51

“The Values of The HyperEdges&The maximum Values of Its Vertices”, “The Values of The 52
SuperHyperEdges&The maximum Values of Its Endpoints”. To get structural examples and 53
instances, I’m going to introduce the next SuperHyperClass of SuperHyperGraph based on 54
a Trace-Neighbor In SuperHyperGraphs . It’s the main. It’ll be disciplinary to have the 55
foundation of previous definition in the kind of SuperHyperClass. If there’s a need to have 56
all Trace-Neighbor In SuperHyperGraphs until the Trace-Neighbor In SuperHyperGraphs, 57

then it’s officially called a “Trace-Neighbor In SuperHyperGraphs” but otherwise, it isn’t a 58

Trace-Neighbor In SuperHyperGraphs . There are some instances about the clarifications for 59
the main definition titled a “Trace-Neighbor In SuperHyperGraphs ”. These two examples get 60
more scrutiny and discernment since there are characterized in the disciplinary ways of the 61
SuperHyperClass based on a Trace-Neighbor In SuperHyperGraphs . For the sake of having a 62
Neutrosophic Trace-Neighbor In SuperHyperGraphs, there’s a need to “redefine” the notion of a 63

“Neutrosophic Trace-Neighbor In SuperHyperGraphs” and a “Neutrosophic Trace-Neighbor In 64

SuperHyperGraphs ”. The SuperHyperVertices and the SuperHyperEdges are assigned by the la- 65
bels from the letters of the alphabets. In this procedure, there’s the usage of the position of labels 66
to assign to the values. Assume a Neutrosophic SuperHyperGraph. It’s redefined “Neutrosophic 67
SuperHyperGraph” if the intended Table holds. And a Trace-Neighbor In SuperHyperGraphs are 68

redefined to a “Neutrosophic Trace-Neighbor In SuperHyperGraphs” if the intended Table holds. 69

It’s useful to define “Neutrosophic” version of SuperHyperClasses. Since there’s more ways to 70
get Neutrosophic type-results to make a Neutrosophic Trace-Neighbor In SuperHyperGraphs 71
more understandable. Assume a Neutrosophic SuperHyperGraph. There are some Neutrosophic 72
SuperHyperClasses if the intended Table holds. Thus SuperHyperPath, Trace-Neighbor In 73
SuperHyperGraphs, SuperHyperStar, SuperHyperBipartite, SuperHyperMultiPartite, and 74

SuperHyperWheel, are “Neutrosophic SuperHyperPath”, “Neutrosophic Trace-Neighbor In 75

SuperHyperGraphs”, “Neutrosophic SuperHyperStar”, “Neutrosophic SuperHyperBipartite”, 76
“Neutrosophic SuperHyperMultiPartite”, and “Neutrosophic SuperHyperWheel” if the intended 77
Table holds. A SuperHyperGraph has a “Neutrosophic Trace-Neighbor In SuperHyperGraphs” 78
where it’s the strongest [the maximum Neutrosophic value from all the Trace-Neighbor In 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

SuperHyperGraphs amid the maximum value amid all SuperHyperVertices from a Trace- 80
Neighbor In SuperHyperGraphs .] Trace-Neighbor In SuperHyperGraphs . A graph is a 81
SuperHyperUniform if it’s a SuperHyperGraph and the number of elements of SuperHyperEdges 82
are the same. Assume a Neutrosophic SuperHyperGraph. There are some SuperHyperClasses 83
as follows. It’s SuperHyperPath if it’s only one SuperVertex as intersection amid two given 84
SuperHyperEdges with two exceptions; it’s Trace-Neighbor In SuperHyperGraphs if it’s only 85

one SuperVertex as intersection amid two given SuperHyperEdges; it’s SuperHyperStar it’s only 86
one SuperVertex as intersection amid all SuperHyperEdges; it’s SuperHyperBipartite it’s only 87
one SuperVertex as intersection amid two given SuperHyperEdges and these SuperVertices, 88
forming two separate sets, has no SuperHyperEdge in common; it’s SuperHyperMultiPartite it’s 89
only one SuperVertex as intersection amid two given SuperHyperEdges and these SuperVertices, 90
forming multi separate sets, has no SuperHyperEdge in common; it’s a SuperHyperWheel if it’s 91

only one SuperVertex as intersection amid two given SuperHyperEdges and one SuperVertex 92
has one SuperHyperEdge with any common SuperVertex. The SuperHyperModel proposes 93
the specific designs and the specific architectures. The SuperHyperModel is officially called 94
“SuperHyperGraph” and “Neutrosophic SuperHyperGraph”. In this SuperHyperModel, The 95
“specific” cells and “specific group” of cells are SuperHyperModeled as “SuperHyperVertices” 96
and the common and intended properties between “specific” cells and “specific group” of 97

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

degrees of determinacy, indeterminacy, and neutrality to have more precise SuperHyperModel 99
which in this case the SuperHyperModel is called “Neutrosophic”. In the future research, the 100
foundation will be based on the “Cancer’s Recognition” and the results and the definitions 101
will be introduced in redeemed ways. The recognition of the cancer in the long-term function. 102
The specific region has been assigned by the model [it’s called SuperHyperGraph] and the 103

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

moves and the traces of the cancer on the complex tracks and between complicated groups of 110
cells could be fantasized by a Neutrosophic SuperHyperPath(-/Trace-Neighbor In SuperHyper- 111
Graphs, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). 112
The aim is to find either the longest Trace-Neighbor In SuperHyperGraphs or the strongest 113
Trace-Neighbor In SuperHyperGraphs in those Neutrosophic SuperHyperModels. For the 114

longest Trace-Neighbor In SuperHyperGraphs, called Trace-Neighbor In SuperHyperGraphs, 115

and the strongest Trace-Neighbor In SuperHyperGraphs, called Neutrosophic Trace-Neighbor 116
In SuperHyperGraphs, some general results are introduced. Beyond that in SuperHyperStar, 117
all possible SuperHyperPaths have only two SuperHyperEdges but it’s not enough since it’s 118
essential to have at least three SuperHyperEdges to form any style of a Trace-Neighbor In 119
SuperHyperGraphs. There isn’t any formation of any Trace-Neighbor In SuperHyperGraphs 120

but literarily, it’s the deformation of any Trace-Neighbor In SuperHyperGraphs. It, literarily, 121
deforms and it doesn’t form. A basic familiarity with SuperHyperGraph theory and Neutro- 122
sophic SuperHyperGraph theory are proposed. 123
Keywords: SuperHyperGraph, (Neutrosophic) Trace-Neighbor In SuperHyperGraphs, Can- 124

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

cer’s Recognition 125

AMS Subject Classification: 05C17, 05C22, 05E45 126
127
In the some chapters, in some researches, new setting is introduced for new SuperHyper- 128
Notion, namely, Neutrosophic Trace-Neighbor In SuperHyperGraphs . Two different types 129
of SuperHyperDefinitions are debut for them but the scientific research goes further and the 130

SuperHyperNotion, SuperHyperUniform, and SuperHyperClass based on that are well-defined 131

and well-reviewed. The literature review is implemented in the whole of this research. For 132
shining the elegancy and the significancy of this research, the comparison between this SuperHy- 133
perNotion with other SuperHyperNotions and fundamental SuperHyperNumbers are featured. 134
The definitions are followed by the examples and the instances thus the clarifications are driven 135
with different tools. The applications are figured out to make sense about the theoretical aspect 136

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

are chosen and elected to scientific research about “Cancer’s Neutrosophic Recognition”. Thus 143
these complex and dense SuperHyperModels open up some avenues to scientific research on 144
theoretical segments and “Cancer’s Neutrosophic Recognition”. Some avenues are posed to 145
pursue this research. It’s also officially collected in the form of some questions and some problems. 146
Assume a SuperHyperGraph. Then an “δ−Trace-Neighbor In SuperHyperGraphs” is a maximal 147
Trace-Neighbor In SuperHyperGraphs of SuperHyperVertices with maximum cardinality such 148

that either of the following expressions hold for the (Neutrosophic) cardinalities of SuperHyper- 149
Neighbors of s ∈ S : |S ∩ N (s)| > |S ∩ (V \ N (s))| + δ, |S ∩ N (s)| < |S ∩ (V \ N (s))| + δ. The 150
first Expression, holds if S is an “δ−SuperHyperOffensive”. And the second Expression, holds if 151
S is an “δ−SuperHyperDefensive”; a“Neutrosophic δ−Trace-Neighbor In SuperHyperGraphs” 152
is a maximal Neutrosophic Trace-Neighbor In SuperHyperGraphs of SuperHyperVertices with 153
maximum Neutrosophic cardinality such that either of the following expressions hold for 154

the Neutrosophic cardinalities of SuperHyperNeighbors of s ∈ S : |S ∩ N (s)|N eutrosophic > 155

|S ∩(V \N (s))|N eutrosophic +δ, |S ∩N (s)|N eutrosophic < |S ∩(V \N (s))|N eutrosophic +δ. The first 156
Expression, holds if S is a “Neutrosophic δ−SuperHyperOffensive”. And the second Expression, 157
holds if S is a “Neutrosophic δ−SuperHyperDefensive”. It’s useful to define “Neutrosophic” 158
version of Trace-Neighbor In SuperHyperGraphs . Since there’s more ways to get type-results 159

to make Trace-Neighbor In SuperHyperGraphs more understandable. For the sake of having 160
Neutrosophic Trace-Neighbor In SuperHyperGraphs, there’s a need to “redefine” the notion of 161
“Trace-Neighbor In SuperHyperGraphs ”. The SuperHyperVertices and the SuperHyperEdges 162
are assigned by the labels from the letters of the alphabets. In this procedure, there’s the usage 163
of the position of labels to assign to the values. Assume a Trace-Neighbor In SuperHyperGraphs . 164
It’s redefined Neutrosophic Trace-Neighbor In SuperHyperGraphs if the mentioned Table holds, 165

concerning, “The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges 166
Belong to The Neutrosophic SuperHyperGraph” with the key points, “The Values of The 167
Vertices & The Number of Position in Alphabet”, “The Values of The SuperVertices&The 168
maximum Values of Its Vertices”, “The Values of The Edges&The maximum Values of Its 169
Vertices”, “The Values of The HyperEdges&The maximum Values of Its Vertices”, “The Values 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

of The SuperHyperEdges&The maximum Values of Its Endpoints”. To get structural examples 171
and instances, I’m going to introduce the next SuperHyperClass of SuperHyperGraph based 172
on Trace-Neighbor In SuperHyperGraphs . It’s the main. It’ll be disciplinary to have the 173
foundation of previous definition in the kind of SuperHyperClass. If there’s a need to have all 174
Trace-Neighbor In SuperHyperGraphs until the Trace-Neighbor In SuperHyperGraphs, then it’s 175
officially called “Trace-Neighbor In SuperHyperGraphs” but otherwise, it isn’t Trace-Neighbor 176

In SuperHyperGraphs . There are some instances about the clarifications for the main definition 177
titled “Trace-Neighbor In SuperHyperGraphs ”. These two examples get more scrutiny and 178
discernment since there are characterized in the disciplinary ways of the SuperHyperClass based 179
on Trace-Neighbor In SuperHyperGraphs . For the sake of having Neutrosophic Trace-Neighbor 180
In SuperHyperGraphs, there’s a need to “redefine” the notion of “Neutrosophic Trace-Neighbor 181
In SuperHyperGraphs” and “Neutrosophic Trace-Neighbor In SuperHyperGraphs ”. The 182

SuperHyperVertices and the SuperHyperEdges are assigned by the labels from the letters 183
of the alphabets. In this procedure, there’s the usage of the position of labels to assign to 184
the values. Assume a Neutrosophic SuperHyperGraph. It’s redefined “Neutrosophic Supe- 185
rHyperGraph” if the intended Table holds. And Trace-Neighbor In SuperHyperGraphs are 186
redefined “Neutrosophic Trace-Neighbor In SuperHyperGraphs” if the intended Table holds. 187
It’s useful to define “Neutrosophic” version of SuperHyperClasses. Since there’s more ways to 188

get Neutrosophic type-results to make Neutrosophic Trace-Neighbor In SuperHyperGraphs 189

more understandable. Assume a Neutrosophic SuperHyperGraph. There are some Neutrosophic 190
SuperHyperClasses if the intended Table holds. Thus SuperHyperPath, Trace-Neighbor In 191
SuperHyperGraphs, SuperHyperStar, SuperHyperBipartite, SuperHyperMultiPartite, and 192
SuperHyperWheel, are “Neutrosophic SuperHyperPath”, “Neutrosophic Trace-Neighbor In 193
SuperHyperGraphs”, “Neutrosophic SuperHyperStar”, “Neutrosophic SuperHyperBipartite”, 194

“Neutrosophic SuperHyperMultiPartite”, and “Neutrosophic SuperHyperWheel” if the intended 195

Table holds. A SuperHyperGraph has “Neutrosophic Trace-Neighbor In SuperHyperGraphs” 196
where it’s the strongest [the maximum Neutrosophic value from all Trace-Neighbor In Super- 197
HyperGraphs amid the maximum value amid all SuperHyperVertices from a Trace-Neighbor 198
In SuperHyperGraphs .] Trace-Neighbor In SuperHyperGraphs . A graph is SuperHyper- 199
Uniform if it’s SuperHyperGraph and the number of elements of SuperHyperEdges are the 200

same. Assume a Neutrosophic SuperHyperGraph. There are some SuperHyperClasses as 201

follows. It’s SuperHyperPath if it’s only one SuperVertex as intersection amid two given 202
SuperHyperEdges with two exceptions; it’s Trace-Neighbor In SuperHyperGraphs if it’s only 203
one SuperVertex as intersection amid two given SuperHyperEdges; it’s SuperHyperStar it’s only 204
one SuperVertex as intersection amid all SuperHyperEdges; it’s SuperHyperBipartite it’s only 205

one SuperVertex as intersection amid two given SuperHyperEdges and these SuperVertices, 206
forming two separate sets, has no SuperHyperEdge in common; it’s SuperHyperMultiPartite it’s 207
only one SuperVertex as intersection amid two given SuperHyperEdges and these SuperVertices, 208
forming multi separate sets, has no SuperHyperEdge in common; it’s SuperHyperWheel if it’s 209
only one SuperVertex as intersection amid two given SuperHyperEdges and one SuperVertex 210
has one SuperHyperEdge with any common SuperVertex. The SuperHyperModel proposes 211

the specific designs and the specific architectures. The SuperHyperModel is officially called 212
“SuperHyperGraph” and “Neutrosophic SuperHyperGraph”. In this SuperHyperModel, The 213
“specific” cells and “specific group” of cells are SuperHyperModeled as “SuperHyperVertices” 214
and the common and intended properties between “specific” cells and “specific group” of cells 215
are SuperHyperModeled as “SuperHyperEdges”. Sometimes, it’s useful to have some degrees of 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

determinacy, indeterminacy, and neutrality to have more precise SuperHyperModel which in this 217
case the SuperHyperModel is called “Neutrosophic”. In the future research, the foundation will 218
be based on the “Cancer’s Neutrosophic Recognition” and the results and the definitions will 219
be introduced in redeemed ways. The Neutrosophic recognition of the cancer in the long-term 220
function. The specific region has been assigned by the model [it’s called SuperHyperGraph] 221
and the long cycle of the move from the cancer is identified by this research. Sometimes the 222

move of the cancer hasn’t be easily identified since there are some determinacy, indeterminacy 223
and neutrality about the moves and the effects of the cancer on that region; this event leads us 224
to choose another model [it’s said to be Neutrosophic SuperHyperGraph] to have convenient 225
perception on what’s happened and what’s done. There are some specific models, which are 226
well-known and they’ve got the names, and some SuperHyperGeneral SuperHyperModels. The 227
moves and the traces of the cancer on the complex tracks and between complicated groups of 228

cells could be fantasized by a Neutrosophic SuperHyperPath(-/Trace-Neighbor In SuperHyper- 229

Graphs, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). 230
The aim is to find either the longest Trace-Neighbor In SuperHyperGraphs or the strongest 231
Trace-Neighbor In SuperHyperGraphs in those Neutrosophic SuperHyperModels. For the 232
longest Trace-Neighbor In SuperHyperGraphs, called Trace-Neighbor In SuperHyperGraphs, 233
and the strongest Trace-Neighbor In SuperHyperGraphs, called Neutrosophic Trace-Neighbor 234

In SuperHyperGraphs, some general results are introduced. Beyond that in SuperHyperStar, 235
all possible SuperHyperPaths have only two SuperHyperEdges but it’s not enough since it’s 236
essential to have at least three SuperHyperEdges to form any style of a Trace-Neighbor In 237
SuperHyperGraphs. There isn’t any formation of any Trace-Neighbor In SuperHyperGraphs 238
but literarily, it’s the deformation of any Trace-Neighbor In SuperHyperGraphs. It, literarily, 239
deforms and it doesn’t form. A basic familiarity with SuperHyperGraph theory and Neutro- 240

sophic SuperHyperGraph theory are proposed. 241

Keywords: Neutrosophic SuperHyperGraph, Neutrosophic Trace-Neighbor In SuperHyper- 242

Graphs, Cancer’s Neutrosophic Recognition 243

AMS Subject Classification: 05C17, 05C22, 05E45 244
245
Some scientific studies and scientific researches about neutrosophic graphs, are proposed 246
as book in the following by Henry Garrett (2022) which is indexed by Google Scholar and has 247
more than 3181 readers in Scribd. It’s titled “Beyond Neutrosophic Graphs” and published by 248

Ohio: E-publishing: Educational Publisher 1091 West 1st Ave Grandview Heights, Ohio 43212 249
United State. This research book covers different types of notions and settings in neutrosophic 250
graph theory and neutrosophic SuperHyperGraph theory. 251
252
253
[Ref] Henry Garrett, (2022). “Beyond Neutrosophic Graphs”, Ohio: E-publishing: Edu- 254

cational Publisher 1091 West 1st Ave Grandview Heights, Ohio 43212 United States. ISBN: 255
978-1-59973-725-6 (http://fs.unm.edu/BeyondNeutrosophicGraphs.pdf). 256
[Ref] Henry Garrett, (2022). “Beyond Neutrosophic Graphs”, Ohio: E-publishing: Educational 257
Publisher 1091 West 1st Ave Grandview Heights, Ohio 43212 United States. ISBN: 978-1-59973- 258
725-6 (http://fs.unm.edu/BeyondNeutrosophicGraphs.pdf). 259
260

Also, some scientific studies and scientific researches about neutrosophic graphs, are pro- 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

posed as book in the following by Henry Garrett (2022) which is indexed by Google Scholar 262
and has more than 4060 readers in Scribd. It’s titled “Neutrosophic Duality” and published by 263
Florida: GLOBAL KNOWLEDGE - Publishing House 848 Brickell Ave Ste 950 Miami, Florida 264
33131 United States. This research book presents different types of notions SuperHyperResolving 265
and Trace-Neighbor In SuperHyperGraphs in the setting of duality in neutrosophic graph 266

theory and neutrosophic SuperHyperGraph theory. This research book has scrutiny on the 267
complement of the intended set and the intended set, simultaneously. It’s smart to consider a 268
set but acting on its complement that what’s done in this research book which is popular in the 269
terms of high readers in Scribd. 270
[Ref] Henry Garrett, (2022). “Neutrosophic Duality”, Florida: GLOBAL KNOWLEDGE 271
- Publishing House 848 Brickell Ave Ste 950 Miami, Florida 33131 United States. ISBN: 272

978-1-59973-743-0 (http://fs.unm.edu/NeutrosophicDuality.pdf). 273

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

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

Background 278

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

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

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

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

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

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

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

11
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 312
(Dual)Resolving and (Dual)Coloring alongside (Dual)Dominating in (Neutrosophic)n- 313
SuperHyperGraph” in Ref. [HG4] by Henry Garrett (2022), “0049 | (Failed)1-Zero-Forcing 314
Number in Neutrosophic Graphs” in Ref. [HG5] by Henry Garrett (2022), “Extreme SuperHy- 315
perClique as the Firm Scheme of Confrontation under Cancer’s Recognition as the Model in 316
The Setting of (Neutrosophic) SuperHyperGraphs” in Ref. [HG6] by Henry Garrett (2022), 317

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

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

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

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

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

Neutrosophic Recognitions In Special ViewPoints” in Ref. [HG14] by Henry Garrett (2022), 336
“Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To Use Neutrosophic 337
SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond” in Ref. [HG15] 338
by Henry Garrett (2022), “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by 339
Well- SuperHyperModelled (Neutrosophic) SuperHyperGraphs ” in Ref. [HG16] by Henry 340
Garrett (2022), “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic Su- 341

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

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

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

SuperHyperModeling of Cancer’s Recognitions Featuring (Neutrosophic) SuperHyperDefensive 348
SuperHyperAlliances” in Ref. [HG19] by Henry Garrett (2022), “(Neutrosophic) Super- 349
HyperAlliances With SuperHyperDefensive and SuperHyperOffensive Type-SuperHyperSet 350
On (Neutrosophic) SuperHyperGraph With (Neutrosophic) SuperHyperModeling of Cancer’s 351
Recognitions And Related (Neutrosophic) SuperHyperClasses” in Ref. [HG20] by Henry 352

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

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

Henry Garrett · 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” 358
in Ref. [HG23] by Henry Garrett (2022), “SuperHyperMatching By (R-)Definitions And 359
Polynomials To Monitor Cancer’s Recognition In Neutrosophic SuperHyperGraphs” in Ref. 360
[HG24] by Henry Garrett (2023), “The Focus on The Partitions Obtained By Parallel Moves 361
In The Cancer’s Extreme Recognition With Different Types of Extreme SuperHyperMatching 362
Set and Polynomial on (Neutrosophic) SuperHyperGraphs” in Ref. [HG25] by Henry Garrett 363

(2023), “Extreme Failed SuperHyperClique Decides the Failures on the Cancer’s Recognition 364
in the Perfect Connections of Cancer’s Attacks By SuperHyperModels Named (Neutrosophic) 365
SuperHyperGraphs” in Ref. [HG26] by Henry Garrett (2023), “Indeterminacy On The All 366
Possible Connections of Cells In Front of Cancer’s Attacks In The Terms of Neutrosophic Failed 367
SuperHyperClique on Cancer’s Recognition called Neutrosophic SuperHyperGraphs” in Ref. 368
[HG27] by Henry Garrett (2023), “Perfect Directions Toward Idealism in Cancer’s Neutrosophic 369

Recognition Forwarding Neutrosophic SuperHyperClique on Neutrosophic SuperHyperGraphs” 370

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

sophic SuperHyperGraphs” in Ref. [HG30] by Henry Garrett (2023), “Using the Tool As 376
(Neutrosophic) Failed SuperHyperStable To SuperHyperModel Cancer’s Recognition Titled 377
(Neutrosophic) SuperHyperGraphs” in Ref. [HG31] by Henry Garrett (2023), “Neutrosophic 378
Messy-Style SuperHyperGraphs To Form Neutrosophic SuperHyperStable To Act on Cancer’s 379
Neutrosophic Recognitions In Special ViewPoints” in Ref. [HG32] by Henry Garrett (2023), 380
“(Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well-SuperHyperModelled 381

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

1-Failed SuperHyperForcing in the SuperHyperFunction To Use Neutrosophic SuperHyper- 383
Graphs on Cancer’s Neutrosophic Recognition And Beyond” in Ref. [HG34] by Henry 384
Garrett (2022), “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Recognitions And 385
(Neutrosophic) SuperHyperGraphs” in Ref. [HG35] by Henry Garrett (2022), “Basic Notions 386
on (Neutrosophic) SuperHyperForcing And (Neutrosophic) SuperHyperModeling in Cancer’s 387

Recognitions And (Neutrosophic) SuperHyperGraphs” in Ref. [HG36] by Henry Garrett 388

(2022), “Basic Neutrosophic Notions Concerning SuperHyperDominating and Neutrosophic 389
SuperHyperResolving in SuperHyperGraph” in Ref. [HG37] by Henry Garrett (2022), “Initial 390
Material of Neutrosophic Preliminaries to Study Some Neutrosophic Notions Based on Neutro- 391
sophic SuperHyperEdge (NSHE) in Neutrosophic SuperHyperGraph (NSHG)” in Ref. [HG38] 392

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

HG131; HG132; HG134; HG135; HG136; HG137; HG138; HG139; HG140; HG141; 399
HG142; HG143; HG144; HG145; HG146; HG147; HG148; HG149; HG150; HG151; 400
HG152; HG153; HG154; HG155; HG156; HG157; HG158; HG159; HG160; HG161; 401
HG162; HG163; HG164; HG165; HG166; HG167; HG168; HG169; HG170; HG171; 402
HG172; HG173; HG174; HG175; HG176; HG177; HG178; HG179; HG180; HG181; 403

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

HG182; HG183; HG184; HG185; HG186; HG187; HG188; HG189; HG190; HG191; 404
HG192; HG193; HG194; HG195; HG196; HG197; HG198; HG199; HG200; HG201; 405
HG202; HG203; HG204; HG205; HG206; HG207; HG208; HG209; HG210; HG211; 406
HG212; HG213; HG214; HG215; HG216], there are some endeavors to formalize the basic 407
SuperHyperNotions about neutrosophic SuperHyperGraph and SuperHyperGraph alongside 408
scientific research books at [HG60b; HG61b; HG62b; HG63b; HG64b; HG65b; HG66b; 409

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

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

HG130b; HG131b; HG132b; HG133b; HG134b; HG135b; HG136b; HG137b; 417
HG138b; HG139b; HG140b; HG141b; HG142b; HG143b; HG144b; HG145b; 418
HG146b; HG147; HG148b; HG218]. Two popular scientific research books in Scribd 419
in the terms of high readers, 4087 and 5084 respectively, on neutrosophic science is on [HG32b; 420
HG44b]. 421

Some scientific studies and scientific researches about neutrosophic graphs, are proposed as 422
book in Ref. [HG71b] by Henry Garrett (2023) which is indexed by Google Scholar and has 423
more than 4093 readers in Scribd. It’s titled “Beyond Neutrosophic Graphs” and published 424
by Dr. Henry Garrett. This research book covers different types of notions and settings in 425
neutrosophic graph theory and neutrosophic SuperHyperGraph theory. 426
Also, some scientific studies and scientific researches about neutrosophic graphs, are proposed 427

as book in Ref. [HG70b] by Henry Garrett (2023) which is indexed by Google Scholar and 428
has more than 5090 readers in Scribd. It’s titled “Neutrosophic Duality” and published by Dr. 429
Henry Garrett. This research book presents different types of notions SuperHyperResolving and 430
SuperHyperDominating in the setting of duality in neutrosophic graph theory and neutrosophic 431
SuperHyperGraph theory. This research book has scrutiny on the complement of the intended 432
set and the intended set, simultaneously. It’s smart to consider a set but acting on its 433

complement that what’s done in this research book which is popular in the terms of high readers 434
in Scribd. 435
See the seminal scientific researches [HG1; HG2; HG3]. The formalization of the notions on 436
the framework of notions in SuperHyperGraphs, Neutrosophic notions in SuperHyperGraphs the- 437
ory, and (Neutrosophic) SuperHyperGraphs theory at [HG4; HG5; HG6; HG7; HG8; HG9; 438

HG10; HG11; HG12; HG13; HG14; HG15; HG16; HG17; HG18; HG19; HG20; 439
HG21; HG22; HG23; HG24; HG25; HG26; HG27; HG28; HG29; HG30; HG31; 440
HG32; HG33; HG34; HG35; HG36; HG37; HG38; HG94; HG942; HG95; HG952; 441
HG96; HG962; HG97; HG972; HG98; HG982; HG106; HG107; HG111; HG112; 442
HG115; HG116; HG120; HG121; HG122; HG123; HG124; HG125; HG126; HG127; 443
HG128; HG129; HG130; HG131; HG132; HG134; HG135; HG136; HG137; HG138; 444

HG139; HG140; HG141; HG142; HG143; HG144; HG145; HG146; HG147; HG148; 445
HG149; HG150; HG151; HG152; HG153; HG154; HG155; HG156; HG157; HG158; 446
HG159; HG160; HG161; HG162; HG163; HG164; HG165; HG166; HG167; HG168; 447
HG169; HG170; HG171; HG172; HG173; HG174; HG175; HG176; HG177; HG178; 448
HG179; HG180; HG181; HG182; HG183; HG184; HG185; HG186; HG187; HG188; 449

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

HG189; HG190; HG191; HG192; HG193; HG194; HG195; HG196; HG197; HG198; 450
HG199; HG200; HG201; HG202; HG203; HG204; HG205; HG206; HG207; HG208; 451
HG209; HG210; HG211; HG212; HG213; HG214; HG215; HG216; HG218] alongside 452
scientific research books at [HG60b; HG61b; HG62b; HG63b; HG64b; HG65b; HG66b; 453
HG67b; HG68b; HG69b; HG70b; HG71b; HG72b; HG73b; HG74b; HG75b; HG76b; 454
HG77b; HG78b; HG79b; HG80b; HG81b; HG82b; HG83b; HG84b; HG85b; HG86b; 455

HG87b; HG88b; HG89b; HG90b; HG91b; HG92b; HG93b; HG94b; HG95b; HG96b; 456
HG97b; HG98b; HG99b; HG100b; HG101b; HG102b; HG103b; HG104b; HG105b; 457
HG106b; HG107b; HG108b; HG109b; HG110b; HG111b; HG112b; HG113b; 458
HG114b; HG115b; HG116b; HG117b; HG118b; HG119b; HG120b; HG121b; 459
HG122b; HG123b; HG124b; HG125b; HG126b; HG127b; HG128b; HG129b; 460
HG130b; HG131b; HG132b; HG133b; HG134b; HG135b; HG136b; HG137b; 461

HG138b; HG139b; HG140b; HG141b; HG142b; HG143b; HG144b; HG145b; 462

HG146b; HG147b; HG148b]. Two popular scientific research books in Scribd in the 463
terms of high readers, 4093 and 5090 respectively, on neutrosophic science is on [HG32b; 464
HG44b]. 465

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

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

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

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

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

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

alongside-a.pdf) 479

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

HG218 [25] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph 554
By Trace-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 555

10.5281/zenodo.7777857). 556

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

HG214 [27] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of Trace- 560

Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 561

2023, (doi: 10.5281/zenodo.7772468). 562

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

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

HG211 [30] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 569
By Edge-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 570

10.13140/RG.2.2.11770.98247). 571

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

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

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

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

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

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

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

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

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

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

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

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

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

HG198 [43] Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of Stable-Neighbor In 608
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 609

10.13140/RG.2.2.17184.25602). 610

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

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

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

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

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

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

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

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

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

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

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

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

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

HG185 [56] Henry Garrett, “New Ideas On Super Lith By Hyper Lite Of List-Coloring In 647
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 648

10.13140/RG.2.2.16356.04489). 649

Henry Garrett · 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 [57] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHy- 650
perGraph By Space As Hyper Sparse On Super Spark”, ResearchGate 2023, (doi: 651
10.13140/RG.2.2.21756.21129). 652

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

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

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

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

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

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

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

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

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

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

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

HG172 [69] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyper- 686
Graph By SuperHyperEdge-Domination As Hyper Reversion On Super Indirection”, 687

ResearchGate 2023, (doi: 10.13140/RG.2.2.10493.84962). 688

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

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

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

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

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

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

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

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

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

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

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

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

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

HG159 [82] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 725
By SuperHyperDominating As Hyper Closing On Super Messy”, ResearchGate 2023, (doi: 726

10.13140/RG.2.2.21510.45125). 727

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

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

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

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

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

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

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

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

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

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

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

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

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

HG146 [95] Henry Garrett, “New Ideas On Super Reflections By Hyper Rotations Of Path SuperHy- 764
perColoring In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 765

ResearchGate 2023, (doi: 10.13140/RG.2.2.33459.30243). 766

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

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

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

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

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

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

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

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

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

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

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

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

HG134 [107] Henry Garrett,“Eulerian and Hamiltonian In Cancer’s Neutrosophic Recognition and 800
Neutrosophic SuperHyperGraph On Super Interactions By Hyper Extensions of Cycles”, 801
ResearchGate 2023,(doi: 10.13140/RG.2.2.34583.24485). 802

HG132 [108] Henry Garrett,“SuperHyperGirth Type-Results on extreme SuperHyperGirth theory and 803
(Neutrosophic) SuperHyperGraphs Toward Cancer’s extreme Recognition”, Preprints 804

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

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

HG131 [109] Henry Garrett,“Neutrosophic SuperHyperGraphs Warns Hyper Landmark of neutrosophic 806
SuperHyperGirth In Super Type-Versions of Cancer’s neutrosophic Recognition”, Preprints 807
2023, 2023010395 (doi: 10.20944/preprints202301.0395.v1). 808

HG130 [110] Henry Garrett,“The Constructions of (Neutrosophic) SuperHyperGraphs on the Cancer’s 809
Recognition in The Confrontation With Super Attacks In Hyper Situations By 810
Implementing (Neutrosophic) 1-Failed SuperHyperForcing in The Technical Approaches to 811
Neutralize SuperHyperViews”, ResearchGate 2023, (doi: 10.13140/RG.2.2.26240.51204). 812

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

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

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

HG127 [113] Henry Garrett,“SuperHyperGirth Approaches on the Super Challenges on the Cancer’s 820

Recognition In the Hyper Model of (Neutrosophic) SuperHyperGraph”, ResearchGate 821

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

HG126 [114] Henry Garrett,“Extreme SuperHyperClique as the Firm Scheme of Confrontation under 823
Cancer’s Recognition as the Model in The Setting of (Neutrosophic) SuperHyperGraphs”, 824
Preprints 2023, 2023010308 (doi: 10.20944/preprints202301.0308.v1). 825

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

10.20944/preprints202301.0282.v1). 829

HG124 [116] Henry Garrett,“Neutrosophic Version Of Separates Groups Of Cells In Cancer’s 830
Recognition On Neutrosophic SuperHyperGraphs”, Preprints 2023, 2023010267 (doi: 831
10.20944/preprints202301.0267.v1).). 832

HG123 [117] Henry Garrett, “The Shift Paradigm To Classify Separately The Cells and Affected 833
Cells Toward The Totality Under Cancer’s Recognition By New Multiple Definitions On 834
the Sets Polynomials Alongside Numbers In The (Neutrosophic) SuperHyperMatching 835

Theory Based on SuperHyperGraph and Neutrosophic SuperHyperGraph”, Preprints 836

2023, 2023010265 (doi: 10.20944/preprints202301.0265.v1). 837

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

HG121 [119] Henry Garrett, “Neutrosophic Failed SuperHyperStable as the Survivors on the 842
Cancer’s Neutrosophic Recognition Based on Uncertainty to All Modes in Neutrosophic 843

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

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

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

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

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

10.13140/RG.2.2.35061.65767). 850

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

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

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

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

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

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

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

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

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

HG116 [125] Henry Garrett,“Extreme Failed SuperHyperClique Decides the Failures on the Can- 863
cer’s Recognition in the Perfect Connections of Cancer’s Attacks By SuperHy- 864
perModels Named (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 865
10.13140/RG.2.2.32530.73922). 866

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

HG28 [127] Henry Garrett,“Perfect Directions Toward Idealism in Cancer’s Neutrosophic Recogni- 870

tion Forwarding Neutrosophic SuperHyperClique on Neutrosophic SuperHyperGraphs”, 871

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

HG29 [128] Henry Garrett,“Demonstrating Complete Connections in Every Embedded Regions 873
and Sub-Regions in the Terms of Cancer’s Recognition and (Neutrosophic) Su- 874

perHyperGraphs With (Neutrosophic) SuperHyperClique”, ResearchGate 2023, (doi: 875

10.13140/RG.2.2.23172.19849). 876

HG112 [129] Henry Garrett, “Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic) 877

SuperHyperModeling in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs”, 878

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

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

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

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

HG30 [131] Henry Garrett,“Different Neutrosophic Types of Neutrosophic Regions titled neut- 883
rosophic Failed SuperHyperStable in Cancer’s Neutrosophic Recognition modeled 884
in the Form of Neutrosophic SuperHyperGraphs”, ResearchGate 2023, (doi: 885
10.13140/RG.2.2.17385.36968). 886

HG107 [132] Henry Garrett, “Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction 887
To Use Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition And 888
Beyond”, Preprints 2023, 2023010044 889

HG106 [133] Henry Garrett, “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well- 890
SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010043 891

(doi: 10.20944/preprints202301.0043.v1). 892

HG31 [134] Henry Garrett, “Using the Tool As (Neutrosophic) Failed SuperHyperStable To SuperHy- 893
perModel Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs”, ResearchGate 894
2023, (doi: 10.13140/RG.2.2.28945.92007). 895

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

HG33 [136] Henry Garrett, “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well- 899
SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 900
10.13140/RG.2.2.35774.77123). 901

HG34 [137] Henry Garrett, “Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To 902
Use Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond”, 903

ResearchGate 2022, (doi: 10.13140/RG.2.2.36141.77287). 904

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

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

HG982 [140] Henry Garrett, “(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions Featuring 911
(Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, Preprints 2022, 2022120549 912
(doi: 10.20944/preprints202212.0549.v1). 913

HG98 [141] Henry Garrett, “(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions Featuring 914
(Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, ResearchGate 2022, (doi: 915

10.13140/RG.2.2.19380.94084). 916

HG972 [142] Henry Garrett, “(Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and 917
SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With 918
(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions And Related (Neutrosophic) 919

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

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

HG97 [143] Henry Garrett, “(Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and 921
SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With 922
(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions And Related (Neutrosophic) 923
SuperHyperClasses”, ResearchGate 2022, (doi: 10.13140/RG.2.2.14426.41923). 924

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

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

HG952 [146] Henry Garrett,“Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic Su- 931

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

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

HG95 [147] Henry Garrett, “Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic 934
SuperHyperGraphs And SuperHyperGraphs Alongside Applications in Cancer’s Treat- 935

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

HG942 [148] Henry Garrett, “SuperHyperDominating and SuperHyperResolving on Neutrosophic 937

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

HG94 [149] Henry Garrett, “SuperHyperDominating and SuperHyperResolving on Neutrosophic 940

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

HG37 [150] Henry Garrett, “Basic Neutrosophic Notions Concerning SuperHyperDominating and 943
Neutrosophic SuperHyperResolving in SuperHyperGraph”, ResearchGate 2022 (doi: 944
10.13140/RG.2.2.29173.86244). 945

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

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

HG147b [153] Henry Garrett, “SuperHyperDuality”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 951
odo.7637762). 952

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

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

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

(doi: 10.5281/zenodo.7758601). 958

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

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

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

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

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

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

HG138b [162] Henry Garrett, “Stable-Decompositions In SuperHyperGraphs”. Dr. Henry Garrett, 2023 969
(doi: 10.5281/zenodo.7738635). 970

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

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

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

(doi: 10.5281/zenodo.7730469). 976

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

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

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

odo.7709116). 982

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

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

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

(doi: 10.5281/zenodo.7701906). 988

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

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

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

10.5281/zenodo.7679410). 994

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

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

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

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

HG122b [178] Henry Garrett, “Coloring In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1001
10.5281/zenodo.7662810). 1002

HG121b [179] Henry Garrett, “Dimension In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1003
10.5281/zenodo.7659162). 1004

HG120b [180] Henry Garrett, “Cancer In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1005
odo.7653233). 1006

HG119b [181] Henry Garrett, “SuperHyperWheel”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1007
odo.7653204). 1008

HG118b [182] Henry Garrett, “SuperHyperMultipartite”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1009
odo.7653142). 1010

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

odo.7653117). 1012

HG116b [184] Henry Garrett, “SuperHyperStar”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1013
odo.7653089). 1014

HG115b [185] Henry Garrett, “SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1015
odo.7651687). 1016

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

odo.7651619). 1018

HG113b [187] Henry Garrett, “SuperHyperDomination”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1019
odo.7651439). 1020

HG112b [188] Henry Garrett, “SuperHyperDominating”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1021
odo.7650729). 1022

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

odo.7647868). 1024

HG110b [190] Henry Garrett, “SuperHyperTotal”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1025
odo.7647017). 1026

HG109b [191] Henry Garrett, “SuperHyperPerfect”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1027
odo.7644894). 1028

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

odo.7641880). 1030

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

HG107b [193] Henry Garrett, “Path SuperHyperColoring”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1031
odo.7632923). 1032

HG106b [194] Henry Garrett, “SuperHyperDensity”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1033
odo.7623459). 1034

HG105b [195] Henry Garrett, “Neutrosophic SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 1035
10.5281/zenodo.7606416). 1036

HG104b [196] Henry Garrett, “Extreme SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 1037
10.5281/zenodo.7606416). 1038

HG103b [197] Henry Garrett, “SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1039
odo.7606404). 1040

HG102b [198] Henry Garrett, “Neutrosophic SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 1041
10.5281/zenodo.7580018). 1042

HG101b [199] Henry Garrett, “Extreme SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1043
odo.7580018). 1044

HG100b [200] Henry Garrett, “Extreme SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1045
odo.7580018). 1046

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

odo.7579929). 1048

HG98b [202] Henry Garrett, “Neutrosophic SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 1049
10.5281/zenodo.7563170). 1050

HG97b [203] Henry Garrett, “Extreme SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1051
odo.7563164). 1052

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

odo.7563160). 1054

HG95b [205] Henry Garrett, “Extreme SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1055
odo.7563160). 1056

HG94b [206] Henry Garrett, “Overlook On SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 1057
10.5281/zenodo.7563160). 1058

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

10.5281/zenodo.7557063). 1060

HG92b [208] Henry Garrett, “Extreme SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 1061
10.5281/zenodo.7557009). 1062

HG91b [209] Henry Garrett, “Overlook On SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 1063
10.5281/zenodo.7539484). 1064

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

10.5281/zenodo.7523390). 1066

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

HG89b [211] Henry Garrett, “Extreme Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1067
10.5281/zenodo.7523390). 1068

HG88b [212] Henry Garrett, “Overlook On Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1069
10.5281/zenodo.7523390). 1070

HG87b [213] Henry Garrett, “Extreme SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1071
odo.7574952). 1072

HG86b [214] Henry Garrett, “Neutrosophic SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1073
10.5281/zenodo.7574992). 1074

HG85b [215] Henry Garrett, “Extreme SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1075
odo.7523357). 1076

HG84b [216] Henry Garrett, “Overlook On SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1077
10.5281/zenodo.7523357). 1078

HG83b [217] Henry Garrett, “Neutrosophic Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1079
10.5281/zenodo.7504782). 1080

HG82b [218] Henry Garrett, “Extreme Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1081
10.5281/zenodo.7504782). 1082

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

10.5281/zenodo.7504782). 1084

HG80b [220] Henry Garrett, “Neutrosophic SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1085
10.5281/zenodo.7499395). 1086

HG79b [221] Henry Garrett, “Extreme SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1087
odo.7499395). 1088

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

10.5281/zenodo.7499395). 1090

HG77b [223] Henry Garrett, “Neutrosophic Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1091
10.5281/zenodo.7497450). 1092

HG76b [224] Henry Garrett, “Extreme Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1093
10.5281/zenodo.7497450). 1094

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

10.5281/zenodo.7494862). 1096

HG74b [226] Henry Garrett, “Extreme SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1097
odo.7494862). 1098

HG73b [227] Henry Garrett, “Overlook On SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1099
10.5281/zenodo.7494862). 1100

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

10.5281/zenodo.7493845). 1102

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

HG71b [229] Henry Garrett, “Extreme SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 1103
10.5281/zenodo.7493845). 1104

HG70b [230] Henry Garrett, “Overlook On SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 1105
10.5281/zenodo.7493845). 1106

HG69b [231] Henry Garrett, “SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1107
odo.7539484). 1108

HG68b [232] Henry Garrett, “Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1109

odo.7523390). 1110

HG67b [233] Henry Garrett, “SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1111
odo.7523357). 1112

HG66b [234] Henry Garrett, “Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1113
odo.7504782). 1114

HG65b [235] Henry Garrett, “SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1115
odo.7499395). 1116

HG64b [236] Henry Garrett, “Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1117
odo.7497450). 1118

HG63b [237] Henry Garrett, “SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1119

odo.7494862). 1120

HG62b [238] Henry Garrett, “SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1121
odo.7493845). 1122

HG61b [239] Henry Garrett, “SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1123
odo.7480110). 1124

HG60b [240] Henry Garrett, “Neut. SuperHyperEdges”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1125
odo.7378758). 1126

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

HG44b [242] Henry Garrett, “Neutrosophic Duality”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1129

odo.6677173). 1130

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

Acknowledgements 1132

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

35
 CHAPTER 4 1140

Cancer In Extreme SuperHyperGraph 1141

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

Extreme Trace-Neighbor 1240

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

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

Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph By 1244
SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchGate 2023, 1245
(doi: 10.13140/RG.2.2.33275.80161). 1246
Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 1247
By SuperHyperJoin As Hyper Separations On Super Sorts”, ResearchGate 2023, (doi: 1248

10.13140/RG.2.2.11050.90569). 1249
Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of SuperHyperJoin 1250
In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 1251
10.13140/RG.2.2.17761.79206). 1252
Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 1253
By SuperHyperPerfect As Hyper Idealism On Super Vacancy”, ResearchGate 2023, (doi: 1254

10.13140/RG.2.2.19911.37285). 1255
Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect 1256
In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 1257
10.13140/RG.2.2.23266.81602). 1258
Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 1259
By SuperHyperTotal As Hyper Covering On Super Infections”, ResearchGate 2023, (doi: 1260

10.13140/RG.2.2.19360.87048). 1261
Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal 1262
In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 1263
10.13140/RG.2.2.32363.21286). 1264
Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 1265
By SuperHyperConnected As Hyper Group On Super Surge”, ResearchGate 2023, (doi: 1266

10.13140/RG.2.2.11758.69441). 1267
Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of SuperHyperConnected 1268
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 1269
10.13140/RG.2.2.31891.35367). 1270
Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 1271
By SuperHyperDominating As Hyper Closing On Super Messy”, ResearchGate 2023, (doi: 1272

10.13140/RG.2.2.21510.45125). 1273

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

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

New Ideas On Super Nebulous By Hyper 1278

Nebbish Of Trace-Neighbor In 1279

Recognition of Cancer With 1280

(Neutrosophic) SuperHyperGraph 1281

43
 CHAPTER 7 1282

ABSTRACT 1283

In this scientific research, (Different Neutrosophic Types of Neutrosophic SuperHyperTrace- 1284

Decomposition). Assume a Neutrosophic SuperHyperGraph (NSHG) S is a Trace-Decomposition 1285
pair S = (V, E). Consider a Neutrosophic SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and E 0 = 1286
{E1 , E2 , . . . , Ez }. Then either V 0 or E 0 is called Neutrosophic e-SuperHyperTrace-Decomposition 1287
if the following expression is called Neutrosophic e-SuperHyperTrace-Decomposition criteria 1288
holds 1289

∀N (Ea ) ∈ P : P is a SuperHyperPath and it has all SuperHyperVertices;

Neutrosophic re-SuperHyperTrace-Decomposition if the following expression is called Neutro- 1290

sophic e-SuperHyperTrace-Decomposition criteria holds 1291

∀N (Ea ) ∈ P : P is a SuperHyperPath and it has all SuperHyperVertices;

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

SuperHyperTrace-Decomposition if the following expression is called Neutrosophic v- 1293
SuperHyperTrace-Decomposition criteria holds 1294

∀N (Va ) ∈ P : P is a SuperHyperPath and it has all SuperHyperVertices;

Neutrosophic rv-SuperHyperTrace-Decomposition if the following expression is called Neutro- 1295

sophic v-SuperHyperTrace-Decomposition criteria holds 1296

∀N (Va ) ∈ P : P is a SuperHyperPath and it has all SuperHyperVertices;

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

SuperHyperTrace-Decomposition if it’s either of Neutrosophic e-SuperHyperTrace- 1298
Decomposition, Neutrosophic re-SuperHyperTrace-Decomposition, Neutrosophic v- 1299

SuperHyperTrace-Decomposition, and Neutrosophic rv-SuperHyperTrace-Decomposition. 1300

((Neutrosophic) SuperHyperTrace-Decomposition). Assume a Neutrosophic SuperHyper- 1301
Graph (NSHG) S is a pair S = (V, E). Consider a Neutrosophic SuperHyperEdge (NSHE) 1302
E = {V1 , V2 , . . . , Vs }. Then E is called an Extreme SuperHyperTrace-Decomposition if it’s 1303
either of Neutrosophic e-SuperHyperTrace-Decomposition, Neutrosophic re-SuperHyperTrace- 1304
Decomposition, Neutrosophic v-SuperHyperTrace-Decomposition, and Neutrosophic rv- 1305

SuperHyperTrace-Decomposition and C(N SHG) for an Extreme SuperHyperGraph N SHG : 1306

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

(V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Extreme 1307
cardinality of the Extreme SuperHyperEdges in the conseNeighborive Extreme sequence of 1308
Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the Extreme 1309
SuperHyperTrace-Decomposition; a Neutrosophic SuperHyperTrace-Decomposition if it’s 1310
either of Neutrosophic e-SuperHyperTrace-Decomposition, Neutrosophic re-SuperHyperTrace- 1311
Decomposition, Neutrosophic v-SuperHyperTrace-Decomposition, and Neutrosophic rv- 1312

SuperHyperTrace-Decomposition and C(N SHG) for a Neutrosophic SuperHyperGraph 1313

N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic SuperHy- 1314
perEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality conseNeighborive 1315
Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the 1316
Neutrosophic SuperHyperTrace-Decomposition; an Extreme SuperHyperTrace-Decomposition 1317
SuperHyperPolynomial if it’s either of Neutrosophic e-SuperHyperTrace-Decomposition, Neut- 1318

rosophic re-SuperHyperTrace-Decomposition, Neutrosophic v-SuperHyperTrace-Decomposition, 1319

and Neutrosophic rv-SuperHyperTrace-Decomposition and C(N SHG) for an Extreme Supe- 1320
rHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme 1321
coefficients defined as the Extreme number of the maximum Extreme cardinality of the 1322
Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme cardinality 1323
conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 1324

form the Extreme SuperHyperTrace-Decomposition; and the Extreme power is corresponded 1325
to its Extreme coefficient; a Neutrosophic SuperHyperTrace-Decomposition SuperHyper- 1326
Polynomial if it’s either of Neutrosophic e-SuperHyperTrace-Decomposition, Neutrosophic 1327
re-SuperHyperTrace-Decomposition, Neutrosophic v-SuperHyperTrace-Decomposition, and 1328
Neutrosophic rv-SuperHyperTrace-Decomposition and C(N SHG) for a Neutrosophic SuperHy- 1329
perGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains the Neutrosophic 1330

coefficients defined as the Neutrosophic number of the maximum Neutrosophic cardinality of the 1331
Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic cardin- 1332
ality conseNeighborive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices 1333
such that they form the Neutrosophic SuperHyperTrace-Decomposition; and the Neutrosophic 1334
power is corresponded to its Neutrosophic coefficient; an Extreme V-SuperHyperTrace- 1335
Decomposition if it’s either of Neutrosophic e-SuperHyperTrace-Decomposition, Neutrosophic 1336

re-SuperHyperTrace-Decomposition, Neutrosophic v-SuperHyperTrace-Decomposition, and 1337

Neutrosophic rv-SuperHyperTrace-Decomposition and C(N SHG) for an Extreme SuperHyper- 1338
Graph N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet 1339
S of high Extreme cardinality of the Extreme SuperHyperVertices in the conseNeighborive 1340
Extreme sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that 1341

they form the Extreme SuperHyperTrace-Decomposition; a Neutrosophic V-SuperHyperTrace- 1342

Decomposition if it’s either of Neutrosophic e-SuperHyperTrace-Decomposition, Neutrosophic re- 1343
SuperHyperTrace-Decomposition, Neutrosophic v-SuperHyperTrace-Decomposition, and Neutro- 1344
sophic rv-SuperHyperTrace-Decomposition and C(N SHG) for a Neutrosophic SuperHyperGraph 1345
N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVer- 1346
tices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality conseNeighborive 1347

Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the 1348
Neutrosophic SuperHyperTrace-Decomposition; an Extreme V-SuperHyperTrace-Decomposition 1349
SuperHyperPolynomial if it’s either of Neutrosophic e-SuperHyperTrace-Decomposition, Neut- 1350
rosophic re-SuperHyperTrace-Decomposition, Neutrosophic v-SuperHyperTrace-Decomposition, 1351
and Neutrosophic rv-SuperHyperTrace-Decomposition and C(N SHG) for an Extreme Supe- 1352

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

rHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme 1353
coefficients defined as the Extreme number of the maximum Extreme cardinality of the 1354
Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality 1355
conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 1356
form the Extreme SuperHyperTrace-Decomposition; and the Extreme power is corresponded 1357
to its Extreme coefficient; a Neutrosophic SuperHyperTrace-Decomposition SuperHyper- 1358

Polynomial if it’s either of Neutrosophic e-SuperHyperTrace-Decomposition, Neutrosophic 1359

re-SuperHyperTrace-Decomposition, Neutrosophic v-SuperHyperTrace-Decomposition, and 1360
Neutrosophic rv-SuperHyperTrace-Decomposition and C(N SHG) for a Neutrosophic SuperHy- 1361
perGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains the Neutrosophic 1362
coefficients defined as the Neutrosophic number of the maximum Neutrosophic cardinality of the 1363
Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic car- 1364

dinality conseNeighborive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices 1365

such that they form the Neutrosophic SuperHyperTrace-Decomposition; and the Neutrosophic 1366
power is corresponded to its Neutrosophic coefficient. In this scientific research, new setting is 1367
introduced for new SuperHyperNotions, namely, a SuperHyperTrace-Decomposition and Neut- 1368
rosophic SuperHyperTrace-Decomposition. Two different types of SuperHyperDefinitions are 1369
debut for them but the research goes further and the SuperHyperNotion, SuperHyperUniform, 1370

and SuperHyperClass based on that are well-defined and well-reviewed. The literature review is 1371
implemented in the whole of this research. For shining the elegancy and the significancy of this 1372
research, the comparison between this SuperHyperNotion with other SuperHyperNotions and 1373
fundamental SuperHyperNumbers are featured. The definitions are followed by the examples 1374
and the instances thus the clarifications are driven with different tools. The applications are 1375
figured out to make sense about the theoretical aspect of this ongoing research. The “Cancer’s 1376

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

tion”. Thus these complex and dense SuperHyperModels open up some avenues to research 1383
on theoretical segments and “Cancer’s Recognition”. Some avenues are posed to pursue this 1384
research. It’s also officially collected in the form of some questions and some problems. Assume 1385
a SuperHyperGraph. Assume a SuperHyperGraph. Then δ−SuperHyperTrace-Decomposition 1386
is a maximal of SuperHyperVertices with a maximum cardinality such that either of the 1387

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

s ∈ S : there are |S ∩ N (s)| > |S ∩ (V \ N (s))| + δ; and |S ∩ N (s)| < |S ∩ (V \ N (s))| + δ. The 1389
first Expression, holds if S is an δ−SuperHyperOffensive. And the second Expression, holds 1390
if S is an δ−SuperHyperDefensive; a Neutrosophic δ−SuperHyperTrace-Decomposition is a 1391
maximal Neutrosophic of SuperHyperVertices with maximum Neutrosophic cardinality 1392
such that either of the following expressions hold for the Neutrosophic cardinalities of Super- 1393

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

and |S ∩ N (s)|N eutrosophic < |S ∩ (V \ N (s))|N eutrosophic + δ. The first Expression, holds 1395
if S is a Neutrosophic δ−SuperHyperOffensive. And the second Expression, holds if S is a 1396
Neutrosophic δ−SuperHyperDefensive It’s useful to define a “Neutrosophic” version of a 1397
SuperHyperTrace-Decomposition . Since there’s more ways to get type-results to make a 1398

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

SuperHyperTrace-Decomposition more understandable. For the sake of having Neutrosophic 1399

SuperHyperTrace-Decomposition, there’s a need to “redefine” the notion of a “SuperHyperTrace- 1400
Decomposition ”. The SuperHyperVertices and the SuperHyperEdges are assigned by the labels 1401
from the letters of the alphabets. In this procedure, there’s the usage of the position of labels to 1402
assign to the values. Assume a SuperHyperTrace-Decomposition . It’s redefined a Neutrosophic 1403
SuperHyperTrace-Decomposition if the mentioned Table holds, concerning, “The Values of 1404

Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges Belong to The Neutrosophic 1405
SuperHyperGraph” with the key points, “The Values of The Vertices & The Number of Position 1406
in Alphabet”, “The Values of The SuperVertices&The maximum Values of Its Vertices”, “The Val- 1407
ues of The Edges&The maximum Values of Its Vertices”, “The Values of The HyperEdges&The 1408
maximum Values of Its Vertices”, “The Values of The SuperHyperEdges&The maximum Values 1409
of Its Endpoints”. To get structural examples and instances, I’m going to introduce the next 1410

SuperHyperClass of SuperHyperGraph based on a SuperHyperTrace-Decomposition . It’s 1411

the main. It’ll be disciplinary to have the foundation of previous definition in the kind of 1412
SuperHyperClass. If there’s a need to have all SuperHyperTrace-Decomposition until the 1413
SuperHyperTrace-Decomposition, then it’s officially called a “SuperHyperTrace-Decomposition” 1414
but otherwise, it isn’t a SuperHyperTrace-Decomposition . There are some instances about the 1415
clarifications for the main definition titled a “SuperHyperTrace-Decomposition ”. These two 1416

examples get more scrutiny and discernment since there are characterized in the disciplinary 1417
ways of the SuperHyperClass based on a SuperHyperTrace-Decomposition . For the sake of 1418
having a Neutrosophic SuperHyperTrace-Decomposition, there’s a need to “redefine” the notion 1419
of a “Neutrosophic SuperHyperTrace-Decomposition” and a “Neutrosophic SuperHyperTrace- 1420
Decomposition ”. The SuperHyperVertices and the SuperHyperEdges are assigned by the 1421
labels from the letters of the alphabets. In this procedure, there’s the usage of the position 1422

of labels to assign to the values. Assume a Neutrosophic SuperHyperGraph. It’s redefined 1423
“Neutrosophic SuperHyperGraph” if the intended Table holds. And a SuperHyperTrace- 1424
Decomposition are redefined to a “Neutrosophic SuperHyperTrace-Decomposition” if the 1425
intended Table holds. It’s useful to define “Neutrosophic” version of SuperHyperClasses. Since 1426
there’s more ways to get Neutrosophic type-results to make a Neutrosophic SuperHyperTrace- 1427
Decomposition more understandable. Assume a Neutrosophic SuperHyperGraph. There are 1428

some Neutrosophic SuperHyperClasses if the intended Table holds. Thus SuperHyperPath, 1429
SuperHyperTrace-Decomposition, SuperHyperStar, SuperHyperBipartite, SuperHyperMul- 1430
tiPartite, and SuperHyperWheel, are “Neutrosophic SuperHyperPath”, “Neutrosophic 1431
SuperHyperTrace-Decomposition”, “Neutrosophic SuperHyperStar”, “Neutrosophic SuperHy- 1432
perBipartite”, “Neutrosophic SuperHyperMultiPartite”, and “Neutrosophic SuperHyperWheel” 1433

if the intended Table holds. A SuperHyperGraph has a “Neutrosophic SuperHyperTrace- 1434

Decomposition” where it’s the strongest [the maximum Neutrosophic value from all the 1435
SuperHyperTrace-Decomposition amid the maximum value amid all SuperHyperVertices 1436
from a SuperHyperTrace-Decomposition .] SuperHyperTrace-Decomposition . A graph is a 1437
SuperHyperUniform if it’s a SuperHyperGraph and the number of elements of SuperHyperEdges 1438
are the same. Assume a Neutrosophic SuperHyperGraph. There are some SuperHyperClasses 1439

as follows. It’s SuperHyperPath if it’s only one SuperVertex as intersection amid two given 1440
SuperHyperEdges with two exceptions; it’s SuperHyperTrace-Decomposition if it’s only one 1441
SuperVertex as intersection amid two given SuperHyperEdges; it’s SuperHyperStar it’s only one 1442
SuperVertex as intersection amid all SuperHyperEdges; it’s SuperHyperBipartite it’s only one 1443
SuperVertex as intersection amid two given SuperHyperEdges and these SuperVertices, forming 1444

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

two separate sets, has no SuperHyperEdge in common; it’s SuperHyperMultiPartite it’s only 1445
one SuperVertex as intersection amid two given SuperHyperEdges and these SuperVertices, 1446
forming multi separate sets, has no SuperHyperEdge in common; it’s a SuperHyperWheel if it’s 1447
only one SuperVertex as intersection amid two given SuperHyperEdges and one SuperVertex 1448
has one SuperHyperEdge with any common SuperVertex. The SuperHyperModel proposes 1449
the specific designs and the specific architectures. The SuperHyperModel is officially called 1450

“SuperHyperGraph” and “Neutrosophic SuperHyperGraph”. In this SuperHyperModel, The 1451

“specific” cells and “specific group” of cells are SuperHyperModeled as “SuperHyperVertices” 1452
and the common and intended properties between “specific” cells and “specific group” of cells 1453
are SuperHyperModeled as “SuperHyperEdges”. Sometimes, it’s useful to have some degrees of 1454
determinacy, indeterminacy, and neutrality to have more precise SuperHyperModel which in this 1455
case the SuperHyperModel is called “Neutrosophic”. In the future research, the foundation will 1456

be based on the “Cancer’s Recognition” and the results and the definitions will be introduced 1457
in redeemed ways. The recognition of the cancer in the long-term function. The specific region 1458
has been assigned by the model [it’s called SuperHyperGraph] and the long cycle of the move 1459
from the cancer is identified by this research. Sometimes the move of the cancer hasn’t be easily 1460
identified since there are some determinacy, indeterminacy and neutrality about the moves 1461
and the effects of the cancer on that region; this event leads us to choose another model [it’s 1462

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

and what’s done. There are some specific models, which are well-known and they’ve got the 1464
names, and some SuperHyperGeneral SuperHyperModels. The moves and the traces of the 1465
cancer on the complex tracks and between complicated groups of cells could be fantasized 1466
by a Neutrosophic SuperHyperPath(-/SuperHyperTrace-Decomposition, SuperHyperStar, 1467
SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find either 1468

the longest SuperHyperTrace-Decomposition or the strongest SuperHyperTrace-Decomposition 1469

in those Neutrosophic SuperHyperModels. For the longest SuperHyperTrace-Decomposition, 1470
called SuperHyperTrace-Decomposition, and the strongest SuperHyperTrace-Decomposition, 1471
called Neutrosophic SuperHyperTrace-Decomposition, some general results are introduced. 1472
Beyond that in SuperHyperStar, all possible SuperHyperPaths have only two SuperHyperEdges 1473
but it’s not enough since it’s essential to have at least three SuperHyperEdges to form any 1474

style of a SuperHyperTrace-Decomposition. There isn’t any formation of any SuperHyperTrace- 1475

Decomposition but literarily, it’s the deformation of any SuperHyperTrace-Decomposition. It, 1476
literarily, deforms and it doesn’t form. A basic familiarity with Neutrosophic SuperHyperTrace- 1477
Decomposition theory, SuperHyperGraphs, and Neutrosophic SuperHyperGraphs theory are 1478
proposed. 1479

Keywords: Neutrosophic SuperHyperGraph, SuperHyperTrace-Decomposition, Cancer’s 1480

Neutrosophic Recognition 1481

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

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

Applied Notions Under The Scrutiny Of 1484

The Motivation Of This Scientific 1485

Research 1486

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

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

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

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

disease. The SuperHyperGraph and Extreme SuperHyperGraph are the SuperHyperModels on 1509
the “Cancer’s Recognition” and both bases are the background of this research. Sometimes the 1510
cancer has been happened on the region, full of cells, groups of cells and embedded styles. In this 1511
segment, the SuperHyperModel proposes some SuperHyperNotions based on the connectivities 1512
of the moves of the cancer in the forms of alliances’ styles with the formation of the design 1513
and the architecture are formally called “ SuperHyperTrace-Decomposition” in the themes 1514

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

51
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 1516
in the long-term function. The specific region has been assigned by the model [it’s called 1517
SuperHyperGraph] and the long cycle of the move from the cancer is identified by this research. 1518
Sometimes the move of the cancer hasn’t be easily identified since there are some determinacy, 1519
indeterminacy and neutrality about the moves and the effects of the cancer on that region; 1520
this event leads us to choose another model [it’s said to be Extreme SuperHyperGraph] to 1521

have convenient perception on what’s happened and what’s done. There are some specific 1522
models, which are well-known and they’ve got the names, and some general models. The 1523
moves and the traces of the cancer on the complex tracks and between complicated groups of 1524
cells could be fantasized by an Extreme SuperHyperPath (-/SuperHyperTrace-Decomposition, 1525
SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim 1526
is to find either the optimal SuperHyperTrace-Decomposition or the Extreme SuperHyperTrace- 1527

Decomposition in those Extreme SuperHyperModels. Some general results are introduced. 1528
Beyond that in SuperHyperStar, all possible Extreme SuperHyperPath s have only two 1529
SuperHyperEdges but it’s not enough since it’s essential to have at least three SuperHyperEdges 1530
to form any style of a SuperHyperTrace-Decomposition. There isn’t any formation of any 1531
SuperHyperTrace-Decomposition but literarily, it’s the deformation of any SuperHyperTrace- 1532
Decomposition. It, literarily, deforms and it doesn’t form. 1533

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

amount of SuperHyperTrace-Decomposition” of either individual of cells or the groups of cells 1535

based on the fixed cell or the fixed group of cells, extensively, the “amount of SuperHyperTrace- 1536
Decomposition” based on the fixed groups of cells or the fixed groups of group of cells? 1537

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

It’s motivation to find notions to use in this dense model is titled “SuperHyperGraphs”. Thus 1540
it motivates us to define different types of “ SuperHyperTrace-Decomposition” and “Extreme 1541

SuperHyperTrace-Decomposition” on “SuperHyperGraph” and “Extreme SuperHyperGraph”. 1542

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

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

SuperHyperTrace-Decomposition and Extreme SuperHyperTrace-Decomposition, are figured out 1554

in sections “ SuperHyperTrace-Decomposition” and “Extreme SuperHyperTrace-Decomposition”. 1555
In the sense of tackling on getting results and in Trace-Decomposition to make sense about 1556
continuing the research, the ideas of SuperHyperUniform and Extreme SuperHyperUniform are 1557
introduced and as their consequences, corresponded SuperHyperClasses are figured out to debut 1558
what’s done in this section, titled “Results on SuperHyperClasses” and “Results on Extreme 1559

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

Henry Garrett · 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 1561
Extreme SuperHyperGraph, in the sections “Results on SuperHyperClasses” and “Results on 1562
Extreme SuperHyperClasses”. The starter research about the general SuperHyperRelations and 1563
as concluding and closing section of theoretical research are contained in the section “General 1564
Results”. Some general SuperHyperRelations are fundamental and they are well-known as 1565
fundamental SuperHyperNotions as elicited and discussed in the sections, “General Results”, “ 1566

SuperHyperTrace-Decomposition”, “Extreme SuperHyperTrace-Decomposition”, “Results on 1567

SuperHyperClasses” and “Results on Extreme SuperHyperClasses”. There are curious questions 1568
about what’s done about the SuperHyperNotions to make sense about excellency of this research 1569
and going to figure out the word “best” as the description and adjective for this research as 1570
presented in section, “ SuperHyperTrace-Decomposition”. The keyword of this research debut in 1571
the section “Applications in Cancer’s Recognition” with two cases and subsections “Case 1: The 1572

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

“Conclusion and Closing Remarks”. 1579

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

Extreme Preliminaries Of This Scientific 1581

Research On the Redeemed Ways 1582

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

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

terization of the Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG38],Definition 2.7,p.3), 1586
[t-norm](Ref.[HG38], Definition 2.7, p.3), and [Characterization of the Neutrosophic SuperHy- 1587
perGraph (NSHG)](Ref.[HG38],Definition 2.7,p.3), [Neutrosophic Strength of the Neutrosophic 1588
SuperHyperPaths] (Ref.[HG38],Definition 5.3,p.7), and [Different Neutrosophic Types of Neut- 1589
rosophic SuperHyperEdges (NSHE)] (Ref.[HG38],Definition 5.4,p.7). Also, the new ideas and 1590

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

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

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

Let X be a Trace-Decomposition 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 [. 1594

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

Let X be a Trace-Decomposition 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}.

55
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). 1595
Assume V 0 is a given set. a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E), 1596
where 1597

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

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

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

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

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

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

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

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

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

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

falsity-membership the Neutrosophic SuperHyperVertex (NSHV) Vi to the Neutrosophic 1611
SuperHyperVertex (NSHV) V. TV0 (Ei0 ), TV0 (Ei0 ), and TV0 (Ei0 ) denote the degree of truth- 1612
membership, the degree of indeterminacy-membership and the degree of falsity-membership of 1613
the Neutrosophic SuperHyperEdge (NSHE) Ei0 to the Neutrosophic SuperHyperEdge (NSHE) 1614
E. Thus, the ii0 th element of the incidence matrix of Neutrosophic SuperHyperGraph (NSHG) 1615

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

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

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

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

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

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

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

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

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

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

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

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

(i) 1 ⊗ x = x; 1635

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

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

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

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

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

where 1641

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

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

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

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

1, 2, . . . , n0 ); 1646

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

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

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

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

Here the Neutrosophic SuperHyperEdges (NSHE) Ej 0 and the Neutrosophic SuperHyperVertices 1651
(NSHV) Vj are single valued Neutrosophic sets. TV 0 (Vi ), IV 0 (Vi ), and FV 0 (Vi ) denote the 1652
degree of truth-membership, the degree of indeterminacy-membership and the degree of 1653
falsity-membership the Neutrosophic SuperHyperVertex (NSHV) Vi to the Neutrosophic 1654
SuperHyperVertex (NSHV) V. TV0 (Ei0 ), TV0 (Ei0 ), and TV0 (Ei0 ) denote the degree of truth- 1655

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

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

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

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

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

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

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

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

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

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

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

makes the patterns and regularities. 1675

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

of elements of SuperHyperEdges are the same. 1677

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

Definition 9.0.13. Assume a Neutrosophic SuperHyperGraph. There are some SuperHyper- 1680
Classes as follows. 1681

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

two given SuperHyperEdges with two exceptions; 1683

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

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

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

in common; 1689

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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 1713

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Definition 9.0.18. (Different Neutrosophic Types of Neutrosophic SuperHyperTrace- 1734

Decomposition). 1735

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider a Neutro- 1736
sophic SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and E 0 = {E1 , E2 , . . . , Ez }. Then either V 0 or E 0 1737
is called 1738

(i) Neutrosophic e-SuperHyperTrace-Decomposition if the following expression is 1739

called Neutrosophic e-SuperHyperTrace-Decomposition criteria holds 1740

∀N (Ea ) ∈ P : P is a SuperHyperPath and it has all SuperHyperVertices;

(ii) Neutrosophic re-SuperHyperTrace-Decomposition if the following expression is 1741

called Neutrosophic re-SuperHyperTrace-Decomposition criteria holds 1742

∀N (Ea ) ∈ P : P is a SuperHyperPath and it has all SuperHyperVertices;

1743

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

(iii) Neutrosophic v-SuperHyperTrace-Decomposition if the following expression is 1745

called Neutrosophic v-SuperHyperTrace-Decomposition criteria holds 1746

∀N (Va ) ∈ P : P is a SuperHyperPath and it has all SuperHyperVertices;

(iv) Neutrosophic rv-SuperHyperTrace-Decomposition f the following expression is 1747

called Neutrosophic v-SuperHyperTrace-Decomposition criteria holds 1748

∀N (Va ) ∈ P : P is a SuperHyperPath and it has all SuperHyperVertices;

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

(v) Neutrosophic SuperHyperTrace-Decomposition if it’s either of Neutrosophic 1750

e-SuperHyperTrace-Decomposition, Neutrosophic re-SuperHyperTrace-Decomposition, 1751
Neutrosophic v-SuperHyperTrace-Decomposition, and Neutrosophic rv-SuperHyperTrace- 1752
Decomposition. 1753

Definition 9.0.19. ((Neutrosophic) SuperHyperTrace-Decomposition). 1754

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

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

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

(i) an Extreme SuperHyperTrace-Decomposition if it’s either of Neutrosophic 1757

e-SuperHyperTrace-Decomposition, Neutrosophic re-SuperHyperTrace-Decomposition, 1758
Neutrosophic v-SuperHyperTrace-Decomposition, and Neutrosophic rv-SuperHyperTrace- 1759
Decomposition and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is 1760
the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Extreme 1761
cardinality of the Extreme SuperHyperEdges in the conseNeighborive Extreme sequence 1762

of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 1763
Extreme SuperHyperTrace-Decomposition; 1764

(ii) a Neutrosophic SuperHyperTrace-Decomposition if it’s either of Neutrosophic 1765

e-SuperHyperTrace-Decomposition, Neutrosophic re-SuperHyperTrace-Decomposition, 1766

Neutrosophic v-SuperHyperTrace-Decomposition, and Neutrosophic rv-SuperHyperTrace- 1767
Decomposition and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 1768
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of 1769
a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality conseNeighborive 1770
Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they 1771

form the Neutrosophic SuperHyperTrace-Decomposition; 1772

(iii) an Extreme SuperHyperTrace-Decomposition SuperHyperPolynomial if 1773

it’s either of Neutrosophic e-SuperHyperTrace-Decomposition, Neutrosophic re- 1774

SuperHyperTrace-Decomposition, Neutrosophic v-SuperHyperTrace-Decomposition, 1775

and Neutrosophic rv-SuperHyperTrace-Decomposition and C(N SHG) for an Extreme 1776
SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the 1777
Extreme coefficients defined as the Extreme number of the maximum Extreme cardinality 1778
of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme 1779
cardinality conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVertices 1780

such that they form the Extreme SuperHyperTrace-Decomposition; and the Extreme 1781
power is corresponded to its Extreme coefficient; 1782

(iv) a Neutrosophic SuperHyperTrace-Decomposition SuperHyperPolynomial 1783

if it’s either of Neutrosophic e-SuperHyperTrace-Decomposition, Neutrosophic re- 1784

SuperHyperTrace-Decomposition, Neutrosophic v-SuperHyperTrace-Decomposition, 1785
and Neutrosophic rv-SuperHyperTrace-Decomposition and C(N SHG) for a Neutro- 1786
sophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 1787
contains the Neutrosophic coefficients defined as the Neutrosophic number of the max- 1788
imum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic 1789

SuperHyperSet S of high Neutrosophic cardinality conseNeighborive Neutrosophic Super- 1790

HyperEdges and Neutrosophic SuperHyperVertices such that they form the Neutrosophic 1791
SuperHyperTrace-Decomposition; and the Neutrosophic power is corresponded to its 1792
Neutrosophic coefficient; 1793

(v) an Extreme V-SuperHyperTrace-Decomposition if it’s either of Neutrosophic 1794

e-SuperHyperTrace-Decomposition, Neutrosophic re-SuperHyperTrace-Decomposition, 1795
Neutrosophic v-SuperHyperTrace-Decomposition, and Neutrosophic rv-SuperHyperTrace- 1796
Decomposition and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is 1797
the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Extreme 1798

cardinality of the Extreme SuperHyperVertices in the conseNeighborive Extreme sequence 1799

Henry Garrett · 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 Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 1800
Extreme SuperHyperTrace-Decomposition; 1801

(vi) a Neutrosophic V-SuperHyperTrace-Decomposition if it’s either of Neutrosophic 1802

e-SuperHyperTrace-Decomposition, Neutrosophic re-SuperHyperTrace-Decomposition, 1803
Neutrosophic v-SuperHyperTrace-Decomposition, and Neutrosophic rv-SuperHyperTrace- 1804
Decomposition and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 1805

is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of 1806

a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality conseNeighborive 1807
Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they 1808
form the Neutrosophic SuperHyperTrace-Decomposition; 1809

(vii) an Extreme V-SuperHyperTrace-Decomposition SuperHyperPolynomial 1810

if it’s either of Neutrosophic e-SuperHyperTrace-Decomposition, Neutrosophic re- 1811

SuperHyperTrace-Decomposition, Neutrosophic v-SuperHyperTrace-Decomposition, 1812

and Neutrosophic rv-SuperHyperTrace-Decomposition and C(N SHG) for an Extreme 1813
SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the 1814
Extreme coefficients defined as the Extreme number of the maximum Extreme cardinality 1815
of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme 1816
cardinality conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVertices 1817

such that they form the Extreme SuperHyperTrace-Decomposition; and the Extreme 1818
power is corresponded to its Extreme coefficient; 1819

(viii) a Neutrosophic SuperHyperTrace-Decomposition SuperHyperPolynomial 1820

if it’s either of Neutrosophic e-SuperHyperTrace-Decomposition, Neutrosophic re- 1821
SuperHyperTrace-Decomposition, Neutrosophic v-SuperHyperTrace-Decomposition, 1822
and Neutrosophic rv-SuperHyperTrace-Decomposition and C(N SHG) for a Neutrosophic 1823

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

the Neutrosophic coefficients defined as the Neutrosophic number of the maximum 1825
Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic 1826
SuperHyperSet S of high Neutrosophic cardinality conseNeighborive Neutrosophic Super- 1827
HyperEdges and Neutrosophic SuperHyperVertices such that they form the Neutrosophic 1828
SuperHyperTrace-Decomposition; and the Neutrosophic power is corresponded to its 1829

Neutrosophic coefficient. 1830

Definition 9.0.20. ((Extreme/Neutrosophic)δ−SuperHyperTrace-Decomposition). 1831

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

(i) an δ−SuperHyperTrace-Decomposition is a Neutrosophic kind of Neutrosophic 1833

SuperHyperTrace-Decomposition such that either of the following expressions hold for the 1834

Neutrosophic cardinalities of SuperHyperNeighbors of s ∈ S : 1835

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

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

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

(ii) a Neutrosophic δ−SuperHyperTrace-Decomposition is a Neutrosophic kind of 1838

Neutrosophic SuperHyperTrace-Decomposition such that either of the following Neut- 1839
rosophic expressions hold for the Neutrosophic cardinalities of SuperHyperNeighbors of 1840
s∈S: 1841

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

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

For the sake of having a Neutrosophic SuperHyperTrace-Decomposition, there’s a need to 1844

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

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

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

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

(V, E). There are some Neutrosophic SuperHyperClasses if the Table (29.2) holds. 1853

Thus Neutrosophic SuperHyperPath , SuperHyperTrace-Decomposition, SuperHyperStar, 1854

SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, are Neutrosophic 1855
SuperHyperPath, Neutrosophic SuperHyperCycle, Neutrosophic SuperHyperStar, 1856
Neutrosophic SuperHyperBipartite, Neutrosophic SuperHyperMultiPartite, and 1857
Neutrosophic SuperHyperWheel if the Table (29.2) holds. 1858

It’s useful to define a “Neutrosophic” version of a Neutrosophic SuperHyperTrace- 1859

Decomposition. Since there’s more ways to get type-results to make a Neutrosophic 1860
SuperHyperTrace-Decomposition more Neutrosophicly understandable. 1861
For the sake of having a Neutrosophic SuperHyperTrace-Decomposition, there’s a need to 1862
“redefine” the Neutrosophic notion of “Neutrosophic SuperHyperTrace-Decomposition”. The 1863
SuperHyperVertices and the SuperHyperEdges are assigned by the labels from the letters of the 1864
alphabets. In this procedure, there’s the usage of the position of labels to assign to the values. 1865

1866

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

136DEF1 Definition 9.0.23. Assume a SuperHyperTrace-Decomposition. It’s redefined a Neutrosophic 1867

SuperHyperTrace-Decomposition if the Table (29.3) holds. 1868

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

Extreme 1870

SuperHyperTrace-Decomposition But As 1871

The Extensions Excerpt From Dense And 1872

Super Forms 1873

Definition 10.0.1. (Extreme event). 1874

Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) 1875
is a probability Trace-Decomposition. Any Extreme k-subset of A of V is called Extreme 1876
k-event and if k = 2, then Extreme subset of A of V is called Extreme event. The following 1877
expression is called Extreme probability of A. 1878

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

Definition 10.0.2. (Extreme Independent). 1879

Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) 1880
is a probability Trace-Decomposition. s Extreme k-events Ai , i ∈ I is called Extreme s- 1881

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

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 1883
following expression is called Extreme independent criteria 1884

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

Definition 10.0.3. (Extreme Variable). 1885

Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) 1886
is a probability Trace-Decomposition. Any k-function Trace-Decomposition like E is called 1887

Extreme k-Variable. If k = 2, then any 2-function Trace-Decomposition like E is called 1888

Extreme Variable. 1889

The notion of independent on Extreme Variable is likewise. 1890

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

Definition 10.0.4. (Extreme Expectation). 1891

Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) is 1892
a probability Trace-Decomposition. an Extreme k-Variable E has a number is called Extreme 1893
Expectation if the following expression is called Extreme Expectation criteria 1894
X
Ex(E) = E(α)P (α).
α∈V

Definition 10.0.5. (Extreme Crossing). 1895

Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) is 1896
a probability Trace-Decomposition. an Extreme number is called Extreme Crossing if the 1897
following expression is called Extreme Crossing criteria 1898

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

Consider S = (V, E) is a probability Trace-Decomposition. Let m and n propose special 1900

Trace-Decomposition. Then with m ≥ 4n, 1901

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 Trace-Decomposition 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: 1902

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

Theorem 10.0.7. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). 1904
Consider S = (V, E) is a probability Trace-Decomposition. Let P be a SuperHyperSet of n points 1905
in the plane, and let l be the Extreme number √of SuperHyperLines in the plane passing through 1906

at least k + 1 of these points, where 1 ≤ k ≤ 2 2n. Then l < 32n2 /k 3 . 1907

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

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

Henry Garrett · 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). 1914
Consider S = (V, E) is a probability Trace-Decomposition. Let P be a SuperHyperSet of n points 1915
in the plane, and let k be the number of pairs of points of P at unit SuperHyperDistance. Then 1916
k < 5n4/3 . 1917

Proof. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 1918
S = (V, E) is a probability Trace-Decomposition. Draw a SuperHyperUnit SuperHyperCircle 1919
around each SuperHyperPoint of P. Let ni be the
P Extreme number of these SuperHyperCircles 1920
i = 0n−1 ni = n and k = 12 i = 0n−1 ini .
P
passing through exactly i points of P. Then 1921

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

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

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 1925

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

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

Proposition 10.0.9. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). 1931
Consider S = (V, E) is a probability Trace-Decomposition. Let X be a nonnegative Extreme 1932
Variable and t a positive real number. Then 1933

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

Corollary 10.0.10. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). 1935
Consider S = (V, E) is a probability Trace-Decomposition. Let Xn be a nonnegative integer- 1936

valued variable in a prob- ability Trace-Decomposition (Vn , En ), n ≥ 1. If E(Xn ) → 0 as n → ∞, 1937

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

Proof.  1939

Theorem 10.0.11. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). 1940
Consider S = (V, E) is a probability Trace-Decomposition. A special SuperHyperGraph in Gn,p 1941

almost surely has stability number at most d2p−1 log ne. 1942

Henry Garrett · 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 1943
S = (V, E) is a probability Trace-Decomposition. A special SuperHyperGraph in Gn,p is 1944
up. Let G ∈ Gn,p and let S be a given SuperHyperSet of k + 1 SuperHyperVertices of G, 1945
where k ∈ N. The probability that S is a stable SuperHyperSet of G is (1 − p)(k+1)choose2 , this 1946
being the probability that none of the (k + 1)choose2 pairs of SuperHyperVertices of S is a 1947
SuperHyperEdge of the Extreme SuperHyperGraph G. 1948

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

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 1951

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

and so, by those, 1952

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

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

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

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 1955

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

Definition 10.0.12. (Extreme Variance). 1959

Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) is 1960
a probability Trace-Decomposition. an Extreme k-Variable E has a number is called Extreme 1961

Variance if the following expression is called Extreme Variance criteria 1962

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

Theorem 10.0.13. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). 1963
Consider S = (V, E) is a probability Trace-Decomposition. Let X be an Extreme Variable and 1964
let t be a positive real number. Then 1965

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 1966
S = (V, E) is a probability Trace-Decomposition. Let X be an Extreme Variable and let t be a 1967
positive real number. Then 1968

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

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

Consider S = (V, E) is a probability Trace-Decomposition. Let Xn be an Extreme Variable in a 1971

probability Trace-Decomposition (Vn , En ), n ≥ 1. If Ex(Xn ) 6= 0 and V (Xn ) << E 2 (Xn ), then 1972

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

Proof. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 1973
S = (V, E) is a probability Trace-Decomposition. Set X := Xn and t := |Ex(Xn )| in 1974
Chebyshev’s Inequality, and observe that E(Xn = 0) ≤ E(|Xn − Ex(Xn )| ≥ |Ex(Xn )|) because 1975

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

Theorem 10.0.15. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). 1977
Consider S = (V, E) is a probability Trace-Decomposition. Let G ∈ Gn,1/2 . For 0 ≤ k ≤ n, set 1978

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

Proof. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 1981
S = (V, E) is a probability Trace-Decomposition. As in the proof of related Theorem, the result 1982
is straightforward.  1983

Corollary 10.0.16. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). 1984
Consider S = (V, E) is a probability Trace-Decomposition. Let G ∈ Gn,1/2 and let f and k ∗ be 1985
as defined in previous Theorem. Then either: 1986

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

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

Proof. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 1989
S = (V, E) is a probability Trace-Decomposition. The latter is straightforward.  1990

Definition 10.0.17. (Extreme Threshold). 1991

Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) is 1992
a probability Trace-Decomposition. Let P be a monotone property of SuperHyperGraphs (one 1993
which is preserved when SuperHyperEdges are added). Then a Extreme Threshold for P is 1994
a function f (n) such that: 1995

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

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

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

Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) is 1999
a probability Trace-Decomposition. Let F be a fixed Extreme SuperHyperGraph. Then 2000
there is a threshold function for the property of containing a copy of F as an Extreme 2001
SubSuperHyperGraph is called Extreme Balanced. 2002

Theorem 10.0.19. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). 2003
Consider S = (V, E) is a probability Trace-Decomposition. Let F be a nonempty balanced 2004
Extreme SubSuperHyperGraph with k SuperHyperVertices and l SuperHyperEdges. Then n−k/l 2005

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

Proof. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 2007
S = (V, E) is a probability Trace-Decomposition. The latter is straightforward.  2008

136EXM1 Example 10.0.20. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E) in 2009

the mentioned Extreme Figures in every Extreme items. 2010

• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperTrace- 2011
Decomposition, is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 2012
are some empty Extreme SuperHyperEdges but E2 is a loop Extreme SuperHyperEdge and 2013
E4 is an Extreme SuperHyperEdge. Thus in the terms of Extreme SuperHyperNeighbor, 2014
there’s only one Extreme SuperHyperEdge, namely, E4 . The Extreme SuperHyperVertex, 2015
V3 is Extreme isolated means that there’s no Extreme SuperHyperEdge has it as an 2016

Extreme endpoint. Thus the Extreme SuperHyperVertex, V3 , is excluded in every given 2017
Extreme SuperHyperTrace-Decomposition. 2018

C(N SHG)Extreme Trace-Decomposition

= {}.
C(N SHG)Extreme Trace-Decomposition SuperHyperPolynomial
= 0z 0 .
C(N SHG)Extreme V-Trace-Decomposition
= {V1 , V2 , V4 }.
C(N SHG)Extreme V-Trace-Decomposition SuperHyperPolynomial
= z 5 + 2z 3 .

2019

• On the Figure (30.2), the Extreme SuperHyperNotion, namely, Extreme SuperHyperTrace- 2020
Decomposition, is up. The Extreme Algorithm is Extremely straightforward. E1 , E2 and 2021
E3 are some empty Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. 2022
Thus in the terms of Extreme SuperHyperNeighbor, there’s only one Extreme SuperHy- 2023
perEdge, namely, E4 . The Extreme SuperHyperVertex, V3 is Extreme isolated means that 2024
there’s no Extreme SuperHyperEdge has it as an Extreme endpoint. Thus the Extreme Su- 2025

perHyperVertex, V3 , is excluded in every given Extreme SuperHyperTrace-Decomposition. 2026

C(N SHG)Extreme Trace-Decomposition

= {}.

Henry Garrett · 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
SuperHyperTrace-Decomposition in the Extreme Example (42.0.3) 136NSHG1

C(N SHG)Extreme Trace-Decomposition SuperHyperPolynomial

= 0z 0 .
C(N SHG)Extreme V-Trace-Decomposition
= {V1 , V2 , V4 }.
C(N SHG)Extreme V-Trace-Decomposition SuperHyperPolynomial
= z 5 + z 3 + z.

2027

• On the Figure (30.3), the Extreme SuperHyperNotion, namely, Extreme SuperHyperTrace- 2028
Decomposition, is up. The Extreme Algorithm is Extremely straightforward. 2029

C(N SHG)Extreme Trace-Decomposition

= {}.
C(N SHG)Extreme Trace-Decomposition SuperHyperPolynomial
= 0z 0 .
C(N SHG)Extreme V-Trace-Decomposition
= {V1 , V2 , V3 }.
C(N SHG)Extreme V-Trace-Decomposition SuperHyperPolynomial
= z8 + z4 + z3.

2030

Henry Garrett · 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
SuperHyperTrace-Decomposition in the Extreme Example (42.0.3) 136NSHG2

Figure 10.3: The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
SuperHyperTrace-Decomposition 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
SuperHyperTrace-Decomposition in the Extreme Example (42.0.3) 136NSHG4

• On the Figure (30.4), the Extreme SuperHyperNotion, namely, Extreme SuperHyperTrace- 2031
Decomposition, is up. The Extreme Algorithm is Extremely straightforward. 2032

C(N SHG)Extreme Trace-Decomposition

= {E4 , E5 }.
C(N SHG)Extreme Trace-Decomposition SuperHyperPolynomial
= 2z 5 .
C(N SHG)Extreme V-Trace-Decomposition
= {V3 }.
C(N SHG)Extreme V-Trace-Decomposition SuperHyperPolynomial
= z2.

2033

• On the Figure (30.5), the Extreme SuperHyperNotion, namely, Extreme SuperHyperTrace- 2034

Decomposition, is up. The Extreme Algorithm is Extremely straightforward. 2035

C(N SHG)Extreme Trace-Decomposition

= {}.
C(N SHG)Extreme Trace-Decomposition SuperHyperPolynomial
= 0z 0 .
C(N SHG)Extreme V-Trace-Decomposition
= {{}}.
C(N SHG)Extreme V-Trace-Decomposition 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.5: The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
SuperHyperTrace-Decomposition in the Extreme Example (42.0.3) 136NSHG5

= z0.

2036

• On the Figure (30.6), the Extreme SuperHyperNotion, namely, Extreme SuperHyperTrace- 2037
Decomposition, is up. The Extreme Algorithm is Extremely straightforward. 2038

C(N SHG)Extreme Trace-Decomposition

= {}.
C(N SHG)Extreme Trace-Decomposition SuperHyperPolynomial
= 0z 0 .
C(N SHG)Extreme V-Trace-Decomposition
= {{}}.
C(N SHG)Extreme V-Trace-Decomposition SuperHyperPolynomial
= z0.

2039

• On the Figure (30.7), the Extreme SuperHyperNotion, namely, Extreme SuperHyperTrace- 2040
Decomposition, is up. The Extreme Algorithm is Extremely straightforward. 2041

C(N SHG)Extreme Trace-Decomposition

Henry Garrett · 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
SuperHyperTrace-Decomposition in the Extreme Example (42.0.3) 136NSHG6

= {}.
C(N SHG)Extreme Trace-Decomposition SuperHyperPolynomial
= 0z 0 .
C(N SHG)Extreme V-Trace-Decomposition
= {{}}.
C(N SHG)Extreme V-Trace-Decomposition SuperHyperPolynomial
= z0.

2042

• On the Figure (30.8), the Extreme SuperHyperNotion, namely, Extreme SuperHyperTrace- 2043
Decomposition, is up. The Extreme Algorithm is Extremely straightforward. 2044

C(N SHG)Extreme Trace-Decomposition

= {}.
C(N SHG)Extreme Trace-Decomposition SuperHyperPolynomial
= 0z 0 .
C(N SHG)Extreme V-Trace-Decomposition
= {{}}.
C(N SHG)Extreme V-Trace-Decomposition 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.7: The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
SuperHyperTrace-Decomposition in the Extreme Example (42.0.3) 136NSHG7

= z0.

2045

• On the Figure (30.9), the Extreme SuperHyperNotion, namely, Extreme SuperHyperTrace- 2046
Decomposition, is up. The Extreme Algorithm is Extremely straightforward. 2047

C(N SHG)Extreme Trace-Decomposition

= {E23 }.
C(N SHG)Extreme Trace-Decomposition SuperHyperPolynomial
= z 11 .
C(N SHG)Extreme V-Trace-Decomposition
= {{Vi }22
i=11,i6=21 .
C(N SHG)Extreme V-Trace-Decomposition SuperHyperPolynomial
= 2z 5 + 7z 4 + 2z 3 .

2048

• On the Figure (30.10), the Extreme SuperHyperNotion, namely, Extreme 2049

SuperHyperTrace-Decomposition, is up. The Extreme Algorithm is Extremely straightfor- 2050

ward. 2051

C(N SHG)Extreme Trace-Decomposition

Henry Garrett · 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
SuperHyperTrace-Decomposition in the Extreme Example (42.0.3) 136NSHG8

Figure 10.9: The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
SuperHyperTrace-Decomposition in the Extreme Example (42.0.3) 136NSHG9

Henry Garrett · 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.10: The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
SuperHyperTrace-Decomposition in the Extreme Example (42.0.3) 136NSHG10

= {E5 }.
C(N SHG)Extreme Trace-Decomposition SuperHyperPolynomial
= z3.
C(N SHG)Extreme V-Trace-Decomposition
= {V12 , V13 , V14 }.
C(N SHG)Extreme V-Trace-Decomposition SuperHyperPolynomial
= 2z 5 + z 3 .

2052

• On the Figure (30.11), the Extreme SuperHyperNotion, namely, Extreme 2053

SuperHyperTrace-Decomposition, is up. The Extreme Algorithm is Extremely straightfor- 2054
ward. 2055

C(N SHG)Extreme Trace-Decomposition

= {E1 }.
C(N SHG)Extreme Trace-Decomposition SuperHyperPolynomial
= z5 + z4 + z3.
C(N SHG)Extreme V-Trace-Decomposition
= {V1 , V2 , V3 , V4 , V5 , V6 }.
C(N SHG)Extreme V-Trace-Decomposition 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.11: The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
SuperHyperTrace-Decomposition in the Extreme Example (42.0.3) 136NSHG11

= 3z 5 + z 4 + 2z 3 .

2056

• On the Figure (30.12), the Extreme SuperHyperNotion, namely, Extreme 2057

SuperHyperTrace-Decomposition, is up. The Extreme Algorithm is Extremely straightfor- 2058
ward. 2059

C(N SHG)Extreme Trace-Decomposition

= {}.
C(N SHG)Extreme Trace-Decomposition SuperHyperPolynomial
= 0z 0 .
C(N SHG)Extreme V-Trace-Decomposition
= {}.
C(N SHG)Extreme V-Trace-Decomposition SuperHyperPolynomial
= 0z 0 .

2060

• On the Figure (30.13), the Extreme SuperHyperNotion, namely, Extreme 2061

SuperHyperTrace-Decomposition, is up. The Extreme Algorithm is Extremely straightfor- 2062

Henry Garrett · 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
SuperHyperTrace-Decomposition in the Extreme Example (42.0.3) 136NSHG12

ward. 2063

C(N SHG)Extreme Trace-Decomposition

= {E1 }.
C(N SHG)Extreme Trace-Decomposition SuperHyperPolynomial
= z5 + z4 + z3.
C(N SHG)Extreme V-Trace-Decomposition
= {V1 , V2 , V3 , V4 , V5 , V6 }.
C(N SHG)Extreme V-Trace-Decomposition SuperHyperPolynomial
= 3z 5 + z 4 + 2z 3 .

2064

• On the Figure (30.14), the Extreme SuperHyperNotion, namely, Extreme 2065

SuperHyperTrace-Decomposition, is up. The Extreme Algorithm is Extremely straightfor- 2066
ward. 2067

C(N SHG)Extreme Trace-Decomposition

= {E1 , E2 }.
C(N SHG)Extreme Trace-Decomposition 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

Figure 10.13: The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
SuperHyperTrace-Decomposition in the Extreme Example (42.0.3) 136NSHG13

C(N SHG)Extreme V-Trace-Decomposition

= {V1 }.
C(N SHG)Extreme V-Trace-Decomposition SuperHyperPolynomial
= z5.

2068

• On the Figure (30.15), the Extreme SuperHyperNotion, namely, Extreme 2069

SuperHyperTrace-Decomposition, is up. The Extreme Algorithm is Extremely straightfor- 2070
ward. 2071

C(N SHG)Extreme Trace-Decomposition

= {}.
C(N SHG)Extreme Trace-Decomposition SuperHyperPolynomial
= 0z 0 .
C(N SHG)Extreme V-Trace-Decomposition
= {}.
C(N SHG)Extreme V-Trace-Decomposition SuperHyperPolynomial
= 0z 0 .

2072

Henry Garrett · 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
SuperHyperTrace-Decomposition in the Extreme Example (42.0.3) 136NSHG14

• On the Figure (30.16), the Extreme SuperHyperNotion, namely, Extreme 2073

SuperHyperTrace-Decomposition, is up. The Extreme Algorithm is Extremely straightfor- 2074

ward. 2075

C(N SHG)Extreme Trace-Decomposition

= {}.
C(N SHG)Extreme Trace-Decomposition SuperHyperPolynomial
= 0z 0 .
C(N SHG)Extreme V-Trace-Decomposition
= {}.
C(N SHG)Extreme V-Trace-Decomposition SuperHyperPolynomial
= 0z 0 .

2076

Henry Garrett · 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
SuperHyperTrace-Decomposition in the Extreme Example (42.0.3) 136NSHG15

Figure 10.16: The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
SuperHyperTrace-Decomposition in the Extreme Example (42.0.3) 136NSHG16

Henry Garrett · 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.17: The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
SuperHyperTrace-Decomposition in the Extreme Example (42.0.3) 136NSHG17

• On the Figure (30.17), the Extreme SuperHyperNotion, namely, Extreme 2077

SuperHyperTrace-Decomposition, is up. The Extreme Algorithm is Extremely straightfor- 2078
ward. 2079

C(N SHG)Extreme Trace-Decomposition

= {}.
C(N SHG)Extreme Trace-Decomposition SuperHyperPolynomial
= 0z 0 .
C(N SHG)Extreme V-Trace-Decomposition
= {}.
C(N SHG)Extreme V-Trace-Decomposition SuperHyperPolynomial
= 0z 0 .

2080

• On the Figure (30.18), the Extreme SuperHyperNotion, namely, Extreme 2081

SuperHyperTrace-Decomposition, is up. The Extreme Algorithm is Extremely straightfor- 2082
ward. 2083

C(N SHG)Extreme Trace-Decomposition

= {}.

Henry Garrett · 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
SuperHyperTrace-Decomposition in the Extreme Example (42.0.3) 136NSHG18

C(N SHG)Extreme Trace-Decomposition SuperHyperPolynomial

= 0z 0 .
C(N SHG)Extreme V-Trace-Decomposition
= {}.
C(N SHG)Extreme V-Trace-Decomposition SuperHyperPolynomial
= 0z 0 .

2084

• On the Figure (30.19), the Extreme SuperHyperNotion, namely, Extreme 2085

SuperHyperTrace-Decomposition, is up. The Extreme Algorithm is Extremely straightfor- 2086
ward. 2087

C(N SHG)Extreme Trace-Decomposition

= {}.
C(N SHG)Extreme Trace-Decomposition SuperHyperPolynomial
= 0z 0 .
C(N SHG)Extreme V-Trace-Decomposition
= {}.
C(N SHG)Extreme V-Trace-Decomposition 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.19: The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
SuperHyperTrace-Decomposition in the Extreme Example (42.0.3) 136NSHG19

= 0z 0 .

2088

• On the Figure (30.20), the Extreme SuperHyperNotion, namely, Extreme 2089

SuperHyperTrace-Decomposition, is up. The Extreme Algorithm is Extremely straightfor- 2090

ward. 2091

C(N SHG)Extreme Trace-Decomposition

= {}.
C(N SHG)Extreme Trace-Decomposition SuperHyperPolynomial
= 0z 0 .
C(N SHG)Extreme V-Trace-Decomposition
= {}.
C(N SHG)Extreme V-Trace-Decomposition SuperHyperPolynomial
= 0z 0 .

2092

• On the Figure (30.21), the Extreme SuperHyperNotion, namely, Extreme 2093

SuperHyperTrace-Decomposition, is up. The Extreme Algorithm is Extremely straightfor- 2094

Henry Garrett · 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
SuperHyperTrace-Decomposition in the Extreme Example (42.0.3) 136NSHG20

ward. 2095

C(N SHG)Extreme Trace-Decomposition

= {E1 , E2 }.
C(N SHG)Extreme Trace-Decomposition SuperHyperPolynomial
= z 10 + z 2 .
C(N SHG)Extreme V-Trace-Decomposition
= {VE2 }.
C(N SHG)Extreme V-Trace-Decomposition SuperHyperPolynomial
= z 5 + 2z 3 + 7z.

2096

• On the Figure (30.22), the Extreme SuperHyperNotion, namely, Extreme 2097

SuperHyperTrace-Decomposition, is up. The Extreme Algorithm is Extremely straightfor- 2098
ward. 2099

C(N SHG)Extreme Trace-Decomposition

= {}.
C(N SHG)Extreme Trace-Decomposition 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.21: The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
SuperHyperTrace-Decomposition in the Extreme Example (42.0.3) 95NHG1

= 0z 0 .
C(N SHG)Extreme V-Trace-Decomposition
= {}.
C(N SHG)Extreme V-Trace-Decomposition SuperHyperPolynomial
= 0z 0 .

2100

Proposition 10.0.21. Assume a connected Extreme SuperHyperGraph ESHG : (V, E). The all 2101
interior Extreme SuperHyperVertices belong to any Extreme quasi-R-Trace-Decomposition if for 2102
any of them, and any of other corresponded Extreme SuperHyperVertex, some interior Extreme 2103
SuperHyperVertices are mutually Extreme SuperHyperNeighbors with no Extreme exception at 2104

all minus all Extreme SuperHypeNeighbors to any amount of them. 2105

Proposition 10.0.22. Assume a connected non-obvious Extreme SuperHyperGraph ESHG : 2106

(V, E). There’s only one Extreme SuperHyperEdge E ∈ EESHG:(V,E) has only the maximum 2107

Henry Garrett · 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
SuperHyperTrace-Decomposition in the Extreme Example (42.0.3) 95NHG2

possibilities of the distinct interior Extreme SuperHyperVertices inside of any given Extreme 2108
quasi-R-Trace-Decomposition minus all Extreme SuperHypeNeighbor to some of them but not 2109
all of them. In other words, there’s only an unique Extreme SuperHyperEdge E ∈ EESHG:(V,E) 2110
has only two distinct Extreme SuperHyperVertices in an Extreme quasi-R-Trace-Decomposition, 2111
minus all Extreme SuperHypeNeighbor to some of them but not all of them. 2112

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-Trace-Decomposition is at least

V \ (V \ {aE , bE , cE , . . . , zE }).

It’s straightforward that the Extreme cardinality of the Extreme R-Trace-Decomposition is at least 2113
the maximum Extreme number of Extreme SuperHyperVertices of the Extreme SuperHyperEdges 2114
with the maximum number of the Extreme SuperHyperEdges. In other words, the maximum 2115
number of the Extreme SuperHyperEdges contains the maximum Extreme number of Extreme 2116
SuperHyperVertices are renamed to Extreme Trace-Decomposition in some cases but the maximum 2117
number of the Extreme SuperHyperEdge with the maximum Extreme number of Extreme 2118

SuperHyperVertices, has the Extreme SuperHyperVertices are contained in an Extreme R- 2119

Trace-Decomposition. 2120

Proposition 10.0.24. Assume a simple Extreme SuperHyperGraph ESHG : (V, E). Then the
Extreme number of type-result-R-Trace-Decomposition has, the least Extreme cardinality, the

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

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-Trace-Decomposition with the least Extreme cardinality, the 2121

lower sharp Extreme bound for cardinality. 2122

Proposition 10.0.25. Assume a connected loopless Extreme SuperHyperGraph ESHG : (V, E). 2123
Then in the worst case, literally, 2124

C(N SHG)ExtremeQuasi−T race−Decomposition = {V1 , E1 , V2 , E2 , V3 , E3 , V4 , E4 , V1 }.

C(N SHG)ExtremeQuasi−T race−DecompositionSuperHyperP olynomial = z 4 .
C(N SHG)ExtremeQuasi−T race−Decomposition = {V1 , V2 , V3 , V4 , V1 }.
C(N SHG)ExtremeR−Quasi−T race−DecompositionSuperHyperP olynomial = z 5 .

Is an Extreme type-result-Trace-Decomposition. In other words, the least cardinality, the lower 2125
sharp bound for the cardinality, of an Extreme type-result-Trace-Decomposition is the cardinality 2126
of 2127

C(N SHG)ExtremeQuasi−T race−Decomposition = {V1 , E1 , V2 , E2 , V3 , E3 , V4 , E4 , V1 }.

C(N SHG)ExtremeQuasi−T race−DecompositionSuperHyperP olynomial = z 4 .
C(N SHG)ExtremeQuasi−T race−Decomposition = {V1 , V2 , V3 , V4 , V1 }.
C(N SHG)ExtremeR−Quasi−T race−DecompositionSuperHyperP 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-Trace-Decomposition
since neither amount of Extreme SuperHyperEdges nor amount of SuperHyperVertices where
amount refers to the Extreme number of SuperHyperVertices(-/SuperHyperEdges) more than
one to form any kind of SuperHyperEdges or any number of SuperHyperEdges. Let us consider
the Extreme SuperHyperSet

V \ V \ {aE , bE , cE , . . . , aE 0 , bE 0 , cE 0 , . . .}E,E 0 ={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .

This Extreme SuperHyperSet of the Extreme SuperHyperVertices has the eligibilities to propose
property such that there’s no Extreme SuperHyperVertex of an Extreme SuperHyperEdge is
common and there’s an Extreme SuperHyperEdge for all Extreme SuperHyperVertices but the
maximum Extreme cardinality indicates that these Extreme type-SuperHyperSets couldn’t give
us the Extreme lower bound in the term of Extreme sharpness. In other words, the Extreme
SuperHyperSet

V \ V \ {aE , bE , cE , . . . , aE 0 , bE 0 , cE 0 , . . .}E,E 0 ={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }}

of the Extreme SuperHyperVertices implies at least on-quasi-triangle style is up but sometimes

the Extreme SuperHyperSet

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 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-Trace-Decomposition. In other words, the least cardinality, the lower sharp bound
for the cardinality, of a quasi-R-Trace-Decomposition 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-Trace-Decomposition. 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-Trace-Decomposition 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-Trace-Decomposition. Since at least two Extreme SuperHyperVertices
involve to make a title in the Extreme background of the Extreme SuperHyperGraph. The
Extreme SuperHyperGraph is obvious if it has no Extreme SuperHyperEdge but at least two
Extreme SuperHyperVertices make the Extreme version of Extreme SuperHyperEdge. Thus in
the Extreme setting of non-obvious Extreme SuperHyperGraph, there are at least one Extreme
SuperHyperEdge. It’s necessary to mention that the word “Simple” is used as Extreme adjective
for the initial Extreme SuperHyperGraph, induces there’s no Extreme appearance of the loop
Extreme version of the Extreme SuperHyperEdge and this Extreme SuperHyperGraph is said

Henry Garrett · 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 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-Trace-Decomposition has the Extreme cardinality of an Extreme
SuperHyperEdge. Thus, an Extreme R-Trace-Decomposition has the Extreme cardinality at
least an Extreme SuperHyperEdge. Assume an Extreme SuperHyperSet V \ V \ {z}. This
Extreme SuperHyperSet isn’t an Extreme R-Trace-Decomposition 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-Trace-Decomposition” 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-Trace-Decomposition 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) }} .

Has the maximum Extreme cardinality such that

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

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-Trace-Decomposition 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-Trace-Decomposition. Those Extreme
SuperHyperVertices are potentially included in an Extreme style-R-Trace-Decomposition.
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-Trace-Decomposition is

{aE , bE , cE , . . . , zE } .

This definition coincides with the definition of the Extreme R-Trace-Decomposition but
with slightly differences in the maximum Extreme cardinality amid those Extreme type-
SuperHyperSets of the Extreme SuperHyperVertices. Thus the Extreme SuperHyperSet of the
Extreme SuperHyperVertices,

max |{Z1 , Z2 , . . . , Zz | Zi ∼ Zj , i 6= j, i, j = 1, 2, . . . , z}|Extreme cardinality ,

z

and
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 formalized with mathematical literatures on the Extreme R-Trace-Decomposition. 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, 2128

Extreme R-Trace-Decomposition =
E
{Z1 , Z2 , . . . , Zz | ∀i 6= j, i, j = 1, 2, . . . , z, ∃Ex , Zi ∼x Zj , }.
2129

Extreme R-Trace-Decomposition =
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-Trace-Decomposition where E ∈ EESHG:(V,E)

is fixed that means Ex = E ∈ EESHG:(V,E) . for all Extreme intended SuperHyperVertices
but in an Extreme Trace-Decomposition, 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-Trace-Decomposition is at least

V \ (V \ {aE , bE , cE , . . . , zE }).

It’s straightforward that the Extreme cardinality of the Extreme R-Trace-Decomposition 2130

is at least the maximum Extreme number of Extreme SuperHyperVertices of the Extreme 2131
SuperHyperEdges with the maximum number of the Extreme SuperHyperEdges. In other 2132
words, the maximum number of the Extreme SuperHyperEdges contains the maximum Extreme 2133
number of Extreme SuperHyperVertices are renamed to Extreme Trace-Decomposition in some 2134
cases but the maximum number of the Extreme SuperHyperEdge with the maximum Extreme 2135
number of Extreme SuperHyperVertices, has the Extreme SuperHyperVertices are contained in 2136

an Extreme R-Trace-Decomposition. 2137

The obvious SuperHyperGraph has no Extreme SuperHyperEdges. But the non-obvious 2138
Extreme SuperHyperModel is up. The quasi-SuperHyperModel addresses some issues about 2139
the Extreme optimal SuperHyperObject. It specially delivers some remarks on the Extreme 2140
SuperHyperSet of the Extreme SuperHyperVertices such that there’s distinct amount of Extreme 2141
SuperHyperEdges for distinct amount of Extreme SuperHyperVertices up to all taken from that 2142

Extreme SuperHyperSet of the Extreme SuperHyperVertices but this Extreme SuperHyperSet of 2143
the Extreme SuperHyperVertices is either has the maximum Extreme SuperHyperCardinality or 2144
it doesn’t have maximum Extreme SuperHyperCardinality. In a non-obvious SuperHyperModel, 2145
there’s at least one Extreme SuperHyperEdge containing at least all Extreme SuperHyperVertices. 2146
Thus it forms an Extreme quasi-R-Trace-Decomposition where the Extreme completion of 2147
the Extreme incidence is up in that. Thus it’s, literarily, an Extreme embedded R-Trace- 2148

Decomposition. The SuperHyperNotions of embedded SuperHyperSet and quasi-SuperHyperSet 2149

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

coincide. In the original setting, these types of SuperHyperSets only don’t satisfy on the 2150
maximum SuperHyperCardinality. Thus the embedded setting is elected such that those 2151
SuperHyperSets have the maximum Extreme SuperHyperCardinality and they’re Extreme 2152
SuperHyperOptimal. The less than two distinct types of Extreme SuperHyperVertices are 2153
included in the minimum Extreme style of the embedded Extreme R-Trace-Decomposition. The 2154
interior types of the Extreme SuperHyperVertices are deciders. Since the Extreme number 2155

of SuperHyperNeighbors are only affected by the interior Extreme SuperHyperVertices. The 2156
common connections, more precise and more formal, the perfect unique connections inside 2157
the Extreme SuperHyperSet for any distinct types of Extreme SuperHyperVertices pose the 2158
Extreme R-Trace-Decomposition. Thus Extreme exterior SuperHyperVertices could be used 2159
only in one Extreme SuperHyperEdge and in Extreme SuperHyperRelation with the interior 2160
Extreme SuperHyperVertices in that Extreme SuperHyperEdge. In the embedded Extreme 2161

Trace-Decomposition, there’s the usage of exterior Extreme SuperHyperVertices since they’ve 2162
more connections inside more than outside. Thus the title “exterior” is more relevant than 2163
the title “interior”. One Extreme SuperHyperVertex has no connection, inside. Thus, the 2164
Extreme SuperHyperSet of the Extreme SuperHyperVertices with one SuperHyperElement 2165
has been ignored in the exploring to lead on the optimal case implying the Extreme R-Trace- 2166
Decomposition. The Extreme R-Trace-Decomposition with the exclusion of the exclusion of 2167

all Extreme SuperHyperVertices in one Extreme SuperHyperEdge and with other terms, the 2168
Extreme R-Trace-Decomposition with the inclusion of all Extreme SuperHyperVertices in one 2169
Extreme SuperHyperEdge, is an Extreme quasi-R-Trace-Decomposition. To sum them up, 2170
in a connected non-obvious Extreme SuperHyperGraph ESHG : (V, E). There’s only one 2171
Extreme SuperHyperEdge E ∈ EESHG:(V,E) has only the maximum possibilities of the distinct 2172
interior Extreme SuperHyperVertices inside of any given Extreme quasi-R-Trace-Decomposition 2173

minus all Extreme SuperHypeNeighbor to some of them but not all of them. In other words, 2174
there’s only an unique Extreme SuperHyperEdge E ∈ EESHG:(V,E) has only two distinct 2175
Extreme SuperHyperVertices in an Extreme quasi-R-Trace-Decomposition, minus all Extreme 2176
SuperHypeNeighbor to some of them but not all of them. 2177
The main definition of the Extreme R-Trace-Decomposition has two titles. an Extreme quasi-R- 2178
Trace-Decomposition and its corresponded quasi-maximum Extreme R-SuperHyperCardinality 2179

are two titles in the terms of quasi-R-styles. For any Extreme number, there’s an Extreme 2180
quasi-R-Trace-Decomposition with that quasi-maximum Extreme SuperHyperCardinality in 2181
the terms of the embedded Extreme SuperHyperGraph. If there’s an embedded Extreme 2182
SuperHyperGraph, then the Extreme quasi-SuperHyperNotions lead us to take the collection of 2183
all the Extreme quasi-R-Trace-Decompositions for all Extreme numbers less than its Extreme 2184

corresponded maximum number. The essence of the Extreme Trace-Decomposition ends up 2185
but this essence starts up in the terms of the Extreme quasi-R-Trace-Decomposition, again and 2186
more in the operations of collecting all the Extreme quasi-R-Trace-Decompositions acted on the 2187
all possible used formations of the Extreme SuperHyperGraph to achieve one Extreme number. 2188
This Extreme number is 2189
considered as the equivalence class for all corresponded quasi-R-Trace-Decompositions. Let 2190

zExtreme Number , SExtreme SuperHyperSet and GExtreme Trace-Decomposition be an Extreme number, 2191
an Extreme SuperHyperSet and an Extreme Trace-Decomposition. Then 2192

[zExtreme Number ]Extreme Class = {SExtreme SuperHyperSet |

SExtreme SuperHyperSet = GExtreme Trace-Decomposition ,

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

|SExtreme SuperHyperSet |Extreme Cardinality

= zExtreme Number }.

As its consequences, the formal definition of the Extreme Trace-Decomposition is re-formalized 2193
and redefined as follows. 2194

GExtreme Trace-Decomposition ∈ ∪zExtreme Number [zExtreme Number ]Extreme Class =

∪zExtreme Number {SExtreme SuperHyperSet |
SExtreme SuperHyperSet = GExtreme Trace-Decomposition ,
|SExtreme SuperHyperSet |Extreme Cardinality
= zExtreme Number }.

To get more precise perceptions, the follow-up expressions propose another formal technical 2195
definition for the Extreme Trace-Decomposition. 2196

GExtreme Trace-Decomposition =
{S ∈ ∪zExtreme Number [zExtreme Number ]Extreme Class =
∪zExtreme Number {SExtreme SuperHyperSet |
SExtreme SuperHyperSet = GExtreme Trace-Decomposition ,
|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 Trace- 2197
Decomposition poses the upcoming expressions. 2198

GExtreme Trace-Decomposition =
{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. 2199

GExtreme Trace-Decomposition =
{S ∈ ∪zExtreme Number [zExtreme Number ]Extreme Class |
|SExtreme SuperHyperSet |Extreme Cardinality
= maxzExtreme Number
[zExtreme Number ]Extreme Class

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

And then, 2200

GExtreme Trace-Decomposition =

Henry Garrett · 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 ∈ ∪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. 2201

GExtreme Trace-Decomposition ∈ ∪zExtreme Number [zExtreme Number ]Extreme Class =

∪zExtreme Number {SExtreme SuperHyperSet |
SExtreme SuperHyperSet = GExtreme Trace-Decomposition ,
|SExtreme SuperHyperSet |Extreme Cardinality

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

GExtreme Trace-Decomposition =
{S ∈ ∪zExtreme Number [zExtreme Number ]Extreme Class =
∪zExtreme Number {SExtreme SuperHyperSet |
SExtreme SuperHyperSet = GExtreme Trace-Decomposition ,
|SExtreme SuperHyperSet |Extreme Cardinality
= zExtreme Number |
|SExtreme SuperHyperSet |Extreme Cardinality

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

GExtreme Trace-Decomposition =
{S ∈ ∪zExtreme Number [zExtreme Number ]Extreme Class |
|SExtreme SuperHyperSet |Extreme Cardinality
= max zExtreme Number
[zExtreme Number ]Extreme Class

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

GExtreme Trace-Decomposition =
{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- 2205

HyperNeighborhood”, could be redefined as the collection of the Extreme SuperHyperVertices 2206

such that any amount of its Extreme SuperHyperVertices are incident to an Extreme SuperHy- 2207
perEdge. It’s, literarily, another name for “Extreme Quasi-Trace-Decomposition” but, precisely, 2208
it’s the generalization of “Extreme Quasi-Trace-Decomposition” since “Extreme Quasi-Trace- 2209
Decomposition” happens “Extreme Trace-Decomposition” in an Extreme SuperHyperGraph as 2210
initial framework and background but “Extreme SuperHyperNeighborhood” may not happens 2211

“Extreme Trace-Decomposition” in an Extreme SuperHyperGraph as initial framework and 2212

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

preliminarily background since there are some ambiguities about the Extreme SuperHyperCar- 2213
dinality arise from it. To get orderly keywords, the terms, “Extreme SuperHyperNeighborhood”, 2214
“Extreme Quasi-Trace-Decomposition”, and “Extreme Trace-Decomposition” are up. 2215
Thus, let zExtreme Number , NExtreme SuperHyperNeighborhood and GExtreme Trace-Decomposition be an 2216
Extreme number, an Extreme SuperHyperNeighborhood and an Extreme Trace-Decomposition 2217
and the new terms are up. 2218

GExtreme Trace-Decomposition ∈ ∪zExtreme Number [zExtreme Number ]Extreme Class =

∪zExtreme Number {NExtreme SuperHyperNeighborhood |
|NExtreme SuperHyperNeighborhood |Extreme Cardinality
= max zExtreme Number }.
[zExtreme Number ]Extreme Class

2219

GExtreme Trace-Decomposition =
{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

2220

GExtreme Trace-Decomposition =
{NExtreme SuperHyperNeighborhood
∈ ∪zExtreme Number [zExtreme Number ]Extreme Class |
|NExtreme SuperHyperNeighborhood |Extreme Cardinality
= max zExtreme Number }.
[zExtreme Number ]Extreme Class

2221

GExtreme Trace-Decomposition =
{NExtreme SuperHyperNeighborhood
∈ ∪zExtreme Number [zExtreme Number ]Extreme Class |
|NExtreme SuperHyperSet |Extreme Cardinality
= max zExtreme Number }.
[zExtreme Number ]Extreme Class

And with go back to initial structure, 2222

GExtreme Trace-Decomposition ∈ ∪zExtreme Number [zExtreme Number ]Extreme Class =

∪zExtreme Number {NExtreme SuperHyperNeighborhood |
|NExtreme SuperHyperNeighborhood |Extreme 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 |E| | E ∈ EESHG:(V,E) }.
2223

GExtreme Trace-Decomposition =
{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) }.
2224

GExtreme Trace-Decomposition =
{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) }.
2225

GExtreme Trace-Decomposition =
{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-Trace-Decomposition 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-Trace-Decomposition.
V \ V \ {aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .

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-Trace-Decomposition. The

Extreme SuperHyperSet of the Extreme SuperHyperVertices,
V \ V \ {aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

Is an Extreme R-Trace-Decomposition 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 Trace-Decomposition 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 Trace-Decomposition is up. The obvious simple Extreme
type-SuperHyperSet called the Extreme Trace-Decomposition 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-Trace-Decomposition 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-Trace-Decomposition.

Since the Extreme SuperHyperSet of the Extreme SuperHyperVertices,
(V \ V \ {x, z}) ∪ {xy}
or
(V \ V \ {x, z}) ∪ {zy}
is an Extreme R-Trace-Decomposition 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 Trace-Decomposition and
it’s an Extreme Trace-Decomposition. Since it’s

the maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme Su-

perHyperVertices such that there’s no an Extreme SuperHyperEdge for some amount Extreme
SuperHyperVertices instead of all given by that Extreme type-SuperHyperSet called the Extreme
Trace-Decomposition. 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-Trace-Decomposition,

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 up. The non-obvious simple Extreme type-SuperHyperSet of the Extreme Trace-

Decomposition, 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 2226
ESHG : (V, E) but it’s impossible in the case, they’ve corresponded to an SuperHyperEdge. 2227
It’s interesting to mention that the only non-obvious simple Extreme type-SuperHyperSet called 2228
the 2229

“Extreme R-Trace-Decomposition” 2230

amid those obvious[non-obvious] simple Extreme type-SuperHyperSets called the 2231

Extreme R-Trace-Decomposition, 2232

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-Trace-Decomposition amid those obvious simple Extreme type-SuperHyperSets of
the Extreme Trace-Decomposition, 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) }} .

is an Extreme R-Trace-Decomposition. In other words, the least cardinality, the lower sharp
bound for the cardinality, of an Extreme R-Trace-Decomposition is the cardinality of

V \ V \ {aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .

2233
To sum them up, in a connected Extreme SuperHyperGraph ESHG : (V, E). The all interior 2234
Extreme SuperHyperVertices belong to any Extreme quasi-R-Trace-Decomposition if for any 2235
of them, and any of other corresponded Extreme SuperHyperVertex, some interior Extreme 2236
SuperHyperVertices are mutually Extreme SuperHyperNeighbors with no Extreme exception at 2237

all minus all Extreme SuperHypeNeighbors to any amount of them. 2238

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

Assume a connected Extreme SuperHyperGraph ESHG : (V, E). Let an Extreme SuperHy- 2239
perEdge ESHE : E ∈ EESHG:(V,E) has some Extreme SuperHyperVertices r. Consider all 2240
Extreme numbers of those Extreme SuperHyperVertices from that Extreme SuperHyperEdge 2241
excluding excluding more than r distinct Extreme SuperHyperVertices, exclude to any given 2242
Extreme SuperHyperSet of the Extreme SuperHyperVertices. Consider there’s an Extreme 2243
R-Trace-Decomposition with the least cardinality, the lower sharp Extreme bound for Extreme 2244

cardinality. Assume a connected Extreme SuperHyperGraph ESHG : (V, E). The Extreme 2245
SuperHyperSet of the Extreme SuperHyperVertices VESHE \ {z} is an Extreme SuperHyperSet 2246
S of the Extreme SuperHyperVertices such that there’s an Extreme SuperHyperEdge to have 2247
some Extreme SuperHyperVertices uniquely but it isn’t an Extreme R-Trace-Decomposition. 2248
Since it doesn’t have 2249
2250

the maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme SuperHy- 2251

perVertices such that there’s an Extreme SuperHyperEdge to have some SuperHyperVertices 2252
uniquely. The Extreme SuperHyperSet of the Extreme SuperHyperVertices VESHE ∪ {z} is the 2253
maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme SuperHyperVertices 2254
but it isn’t an Extreme R-Trace-Decomposition. Since it doesn’t do the Extreme procedure such 2255
that such that there’s an Extreme SuperHyperEdge to have some Extreme SuperHyperVertices 2256

uniquely [there are at least one Extreme SuperHyperVertex outside implying there’s, sometimes 2257
in the connected Extreme SuperHyperGraph ESHG : (V, E), an Extreme SuperHyperVertex, 2258
titled its Extreme SuperHyperNeighbor, to that Extreme SuperHyperVertex in the Extreme 2259
SuperHyperSet S so as S doesn’t do “the Extreme procedure”.]. There’s only one Extreme 2260
SuperHyperVertex outside the intended Extreme SuperHyperSet, VESHE ∪ {z}, in the terms of 2261
Extreme SuperHyperNeighborhood. Thus the obvious Extreme R-Trace-Decomposition, VESHE 2262

is up. The obvious simple Extreme type-SuperHyperSet of the Extreme R-Trace-Decomposition, 2263
VESHE , is an Extreme SuperHyperSet, VESHE , includes only all Extreme SuperHyperVertices 2264
does forms any kind of Extreme pairs are titled Extreme SuperHyperNeighbors in a connected 2265
Extreme SuperHyperGraph ESHG : (V, E). Since the Extreme SuperHyperSet of the Extreme 2266
SuperHyperVertices VESHE , is the maximum Extreme SuperHyperCardinality of an 2267
Extreme SuperHyperSet S of Extreme SuperHyperVertices such that there’s an Extreme 2268

SuperHyperEdge to have some Extreme SuperHyperVertices uniquely. Thus, in a connected 2269

Extreme SuperHyperGraph ESHG : (V, E). Any Extreme R-Trace-Decomposition only contains 2270
all interior Extreme SuperHyperVertices and all exterior Extreme SuperHyperVertices from the 2271
unique Extreme SuperHyperEdge where there’s any of them has all possible Extreme SuperHy- 2272
perNeighbors in and there’s all Extreme SuperHyperNeighborhoods in with no exception minus 2273

all Extreme SuperHypeNeighbors to some of them not all of them but everything is possible 2274
about Extreme SuperHyperNeighborhoods and Extreme SuperHyperNeighbors out. 2275
The SuperHyperNotion, namely, Trace-Decomposition, is up. There’s neither empty Su- 2276
perHyperEdge nor loop SuperHyperEdge. The following Extreme SuperHyperSet of Ex- 2277
treme SuperHyperEdges[SuperHyperVertices] is the simple Extreme type-SuperHyperSet 2278
of the Extreme Trace-Decomposition. The Extreme SuperHyperSet of Extreme SuperHy- 2279

perEdges[SuperHyperVertices], 2280

C(N SHG)ExtremeQuasi−T race−Decomposition

|EESHG:(V,E) |Extreme Cardinality
b c
= {E2i−1 }i=1 2
.
C(N SHG)ExtremeQuasi−T race−DecompositionSuperHyperP olynomial

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 Henry Garrett · Independent Researcher · Department of Mathematics ·
DrHenryGarrett@gmail.com · Manhattan, NY, USA
|EESHG:(V,E) |Extreme Cardinality
= 2z b 2 c
.
C(N SHG)ExtremeR−Quasi−T race−Decomposition = {Vi }si=1 , {Vj }tj=1 .
C(N SHG)ExtremeR−Quasi−T race−DecompositionSuperHyperP olynomial = az s + bz t .

is the simple Extreme type-SuperHyperSet of the Extreme Trace-Decomposition. The Extreme 2281
SuperHyperSet of the Extreme SuperHyperEdges[SuperHyperVertices], 2282

C(N SHG)ExtremeQuasi−T race−Decomposition

|EESHG:(V,E) |Extreme Cardinality
b c
= {E2i−1 }i=1 2
.
C(N SHG)ExtremeQuasi−T race−DecompositionSuperHyperP olynomial
|EESHG:(V,E) |Extreme Cardinality
= 2z b 2 c
.
C(N SHG)ExtremeR−Quasi−T race−Decomposition = {Vi }si=1 , {Vj }tj=1 .
C(N SHG)ExtremeR−Quasi−T race−DecompositionSuperHyperP olynomial = az s + bz t .

Is an Extreme Trace-Decomposition C(ESHG) for an Extreme SuperHyperGraph 2283

ESHG : (V, E) is an Extreme type-SuperHyperSet with 2284

2285
the maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme Su- 2286
perHyperEdges[SuperHyperVertices] such that there’s no Extreme SuperHyperVertex of an 2287
Extreme SuperHyperEdge is common and there’s an Extreme SuperHyperEdge for all Extreme 2288
SuperHyperVertices. There are not only two Extreme SuperHyperVertices inside the intended 2289
Extreme SuperHyperSet. Thus the non-obvious Extreme Trace-Decomposition is up. The 2290

obvious simple Extreme type-SuperHyperSet called the Extreme Trace-Decomposition is an 2291

Extreme SuperHyperSet includes only two Extreme SuperHyperVertices. But the Extreme 2292
SuperHyperSet of the Extreme SuperHyperEdges[SuperHyperVertices], 2293

C(N SHG)ExtremeQuasi−T race−Decomposition

|EESHG:(V,E) |Extreme Cardinality
b c
= {E2i−1 }i=1 2
.
C(N SHG)ExtremeQuasi−T race−DecompositionSuperHyperP olynomial
|EESHG:(V,E) |Extreme Cardinality
= 2z b 2 c
.
C(N SHG)ExtremeR−Quasi−T race−Decomposition = {Vi }si=1 , {Vj }tj=1 .
C(N SHG)ExtremeR−Quasi−T race−DecompositionSuperHyperP olynomial = az s + bz t .

Doesn’t have less than three SuperHyperVertices inside the intended Extreme SuperHy- 2294
perSet. Thus the non-obvious simple Extreme type-SuperHyperSet of the Extreme Trace- 2295
Decomposition is up. To sum them up, the Extreme SuperHyperSet of the Extreme SuperHy- 2296
perEdges[SuperHyperVertices], 2297

C(N SHG)ExtremeQuasi−T race−Decomposition

|EESHG:(V,E) |Extreme Cardinality
b c
= {E2i−1 }i=1 2
.
C(N SHG)ExtremeQuasi−T race−DecompositionSuperHyperP olynomial

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics ·
DrHenryGarrett@gmail.com · Manhattan, NY, USA
|EESHG:(V,E) |Extreme Cardinality
= 2z b 2 c
.
C(N SHG)ExtremeR−Quasi−T race−Decomposition = {Vi }si=1 , {Vj }tj=1 .
C(N SHG)ExtremeR−Quasi−T race−DecompositionSuperHyperP olynomial = az s + bz t .

Is the non-obvious simple Extreme type-SuperHyperSet of the Extreme Trace-Decomposition. 2298

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

C(N SHG)ExtremeQuasi−T race−Decomposition

|EESHG:(V,E) |Extreme Cardinality
b c
= {E2i−1 }i=1 2
.
C(N SHG)ExtremeQuasi−T race−DecompositionSuperHyperP olynomial
|EESHG:(V,E) |Extreme Cardinality
= 2z b 2 c
.
C(N SHG)ExtremeR−Quasi−T race−Decomposition = {Vi }si=1 , {Vj }tj=1 .
C(N SHG)ExtremeR−Quasi−T race−DecompositionSuperHyperP olynomial = az s + bz t .

Is an Extreme Trace-Decomposition C(ESHG) for an Extreme SuperHyperGraph ESHG : 2300

(V, E) is the Extreme SuperHyperSet S of Extreme SuperHyperVertices such that there’s 2301
no an Extreme SuperHyperEdge for some Extreme SuperHyperVertices given by that Ex- 2302

treme type-SuperHyperSet called the Extreme Trace-Decomposition and it’s an Extreme 2303
Trace-Decomposition. Since it’s 2304
2305
the maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme Su- 2306
perHyperEdges[SuperHyperVertices] such that there’s no Extreme SuperHyperVertex of an 2307

Extreme SuperHyperEdge is common and there’s an Extreme SuperHyperEdge for all Extreme 2308
SuperHyperVertices. There aren’t only less than three Extreme SuperHyperVertices inside the 2309
intended Extreme SuperHyperSet, 2310

C(N SHG)ExtremeQuasi−T race−Decomposition

|EESHG:(V,E) |Extreme Cardinality
b c
= {E2i−1 }i=1 2
.
C(N SHG)ExtremeQuasi−T race−DecompositionSuperHyperP olynomial
|EESHG:(V,E) |Extreme Cardinality
= 2z b 2 c
.
C(N SHG)ExtremeR−Quasi−T race−Decomposition = {Vi }si=1 , {Vj }tj=1 .
C(N SHG)ExtremeR−Quasi−T race−DecompositionSuperHyperP olynomial = az s + bz t .

Thus the non-obvious Extreme Trace-Decomposition, 2311

C(N SHG)ExtremeQuasi−T race−Decomposition

|EESHG:(V,E) |Extreme Cardinality
b c
= {E2i−1 }i=1 2
.
C(N SHG)ExtremeQuasi−T race−DecompositionSuperHyperP olynomial
|EESHG:(V,E) |Extreme Cardinality
= 2z b 2 c
.
C(N SHG)ExtremeR−Quasi−T race−Decomposition = {Vi }si=1 , {Vj }tj=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

C(N SHG)ExtremeR−Quasi−T race−DecompositionSuperHyperP olynomial = az s + bz t .

Is up. The obvious simple Extreme type-SuperHyperSet of the Extreme Trace-Decomposition, 2312

not: 2313

C(N SHG)ExtremeQuasi−T race−Decomposition

|EESHG:(V,E) |Extreme Cardinality
b c
= {E2i−1 }i=1 2
.
C(N SHG)ExtremeQuasi−T race−DecompositionSuperHyperP olynomial
|EESHG:(V,E) |Extreme Cardinality
= 2z b 2 c
.
C(N SHG)ExtremeR−Quasi−T race−Decomposition = {Vi }si=1 , {Vj }tj=1 .
C(N SHG)ExtremeR−Quasi−T race−DecompositionSuperHyperP olynomial = az s + bz t .

Is the Extreme SuperHyperSet, not: 2314

C(N SHG)ExtremeQuasi−T race−Decomposition

|EESHG:(V,E) |Extreme Cardinality
b c
= {E2i−1 }i=1 2
.
C(N SHG)ExtremeQuasi−T race−DecompositionSuperHyperP olynomial
|EESHG:(V,E) |Extreme Cardinality
= 2z b 2 c
.
C(N SHG)ExtremeR−Quasi−T race−Decomposition = {Vi }si=1 , {Vj }tj=1 .
C(N SHG)ExtremeR−Quasi−T race−DecompositionSuperHyperP olynomial = az s + bz t .

Does includes only less than three SuperHyperVertices in a connected Extreme SuperHyperGraph 2315

ESHG : (V, E). It’s interesting to mention that the only non-obvious simple Extreme type- 2316
SuperHyperSet called the 2317

“Extreme Trace-Decomposition” 2318

amid those obvious[non-obvious] simple Extreme type-SuperHyperSets called the 2319

Extreme Trace-Decomposition, 2320

is only and only 2321

C(N SHG)ExtremeQuasi−T race−Decomposition

|EESHG:(V,E) |Extreme Cardinality
b c
= {E2i−1 }i=1 2
.
C(N SHG)ExtremeQuasi−T race−DecompositionSuperHyperP olynomial
|EESHG:(V,E) |Extreme Cardinality
= 2z b 2 c
.
C(N SHG)ExtremeR−Quasi−T race−Decomposition = {Vi }si=1 , {Vj }tj=1 .
C(N SHG)ExtremeR−Quasi−T race−DecompositionSuperHyperP olynomial = az s + bz t .

In a connected Extreme SuperHyperGraph ESHG : (V, E).  2322

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 CHAPTER 11 2323

The Extreme Departures on The 2324

Theoretical Results Toward Theoretical 2325

Motivations 2326

The previous Extreme approach apply on the upcoming Extreme results on Extreme 2327
SuperHyperClasses. 2328

Proposition 11.0.1. Assume a connected Extreme SuperHyperPath ESHP : (V, E). Then 2329

C(N SHG)Extreme Trace-Decomposition

= {}.
C(N SHG)Extreme Trace-Decomposition SuperHyperPolynomial
= 0z 0 .
C(N SHG)Extreme V-Trace-Decomposition
= {}.
C(N SHG)Extreme V-Trace-Decomposition SuperHyperPolynomial
= 0z 0 .
Proof. Let 2330

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V |EN SHG |
, E |EN SHG |
3 3
2331

P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
...,
EXT ERN AL
E |EN SHG | , V |EN SHG |
3 3

109
 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

SuperHyperTrace-Decomposition in the Example (42.0.5) 136NSHG18a

be a longest path taken from a connected Extreme SuperHyperPath ESHP : (V, E). There’s a 2332
new way to redefine as 2333

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 2334
to ViEXT ERN AL in the literatures of SuperHyperTrace-Decomposition. The latter is 2335
straightforward.  2336

136EXM18a Example 11.0.2. In the Figure (31.1), the connected Extreme SuperHyperPath ESHP : (V, E), 2337
is highlighted and featured. The Extreme SuperHyperSet, in the Extreme SuperHyperModel 2338
(31.1), is the SuperHyperTrace-Decomposition. 2339

Proposition 11.0.3. Assume a connected Extreme SuperHyperCycle ESHC : (V, E). Then 2340

C(N SHG)Extreme Trace-Decomposition

= {}.
C(N SHG)Extreme Trace-Decomposition SuperHyperPolynomial
= 0z 0 .
C(N SHG)Extreme V-Trace-Decomposition

Henry Garrett · 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-Trace-Decomposition SuperHyperPolynomial
= 0z 0 .

Proof. Let 2341

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V |EN SHG |
, E |EN SHG |
3 3
2342

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 2343
new way to redefine as 2344

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 2345
to ViEXT ERN AL in the literatures of SuperHyperTrace-Decomposition. The latter is 2346

straightforward.  2347

136EXM19a Example 11.0.4. In the Figure (31.2), the connected Extreme SuperHyperCycle N SHC : 2348
(V, E), is highlighted and featured. The obtained Extreme SuperHyperSet, in the Extreme 2349

SuperHyperModel (31.2), is the Extreme SuperHyperTrace-Decomposition. 2350

Proposition 11.0.5. Assume a connected Extreme SuperHyperStar ESHS : (V, E). Then 2351

C(N SHG)Extreme Trace-Decomposition

= {}.
C(N SHG)Extreme Trace-Decomposition SuperHyperPolynomial
= 0z 0 .
C(N SHG)Extreme V-Trace-Decomposition
= {}.
C(N SHG)Extreme V-Trace-Decomposition 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

SuperHyperTrace-Decomposition in the Extreme Example (42.0.7) 136NSHG19a

Proof. Let 2352

P :
V1EXT ERN AL , E1 ,
CEN T ER, E2
2353

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 2354
way to redefine as 2355

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 2356
to ViEXT ERN AL in the literatures of SuperHyperTrace-Decomposition. The latter is 2357

straightforward.  2358

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

SuperHyperTrace-Decomposition 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), 2359
is highlighted and featured. The obtained Extreme SuperHyperSet, by the Algorithm in previous 2360
Extreme result, of the Extreme SuperHyperVertices of the connected Extreme SuperHyperStar 2361
ESHS : (V, E), in the Extreme SuperHyperModel (31.3), is the Extreme SuperHyperTrace- 2362
Decomposition. 2363

Proposition 11.0.7. Assume a connected Extreme SuperHyperBipartite ESHB : (V, E). Then 2364

C(N SHG)Extreme Trace-Decomposition

= {}.
C(N SHG)Extreme Trace-Decomposition SuperHyperPolynomial
= 0z 0 .
C(N SHG)Extreme V-Trace-Decomposition
= {}.
C(N SHG)Extreme V-Trace-Decomposition SuperHyperPolynomial
= 0z 0 .
Proof. Let 2365

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

2366

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 2367
a new way to redefine as 2368

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 2369
to ViEXT ERN AL in the literatures of SuperHyperTrace-Decomposition. The latter is 2370

straightforward. Then there’s no at least one SuperHyperTrace-Decomposition. Thus the notion 2371
of quasi may be up but the SuperHyperNotions based on SuperHyperTrace-Decomposition 2372
could be applied. There are only two SuperHyperParts. Thus every SuperHyperPart could have 2373
one SuperHyperVertex as the representative in the 2374

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

is a longest SuperHyperTrace-Decomposition taken from a connected Extreme SuperHyperBi- 2375

partite ESHB : (V, E). Thus only some SuperHyperVertices and only minimum-Extreme-of- 2376
SuperHyperPart SuperHyperEdges are attained in any solution 2377

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

The latter is straightforward.  2378

136EXM21a Example 11.0.8. In the Extreme Figure (31.4), the connected Extreme SuperHyperBipartite 2379
ESHB : (V, E), is Extreme highlighted and Extreme featured. The obtained Extreme 2380
SuperHyperSet, by the Extreme Algorithm in previous Extreme result, of the Extreme 2381
SuperHyperVertices of the connected Extreme SuperHyperBipartite ESHB : (V, E), in the 2382

Extreme SuperHyperModel (31.4), is the Extreme SuperHyperTrace-Decomposition. 2383

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

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

Extreme SuperHyperTrace-Decomposition in the Example (42.0.11) 136NSHG21a

Proposition 11.0.9. Assume a connected Extreme SuperHyperMultipartite ESHM : (V, E). 2384
Then 2385

C(N SHG)Extreme Trace-Decomposition

= {}.
C(N SHG)Extreme Trace-Decomposition SuperHyperPolynomial
= 0z 0 .
C(N SHG)Extreme V-Trace-Decomposition
= {}.
C(N SHG)Extreme V-Trace-Decomposition SuperHyperPolynomial
= 0z 0 .

Proof. Let 2386

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

2387

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 SuperHyperTrace-Decomposition taken from a connected Extreme SuperHyperMul- 2388

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

ViEXT ERN AL ∼ VjEXT ERN AL ≡

∃!Ez ∈ EESHG:(V,E) , ViEXT ERN AL , VjEXT ERN AL ∈ Ez ≡
∃!Ez ∈ EESHG:(V,E) , {ViEXT ERN AL , VjEXT ERN AL } ⊆ Ez .

The term “EXTERNAL” implies |N (ViEXT ERN AL )| ≥ |N (Vj )| where Vj is corresponded 2390
to ViEXT ERN AL in the literatures of SuperHyperTrace-Decomposition. The latter is 2391
straightforward. Then there’s no at least one SuperHyperTrace-Decomposition. Thus the notion 2392
of quasi may be up but the SuperHyperNotions based on SuperHyperTrace-Decomposition 2393
could be applied. There are only z 0 SuperHyperParts. Thus every SuperHyperPart could have 2394
one SuperHyperVertex as the representative in the 2395

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

is a longest path taken from a connected Extreme SuperHyperMultipartite ESHM : 2396

(V, E). Thus only some SuperHyperVertices and only minimum-Extreme-of-SuperHyperPart 2397
SuperHyperEdges are attained in any solution 2398

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

is a longest path taken from a connected Extreme SuperHyperMultipartite ESHM : (V, E). 2399

The latter is straightforward.  2400

136EXM22a Example 11.0.10. In the Figure (31.5), the connected Extreme SuperHyperMultipartite 2401

ESHM : (V, E), is highlighted and Extreme featured. The obtained Extreme SuperHyperSet, by 2402
the Algorithm in previous Extreme result, of the Extreme SuperHyperVertices of the connected 2403
Extreme SuperHyperMultipartite ESHM : (V, E), in the Extreme SuperHyperModel (31.5), is 2404
the Extreme SuperHyperTrace-Decomposition. 2405

Proposition 11.0.11. Assume a connected Extreme SuperHyperWheel ESHW : (V, E). Then, 2406

C(N SHG)Extreme Trace-Decomposition

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

SuperHyperTrace-Decomposition in the Example (42.0.13) 136NSHG22a

= {}.
C(N SHG)Extreme Trace-Decomposition SuperHyperPolynomial
= 0z 0 .
C(N SHG)Extreme V-Trace-Decomposition
= {CEN T ER}.
C(N SHG)Extreme V-Trace-Decomposition SuperHyperPolynomial
= z |CEN T ER| .
Proof. Let 2407

P :
V1EXT ERN AL , E1∗ ,
CEN T ER, E2∗
2408

P :
E1∗ , V1EXT ERN AL ,
E2∗ , CEN T ER
is a longest SuperHyperTrace-Decomposition taken from a connected Extreme SuperHyperWheel 2409
ESHW : (V, E). There’s a 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 .

Henry Garrett · 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 SuperHyperTrace-Decomposition in the Extreme Example (42.0.15) 136NSHG23a

The term “EXTERNAL” implies |N (ViEXT ERN AL )| ≥ |N (Vj )| where Vj is corresponded 2411
to ViEXT ERN AL in the literatures of SuperHyperTrace-Decomposition. The latter is 2412

straightforward. Then there’s at least one SuperHyperTrace-Decomposition. Thus the notion 2413
of quasi isn’t up and the SuperHyperNotions based on SuperHyperTrace-Decomposition 2414
could be applied. The unique embedded SuperHyperTrace-Decomposition proposes some 2415
longest SuperHyperTrace-Decomposition excerpt from some representatives. The latter is 2416
straightforward.  2417

136EXM23a Example 11.0.12. In the Extreme Figure (31.6), the connected Extreme SuperHyperWheel 2418
N SHW : (V, E), is Extreme highlighted and featured. The obtained Extreme SuperHyperSet, 2419
by the Algorithm in previous result, of the Extreme SuperHyperVertices of the connected 2420

Extreme SuperHyperWheel ESHW : (V, E), in the Extreme SuperHyperModel (31.6), is the 2421
Extreme SuperHyperTrace-Decomposition. 2422

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 CHAPTER 12 2423

The Surveys of Mathematical Sets On 2424

The Results But As The Initial Motivation 2425

For the SuperHyperTrace-Decomposition, Extreme SuperHyperTrace-Decomposition, and the 2426

Extreme SuperHyperTrace-Decomposition, some general results are introduced. 2427

Remark 12.0.1. Let remind that the Extreme SuperHyperTrace-Decomposition is “redefined” 2428
on the positions of the alphabets. 2429

Corollary 12.0.2. Assume Extreme SuperHyperTrace-Decomposition. Then 2430

Extreme SuperHyperT race − Decomposition =

{theSuperHyperT race − Decompositionof theSuperHyperV ertices |
max |SuperHyperOf f ensive
SuperHyperT race − Decomposition
|ExtremecardinalityamidthoseSuperHyperT race−Decomposition. }

plus one Extreme SuperHypeNeighbor to one. Where σi is the unary operation on the 2431
SuperHyperVertices of the SuperHyperGraph to assign the determinacy, the indeterminacy 2432
and the neutrality, for i = 1, 2, 3, respectively. 2433

Corollary 12.0.3. Assume an Extreme SuperHyperGraph on the same identical letter of the 2434
alphabet. Then the notion of Extreme SuperHyperTrace-Decomposition and SuperHyperTrace- 2435

Decomposition coincide. 2436

Corollary 12.0.4. Assume an Extreme SuperHyperGraph on the same identical letter of 2437
the alphabet. Then a conseNeighborive sequence of the SuperHyperVertices is an Extreme 2438
SuperHyperTrace-Decomposition if and only if it’s a SuperHyperTrace-Decomposition. 2439

Corollary 12.0.5. Assume an Extreme SuperHyperGraph on the same identical letter of 2440
the alphabet. Then a conseNeighborive sequence of the SuperHyperVertices is a strongest 2441
SuperHyperTrace-Decomposition if and only if it’s a longest SuperHyperTrace-Decomposition. 2442

Corollary 12.0.6. Assume SuperHyperClasses of an Extreme SuperHyperGraph on the same 2443

identical letter of the alphabet. Then its Extreme SuperHyperTrace-Decomposition is its 2444
SuperHyperTrace-Decomposition and reversely. 2445

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

Corollary 12.0.7. Assume an Extreme SuperHyperPath(-/SuperHyperTrace-Decomposition, 2446

SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel) on the same 2447
identical letter of the alphabet. Then its Extreme SuperHyperTrace-Decomposition is its 2448
SuperHyperTrace-Decomposition and reversely. 2449

Corollary 12.0.8. Assume an Extreme SuperHyperGraph. Then its Extreme SuperHyperTrace- 2450

Decomposition isn’t well-defined if and only if its SuperHyperTrace-Decomposition isn’t well- 2451
defined. 2452

Corollary 12.0.9. Assume SuperHyperClasses of an Extreme SuperHyperGraph. Then its 2453

Extreme SuperHyperTrace-Decomposition isn’t well-defined if and only if its SuperHyperTrace- 2454
Decomposition isn’t well-defined. 2455

Corollary 12.0.10. Assume an Extreme SuperHyperPath(-/SuperHyperTrace-Decomposition, 2456

SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). Then its 2457

Extreme SuperHyperTrace-Decomposition isn’t well-defined if and only if its SuperHyperTrace- 2458
Decomposition isn’t well-defined. 2459

Corollary 12.0.11. Assume an Extreme SuperHyperGraph. Then its Extreme SuperHyperTrace- 2460
Decomposition is well-defined if and only if its SuperHyperTrace-Decomposition is well-defined. 2461

Corollary 12.0.12. Assume SuperHyperClasses of an Extreme SuperHyperGraph. Then its 2462

Extreme SuperHyperTrace-Decomposition is well-defined if and only if its SuperHyperTrace- 2463
Decomposition is well-defined. 2464

Corollary 12.0.13. Assume an Extreme SuperHyperPath(-/SuperHyperTrace-Decomposition, 2465

SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). Then its 2466

Extreme SuperHyperTrace-Decomposition is well-defined if and only if its SuperHyperTrace- 2467

Decomposition is well-defined. 2468

Proposition 12.0.14. Let ESHG : (V, E) be an Extreme SuperHyperGraph. Then V is 2469

(i) : the dual SuperHyperDefensive SuperHyperTrace-Decomposition; 2470

(ii) : the strong dual SuperHyperDefensive SuperHyperTrace-Decomposition; 2471

(iii) : the connected dual SuperHyperDefensive SuperHyperTrace-Decomposition; 2472

(iv) : the δ-dual SuperHyperDefensive SuperHyperTrace-Decomposition; 2473

(v) : the strong δ-dual SuperHyperDefensive SuperHyperTrace-Decomposition; 2474

(vi) : the connected δ-dual SuperHyperDefensive SuperHyperTrace-Decomposition. 2475

Proposition 12.0.15. Let N T G : (V, E, σ, µ) be an Extreme SuperHyperGraph. Then ∅ is 2476

(i) : the SuperHyperDefensive SuperHyperTrace-Decomposition; 2477

(ii) : the strong SuperHyperDefensive SuperHyperTrace-Decomposition; 2478

(iii) : the connected defensive SuperHyperDefensive SuperHyperTrace-Decomposition; 2479

(iv) : the δ-SuperHyperDefensive SuperHyperTrace-Decomposition; 2480

Henry Garrett · 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 SuperHyperTrace-Decomposition; 2481

(vi) : the connected δ-SuperHyperDefensive SuperHyperTrace-Decomposition. 2482

Proposition 12.0.16. Let ESHG : (V, E) be an Extreme SuperHyperGraph. Then an 2483

independent SuperHyperSet is 2484

(i) : the SuperHyperDefensive SuperHyperTrace-Decomposition; 2485

(ii) : the strong SuperHyperDefensive SuperHyperTrace-Decomposition; 2486

(iii) : the connected SuperHyperDefensive SuperHyperTrace-Decomposition; 2487

(iv) : the δ-SuperHyperDefensive SuperHyperTrace-Decomposition; 2488

(v) : the strong δ-SuperHyperDefensive SuperHyperTrace-Decomposition; 2489

(vi) : the connected δ-SuperHyperDefensive SuperHyperTrace-Decomposition. 2490

Proposition 12.0.17. Let ESHG : (V, E) be an Extreme SuperHyperUniform SuperHyperGraph 2491

which is a SuperHyperTrace-Decomposition/SuperHyperPath. Then V is a maximal 2492

(i) : SuperHyperDefensive SuperHyperTrace-Decomposition; 2493

(ii) : strong SuperHyperDefensive SuperHyperTrace-Decomposition; 2494

(iii) : connected SuperHyperDefensive SuperHyperTrace-Decomposition; 2495

(iv) : O(ESHG)-SuperHyperDefensive SuperHyperTrace-Decomposition; 2496

(v) : strong O(ESHG)-SuperHyperDefensive SuperHyperTrace-Decomposition; 2497

(vi) : connected O(ESHG)-SuperHyperDefensive SuperHyperTrace-Decomposition; 2498

Where the exterior SuperHyperVertices and the interior SuperHyperVertices coincide. 2499

Proposition 12.0.18. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is a 2500

SuperHyperUniform SuperHyperWheel. Then V is a maximal 2501

(i) : dual SuperHyperDefensive SuperHyperTrace-Decomposition; 2502

(ii) : strong dual SuperHyperDefensive SuperHyperTrace-Decomposition; 2503

(iii) : connected dual SuperHyperDefensive SuperHyperTrace-Decomposition; 2504

(iv) : O(ESHG)-dual SuperHyperDefensive SuperHyperTrace-Decomposition; 2505

(v) : strong O(ESHG)-dual SuperHyperDefensive SuperHyperTrace-Decomposition; 2506

(vi) : connected O(ESHG)-dual SuperHyperDefensive SuperHyperTrace-Decomposition; 2507

Where the exterior SuperHyperVertices and the interior SuperHyperVertices coincide. 2508

Proposition 12.0.19. Let ESHG : (V, E) be an Extreme SuperHyperUniform SuperHyperGraph 2509

which is a SuperHyperTrace-Decomposition/SuperHyperPath. Then the number of 2510

Henry Garrett · 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 SuperHyperTrace-Decomposition; 2511

(ii) : the SuperHyperTrace-Decomposition; 2512

(iii) : the connected SuperHyperTrace-Decomposition; 2513

(iv) : the O(ESHG)-SuperHyperTrace-Decomposition; 2514

(v) : the strong O(ESHG)-SuperHyperTrace-Decomposition; 2515

(vi) : the connected O(ESHG)-SuperHyperTrace-Decomposition. 2516

is one and it’s only V. Where the exterior SuperHyperVertices and the interior SuperHyperVertices 2517
coincide. 2518

Proposition 12.0.20. Let ESHG : (V, E) be an Extreme SuperHyperUniform SuperHyperGraph 2519

which is a SuperHyperWheel. Then the number of 2520

(i) : the dual SuperHyperTrace-Decomposition; 2521

(ii) : the dual SuperHyperTrace-Decomposition; 2522

(iii) : the dual connected SuperHyperTrace-Decomposition; 2523

(iv) : the dual O(ESHG)-SuperHyperTrace-Decomposition; 2524

(v) : the strong dual O(ESHG)-SuperHyperTrace-Decomposition; 2525

(vi) : the connected dual O(ESHG)-SuperHyperTrace-Decomposition. 2526

is one and it’s only V. Where the exterior SuperHyperVertices and the interior SuperHyperVertices 2527
coincide. 2528

Proposition 12.0.21. Let ESHG : (V, E) be an Extreme SuperHyperUniform SuperHyperGraph 2529

which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperComplete 2530
SuperHyperMultipartite. Then a SuperHyperSet contains [the SuperHyperCenter and] the half of 2531

multiplying r with the number of all the SuperHyperEdges plus one of all the SuperHyperVertices 2532
is a 2533

(i) : dual SuperHyperDefensive SuperHyperTrace-Decomposition; 2534

(ii) : strong dual SuperHyperDefensive SuperHyperTrace-Decomposition; 2535

(iii) : connected dual SuperHyperDefensive SuperHyperTrace-Decomposition; 2536

O(ESHG)
(iv) : 2 + 1-dual SuperHyperDefensive SuperHyperTrace-Decomposition; 2537

O(ESHG)
(v) : strong 2 + 1-dual SuperHyperDefensive SuperHyperTrace-Decomposition; 2538

O(ESHG)
(vi) : connected 2 + 1-dual SuperHyperDefensive SuperHyperTrace-Decomposition. 2539

Henry Garrett · 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.22. Let ESHG : (V, E) be an Extreme SuperHyperUniform SuperHyperGraph 2540

which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperComplete 2541
SuperHyperMultipartite. Then a SuperHyperSet contains the half of multiplying r with the 2542
number of all the SuperHyperEdges plus one of all the SuperHyperVertices in the biggest 2543
SuperHyperPart is a 2544

(i) : SuperHyperDefensive SuperHyperTrace-Decomposition; 2545

(ii) : strong SuperHyperDefensive SuperHyperTrace-Decomposition; 2546

(iii) : connected SuperHyperDefensive SuperHyperTrace-Decomposition; 2547

(iv) : δ-SuperHyperDefensive SuperHyperTrace-Decomposition; 2548

(v) : strong δ-SuperHyperDefensive SuperHyperTrace-Decomposition; 2549

(vi) : connected δ-SuperHyperDefensive SuperHyperTrace-Decomposition. 2550

Proposition 12.0.23. Let ESHG : (V, E) be an Extreme SuperHyperUniform SuperHyperGraph 2551

which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperComplete 2552

SuperHyperMultipartite. Then Then the number of 2553

(i) : dual SuperHyperDefensive SuperHyperTrace-Decomposition; 2554

(ii) : strong dual SuperHyperDefensive SuperHyperTrace-Decomposition; 2555

(iii) : connected dual SuperHyperDefensive SuperHyperTrace-Decomposition; 2556

O(ESHG)
(iv) : 2 + 1-dual SuperHyperDefensive SuperHyperTrace-Decomposition; 2557

O(ESHG)
(v) : strong 2 + 1-dual SuperHyperDefensive SuperHyperTrace-Decomposition; 2558

O(ESHG)
(vi) : connected 2 + 1-dual SuperHyperDefensive SuperHyperTrace-Decomposition. 2559

is one and it’s only S, a SuperHyperSet contains [the SuperHyperCenter and] the half of 2560
multiplying r with the number of all the SuperHyperEdges plus one of all the SuperHyperVertices. 2561
Where the exterior SuperHyperVertices and the interior SuperHyperVertices coincide. 2562

Proposition 12.0.24. Let ESHG : (V, E) be an Extreme SuperHyperGraph. The number of 2563
connected component is |V − S| if there’s a SuperHyperSet which is a dual 2564

(i) : SuperHyperDefensive SuperHyperTrace-Decomposition; 2565

(ii) : strong SuperHyperDefensive SuperHyperTrace-Decomposition; 2566

(iii) : connected SuperHyperDefensive SuperHyperTrace-Decomposition; 2567

(iv) : SuperHyperTrace-Decomposition; 2568

(v) : strong 1-SuperHyperDefensive SuperHyperTrace-Decomposition; 2569

(vi) : connected 1-SuperHyperDefensive SuperHyperTrace-Decomposition. 2570

Henry Garrett · 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.25. Let ESHG : (V, E) be an Extreme SuperHyperGraph. Then the number 2571
is at most O(ESHG) and the Extreme number is at most On (ESHG). 2572

Proposition 12.0.26. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is 2573

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

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

(i) : SuperHyperDefensive SuperHyperTrace-Decomposition; 2576

(ii) : strong SuperHyperDefensive SuperHyperTrace-Decomposition; 2577

(iii) : connected SuperHyperDefensive SuperHyperTrace-Decomposition; 2578

(iv) : ( O(ESHG:(V,E))
2 + 1)-SuperHyperDefensive SuperHyperTrace-Decomposition; 2579

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

2 + 1)-SuperHyperDefensive SuperHyperTrace-Decomposition; 2580

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

2 + 1)-SuperHyperDefensive SuperHyperTrace-Decomposition. 2581

Proposition 12.0.27. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is ∅. The 2582
number is 0 and the Extreme number is 0, for an independent SuperHyperSet in the setting of 2583
dual 2584

(i) : SuperHyperDefensive SuperHyperTrace-Decomposition; 2585

(ii) : strong SuperHyperDefensive SuperHyperTrace-Decomposition; 2586

(iii) : connected SuperHyperDefensive SuperHyperTrace-Decomposition; 2587

(iv) : 0-SuperHyperDefensive SuperHyperTrace-Decomposition; 2588

(v) : strong 0-SuperHyperDefensive SuperHyperTrace-Decomposition; 2589

(vi) : connected 0-SuperHyperDefensive SuperHyperTrace-Decomposition. 2590

Proposition 12.0.28. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is SuperHy- 2591
perComplete. Then there’s no independent SuperHyperSet. 2592

Proposition 12.0.29. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is 2593

SuperHyperTrace-Decomposition/SuperHyperPath/SuperHyperWheel. The number is O(ESHG : 2594

(V, E)) and the Extreme number is On (ESHG : (V, E)), in the setting of a dual 2595

(i) : SuperHyperDefensive SuperHyperTrace-Decomposition; 2596

(ii) : strong SuperHyperDefensive SuperHyperTrace-Decomposition; 2597

(iii) : connected SuperHyperDefensive SuperHyperTrace-Decomposition; 2598

(iv) : O(ESHG : (V, E))-SuperHyperDefensive SuperHyperTrace-Decomposition; 2599

(v) : strong O(ESHG : (V, E))-SuperHyperDefensive SuperHyperTrace-Decomposition; 2600

(vi) : connected O(ESHG : (V, E))-SuperHyperDefensive SuperHyperTrace-Decomposition. 2601

Henry Garrett · 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.30. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is Super- 2602
HyperStar/complete SuperHyperBipartite/complete SuperHyperMultiPartite. The number is 2603
O(ESHG:(V,E))
2 + 1 and the Extreme number is min Σv∈{v1 ,v2 ,··· ,vt } O(ESHG:(V,E)) ⊆V σ(v), in the 2604
t>
2
setting of a dual 2605

(i) : SuperHyperDefensive SuperHyperTrace-Decomposition; 2606

(ii) : strong SuperHyperDefensive SuperHyperTrace-Decomposition; 2607

(iii) : connected SuperHyperDefensive SuperHyperTrace-Decomposition; 2608

(iv) : ( O(ESHG:(V,E))
2 + 1)-SuperHyperDefensive SuperHyperTrace-Decomposition; 2609

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

2 + 1)-SuperHyperDefensive SuperHyperTrace-Decomposition; 2610

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

2 + 1)-SuperHyperDefensive SuperHyperTrace-Decomposition. 2611

Proposition 12.0.31. Let N SHF : (V, E) be a SuperHyperFamily of the ESHGs : (V, E) 2612
Extreme SuperHyperGraphs which are from one-type SuperHyperClass which the result is obtained 2613

for the individuals. Then the results also hold for the SuperHyperFamily N SHF : (V, E) of 2614
these specific SuperHyperClasses of the Extreme SuperHyperGraphs. 2615

Proposition 12.0.32. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph. If S is a dual 2616
SuperHyperDefensive SuperHyperTrace-Decomposition, then ∀v ∈ V \ S, ∃x ∈ S such that 2617

(i) v ∈ Ns (x); 2618

(ii) vx ∈ E. 2619

Proposition 12.0.33. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph. If S is a dual 2620
SuperHyperDefensive SuperHyperTrace-Decomposition, then 2621

(i) S is SuperHyperTrace-Decomposition set; 2622

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

Proposition 12.0.34. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph. Then 2624

(i) Γ ≤ O; 2625

(ii) Γs ≤ On . 2626

Proposition 12.0.35. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph which is 2627
connected. Then 2628

(i) Γ ≤ O − 1; 2629

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

Proposition 12.0.36. Let ESHG : (V, E) be an odd SuperHyperPath. Then 2631

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

Decomposition; 2633

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

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

(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn−1 } and S2 = {v1 , v3 , · · · , vn−1 } are only a dual 2636
SuperHyperTrace-Decomposition. 2637

Proposition 12.0.37. Let ESHG : (V, E) be an even SuperHyperPath. Then 2638

(i) the set S = {v2 , v4 , · · · .vn } is a dual SuperHyperDefensive SuperHyperTrace- 2639

Decomposition; 2640

(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · .vn } and {v1 , v3 , · · · .vn−1 }; 2641

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

(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 2643
SuperHyperTrace-Decomposition. 2644

Proposition 12.0.38. Let ESHG : (V, E) be an even SuperHyperTrace-Decomposition. Then 2645

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

Decomposition; 2647

(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · , vn } and {v1 , v3 , · · · , vn−1 }; 2648

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

(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn } and S2 = {v1 , v3 , · · · , vn−1 } are only dual 2650
SuperHyperTrace-Decomposition. 2651

Proposition 12.0.39. Let ESHG : (V, E) be an odd SuperHyperTrace-Decomposition. Then 2652

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

Decomposition; 2654

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

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

(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn−1 } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 2657
SuperHyperTrace-Decomposition. 2658

Proposition 12.0.40. Let ESHG : (V, E) be SuperHyperStar. Then 2659

(i) the SuperHyperSet S = {c} is a dual maximal SuperHyperTrace-Decomposition; 2660

(ii) Γ = 1; 2661

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

(iv) the SuperHyperSets S = {c} and S ⊂ S 0 are only dual SuperHyperTrace-Decomposition. 2663

Proposition 12.0.41. Let ESHG : (V, E) be SuperHyperWheel. Then 2664

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

SuperHyperDefensive SuperHyperTrace-Decomposition; 2666

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

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

6+3(i−1)≤n
(iv) the SuperHyperSet {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is only a dual maximal 2669
SuperHyperDefensive SuperHyperTrace-Decomposition. 2670

Proposition 12.0.42. Let ESHG : (V, E) be an odd SuperHyperComplete. Then 2671

b n c+1
(i) the SuperHyperSet S = {vi }i=1
2
is a dual SuperHyperDefensive SuperHyperTrace- 2672
Decomposition; 2673

(ii) Γ = b n2 c + 1; 2674

(iii) Γs = min{Σs∈S Σ3i=1 σi (s)} b n c+1

2
; 2675
S={vi }i=1

b n c+1
(iv) the SuperHyperSet S = {vi }i=1
2
is only a dual SuperHyperDefensive SuperHyperTrace- 2676
Decomposition. 2677

Proposition 12.0.43. Let ESHG : (V, E) be an even SuperHyperComplete. Then 2678

bnc
(i) the SuperHyperSet S = {vi }i=1
2
is a dual SuperHyperDefensive SuperHyperTrace- 2679
Decomposition; 2680

(ii) Γ = b n2 c; 2681

(iii) Γs = min{Σs∈S Σ3i=1 σi (s)} bnc

2
; 2682
S={vi }i=1

bnc
(iv) the SuperHyperSet S = {vi }i=1 2
is only a dual maximal SuperHyperDefensive 2683
SuperHyperTrace-Decomposition. 2684

Proposition 12.0.44. Let N SHF : (V, E) be a m-SuperHyperFamily of Extreme SuperHyper- 2685

Stars with common Extreme SuperHyperVertex SuperHyperSet. Then 2686

(i) the SuperHyperSet S = {c1 , c2 , · · · , cm } is a dual SuperHyperDefensive SuperHyperTrace- 2687

Decomposition for N SHF; 2688

(ii) Γ = m for N SHF : (V, E); 2689

(iii) Γs = Σm 3
i=1 Σj=1 σj (ci ) for N SHF : (V, E); 2690

(iv) the SuperHyperSets S = {c1 , c2 , · · · , cm } and S ⊂ S 0 are only dual SuperHyperTrace- 2691
Decomposition for N SHF : (V, E). 2692

Proposition 12.0.45. Let N SHF : (V, E) be an m-SuperHyperFamily of odd SuperHyperCom- 2693

plete SuperHyperGraphs with common Extreme SuperHyperVertex SuperHyperSet. Then 2694

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

SuperHyperTrace-Decomposition for N SHF; 2696

(ii) Γ = b n2 c + 1 for N SHF : (V, E); 2697

(iii) Γs = min{Σs∈S Σ3i=1 σi (s)} 2

b n c+1 for N SHF : (V, E); 2698
S={vi }i=1

b n c+1
(iv) the SuperHyperSets S = {vi }i=1 2
are only a dual maximal SuperHyperTrace- 2699

Decomposition for N SHF : (V, E). 2700

Proposition 12.0.46. Let N SHF : (V, E) be a m-SuperHyperFamily of even SuperHyperCom- 2701

plete SuperHyperGraphs with common Extreme SuperHyperVertex SuperHyperSet. Then 2702

bnc
(i) the SuperHyperSet S = {vi }i=1 2
is a dual SuperHyperDefensive SuperHyperTrace- 2703
Decomposition for N SHF : (V, E); 2704

(ii) Γ = b n2 c for N SHF : (V, E); 2705

(iii) Γs = min{Σs∈S Σ3i=1 σi (s)} 2

bnc for N SHF : (V, E); 2706
S={vi }i=1

bnc
(iv) the SuperHyperSets S = {vi }i=1
2
are only dual maximal SuperHyperTrace-Decomposition 2707
for N SHF : (V, E). 2708

Proposition 12.0.47. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph. Then 2709

following statements hold; 2710

(i) if s ≥ t and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 2711

SuperHyperTrace-Decomposition, then S is an s-SuperHyperDefensive SuperHyperTrace- 2712

Decomposition; 2713

(ii) if s ≤ t and a SuperHyperSet S of SuperHyperVertices is a dual t-SuperHyperDefensive 2714

SuperHyperTrace-Decomposition, then S is a dual s-SuperHyperDefensive SuperHyperTrace- 2715
Decomposition. 2716

Proposition 12.0.48. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph. Then 2717
following statements hold; 2718

(i) if s ≥ t + 2 and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 2719

SuperHyperTrace-Decomposition, then S is an s-SuperHyperPowerful SuperHyperTrace- 2720

Decomposition; 2721

(ii) if s ≤ t and a SuperHyperSet S of SuperHyperVertices is a dual t-SuperHyperDefensive 2722

SuperHyperTrace-Decomposition, then S is a dual s-SuperHyperPowerful SuperHyperTrace- 2723
Decomposition. 2724

Proposition 12.0.49. Let ESHG : (V, E) be a[an] [V-]SuperHyperUniform-strong-Extreme 2725

SuperHyperGraph. Then following statements hold; 2726

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

SuperHyperTrace-Decomposition; 2728

Henry Garrett · 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 2729
SuperHyperTrace-Decomposition; 2730

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

SuperHyperTrace-Decomposition; 2732

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

SuperHyperTrace-Decomposition. 2734

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

SuperHyperGraph. Then following statements hold; 2736

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

SuperHyperTrace-Decomposition; 2738

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

SuperHyperTrace-Decomposition; 2740

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

SuperHyperTrace-Decomposition; 2742

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

SuperHyperTrace-Decomposition. 2744

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

SuperHyperGraph which is a SuperHyperComplete. Then following statements hold; 2746

(i) ∀a ∈ S, |Ns (a) ∩ S| < b O−1

2 c + 1 if ESHG : (V, E) is an 2-SuperHyperDefensive 2747
SuperHyperTrace-Decomposition; 2748

(ii) ∀a ∈ V \ S, |Ns (a) ∩ S| > b O−1

2 c + 1 if ESHG : (V, E) is a dual 2-SuperHyperDefensive 2749
SuperHyperTrace-Decomposition; 2750

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

SuperHyperTrace-Decomposition; 2752

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

SuperHyperTrace-Decomposition. 2754

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

SuperHyperGraph which is a SuperHyperComplete. Then following statements hold; 2756

(i) if ∀a ∈ S, |Ns (a) ∩ S| < b O−1

2 c
+ 1, then ESHG : (V, E) is an 2-SuperHyperDefensive 2757

SuperHyperTrace-Decomposition; 2758

(ii) if ∀a ∈ V \ S, |Ns (a) ∩ S| > b O−1 2 c + 1, then ESHG : (V, E) is a dual 2- 2759
SuperHyperDefensive SuperHyperTrace-Decomposition; 2760

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

SuperHyperTrace-Decomposition; 2762

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

SuperHyperDefensive SuperHyperTrace-Decomposition. 2764

Henry Garrett · 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.53. Let ESHG : (V, E) is a[an] [V-]SuperHyperUniform-strong-Extreme 2765

SuperHyperGraph which is SuperHyperTrace-Decomposition. Then following statements hold; 2766

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

Decomposition; 2768

(ii) ∀a ∈ V \ S, |Ns (a) ∩ S| > 2 if ESHG : (V, E) is a dual 2-SuperHyperDefensive 2769

SuperHyperTrace-Decomposition; 2770

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

SuperHyperTrace-Decomposition; 2772

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

SuperHyperTrace-Decomposition. 2774

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

SuperHyperGraph which is SuperHyperTrace-Decomposition. Then following statements hold; 2776

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

SuperHyperTrace-Decomposition; 2778

(ii) if ∀a ∈ V \ S, |Ns (a) ∩ S| > 2, then ESHG : (V, E) is a dual 2-SuperHyperDefensive 2779
SuperHyperTrace-Decomposition; 2780

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

SuperHyperTrace-Decomposition; 2782

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

SuperHyperTrace-Decomposition. 2784

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 CHAPTER 13 2785

Extreme Applications in Cancer’s 2786

Extreme Recognition 2787

The cancer is the Extreme disease but the Extreme model is going to figure out what’s going on 2788
this Extreme phenomenon. The special Extreme case of this Extreme disease is considered and 2789
as the consequences of the model, some parameters are used. The cells are under attack of this 2790

disease but the moves of the cancer in the special region are the matter of mind. The Extreme 2791
recognition of the cancer could help to find some Extreme treatments for this Extreme disease. 2792
In the following, some Extreme steps are Extreme devised on this disease. 2793

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

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

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

Step 3. (Extreme Model) There are some specific Extreme models, which are well-known and 2803
they’ve got the names, and some general Extreme models. The moves and the Extreme 2804
traces of the cancer on the complex tracks and between complicated groups of cells 2805
could be fantasized by an Extreme SuperHyperPath(-/SuperHyperTrace-Decomposition, 2806
SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The 2807
aim is to find either the Extreme SuperHyperTrace-Decomposition or the Extreme 2808

SuperHyperTrace-Decomposition in those Extreme Extreme SuperHyperModels. 2809

131
 CHAPTER 14 2810

Case 1: The Initial Extreme Steps 2811

Toward Extreme SuperHyperBipartite 2812

as Extreme SuperHyperModel 2813

Step 4. (Extreme Solution) In the Extreme Figure (34.1), the Extreme SuperHyperBipartite 2814
is Extreme highlighted and Extreme featured. 2815

By using the Extreme Figure (34.1) and the Table (34.1), the Extreme SuperHyperBi- 2816
partite is obtained. 2817
The obtained Extreme SuperHyperSet, by the Extreme Algorithm in previous Extreme 2818

Figure 14.1: an Extreme SuperHyperBipartite Associated to the Notions of Extreme

SuperHyperTrace-Decomposition 136NSHGaa21aa

133
 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

result, of the Extreme SuperHyperVertices of the connected Extreme SuperHyperBi- 2819

partite ESHB : (V, E), in the Extreme SuperHyperModel (34.1), is the Extreme 2820
SuperHyperTrace-Decomposition. 2821

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 CHAPTER 15 2822

Case 2: The Increasing Extreme Steps 2823

Toward Extreme 2824

SuperHyperMultipartite as Extreme 2825

SuperHyperModel 2826

Step 4. (Extreme Solution) In the Extreme Figure (35.1), the Extreme SuperHyperMultipart- 2827
ite is Extreme highlighted and Extreme featured. 2828

By using the Extreme Figure (35.1) and the Table (35.1), the Extreme SuperHyperMulti- 2829
partite is obtained. 2830
The obtained Extreme SuperHyperSet, by the Extreme Algorithm in previous res- 2831

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

SuperHyperTrace-Decomposition 136NSHGaa22aa

135
 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

ult, of the Extreme SuperHyperVertices of the connected Extreme SuperHyperMul- 2832

tipartite ESHM : (V, E), in the Extreme SuperHyperModel (35.1), is the Extreme 2833
SuperHyperTrace-Decomposition. 2834

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 CHAPTER 16 2835

Wondering Open Problems But As The 2836

Directions To Forming The Motivations 2837

In what follows, some “problems” and some “questions” are proposed. 2838
The SuperHyperTrace-Decomposition and the Extreme SuperHyperTrace-Decomposition are 2839
defined on a real-world application, titled “Cancer’s Recognitions”. 2840

Question 16.0.1. Which the else SuperHyperModels could be defined based on Cancer’s 2841
recognitions? 2842

Question 16.0.2. Are there some SuperHyperNotions related to SuperHyperTrace-Decomposition 2843

and the Extreme SuperHyperTrace-Decomposition? 2844

Question 16.0.3. Are there some Algorithms to be defined on the SuperHyperModels to compute 2845
them? 2846

Question 16.0.4. Which the SuperHyperNotions are related to beyond the SuperHyperTrace- 2847
Decomposition and the Extreme SuperHyperTrace-Decomposition? 2848

Problem 16.0.5. The SuperHyperTrace-Decomposition and the Extreme SuperHyperTrace- 2849

Decomposition do a SuperHyperModel for the Cancer’s recognitions and they’re based on 2850
SuperHyperTrace-Decomposition, are there else? 2851

Problem 16.0.6. Which the fundamental SuperHyperNumbers are related to these SuperHyper- 2852
Numbers types-results? 2853

Problem 16.0.7. What’s the independent research based on Cancer’s recognitions concerning 2854
the multiple types of SuperHyperNotions? 2855

137
 CHAPTER 17 2856

Conclusion and Closing Remarks 2857

In this section, concluding remarks and closing remarks are represented. The drawbacks of this 2858

research are illustrated. Some benefits and some advantages of this research are highlighted. 2859
This research uses some approaches to make Extreme SuperHyperGraphs more understandable. 2860
In this endeavor, two SuperHyperNotions are defined on the SuperHyperTrace-Decomposition. 2861
For that sake in the second definition, the main definition of the Extreme SuperHyperGraph 2862
is redefined on the position of the alphabets. Based on the new definition for the Extreme 2863
SuperHyperGraph, the new SuperHyperNotion, Extreme SuperHyperTrace-Decomposition, finds 2864

the convenient background to implement some results based on that. Some SuperHyperClasses 2865
and some Extreme SuperHyperClasses are the cases of this research on the modeling of the regions 2866
where are under the attacks of the cancer to recognize this disease as it’s mentioned on the title 2867
“Cancer’s Recognitions”. To formalize the instances on the SuperHyperNotion, SuperHyperTrace- 2868
Decomposition, the new SuperHyperClasses and SuperHyperClasses, are introduced. Some 2869
general results are gathered in the section on the SuperHyperTrace-Decomposition and the 2870

Extreme SuperHyperTrace-Decomposition. The clarifications, instances and literature reviews 2871

have taken the whole way through. In this research, the literature reviews have fulfilled the lines 2872
containing the notions and the results. The SuperHyperGraph and Extreme SuperHyperGraph 2873
are the SuperHyperModels on the “Cancer’s Recognitions” and both bases are the background of 2874
this research. Sometimes the cancer has been happened on the region, full of cells, groups of cells 2875
and embedded styles. In this segment, the SuperHyperModel proposes some SuperHyperNotions 2876

based on the connectivities of the moves of the cancer in the longest and strongest styles 2877
with the formation of the design and the architecture are formally called “ SuperHyperTrace- 2878
Decomposition” in the themes of jargons and buzzwords. The prefix “SuperHyper” refers to the 2879
theme of the embedded styles to figure out the background for the SuperHyperNotions. In the 2880
Table (37.1), benefits and avenues for this research are, figured out, pointed out and spoken out. 2881

139
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. SuperHyperTrace-Decomposition

3. Extreme SuperHyperTrace-Decomposition 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 2882

Extreme SuperHyperDuality But As The 2883

Extensions Excerpt From Dense And 2884

Super Forms 2885

Definition 18.0.1. (Different Extreme Types of Extreme SuperHyperDuality). 2886

Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider an Extreme 2887
SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and E 0 = {E1 , E2 , . . . , Ez }. Then either V 0 or E 0 is called 2888

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

Va ∈ Ei , Ej ; 2890

(ii) Extreme re-SuperHyperDuality if ∀Ei ∈ E 0 , ∃Ej ∈ EESHG:(V,E) \ E 0 such that 2891

Va ∈ Ei , Ej and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 2892

(iii) Extreme v-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 2893

Vi , Vj ∈ Ea ; 2894

(iv) Extreme rv-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 2895

Vi , Vj ∈ Ea and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; 2896

(v) Extreme SuperHyperDuality if it’s either of Extreme e-SuperHyperDuality, 2897

Extreme re-SuperHyperDuality, Extreme v-SuperHyperDuality, and Extreme rv- 2898

SuperHyperDuality. 2899

Definition 18.0.2. ((Extreme) SuperHyperDuality). 2900

Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider an Extreme 2901
SuperHyperEdge (NSHE) E = {V1 , V2 , . . . , Vs }. Then E is called 2902

(i) an Extreme SuperHyperDuality if it’s either of Extreme e-SuperHyperDuality, 2903

Extreme re-SuperHyperDuality, Extreme v-SuperHyperDuality, and Extreme rv- 2904
SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 2905
is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Extreme 2906
cardinality of the Extreme SuperHyperEdges in the conseNeighborive Extreme sequence 2907
of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 2908

Extreme SuperHyperDuality; 2909

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

re-SuperHyperDuality, Extreme v-SuperHyperDuality, and Extreme rv-SuperHyperDuality 2911
and C(N SHG) for a Extreme SuperHyperGraph N SHG : (V, E) is the maximum 2912
Extreme cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S 2913
of high Extreme cardinality conseNeighborive Extreme SuperHyperEdges and Extreme 2914
SuperHyperVertices such that they form the Extreme SuperHyperDuality; 2915

(iii) an Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of Extreme 2916

e-SuperHyperDuality, Extreme re-SuperHyperDuality, Extreme v-SuperHyperDuality, 2917

and Extreme rv-SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph 2918
N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients 2919
defined as the Extreme number of the maximum Extreme cardinality of the Extreme 2920
SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme cardinality conseNeigh- 2921
borive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form 2922
the Extreme SuperHyperDuality; and the Extreme power is corresponded to its Extreme 2923

coefficient; 2924

(iv) a Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of Extreme 2925

e-SuperHyperDuality, Extreme re-SuperHyperDuality, Extreme v-SuperHyperDuality, 2926

and Extreme rv-SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph 2927
N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients 2928
defined as the Extreme number of the maximum Extreme cardinality of the Extreme 2929
SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme cardinality conseNeigh- 2930
borive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form 2931
the Extreme SuperHyperDuality; and the Extreme power is corresponded to its Extreme 2932

coefficient; 2933

(v) an Extreme R-SuperHyperDuality if it’s either of Extreme e-SuperHyperDuality, 2934

Extreme re-SuperHyperDuality, Extreme v-SuperHyperDuality, and Extreme rv- 2935

SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 2936
is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Extreme 2937
cardinality of the Extreme SuperHyperVertices in the conseNeighborive Extreme sequence 2938
of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 2939
Extreme SuperHyperDuality; 2940

(vi) a Extreme R-SuperHyperDuality if it’s either of Extreme e-SuperHyperDuality, 2941

Extreme re-SuperHyperDuality, Extreme v-SuperHyperDuality, and Extreme rv- 2942
SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is 2943

the maximum Extreme cardinality of the Extreme SuperHyperVertices of an Extreme Su- 2944
perHyperSet S of high Extreme cardinality conseNeighborive Extreme SuperHyperEdges 2945
and Extreme SuperHyperVertices such that they form the Extreme SuperHyperDuality; 2946

(vii) an Extreme R-SuperHyperDuality SuperHyperPolynomial if it’s either 2947

of Extreme e-SuperHyperDuality, Extreme re-SuperHyperDuality, Extreme v- 2948
SuperHyperDuality, and Extreme rv-SuperHyperDuality and C(N SHG) for an Extreme 2949
SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the 2950
Extreme coefficients defined as the Extreme number of the maximum Extreme cardinality 2951

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

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

tices such that they form the Extreme SuperHyperDuality; and the Extreme power is 2954
corresponded to its Extreme coefficient; 2955

(viii) a Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of Extreme 2956

e-SuperHyperDuality, Extreme re-SuperHyperDuality, Extreme v-SuperHyperDuality, 2957

and Extreme rv-SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph 2958
N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients 2959
defined as the Extreme number of the maximum Extreme cardinality of the Extreme 2960
SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality 2961
conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVertices such 2962

that they form the Extreme SuperHyperDuality; and the Extreme power is corresponded 2963
to its Extreme coefficient. 2964

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

• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperDu- 2967
ality, is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are some 2968
empty Extreme SuperHyperEdges but E2 is a loop Extreme SuperHyperEdge and E4 is 2969
an Extreme SuperHyperEdge. Thus in the terms of Extreme SuperHyperNeighbor, there’s 2970
only one Extreme SuperHyperEdge, namely, E4 . The Extreme SuperHyperVertex, V3 is 2971

Extreme isolated means that there’s no Extreme SuperHyperEdge has it as an Extreme 2972
endpoint. Thus the Extreme SuperHyperVertex, V3 , is excluded in every given Extreme 2973
SuperHyperDuality. 2974

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- 2975
Duality, is up. The Extreme Algorithm is Extremely straightforward. E1 , E2 and E3 2976
are some empty Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. 2977

Thus in the terms of Extreme SuperHyperNeighbor, there’s only one Extreme SuperHy- 2978
perEdge, namely, E4 . The Extreme SuperHyperVertex, V3 is Extreme isolated means that 2979
there’s no Extreme SuperHyperEdge has it as an Extreme endpoint. Thus the Extreme 2980
SuperHyperVertex, V3 , is excluded in every given Extreme SuperHyperDuality. 2981

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- 2982
ality, is up. The Extreme Algorithm is Extremely straightforward. 2983

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- 2984
ality, is up. The Extreme Algorithm is Extremely straightforward. 2985

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- 2986
ality, is up. The Extreme Algorithm is Extremely straightforward. 2987

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- 2988
ality, is up. The Extreme Algorithm is Extremely straightforward. 2989

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

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

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

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

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- 2994
ality, is up. The Extreme Algorithm is Extremely straightforward. 2995

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- 2996
ality, is up. The Extreme Algorithm is Extremely straightforward. 2997

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- 2998
ality, is up. The Extreme Algorithm is Extremely straightforward. 2999

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- 3000
ality, is up. The Extreme Algorithm is Extremely straightforward. 3001

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- 3002
ality, is up. The Extreme Algorithm is Extremely straightforward. 3003

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- 3004
ality, is up. The Extreme Algorithm is Extremely straightforward. 3005

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- 3006
ality, is up. The Extreme Algorithm is Extremely straightforward. 3007

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- 3008
ality, is up. The Extreme Algorithm is Extremely straightforward. 3009

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- 3010
ality, is up. The Extreme Algorithm is Extremely straightforward. 3011

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- 3012
ality, is up. The Extreme Algorithm is Extremely straightforward. 3013

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- 3014
ality, is up. The Extreme Algorithm is Extremely straightforward. 3015

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- 3016
ality, is up. The Extreme Algorithm is Extremely straightforward. 3017

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

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

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- 3020
ality, is up. The Extreme Algorithm is Extremely straightforward. 3021

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 3022

SuperHyperClasses. 3023

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

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 3025

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 3026
new way to redefine as 3027

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 3028
ViEXT ERN AL in the literatures of SuperHyperDuality. The latter is straightforward.  3029

136EXM18a Example 18.0.5. In the Figure (31.1), the connected Extreme SuperHyperPath ESHP : (V, E), 3030
is highlighted and featured. The Extreme SuperHyperSet, in the Extreme SuperHyperModel 3031
(31.1), is the SuperHyperDuality. 3032

Proposition 18.0.6. Assume a connected Extreme SuperHyperCycle ESHC : (V, E). Then 3033

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 3034

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 3035

new way to redefine as 3036

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 3037
ViEXT ERN AL in the literatures of SuperHyperDuality. The latter is straightforward.  3038

136EXM19a Example 18.0.7. In the Figure (31.2), the connected Extreme SuperHyperCycle N SHC : 3039
(V, E), is highlighted and featured. The obtained Extreme SuperHyperSet, in the Extreme 3040
SuperHyperModel (31.2), is the Extreme SuperHyperDuality. 3041

Proposition 18.0.8. Assume a connected Extreme SuperHyperStar ESHS : (V, E). Then 3042

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 3043

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 3044
way to redefine as 3045

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 3046

ViEXT ERN AL in the literatures of SuperHyperDuality. The latter is straightforward.  3047

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

136EXM20a Example 18.0.9. In the Figure (31.3), the connected Extreme SuperHyperStar ESHS : (V, E), 3048
is highlighted and featured. The obtained Extreme SuperHyperSet, by the Algorithm in previous 3049
Extreme result, of the Extreme SuperHyperVertices of the connected Extreme SuperHyperStar 3050
ESHS : (V, E), in the Extreme SuperHyperModel (31.3), is the Extreme SuperHyperDuality. 3051

Proposition 18.0.10. Assume a connected Extreme SuperHyperBipartite ESHB : (V, E). Then 3052

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 3053

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 3054
a new way to redefine as 3055

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 3056
to ViEXT ERN AL in the literatures of SuperHyperDuality. The latter is straightforward. 3057
Then there’s at least one SuperHyperDuality. Thus the notion of quasi isn’t up and the 3058

SuperHyperNotions based on SuperHyperDuality could be applied. There are only two 3059
SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as the 3060
representative in the 3061

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

(V, E). Thus only some SuperHyperVertices and only minimum-Extreme-of-SuperHyperPart 3063

SuperHyperEdges are attained in any solution 3064

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

136EXM21a Example 18.0.11. In the Extreme Figure (31.4), the connected Extreme SuperHyperBipartite 3066

ESHB : (V, E), is Extreme highlighted and Extreme featured. The obtained Extreme 3067
SuperHyperSet, by the Extreme Algorithm in previous Extreme result, of the Extreme 3068
SuperHyperVertices of the connected Extreme SuperHyperBipartite ESHB : (V, E), in the 3069
Extreme SuperHyperModel (31.4), is the Extreme SuperHyperDuality. 3070

Proposition 18.0.12. Assume a connected Extreme SuperHyperMultipartite ESHM : (V, E). 3071
Then 3072

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 3073

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 3074

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

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 3076
to ViEXT ERN AL in the literatures of SuperHyperDuality. The latter is straightforward. 3077
Then there’s at least one SuperHyperDuality. Thus the notion of quasi isn’t up and 3078
the SuperHyperNotions based on SuperHyperDuality could be applied. There are only z 0 3079

SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as the 3080
representative in the 3081

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

(V, E). Thus only some SuperHyperVertices and only minimum-Extreme-of-SuperHyperPart 3083
SuperHyperEdges are attained in any solution 3084

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). 3085
The latter is straightforward.  3086

136EXM22a Example 18.0.13. In the Figure (31.5), the connected Extreme SuperHyperMultipartite 3087
ESHM : (V, E), is highlighted and Extreme featured. The obtained Extreme SuperHyperSet, by 3088

the Algorithm in previous Extreme result, of the Extreme SuperHyperVertices of the connected 3089
Extreme SuperHyperMultipartite ESHM : (V, E), in the Extreme SuperHyperModel (31.5), is 3090
the Extreme SuperHyperDuality. 3091

Proposition 18.0.14. Assume a connected Extreme SuperHyperWheel ESHW : (V, E). Then, 3092

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 3093

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

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

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 3096

to ViEXT ERN AL in the literatures of SuperHyperDuality. The latter is straightforward. 3097

Then there’s at least one SuperHyperDuality. Thus the notion of quasi isn’t up and the 3098
SuperHyperNotions based on SuperHyperDuality could be applied. The unique embedded 3099
SuperHyperDuality proposes some longest SuperHyperDuality excerpt from some representatives. 3100
The latter is straightforward.  3101

136EXM23a Example 18.0.15. In the Extreme Figure (31.6), the connected Extreme SuperHyperWheel 3102
N SHW : (V, E), is Extreme highlighted and featured. The obtained Extreme SuperHyperSet, 3103
by the Algorithm in previous result, of the Extreme SuperHyperVertices of the connected 3104

Extreme SuperHyperWheel ESHW : (V, E), in the Extreme SuperHyperModel (31.6), is the 3105
Extreme SuperHyperDuality. 3106

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 CHAPTER 19 3107

Extreme SuperHyperJoin But As The 3108

Extensions Excerpt From Dense And 3109

Super Forms 3110

Definition 19.0.1. (Different Extreme Types of Extreme SuperHyperJoin). 3111

Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider an Extreme 3112
SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and E 0 = {E1 , E2 , . . . , Ez }. Then either V 0 or E 0 is called 3113

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

Va ∈ Ei , Ej ; and ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; 3115

(ii) Extreme re-SuperHyperJoin if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such that 3116

Va ∈ Ei , Ej ; ∀Ei , Ej ∈ E 0 , such that Va ∈

6 Ei , Ej ; and |Ei |NEUTROSOPIC CARDINALITY = 3117
|Ej |NEUTROSOPIC CARDINALITY ; 3118

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

Vi , Vj 6∈ Ea ; and ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; 3120

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

Vi , Vj ∈ Ea ; ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; and |Vi |NEUTROSOPIC CARDINALITY = 3122
|Vj |NEUTROSOPIC CARDINALITY ; 3123

(v) Extreme SuperHyperJoin if it’s either of Extreme e-SuperHyperJoin, Extreme re- 3124
SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme rv-SuperHyperJoin. 3125

Definition 19.0.2. ((Extreme) SuperHyperJoin). 3126

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

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

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

re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme rv-SuperHyperJoin and 3130
C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme 3131
cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme 3132
SuperHyperEdges in the conseNeighborive Extreme sequence of Extreme SuperHyperEdges 3133

and Extreme SuperHyperVertices such that they form the Extreme SuperHyperJoin; 3134

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

re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme rv-SuperHyperJoin and 3136
C(N SHG) for a Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme 3137
cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of 3138
high Extreme cardinality conseNeighborive Extreme SuperHyperEdges and Extreme 3139
SuperHyperVertices such that they form the Extreme SuperHyperJoin; 3140

(iii) an Extreme SuperHyperJoin SuperHyperPolynomial if it’s either of Extreme e- 3141

SuperHyperJoin, Extreme re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme 3142

rv-SuperHyperJoin and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3143
is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined as the 3144
Extreme number of the maximum Extreme cardinality of the Extreme SuperHyperEdges 3145
of an Extreme SuperHyperSet S of high Extreme cardinality conseNeighborive Extreme 3146
SuperHyperEdges and Extreme SuperHyperVertices such that they form the Extreme 3147
SuperHyperJoin; and the Extreme power is corresponded to its Extreme coefficient; 3148

(iv) a Extreme SuperHyperJoin SuperHyperPolynomial if it’s either of Extreme e- 3149

SuperHyperJoin, Extreme re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme 3150
rv-SuperHyperJoin and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3151

is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined as the 3152
Extreme number of the maximum Extreme cardinality of the Extreme SuperHyperEdges 3153
of an Extreme SuperHyperSet S of high Extreme cardinality conseNeighborive Extreme 3154
SuperHyperEdges and Extreme SuperHyperVertices such that they form the Extreme 3155
SuperHyperJoin; and the Extreme power is corresponded to its Extreme coefficient; 3156

(v) an Extreme R-SuperHyperJoin if it’s either of Extreme e-SuperHyperJoin, Extreme 3157

re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme rv-SuperHyperJoin and 3158
C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme 3159

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

Extreme SuperHyperVertices in the conseNeighborive Extreme sequence of Extreme 3161
SuperHyperEdges and Extreme SuperHyperVertices such that they form the Extreme 3162
SuperHyperJoin; 3163

(vi) a Extreme R-SuperHyperJoin if it’s either of Extreme e-SuperHyperJoin, Extreme 3164

re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme rv-SuperHyperJoin and 3165
C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme 3166
cardinality of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of 3167
high Extreme cardinality conseNeighborive Extreme SuperHyperEdges and Extreme 3168

SuperHyperVertices such that they form the Extreme SuperHyperJoin; 3169

(vii) an Extreme R-SuperHyperJoin SuperHyperPolynomial if it’s either of Extreme 3170

e-SuperHyperJoin, Extreme re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme 3171

rv-SuperHyperJoin and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3172
is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined as the 3173
Extreme number of the maximum Extreme cardinality of the Extreme SuperHyperVertices 3174
of an Extreme SuperHyperSet S of high Extreme cardinality conseNeighborive Extreme 3175
SuperHyperEdges and Extreme SuperHyperVertices such that they form the Extreme 3176

SuperHyperJoin; and the Extreme power is corresponded to its Extreme coefficient; 3177

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

SuperHyperJoin, Extreme re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme 3179
rv-SuperHyperJoin and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3180
is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined as the 3181
Extreme number of the maximum Extreme cardinality of the Extreme SuperHyperVertices 3182
of an Extreme SuperHyperSet S of high Extreme cardinality conseNeighborive Extreme 3183

SuperHyperEdges and Extreme SuperHyperVertices such that they form the Extreme 3184
SuperHyperJoin; and the Extreme power is corresponded to its Extreme coefficient. 3185

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

• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperJoin, 3188
is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are some empty 3189
Extreme SuperHyperEdges but E2 is a loop Extreme SuperHyperEdge and E4 is an 3190
Extreme SuperHyperEdge. Thus in the terms of Extreme SuperHyperNeighbor, there’s 3191

only one Extreme SuperHyperEdge, namely, E4 . The Extreme SuperHyperVertex, V3 is 3192

Extreme isolated means that there’s no Extreme SuperHyperEdge has it as an Extreme 3193
endpoint. Thus the Extreme SuperHyperVertex, V3 , is excluded in every given Extreme 3194
SuperHyperJoin. 3195

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, 3196
is up. The Extreme Algorithm is Extremely straightforward. E1 , E2 and E3 are some empty 3197
Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. Thus in the terms of 3198
Extreme SuperHyperNeighbor, there’s only one Extreme SuperHyperEdge, namely, E4 . 3199
The Extreme SuperHyperVertex, V3 is Extreme isolated means that there’s no Extreme 3200
SuperHyperEdge has it as an Extreme endpoint. Thus the Extreme SuperHyperVertex, 3201

V3 , is excluded in every given Extreme SuperHyperJoin. 3202

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, 3203
is up. The Extreme Algorithm is Extremely straightforward. 3204

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, 3205
is up. The Extreme Algorithm is Extremely straightforward. 3206

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, 3207
is up. The Extreme Algorithm is Extremely straightforward. 3208

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, 3209
is up. The Extreme Algorithm is Extremely straightforward. 3210

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, 3211
is up. The Extreme Algorithm is Extremely straightforward. 3212

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, 3213
is up. The Extreme Algorithm is Extremely straightforward. 3214

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, 3215
is up. The Extreme Algorithm is Extremely straightforward. 3216

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, 3217
is up. The Extreme Algorithm is Extremely straightforward. 3218

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, 3219
is up. The Extreme Algorithm is Extremely straightforward. 3220

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

is up. The Extreme Algorithm is Extremely straightforward. 3222

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, 3223
is up. The Extreme Algorithm is Extremely straightforward. 3224

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, 3225
is up. The Extreme Algorithm is Extremely straightforward. 3226

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, 3227
is up. The Extreme Algorithm is Extremely straightforward. 3228

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, 3229
is up. The Extreme Algorithm is Extremely straightforward. 3230

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, 3231
is up. The Extreme Algorithm is Extremely straightforward. 3232

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, 3233
is up. The Extreme Algorithm is Extremely straightforward. 3234

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, 3235
is up. The Extreme Algorithm is Extremely straightforward. 3236

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, 3237
is up. The Extreme Algorithm is Extremely straightforward. 3238

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, 3239
is up. The Extreme Algorithm is Extremely straightforward. 3240

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, 3241
is up. The Extreme Algorithm is Extremely straightforward. 3242

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 3243
SuperHyperClasses. 3244

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

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 3246

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 3247
new way to redefine as 3248

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 3249
ViEXT ERN AL in the literatures of SuperHyperJoin. The latter is straightforward.  3250

136EXM18a Example 19.0.5. In the Figure (31.1), the connected Extreme SuperHyperPath ESHP : (V, E), 3251
is highlighted and featured. The Extreme SuperHyperSet, in the Extreme SuperHyperModel 3252
(31.1), is the SuperHyperJoin. 3253

Proposition 19.0.6. Assume a connected Extreme SuperHyperCycle ESHC : (V, E). Then 3254

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 3255

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 3256

new way to redefine as 3257

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 3258
ViEXT ERN AL in the literatures of SuperHyperJoin. The latter is straightforward.  3259

136EXM19a Example 19.0.7. In the Figure (31.2), the connected Extreme SuperHyperCycle N SHC : 3260
(V, E), is highlighted and featured. The obtained Extreme SuperHyperSet, in the Extreme 3261
SuperHyperModel (31.2), is the Extreme SuperHyperJoin. 3262

Proposition 19.0.8. Assume a connected Extreme SuperHyperStar ESHS : (V, E). Then 3263

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 3264

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 3265
way to redefine as 3266

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 3267

ViEXT ERN AL in the literatures of SuperHyperJoin. The latter is straightforward.  3268

Henry Garrett · 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), 3269
is highlighted and featured. The obtained Extreme SuperHyperSet, by the Algorithm in previous 3270
Extreme result, of the Extreme SuperHyperVertices of the connected Extreme SuperHyperStar 3271
ESHS : (V, E), in the Extreme SuperHyperModel (31.3), is the Extreme SuperHyperJoin. 3272

Proposition 19.0.10. Assume a connected Extreme SuperHyperBipartite ESHB : (V, E). Then 3273

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 3274

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 3275

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

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 3277
ViEXT ERN AL in the literatures of SuperHyperJoin. The latter is straightforward. Then there’s 3278
no at least one SuperHyperJoin. Thus the notion of quasi may be up but the SuperHyperNotions 3279

based on SuperHyperJoin could be applied. There are only two SuperHyperParts. Thus every 3280
SuperHyperPart could have one SuperHyperVertex as the representative in the 3281

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

(V, E). Thus only some SuperHyperVertices and only minimum-Extreme-of-SuperHyperPart 3283
SuperHyperEdges are attained in any solution 3284

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

136EXM21a Example 19.0.11. In the Extreme Figure (31.4), the connected Extreme SuperHyperBipartite 3286
ESHB : (V, E), is Extreme highlighted and Extreme featured. The obtained Extreme 3287
SuperHyperSet, by the Extreme Algorithm in previous Extreme result, of the Extreme 3288
SuperHyperVertices of the connected Extreme SuperHyperBipartite ESHB : (V, E), in the 3289

Extreme SuperHyperModel (31.4), is the Extreme SuperHyperJoin. 3290

Proposition 19.0.12. Assume a connected Extreme SuperHyperMultipartite ESHM : (V, E). 3291
Then 3292

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 3293

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

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

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 3296
ViEXT ERN AL in the literatures of SuperHyperJoin. The latter is straightforward. Then there’s 3297

no at least one SuperHyperJoin. Thus the notion of quasi may be up but the SuperHyperNotions 3298
based on SuperHyperJoin could be applied. There are only z 0 SuperHyperParts. Thus every 3299
SuperHyperPart could have one SuperHyperVertex as the representative in the 3300

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

(V, E). Thus only some SuperHyperVertices and only minimum-Extreme-of-SuperHyperPart 3302
SuperHyperEdges are attained in any solution 3303

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). 3304
The latter is straightforward.  3305

136EXM22a Example 19.0.13. In the Figure (31.5), the connected Extreme SuperHyperMultipartite 3306
ESHM : (V, E), is highlighted and Extreme featured. The obtained Extreme SuperHyperSet, by 3307

the Algorithm in previous Extreme result, of the Extreme SuperHyperVertices of the connected 3308
Extreme SuperHyperMultipartite ESHM : (V, E), in the Extreme SuperHyperModel (31.5), is 3309
the Extreme SuperHyperJoin. 3310

Proposition 19.0.14. Assume a connected Extreme SuperHyperWheel ESHW : (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

Henry Garrett · 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). 3313
There’s a 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. Then there’s 3316

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

136EXM23a Example 19.0.15. In the Extreme Figure (31.6), the connected Extreme SuperHyperWheel 3320
N SHW : (V, E), is Extreme highlighted and featured. The obtained Extreme SuperHyperSet, 3321
by the Algorithm in previous result, of the Extreme SuperHyperVertices of the connected 3322
Extreme SuperHyperWheel ESHW : (V, E), in the Extreme SuperHyperModel (31.6), is the 3323
Extreme SuperHyperJoin. 3324

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 CHAPTER 20 3325

Extreme SuperHyperPerfect But As The 3326

Extensions Excerpt From Dense And 3327

Super Forms 3328

Definition 20.0.1. (Different Extreme Types of Extreme SuperHyperPerfect). 3329

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

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

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

Va ∈ Ei , Ej ; 3333

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

Va ∈ Ei , Ej ; and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 3335

(iii) Extreme v-SuperHyperPerfect if ∀Vi ∈ VESHG:(V,E) \ V 0 , ∃!Vj ∈ V 0 , such that 3336

Vi , Vj ∈ Ea ; 3337

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

Vi , Vj ∈ Ea ; and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; 3339

(v) Extreme SuperHyperPerfect if it’s either of Extreme e-SuperHyperPerfect, Extreme 3340

re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, and Extreme rv-SuperHyperPerfect. 3341

Definition 20.0.2. ((Extreme) SuperHyperPerfect). 3342

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

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

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

Extreme re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, and Extreme rv- 3346
SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3347
is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Extreme 3348
cardinality of the Extreme SuperHyperEdges in the conseNeighborive Extreme sequence 3349
of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 3350

Extreme SuperHyperPerfect; 3351

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

re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, and Extreme rv-SuperHyperPerfect 3353
and C(N SHG) for a Extreme SuperHyperGraph N SHG : (V, E) is the maximum 3354
Extreme cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S 3355
of high Extreme cardinality conseNeighborive Extreme SuperHyperEdges and Extreme 3356
SuperHyperVertices such that they form the Extreme SuperHyperPerfect; 3357

(iii) an Extreme SuperHyperPerfect SuperHyperPolynomial if it’s either of Extreme 3358

e-SuperHyperPerfect, Extreme re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, 3359

and Extreme rv-SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph 3360
N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients 3361
defined as the Extreme number of the maximum Extreme cardinality of the Extreme 3362
SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme cardinality conseNeigh- 3363
borive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form 3364
the Extreme SuperHyperPerfect; and the Extreme power is corresponded to its Extreme 3365

coefficient; 3366

(iv) a Extreme SuperHyperPerfect SuperHyperPolynomial if it’s either of Extreme 3367

e-SuperHyperPerfect, Extreme re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, 3368

and Extreme rv-SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph 3369
N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients 3370
defined as the Extreme number of the maximum Extreme cardinality of the Extreme 3371
SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme cardinality conseNeigh- 3372
borive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form 3373
the Extreme SuperHyperPerfect; and the Extreme power is corresponded to its Extreme 3374

coefficient; 3375

(v) an Extreme R-SuperHyperPerfect if it’s either of Extreme e-SuperHyperPerfect, 3376

Extreme re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, and Extreme rv- 3377

SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3378
is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Extreme 3379
cardinality of the Extreme SuperHyperVertices in the conseNeighborive Extreme sequence 3380
of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 3381
Extreme SuperHyperPerfect; 3382

(vi) a Extreme R-SuperHyperPerfect if it’s either of Extreme e-SuperHyperPerfect, 3383

Extreme re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, and Extreme rv- 3384
SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is 3385

the maximum Extreme cardinality of the Extreme SuperHyperVertices of an Extreme Su- 3386
perHyperSet S of high Extreme cardinality conseNeighborive Extreme SuperHyperEdges 3387
and Extreme SuperHyperVertices such that they form the Extreme SuperHyperPerfect; 3388

(vii) an Extreme R-SuperHyperPerfect SuperHyperPolynomial if it’s either 3389

of Extreme e-SuperHyperPerfect, Extreme re-SuperHyperPerfect, Extreme v- 3390
SuperHyperPerfect, and Extreme rv-SuperHyperPerfect and C(N SHG) for an Extreme 3391
SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the 3392
Extreme coefficients defined as the Extreme number of the maximum Extreme cardinality 3393

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

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

tices such that they form the Extreme SuperHyperPerfect; and the Extreme power is 3396
corresponded to its Extreme coefficient; 3397

(viii) a Extreme SuperHyperPerfect SuperHyperPolynomial if it’s either of Extreme 3398

e-SuperHyperPerfect, Extreme re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, 3399

and Extreme rv-SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph 3400
N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients 3401
defined as the Extreme number of the maximum Extreme cardinality of the Extreme 3402
SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality 3403
conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVertices such 3404

that they form the Extreme SuperHyperPerfect; and the Extreme power is corresponded 3405
to its Extreme coefficient. 3406

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

• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperPer- 3409
fect, is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are some 3410
empty Extreme SuperHyperEdges but E2 is a loop Extreme SuperHyperEdge and E4 is 3411
an Extreme SuperHyperEdge. Thus in the terms of Extreme SuperHyperNeighbor, there’s 3412
only one Extreme SuperHyperEdge, namely, E4 . The Extreme SuperHyperVertex, V3 is 3413

Extreme isolated means that there’s no Extreme SuperHyperEdge has it as an Extreme 3414
endpoint. Thus the Extreme SuperHyperVertex, V3 , is excluded in every given Extreme 3415
SuperHyperPerfect. 3416

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- 3417
Perfect, is up. The Extreme Algorithm is Extremely straightforward. E1 , E2 and E3 3418
are some empty Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. 3419

Thus in the terms of Extreme SuperHyperNeighbor, there’s only one Extreme SuperHy- 3420
perEdge, namely, E4 . The Extreme SuperHyperVertex, V3 is Extreme isolated means that 3421
there’s no Extreme SuperHyperEdge has it as an Extreme endpoint. Thus the Extreme 3422
SuperHyperVertex, V3 , is excluded in every given Extreme SuperHyperPerfect. 3423

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- 3424
fect, is up. The Extreme Algorithm is Extremely straightforward. 3425

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- 3426
fect, is up. The Extreme Algorithm is Extremely straightforward. 3427

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- 3428
fect, is up. The Extreme Algorithm is Extremely straightforward. 3429

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- 3430
fect, is up. The Extreme Algorithm is Extremely straightforward. 3431

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

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

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

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

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- 3436
fect, is up. The Extreme Algorithm is Extremely straightforward. 3437

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- 3438
fect, is up. The Extreme Algorithm is Extremely straightforward. 3439

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- 3440
fect, is up. The Extreme Algorithm is Extremely straightforward. 3441

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- 3442
fect, is up. The Extreme Algorithm is Extremely straightforward. 3443

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- 3444
fect, is up. The Extreme Algorithm is Extremely straightforward. 3445

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- 3446
fect, is up. The Extreme Algorithm is Extremely straightforward. 3447

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- 3448
fect, is up. The Extreme Algorithm is Extremely straightforward. 3449

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- 3450
fect, is up. The Extreme Algorithm is Extremely straightforward. 3451

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- 3452
fect, is up. The Extreme Algorithm is Extremely straightforward. 3453

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- 3454
fect, is up. The Extreme Algorithm is Extremely straightforward. 3455

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- 3456
fect, is up. The Extreme Algorithm is Extremely straightforward. 3457

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- 3458
fect, is up. The Extreme Algorithm is Extremely straightforward. 3459

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

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

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- 3462
fect, is up. The Extreme Algorithm is Extremely straightforward. 3463

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 3464

SuperHyperClasses. 3465

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

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 3467

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 3468
new way to redefine as 3469

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 3470
ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is straightforward.  3471

136EXM18a Example 20.0.5. In the Figure (31.1), the connected Extreme SuperHyperPath ESHP : (V, E), 3472
is highlighted and featured. The Extreme SuperHyperSet, in the Extreme SuperHyperModel 3473
(31.1), is the SuperHyperPerfect. 3474

Proposition 20.0.6. Assume a connected Extreme SuperHyperCycle ESHC : (V, E). Then 3475

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 3476

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 3477

new way to redefine as 3478

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 3479
ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is straightforward.  3480

136EXM19a Example 20.0.7. In the Figure (31.2), the connected Extreme SuperHyperCycle N SHC : 3481
(V, E), is highlighted and featured. The obtained Extreme SuperHyperSet, in the Extreme 3482
SuperHyperModel (31.2), is the Extreme SuperHyperPerfect. 3483

Proposition 20.0.8. Assume a connected Extreme SuperHyperStar ESHS : (V, E). Then 3484

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 3485

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 3486
way to redefine as 3487

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 3488

ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is straightforward.  3489

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

136EXM20a Example 20.0.9. In the Figure (31.3), the connected Extreme SuperHyperStar ESHS : (V, E), 3490
is highlighted and featured. The obtained Extreme SuperHyperSet, by the Algorithm in previous 3491
Extreme result, of the Extreme SuperHyperVertices of the connected Extreme SuperHyperStar 3492
ESHS : (V, E), in the Extreme SuperHyperModel (31.3), is the Extreme SuperHyperPerfect. 3493

Proposition 20.0.10. Assume a connected Extreme SuperHyperBipartite ESHB : (V, E). Then 3494

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 3495

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 3496

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

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 3498

ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is straightforward. Then 3499
there’s no at least one SuperHyperPerfect. Thus the notion of quasi may be up but the 3500
SuperHyperNotions based on SuperHyperPerfect could be applied. There are only two 3501
SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as the 3502
representative in the 3503

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

(V, E). Thus only some SuperHyperVertices and only minimum-Extreme-of-SuperHyperPart 3505
SuperHyperEdges are attained in any solution 3506

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

136EXM21a Example 20.0.11. In the Extreme Figure (31.4), the connected Extreme SuperHyperBipartite 3508
ESHB : (V, E), is Extreme highlighted and Extreme featured. The obtained Extreme 3509
SuperHyperSet, by the Extreme Algorithm in previous Extreme result, of the Extreme 3510
SuperHyperVertices of the connected Extreme SuperHyperBipartite ESHB : (V, E), in the 3511
Extreme SuperHyperModel (31.4), is the Extreme SuperHyperPerfect. 3512

Proposition 20.0.12. Assume a connected Extreme SuperHyperMultipartite ESHM : (V, E). 3513

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

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 3515

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 3516

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

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 3518
to ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is straightforward. 3519
Then there’s no at least one SuperHyperPerfect. Thus the notion of quasi may be up but 3520
the SuperHyperNotions based on SuperHyperPerfect could be applied. There are only z 0 3521
SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as the 3522
representative in the 3523

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

(V, E). Thus only some SuperHyperVertices and only minimum-Extreme-of-SuperHyperPart 3525
SuperHyperEdges are attained in any solution 3526

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). 3527
The latter is straightforward.  3528

136EXM22a Example 20.0.13. In the Figure (31.5), the connected Extreme SuperHyperMultipartite 3529
ESHM : (V, E), is highlighted and Extreme featured. The obtained Extreme SuperHyperSet, by 3530
the Algorithm in previous Extreme result, of the Extreme SuperHyperVertices of the connected 3531
Extreme SuperHyperMultipartite ESHM : (V, E), in the Extreme SuperHyperModel (31.5), is 3532

the Extreme SuperHyperPerfect. 3533

Proposition 20.0.14. Assume a connected Extreme SuperHyperWheel ESHW : (V, E). Then, 3534

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 3535

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

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

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 3538
ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is straightforward. Then there’s 3539

at least one SuperHyperPerfect. Thus the notion of quasi isn’t up and the SuperHyperNotions 3540
based on SuperHyperPerfect could be applied. The unique embedded SuperHyperPerfect 3541
proposes some longest SuperHyperPerfect excerpt from some representatives. The latter is 3542
straightforward.  3543

136EXM23a Example 20.0.15. In the Extreme Figure (31.6), the connected Extreme SuperHyperWheel 3544
N SHW : (V, E), is Extreme highlighted and featured. The obtained Extreme SuperHyperSet, 3545
by the Algorithm in previous result, of the Extreme SuperHyperVertices of the connected 3546
Extreme SuperHyperWheel ESHW : (V, E), in the Extreme SuperHyperModel (31.6), is the 3547
Extreme SuperHyperPerfect. 3548

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 CHAPTER 21 3549

Extreme SuperHyperTotal But As The 3550

Extensions Excerpt From Dense And 3551

Super Forms 3552

Definition 21.0.1. (Different Extreme Types of Extreme SuperHyperTotal). 3553

Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider an Extreme 3554
SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and E 0 = {E1 , E2 , . . . , Ez }. Then either V 0 or E 0 is called 3555

(i) Extreme e-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that Va ∈ Ei , Ej ; 3556

(ii) Extreme re-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that Va ∈ 3557

Ei , Ej ; and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 3558

(iii) Extreme v-SuperHyperTotal if ∀Vi ∈ VESHG:(V,E) , ∃!Vj ∈ V 0 , such that Vi , Vj ∈ Ea ; 3559

(iv) Extreme rv-SuperHyperTotal if ∀Vi ∈ VESHG:(V,E) , ∃!Vj ∈ V 0 , such that Vi , Vj ∈ Ea ; 3560

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

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

re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Extreme rv-SuperHyperTotal. 3563

Definition 21.0.2. ((Extreme) SuperHyperTotal). 3564

Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider an Extreme 3565
SuperHyperEdge (NSHE) E = {V1 , V2 , . . . , Vs }. Then E is called 3566

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

re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Extreme rv-SuperHyperTotal and 3568
C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme 3569
cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme 3570
SuperHyperEdges in the conseNeighborive Extreme sequence of Extreme SuperHyperEdges 3571

and Extreme SuperHyperVertices such that they form the Extreme SuperHyperTotal; 3572

(ii) a Extreme SuperHyperTotal if it’s either of Extreme e-SuperHyperTotal, Extreme 3573

re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Extreme rv-SuperHyperTotal 3574
and C(N SHG) for a Extreme SuperHyperGraph N SHG : (V, E) is the maximum 3575

Extreme cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S 3576

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

of high Extreme cardinality conseNeighborive Extreme SuperHyperEdges and Extreme 3577

SuperHyperVertices such that they form the Extreme SuperHyperTotal; 3578

(iii) an Extreme SuperHyperTotal SuperHyperPolynomial if it’s either of Extreme 3579

e-SuperHyperTotal, Extreme re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Ex- 3580
treme rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph N SHG : 3581
(V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined 3582
as the Extreme number of the maximum Extreme cardinality of the Extreme SuperHy- 3583
perEdges of an Extreme SuperHyperSet S of high Extreme cardinality conseNeighborive 3584

Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 3585
Extreme SuperHyperTotal; and the Extreme power is corresponded to its Extreme coeffi- 3586
cient; 3587

(iv) a Extreme SuperHyperTotal SuperHyperPolynomial if it’s either of Extreme e- 3588

SuperHyperTotal, Extreme re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Ex- 3589
treme rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph N SHG : 3590
(V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined 3591
as the Extreme number of the maximum Extreme cardinality of the Extreme SuperHy- 3592

perEdges of an Extreme SuperHyperSet S of high Extreme cardinality conseNeighborive 3593

Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 3594
Extreme SuperHyperTotal; and the Extreme power is corresponded to its Extreme coeffi- 3595
cient; 3596

(v) an Extreme R-SuperHyperTotal if it’s either of Extreme e-SuperHyperTotal, Extreme 3597

re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Extreme rv-SuperHyperTotal 3598
and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum 3599
Extreme cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of 3600
the Extreme SuperHyperVertices in the conseNeighborive Extreme sequence of Extreme 3601

SuperHyperEdges and Extreme SuperHyperVertices such that they form the Extreme 3602
SuperHyperTotal; 3603

(vi) a Extreme R-SuperHyperTotal if it’s either of Extreme e-SuperHyperTotal, Extreme 3604

re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Extreme rv-SuperHyperTotal 3605
and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum 3606
Extreme cardinality of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S 3607
of high Extreme cardinality conseNeighborive Extreme SuperHyperEdges and Extreme 3608
SuperHyperVertices such that they form the Extreme SuperHyperTotal; 3609

(vii) an Extreme R-SuperHyperTotal SuperHyperPolynomial if it’s either of Ex- 3610

treme e-SuperHyperTotal, Extreme re-SuperHyperTotal, Extreme v-SuperHyperTotal, 3611

and Extreme rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph 3612
N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients 3613
defined as the Extreme number of the maximum Extreme cardinality of the Extreme 3614
SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality con- 3615
seNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that 3616
they form the Extreme SuperHyperTotal; and the Extreme power is corresponded to its 3617

Extreme coefficient; 3618

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

SuperHyperTotal, Extreme re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Ex- 3620
treme rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph N SHG : 3621
(V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined as 3622
the Extreme number of the maximum Extreme cardinality of the Extreme SuperHyper- 3623
Vertices of an Extreme SuperHyperSet S of high Extreme cardinality conseNeighborive 3624

Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 3625
Extreme SuperHyperTotal; and the Extreme power is corresponded to its Extreme coeffi- 3626
cient. 3627

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

• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperTotal, 3630
is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are some empty 3631
Extreme SuperHyperEdges but E2 is a loop Extreme SuperHyperEdge and E4 is an 3632
Extreme SuperHyperEdge. Thus in the terms of Extreme SuperHyperNeighbor, there’s 3633
only one Extreme SuperHyperEdge, namely, E4 . The Extreme SuperHyperVertex, V3 is 3634
Extreme isolated means that there’s no Extreme SuperHyperEdge has it as an Extreme 3635

endpoint. Thus the Extreme SuperHyperVertex, V3 , is excluded in every given Extreme 3636
SuperHyperTotal. 3637

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, 3638
is up. The Extreme Algorithm is Extremely straightforward. E1 , E2 and E3 are some empty 3639
Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. Thus in the terms of 3640
Extreme SuperHyperNeighbor, there’s only one Extreme SuperHyperEdge, namely, E4 . 3641
The Extreme SuperHyperVertex, V3 is Extreme isolated means that there’s no Extreme 3642

SuperHyperEdge has it as an Extreme endpoint. Thus the Extreme SuperHyperVertex, 3643

V3 , is excluded in every given Extreme SuperHyperTotal. 3644

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, 3645
is up. The Extreme Algorithm is Extremely straightforward. 3646

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, 3647
is up. The Extreme Algorithm is Extremely straightforward. 3648

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, 3649
is up. The Extreme Algorithm is Extremely straightforward. 3650

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, 3651
is up. The Extreme Algorithm is Extremely straightforward. 3652

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

is up. The Extreme Algorithm is Extremely straightforward. 3654

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

is up. The Extreme Algorithm is Extremely straightforward. 3656

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

is up. The Extreme Algorithm is Extremely straightforward. 3658

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, 3659
is up. The Extreme Algorithm is Extremely straightforward. 3660

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, 3661
is up. The Extreme Algorithm is Extremely straightforward. 3662

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, 3663
is up. The Extreme Algorithm is Extremely straightforward. 3664

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, 3665
is up. The Extreme Algorithm is Extremely straightforward. 3666

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, 3667
is up. The Extreme Algorithm is Extremely straightforward. 3668

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, 3669
is up. The Extreme Algorithm is Extremely straightforward. 3670

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

is up. The Extreme Algorithm is Extremely straightforward. 3672

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, 3673
is up. The Extreme Algorithm is Extremely straightforward. 3674

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, 3675
is up. The Extreme Algorithm is Extremely straightforward. 3676

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, 3677
is up. The Extreme Algorithm is Extremely straightforward. 3678

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, 3679
is up. The Extreme Algorithm is Extremely straightforward. 3680

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, 3681
is up. The Extreme Algorithm is Extremely straightforward. 3682

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

is up. The Extreme Algorithm is Extremely straightforward. 3684

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 3685
SuperHyperClasses. 3686

Proposition 21.0.4. Assume a connected Extreme SuperHyperPath ESHP : (V, E). Then 3687

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 3688

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 3689

new way to redefine as 3690

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 3691

ViEXT ERN AL in the literatures of SuperHyperTotal. The latter is straightforward.  3692

136EXM18a Example 21.0.5. In the Figure (31.1), the connected Extreme SuperHyperPath ESHP : (V, E), 3693
is highlighted and featured. The Extreme SuperHyperSet, in the Extreme SuperHyperModel 3694
(31.1), is the SuperHyperTotal. 3695

Proposition 21.0.6. Assume a connected Extreme SuperHyperCycle ESHC : (V, E). Then 3696

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 3697

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 3698
new way to redefine as 3699

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 3700

ViEXT ERN AL in the literatures of SuperHyperTotal. The latter is straightforward.  3701

136EXM19a Example 21.0.7. In the Figure (31.2), the connected Extreme SuperHyperCycle N SHC : 3702
(V, E), is highlighted and featured. The obtained Extreme SuperHyperSet, in the Extreme 3703
SuperHyperModel (31.2), is the Extreme SuperHyperTotal. 3704

Proposition 21.0.8. Assume a connected Extreme SuperHyperStar ESHS : (V, E). Then 3705

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 3706

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 3707

way to redefine as 3708

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 3709
ViEXT ERN AL in the literatures of SuperHyperTotal. The latter is straightforward.  3710

136EXM20a Example 21.0.9. In the Figure (31.3), the connected Extreme SuperHyperStar ESHS : (V, E), 3711
is highlighted and featured. The obtained Extreme SuperHyperSet, by the Algorithm in previous 3712
Extreme result, of the Extreme SuperHyperVertices of the connected Extreme SuperHyperStar 3713
ESHS : (V, E), in the Extreme SuperHyperModel (31.3), is the Extreme SuperHyperTotal. 3714

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

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 3716

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest path taken from a connected Extreme SuperHyperBipartite ESHB : (V, E). There’s 3717
a new way to redefine as 3718

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 3719
ViEXT ERN AL in the literatures of SuperHyperTotal. The latter is straightforward. Then there’s 3720
no at least one SuperHyperTotal. Thus the notion of quasi may be up but the SuperHyperNotions 3721
based on SuperHyperTotal could be applied. There are only two SuperHyperParts. Thus every 3722
SuperHyperPart could have one SuperHyperVertex as the representative in the 3723

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperTotal taken from a connected Extreme SuperHyperBipartite ESHB : 3724
(V, E). Thus only some SuperHyperVertices and only minimum-Extreme-of-SuperHyperPart 3725
SuperHyperEdges are attained in any solution 3726

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

136EXM21a Example 21.0.11. In the Extreme Figure (31.4), the connected Extreme SuperHyperBipartite 3728
ESHB : (V, E), is Extreme highlighted and Extreme featured. The obtained Extreme 3729

SuperHyperSet, by the Extreme Algorithm in previous Extreme result, of the Extreme 3730
SuperHyperVertices of the connected Extreme SuperHyperBipartite ESHB : (V, E), in the 3731
Extreme SuperHyperModel (31.4), is the Extreme SuperHyperTotal. 3732

Proposition 21.0.12. Assume a connected Extreme SuperHyperMultipartite ESHM : (V, E). 3733
Then 3734

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 3735

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

is a longest SuperHyperTotal taken from a connected Extreme SuperHyperMultipartite 3736

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

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 3738

ViEXT ERN AL in the literatures of SuperHyperTotal. The latter is straightforward. Then there’s 3739

Henry Garrett · 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 3740
based on SuperHyperTotal could be applied. There are only z 0 SuperHyperParts. Thus every 3741
SuperHyperPart could have one SuperHyperVertex as the representative in the 3742

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

is a longest path taken from a connected Extreme SuperHyperMultipartite ESHM : 3743

(V, E). Thus only some SuperHyperVertices and only minimum-Extreme-of-SuperHyperPart 3744
SuperHyperEdges are attained in any solution 3745

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

is a longest path taken from a connected Extreme SuperHyperMultipartite ESHM : (V, E). 3746
The latter is straightforward.  3747

136EXM22a Example 21.0.13. In the Figure (31.5), the connected Extreme SuperHyperMultipartite 3748
ESHM : (V, E), is highlighted and Extreme featured. The obtained Extreme SuperHyperSet, by 3749
the Algorithm in previous Extreme result, of the Extreme SuperHyperVertices of the connected 3750
Extreme SuperHyperMultipartite ESHM : (V, E), in the Extreme SuperHyperModel (31.5), is 3751

the Extreme SuperHyperTotal. 3752

Proposition 21.0.14. Assume a connected Extreme SuperHyperWheel ESHW : (V, E). Then, 3753

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

P : ViEXT ERN AL , Ei∗ , CEN T ER, Ej .

is a longest SuperHyperTotal taken from a connected Extreme SuperHyperWheel ESHW : 3755

(V, E). There’s a 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 .

Henry Garrett · 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 3757
ViEXT ERN AL in the literatures of SuperHyperTotal. The latter is straightforward. Then there’s 3758
at least one SuperHyperTotal. Thus the notion of quasi isn’t up and the SuperHyperNotions 3759
based on SuperHyperTotal could be applied. The unique embedded SuperHyperTotal 3760
proposes some longest SuperHyperTotal excerpt from some representatives. The latter is 3761
straightforward.  3762

136EXM23a Example 21.0.15. In the Extreme Figure (31.6), the connected Extreme SuperHyperWheel 3763
N SHW : (V, E), is Extreme highlighted and featured. The obtained Extreme SuperHyperSet, 3764

by the Algorithm in previous result, of the Extreme SuperHyperVertices of the connected 3765
Extreme SuperHyperWheel ESHW : (V, E), in the Extreme SuperHyperModel (31.6), is the 3766
Extreme SuperHyperTotal. 3767

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 CHAPTER 22 3768

Extreme SuperHyperConnected But As 3769

The Extensions Excerpt From Dense And 3770

Super Forms 3771

Definition 22.0.1. (Different Extreme Types of Extreme SuperHyperConnected). 3772

Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider an Extreme 3773
SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and E 0 = {E1 , E2 , . . . , Ez }. Then either V 0 or E 0 is called 3774

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

Va ∈ Ei , Ej ; and ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; 3776

(ii) Extreme re-SuperHyperConnected if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such that 3777

Va ∈ Ei , Ej ; ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; and |Ei |NEUTROSOPIC CARDINALITY = 3778

|Ej |NEUTROSOPIC CARDINALITY ; 3779

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

Vi , Vj 6∈ Ea ; and ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; 3781

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

Vi , Vj ∈ Ea ; ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; and |Vi |NEUTROSOPIC CARDINALITY = 3783
|Vj |NEUTROSOPIC CARDINALITY ; 3784

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

Extreme re-SuperHyperConnected, Extreme v-SuperHyperConnected, and Extreme rv- 3786
SuperHyperConnected. 3787

Definition 22.0.2. ((Extreme) SuperHyperConnected). 3788

Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider an Extreme 3789
SuperHyperEdge (NSHE) E = {V1 , V2 , . . . , Vs }. Then E is called 3790

(i) an Extreme SuperHyperConnected if it’s either of Extreme e-SuperHyperConnected, 3791

Extreme re-SuperHyperConnected, Extreme v-SuperHyperConnected, and Extreme rv- 3792
SuperHyperConnected and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3793
is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Extreme 3794

cardinality of the Extreme SuperHyperEdges in the conseNeighborive Extreme sequence 3795

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

of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 3796
Extreme SuperHyperConnected; 3797

(ii) a Extreme SuperHyperConnected if it’s either of Extreme e-SuperHyperConnected, 3798

Extreme re-SuperHyperConnected, Extreme v-SuperHyperConnected, and Extreme rv- 3799

SuperHyperConnected and C(N SHG) for a Extreme SuperHyperGraph N SHG : (V, E) 3800
is the maximum Extreme cardinality of the Extreme SuperHyperEdges of an Extreme 3801
SuperHyperSet S of high Extreme cardinality conseNeighborive Extreme SuperHyperEdges 3802
and Extreme SuperHyperVertices such that they form the Extreme SuperHyperConnected; 3803

(iii) an Extreme SuperHyperConnected SuperHyperPolynomial if it’s either of 3804

Extreme e-SuperHyperConnected, Extreme re-SuperHyperConnected, Extreme v- 3805
SuperHyperConnected, and Extreme rv-SuperHyperConnected and C(N SHG) for an 3806
Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial con- 3807

tains the Extreme coefficients defined as the Extreme number of the maximum Extreme 3808
cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high 3809
Extreme cardinality conseNeighborive Extreme SuperHyperEdges and Extreme SuperHy- 3810
perVertices such that they form the Extreme SuperHyperConnected; and the Extreme 3811
power is corresponded to its Extreme coefficient; 3812

(iv) a Extreme SuperHyperConnected SuperHyperPolynomial if it’s either of 3813

Extreme e-SuperHyperConnected, Extreme re-SuperHyperConnected, Extreme v- 3814
SuperHyperConnected, and Extreme rv-SuperHyperConnected and C(N SHG) for an 3815

Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial con- 3816

tains the Extreme coefficients defined as the Extreme number of the maximum Extreme 3817
cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high 3818
Extreme cardinality conseNeighborive Extreme SuperHyperEdges and Extreme SuperHy- 3819
perVertices such that they form the Extreme SuperHyperConnected; and the Extreme 3820
power is corresponded to its Extreme coefficient; 3821

(v) an Extreme R-SuperHyperConnected if it’s either of Extreme e-SuperHyperConnected,3822

Extreme re-SuperHyperConnected, Extreme v-SuperHyperConnected, and Extreme rv- 3823
SuperHyperConnected and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3824
is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Extreme 3825
cardinality of the Extreme SuperHyperVertices in the conseNeighborive Extreme sequence 3826
of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 3827
Extreme SuperHyperConnected; 3828

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

Extreme re-SuperHyperConnected, Extreme v-SuperHyperConnected, and Extreme rv- 3830
SuperHyperConnected and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3831
is the maximum Extreme cardinality of the Extreme SuperHyperVertices of an Extreme Su- 3832
perHyperSet S of high Extreme cardinality conseNeighborive Extreme SuperHyperEdges 3833

and Extreme SuperHyperVertices such that they form the Extreme SuperHyperConnected; 3834

(vii) an Extreme R-SuperHyperConnected SuperHyperPolynomial if it’s either 3835

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

SuperHyperConnected, and Extreme rv-SuperHyperConnected and C(N SHG) for an 3837

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

contains the Extreme coefficients defined as the Extreme number of the maximum 3839
Extreme cardinality of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S 3840
of high Extreme cardinality conseNeighborive Extreme SuperHyperEdges and Extreme 3841
SuperHyperVertices such that they form the Extreme SuperHyperConnected; and the 3842
Extreme power is corresponded to its Extreme coefficient; 3843

(viii) a Extreme SuperHyperConnected SuperHyperPolynomial if it’s either of 3844

Extreme e-SuperHyperConnected, Extreme re-SuperHyperConnected, Extreme v- 3845
SuperHyperConnected, and Extreme rv-SuperHyperConnected and C(N SHG) for an 3846
Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial con- 3847
tains the Extreme coefficients defined as the Extreme number of the maximum Extreme 3848

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

Extreme cardinality conseNeighborive Extreme SuperHyperEdges and Extreme SuperHy- 3850
perVertices such that they form the Extreme SuperHyperConnected; and the Extreme 3851
power is corresponded to its Extreme coefficient. 3852

136EXM1 Example 22.0.3. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E) in the 3853

mentioned Extreme Figures in every Extreme items. 3854

• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperCon- 3855
nected, is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are some 3856
empty Extreme SuperHyperEdges but E2 is a loop Extreme SuperHyperEdge and E4 is 3857

an Extreme SuperHyperEdge. Thus in the terms of Extreme SuperHyperNeighbor, there’s 3858

only one Extreme SuperHyperEdge, namely, E4 . The Extreme SuperHyperVertex, V3 is 3859
Extreme isolated means that there’s no Extreme SuperHyperEdge has it as an Extreme 3860
endpoint. Thus the Extreme SuperHyperVertex, V3 , is excluded in every given Extreme 3861
SuperHyperConnected. 3862

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- 3863
Connected, is up. The Extreme Algorithm is Extremely straightforward. E1 , E2 and 3864
E3 are some empty Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. 3865
Thus in the terms of Extreme SuperHyperNeighbor, there’s only one Extreme SuperHy- 3866
perEdge, namely, E4 . The Extreme SuperHyperVertex, V3 is Extreme isolated means that 3867
there’s no Extreme SuperHyperEdge has it as an Extreme endpoint. Thus the Extreme 3868

SuperHyperVertex, V3 , is excluded in every given Extreme SuperHyperConnected. 3869

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- 3870
nected, is up. The Extreme Algorithm is Extremely straightforward. 3871

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

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

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- 3874
nected, is up. The Extreme Algorithm is Extremely straightforward. 3875

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- 3876
nected, is up. The Extreme Algorithm is Extremely straightforward. 3877

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

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

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- 3880
nected, is up. The Extreme Algorithm is Extremely straightforward. 3881

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- 3882
nected, is up. The Extreme Algorithm is Extremely straightforward. 3883

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- 3884
Connected, is up. The Extreme Algorithm is Extremely straightforward. 3885

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- 3886
Connected, is up. The Extreme Algorithm is Extremely straightforward. 3887

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- 3888
Connected, is up. The Extreme Algorithm is Extremely straightforward. 3889

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- 3890
Connected, is up. The Extreme Algorithm is Extremely straightforward. 3891

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- 3892
Connected, is up. The Extreme Algorithm is Extremely straightforward. 3893

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- 3894
Connected, is up. The Extreme Algorithm is Extremely straightforward. 3895

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- 3896
Connected, is up. The Extreme Algorithm is Extremely straightforward. 3897

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- 3898
Connected, is up. The Extreme Algorithm is Extremely straightforward. 3899

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- 3900
Connected, is up. The Extreme Algorithm is Extremely straightforward. 3901

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- 3902
Connected, is up. The Extreme Algorithm is Extremely straightforward. 3903

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- 3904
Connected, is up. The Extreme Algorithm is Extremely straightforward. 3905

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- 3906
Connected, is up. The Extreme Algorithm is Extremely straightforward. 3907

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- 3908
Connected, is up. The Extreme Algorithm is Extremely straightforward. 3909

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 3910
SuperHyperClasses. 3911

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

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 3913

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 3914
new way to redefine as 3915

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 3916
ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is straightforward.  3917

136EXM18a Example 22.0.5. In the Figure (31.1), the connected Extreme SuperHyperPath ESHP : (V, E), 3918
is highlighted and featured. The Extreme SuperHyperSet, in the Extreme SuperHyperModel 3919
(31.1), is the SuperHyperConnected. 3920

Proposition 22.0.6. Assume a connected Extreme SuperHyperCycle ESHC : (V, E). Then 3921

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 3922

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 3923
new way to redefine as 3924

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 3925
ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is straightforward.  3926

136EXM19a Example 22.0.7. In the Figure (31.2), the connected Extreme SuperHyperCycle N SHC : 3927
(V, E), is highlighted and featured. The obtained Extreme SuperHyperSet, in the Extreme 3928
SuperHyperModel (31.2), is the Extreme SuperHyperConnected. 3929

Proposition 22.0.8. Assume a connected Extreme SuperHyperStar ESHS : (V, E). Then 3930

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 3931

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 3932

way to redefine as 3933

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 3934

ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is straightforward.  3935

Henry Garrett · 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), 3936
is highlighted and featured. The obtained Extreme SuperHyperSet, by the Algorithm in previous 3937
Extreme result, of the Extreme SuperHyperVertices of the connected Extreme SuperHyperStar 3938
ESHS : (V, E), in the Extreme SuperHyperModel (31.3), is the Extreme SuperHyperConnected. 3939

Proposition 22.0.10. Assume a connected Extreme SuperHyperBipartite ESHB : (V, E). Then 3940

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 3941

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

is a longest path taken from a connected Extreme SuperHyperBipartite ESHB : (V, E). There’s 3942
a new way to redefine as 3943

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 3944
ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is straightforward. Then 3945
there’s no at least one SuperHyperConnected. Thus the notion of quasi may be up but the 3946
SuperHyperNotions based on SuperHyperConnected could be applied. There are only two 3947
SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as the 3948
representative in the 3949

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 3950

ESHB : (V, E). Thus only some SuperHyperVertices and only minimum-Extreme-of- 3951
SuperHyperPart SuperHyperEdges are attained in any solution 3952

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
The latter is straightforward.  3953

136EXM21a Example 22.0.11. In the Extreme Figure (31.4), the connected Extreme SuperHyperBipartite 3954
ESHB : (V, E), is Extreme highlighted and Extreme featured. The obtained Extreme 3955
SuperHyperSet, by the Extreme Algorithm in previous Extreme result, of the Extreme 3956
SuperHyperVertices of the connected Extreme SuperHyperBipartite ESHB : (V, E), in the 3957
Extreme SuperHyperModel (31.4), is the Extreme SuperHyperConnected. 3958

Proposition 22.0.12. Assume a connected Extreme SuperHyperMultipartite ESHM : (V, E). 3959
Then 3960

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 3961

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperConnected taken from a connected Extreme SuperHyperMultipartite 3962
ESHM : (V, E). There’s a new way to redefine as 3963

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 3964
ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is straightforward. Then 3965
there’s no at least one SuperHyperConnected. Thus the notion of quasi may be up but 3966
the SuperHyperNotions based on SuperHyperConnected could be applied. There are only 3967
z 0 SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as the 3968
representative in the 3969

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

is a longest path taken from a connected Extreme SuperHyperMultipartite ESHM : 3970

(V, E). Thus only some SuperHyperVertices and only minimum-Extreme-of-SuperHyperPart 3971
SuperHyperEdges are attained in any solution 3972

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

is a longest path taken from a connected Extreme SuperHyperMultipartite ESHM : (V, E). 3973
The latter is straightforward.  3974

136EXM22a Example 22.0.13. In the Figure (31.5), the connected Extreme SuperHyperMultipartite 3975
ESHM : (V, E), is highlighted and Extreme featured. The obtained Extreme SuperHyperSet, by 3976

the Algorithm in previous Extreme result, of the Extreme SuperHyperVertices of the connected 3977
Extreme SuperHyperMultipartite ESHM : (V, E), in the Extreme SuperHyperModel (31.5), is 3978
the Extreme SuperHyperConnected. 3979

Proposition 22.0.14. Assume a connected Extreme SuperHyperWheel ESHW : (V, E). Then, 3980

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

P : V EXT ERN AL i , E ∗ i , CEN T ER, Ej .

is a longest SuperHyperConnected taken from a connected Extreme SuperHyperWheel 3982

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

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 3984
to ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is straightforward. 3985
Then there’s at least one SuperHyperConnected. Thus the notion of quasi isn’t up and 3986
the SuperHyperNotions based on SuperHyperConnected could be applied. The unique 3987
embedded SuperHyperConnected proposes some longest SuperHyperConnected excerpt from 3988
some representatives. The latter is straightforward.  3989

136EXM23a Example 22.0.15. In the Extreme Figure (31.6), the connected Extreme SuperHyperWheel 3990
N SHW : (V, E), is Extreme highlighted and featured. The obtained Extreme SuperHyperSet, 3991

by the Algorithm in previous result, of the Extreme SuperHyperVertices of the connected 3992
Extreme SuperHyperWheel ESHW : (V, E), in the Extreme SuperHyperModel (31.6), is the 3993
Extreme SuperHyperConnected. 3994

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 CHAPTER 23 3995

Background 3996

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

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

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

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

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

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

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

211
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 4030
(Dual)Resolving and (Dual)Coloring alongside (Dual)Dominating in (Neutrosophic)n- 4031
SuperHyperGraph” in Ref. [HG4] by Henry Garrett (2022), “0049 | (Failed)1-Zero-Forcing 4032
Number in Neutrosophic Graphs” in Ref. [HG5] by Henry Garrett (2022), “Extreme SuperHy- 4033
perClique as the Firm Scheme of Confrontation under Cancer’s Recognition as the Model in 4034
The Setting of (Neutrosophic) SuperHyperGraphs” in Ref. [HG6] by Henry Garrett (2022), 4035

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

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

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

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

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

Neutrosophic Recognitions In Special ViewPoints” in Ref. [HG14] by Henry Garrett (2022), 4054
“Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To Use Neutrosophic 4055
SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond” in Ref. [HG15] 4056
by Henry Garrett (2022), “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by 4057
Well- SuperHyperModelled (Neutrosophic) SuperHyperGraphs ” in Ref. [HG16] by Henry 4058
Garrett (2022), “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic Su- 4059

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

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

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

SuperHyperModeling of Cancer’s Recognitions Featuring (Neutrosophic) SuperHyperDefensive 4066
SuperHyperAlliances” in Ref. [HG19] by Henry Garrett (2022), “(Neutrosophic) Super- 4067
HyperAlliances With SuperHyperDefensive and SuperHyperOffensive Type-SuperHyperSet 4068
On (Neutrosophic) SuperHyperGraph With (Neutrosophic) SuperHyperModeling of Cancer’s 4069
Recognitions And Related (Neutrosophic) SuperHyperClasses” in Ref. [HG20] by Henry 4070

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

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

Henry Garrett · 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” 4076
in Ref. [HG23] by Henry Garrett (2022), “SuperHyperMatching By (R-)Definitions And 4077
Polynomials To Monitor Cancer’s Recognition In Neutrosophic SuperHyperGraphs” in Ref. 4078
[HG24] by Henry Garrett (2023), “The Focus on The Partitions Obtained By Parallel Moves 4079
In The Cancer’s Extreme Recognition With Different Types of Extreme SuperHyperMatching 4080
Set and Polynomial on (Neutrosophic) SuperHyperGraphs” in Ref. [HG25] by Henry Garrett 4081

(2023), “Extreme Failed SuperHyperClique Decides the Failures on the Cancer’s Recognition 4082
in the Perfect Connections of Cancer’s Attacks By SuperHyperModels Named (Neutrosophic) 4083
SuperHyperGraphs” in Ref. [HG26] by Henry Garrett (2023), “Indeterminacy On The All 4084
Possible Connections of Cells In Front of Cancer’s Attacks In The Terms of Neutrosophic Failed 4085
SuperHyperClique on Cancer’s Recognition called Neutrosophic SuperHyperGraphs” in Ref. 4086
[HG27] by Henry Garrett (2023), “Perfect Directions Toward Idealism in Cancer’s Neutrosophic 4087

Recognition Forwarding Neutrosophic SuperHyperClique on Neutrosophic SuperHyperGraphs” 4088

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

sophic SuperHyperGraphs” in Ref. [HG30] by Henry Garrett (2023), “Using the Tool As 4094
(Neutrosophic) Failed SuperHyperStable To SuperHyperModel Cancer’s Recognition Titled 4095
(Neutrosophic) SuperHyperGraphs” in Ref. [HG31] by Henry Garrett (2023), “Neutrosophic 4096
Messy-Style SuperHyperGraphs To Form Neutrosophic SuperHyperStable To Act on Cancer’s 4097
Neutrosophic Recognitions In Special ViewPoints” in Ref. [HG32] by Henry Garrett (2023), 4098
“(Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well-SuperHyperModelled 4099

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

1-Failed SuperHyperForcing in the SuperHyperFunction To Use Neutrosophic SuperHyper- 4101
Graphs on Cancer’s Neutrosophic Recognition And Beyond” in Ref. [HG34] by Henry 4102
Garrett (2022), “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Recognitions And 4103
(Neutrosophic) SuperHyperGraphs” in Ref. [HG35] by Henry Garrett (2022), “Basic Notions 4104
on (Neutrosophic) SuperHyperForcing And (Neutrosophic) SuperHyperModeling in Cancer’s 4105

Recognitions And (Neutrosophic) SuperHyperGraphs” in Ref. [HG36] by Henry Garrett 4106

(2022), “Basic Neutrosophic Notions Concerning SuperHyperDominating and Neutrosophic 4107
SuperHyperResolving in SuperHyperGraph” in Ref. [HG37] by Henry Garrett (2022), “Initial 4108
Material of Neutrosophic Preliminaries to Study Some Neutrosophic Notions Based on Neutro- 4109
sophic SuperHyperEdge (NSHE) in Neutrosophic SuperHyperGraph (NSHG)” in Ref. [HG38] 4110

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

HG131; HG132; HG134; HG135; HG136; HG137; HG138; HG139; HG140; HG141; 4117
HG142; HG143; HG144; HG145; HG146; HG147; HG148; HG149; HG150; HG151; 4118
HG152; HG153; HG154; HG155; HG156; HG157; HG158; HG159; HG160; HG161; 4119
HG162; HG163; HG164; HG165; HG166; HG167; HG168; HG169; HG170; HG171; 4120
HG172; HG173; HG174; HG175; HG176; HG177; HG178; HG179; HG180; HG181; 4121

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

HG182; HG183; HG184; HG185; HG186; HG187; HG188; HG189; HG190; HG191; 4122
HG192; HG193; HG194; HG195; HG196; HG197; HG198; HG199; HG200; HG201; 4123
HG202; HG203; HG204; HG205; HG206; HG207; HG208; HG209; HG210; HG211; 4124
HG212; HG213; HG214; HG215; HG216], there are some endeavors to formalize the basic 4125
SuperHyperNotions about neutrosophic SuperHyperGraph and SuperHyperGraph alongside 4126
scientific research books at [HG60b; HG61b; HG62b; HG63b; HG64b; HG65b; HG66b; 4127

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

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

HG130b; HG131b; HG132b; HG133b; HG134b; HG135b; HG136b; HG137b; 4135
HG138b; HG139b; HG140b; HG141b; HG142b; HG143b; HG144b; HG145b; 4136
HG146b; HG147; HG148b; HG218]. Two popular scientific research books in Scribd 4137
in the terms of high readers, 4087 and 5084 respectively, on neutrosophic science is on [HG32b; 4138
HG44b]. 4139

Some scientific studies and scientific researches about neutrosophic graphs, are proposed as 4140
book in Ref. [HG71b] by Henry Garrett (2023) which is indexed by Google Scholar and has 4141
more than 4093 readers in Scribd. It’s titled “Beyond Neutrosophic Graphs” and published 4142
by Dr. Henry Garrett. This research book covers different types of notions and settings in 4143
neutrosophic graph theory and neutrosophic SuperHyperGraph theory. 4144
Also, some scientific studies and scientific researches about neutrosophic graphs, are proposed 4145

as book in Ref. [HG70b] by Henry Garrett (2023) which is indexed by Google Scholar and 4146
has more than 5090 readers in Scribd. It’s titled “Neutrosophic Duality” and published by Dr. 4147
Henry Garrett. This research book presents different types of notions SuperHyperResolving and 4148
SuperHyperDominating in the setting of duality in neutrosophic graph theory and neutrosophic 4149
SuperHyperGraph theory. This research book has scrutiny on the complement of the intended 4150
set and the intended set, simultaneously. It’s smart to consider a set but acting on its 4151

complement that what’s done in this research book which is popular in the terms of high readers 4152
in Scribd. 4153
See the seminal scientific researches [HG1; HG2; HG3]. The formalization of the notions on 4154
the framework of notions in SuperHyperGraphs, Neutrosophic notions in SuperHyperGraphs the- 4155
ory, and (Neutrosophic) SuperHyperGraphs theory at [HG4; HG5; HG6; HG7; HG8; HG9; 4156

HG10; HG11; HG12; HG13; HG14; HG15; HG16; HG17; HG18; HG19; HG20; 4157
HG21; HG22; HG23; HG24; HG25; HG26; HG27; HG28; HG29; HG30; HG31; 4158
HG32; HG33; HG34; HG35; HG36; HG37; HG38; HG94; HG942; HG95; HG952; 4159
HG96; HG962; HG97; HG972; HG98; HG982; HG106; HG107; HG111; HG112; 4160
HG115; HG116; HG120; HG121; HG122; HG123; HG124; HG125; HG126; HG127; 4161
HG128; HG129; HG130; HG131; HG132; HG134; HG135; HG136; HG137; HG138; 4162

HG139; HG140; HG141; HG142; HG143; HG144; HG145; HG146; HG147; HG148; 4163
HG149; HG150; HG151; HG152; HG153; HG154; HG155; HG156; HG157; HG158; 4164
HG159; HG160; HG161; HG162; HG163; HG164; HG165; HG166; HG167; HG168; 4165
HG169; HG170; HG171; HG172; HG173; HG174; HG175; HG176; HG177; HG178; 4166
HG179; HG180; HG181; HG182; HG183; HG184; HG185; HG186; HG187; HG188; 4167

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

HG189; HG190; HG191; HG192; HG193; HG194; HG195; HG196; HG197; HG198; 4168
HG199; HG200; HG201; HG202; HG203; HG204; HG205; HG206; HG207; HG208; 4169
HG209; HG210; HG211; HG212; HG213; HG214; HG215; HG216; HG218] alongside 4170
scientific research books at [HG60b; HG61b; HG62b; HG63b; HG64b; HG65b; HG66b; 4171
HG67b; HG68b; HG69b; HG70b; HG71b; HG72b; HG73b; HG74b; HG75b; HG76b; 4172
HG77b; HG78b; HG79b; HG80b; HG81b; HG82b; HG83b; HG84b; HG85b; HG86b; 4173

HG87b; HG88b; HG89b; HG90b; HG91b; HG92b; HG93b; HG94b; HG95b; HG96b; 4174
HG97b; HG98b; HG99b; HG100b; HG101b; HG102b; HG103b; HG104b; HG105b; 4175
HG106b; HG107b; HG108b; HG109b; HG110b; HG111b; HG112b; HG113b; 4176
HG114b; HG115b; HG116b; HG117b; HG118b; HG119b; HG120b; HG121b; 4177
HG122b; HG123b; HG124b; HG125b; HG126b; HG127b; HG128b; HG129b; 4178
HG130b; HG131b; HG132b; HG133b; HG134b; HG135b; HG136b; HG137b; 4179

HG138b; HG139b; HG140b; HG141b; HG142b; HG143b; HG144b; HG145b; 4180

HG146b; HG147b; HG148b]. Two popular scientific research books in Scribd in the 4181
terms of high readers, 4093 and 5090 respectively, on neutrosophic science is on [HG32b; 4182
HG44b]. 4183

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

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

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

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

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

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

alongside-a.pdf) 4197

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

HG218 [25] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph 4272
By Trace-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 4273

10.5281/zenodo.7777857). 4274

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

HG214 [27] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of Trace- 4278

Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 4279

2023, (doi: 10.5281/zenodo.7772468). 4280

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

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

HG211 [30] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 4287
By Edge-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 4288

10.13140/RG.2.2.11770.98247). 4289

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

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

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

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

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

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

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

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

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

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

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

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

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

HG198 [43] Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of Stable-Neighbor In 4326
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 4327

10.13140/RG.2.2.17184.25602). 4328

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

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

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

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

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

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

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

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

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

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

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

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

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

HG185 [56] Henry Garrett, “New Ideas On Super Lith By Hyper Lite Of List-Coloring In 4365
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 4366

10.13140/RG.2.2.16356.04489). 4367

Henry Garrett · 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 [57] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHy- 4368
perGraph By Space As Hyper Sparse On Super Spark”, ResearchGate 2023, (doi: 4369
10.13140/RG.2.2.21756.21129). 4370

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

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

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

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

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

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

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

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

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

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

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

HG172 [69] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyper- 4404
Graph By SuperHyperEdge-Domination As Hyper Reversion On Super Indirection”, 4405

ResearchGate 2023, (doi: 10.13140/RG.2.2.10493.84962). 4406

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

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

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

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

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

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

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

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

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

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

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

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

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

HG159 [82] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 4443
By SuperHyperDominating As Hyper Closing On Super Messy”, ResearchGate 2023, (doi: 4444

10.13140/RG.2.2.21510.45125). 4445

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

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

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

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

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

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

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

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

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

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

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

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

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

HG146 [95] Henry Garrett, “New Ideas On Super Reflections By Hyper Rotations Of Path SuperHy- 4482
perColoring In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 4483

ResearchGate 2023, (doi: 10.13140/RG.2.2.33459.30243). 4484

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

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

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

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

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

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

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

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

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

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

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

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

HG134 [107] Henry Garrett,“Eulerian and Hamiltonian In Cancer’s Neutrosophic Recognition and 4518
Neutrosophic SuperHyperGraph On Super Interactions By Hyper Extensions of Cycles”, 4519
ResearchGate 2023,(doi: 10.13140/RG.2.2.34583.24485). 4520

HG132 [108] Henry Garrett,“SuperHyperGirth Type-Results on extreme SuperHyperGirth theory and 4521
(Neutrosophic) SuperHyperGraphs Toward Cancer’s extreme Recognition”, Preprints 4522

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

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

HG131 [109] Henry Garrett,“Neutrosophic SuperHyperGraphs Warns Hyper Landmark of neutrosophic 4524
SuperHyperGirth In Super Type-Versions of Cancer’s neutrosophic Recognition”, Preprints 4525
2023, 2023010395 (doi: 10.20944/preprints202301.0395.v1). 4526

HG130 [110] Henry Garrett,“The Constructions of (Neutrosophic) SuperHyperGraphs on the Cancer’s 4527
Recognition in The Confrontation With Super Attacks In Hyper Situations By 4528
Implementing (Neutrosophic) 1-Failed SuperHyperForcing in The Technical Approaches to 4529
Neutralize SuperHyperViews”, ResearchGate 2023, (doi: 10.13140/RG.2.2.26240.51204). 4530

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

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

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

HG127 [113] Henry Garrett,“SuperHyperGirth Approaches on the Super Challenges on the Cancer’s 4538

Recognition In the Hyper Model of (Neutrosophic) SuperHyperGraph”, ResearchGate 4539

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

HG126 [114] Henry Garrett,“Extreme SuperHyperClique as the Firm Scheme of Confrontation under 4541
Cancer’s Recognition as the Model in The Setting of (Neutrosophic) SuperHyperGraphs”, 4542
Preprints 2023, 2023010308 (doi: 10.20944/preprints202301.0308.v1). 4543

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

10.20944/preprints202301.0282.v1). 4547

HG124 [116] Henry Garrett,“Neutrosophic Version Of Separates Groups Of Cells In Cancer’s 4548
Recognition On Neutrosophic SuperHyperGraphs”, Preprints 2023, 2023010267 (doi: 4549
10.20944/preprints202301.0267.v1).). 4550

HG123 [117] Henry Garrett, “The Shift Paradigm To Classify Separately The Cells and Affected 4551
Cells Toward The Totality Under Cancer’s Recognition By New Multiple Definitions On 4552
the Sets Polynomials Alongside Numbers In The (Neutrosophic) SuperHyperMatching 4553

Theory Based on SuperHyperGraph and Neutrosophic SuperHyperGraph”, Preprints 4554

2023, 2023010265 (doi: 10.20944/preprints202301.0265.v1). 4555

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

HG121 [119] Henry Garrett, “Neutrosophic Failed SuperHyperStable as the Survivors on the 4560
Cancer’s Neutrosophic Recognition Based on Uncertainty to All Modes in Neutrosophic 4561

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

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

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

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

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

10.13140/RG.2.2.35061.65767). 4568

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

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

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

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

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

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

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

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

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

HG116 [125] Henry Garrett,“Extreme Failed SuperHyperClique Decides the Failures on the Can- 4581
cer’s Recognition in the Perfect Connections of Cancer’s Attacks By SuperHy- 4582
perModels Named (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 4583
10.13140/RG.2.2.32530.73922). 4584

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

HG28 [127] Henry Garrett,“Perfect Directions Toward Idealism in Cancer’s Neutrosophic Recogni- 4588

tion Forwarding Neutrosophic SuperHyperClique on Neutrosophic SuperHyperGraphs”, 4589

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

HG29 [128] Henry Garrett,“Demonstrating Complete Connections in Every Embedded Regions 4591
and Sub-Regions in the Terms of Cancer’s Recognition and (Neutrosophic) Su- 4592

perHyperGraphs With (Neutrosophic) SuperHyperClique”, ResearchGate 2023, (doi: 4593

10.13140/RG.2.2.23172.19849). 4594

HG112 [129] Henry Garrett, “Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic) 4595

SuperHyperModeling in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs”, 4596

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

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

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

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

HG30 [131] Henry Garrett,“Different Neutrosophic Types of Neutrosophic Regions titled neut- 4601
rosophic Failed SuperHyperStable in Cancer’s Neutrosophic Recognition modeled 4602
in the Form of Neutrosophic SuperHyperGraphs”, ResearchGate 2023, (doi: 4603
10.13140/RG.2.2.17385.36968). 4604

HG107 [132] Henry Garrett, “Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction 4605
To Use Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition And 4606
Beyond”, Preprints 2023, 2023010044 4607

HG106 [133] Henry Garrett, “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well- 4608
SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010043 4609

(doi: 10.20944/preprints202301.0043.v1). 4610

HG31 [134] Henry Garrett, “Using the Tool As (Neutrosophic) Failed SuperHyperStable To SuperHy- 4611
perModel Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs”, ResearchGate 4612
2023, (doi: 10.13140/RG.2.2.28945.92007). 4613

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

HG33 [136] Henry Garrett, “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well- 4617
SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 4618
10.13140/RG.2.2.35774.77123). 4619

HG34 [137] Henry Garrett, “Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To 4620
Use Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond”, 4621

ResearchGate 2022, (doi: 10.13140/RG.2.2.36141.77287). 4622

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

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

HG982 [140] Henry Garrett, “(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions Featuring 4629
(Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, Preprints 2022, 2022120549 4630
(doi: 10.20944/preprints202212.0549.v1). 4631

HG98 [141] Henry Garrett, “(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions Featuring 4632
(Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, ResearchGate 2022, (doi: 4633

10.13140/RG.2.2.19380.94084). 4634

HG972 [142] Henry Garrett, “(Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and 4635
SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With 4636
(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions And Related (Neutrosophic) 4637

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

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

HG97 [143] Henry Garrett, “(Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and 4639
SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With 4640
(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions And Related (Neutrosophic) 4641
SuperHyperClasses”, ResearchGate 2022, (doi: 10.13140/RG.2.2.14426.41923). 4642

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

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

HG952 [146] Henry Garrett,“Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic Su- 4649

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

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

HG95 [147] Henry Garrett, “Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic 4652
SuperHyperGraphs And SuperHyperGraphs Alongside Applications in Cancer’s Treat- 4653

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

HG942 [148] Henry Garrett, “SuperHyperDominating and SuperHyperResolving on Neutrosophic 4655

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

HG94 [149] Henry Garrett, “SuperHyperDominating and SuperHyperResolving on Neutrosophic 4658

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

HG37 [150] Henry Garrett, “Basic Neutrosophic Notions Concerning SuperHyperDominating and 4661
Neutrosophic SuperHyperResolving in SuperHyperGraph”, ResearchGate 2022 (doi: 4662
10.13140/RG.2.2.29173.86244). 4663

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

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

HG147b [153] Henry Garrett, “SuperHyperDuality”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4669
odo.7637762). 4670

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

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

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

(doi: 10.5281/zenodo.7758601). 4676

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

HG143b [157] Henry Garrett, “Edge-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 4677
10.5281/zenodo.7754661). 4678

HG142b [158] Henry Garrett, “Vertex-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 4679
10.5281/zenodo.7750995) . 4680

HG141b [159] Henry Garrett, “Vertex-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 4681
(doi: 10.5281/zenodo.7749875). 4682

HG140b [160] Henry Garrett, “Vertex-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 4683
10.5281/zenodo.7747236). 4684

HG139b [161] Henry Garrett, “Stable-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 4685
10.5281/zenodo.7742587). 4686

HG138b [162] Henry Garrett, “Stable-Decompositions In SuperHyperGraphs”. Dr. Henry Garrett, 2023 4687
(doi: 10.5281/zenodo.7738635). 4688

HG137b [163] Henry Garrett, “Stable-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 4689
10.5281/zenodo.7734719). 4690

HG136b [164] Henry Garrett, “Clique-Neighbors In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 4691
10.5281/zenodo.7730484). 4692

HG135b [165] Henry Garrett, “Clique-Decompositions In SuperHyperGraphs”. Dr. Henry Garrett, 2023 4693

(doi: 10.5281/zenodo.7730469). 4694

HG134b [166] Henry Garrett, “Clique-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 4695
10.5281/zenodo.7722865). 4696

HG133b [167] Henry Garrett, “Space In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4697
odo.7713563). 4698

HG132b [168] Henry Garrett, “Space In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4699

odo.7709116). 4700

HG131b [169] Henry Garrett, “Edge-Connectivity In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 4701
10.5281/zenodo.7706415). 4702

HG130b [170] Henry Garrett, “Vertex-Connectivity In SuperHyperGraphs”. Dr. Henry Garrett, 2023 4703
(doi: 10.5281/zenodo.7706063). 4704

HG129b [171] Henry Garrett, “Tree-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 4705

(doi: 10.5281/zenodo.7701906). 4706

HG128b [172] Henry Garrett, “Chord In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4707
odo.7700205). 4708

HG127b [173] Henry Garrett, “(i,j)-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 4709
10.5281/zenodo.7694876). 4710

HG126b [174] Henry Garrett, “Edge-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 4711

10.5281/zenodo.7679410). 4712

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 Henry Garrett · Independent Researcher · Department of Mathematics ·
DrHenryGarrett@gmail.com · Manhattan, NY, USA

HG125b [175] Henry Garrett, “K-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 4713
10.5281/zenodo.7675982). 4714

HG124b [176] Henry Garrett, “K-Number In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 4715
10.5281/zenodo.7672388). 4716

HG123b [177] Henry Garrett, “Order In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4717
odo.7668648). 4718

HG122b [178] Henry Garrett, “Coloring In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 4719
10.5281/zenodo.7662810). 4720

HG121b [179] Henry Garrett, “Dimension In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 4721
10.5281/zenodo.7659162). 4722

HG120b [180] Henry Garrett, “Cancer In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4723
odo.7653233). 4724

HG119b [181] Henry Garrett, “SuperHyperWheel”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4725
odo.7653204). 4726

HG118b [182] Henry Garrett, “SuperHyperMultipartite”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4727
odo.7653142). 4728

HG117b [183] Henry Garrett, “SuperHyperBipartite”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4729

odo.7653117). 4730

HG116b [184] Henry Garrett, “SuperHyperStar”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4731
odo.7653089). 4732

HG115b [185] Henry Garrett, “SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4733
odo.7651687). 4734

HG114b [186] Henry Garrett, “SuperHyperPath”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4735

odo.7651619). 4736

HG113b [187] Henry Garrett, “SuperHyperDomination”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4737
odo.7651439). 4738

HG112b [188] Henry Garrett, “SuperHyperDominating”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4739
odo.7650729). 4740

HG111b [189] Henry Garrett, “SuperHyperConnected”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4741

odo.7647868). 4742

HG110b [190] Henry Garrett, “SuperHyperTotal”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4743
odo.7647017). 4744

HG109b [191] Henry Garrett, “SuperHyperPerfect”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4745
odo.7644894). 4746

HG108b [192] Henry Garrett, “SuperHyperJoin”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4747

odo.7641880). 4748

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 Henry Garrett · Independent Researcher · Department of Mathematics ·
DrHenryGarrett@gmail.com · Manhattan, NY, USA

HG107b [193] Henry Garrett, “Path SuperHyperColoring”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4749
odo.7632923). 4750

HG106b [194] Henry Garrett, “SuperHyperDensity”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4751
odo.7623459). 4752

HG105b [195] Henry Garrett, “Neutrosophic SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 4753
10.5281/zenodo.7606416). 4754

HG104b [196] Henry Garrett, “Extreme SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 4755
10.5281/zenodo.7606416). 4756

HG103b [197] Henry Garrett, “SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4757
odo.7606404). 4758

HG102b [198] Henry Garrett, “Neutrosophic SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 4759
10.5281/zenodo.7580018). 4760

HG101b [199] Henry Garrett, “Extreme SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4761
odo.7580018). 4762

HG100b [200] Henry Garrett, “Extreme SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4763
odo.7580018). 4764

HG99b [201] Henry Garrett, “SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4765

odo.7579929). 4766

HG98b [202] Henry Garrett, “Neutrosophic SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 4767
10.5281/zenodo.7563170). 4768

HG97b [203] Henry Garrett, “Extreme SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4769
odo.7563164). 4770

HG96b [204] Henry Garrett, “SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4771

odo.7563160). 4772

HG95b [205] Henry Garrett, “Extreme SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4773
odo.7563160). 4774

HG94b [206] Henry Garrett, “Overlook On SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 4775
10.5281/zenodo.7563160). 4776

HG93b [207] Henry Garrett, “Neutrosophic SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 4777

10.5281/zenodo.7557063). 4778

HG92b [208] Henry Garrett, “Extreme SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 4779
10.5281/zenodo.7557009). 4780

HG91b [209] Henry Garrett, “Overlook On SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 4781
10.5281/zenodo.7539484). 4782

HG90b [210] Henry Garrett, “Neutrosophic Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 4783

10.5281/zenodo.7523390). 4784

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 Henry Garrett · Independent Researcher · Department of Mathematics ·
DrHenryGarrett@gmail.com · Manhattan, NY, USA

HG89b [211] Henry Garrett, “Extreme Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 4785
10.5281/zenodo.7523390). 4786

HG88b [212] Henry Garrett, “Overlook On Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 4787
10.5281/zenodo.7523390). 4788

HG87b [213] Henry Garrett, “Extreme SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4789
odo.7574952). 4790

HG86b [214] Henry Garrett, “Neutrosophic SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 4791
10.5281/zenodo.7574992). 4792

HG85b [215] Henry Garrett, “Extreme SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4793
odo.7523357). 4794

HG84b [216] Henry Garrett, “Overlook On SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 4795
10.5281/zenodo.7523357). 4796

HG83b [217] Henry Garrett, “Neutrosophic Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 4797
10.5281/zenodo.7504782). 4798

HG82b [218] Henry Garrett, “Extreme Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 4799
10.5281/zenodo.7504782). 4800

HG81b [219] Henry Garrett, “Overlook On Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 4801

10.5281/zenodo.7504782). 4802

HG80b [220] Henry Garrett, “Neutrosophic SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 4803
10.5281/zenodo.7499395). 4804

HG79b [221] Henry Garrett, “Extreme SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4805
odo.7499395). 4806

HG78b [222] Henry Garrett, “Overlook On SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 4807

10.5281/zenodo.7499395). 4808

HG77b [223] Henry Garrett, “Neutrosophic Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 4809
10.5281/zenodo.7497450). 4810

HG76b [224] Henry Garrett, “Extreme Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 4811
10.5281/zenodo.7497450). 4812

HG75b [225] Henry Garrett, “Neutrosophic SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 4813

10.5281/zenodo.7494862). 4814

HG74b [226] Henry Garrett, “Extreme SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4815
odo.7494862). 4816

HG73b [227] Henry Garrett, “Overlook On SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 4817
10.5281/zenodo.7494862). 4818

HG72b [228] Henry Garrett, “Neutrosophic SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 4819

10.5281/zenodo.7493845). 4820

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 Henry Garrett · Independent Researcher · Department of Mathematics ·
DrHenryGarrett@gmail.com · Manhattan, NY, USA

HG71b [229] Henry Garrett, “Extreme SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 4821
10.5281/zenodo.7493845). 4822

HG70b [230] Henry Garrett, “Overlook On SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 4823
10.5281/zenodo.7493845). 4824

HG69b [231] Henry Garrett, “SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4825
odo.7539484). 4826

HG68b [232] Henry Garrett, “Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4827

odo.7523390). 4828

HG67b [233] Henry Garrett, “SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4829
odo.7523357). 4830

HG66b [234] Henry Garrett, “Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4831
odo.7504782). 4832

HG65b [235] Henry Garrett, “SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4833
odo.7499395). 4834

HG64b [236] Henry Garrett, “Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4835
odo.7497450). 4836

HG63b [237] Henry Garrett, “SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4837

odo.7494862). 4838

HG62b [238] Henry Garrett, “SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4839
odo.7493845). 4840

HG61b [239] Henry Garrett, “SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4841
odo.7480110). 4842

HG60b [240] Henry Garrett, “Neut. SuperHyperEdges”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4843
odo.7378758). 4844

HG32b [241] Henry Garrett, “Beyond Neutrosophic Graphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4845
odo.6320305). 4846

HG44b [242] Henry Garrett, “Neutrosophic Duality”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 4847

odo.6677173). 4848

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 CHAPTER 24 4849

Cancer In Neutrosophic 4850

SuperHyperGraph 4851

The cancer is the Neutrosophic disease but the Neutrosophic model is going to figure out what’s 4852
going on this Neutrosophic phenomenon. The special Neutrosophic case of this Neutrosophic 4853
disease is considered and as the consequences of the model, some parameters are used. The cells 4854
are under attack of this disease but the moves of the cancer in the special region are the matter 4855

of mind. The Neutrosophic recognition of the cancer could help to find some Neutrosophic 4856
treatments for this Neutrosophic disease. 4857
In the following, some Neutrosophic steps are Neutrosophic devised on this disease. 4858

Step 1. (Neutrosophic Definition) The Neutrosophic recognition of the cancer in the long- 4859
term Neutrosophic function. 4860

Step 2. (Neutrosophic Issue) The specific region has been assigned by the Neutrosophic 4861
model [it’s called Neutrosophic SuperHyperGraph] and the long Neutrosophic cycle of the 4862
move from the cancer is identified by this research. Sometimes the move of the cancer 4863
hasn’t be easily identified since there are some determinacy, indeterminacy and neutrality 4864

about the moves and the effects of the cancer on that region; this event leads us to 4865
choose another model [it’s said to be Neutrosophic SuperHyperGraph] to have convenient 4866
perception on what’s happened and what’s done. 4867

Step 3. (Neutrosophic Model) There are some specific Neutrosophic models, which are well- 4868

known and they’ve got the names, and some general Neutrosophic models. The moves 4869
and the Neutrosophic traces of the cancer on the complex tracks and between complicated 4870
groups of cells could be fantasized by a Neutrosophic SuperHyperPath(-/SuperHyperK- 4871
Domination, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHy- 4872
perWheel). The aim is to find either the Neutrosophic SuperHyperK-Domination or the 4873
Neutrosophic SuperHyperK-Domination in those Neutrosophic Neutrosophic SuperHyper- 4874

Models. 4875

Some cells have been faced with some attacks from the situation which is caused by the 4876
cancer’s attacks. In this case, there are some embedded analysis on the ongoing situations 4877
which in that, the cells could be labelled as some groups and some groups or individuals have 4878
excessive labels which all are raised from the behaviors to overcome the cancer’s attacks. In 4879

the embedded situations, the individuals of cells and the groups of cells could be considered 4880

235
Henry Garrett · Independent Researcher · Department of Mathematics ·
DrHenryGarrett@gmail.com · Manhattan, NY, USA

as “new groups”. Thus it motivates us to find the proper SuperHyperModels for getting more 4881
proper analysis on this messy story. I’ve found the SuperHyperModels which are officially called 4882
“SuperHyperGraphs” and “Neutrosophic SuperHyperGraphs”. In this SuperHyperModel, the 4883
cells and the groups of cells are defined as “SuperHyperVertices” and the relations between the 4884
individuals of cells and the groups of cells are defined as “SuperHyperEdges”. Thus it’s another 4885
motivation for us to do research on this SuperHyperModel based on the “Cancer’s Recognition”. 4886

Sometimes, the situations get worst. The situation is passed from the certainty and precise style. 4887
Thus it’s the beyond them. There are three descriptions, namely, the degrees of determinacy, 4888
indeterminacy and neutrality, for any object based on vague forms, namely, incomplete data, 4889
imprecise data, and uncertain analysis. The latter model could be considered on the previous 4890
SuperHyperModel. It’s SuperHyperModel. It’s SuperHyperGraph but it’s officially called 4891
“Neutrosophic SuperHyperGraphs”. The cancer is the disease but the model is going to figure 4892

out what’s going on this phenomenon. The special case of this disease is considered and as the 4893
consequences of the model, some parameters are used. The cells are under attack of this disease 4894
but the moves of the cancer in the special region are the matter of mind. The recognition of 4895
the cancer could help to find some treatments for this disease. The SuperHyperGraph and 4896
Neutrosophic SuperHyperGraph are the SuperHyperModels on the “Cancer’s Recognition” and 4897
both bases are the background of this research. Sometimes the cancer has been happened on the 4898

region, full of cells, groups of cells and embedded styles. In this segment, the SuperHyperModel 4899
proposes some SuperHyperNotions based on the connectivities of the moves of the cancer 4900
in the forms of alliances’ styles with the formation of the design and the architecture are 4901
formally called “ SuperHyperK-Domination” in the themes of jargons and buzzwords. The 4902
prefix “SuperHyper” refers to the theme of the embedded styles to figure out the background for 4903
the SuperHyperNotions. The recognition of the cancer in the long-term function. The specific 4904

region has been assigned by the model [it’s called SuperHyperGraph] and the long cycle of the 4905
move from the cancer is identified by this research. Sometimes the move of the cancer hasn’t be 4906
easily identified since there are some determinacy, indeterminacy and neutrality about the moves 4907
and the effects of the cancer on that region; this event leads us to choose another model [it’s 4908
said to be Neutrosophic SuperHyperGraph] to have convenient perception on what’s happened 4909
and what’s done. There are some specific models, which are well-known and they’ve got the 4910

names, and some general models. The moves and the traces of the cancer on the complex tracks 4911
and between complicated groups of cells could be fantasized by a Neutrosophic SuperHyperPath 4912
(-/SuperHyperK-Domination, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, 4913
SuperHyperWheel). The aim is to find either the optimal SuperHyperK-Domination or the 4914
Neutrosophic SuperHyperK-Domination in those Neutrosophic SuperHyperModels. Some 4915

general results are introduced. Beyond that in SuperHyperStar, all possible Neutrosophic 4916
SuperHyperPath s have only two SuperHyperEdges but it’s not enough since it’s essential to 4917
have at least three SuperHyperEdges to form any style of a SuperHyperK-Domination. There 4918
isn’t any formation of any SuperHyperK-Domination but literarily, it’s the deformation of any 4919
SuperHyperK-Domination. It, literarily, deforms and it doesn’t form. 4920

Question 24.0.1. How to define the SuperHyperNotions and to do research on them to find the “ 4921
amount of SuperHyperK-Domination” of either individual of cells or the groups of cells based on 4922
the fixed cell or the fixed group of cells, extensively, the “amount of SuperHyperK-Domination” 4923

based on the fixed groups of cells or the fixed groups of group of cells? 4924

Question 24.0.2. What are the best descriptions for the “Cancer’s Recognition” in terms of 4925

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 Henry Garrett · Independent Researcher · Department of Mathematics ·
DrHenryGarrett@gmail.com · Manhattan, NY, USA

these messy and dense SuperHyperModels where embedded notions are illustrated? 4926

It’s motivation to find notions to use in this dense model is titled “SuperHyperGraphs”. 4927

Thus it motivates us to define different types of “ SuperHyperK-Domination” and “Neutrosophic 4928

SuperHyperK-Domination” on “SuperHyperGraph” and “Neutrosophic SuperHyperGraph”. 4929
Then the research has taken more motivations to define SuperHyperClasses and to find some 4930
connections amid this SuperHyperNotion with other SuperHyperNotions. It motivates us to get 4931
some instances and examples to make clarifications about the framework of this research. The 4932
general results and some results about some connections are some avenues to make key point of 4933

this research, “Cancer’s Recognition”, more understandable and more clear. 4934
Some SuperHyperClasses and some Neutrosophic SuperHyperClasses are the cases of this 4935
research on the modeling of the regions where are under the attacks of the cancer to 4936
recognize this disease as it’s mentioned on the title “Cancer’s Recognitions”. To formalize 4937
the instances on the SuperHyperNotion, SuperHyperK-Domination, the new SuperHyperClasses 4938
and SuperHyperClasses, are introduced. Some general results are gathered in the section on the 4939

SuperHyperK-Domination and the Neutrosophic SuperHyperK-Domination. The clarifications, 4940

instances and literature reviews have taken the whole way through. In this scientific research, 4941
the literature reviews have fulfilled the lines containing the notions and the results. The 4942
SuperHyperGraph and Neutrosophic SuperHyperGraph are the SuperHyperModels on the 4943
“Cancer’s Recognitions” and both bases are the background of this research. Sometimes the 4944
cancer has been happened on the region, full of cells, groups of cells and embedded styles. In 4945

this scientific segment, the SuperHyperModel proposes some SuperHyperNotions based on the 4946
connectivities of the moves of the cancer in the longest and strongest styles with the formation of 4947
the design and the architecture are formally called “ SuperHyperK-Domination” in the themes 4948
of jargons and buzzwords. The prefix “SuperHyper” refers to the theme of the embedded styles 4949
to figure out the background for the SuperHyperNotions. 4950

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 CHAPTER 25 4951

Neutrosophic Trace-Neighbor 4952

Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of SuperHyperDu- 4953
ality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, ResearchGate 4954

2023, (doi: 10.13140/RG.2.2.34953.52320). 4955

Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph By 4956
SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchGate 2023, 4957
(doi: 10.13140/RG.2.2.33275.80161). 4958
Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 4959
By SuperHyperJoin As Hyper Separations On Super Sorts”, ResearchGate 2023, (doi: 4960

10.13140/RG.2.2.11050.90569). 4961
Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of SuperHyperJoin 4962
In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 4963
10.13140/RG.2.2.17761.79206). 4964
Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 4965
By SuperHyperPerfect As Hyper Idealism On Super Vacancy”, ResearchGate 2023, (doi: 4966

10.13140/RG.2.2.19911.37285). 4967
Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect 4968
In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 4969
10.13140/RG.2.2.23266.81602). 4970
Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 4971
By SuperHyperTotal As Hyper Covering On Super Infections”, ResearchGate 2023, (doi: 4972

10.13140/RG.2.2.19360.87048). 4973
Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal 4974
In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 4975
10.13140/RG.2.2.32363.21286). 4976
Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 4977
By SuperHyperConnected As Hyper Group On Super Surge”, ResearchGate 2023, (doi: 4978

10.13140/RG.2.2.11758.69441). 4979
Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of SuperHyperConnected 4980
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 4981
10.13140/RG.2.2.31891.35367). 4982
Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 4983
By SuperHyperDominating As Hyper Closing On Super Messy”, ResearchGate 2023, (doi: 4984

10.13140/RG.2.2.21510.45125). 4985

239
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 4986
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 4987
10.13140/RG.2.2.13121.84321). 4988

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 CHAPTER 26 4989

New Ideas In Recognition of Cancer And 4990

Neutrosophic SuperHyperGraph By 4991

Trace-Neighbor As Hyper Nebbish On 4992

Super Nebulous 4993

241
 CHAPTER 27 4994

ABSTRACT 4995

In this scientific research, (Different Neutrosophic Types of Neutrosophic SuperHyperTrace- 4996

Decomposition). Assume a Neutrosophic SuperHyperGraph (NSHG) S is a Trace-Decomposition 4997
pair S = (V, E). Consider a Neutrosophic SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and E 0 = 4998
{E1 , E2 , . . . , Ez }. Then either V 0 or E 0 is called Neutrosophic e-SuperHyperTrace-Decomposition 4999
if the following expression is called Neutrosophic e-SuperHyperTrace-Decomposition criteria 5000
holds 5001

∀N (Ea ) ∈ P : P is a SuperHyperPath and it has all SuperHyperVertices;

Neutrosophic re-SuperHyperTrace-Decomposition if the following expression is called Neutro- 5002

sophic e-SuperHyperTrace-Decomposition criteria holds 5003

∀N (Ea ) ∈ P : P is a SuperHyperPath and it has all SuperHyperVertices;

and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; Neutrosophic v- 5004

SuperHyperTrace-Decomposition if the following expression is called Neutrosophic v- 5005
SuperHyperTrace-Decomposition criteria holds 5006

∀N (Va ) ∈ P : P is a SuperHyperPath and it has all SuperHyperVertices;

Neutrosophic rv-SuperHyperTrace-Decomposition if the following expression is called Neutro- 5007

sophic v-SuperHyperTrace-Decomposition criteria holds 5008

∀N (Va ) ∈ P : P is a SuperHyperPath and it has all SuperHyperVertices;

and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; Neutrosophic 5009

SuperHyperTrace-Decomposition if it’s either of Neutrosophic e-SuperHyperTrace- 5010
Decomposition, Neutrosophic re-SuperHyperTrace-Decomposition, Neutrosophic v- 5011

SuperHyperTrace-Decomposition, and Neutrosophic rv-SuperHyperTrace-Decomposition. 5012

((Neutrosophic) SuperHyperTrace-Decomposition). Assume a Neutrosophic SuperHyper- 5013
Graph (NSHG) S is a pair S = (V, E). Consider a Neutrosophic SuperHyperEdge (NSHE) 5014
E = {V1 , V2 , . . . , Vs }. Then E is called an Extreme SuperHyperTrace-Decomposition if it’s 5015
either of Neutrosophic e-SuperHyperTrace-Decomposition, Neutrosophic re-SuperHyperTrace- 5016
Decomposition, Neutrosophic v-SuperHyperTrace-Decomposition, and Neutrosophic rv- 5017

SuperHyperTrace-Decomposition and C(N SHG) for an Extreme SuperHyperGraph N SHG : 5018

243
Henry Garrett · Independent Researcher · Department of Mathematics ·
DrHenryGarrett@gmail.com · Manhattan, NY, USA

(V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Extreme 5019
cardinality of the Extreme SuperHyperEdges in the conseNeighborive Extreme sequence of 5020
Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the Extreme 5021
SuperHyperTrace-Decomposition; a Neutrosophic SuperHyperTrace-Decomposition if it’s 5022
either of Neutrosophic e-SuperHyperTrace-Decomposition, Neutrosophic re-SuperHyperTrace- 5023
Decomposition, Neutrosophic v-SuperHyperTrace-Decomposition, and Neutrosophic rv- 5024

SuperHyperTrace-Decomposition and C(N SHG) for a Neutrosophic SuperHyperGraph 5025

N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic SuperHy- 5026
perEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality conseNeighborive 5027
Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the 5028
Neutrosophic SuperHyperTrace-Decomposition; an Extreme SuperHyperTrace-Decomposition 5029
SuperHyperPolynomial if it’s either of Neutrosophic e-SuperHyperTrace-Decomposition, Neut- 5030

rosophic re-SuperHyperTrace-Decomposition, Neutrosophic v-SuperHyperTrace-Decomposition, 5031

and Neutrosophic rv-SuperHyperTrace-Decomposition and C(N SHG) for an Extreme Supe- 5032
rHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme 5033
coefficients defined as the Extreme number of the maximum Extreme cardinality of the 5034
Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme cardinality 5035
conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 5036

form the Extreme SuperHyperTrace-Decomposition; and the Extreme power is corresponded 5037
to its Extreme coefficient; a Neutrosophic SuperHyperTrace-Decomposition SuperHyper- 5038
Polynomial if it’s either of Neutrosophic e-SuperHyperTrace-Decomposition, Neutrosophic 5039
re-SuperHyperTrace-Decomposition, Neutrosophic v-SuperHyperTrace-Decomposition, and 5040
Neutrosophic rv-SuperHyperTrace-Decomposition and C(N SHG) for a Neutrosophic SuperHy- 5041
perGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains the Neutrosophic 5042

coefficients defined as the Neutrosophic number of the maximum Neutrosophic cardinality of the 5043
Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic cardin- 5044
ality conseNeighborive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices 5045
such that they form the Neutrosophic SuperHyperTrace-Decomposition; and the Neutrosophic 5046
power is corresponded to its Neutrosophic coefficient; an Extreme V-SuperHyperTrace- 5047
Decomposition if it’s either of Neutrosophic e-SuperHyperTrace-Decomposition, Neutrosophic 5048

re-SuperHyperTrace-Decomposition, Neutrosophic v-SuperHyperTrace-Decomposition, and 5049

Neutrosophic rv-SuperHyperTrace-Decomposition and C(N SHG) for an Extreme SuperHyper- 5050
Graph N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet 5051
S of high Extreme cardinality of the Extreme SuperHyperVertices in the conseNeighborive 5052
Extreme sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that 5053

they form the Extreme SuperHyperTrace-Decomposition; a Neutrosophic V-SuperHyperTrace- 5054

Decomposition if it’s either of Neutrosophic e-SuperHyperTrace-Decomposition, Neutrosophic re- 5055
SuperHyperTrace-Decomposition, Neutrosophic v-SuperHyperTrace-Decomposition, and Neutro- 5056
sophic rv-SuperHyperTrace-Decomposition and C(N SHG) for a Neutrosophic SuperHyperGraph 5057
N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVer- 5058
tices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality conseNeighborive 5059

Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the 5060
Neutrosophic SuperHyperTrace-Decomposition; an Extreme V-SuperHyperTrace-Decomposition 5061
SuperHyperPolynomial if it’s either of Neutrosophic e-SuperHyperTrace-Decomposition, Neut- 5062
rosophic re-SuperHyperTrace-Decomposition, Neutrosophic v-SuperHyperTrace-Decomposition, 5063
and Neutrosophic rv-SuperHyperTrace-Decomposition and C(N SHG) for an Extreme Supe- 5064

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 Henry Garrett · Independent Researcher · Department of Mathematics ·
DrHenryGarrett@gmail.com · Manhattan, NY, USA

rHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme 5065
coefficients defined as the Extreme number of the maximum Extreme cardinality of the 5066
Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality 5067
conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 5068
form the Extreme SuperHyperTrace-Decomposition; and the Extreme power is corresponded 5069
to its Extreme coefficient; a Neutrosophic SuperHyperTrace-Decomposition SuperHyper- 5070

Polynomial if it’s either of Neutrosophic e-SuperHyperTrace-Decomposition, Neutrosophic 5071

re-SuperHyperTrace-Decomposition, Neutrosophic v-SuperHyperTrace-Decomposition, and 5072
Neutrosophic rv-SuperHyperTrace-Decomposition and C(N SHG) for a Neutrosophic SuperHy- 5073
perGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains the Neutrosophic 5074
coefficients defined as the Neutrosophic number of the maximum Neutrosophic cardinality of the 5075
Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic car- 5076

dinality conseNeighborive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices 5077

such that they form the Neutrosophic SuperHyperTrace-Decomposition; and the Neutrosophic 5078
power is corresponded to its Neutrosophic coefficient. In this scientific research, new setting is 5079
introduced for new SuperHyperNotions, namely, a SuperHyperTrace-Decomposition and Neut- 5080
rosophic SuperHyperTrace-Decomposition. Two different types of SuperHyperDefinitions are 5081
debut for them but the research goes further and the SuperHyperNotion, SuperHyperUniform, 5082

and SuperHyperClass based on that are well-defined and well-reviewed. The literature review is 5083
implemented in the whole of this research. For shining the elegancy and the significancy of this 5084
research, the comparison between this SuperHyperNotion with other SuperHyperNotions and 5085
fundamental SuperHyperNumbers are featured. The definitions are followed by the examples 5086
and the instances thus the clarifications are driven with different tools. The applications are 5087
figured out to make sense about the theoretical aspect of this ongoing research. The “Cancer’s 5088

Recognition” are the under research to figure out the challenges make sense about ongoing and 5089
upcoming research. The special case is up. The cells are viewed in the deemed ways. There are 5090
different types of them. Some of them are individuals and some of them are well-modeled by 5091
the group of cells. These types are all officially called “SuperHyperVertex” but the relations 5092
amid them all officially called “SuperHyperEdge”. The frameworks “SuperHyperGraph” and 5093
“Neutrosophic SuperHyperGraph” are chosen and elected to research about “Cancer’s Recogni- 5094

tion”. Thus these complex and dense SuperHyperModels open up some avenues to research 5095
on theoretical segments and “Cancer’s Recognition”. Some avenues are posed to pursue this 5096
research. It’s also officially collected in the form of some questions and some problems. Assume 5097
a SuperHyperGraph. Assume a SuperHyperGraph. Then δ−SuperHyperTrace-Decomposition 5098
is a maximal of SuperHyperVertices with a maximum cardinality such that either of the 5099

following expressions hold for the (Neutrosophic) cardinalities of SuperHyperNeighbors of 5100

s ∈ S : there are |S ∩ N (s)| > |S ∩ (V \ N (s))| + δ; and |S ∩ N (s)| < |S ∩ (V \ N (s))| + δ. The 5101
first Expression, holds if S is an δ−SuperHyperOffensive. And the second Expression, holds 5102
if S is an δ−SuperHyperDefensive; a Neutrosophic δ−SuperHyperTrace-Decomposition is a 5103
maximal Neutrosophic of SuperHyperVertices with maximum Neutrosophic cardinality 5104
such that either of the following expressions hold for the Neutrosophic cardinalities of Super- 5105

HyperNeighbors of s ∈ S there are: |S ∩ N (s)|N eutrosophic > |S ∩ (V \ N (s))|N eutrosophic + δ; 5106

and |S ∩ N (s)|N eutrosophic < |S ∩ (V \ N (s))|N eutrosophic + δ. The first Expression, holds 5107
if S is a Neutrosophic δ−SuperHyperOffensive. And the second Expression, holds if S is a 5108
Neutrosophic δ−SuperHyperDefensive It’s useful to define a “Neutrosophic” version of a 5109
SuperHyperTrace-Decomposition . Since there’s more ways to get type-results to make a 5110

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics ·
DrHenryGarrett@gmail.com · Manhattan, NY, USA

SuperHyperTrace-Decomposition more understandable. For the sake of having Neutrosophic 5111

SuperHyperTrace-Decomposition, there’s a need to “redefine” the notion of a “SuperHyperTrace- 5112
Decomposition ”. The SuperHyperVertices and the SuperHyperEdges are assigned by the labels 5113
from the letters of the alphabets. In this procedure, there’s the usage of the position of labels to 5114
assign to the values. Assume a SuperHyperTrace-Decomposition . It’s redefined a Neutrosophic 5115
SuperHyperTrace-Decomposition if the mentioned Table holds, concerning, “The Values of 5116

Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges Belong to The Neutrosophic 5117
SuperHyperGraph” with the key points, “The Values of The Vertices & The Number of Position 5118
in Alphabet”, “The Values of The SuperVertices&The maximum Values of Its Vertices”, “The Val- 5119
ues of The Edges&The maximum Values of Its Vertices”, “The Values of The HyperEdges&The 5120
maximum Values of Its Vertices”, “The Values of The SuperHyperEdges&The maximum Values 5121
of Its Endpoints”. To get structural examples and instances, I’m going to introduce the next 5122

SuperHyperClass of SuperHyperGraph based on a SuperHyperTrace-Decomposition . It’s 5123

the main. It’ll be disciplinary to have the foundation of previous definition in the kind of 5124
SuperHyperClass. If there’s a need to have all SuperHyperTrace-Decomposition until the 5125
SuperHyperTrace-Decomposition, then it’s officially called a “SuperHyperTrace-Decomposition” 5126
but otherwise, it isn’t a SuperHyperTrace-Decomposition . There are some instances about the 5127
clarifications for the main definition titled a “SuperHyperTrace-Decomposition ”. These two 5128

examples get more scrutiny and discernment since there are characterized in the disciplinary 5129
ways of the SuperHyperClass based on a SuperHyperTrace-Decomposition . For the sake of 5130
having a Neutrosophic SuperHyperTrace-Decomposition, there’s a need to “redefine” the notion 5131
of a “Neutrosophic SuperHyperTrace-Decomposition” and a “Neutrosophic SuperHyperTrace- 5132
Decomposition ”. The SuperHyperVertices and the SuperHyperEdges are assigned by the 5133
labels from the letters of the alphabets. In this procedure, there’s the usage of the position 5134

of labels to assign to the values. Assume a Neutrosophic SuperHyperGraph. It’s redefined 5135
“Neutrosophic SuperHyperGraph” if the intended Table holds. And a SuperHyperTrace- 5136
Decomposition are redefined to a “Neutrosophic SuperHyperTrace-Decomposition” if the 5137
intended Table holds. It’s useful to define “Neutrosophic” version of SuperHyperClasses. Since 5138
there’s more ways to get Neutrosophic type-results to make a Neutrosophic SuperHyperTrace- 5139
Decomposition more understandable. Assume a Neutrosophic SuperHyperGraph. There are 5140

some Neutrosophic SuperHyperClasses if the intended Table holds. Thus SuperHyperPath, 5141
SuperHyperTrace-Decomposition, SuperHyperStar, SuperHyperBipartite, SuperHyperMul- 5142
tiPartite, and SuperHyperWheel, are “Neutrosophic SuperHyperPath”, “Neutrosophic 5143
SuperHyperTrace-Decomposition”, “Neutrosophic SuperHyperStar”, “Neutrosophic SuperHy- 5144
perBipartite”, “Neutrosophic SuperHyperMultiPartite”, and “Neutrosophic SuperHyperWheel” 5145

if the intended Table holds. A SuperHyperGraph has a “Neutrosophic SuperHyperTrace- 5146

Decomposition” where it’s the strongest [the maximum Neutrosophic value from all the 5147
SuperHyperTrace-Decomposition amid the maximum value amid all SuperHyperVertices 5148
from a SuperHyperTrace-Decomposition .] SuperHyperTrace-Decomposition . A graph is a 5149
SuperHyperUniform if it’s a SuperHyperGraph and the number of elements of SuperHyperEdges 5150
are the same. Assume a Neutrosophic SuperHyperGraph. There are some SuperHyperClasses 5151

as follows. It’s SuperHyperPath if it’s only one SuperVertex as intersection amid two given 5152
SuperHyperEdges with two exceptions; it’s SuperHyperTrace-Decomposition if it’s only one 5153
SuperVertex as intersection amid two given SuperHyperEdges; it’s SuperHyperStar it’s only one 5154
SuperVertex as intersection amid all SuperHyperEdges; it’s SuperHyperBipartite it’s only one 5155
SuperVertex as intersection amid two given SuperHyperEdges and these SuperVertices, forming 5156

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 Henry Garrett · Independent Researcher · Department of Mathematics ·
DrHenryGarrett@gmail.com · Manhattan, NY, USA

two separate sets, has no SuperHyperEdge in common; it’s SuperHyperMultiPartite it’s only 5157
one SuperVertex as intersection amid two given SuperHyperEdges and these SuperVertices, 5158
forming multi separate sets, has no SuperHyperEdge in common; it’s a SuperHyperWheel if it’s 5159
only one SuperVertex as intersection amid two given SuperHyperEdges and one SuperVertex 5160
has one SuperHyperEdge with any common SuperVertex. The SuperHyperModel proposes 5161
the specific designs and the specific architectures. The SuperHyperModel is officially called 5162

“SuperHyperGraph” and “Neutrosophic SuperHyperGraph”. In this SuperHyperModel, The 5163

“specific” cells and “specific group” of cells are SuperHyperModeled as “SuperHyperVertices” 5164
and the common and intended properties between “specific” cells and “specific group” of cells 5165
are SuperHyperModeled as “SuperHyperEdges”. Sometimes, it’s useful to have some degrees of 5166
determinacy, indeterminacy, and neutrality to have more precise SuperHyperModel which in this 5167
case the SuperHyperModel is called “Neutrosophic”. In the future research, the foundation will 5168

be based on the “Cancer’s Recognition” and the results and the definitions will be introduced 5169
in redeemed ways. The recognition of the cancer in the long-term function. The specific region 5170
has been assigned by the model [it’s called SuperHyperGraph] and the long cycle of the move 5171
from the cancer is identified by this research. Sometimes the move of the cancer hasn’t be easily 5172
identified since there are some determinacy, indeterminacy and neutrality about the moves 5173
and the effects of the cancer on that region; this event leads us to choose another model [it’s 5174

said to be Neutrosophic SuperHyperGraph] to have convenient perception on what’s happened 5175

and what’s done. There are some specific models, which are well-known and they’ve got the 5176
names, and some SuperHyperGeneral SuperHyperModels. The moves and the traces of the 5177
cancer on the complex tracks and between complicated groups of cells could be fantasized 5178
by a Neutrosophic SuperHyperPath(-/SuperHyperTrace-Decomposition, SuperHyperStar, 5179
SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find either 5180

the longest SuperHyperTrace-Decomposition or the strongest SuperHyperTrace-Decomposition 5181

in those Neutrosophic SuperHyperModels. For the longest SuperHyperTrace-Decomposition, 5182
called SuperHyperTrace-Decomposition, and the strongest SuperHyperTrace-Decomposition, 5183
called Neutrosophic SuperHyperTrace-Decomposition, some general results are introduced. 5184
Beyond that in SuperHyperStar, all possible SuperHyperPaths have only two SuperHyperEdges 5185
but it’s not enough since it’s essential to have at least three SuperHyperEdges to form any 5186

style of a SuperHyperTrace-Decomposition. There isn’t any formation of any SuperHyperTrace- 5187

Decomposition but literarily, it’s the deformation of any SuperHyperTrace-Decomposition. It, 5188
literarily, deforms and it doesn’t form. A basic familiarity with Neutrosophic SuperHyperTrace- 5189
Decomposition theory, SuperHyperGraphs, and Neutrosophic SuperHyperGraphs theory are 5190
proposed. 5191

Keywords: Neutrosophic SuperHyperGraph, SuperHyperTrace-Decomposition, Cancer’s 5192

Neutrosophic Recognition 5193

AMS Subject Classification: 05C17, 05C22, 05E45 5194

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 CHAPTER 28 5195

Applied Notions Under The Scrutiny Of 5196

The Motivation Of This Scientific 5197

Research 5198

In this scientific research, there are some ideas in the featured frameworks of motivations. I 5199
try to bring the motivations in the narrative ways. Some cells have been faced with some 5200
attacks from the situation which is caused by the cancer’s attacks. In this case, there are 5201
some embedded analysis on the ongoing situations which in that, the cells could be labelled 5202

as some groups and some groups or individuals have excessive labels which all are raised from 5203
the behaviors to overcome the cancer’s attacks. In the embedded situations, the individuals 5204
of cells and the groups of cells could be considered as “new groups”. Thus it motivates us to 5205
find the proper SuperHyperModels for getting more proper analysis on this messy story. I’ve 5206
found the SuperHyperModels which are officially called “SuperHyperGraphs” and “Neutrosophic 5207
SuperHyperGraphs”. In this SuperHyperModel, the cells and the groups of cells are defined as 5208

“SuperHyperVertices” and the relations between the individuals of cells and the groups of cells 5209
are defined as “SuperHyperEdges”. Thus it’s another motivation for us to do research on this 5210
SuperHyperModel based on the “Cancer’s Recognition”. Sometimes, the situations get worst. 5211
The situation is passed from the certainty and precise style. Thus it’s the beyond them. There 5212
are three descriptions, namely, the degrees of determinacy, indeterminacy and neutrality, for any 5213
object based on vague forms, namely, incomplete data, imprecise data, and uncertain analysis. 5214

The latter model could be considered on the previous SuperHyperModel. It’s SuperHyperModel. 5215
It’s SuperHyperGraph but it’s officially called “Neutrosophic SuperHyperGraphs”. The cancer 5216
is the disease but the model is going to figure out what’s going on this phenomenon. The special 5217
case of this disease is considered and as the consequences of the model, some parameters are used. 5218
The cells are under attack of this disease but the moves of the cancer in the special region are the 5219
matter of mind. The recognition of the cancer could help to find some treatments for this disease. 5220

The SuperHyperGraph and Neutrosophic SuperHyperGraph are the SuperHyperModels on the 5221
“Cancer’s Recognition” and both bases are the background of this research. Sometimes the 5222
cancer has been happened on the region, full of cells, groups of cells and embedded styles. In this 5223
segment, the SuperHyperModel proposes some SuperHyperNotions based on the connectivities 5224
of the moves of the cancer in the forms of alliances’ styles with the formation of the design and 5225
the architecture are formally called “ SuperHyperTrace-Decomposition” in the themes of jargons 5226

and buzzwords. The prefix “SuperHyper” refers to the theme of the embedded styles to figure 5227

249
Henry Garrett · Independent Researcher · Department of Mathematics ·
DrHenryGarrett@gmail.com · Manhattan, NY, USA

out the background for the SuperHyperNotions. The recognition of the cancer in the long-term 5228
function. The specific region has been assigned by the model [it’s called SuperHyperGraph] 5229
and the long cycle of the move from the cancer is identified by this research. Sometimes the 5230
move of the cancer hasn’t be easily identified since there are some determinacy, indeterminacy 5231
and neutrality about the moves and the effects of the cancer on that region; this event leads us 5232
to choose another model [it’s said to be Neutrosophic SuperHyperGraph] to have convenient 5233

perception on what’s happened and what’s done. There are some specific models, which are 5234
well-known and they’ve got the names, and some general models. The moves and the traces of 5235
the cancer on the complex tracks and between complicated groups of cells could be fantasized 5236
by a Neutrosophic SuperHyperPath (-/SuperHyperTrace-Decomposition, SuperHyperStar, 5237
SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find either the 5238
optimal SuperHyperTrace-Decomposition or the Neutrosophic SuperHyperTrace-Decomposition 5239

in those Neutrosophic SuperHyperModels. Some general results are introduced. Beyond that in 5240
SuperHyperStar, all possible Neutrosophic SuperHyperPath s have only two SuperHyperEdges 5241
but it’s not enough since it’s essential to have at least three SuperHyperEdges to form any 5242
style of a SuperHyperTrace-Decomposition. There isn’t any formation of any SuperHyperTrace- 5243
Decomposition but literarily, it’s the deformation of any SuperHyperTrace-Decomposition. It, 5244
literarily, deforms and it doesn’t form. 5245

Question 28.0.1. How to define the SuperHyperNotions and to do research on them to find the 5246

“ amount of SuperHyperTrace-Decomposition” of either individual of cells or the groups of cells 5247

based on the fixed cell or the fixed group of cells, extensively, the “amount of SuperHyperTrace- 5248
Decomposition” based on the fixed groups of cells or the fixed groups of group of cells? 5249

Question 28.0.2. What are the best descriptions for the “Cancer’s Recognition” in terms of 5250
these messy and dense SuperHyperModels where embedded notions are illustrated? 5251

It’s motivation to find notions to use in this dense model is titled “SuperHyperGraphs”. 5252
Thus it motivates us to define different types of “ SuperHyperTrace-Decomposition” and 5253

“Neutrosophic SuperHyperTrace-Decomposition” on “SuperHyperGraph” and “Neutrosophic 5254

SuperHyperGraph”. Then the research has taken more motivations to define SuperHyperClasses 5255
and to find some connections amid this SuperHyperNotion with other SuperHyperNotions. It 5256
motivates us to get some instances and examples to make clarifications about the framework of 5257
this research. The general results and some results about some connections are some avenues to 5258
make key point of this research, “Cancer’s Recognition”, more understandable and more clear. 5259

The framework of this research is as follows. In the beginning, I introduce basic definitions 5260
to clarify about preliminaries. In the subsection “Preliminaries”, initial definitions about 5261
SuperHyperGraphs and Neutrosophic SuperHyperGraph are deeply-introduced and in-depth- 5262
discussed. The elementary concepts are clarified and illustrated completely and sometimes 5263
review literature are applied to make sense about what’s going to figure out about the upcoming 5264
sections. The main definitions and their clarifications alongside some results about new notions, 5265

SuperHyperTrace-Decomposition and Neutrosophic SuperHyperTrace-Decomposition, are 5266

figured out in sections “ SuperHyperTrace-Decomposition” and “Neutrosophic SuperHyperTrace- 5267
Decomposition”. In the sense of tackling on getting results and in Trace-Decomposition to 5268
make sense about continuing the research, the ideas of SuperHyperUniform and Neutrosophic 5269
SuperHyperUniform are introduced and as their consequences, corresponded SuperHyperClasses 5270
are figured out to debut what’s done in this section, titled “Results on SuperHyperClasses” 5271

and “Results on Neutrosophic SuperHyperClasses”. As going back to origin of the notions, 5272

Henry Garrett · 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 5273
frameworks, SuperHyperGraph and Neutrosophic SuperHyperGraph, in the sections “Results 5274
on SuperHyperClasses” and “Results on Neutrosophic SuperHyperClasses”. The starter research 5275
about the general SuperHyperRelations and as concluding and closing section of theoretical 5276
research are contained in the section “General Results”. Some general SuperHyperRelations 5277
are fundamental and they are well-known as fundamental SuperHyperNotions as elicited 5278

and discussed in the sections, “General Results”, “ SuperHyperTrace-Decomposition”, 5279

“Neutrosophic SuperHyperTrace-Decomposition”, “Results on SuperHyperClasses” and “Results 5280
on Neutrosophic SuperHyperClasses”. There are curious questions about what’s done about 5281
the SuperHyperNotions to make sense about excellency of this research and going to figure out 5282
the word “best” as the description and adjective for this research as presented in section, 5283
“ SuperHyperTrace-Decomposition”. The keyword of this research debut in the section 5284

“Applications in Cancer’s Recognition” with two cases and subsections “Case 1: The Initial 5285
Steps Toward SuperHyperBipartite as SuperHyperModel” and “Case 2: The Increasing Steps 5286
Toward SuperHyperMultipartite as SuperHyperModel”. In the section, “Open Problems”, there 5287
are some scrutiny and discernment on what’s done and what’s happened in this research in 5288
the terms of “questions” and “problems” to make sense to figure out this research in featured 5289
style. The advantages and the limitations of this research alongside about what’s done in this 5290

research to make sense and to get sense about what’s figured out are included in the section, 5291
“Conclusion and Closing Remarks”. 5292

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 CHAPTER 29 5293

Neutrosophic Preliminaries Of This 5294

Scientific Research On the Redeemed 5295

Ways 5296

In this section, the basic material in this scientific research, is referred to [Single Valued 5297

Neutrosophic Set](Ref.[HG38],Definition 2.2,p.2), [Neutrosophic Set](Ref.[HG38],Definition 5298

2.1,p.1), [Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG38],Definition 2.5,p.2), [Charac- 5299
terization of the Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG38],Definition 2.7,p.3), 5300
[t-norm](Ref.[HG38], Definition 2.7, p.3), and [Characterization of the Neutrosophic SuperHy- 5301
perGraph (NSHG)](Ref.[HG38],Definition 2.7,p.3), [Neutrosophic Strength of the Neutrosophic 5302
SuperHyperPaths] (Ref.[HG38],Definition 5.3,p.7), and [Different Neutrosophic Types of Neut- 5303

rosophic SuperHyperEdges (NSHE)] (Ref.[HG38],Definition 5.4,p.7). Also, the new ideas and 5304
their clarifications are addressed to Ref.[HG38]. 5305
In this subsection, the basic material which is used in this scientific research, is presented. Also, 5306
the new ideas and their clarifications are elicited. 5307

Definition 29.0.1 (Neutrosophic Set). (Ref.[HG38],Definition 2.1,p.1).

Let X be a Trace-Decomposition 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 [. 5308

Definition 29.0.2 (Single Valued Neutrosophic Set). (Ref.[HG38],Definition 2.2,p.2).

Let X be a Trace-Decomposition 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}.

253
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). 5309
Assume V 0 is a given set. a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E), 5310
where 5311

(i) V = {V1 , V2 , . . . , Vn } a finite set of finite single valued Neutrosophic subsets of V 0 ; 5312

(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); 5313

(iii) E = {E1 , E2 , . . . , En0 } a finite set of finite single valued Neutrosophic subsets of V ; 5314

(iv) E = {(Ei0 , TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 )) : TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 ) ≥ 0}, (i0 = 5315
1, 2, . . . , n0 ); 5316

(v) Vi 6= ∅, (i = 1, 2, . . . , n); 5317

(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 5318

P
(vii) i supp(Vi ) = V, (i = 1, 2, . . . , n); 5319

0 0
P
(viii) i0 supp(Ei ) = V, (i = 1, 2, . . . , n ); 5320
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 . 5321

Here the Neutrosophic SuperHyperEdges (NSHE) Ej 0 and the Neutrosophic SuperHyperVertices 5322
(NSHV) Vj are single valued Neutrosophic sets. TV 0 (Vi ), IV 0 (Vi ), and FV 0 (Vi ) denote the 5323

degree of truth-membership, the degree of indeterminacy-membership and the degree of 5324

falsity-membership the Neutrosophic SuperHyperVertex (NSHV) Vi to the Neutrosophic 5325
SuperHyperVertex (NSHV) V. TV0 (Ei0 ), TV0 (Ei0 ), and TV0 (Ei0 ) denote the degree of truth- 5326
membership, the degree of indeterminacy-membership and the degree of falsity-membership of 5327
the Neutrosophic SuperHyperEdge (NSHE) Ei0 to the Neutrosophic SuperHyperEdge (NSHE) 5328
E. Thus, the ii0 th element of the incidence matrix of Neutrosophic SuperHyperGraph (NSHG) 5329

are of the form (Vi , TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 )), the sets V and E are crisp sets. 5330

Henry Garrett · 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)). 5331

(Ref.[HG38],Definition 2.7,p.3). 5332
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). The Neutro- 5333
sophic SuperHyperEdges (NSHE) Ei0 and the Neutrosophic SuperHyperVertices (NSHV) Vi of 5334
Neutrosophic SuperHyperGraph (NSHG) S = (V, E) could be characterized as follow-up items. 5335

(i) If |Vi | = 1, then Vi is called vertex; 5336

(ii) if |Vi | ≥ 1, then Vi is called SuperVertex; 5337

(iii) if for all Vi s are incident in Ei0 , |Vi | = 1, and |Ei0 | = 2, then Ei0 is called edge; 5338

(iv) if for all Vi s are incident in Ei0 , |Vi | = 1, and |Ei0 | ≥ 2, then Ei0 is called HyperEdge; 5339

(v) if there’s a Vi is incident in Ei0 such that |Vi | ≥ 1, and |Ei0 | = 2, then Ei0 is called 5340
SuperEdge; 5341

(vi) if there’s a Vi is incident in Ei0 such that |Vi | ≥ 1, and |Ei0 | ≥ 2, then Ei0 is called 5342
SuperHyperEdge. 5343

If we choose different types of binary operations, then we could get hugely diverse types of 5344
general forms of Neutrosophic SuperHyperGraph (NSHG). 5345

Definition 29.0.7 (t-norm). (Ref.[HG38], Definition 2.7, p.3). 5346

A binary operation ⊗ : [0, 1] × [0, 1] → [0, 1] is a t-norm if it satisfies the following for 5347
x, y, z, w ∈ [0, 1]: 5348

(i) 1 ⊗ x = x; 5349

(ii) x ⊗ y = y ⊗ x; 5350

(iii) x ⊗ (y ⊗ z) = (x ⊗ y) ⊗ z; 5351

(iv) If w ≤ x and y ≤ z then w ⊗ y ≤ x ⊗ z. 5352

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)). 5353

Assume V 0 is a given set. a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E), 5354

where 5355

Henry Garrett · 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 ; 5356

(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); 5357

(iii) E = {E1 , E2 , . . . , En0 } a finite set of finite single valued Neutrosophic subsets of V ; 5358

(iv) E = {(Ei0 , TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 )) : TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 ) ≥ 0}, (i0 = 5359

1, 2, . . . , n0 ); 5360

(v) Vi 6= ∅, (i = 1, 2, . . . , n); 5361

(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 5362

P
(vii) i supp(Vi ) = V, (i = 1, 2, . . . , n); 5363

0 0
P
(viii) i0 supp(Ei ) = V, (i = 1, 2, . . . , n ). 5364
0

Here the Neutrosophic SuperHyperEdges (NSHE) Ej 0 and the Neutrosophic SuperHyperVertices 5365
(NSHV) Vj are single valued Neutrosophic sets. TV 0 (Vi ), IV 0 (Vi ), and FV 0 (Vi ) denote the 5366
degree of truth-membership, the degree of indeterminacy-membership and the degree of 5367
falsity-membership the Neutrosophic SuperHyperVertex (NSHV) Vi to the Neutrosophic 5368
SuperHyperVertex (NSHV) V. TV0 (Ei0 ), TV0 (Ei0 ), and TV0 (Ei0 ) denote the degree of truth- 5369

membership, the degree of indeterminacy-membership and the degree of falsity-membership of 5370

the Neutrosophic SuperHyperEdge (NSHE) Ei0 to the Neutrosophic SuperHyperEdge (NSHE) 5371
E. Thus, the ii0 th element of the incidence matrix of Neutrosophic SuperHyperGraph (NSHG) 5372
are of the form (Vi , TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 )), the sets V and E are crisp sets. 5373

Definition 29.0.11 (Characterization of the Neutrosophic SuperHyperGraph (NSHG)). 5374

(Ref.[HG38],Definition 2.7,p.3). 5375
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). The Neutrosophic 5376
SuperHyperEdges (NSHE) Ei0 and the Neutrosophic SuperHyperVertices (NSHV) Vi of Neutro- 5377
sophic SuperHyperGraph (NSHG) S = (V, E) could be characterized as follow-up items. 5378

(i) If |Vi | = 1, then Vi is called vertex; 5379

(ii) if |Vi | ≥ 1, then Vi is called SuperVertex; 5380

(iii) if for all Vi s are incident in Ei0 , |Vi | = 1, and |Ei0 | = 2, then Ei0 is called edge; 5381

(iv) if for all Vi s are incident in Ei0 , |Vi | = 1, and |Ei0 | ≥ 2, then Ei0 is called HyperEdge; 5382

(v) if there’s a Vi is incident in Ei0 such that |Vi | ≥ 1, and |Ei0 | = 2, then Ei0 is called 5383
SuperEdge; 5384

(vi) if there’s a Vi is incident in Ei0 such that |Vi | ≥ 1, and |Ei0 | ≥ 2, then Ei0 is called 5385
SuperHyperEdge. 5386

This SuperHyperModel is too messy and too dense. Thus there’s a need to have some 5387
restrictions and conditions on SuperHyperGraph. The special case of this SuperHyperGraph 5388

makes the patterns and regularities. 5389

Definition 29.0.12. A graph is SuperHyperUniform if it’s SuperHyperGraph and the number 5390

of elements of SuperHyperEdges are the same. 5391

Henry Garrett · 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 5392
makes to have SuperHyperUniform more understandable. 5393

Definition 29.0.13. Assume a Neutrosophic SuperHyperGraph. There are some SuperHyper- 5394
Classes as follows. 5395

(i). It’s Neutrosophic SuperHyperPath if it’s only one SuperVertex as intersection amid 5396

two given SuperHyperEdges with two exceptions; 5397

(ii). it’s SuperHyperCycle if it’s only one SuperVertex as intersection amid two given 5398
SuperHyperEdges; 5399

(iii). it’s SuperHyperStar it’s only one SuperVertex as intersection amid all SuperHyperEdges; 5400

(iv). it’s SuperHyperBipartite it’s only one SuperVertex as intersection amid two given Supe- 5401
rHyperEdges and these SuperVertices, forming two separate sets, has no SuperHyperEdge 5402

in common; 5403

(v). it’s SuperHyperMultiPartite it’s only one SuperVertex as intersection amid two 5404
given SuperHyperEdges and these SuperVertices, forming multi separate sets, has no 5405
SuperHyperEdge in common; 5406

(vi). it’s SuperHyperWheel if it’s only one SuperVertex as intersection amid two given 5407
SuperHyperEdges and one SuperVertex has one SuperHyperEdge with any common 5408
SuperVertex. 5409

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 5410
(NSHV) V1 to Neutrosophic SuperHyperVertex (NSHV) Vs if either of following conditions hold: 5411

(i) Vi , Vi+1 ∈ Ei0 ; 5412

(ii) there’s a vertex vi ∈ Vi such that vi , Vi+1 ∈ Ei0 ; 5413

(iii) there’s a SuperVertex Vi0 ∈ Vi such that Vi0 , Vi+1 ∈ Ei0 ; 5414

(iv) there’s a vertex vi+1 ∈ Vi+1 such that Vi , vi+1 ∈ Ei0 ; 5415

0 0
(v) there’s a SuperVertex Vi+1 ∈ Vi+1 such that Vi , Vi+1 ∈ E i0 ; 5416

(vi) there are a vertex vi ∈ Vi and a vertex vi+1 ∈ Vi+1 such that vi , vi+1 ∈ Ei0 ; 5417

0 0
(vii) there are a vertex vi ∈ Vi and a SuperVertex Vi+1 ∈ Vi+1 such that vi , Vi+1 ∈ Ei0 ; 5418

(viii) there are a SuperVertex Vi0 ∈ Vi and a vertex vi+1 ∈ Vi+1 such that Vi0 , vi+1 ∈ Ei0 ; 5419

(ix) there are a SuperVertex Vi0 ∈ Vi and a SuperVertex Vi+1

0
∈ Vi+1 such that Vi0 , Vi+1
0
∈ Ei0 . 5420

Henry Garrett · 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. 5421

(i) If for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | = 2, then NSHP is called path; 5422

(ii) if for all Ej 0 , |Ej 0 | = 2, and there’s Vi , |Vi | ≥ 1, then NSHP is called SuperPath; 5423

(iii) if for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | ≥ 2, then NSHP is called HyperPath; 5424

(iv) if there are Vi , Ej 0 , |Vi | ≥ 1, |Ej 0 | ≥ 2, then NSHP is called Neutrosophic SuperHy- 5425
perPath . 5426

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 5427

(i) Neutrosophic t-strength (min{T (Vi )}, m, n)si=1 ; 5428

(ii) Neutrosophic i-strength (m, min{I(Vi )}, n)si=1 ; 5429

(iii) Neutrosophic f-strength (m, n, min{F (Vi )})si=1 ; 5430

(iv) Neutrosophic strength (min{T (Vi )}, min{I(Vi )}, min{F (Vi )})si=1 . 5431

Definition 29.0.17 (Different Neutrosophic Types of Neutrosophic SuperHyperEdges (NSHE)). 5432

(Ref.[HG38],Definition 5.4,p.7). 5433
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider a 5434
Neutrosophic SuperHyperEdge (NSHE) E = {V1 , V2 , . . . , Vs }. Then E is called 5435

(ix) Neutrosophic t-connective if T (E) ≥ maximum number of Neutrosophic t-strength 5436

of SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex (NSHV) Vi to 5437

Neutrosophic SuperHyperVertex (NSHV) Vj where 1 ≤ i, j ≤ s; 5438

(x) Neutrosophic i-connective if I(E) ≥ maximum number of Neutrosophic i-strength 5439

of SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex (NSHV) Vi to 5440

Neutrosophic SuperHyperVertex (NSHV) Vj where 1 ≤ i, j ≤ s; 5441

Henry Garrett · 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 5442

of SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex (NSHV) Vi to 5443
Neutrosophic SuperHyperVertex (NSHV) Vj where 1 ≤ i, j ≤ s; 5444

(xii) Neutrosophic connective if (T (E), I(E), F (E)) ≥ maximum number of Neutrosophic 5445
strength of SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex (NSHV) Vi 5446
to Neutrosophic SuperHyperVertex (NSHV) Vj where 1 ≤ i, j ≤ s. 5447

Definition 29.0.18. (Different Neutrosophic Types of Neutrosophic SuperHyperTrace- 5448

Decomposition). 5449

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider a Neutro- 5450
sophic SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and E 0 = {E1 , E2 , . . . , Ez }. Then either V 0 or E 0 5451
is called 5452

(i) Neutrosophic e-SuperHyperTrace-Decomposition if the following expression is 5453

called Neutrosophic e-SuperHyperTrace-Decomposition criteria holds 5454

∀N (Ea ) ∈ P : P is a SuperHyperPath and it has all SuperHyperVertices;

(ii) Neutrosophic re-SuperHyperTrace-Decomposition if the following expression is 5455

called Neutrosophic re-SuperHyperTrace-Decomposition criteria holds 5456

∀N (Ea ) ∈ P : P is a SuperHyperPath and it has all SuperHyperVertices;

5457

and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 5458

(iii) Neutrosophic v-SuperHyperTrace-Decomposition if the following expression is 5459

called Neutrosophic v-SuperHyperTrace-Decomposition criteria holds 5460

∀N (Va ) ∈ P : P is a SuperHyperPath and it has all SuperHyperVertices;

(iv) Neutrosophic rv-SuperHyperTrace-Decomposition f the following expression is 5461

called Neutrosophic v-SuperHyperTrace-Decomposition criteria holds 5462

∀N (Va ) ∈ P : P is a SuperHyperPath and it has all SuperHyperVertices;

and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; 5463

(v) Neutrosophic SuperHyperTrace-Decomposition if it’s either of Neutrosophic 5464

e-SuperHyperTrace-Decomposition, Neutrosophic re-SuperHyperTrace-Decomposition, 5465
Neutrosophic v-SuperHyperTrace-Decomposition, and Neutrosophic rv-SuperHyperTrace- 5466
Decomposition. 5467

Definition 29.0.19. ((Neutrosophic) SuperHyperTrace-Decomposition). 5468

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider a 5469

Neutrosophic SuperHyperEdge (NSHE) E = {V1 , V2 , . . . , Vs }. Then E is called 5470

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics ·
DrHenryGarrett@gmail.com · Manhattan, NY, USA

(i) an Extreme SuperHyperTrace-Decomposition if it’s either of Neutrosophic 5471

e-SuperHyperTrace-Decomposition, Neutrosophic re-SuperHyperTrace-Decomposition, 5472
Neutrosophic v-SuperHyperTrace-Decomposition, and Neutrosophic rv-SuperHyperTrace- 5473
Decomposition and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is 5474
the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Extreme 5475
cardinality of the Extreme SuperHyperEdges in the conseNeighborive Extreme sequence 5476

of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 5477
Extreme SuperHyperTrace-Decomposition; 5478

(ii) a Neutrosophic SuperHyperTrace-Decomposition if it’s either of Neutrosophic 5479

e-SuperHyperTrace-Decomposition, Neutrosophic re-SuperHyperTrace-Decomposition, 5480

Neutrosophic v-SuperHyperTrace-Decomposition, and Neutrosophic rv-SuperHyperTrace- 5481
Decomposition and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 5482
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of 5483
a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality conseNeighborive 5484
Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they 5485

form the Neutrosophic SuperHyperTrace-Decomposition; 5486

(iii) an Extreme SuperHyperTrace-Decomposition SuperHyperPolynomial if 5487

it’s either of Neutrosophic e-SuperHyperTrace-Decomposition, Neutrosophic re- 5488

SuperHyperTrace-Decomposition, Neutrosophic v-SuperHyperTrace-Decomposition, 5489

and Neutrosophic rv-SuperHyperTrace-Decomposition and C(N SHG) for an Extreme 5490
SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the 5491
Extreme coefficients defined as the Extreme number of the maximum Extreme cardinality 5492
of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme 5493
cardinality conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVertices 5494

such that they form the Extreme SuperHyperTrace-Decomposition; and the Extreme 5495
power is corresponded to its Extreme coefficient; 5496

(iv) a Neutrosophic SuperHyperTrace-Decomposition SuperHyperPolynomial 5497

if it’s either of Neutrosophic e-SuperHyperTrace-Decomposition, Neutrosophic re- 5498

SuperHyperTrace-Decomposition, Neutrosophic v-SuperHyperTrace-Decomposition, 5499
and Neutrosophic rv-SuperHyperTrace-Decomposition and C(N SHG) for a Neutro- 5500
sophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 5501
contains the Neutrosophic coefficients defined as the Neutrosophic number of the max- 5502
imum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic 5503

SuperHyperSet S of high Neutrosophic cardinality conseNeighborive Neutrosophic Super- 5504

HyperEdges and Neutrosophic SuperHyperVertices such that they form the Neutrosophic 5505
SuperHyperTrace-Decomposition; and the Neutrosophic power is corresponded to its 5506
Neutrosophic coefficient; 5507

(v) an Extreme V-SuperHyperTrace-Decomposition if it’s either of Neutrosophic 5508

e-SuperHyperTrace-Decomposition, Neutrosophic re-SuperHyperTrace-Decomposition, 5509
Neutrosophic v-SuperHyperTrace-Decomposition, and Neutrosophic rv-SuperHyperTrace- 5510
Decomposition and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is 5511
the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Extreme 5512

cardinality of the Extreme SuperHyperVertices in the conseNeighborive Extreme sequence 5513

Henry Garrett · 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 Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 5514
Extreme SuperHyperTrace-Decomposition; 5515

(vi) a Neutrosophic V-SuperHyperTrace-Decomposition if it’s either of Neutrosophic 5516

e-SuperHyperTrace-Decomposition, Neutrosophic re-SuperHyperTrace-Decomposition, 5517
Neutrosophic v-SuperHyperTrace-Decomposition, and Neutrosophic rv-SuperHyperTrace- 5518
Decomposition and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 5519

is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of 5520

a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality conseNeighborive 5521
Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they 5522
form the Neutrosophic SuperHyperTrace-Decomposition; 5523

(vii) an Extreme V-SuperHyperTrace-Decomposition SuperHyperPolynomial 5524

if it’s either of Neutrosophic e-SuperHyperTrace-Decomposition, Neutrosophic re- 5525

SuperHyperTrace-Decomposition, Neutrosophic v-SuperHyperTrace-Decomposition, 5526

and Neutrosophic rv-SuperHyperTrace-Decomposition and C(N SHG) for an Extreme 5527
SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the 5528
Extreme coefficients defined as the Extreme number of the maximum Extreme cardinality 5529
of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme 5530
cardinality conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVertices 5531

such that they form the Extreme SuperHyperTrace-Decomposition; and the Extreme 5532
power is corresponded to its Extreme coefficient; 5533

(viii) a Neutrosophic SuperHyperTrace-Decomposition SuperHyperPolynomial 5534

if it’s either of Neutrosophic e-SuperHyperTrace-Decomposition, Neutrosophic re- 5535
SuperHyperTrace-Decomposition, Neutrosophic v-SuperHyperTrace-Decomposition, 5536
and Neutrosophic rv-SuperHyperTrace-Decomposition and C(N SHG) for a Neutrosophic 5537

SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains 5538

the Neutrosophic coefficients defined as the Neutrosophic number of the maximum 5539
Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic 5540
SuperHyperSet S of high Neutrosophic cardinality conseNeighborive Neutrosophic Super- 5541
HyperEdges and Neutrosophic SuperHyperVertices such that they form the Neutrosophic 5542
SuperHyperTrace-Decomposition; and the Neutrosophic power is corresponded to its 5543

Neutrosophic coefficient. 5544

Definition 29.0.20. ((Extreme/Neutrosophic)δ−SuperHyperTrace-Decomposition). 5545

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Then 5546

(i) an δ−SuperHyperTrace-Decomposition is a Neutrosophic kind of Neutrosophic 5547

SuperHyperTrace-Decomposition such that either of the following expressions hold for the 5548

Neutrosophic cardinalities of SuperHyperNeighbors of s ∈ S : 5549

|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 5550

(29.1), holds if S is an δ−SuperHyperDefensive; 5551

Henry Garrett · 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

(ii) a Neutrosophic δ−SuperHyperTrace-Decomposition is a Neutrosophic kind of 5552

Neutrosophic SuperHyperTrace-Decomposition such that either of the following Neut- 5553
rosophic expressions hold for the Neutrosophic cardinalities of SuperHyperNeighbors of 5554
s∈S: 5555

|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 5556

the Expression (29.1), holds if S is a Neutrosophic δ−SuperHyperDefensive. 5557

For the sake of having a Neutrosophic SuperHyperTrace-Decomposition, there’s a need to 5558

“redefine” the notion of “Neutrosophic SuperHyperGraph”. The SuperHyperVertices and the 5559
SuperHyperEdges are assigned by the labels from the letters of the alphabets. In this procedure, 5560
there’s the usage of the position of labels to assign to the values. 5561

136DEF1 Definition 29.0.21. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 5562
It’s redefined Neutrosophic SuperHyperGraph if the Table (29.1) holds. 5563

It’s useful to define a “Neutrosophic” version of SuperHyperClasses. Since there’s more ways 5564
to get Neutrosophic type-results to make a Neutrosophic more understandable. 5565

136DEF2 Definition 29.0.22. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = 5566

(V, E). There are some Neutrosophic SuperHyperClasses if the Table (29.2) holds. 5567

Thus Neutrosophic SuperHyperPath , SuperHyperTrace-Decomposition, SuperHyperStar, 5568

SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, are Neutrosophic 5569
SuperHyperPath, Neutrosophic SuperHyperCycle, Neutrosophic SuperHyperStar, 5570
Neutrosophic SuperHyperBipartite, Neutrosophic SuperHyperMultiPartite, and 5571
Neutrosophic SuperHyperWheel if the Table (29.2) holds. 5572

It’s useful to define a “Neutrosophic” version of a Neutrosophic SuperHyperTrace- 5573

Decomposition. Since there’s more ways to get type-results to make a Neutrosophic 5574
SuperHyperTrace-Decomposition more Neutrosophicly understandable. 5575
For the sake of having a Neutrosophic SuperHyperTrace-Decomposition, there’s a need to 5576
“redefine” the Neutrosophic notion of “Neutrosophic SuperHyperTrace-Decomposition”. The 5577
SuperHyperVertices and the SuperHyperEdges are assigned by the labels from the letters of the 5578
alphabets. In this procedure, there’s the usage of the position of labels to assign to the values. 5579

5580

Henry Garrett · 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

136DEF1 Definition 29.0.23. Assume a SuperHyperTrace-Decomposition. It’s redefined a Neutrosophic 5581

SuperHyperTrace-Decomposition if the Table (29.3) holds. 5582

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 CHAPTER 30 5583

Neutrosophic 5584

SuperHyperTrace-Decomposition But As 5585

The Extensions Excerpt From Dense And 5586

Super Forms 5587

Definition 30.0.1. (Neutrosophic event). 5588

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 5589
S = (V, E) is a probability Trace-Decomposition. Any Neutrosophic k-subset of A of V 5590

is called Neutrosophic k-event and if k = 2, then Neutrosophic subset of A of V is called 5591

Neutrosophic event. The following expression is called Neutrosophic probability of A. 5592

X
E(A) = E(a). (30.1)
a∈A

Definition 30.0.2. (Neutrosophic Independent). 5593

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) 5594
is a probability Trace-Decomposition. s Neutrosophic k-events Ai , i ∈ I is called Neutrosophic 5595
s-independent if the following expression is called Neutrosophic s-independent criteria 5596

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. 5597

The following expression is called Neutrosophic independent criteria 5598

E(A ∩ B) = P (A)P (B). (30.2)

Definition 30.0.3. (Neutrosophic Variable). 5599

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) 5600
is a probability Trace-Decomposition. Any k-function Trace-Decomposition like E is called 5601

Neutrosophic k-Variable. If k = 2, then any 2-function Trace-Decomposition like E is called 5602

Neutrosophic Variable. 5603

The notion of independent on Neutrosophic Variable is likewise. 5604

265
Henry Garrett · Independent Researcher · Department of Mathematics ·
DrHenryGarrett@gmail.com · Manhattan, NY, USA

Definition 30.0.4. (Neutrosophic Expectation). 5605

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) 5606
is a probability Trace-Decomposition. A Neutrosophic k-Variable E has a number is called 5607
Neutrosophic Expectation if the following expression is called Neutrosophic Expectation 5608
criteria 5609

X
Ex(E) = E(α)P (α).
α∈V

Definition 30.0.5. (Neutrosophic Crossing). 5610

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) is 5611

a probability Trace-Decomposition. A Neutrosophic number is called Neutrosophic Crossing 5612

if the following expression is called Neutrosophic Crossing criteria 5613

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). 5614
Consider S = (V, E) is a probability Trace-Decomposition. Let m and n propose special Trace- 5615

Decomposition. Then with m ≥ 4n, 5616

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 Trace-Decomposition 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).

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: 5617

pm − 3n n 1 3 2
cr(G) ≥ 3
= 3 = m n .
p (4n/m) 64

 5618

Theorem 30.0.7. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 5619
Consider S = (V, E) is a probability Trace-Decomposition. Let P be a SuperHyperSet of n points 5620
in the plane, and let l be the Neutrosophic number of√SuperHyperLines in the plane passing 5621

through at least k + 1 of these points, where 1 ≤ k ≤ 2 2n. Then l < 32n2 /k 3 . 5622

Henry Garrett · 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. Form a Neutrosophic SuperHyperGraph G with SuperHyperVertex SuperHyperSet 5623

P whose SuperHyperEdge are the segments between conseNeighborive points on the 5624
SuperHyperLines which pass through at least k + 1 points of P. This Neutrosophic 5625
SuperHyperGraph has at least kl SuperHyperEdges and Neutrosophic crossing at most l 5626
choose two. Thus either kl < 4n, in which case l < 4n/k ≤ 32n2 /k 3 , or l2 /2 > l choose 2 ≥ 5627
3
cr(G) ≥ (kl) /64n2 by the Neutrosophic Crossing Lemma, and again l < 32n2 /k 3 .  5628

Theorem 30.0.8. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 5629

Consider S = (V, E) is a probability Trace-Decomposition. Let P be a SuperHyperSet of n points 5630

in the plane, and let k be the number of pairs of points of P at unit SuperHyperDistance. Then 5631
k < 5n4/3 . 5632

Proof. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = 5633
(V, E) is a probability Trace-Decomposition. Draw a SuperHyperUnit SuperHyperCircle around 5634
each SuperHyperPoint of P. Let ni be the Neutrosophic number of thesePSuperHyperCircles 5635
i = 0n−1 ni = n and k = 12 i = 0n−1 ini . Now
P
passing through exactly i points of P. Then 5636
form a Neutrosophic SuperHyperGraph H with SuperHyperVertex SuperHyperSet P whose 5637
SuperHyperEdges are the SuperHyperArcs between conseNeighborive SuperHyperPoints on the 5638

SuperHyperCircles that pass through at least three SuperHyperPoints of P. Then 5639

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 5640

SuperHyperEdges. Delete from H one of each SuperHyperPair of parallel SuperHyperEdges, 5641
so as to obtain a simple Neutrosophic SuperHyperGraph G with e(G) ≥ k − n. Now 5642
cr(G) ≤ n(n − 1) because G is formed from at most n SuperHyperCircles, and any two 5643
SuperHyperCircles cross at most twice. Thus either e(G) < 4n, in which case k < 5n < 5n4/3 , 5644
3
or n2 > n(n − 1) ≥ cr(G) ≥ (k − n) /64n2 by the Neutrosophic Crossing Lemma, and 5645
4/3 4/3
k < 4n + n < 5n .  5646

Proposition 30.0.9. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 5647
Consider S = (V, E) is a probability Trace-Decomposition. Let X be a nonnegative Neutrosophic 5648
Variable and t a positive real number. Then 5649

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.  5650

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics ·
DrHenryGarrett@gmail.com · Manhattan, NY, USA

Corollary 30.0.10. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 5651
Consider S = (V, E) is a probability Trace-Decomposition. Let Xn be a nonnegative integer- 5652
valued variable in a prob- ability Trace-Decomposition (Vn , En ), n ≥ 1. If E(Xn ) → 0 as n → ∞, 5653
then P (Xn = 0) → 1 as n → ∞. 5654

Proof.  5655

Theorem 30.0.11. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 5656
Consider S = (V, E) is a probability Trace-Decomposition. A special SuperHyperGraph in Gn,p 5657
almost surely has stability number at most d2p−1 log ne. 5658

Proof. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 5659
S = (V, E) is a probability Trace-Decomposition. A special SuperHyperGraph in Gn,p is 5660
up. Let G ∈ Gn,p and let S be a given SuperHyperSet of k + 1 SuperHyperVertices of G, 5661
where k ∈ N. The probability that S is a stable SuperHyperSet of G is (1 − p)(k+1)choose2 , this 5662
being the probability that none of the (k + 1)choose2 pairs of SuperHyperVertices of S is a 5663
SuperHyperEdge of the Neutrosophic SuperHyperGraph G. 5664

Let AS denote the event that S is a stable SuperHyperSet of G, and let XS denote the indicator 5665
Neutrosophic Variable for this Neutrosophic Event. By equation, we have 5666

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 5667
X
X= {XS : S ⊆ V, |S| = k + 1}

and so, by those, 5668

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: 5669

nk+1
(n choose k+1) ≤ and1 − p ≤ e−p .
(k + 1)!
This yields the following upper bound on E(X). 5670

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 5671
least as fast as the logarithm of n, implies that E(X) → 0 as n → ∞. Because X is integer-valued 5672
and nonnegative, we deduce from Corollary that P (X = 0) → 1 as n → ∞. Consequently, a 5673
Neutrosophic SuperHyperGraph in Gn,p almost surely has stability number at most k.  5674

Definition 30.0.12. (Neutrosophic Variance). 5675

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) 5676
is a probability Trace-Decomposition. A Neutrosophic k-Variable E has a number is called 5677
Neutrosophic Variance if the following expression is called Neutrosophic Variance 5678
criteria 5679

2
V x(E) = Ex((X − Ex(X)) ).

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 Henry Garrett · Independent Researcher · Department of Mathematics ·
DrHenryGarrett@gmail.com · Manhattan, NY, USA

Theorem 30.0.13. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 5680
Consider S = (V, E) is a probability Trace-Decomposition. Let X be a Neutrosophic Variable 5681
and let t be a positive real number. Then 5682

V (X)
E(|X − Ex(X)| ≥ t) ≤ .
t2

Proof. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 5683
S = (V, E) is a probability Trace-Decomposition. Let X be a Neutrosophic Variable and let t 5684
be a positive real number. Then 5685

2
2 Ex((X − Ex(X)) ) V (X)
E(|X − Ex(X)| ≥ t) = E((X − Ex(X)) ≥ t2 ) ≤ 2
= .
t t2
 5686

Corollary 30.0.14. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 5687

Consider S = (V, E) is a probability Trace-Decomposition. Let Xn be a Neutrosophic Variable 5688

in a probability Trace-Decomposition (Vn , En ), n ≥ 1. If Ex(Xn ) 6= 0 and V (Xn ) << E 2 (Xn ), 5689
then 5690

E(Xn = 0) → 0 as n → ∞

Proof. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 5691
S = (V, E) is a probability Trace-Decomposition. Set X := Xn and t := |Ex(Xn )| in 5692
Chebyshev’s Inequality, and observe that E(Xn = 0) ≤ E(|Xn − Ex(Xn )| ≥ |Ex(Xn )|) because 5693
|Xn − Ex(Xn )| = |Ex(Xn )| when Xn = 0.  5694

Theorem 30.0.15. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 5695
Consider S = (V, E) is a probability Trace-Decomposition. Let G ∈ Gn,1/2 . For 0 ≤ k ≤ n, set 5696

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 5697
one. Then almost surely α(G) takes one of the three values k ∗ − 2, k ∗ − 1, k ∗ . 5698

Proof. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 5699
S = (V, E) is a probability Trace-Decomposition. As in the proof of related Theorem, the result 5700
is straightforward.  5701

Corollary 30.0.16. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 5702
Consider S = (V, E) is a probability Trace-Decomposition. Let G ∈ Gn,1/2 and let f and k ∗ be 5703
as defined in previous Theorem. Then either: 5704

(i). f (k ∗ ) << 1, in which case almost surely α(G) is equal to either k ∗ − 2 or k ∗ − 1, or 5705

(ii). f (k ∗ − 1) >> 1, in which case almost surely α(G) is equal to either k ∗ − 1 or k ∗ . 5706

Proof. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 5707

S = (V, E) is a probability Trace-Decomposition. The latter is straightforward.  5708

Henry Garrett · 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.17. (Neutrosophic Threshold). 5709

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) 5710
is a probability Trace-Decomposition. Let P be a monotone property of SuperHyperGraphs 5711
(one which is preserved when SuperHyperEdges are added). Then a Neutrosophic Threshold 5712
for P is a function f (n) such that: 5713

(i). if p << f (n), then G ∈ Gn,p almost surely does not have P, 5714

(ii). if p >> f (n), then G ∈ Gn,p almost surely has P. 5715

Definition 30.0.18. (Neutrosophic Balanced). 5716

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) 5717
is a probability Trace-Decomposition. Let F be a fixed Neutrosophic SuperHyperGraph. Then 5718
there is a threshold function for the property of containing a copy of F as a Neutrosophic 5719
SubSuperHyperGraph is called Neutrosophic Balanced. 5720

Theorem 30.0.19. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = 5721

(V, E). Consider S = (V, E) is a probability Trace-Decomposition. Let F be a nonempty 5722
balanced Neutrosophic SubSuperHyperGraph with k SuperHyperVertices and l SuperHyperEdges. 5723
Then n−k/l is a threshold function for the property of containing F as a Neutrosophic 5724
SubSuperHyperGraph. 5725

Proof. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 5726
S = (V, E) is a probability Trace-Decomposition. The latter is straightforward.  5727

136EXM1 Example 30.0.20. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E) 5728
in the mentioned Neutrosophic Figures in every Neutrosophic items. 5729

• On the Figure (30.1), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 5730

SuperHyperTrace-Decomposition, is up. The Neutrosophic Algorithm is Neutrosophicly 5731

straightforward. E1 and E3 are some empty Neutrosophic SuperHyperEdges but E2 5732
is a loop Neutrosophic SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. 5733
Thus in the terms of Neutrosophic SuperHyperNeighbor, there’s only one Neutrosophic 5734
SuperHyperEdge, namely, E4 . The Neutrosophic SuperHyperVertex, V3 is Neutrosophic 5735
isolated means that there’s no Neutrosophic SuperHyperEdge has it as a Neutrosophic 5736

endpoint. Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in every given 5737

Neutrosophic SuperHyperTrace-Decomposition. 5738

C(N SHG)Neutrosophic Trace-Decomposition

= {}.
C(N SHG)Neutrosophic Trace-Decomposition SuperHyperPolynomial
= 0z 0 .
C(N SHG)Neutrosophic V-Trace-Decomposition
= {V1 , V2 , V4 }.
C(N SHG)Neutrosophic V-Trace-Decomposition SuperHyperPolynomial
= z 5 + 2z 3 .

5739

Henry Garrett · 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 SuperHyperTrace-Decomposition in the Neutrosophic Example (42.0.3) 136NSHG1

• On the Figure (30.2), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 5740

SuperHyperTrace-Decomposition, is up. The Neutrosophic Algorithm is Neutrosophicly 5741

straightforward. E1 , E2 and E3 are some empty Neutrosophic SuperHyperEdges 5742
but E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of Neutrosophic 5743
SuperHyperNeighbor, there’s only one Neutrosophic SuperHyperEdge, namely, E4 . The 5744
Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means that there’s no 5745
Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. Thus the Neutrosophic 5746

SuperHyperVertex, V3 , is excluded in every given Neutrosophic SuperHyperTrace- 5747

Decomposition. 5748

C(N SHG)Neutrosophic Trace-Decomposition

= {}.
C(N SHG)Neutrosophic Trace-Decomposition SuperHyperPolynomial
= 0z 0 .
C(N SHG)Neutrosophic V-Trace-Decomposition
= {V1 , V2 , V4 }.
C(N SHG)Neutrosophic V-Trace-Decomposition SuperHyperPolynomial
= z 5 + z 3 + z.

5749

• On the Figure (30.3), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 5750

SuperHyperTrace-Decomposition, is up. The Neutrosophic Algorithm is Neutrosophicly 5751

Henry Garrett · 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 SuperHyperTrace-Decomposition in the Neutrosophic Example (42.0.3) 136NSHG2

straightforward. 5752

C(N SHG)Neutrosophic Trace-Decomposition

= {}.
C(N SHG)Neutrosophic Trace-Decomposition SuperHyperPolynomial
= 0z 0 .
C(N SHG)Neutrosophic V-Trace-Decomposition
= {V1 , V2 , V3 }.
C(N SHG)Neutrosophic V-Trace-Decomposition SuperHyperPolynomial
= z8 + z4 + z3.

5753

• On the Figure (30.4), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 5754

SuperHyperTrace-Decomposition, is up. The Neutrosophic Algorithm is Neutrosophicly 5755

straightforward. 5756

C(N SHG)Neutrosophic Trace-Decomposition

= {E4 , E5 }.
C(N SHG)Neutrosophic Trace-Decomposition SuperHyperPolynomial
= 2z 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

Figure 30.3: The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of

Neutrosophic SuperHyperTrace-Decomposition in the Neutrosophic Example (42.0.3) 136NSHG3

Figure 30.4: The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of

Neutrosophic SuperHyperTrace-Decomposition in the Neutrosophic Example (42.0.3) 136NSHG4

C(N SHG)Neutrosophic V-Trace-Decomposition

= {V3 }.
C(N SHG)Neutrosophic V-Trace-Decomposition SuperHyperPolynomial
= z2.

5757

Henry Garrett · 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 SuperHyperTrace-Decomposition in the Neutrosophic Example (42.0.3) 136NSHG5

• On the Figure (30.5), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 5758

SuperHyperTrace-Decomposition, is up. The Neutrosophic Algorithm is Neutrosophicly 5759

straightforward. 5760

C(N SHG)Neutrosophic Trace-Decomposition

= {}.
C(N SHG)Neutrosophic Trace-Decomposition SuperHyperPolynomial
= 0z 0 .
C(N SHG)Neutrosophic V-Trace-Decomposition
= {{}}.
C(N SHG)Neutrosophic V-Trace-Decomposition SuperHyperPolynomial
= z0.

5761

• On the Figure (30.6), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 5762

SuperHyperTrace-Decomposition, is up. The Neutrosophic Algorithm is Neutrosophicly 5763
straightforward. 5764

C(N SHG)Neutrosophic Trace-Decomposition

= {}.

Henry Garrett · 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 SuperHyperTrace-Decomposition in the Neutrosophic Example (42.0.3) 136NSHG6

C(N SHG)Neutrosophic Trace-Decomposition SuperHyperPolynomial

= 0z 0 .
C(N SHG)Neutrosophic V-Trace-Decomposition
= {{}}.
C(N SHG)Neutrosophic V-Trace-Decomposition SuperHyperPolynomial
= z0.

5765

• On the Figure (30.7), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 5766

SuperHyperTrace-Decomposition, is up. The Neutrosophic Algorithm is Neutrosophicly 5767
straightforward. 5768

C(N SHG)Neutrosophic Trace-Decomposition

= {}.
C(N SHG)Neutrosophic Trace-Decomposition SuperHyperPolynomial
= 0z 0 .
C(N SHG)Neutrosophic V-Trace-Decomposition
= {{}}.
C(N SHG)Neutrosophic V-Trace-Decomposition 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.7: The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of

Neutrosophic SuperHyperTrace-Decomposition in the Neutrosophic Example (42.0.3) 136NSHG7

= z0.
5769

• On the Figure (30.8), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 5770

SuperHyperTrace-Decomposition, is up. The Neutrosophic Algorithm is Neutrosophicly 5771

straightforward. 5772

C(N SHG)Neutrosophic Trace-Decomposition

= {}.
C(N SHG)Neutrosophic Trace-Decomposition SuperHyperPolynomial
= 0z 0 .
C(N SHG)Neutrosophic V-Trace-Decomposition
= {{}}.
C(N SHG)Neutrosophic V-Trace-Decomposition SuperHyperPolynomial
= z0.
5773

• On the Figure (30.9), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 5774

SuperHyperTrace-Decomposition, is up. The Neutrosophic Algorithm is Neutrosophicly 5775
straightforward. 5776

C(N SHG)Neutrosophic Trace-Decomposition

Henry Garrett · 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 SuperHyperTrace-Decomposition in the Neutrosophic Example (42.0.3) 136NSHG8

= {E23 }.
C(N SHG)Neutrosophic Trace-Decomposition SuperHyperPolynomial
= z 11 .
C(N SHG)Neutrosophic V-Trace-Decomposition
= {{Vi }22
i=11,i6=21 .
C(N SHG)Neutrosophic V-Trace-Decomposition SuperHyperPolynomial
= 2z 5 + 7z 4 + 2z 3 .

5777

• On the Figure (30.10), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 5778

SuperHyperTrace-Decomposition, is up. The Neutrosophic Algorithm is Neutrosophicly 5779

straightforward. 5780

C(N SHG)Neutrosophic Trace-Decomposition

= {E5 }.
C(N SHG)Neutrosophic Trace-Decomposition SuperHyperPolynomial
= z3.
C(N SHG)Neutrosophic V-Trace-Decomposition
= {V12 , V13 , V14 }.
C(N SHG)Neutrosophic V-Trace-Decomposition 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.9: The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of

Neutrosophic SuperHyperTrace-Decomposition in the Neutrosophic Example (42.0.3) 136NSHG9

= 2z 5 + z 3 .

5781

• On the Figure (30.11), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 5782

SuperHyperTrace-Decomposition, is up. The Neutrosophic Algorithm is Neutrosophicly 5783

straightforward. 5784

C(N SHG)Neutrosophic Trace-Decomposition

= {E1 }.
C(N SHG)Neutrosophic Trace-Decomposition SuperHyperPolynomial
= z5 + z4 + z3.
C(N SHG)Neutrosophic V-Trace-Decomposition
= {V1 , V2 , V3 , V4 , V5 , V6 }.
C(N SHG)Neutrosophic V-Trace-Decomposition SuperHyperPolynomial
= 3z 5 + z 4 + 2z 3 .

5785

• On the Figure (30.12), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 5786

SuperHyperTrace-Decomposition, is up. The Neutrosophic Algorithm is Neutrosophicly 5787

Henry Garrett · 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.10: The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of

Neutrosophic SuperHyperTrace-Decomposition in the Neutrosophic Example (42.0.3) 136NSHG10

Figure 30.11: The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of

Neutrosophic SuperHyperTrace-Decomposition in the Neutrosophic Example (42.0.3) 136NSHG11

Henry Garrett · 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 SuperHyperTrace-Decomposition in the Neutrosophic Example (42.0.3) 136NSHG12

straightforward. 5788

C(N SHG)Neutrosophic Trace-Decomposition

= {}.
C(N SHG)Neutrosophic Trace-Decomposition SuperHyperPolynomial
= 0z 0 .
C(N SHG)Neutrosophic V-Trace-Decomposition
= {}.
C(N SHG)Neutrosophic V-Trace-Decomposition SuperHyperPolynomial
= 0z 0 .

5789

• On the Figure (30.13), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 5790

SuperHyperTrace-Decomposition, is up. The Neutrosophic Algorithm is Neutrosophicly 5791
straightforward. 5792

C(N SHG)Neutrosophic Trace-Decomposition

= {E1 }.
C(N SHG)Neutrosophic Trace-Decomposition SuperHyperPolynomial
= z5 + z4 + z3.

Henry Garrett · 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 SuperHyperTrace-Decomposition in the Neutrosophic Example (42.0.3) 136NSHG13

C(N SHG)Neutrosophic V-Trace-Decomposition

= {V1 , V2 , V3 , V4 , V5 , V6 }.
C(N SHG)Neutrosophic V-Trace-Decomposition SuperHyperPolynomial
= 3z 5 + z 4 + 2z 3 .

5793

• On the Figure (30.14), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 5794

SuperHyperTrace-Decomposition, is up. The Neutrosophic Algorithm is Neutrosophicly 5795
straightforward. 5796

C(N SHG)Neutrosophic Trace-Decomposition

= {E1 , E2 }.
C(N SHG)Neutrosophic Trace-Decomposition SuperHyperPolynomial
= 2z 2 .
C(N SHG)Neutrosophic V-Trace-Decomposition
= {V1 }.
C(N SHG)Neutrosophic V-Trace-Decomposition SuperHyperPolynomial
= z5.

5797

Henry Garrett · 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 SuperHyperTrace-Decomposition in the Neutrosophic Example (42.0.3) 136NSHG14

• On the Figure (30.15), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 5798

SuperHyperTrace-Decomposition, is up. The Neutrosophic Algorithm is Neutrosophicly 5799

straightforward. 5800

C(N SHG)Neutrosophic Trace-Decomposition

= {}.
C(N SHG)Neutrosophic Trace-Decomposition SuperHyperPolynomial
= 0z 0 .
C(N SHG)Neutrosophic V-Trace-Decomposition
= {}.
C(N SHG)Neutrosophic V-Trace-Decomposition SuperHyperPolynomial
= 0z 0 .

5801

Henry Garrett · 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 SuperHyperTrace-Decomposition in the Neutrosophic Example (42.0.3) 136NSHG15

• On the Figure (30.16), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 5802

SuperHyperTrace-Decomposition, is up. The Neutrosophic Algorithm is Neutrosophicly 5803

straightforward. 5804

C(N SHG)Neutrosophic Trace-Decomposition

= {}.
C(N SHG)Neutrosophic Trace-Decomposition SuperHyperPolynomial
= 0z 0 .
C(N SHG)Neutrosophic V-Trace-Decomposition
= {}.
C(N SHG)Neutrosophic V-Trace-Decomposition SuperHyperPolynomial
= 0z 0 .

5805

• On the Figure (30.17), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 5806

SuperHyperTrace-Decomposition, is up. The Neutrosophic Algorithm is Neutrosophicly 5807

straightforward. 5808

C(N SHG)Neutrosophic Trace-Decomposition

= {}.
C(N SHG)Neutrosophic Trace-Decomposition 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.16: The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of

Neutrosophic SuperHyperTrace-Decomposition in the Neutrosophic Example (42.0.3) 136NSHG16

C(N SHG)Neutrosophic V-Trace-Decomposition

= {}.
C(N SHG)Neutrosophic V-Trace-Decomposition SuperHyperPolynomial
= 0z 0 .

5809

• On the Figure (30.18), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 5810

SuperHyperTrace-Decomposition, is up. The Neutrosophic Algorithm is Neutrosophicly 5811
straightforward. 5812

C(N SHG)Neutrosophic Trace-Decomposition

= {}.
C(N SHG)Neutrosophic Trace-Decomposition SuperHyperPolynomial
= 0z 0 .
C(N SHG)Neutrosophic V-Trace-Decomposition
= {}.
C(N SHG)Neutrosophic V-Trace-Decomposition SuperHyperPolynomial
= 0z 0 .

5813

• On the Figure (30.19), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 5814

SuperHyperTrace-Decomposition, is up. The Neutrosophic Algorithm is Neutrosophicly 5815

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 Henry Garrett · Independent Researcher · Department of Mathematics ·
DrHenryGarrett@gmail.com · Manhattan, NY, USA

Figure 30.17: The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of

Neutrosophic SuperHyperTrace-Decomposition in the Neutrosophic Example (42.0.3) 136NSHG17

Figure 30.18: The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of

Neutrosophic SuperHyperTrace-Decomposition in the Neutrosophic Example (42.0.3) 136NSHG18

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics ·
DrHenryGarrett@gmail.com · Manhattan, NY, USA

Figure 30.19: The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of

Neutrosophic SuperHyperTrace-Decomposition in the Neutrosophic Example (42.0.3) 136NSHG19

straightforward. 5816

C(N SHG)Neutrosophic Trace-Decomposition

= {}.
C(N SHG)Neutrosophic Trace-Decomposition SuperHyperPolynomial
= 0z 0 .
C(N SHG)Neutrosophic V-Trace-Decomposition
= {}.
C(N SHG)Neutrosophic V-Trace-Decomposition SuperHyperPolynomial
= 0z 0 .

5817

• On the Figure (30.20), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 5818

SuperHyperTrace-Decomposition, is up. The Neutrosophic Algorithm is Neutrosophicly 5819
straightforward. 5820

C(N SHG)Neutrosophic Trace-Decomposition

= {}.
C(N SHG)Neutrosophic Trace-Decomposition 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.20: The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of

Neutrosophic SuperHyperTrace-Decomposition in the Neutrosophic Example (42.0.3) 136NSHG20

C(N SHG)Neutrosophic V-Trace-Decomposition

= {}.
C(N SHG)Neutrosophic V-Trace-Decomposition SuperHyperPolynomial
= 0z 0 .

5821

• On the Figure (30.21), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 5822

SuperHyperTrace-Decomposition, is up. The Neutrosophic Algorithm is Neutrosophicly 5823

straightforward. 5824

C(N SHG)Neutrosophic Trace-Decomposition

= {E1 , E2 }.
C(N SHG)Neutrosophic Trace-Decomposition SuperHyperPolynomial
= z 10 + z 2 .
C(N SHG)Neutrosophic V-Trace-Decomposition
= {VE2 }.
C(N SHG)Neutrosophic V-Trace-Decomposition SuperHyperPolynomial
= z 5 + 2z 3 + 7z.

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics ·
DrHenryGarrett@gmail.com · Manhattan, NY, USA

Figure 30.21: The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of

Neutrosophic SuperHyperTrace-Decomposition in the Neutrosophic Example (42.0.3) 95NHG1

5825

• On the Figure (30.22), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 5826

SuperHyperTrace-Decomposition, is up. The Neutrosophic Algorithm is Neutrosophicly 5827

straightforward. 5828

C(N SHG)Neutrosophic Trace-Decomposition

= {}.
C(N SHG)Neutrosophic Trace-Decomposition SuperHyperPolynomial
= 0z 0 .
C(N SHG)Neutrosophic V-Trace-Decomposition
= {}.
C(N SHG)Neutrosophic V-Trace-Decomposition 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.22: The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of

Neutrosophic SuperHyperTrace-Decomposition in the Neutrosophic Example (42.0.3) 95NHG2

5829

Proposition 30.0.21. Assume a connected Neutrosophic SuperHyperGraph ESHG : (V, E). 5830
The all interior Neutrosophic SuperHyperVertices belong to any Neutrosophic quasi-R-Trace- 5831
Decomposition if for any of them, and any of other corresponded Neutrosophic SuperHyperVertex, 5832
some interior Neutrosophic SuperHyperVertices are mutually Neutrosophic SuperHyperNeighbors 5833
with no Neutrosophic exception at all minus all Neutrosophic SuperHypeNeighbors to any amount 5834
of them. 5835

Proposition 30.0.22. Assume a connected non-obvious Neutrosophic SuperHyperGraph ESHG : 5836

(V, E). There’s only one Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) has only the maximum 5837
possibilities of the distinct interior Neutrosophic SuperHyperVertices inside of any given 5838
Neutrosophic quasi-R-Trace-Decomposition minus all Neutrosophic SuperHypeNeighbor to some 5839

of them but not all of them. In other words, there’s only an unique Neutrosophic SuperHyperEdge 5840
E ∈ EESHG:(V,E) has only two distinct Neutrosophic SuperHyperVertices in an Neutrosophic 5841
quasi-R-Trace-Decomposition, minus all Neutrosophic SuperHypeNeighbor to some of them but 5842
not all of them. 5843

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-Trace-Decomposition is at least

V \ (V \ {aE , bE , cE , . . . , zE }).

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics ·
DrHenryGarrett@gmail.com · Manhattan, NY, USA

It’s straightforward that the Neutrosophic cardinality of the Neutrosophic R-Trace-Decomposition 5844
is at least the maximum Neutrosophic number of Neutrosophic SuperHyperVertices of the Neut- 5845
rosophic SuperHyperEdges with the maximum number of the Neutrosophic SuperHyperEdges. In 5846
other words, the maximum number of the Neutrosophic SuperHyperEdges contains the maximum 5847
Neutrosophic number of Neutrosophic SuperHyperVertices are renamed to Neutrosophic Trace- 5848
Decomposition in some cases but the maximum number of the Neutrosophic SuperHyperEdge with 5849

the maximum Neutrosophic number of Neutrosophic SuperHyperVertices, has the Neutrosophic 5850
SuperHyperVertices are contained in a Neutrosophic R-Trace-Decomposition. 5851

Proposition 30.0.24. Assume a simple Neutrosophic SuperHyperGraph ESHG : (V, E). Then
the Neutrosophic number of type-result-R-Trace-Decomposition 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-Trace-Decomposition with the least Neutrosophic 5852

cardinality, the lower sharp Neutrosophic bound for cardinality. 5853

Proposition 30.0.25. Assume a connected loopless Neutrosophic SuperHyperGraph ESHG : 5854

(V, E). Then in the worst case, literally, 5855

C(N SHG)N eutrosophicQuasi−T race−Decomposition = {V1 , E1 , V2 , E2 , V3 , E3 , V4 , E4 , V1 }.

C(N SHG)N eutrosophicQuasi−T race−DecompositionSuperHyperP olynomial = z 4 .
C(N SHG)N eutrosophicQuasi−T race−Decomposition = {V1 , V2 , V3 , V4 , V1 }.
C(N SHG)N eutrosophicR−Quasi−T race−DecompositionSuperHyperP olynomial = z 5 .

Is a Neutrosophic type-result-Trace-Decomposition. In other words, the least cardinality, the 5856

lower sharp bound for the cardinality, of a Neutrosophic type-result-Trace-Decomposition is the 5857

cardinality of 5858

C(N SHG)N eutrosophicQuasi−T race−Decomposition = {V1 , E1 , V2 , E2 , V3 , E3 , V4 , E4 , V1 }.

C(N SHG)N eutrosophicQuasi−T race−DecompositionSuperHyperP olynomial = z 4 .
C(N SHG)N eutrosophicQuasi−T race−Decomposition = {V1 , V2 , V3 , V4 , V1 }.
C(N SHG)N eutrosophicR−Quasi−T race−DecompositionSuperHyperP 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-Trace-Decomposition
since neither amount of Neutrosophic SuperHyperEdges nor amount of SuperHyperVertices
where amount refers to the Neutrosophic number of SuperHyperVertices(-/SuperHyperEdges)
more than one to form any kind of SuperHyperEdges or any number of SuperHyperEdges. Let
us consider the Neutrosophic SuperHyperSet

V \ V \ {aE , bE , cE , . . . , aE 0 , bE 0 , cE 0 , . . .}E,E 0 ={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .

This Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices has the eligibilities

to propose property such that there’s no Neutrosophic SuperHyperVertex of a Neutrosophic

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 Henry Garrett · Independent Researcher · Department of Mathematics ·
DrHenryGarrett@gmail.com · Manhattan, NY, USA

SuperHyperEdge is common and there’s an Neutrosophic SuperHyperEdge for all Neutrosophic

SuperHyperVertices but the maximum Neutrosophic cardinality indicates that these Neutro-
sophic type-SuperHyperSets couldn’t give us the Neutrosophic lower bound in the term of
Neutrosophic sharpness. In other words, the Neutrosophic SuperHyperSet

V \ V \ {aE , bE , cE , . . . , aE 0 , bE 0 , cE 0 , . . .}E,E 0 ={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }}

of the Neutrosophic SuperHyperVertices implies at least on-quasi-triangle style is up but

sometimes the Neutrosophic SuperHyperSet

V \ V \ {aE , bE , cE , . . . , aE 0 , bE 0 , cE 0 , . . .}E,E 0 ={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }}

of the Neutrosophic SuperHyperVertices is free-quasi-triangle and it doesn’t make a contradiction

to the supposition on the connected loopless Neutrosophic SuperHyperGraph ESHG : (V, E).
Thus the minimum case never happens in the generality of the connected loopless Neutrosophic
SuperHyperGraphs. Thus if we assume in the worst case, literally,

V \ V \ {aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .

Is a quasi-R-Trace-Decomposition. In other words, the least cardinality, the lower sharp bound
for the cardinality, of a quasi-R-Trace-Decomposition 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-Trace-Decomposition. 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-Trace-Decomposition decorates the
Neutrosophic SuperHyperVertices don’t have received any Neutrosophic connections so as
this Neutrosophic style implies different versions of Neutrosophic SuperHyperEdges with
the maximum Neutrosophic cardinality in the terms of Neutrosophic SuperHyperVertices
are spotlight. The lower Neutrosophic bound is to have the maximum Neutrosophic
groups of Neutrosophic SuperHyperVertices have perfect Neutrosophic connections inside

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics ·
DrHenryGarrett@gmail.com · Manhattan, NY, USA

each of SuperHyperEdges and the outside of this Neutrosophic SuperHyperSet doesn’t

matter but regarding the connectedness of the used Neutrosophic SuperHyperGraph arising
from its Neutrosophic properties taken from the fact that it’s simple. If there’s no more
than one Neutrosophic SuperHyperVertex in the targeted Neutrosophic SuperHyperSet,
then there’s no Neutrosophic connection. Furthermore, the Neutrosophic existence of one
Neutrosophic SuperHyperVertex has no Neutrosophic effect to talk about the Neutrosophic
R-Trace-Decomposition. Since at least two Neutrosophic SuperHyperVertices involve to
make a title in the Neutrosophic background of the Neutrosophic SuperHyperGraph. The
Neutrosophic SuperHyperGraph is obvious if it has no Neutrosophic SuperHyperEdge
but at least two Neutrosophic SuperHyperVertices make the Neutrosophic version of
Neutrosophic SuperHyperEdge. Thus in the Neutrosophic setting of non-obvious Neutrosophic
SuperHyperGraph, there are at least one Neutrosophic SuperHyperEdge. It’s necessary to
mention that the word “Simple” is used as Neutrosophic adjective for the initial Neutrosophic
SuperHyperGraph, induces there’s no Neutrosophic appearance of the loop Neutrosophic
version of the Neutrosophic SuperHyperEdge and this Neutrosophic SuperHyperGraph is
said to be loopless. The Neutrosophic adjective “loop” on the basic Neutrosophic framework
engages one Neutrosophic SuperHyperVertex but it never happens in this Neutrosophic setting.
With these Neutrosophic bases, on a Neutrosophic SuperHyperGraph, there’s at least one
Neutrosophic SuperHyperEdge thus there’s at least a Neutrosophic R-Trace-Decomposition
has the Neutrosophic cardinality of a Neutrosophic SuperHyperEdge. Thus, a Neutrosophic R-
Trace-Decomposition has the Neutrosophic cardinality at least a Neutrosophic SuperHyperEdge.
Assume a Neutrosophic SuperHyperSet V \ V \ {z}. This Neutrosophic SuperHyperSet isn’t a
Neutrosophic R-Trace-Decomposition since either the Neutrosophic SuperHyperGraph is an
obvious Neutrosophic SuperHyperModel thus it never happens since there’s no Neutrosophic
usage of this Neutrosophic framework and even more there’s no Neutrosophic connection
inside or the Neutrosophic SuperHyperGraph isn’t obvious and as its consequences, there’s a
Neutrosophic contradiction with the term “Neutrosophic R-Trace-Decomposition” since the
maximum Neutrosophic cardinality never happens for this Neutrosophic style of the Neutrosophic
SuperHyperSet and beyond that there’s no Neutrosophic connection inside as mentioned in first
Neutrosophic case in the forms of drawback for this selected Neutrosophic SuperHyperSet. Let
V \ V \ {aE , bE , cE , . . . , aE 0 , bE 0 , cE 0 , . . .}E,E 0 ={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }}

Comes up. This Neutrosophic case implies having the Neutrosophic style of on-quasi-triangle
Neutrosophic style on the every Neutrosophic elements of this Neutrosophic SuperHyperSet.
Precisely, the Neutrosophic R-Trace-Decomposition is the Neutrosophic SuperHyperSet of the
Neutrosophic SuperHyperVertices such that some Neutrosophic amount of the Neutrosophic
SuperHyperVertices are on-quasi-triangle Neutrosophic style. The Neutrosophic cardinality of
the v SuperHypeSet
V \ V \ {aE , bE , cE , . . . , aE 0 , bE 0 , cE 0 , . . .}E,E 0 ={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }}

Is the maximum in comparison to the Neutrosophic SuperHyperSet

V \ V \ {aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .

But the lower Neutrosophic bound is up. Thus the minimum Neutrosophic cardinality of the
maximum Neutrosophic cardinality ends up the Neutrosophic discussion. The first Neutrosophic

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 Henry Garrett · Independent Researcher · Department of Mathematics ·
DrHenryGarrett@gmail.com · Manhattan, NY, USA

term refers to the Neutrosophic setting of the Neutrosophic SuperHyperGraph but this key
point is enough since there’s a Neutrosophic SuperHyperClass of a Neutrosophic SuperHy-
perGraph has no on-quasi-triangle Neutrosophic style amid some amount of its Neutrosophic
SuperHyperVertices. This Neutrosophic setting of the Neutrosophic SuperHyperModel proposes
a Neutrosophic SuperHyperSet has only some amount Neutrosophic SuperHyperVertices from
one Neutrosophic SuperHyperEdge such that there’s no Neutrosophic amount of Neutrosophic
SuperHyperEdges more than one involving these some amount of these Neutrosophic SuperHy-
perVertices. The Neutrosophic cardinality of this Neutrosophic SuperHyperSet is the maximum
and the Neutrosophic case is occurred in the minimum Neutrosophic situation. To sum them
up, the Neutrosophic SuperHyperSet

V \ V \ {aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .

Has the maximum Neutrosophic cardinality such that

V \ V \ {aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .

Contains some Neutrosophic SuperHyperVertices such that there’s distinct-covers-order-amount

Neutrosophic SuperHyperEdges for amount of Neutrosophic SuperHyperVertices taken from
the Neutrosophic SuperHyperSet

V \ V \ {aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .

It means that the Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices

V \ V \ {aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .

Is a Neutrosophic R-Trace-Decomposition 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-Trace-Decomposition.
Those Neutrosophic SuperHyperVertices are potentially included in a Neutrosophic style-R-
Trace-Decomposition. Formally, consider

V \ (V \ {aE , bE , cE , . . . , zE }).

Are the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) .

Thus
Zi ∼ Zj , i 6= j, i, j = 1, 2, . . . , z.
where the ∼ isn’t an equivalence relation but only the symmetric relation on the Neutrosophic
SuperHyperVertices of the Neutrosophic SuperHyperGraph. The formal definition is as follows.

Zi ∼ Zj , i 6= j, i, j = 1, 2, . . . , z

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics ·
DrHenryGarrett@gmail.com · Manhattan, NY, USA

if and only if Zi and Zj are the Neutrosophic SuperHyperVertices and there’s only and only one
Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) between the Neutrosophic SuperHyperVertices
Zi and Zj . The other definition for the Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) in the
terms of Neutrosophic R-Trace-Decomposition is

{aE , bE , cE , . . . , zE } .

This definition coincides with the definition of the Neutrosophic R-Trace-Decomposition 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-Trace-Decomposition. 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, 5859

Neutrosophic R-Trace-Decomposition =
E
{Z1 , Z2 , . . . , Zz | ∀i 6= j, i, j = 1, 2, . . . , z, ∃Ex , Zi ∼x Zj , }.
5860

Neutrosophic R-Trace-Decomposition =
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-Trace-Decomposition where E ∈ EESHG:(V,E)

is fixed that means Ex = E ∈ EESHG:(V,E) . for all Neutrosophic intended SuperHyperVertices
but in a Neutrosophic Trace-Decomposition, 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-Trace-Decomposition is at least

V \ (V \ {aE , bE , cE , . . . , zE }).

It’s straightforward that the Neutrosophic cardinality of the Neutrosophic R-Trace- 5861
Decomposition is at least the maximum Neutrosophic number of Neutrosophic SuperHyperVer- 5862

tices of the Neutrosophic SuperHyperEdges with the maximum number of the Neutrosophic 5863

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 Henry Garrett · Independent Researcher · Department of Mathematics ·
DrHenryGarrett@gmail.com · Manhattan, NY, USA

SuperHyperEdges. In other words, the maximum number of the Neutrosophic SuperHy- 5864
perEdges contains the maximum Neutrosophic number of Neutrosophic SuperHyperVertices 5865
are renamed to Neutrosophic Trace-Decomposition in some cases but the maximum number of 5866
the Neutrosophic SuperHyperEdge with the maximum Neutrosophic number of Neutrosophic 5867
SuperHyperVertices, has the Neutrosophic SuperHyperVertices are contained in a Neutrosophic 5868
R-Trace-Decomposition. 5869

The obvious SuperHyperGraph has no Neutrosophic SuperHyperEdges. But the non-obvious 5870
Neutrosophic SuperHyperModel is up. The quasi-SuperHyperModel addresses some issues 5871
about the Neutrosophic optimal SuperHyperObject. It specially delivers some remarks on 5872
the Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices such that there’s 5873
distinct amount of Neutrosophic SuperHyperEdges for distinct amount of Neutrosophic Supe- 5874
rHyperVertices up to all taken from that Neutrosophic SuperHyperSet of the Neutrosophic 5875

SuperHyperVertices but this Neutrosophic SuperHyperSet of the Neutrosophic SuperHyper- 5876

Vertices is either has the maximum Neutrosophic SuperHyperCardinality or it doesn’t have 5877
maximum Neutrosophic SuperHyperCardinality. In a non-obvious SuperHyperModel, there’s 5878
at least one Neutrosophic SuperHyperEdge containing at least all Neutrosophic SuperHyper- 5879
Vertices. Thus it forms a Neutrosophic quasi-R-Trace-Decomposition where the Neutrosophic 5880
completion of the Neutrosophic incidence is up in that. Thus it’s, literarily, a Neutrosophic 5881

embedded R-Trace-Decomposition. The SuperHyperNotions of embedded SuperHyperSet and 5882

quasi-SuperHyperSet coincide. In the original setting, these types of SuperHyperSets only don’t 5883
satisfy on the maximum SuperHyperCardinality. Thus the embedded setting is elected such that 5884
those SuperHyperSets have the maximum Neutrosophic SuperHyperCardinality and they’re 5885
Neutrosophic SuperHyperOptimal. The less than two distinct types of Neutrosophic SuperHy- 5886
perVertices are included in the minimum Neutrosophic style of the embedded Neutrosophic 5887

R-Trace-Decomposition. The interior types of the Neutrosophic SuperHyperVertices are de- 5888
ciders. Since the Neutrosophic number of SuperHyperNeighbors are only affected by the interior 5889
Neutrosophic SuperHyperVertices. The common connections, more precise and more formal, 5890
the perfect unique connections inside the Neutrosophic SuperHyperSet for any distinct types of 5891
Neutrosophic SuperHyperVertices pose the Neutrosophic R-Trace-Decomposition. Thus Neutro- 5892
sophic exterior SuperHyperVertices could be used only in one Neutrosophic SuperHyperEdge 5893

and in Neutrosophic SuperHyperRelation with the interior Neutrosophic SuperHyperVertices 5894

in that Neutrosophic SuperHyperEdge. In the embedded Neutrosophic Trace-Decomposition, 5895
there’s the usage of exterior Neutrosophic SuperHyperVertices since they’ve more connections 5896
inside more than outside. Thus the title “exterior” is more relevant than the title “interior”. One 5897
Neutrosophic SuperHyperVertex has no connection, inside. Thus, the Neutrosophic SuperHy- 5898

perSet of the Neutrosophic SuperHyperVertices with one SuperHyperElement has been ignored 5899
in the exploring to lead on the optimal case implying the Neutrosophic R-Trace-Decomposition. 5900
The Neutrosophic R-Trace-Decomposition with the exclusion of the exclusion of all Neutro- 5901
sophic SuperHyperVertices in one Neutrosophic SuperHyperEdge and with other terms, the 5902
Neutrosophic R-Trace-Decomposition with the inclusion of all Neutrosophic SuperHyperVertices 5903
in one Neutrosophic SuperHyperEdge, is a Neutrosophic quasi-R-Trace-Decomposition. To sum 5904

them up, in a connected non-obvious Neutrosophic SuperHyperGraph ESHG : (V, E). There’s 5905
only one Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) has only the maximum possibilities 5906
of the distinct interior Neutrosophic SuperHyperVertices inside of any given Neutrosophic 5907
quasi-R-Trace-Decomposition minus all Neutrosophic SuperHypeNeighbor to some of them 5908
but not all of them. In other words, there’s only an unique Neutrosophic SuperHyperEdge 5909

Henry Garrett · 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 ∈ EESHG:(V,E) has only two distinct Neutrosophic SuperHyperVertices in an Neutrosophic 5910

quasi-R-Trace-Decomposition, minus all Neutrosophic SuperHypeNeighbor to some of them but 5911
not all of them. 5912
The main definition of the Neutrosophic R-Trace-Decomposition has two titles. a Neut- 5913
rosophic quasi-R-Trace-Decomposition and its corresponded quasi-maximum Neutrosophic 5914
R-SuperHyperCardinality are two titles in the terms of quasi-R-styles. For any Neutro- 5915

sophic number, there’s a Neutrosophic quasi-R-Trace-Decomposition with that quasi-maximum 5916

Neutrosophic SuperHyperCardinality in the terms of the embedded Neutrosophic SuperHy- 5917
perGraph. If there’s an embedded Neutrosophic SuperHyperGraph, then the Neutrosophic 5918
quasi-SuperHyperNotions lead us to take the collection of all the Neutrosophic quasi-R-Trace- 5919
Decompositions for all Neutrosophic numbers less than its Neutrosophic corresponded maximum 5920
number. The essence of the Neutrosophic Trace-Decomposition ends up but this essence starts 5921

up in the terms of the Neutrosophic quasi-R-Trace-Decomposition, again and more in the 5922
operations of collecting all the Neutrosophic quasi-R-Trace-Decompositions acted on the all 5923
possible used formations of the Neutrosophic SuperHyperGraph to achieve one Neutrosophic 5924
number. This Neutrosophic number is 5925
considered as the equivalence class for all corresponded quasi-R-Trace-Decompositions. Let 5926
zNeutrosophic Number , SNeutrosophic SuperHyperSet and GNeutrosophic Trace-Decomposition be a Neutro- 5927

sophic number, a Neutrosophic SuperHyperSet and a Neutrosophic Trace-Decomposition. Then 5928

[zNeutrosophic Number ]Neutrosophic Class = {SNeutrosophic SuperHyperSet |

SNeutrosophic SuperHyperSet = GNeutrosophic Trace-Decomposition ,
|SNeutrosophic SuperHyperSet |Neutrosophic Cardinality
= zNeutrosophic Number }.

As its consequences, the formal definition of the Neutrosophic Trace-Decomposition is re- 5929
formalized and redefined as follows. 5930

GNeutrosophic Trace-Decomposition ∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class =

∪zNeutrosophic Number {SNeutrosophic SuperHyperSet |
SNeutrosophic SuperHyperSet = GNeutrosophic Trace-Decomposition ,
|SNeutrosophic SuperHyperSet |Neutrosophic Cardinality
= zNeutrosophic Number }.

To get more precise perceptions, the follow-up expressions propose another formal technical 5931
definition for the Neutrosophic Trace-Decomposition. 5932

GNeutrosophic Trace-Decomposition =
{S ∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class =
∪zNeutrosophic Number {SNeutrosophic SuperHyperSet |
SNeutrosophic SuperHyperSet = GNeutrosophic Trace-Decomposition ,
|SNeutrosophic SuperHyperSet |Neutrosophic Cardinality
= zNeutrosophic Number |
|SNeutrosophic SuperHyperSet |Neutrosophic Cardinality

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 Henry Garrett · Independent Researcher · Department of Mathematics ·
DrHenryGarrett@gmail.com · Manhattan, NY, USA

= max zNeutrosophic Number }.

[zNeutrosophic Number ]Neutrosophic Class

In more concise and more convenient ways, the modified definition for the Neutrosophic Trace- 5933
Decomposition poses the upcoming expressions. 5934

GNeutrosophic Trace-Decomposition =
{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. 5935

GNeutrosophic Trace-Decomposition =
{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, 5936

GNeutrosophic Trace-Decomposition =
{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. 5937

GNeutrosophic Trace-Decomposition ∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class =

∪zNeutrosophic Number {SNeutrosophic SuperHyperSet |
SNeutrosophic SuperHyperSet = GNeutrosophic Trace-Decomposition ,
|SNeutrosophic SuperHyperSet |Neutrosophic Cardinality

= max |E| | E ∈ EESHG:(V,E) }.
5938

GNeutrosophic Trace-Decomposition =
{S ∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class =
∪zNeutrosophic Number {SNeutrosophic SuperHyperSet |
SNeutrosophic SuperHyperSet = GNeutrosophic Trace-Decomposition ,
|SNeutrosophic SuperHyperSet |Neutrosophic Cardinality
= zNeutrosophic Number |
|SNeutrosophic SuperHyperSet |Neutrosophic Cardinality

= max |E| | E ∈ EESHG:(V,E) }.

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics ·
DrHenryGarrett@gmail.com · Manhattan, NY, USA

5939

GNeutrosophic Trace-Decomposition =
{S ∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class |
|SNeutrosophic SuperHyperSet |Neutrosophic Cardinality
= max zNeutrosophic Number
[zNeutrosophic Number ]Neutrosophic Class

= max |E| | E ∈ EESHG:(V,E) }.
5940

GNeutrosophic Trace-Decomposition =
{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 Supe- 5941
rHyperNeighborhood”, could be redefined as the collection of the Neutrosophic SuperHyperVer- 5942
tices such that any amount of its Neutrosophic SuperHyperVertices are incident to a Neutrosophic 5943
SuperHyperEdge. It’s, literarily, another name for “Neutrosophic Quasi-Trace-Decomposition” 5944
but, precisely, it’s the generalization of “Neutrosophic Quasi-Trace-Decomposition” since 5945
“Neutrosophic Quasi-Trace-Decomposition” happens “Neutrosophic Trace-Decomposition” in 5946
a Neutrosophic SuperHyperGraph as initial framework and background but “Neutrosophic 5947
SuperHyperNeighborhood” may not happens “Neutrosophic Trace-Decomposition” in a Neutro- 5948
sophic SuperHyperGraph as initial framework and preliminarily background since there are 5949
some ambiguities about the Neutrosophic SuperHyperCardinality arise from it. To get orderly 5950
keywords, the terms, “Neutrosophic SuperHyperNeighborhood”, “Neutrosophic Quasi-Trace- 5951
Decomposition”, and “Neutrosophic Trace-Decomposition” are up. 5952
Thus, let zNeutrosophic Number , NNeutrosophic SuperHyperNeighborhood and GNeutrosophic Trace-Decomposition
5953

be a Neutrosophic number, a Neutrosophic SuperHyperNeighborhood and a Neutrosophic 5954

Trace-Decomposition and the new terms are up. 5955

GNeutrosophic Trace-Decomposition ∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class =

∪zNeutrosophic Number {NNeutrosophic SuperHyperNeighborhood |
|NNeutrosophic SuperHyperNeighborhood |Neutrosophic Cardinality
= max zNeutrosophic Number }.
[zNeutrosophic Number ]Neutrosophic Class

5956

GNeutrosophic Trace-Decomposition =
{NNeutrosophic SuperHyperNeighborhood
∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class =
∪zNeutrosophic Number {NNeutrosophic SuperHyperNeighborhood |
|NNeutrosophic SuperHyperSet |Neutrosophic Cardinality
= zNeutrosophic Number |
|NNeutrosophic SuperHyperNeighborhood |Neutrosophic Cardinality

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 Henry Garrett · Independent Researcher · Department of Mathematics ·
DrHenryGarrett@gmail.com · Manhattan, NY, USA

= max zNeutrosophic Number }.

[zNeutrosophic Number ]Neutrosophic Class

5957

GNeutrosophic Trace-Decomposition =
{NNeutrosophic SuperHyperNeighborhood
∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class |
|NNeutrosophic SuperHyperNeighborhood |Neutrosophic Cardinality
= max zNeutrosophic Number }.
[zNeutrosophic Number ]Neutrosophic Class

5958

GNeutrosophic Trace-Decomposition =
{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, 5959

GNeutrosophic Trace-Decomposition ∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class =

∪zNeutrosophic Number {NNeutrosophic SuperHyperNeighborhood |
|NNeutrosophic SuperHyperNeighborhood |Neutrosophic Cardinality

= max |E| | E ∈ EESHG:(V,E) }.
5960

GNeutrosophic Trace-Decomposition =
{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) }.
5961

GNeutrosophic Trace-Decomposition =
{NNeutrosophic SuperHyperNeighborhood
∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class |
|NNeutrosophic SuperHyperNeighborhood |Neutrosophic Cardinality
= max zNeutrosophic Number
[zNeutrosophic Number ]Neutrosophic Class

= max |E| | E ∈ EESHG:(V,E) }.

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics ·
DrHenryGarrett@gmail.com · Manhattan, NY, USA

5962

GNeutrosophic Trace-Decomposition =
{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-Trace-Decomposition if
for any of them, and any of other corresponded Neutrosophic SuperHyperVertex, some interior
Neutrosophic SuperHyperVertices are mutually Neutrosophic SuperHyperNeighbors with no
Neutrosophic exception at all minus all Neutrosophic SuperHypeNeighbors to any amount of
them.
To make sense with the precise words in the terms of “R-’, the follow-up illustrations are coming
up.
The following Neutrosophic SuperHyperSet of Neutrosophic SuperHyperVertices is the simple
Neutrosophic type-SuperHyperSet of the Neutrosophic R-Trace-Decomposition.

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-Trace-Decomposition.

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-Trace-Decomposition 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 Trace-Decomposition 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 Trace-Decomposition is up. The obvious
simple Neutrosophic type-SuperHyperSet called the Neutrosophic Trace-Decomposition is a
Neutrosophic SuperHyperSet includes only one Neutrosophic SuperHyperVertex. But the
Neutrosophic SuperHyperSet of Neutrosophic SuperHyperVertices,

V \ V \ {aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 Henry Garrett · Independent Researcher · Department of Mathematics ·
DrHenryGarrett@gmail.com · Manhattan, NY, USA

doesn’t have less than two SuperHyperVertices inside the intended Neutrosophic SuperHyperSet
since they’ve come from at least so far an SuperHyperEdge. Thus the non-obvious simple
Neutrosophic type-SuperHyperSet of the Neutrosophic R-Trace-Decomposition 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-Trace-

Decomposition. Since the Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices,

(V \ V \ {x, z}) ∪ {xy}

or
(V \ V \ {x, z}) ∪ {zy}
is an Neutrosophic R-Trace-Decomposition C(ESHG) for an Neutrosophic SuperHyperGraph
ESHG : (V, E) is the Neutrosophic SuperHyperSet S of Neutrosophic SuperHyperVertices such
that there’s no a Neutrosophic SuperHyperEdge for some Neutrosophic SuperHyperVertices
instead of all given by that Neutrosophic type-SuperHyperSet called the Neutrosophic Trace-
Decomposition and it’s an Neutrosophic Trace-Decomposition. 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 Trace-Decomposition. 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-Trace-Decomposition,

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 Trace-

Decomposition, not:

V \ V \ {aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .

Is the Neutrosophic SuperHyperSet, not:

V \ V \ {aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .

does includes only less than two SuperHyperVertices in a connected Neutrosophic Super- 5963
HyperGraph ESHG : (V, E) but it’s impossible in the case, they’ve corresponded to an 5964
SuperHyperEdge. It’s interesting to mention that the only non-obvious simple Neutrosophic 5965
type-SuperHyperSet called the 5966

“Neutrosophic R-Trace-Decomposition” 5967

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics ·
DrHenryGarrett@gmail.com · Manhattan, NY, USA

amid those obvious[non-obvious] simple Neutrosophic type-SuperHyperSets called the 5968

Neutrosophic R-Trace-Decomposition, 5969

is only and only

V \ V \ {aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .

In a connected Neutrosophic SuperHyperGraph ESHG : (V, E) with a illustrated SuperHyper-

Modeling. It’s also, not only a Neutrosophic free-triangle embedded SuperHyperModel and a
Neutrosophic on-triangle embedded SuperHyperModel but also it’s a Neutrosophic stable em-
bedded SuperHyperModel. But all only non-obvious simple Neutrosophic type-SuperHyperSets
of the Neutrosophic R-Trace-Decomposition amid those obvious simple Neutrosophic type-
SuperHyperSets of the Neutrosophic Trace-Decomposition, 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-Trace-Decomposition. In other words, the least cardinality, the lower sharp
bound for the cardinality, of a Neutrosophic R-Trace-Decomposition is the cardinality of

V \ V \ {aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .

5970

To sum them up, in a connected Neutrosophic SuperHyperGraph ESHG : (V, E). The all interior 5971
Neutrosophic SuperHyperVertices belong to any Neutrosophic quasi-R-Trace-Decomposition if 5972
for any of them, and any of other corresponded Neutrosophic SuperHyperVertex, some interior 5973
Neutrosophic SuperHyperVertices are mutually Neutrosophic SuperHyperNeighbors with no 5974
Neutrosophic exception at all minus all Neutrosophic SuperHypeNeighbors to any amount of 5975
them. 5976

Assume a connected Neutrosophic SuperHyperGraph ESHG : (V, E). Let a Neutrosophic Supe- 5977
rHyperEdge ESHE : E ∈ EESHG:(V,E) has some Neutrosophic SuperHyperVertices r. Consider 5978
all Neutrosophic numbers of those Neutrosophic SuperHyperVertices from that Neutrosophic 5979
SuperHyperEdge excluding excluding more than r distinct Neutrosophic SuperHyperVertices, 5980
exclude to any given Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices. 5981
Consider there’s a Neutrosophic R-Trace-Decomposition with the least cardinality, the lower 5982

sharp Neutrosophic bound for Neutrosophic cardinality. Assume a connected Neutrosophic 5983
SuperHyperGraph ESHG : (V, E). The Neutrosophic SuperHyperSet of the Neutrosophic 5984
SuperHyperVertices VESHE \ {z} is a Neutrosophic SuperHyperSet S of the Neutrosophic Su- 5985
perHyperVertices such that there’s a Neutrosophic SuperHyperEdge to have some Neutrosophic 5986
SuperHyperVertices uniquely but it isn’t a Neutrosophic R-Trace-Decomposition. Since it 5987
doesn’t have 5988

5989

Henry Garrett · 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- 5990

rosophic SuperHyperVertices such that there’s a Neutrosophic SuperHyperEdge to have some 5991
SuperHyperVertices uniquely. The Neutrosophic SuperHyperSet of the Neutrosophic Supe- 5992
rHyperVertices VESHE ∪ {z} is the maximum Neutrosophic cardinality of a Neutrosophic 5993
SuperHyperSet S of Neutrosophic SuperHyperVertices but it isn’t a Neutrosophic R-Trace- 5994
Decomposition. Since it doesn’t do the Neutrosophic procedure such that such that there’s a 5995

Neutrosophic SuperHyperEdge to have some Neutrosophic SuperHyperVertices uniquely [there 5996

are at least one Neutrosophic SuperHyperVertex outside implying there’s, sometimes in the 5997
connected Neutrosophic SuperHyperGraph ESHG : (V, E), a Neutrosophic SuperHyperVer- 5998
tex, titled its Neutrosophic SuperHyperNeighbor, to that Neutrosophic SuperHyperVertex 5999
in the Neutrosophic SuperHyperSet S so as S doesn’t do “the Neutrosophic procedure”.]. 6000
There’s only one Neutrosophic SuperHyperVertex outside the intended Neutrosophic Super- 6001

HyperSet, VESHE ∪ {z}, in the terms of Neutrosophic SuperHyperNeighborhood. Thus the 6002
obvious Neutrosophic R-Trace-Decomposition, VESHE is up. The obvious simple Neutrosophic 6003
type-SuperHyperSet of the Neutrosophic R-Trace-Decomposition, VESHE , is a Neutrosophic Su- 6004
perHyperSet, VESHE , includes only all Neutrosophic SuperHyperVertices does forms any kind 6005
of Neutrosophic pairs are titled Neutrosophic SuperHyperNeighbors in a connected Neutrosophic 6006
SuperHyperGraph ESHG : (V, E). Since the Neutrosophic SuperHyperSet of the Neutrosophic 6007

SuperHyperVertices VESHE , is the maximum Neutrosophic SuperHyperCardinality of 6008

a Neutrosophic SuperHyperSet S of Neutrosophic SuperHyperVertices such that there’s 6009
a Neutrosophic SuperHyperEdge to have some Neutrosophic SuperHyperVertices uniquely. 6010
Thus, in a connected Neutrosophic SuperHyperGraph ESHG : (V, E). Any Neutrosophic 6011
R-Trace-Decomposition only contains all interior Neutrosophic SuperHyperVertices and all 6012
exterior Neutrosophic SuperHyperVertices from the unique Neutrosophic SuperHyperEdge 6013

where there’s any of them has all possible Neutrosophic SuperHyperNeighbors in and there’s all 6014
Neutrosophic SuperHyperNeighborhoods in with no exception minus all Neutrosophic SuperHy- 6015
peNeighbors to some of them not all of them but everything is possible about Neutrosophic 6016
SuperHyperNeighborhoods and Neutrosophic SuperHyperNeighbors out. 6017
The SuperHyperNotion, namely, Trace-Decomposition, is up. There’s neither empty SuperHy- 6018
perEdge nor loop SuperHyperEdge. The following Neutrosophic SuperHyperSet of Neutrosophic 6019

SuperHyperEdges[SuperHyperVertices] is the simple Neutrosophic type-SuperHyperSet of 6020

the Neutrosophic Trace-Decomposition. The Neutrosophic SuperHyperSet of Neutrosophic 6021
SuperHyperEdges[SuperHyperVertices], 6022

C(N SHG)N eutrosophicQuasi−T race−Decomposition

|EESHG:(V,E) |Neutrosophic Cardinality
b c
= {E2i−1 }i=1 2
.
C(N SHG)N eutrosophicQuasi−T race−DecompositionSuperHyperP olynomial
|EESHG:(V,E) |Neutrosophic Cardinality
= 2z b 2 c
.
C(N SHG)N eutrosophicR−Quasi−T race−Decomposition = {Vi }si=1 , {Vj }tj=1 .
C(N SHG)N eutrosophicR−Quasi−T race−DecompositionSuperHyperP olynomial = az s + bz t .

is the simple Neutrosophic type-SuperHyperSet of the Neutrosophic Trace-Decomposition. The 6023

Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperEdges[SuperHyperVertices], 6024

C(N SHG)N eutrosophicQuasi−T race−Decomposition

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics ·
DrHenryGarrett@gmail.com · Manhattan, NY, USA
|EESHG:(V,E) |Neutrosophic Cardinality
b c
= {E2i−1 }i=1 2
.
C(N SHG)N eutrosophicQuasi−T race−DecompositionSuperHyperP olynomial
|EESHG:(V,E) |Neutrosophic Cardinality
= 2z b 2 c
.
C(N SHG)N eutrosophicR−Quasi−T race−Decomposition = {Vi }si=1 , {Vj }tj=1 .
C(N SHG)N eutrosophicR−Quasi−T race−DecompositionSuperHyperP olynomial = az s + bz t .
Is an Neutrosophic Trace-Decomposition C(ESHG) for an Neutrosophic SuperHyper- 6025
Graph ESHG : (V, E) is a Neutrosophic type-SuperHyperSet with 6026

6027
the maximum Neutrosophic cardinality of a Neutrosophic SuperHyperSet S of Neut- 6028
rosophic SuperHyperEdges[SuperHyperVertices] such that there’s no Neutrosophic Supe- 6029
rHyperVertex of a Neutrosophic SuperHyperEdge is common and there’s an Neutrosophic 6030
SuperHyperEdge for all Neutrosophic SuperHyperVertices. There are not only two Neutrosophic 6031
SuperHyperVertices inside the intended Neutrosophic SuperHyperSet. Thus the non-obvious 6032

Neutrosophic Trace-Decomposition is up. The obvious simple Neutrosophic type-SuperHyperSet 6033

called the Neutrosophic Trace-Decomposition is a Neutrosophic SuperHyperSet includes 6034
only two Neutrosophic SuperHyperVertices. But the Neutrosophic SuperHyperSet of the 6035
Neutrosophic SuperHyperEdges[SuperHyperVertices], 6036

C(N SHG)N eutrosophicQuasi−T race−Decomposition

|EESHG:(V,E) |Neutrosophic Cardinality
b c
= {E2i−1 }i=1 2
.
C(N SHG)N eutrosophicQuasi−T race−DecompositionSuperHyperP olynomial
|EESHG:(V,E) |Neutrosophic Cardinality
= 2z b 2 c
.
C(N SHG)N eutrosophicR−Quasi−T race−Decomposition = {Vi }si=1 , {Vj }tj=1 .
C(N SHG)N eutrosophicR−Quasi−T race−DecompositionSuperHyperP olynomial = az s + bz t .
Doesn’t have less than three SuperHyperVertices inside the intended Neutrosophic SuperHy- 6037
perSet. Thus the non-obvious simple Neutrosophic type-SuperHyperSet of the Neutrosophic 6038
Trace-Decomposition is up. To sum them up, the Neutrosophic SuperHyperSet of the Neutro- 6039
sophic SuperHyperEdges[SuperHyperVertices], 6040

C(N SHG)N eutrosophicQuasi−T race−Decomposition

|EESHG:(V,E) |Neutrosophic Cardinality
b c
= {E2i−1 }i=1 2
.
C(N SHG)N eutrosophicQuasi−T race−DecompositionSuperHyperP olynomial
|EESHG:(V,E) |Neutrosophic Cardinality
= 2z b 2 c
.
C(N SHG)N eutrosophicR−Quasi−T race−Decomposition = {Vi }si=1 , {Vj }tj=1 .
C(N SHG)N eutrosophicR−Quasi−T race−DecompositionSuperHyperP olynomial = az s + bz t .
Is the non-obvious simple Neutrosophic type-SuperHyperSet of the Neutrosophic Trace- 6041
Decomposition. Since the Neutrosophic SuperHyperSet of the Neutrosophic SuperHy- 6042

perEdges[SuperHyperVertices], 6043

C(N SHG)N eutrosophicQuasi−T race−Decomposition

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 Henry Garrett · Independent Researcher · Department of Mathematics ·
DrHenryGarrett@gmail.com · Manhattan, NY, USA
|EESHG:(V,E) |Neutrosophic Cardinality
b c
= {E2i−1 }i=1 2
.
C(N SHG)N eutrosophicQuasi−T race−DecompositionSuperHyperP olynomial
|EESHG:(V,E) |Neutrosophic Cardinality
= 2z b 2 c
.
C(N SHG)N eutrosophicR−Quasi−T race−Decomposition = {Vi }si=1 , {Vj }tj=1 .
C(N SHG)N eutrosophicR−Quasi−T race−DecompositionSuperHyperP olynomial = az s + bz t .

Is an Neutrosophic Trace-Decomposition C(ESHG) for an Neutrosophic SuperHyperGraph 6044

ESHG : (V, E) is the Neutrosophic SuperHyperSet S of Neutrosophic SuperHyperVertices such 6045
that there’s no a Neutrosophic SuperHyperEdge for some Neutrosophic SuperHyperVertices 6046
given by that Neutrosophic type-SuperHyperSet called the Neutrosophic Trace-Decomposition 6047

and it’s an Neutrosophic Trace-Decomposition. Since it’s 6048

6049
the maximum Neutrosophic cardinality of a Neutrosophic SuperHyperSet S of Neut- 6050
rosophic SuperHyperEdges[SuperHyperVertices] such that there’s no Neutrosophic Super- 6051
HyperVertex of a Neutrosophic SuperHyperEdge is common and there’s an Neutrosophic 6052
SuperHyperEdge for all Neutrosophic SuperHyperVertices. There aren’t only less than three 6053

Neutrosophic SuperHyperVertices inside the intended Neutrosophic SuperHyperSet, 6054

C(N SHG)N eutrosophicQuasi−T race−Decomposition

|EESHG:(V,E) |Neutrosophic Cardinality
b c
= {E2i−1 }i=1 2
.
C(N SHG)N eutrosophicQuasi−T race−DecompositionSuperHyperP olynomial
|EESHG:(V,E) |Neutrosophic Cardinality
= 2z b 2 c
.
C(N SHG)N eutrosophicR−Quasi−T race−Decomposition = {Vi }si=1 , {Vj }tj=1 .
C(N SHG)N eutrosophicR−Quasi−T race−DecompositionSuperHyperP olynomial = az s + bz t .

Thus the non-obvious Neutrosophic Trace-Decomposition, 6055

C(N SHG)N eutrosophicQuasi−T race−Decomposition

|EESHG:(V,E) |Neutrosophic Cardinality
b c
= {E2i−1 }i=1 2
.
C(N SHG)N eutrosophicQuasi−T race−DecompositionSuperHyperP olynomial
|EESHG:(V,E) |Neutrosophic Cardinality
= 2z b 2 c
.
C(N SHG)N eutrosophicR−Quasi−T race−Decomposition = {Vi }si=1 , {Vj }tj=1 .
C(N SHG)N eutrosophicR−Quasi−T race−DecompositionSuperHyperP olynomial = az s + bz t .

Is up. The obvious simple Neutrosophic type-SuperHyperSet of the Neutrosophic Trace- 6056
Decomposition, not: 6057

C(N SHG)N eutrosophicQuasi−T race−Decomposition

|EESHG:(V,E) |Neutrosophic Cardinality
b c
= {E2i−1 }i=1 2
.
C(N SHG)N eutrosophicQuasi−T race−DecompositionSuperHyperP olynomial

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics ·
DrHenryGarrett@gmail.com · Manhattan, NY, USA
|EESHG:(V,E) |Neutrosophic Cardinality
= 2z b 2 c
.
C(N SHG)N eutrosophicR−Quasi−T race−Decomposition = {Vi }si=1 , {Vj }tj=1 .
C(N SHG)N eutrosophicR−Quasi−T race−DecompositionSuperHyperP olynomial = az s + bz t .

Is the Neutrosophic SuperHyperSet, not: 6058

C(N SHG)N eutrosophicQuasi−T race−Decomposition

|EESHG:(V,E) |Neutrosophic Cardinality
b c
= {E2i−1 }i=1 2
.
C(N SHG)N eutrosophicQuasi−T race−DecompositionSuperHyperP olynomial
|EESHG:(V,E) |Neutrosophic Cardinality
= 2z b 2 c
.
C(N SHG)N eutrosophicR−Quasi−T race−Decomposition = {Vi }si=1 , {Vj }tj=1 .
C(N SHG)N eutrosophicR−Quasi−T race−DecompositionSuperHyperP olynomial = az s + bz t .

Does includes only less than three SuperHyperVertices in a connected Neutrosophic Super- 6059

HyperGraph ESHG : (V, E). It’s interesting to mention that the only non-obvious simple 6060
Neutrosophic type-SuperHyperSet called the 6061

“Neutrosophic Trace-Decomposition” 6062

amid those obvious[non-obvious] simple Neutrosophic type-SuperHyperSets called the 6063

Neutrosophic Trace-Decomposition, 6064

is only and only 6065

C(N SHG)N eutrosophicQuasi−T race−Decomposition

|EESHG:(V,E) |Neutrosophic Cardinality
b c
= {E2i−1 }i=1 2
.
C(N SHG)N eutrosophicQuasi−T race−DecompositionSuperHyperP olynomial
|EESHG:(V,E) |Neutrosophic Cardinality
= 2z b 2 c
.
C(N SHG)N eutrosophicR−Quasi−T race−Decomposition = {Vi }si=1 , {Vj }tj=1 .
C(N SHG)N eutrosophicR−Quasi−T race−DecompositionSuperHyperP olynomial = az s + bz t .

In a connected Neutrosophic SuperHyperGraph ESHG : (V, E).  6066

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 CHAPTER 31 6067

The Neutrosophic Departures on The 6068

Theoretical Results Toward Theoretical 6069

Motivations 6070

The previous Neutrosophic approach apply on the upcoming Neutrosophic results on 6071
Neutrosophic SuperHyperClasses. 6072

Proposition 31.0.1. Assume a connected Neutrosophic SuperHyperPath ESHP : (V, E). Then 6073

C(N SHG)Neutrosophic Trace-Decomposition

= {}.
C(N SHG)Neutrosophic Trace-Decomposition SuperHyperPolynomial
= 0z 0 .
C(N SHG)Neutrosophic V-Trace-Decomposition
= {}.
C(N SHG)Neutrosophic V-Trace-Decomposition SuperHyperPolynomial
= 0z 0 .
Proof. Let 6074

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V |EN SHG |
, E |EN SHG |
3 3
6075

P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
...,
EXT ERN AL
E |EN SHG | , V |EN SHG |
3 3

307
 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

SuperHyperTrace-Decomposition in the Example (42.0.5) 136NSHG18a

be a longest path taken from a connected Neutrosophic SuperHyperPath ESHP : (V, E). 6076
There’s a new way to redefine as 6077

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 6078
to ViEXT ERN AL in the literatures of SuperHyperTrace-Decomposition. The latter is 6079
straightforward.  6080

136EXM18a Example 31.0.2. In the Figure (31.1), the connected Neutrosophic SuperHyperPath ESHP : 6081
(V, E), is highlighted and featured. The Neutrosophic SuperHyperSet, in the Neutrosophic 6082
SuperHyperModel (31.1), is the SuperHyperTrace-Decomposition. 6083

Proposition 31.0.3. Assume a connected Neutrosophic SuperHyperCycle ESHC : (V, E). Then 6084

C(N SHG)Neutrosophic Trace-Decomposition

= {}.
C(N SHG)Neutrosophic Trace-Decomposition SuperHyperPolynomial
= 0z 0 .
C(N SHG)Neutrosophic V-Trace-Decomposition

Henry Garrett · 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-Trace-Decomposition SuperHyperPolynomial
= 0z 0 .

Proof. Let 6085

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V |EN SHG |
, E |EN SHG |
3 3
6086

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). 6087
There’s a new way to redefine as 6088

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 6089
to ViEXT ERN AL in the literatures of SuperHyperTrace-Decomposition. The latter is 6090

straightforward.  6091

136EXM19a Example 31.0.4. In the Figure (31.2), the connected Neutrosophic SuperHyperCycle N SHC : 6092
(V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, in the 6093

Neutrosophic SuperHyperModel (31.2), is the Neutrosophic SuperHyperTrace-Decomposition. 6094

Proposition 31.0.5. Assume a connected Neutrosophic SuperHyperStar ESHS : (V, E). Then 6095

C(N SHG)Neutrosophic Trace-Decomposition

= {}.
C(N SHG)Neutrosophic Trace-Decomposition SuperHyperPolynomial
= 0z 0 .
C(N SHG)Neutrosophic V-Trace-Decomposition
= {}.
C(N SHG)Neutrosophic V-Trace-Decomposition 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 SuperHyperTrace-Decomposition in the Neutrosophic Example (42.0.7) 136NSHG19a

Proof. Let 6096

P :
V1EXT ERN AL , E1 ,
CEN T ER, E2
6097

P :
E1 , V1EXT ERN AL ,
E2 , CEN T ER

be a longest path taken a connected Neutrosophic SuperHyperStar ESHS : (V, E). There’s a 6098
new way to redefine as 6099

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 6100
to ViEXT ERN AL in the literatures of SuperHyperTrace-Decomposition. The latter is 6101

straightforward.  6102

Henry Garrett · 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 SuperHyperTrace-Decomposition in the Neutrosophic Example (42.0.9) 136NSHG20a

136EXM20a Example 31.0.6. In the Figure (31.3), the connected Neutrosophic SuperHyperStar ESHS : 6103
(V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, by the Algorithm 6104
in previous Neutrosophic result, of the Neutrosophic SuperHyperVertices of the connected 6105
Neutrosophic SuperHyperStar ESHS : (V, E), in the Neutrosophic SuperHyperModel (31.3), is 6106
the Neutrosophic SuperHyperTrace-Decomposition. 6107

Proposition 31.0.7. Assume a connected Neutrosophic SuperHyperBipartite ESHB : (V, E). 6108
Then 6109

C(N SHG)Neutrosophic Trace-Decomposition

= {}.
C(N SHG)Neutrosophic Trace-Decomposition SuperHyperPolynomial
= 0z 0 .
C(N SHG)Neutrosophic V-Trace-Decomposition
= {}.
C(N SHG)Neutrosophic V-Trace-Decomposition SuperHyperPolynomial
= 0z 0 .

Proof. Let 6110

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
6111

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). 6112
There’s a new way to redefine as 6113

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 6114
to ViEXT ERN AL in the literatures of SuperHyperTrace-Decomposition. The latter is 6115

straightforward. Then there’s no at least one SuperHyperTrace-Decomposition. Thus the notion 6116
of quasi may be up but the SuperHyperNotions based on SuperHyperTrace-Decomposition 6117
could be applied. There are only two SuperHyperParts. Thus every SuperHyperPart could have 6118
one SuperHyperVertex as the representative in the 6119

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperTrace-Decomposition taken from a connected Neutrosophic SuperHyper- 6120
Bipartite ESHB : (V, E). Thus only some SuperHyperVertices and only minimum-Neutrosophic- 6121
of-SuperHyperPart SuperHyperEdges are attained in any solution 6122

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
The latter is straightforward.  6123

136EXM21a Example 31.0.8. In the Neutrosophic Figure (31.4), the connected Neutrosophic SuperHy- 6124
perBipartite ESHB : (V, E), is Neutrosophic highlighted and Neutrosophic featured. The 6125
obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous Neutrosophic 6126
result, of the Neutrosophic SuperHyperVertices of the connected Neutrosophic SuperHyper- 6127
Bipartite ESHB : (V, E), in the Neutrosophic SuperHyperModel (31.4), is the Neutrosophic 6128

SuperHyperTrace-Decomposition. 6129

Henry Garrett · 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 SuperHyperTrace-Decomposition in the Example (42.0.11) 136NSHG21a

Proposition 31.0.9. Assume a connected Neutrosophic SuperHyperMultipartite ESHM : (V, E). 6130
Then 6131

C(N SHG)Neutrosophic Trace-Decomposition

= {}.
C(N SHG)Neutrosophic Trace-Decomposition SuperHyperPolynomial
= 0z 0 .
C(N SHG)Neutrosophic V-Trace-Decomposition
= {}.
C(N SHG)Neutrosophic V-Trace-Decomposition SuperHyperPolynomial
= 0z 0 .

Proof. Let 6132

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

6133

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 SuperHyperTrace-Decomposition taken from a connected Neutrosophic SuperHy- 6134

perMultipartite ESHM : (V, E). There’s a new way to redefine as 6135

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 6136
to ViEXT ERN AL in the literatures of SuperHyperTrace-Decomposition. The latter is 6137
straightforward. Then there’s no at least one SuperHyperTrace-Decomposition. Thus the notion 6138
of quasi may be up but the SuperHyperNotions based on SuperHyperTrace-Decomposition 6139
could be applied. There are only z 0 SuperHyperParts. Thus every SuperHyperPart could have 6140

one SuperHyperVertex as the representative in the 6141

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest path taken from a connected Neutrosophic SuperHyperMultipartite ESHM : (V, E). 6142
Thus only some SuperHyperVertices and only minimum-Neutrosophic-of-SuperHyperPart 6143
SuperHyperEdges are attained in any solution 6144

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest path taken from a connected Neutrosophic SuperHyperMultipartite ESHM : (V, E). 6145
The latter is straightforward.  6146

136EXM22a Example 31.0.10. In the Figure (31.5), the connected Neutrosophic SuperHyperMultipartite 6147
ESHM : (V, E), is highlighted and Neutrosophic featured. The obtained Neutrosophic 6148
SuperHyperSet, by the Algorithm in previous Neutrosophic result, of the Neutrosophic 6149
SuperHyperVertices of the connected Neutrosophic SuperHyperMultipartite ESHM : (V, E), in 6150
the Neutrosophic SuperHyperModel (31.5), is the Neutrosophic SuperHyperTrace-Decomposition. 6151
6152

Proposition 31.0.11. Assume a connected Neutrosophic SuperHyperWheel ESHW : (V, E). 6153
Then, 6154

C(N SHG)Neutrosophic Trace-Decomposition

Henry Garrett · 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

SuperHyperTrace-Decomposition in the Example (42.0.13) 136NSHG22a

= {}.
C(N SHG)Neutrosophic Trace-Decomposition SuperHyperPolynomial
= 0z 0 .
C(N SHG)Neutrosophic V-Trace-Decomposition
= {CEN T ER}.
C(N SHG)Neutrosophic V-Trace-Decomposition SuperHyperPolynomial
= z |CEN T ER| .
Proof. Let 6155

P :
V1EXT ERN AL , E1∗ ,
CEN T ER, E2∗
6156

P :
E1∗ , V1EXT ERN AL ,
E2∗ , CEN T ER
is a longest SuperHyperTrace-Decomposition taken from a connected Neutrosophic SuperHy- 6157
perWheel ESHW : (V, E). There’s a new way to redefine as 6158

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 SuperHyperTrace-Decomposition in the Neutrosophic Example (42.0.15) 136NSHG23a

The term “EXTERNAL” implies |N (ViEXT ERN AL )| ≥ |N (Vj )| where Vj is corresponded 6159
to ViEXT ERN AL in the literatures of SuperHyperTrace-Decomposition. The latter is 6160

straightforward. Then there’s at least one SuperHyperTrace-Decomposition. Thus the notion 6161
of quasi isn’t up and the SuperHyperNotions based on SuperHyperTrace-Decomposition 6162
could be applied. The unique embedded SuperHyperTrace-Decomposition proposes some 6163
longest SuperHyperTrace-Decomposition excerpt from some representatives. The latter is 6164
straightforward.  6165

136EXM23a Example 31.0.12. In the Neutrosophic Figure (31.6), the connected Neutrosophic SuperHyper- 6166
Wheel N SHW : (V, E), is Neutrosophic highlighted and featured. The obtained Neutrosophic 6167
SuperHyperSet, by the Algorithm in previous result, of the Neutrosophic SuperHyperVer- 6168

tices of the connected Neutrosophic SuperHyperWheel ESHW : (V, E), in the Neutrosophic 6169
SuperHyperModel (31.6), is the Neutrosophic SuperHyperTrace-Decomposition. 6170

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 CHAPTER 32 6171

The Surveys of Mathematical Sets On 6172

The Results But As The Initial Motivation 6173

For the SuperHyperTrace-Decomposition, Neutrosophic SuperHyperTrace-Decomposition, and 6174

the Neutrosophic SuperHyperTrace-Decomposition, some general results are introduced. 6175

Remark 32.0.1. Let remind that the Neutrosophic SuperHyperTrace-Decomposition is “redefined” 6176
on the positions of the alphabets. 6177

Corollary 32.0.2. Assume Neutrosophic SuperHyperTrace-Decomposition. Then 6178

N eutrosophic SuperHyperT race − Decomposition =

{theSuperHyperT race − Decompositionof theSuperHyperV ertices |
max |SuperHyperOf f ensive
SuperHyperT race − Decomposition
|N eutrosophiccardinalityamidthoseSuperHyperT race−Decomposition. }

plus one Neutrosophic SuperHypeNeighbor to one. Where σi is the unary operation on the 6179
SuperHyperVertices of the SuperHyperGraph to assign the determinacy, the indeterminacy and 6180
the neutrality, for i = 1, 2, 3, respectively. 6181

Corollary 32.0.3. Assume a Neutrosophic SuperHyperGraph on the same identical letter 6182
of the alphabet. Then the notion of Neutrosophic SuperHyperTrace-Decomposition and 6183

SuperHyperTrace-Decomposition coincide. 6184

Corollary 32.0.4. Assume a Neutrosophic SuperHyperGraph on the same identical letter of 6185
the alphabet. Then a conseNeighborive sequence of the SuperHyperVertices is a Neutrosophic 6186
SuperHyperTrace-Decomposition if and only if it’s a SuperHyperTrace-Decomposition. 6187

Corollary 32.0.5. Assume a Neutrosophic SuperHyperGraph on the same identical letter of 6188
the alphabet. Then a conseNeighborive sequence of the SuperHyperVertices is a strongest 6189
SuperHyperTrace-Decomposition if and only if it’s a longest SuperHyperTrace-Decomposition. 6190

Corollary 32.0.6. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph on the same 6191

identical letter of the alphabet. Then its Neutrosophic SuperHyperTrace-Decomposition is its 6192
SuperHyperTrace-Decomposition and reversely. 6193

317
Henry Garrett · Independent Researcher · Department of Mathematics ·
DrHenryGarrett@gmail.com · Manhattan, NY, USA

Corollary 32.0.7. Assume a Neutrosophic SuperHyperPath(-/SuperHyperTrace-Decomposition, 6194

SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel) on the same 6195
identical letter of the alphabet. Then its Neutrosophic SuperHyperTrace-Decomposition is its 6196
SuperHyperTrace-Decomposition and reversely. 6197

Corollary 32.0.8. Assume a Neutrosophic SuperHyperGraph. Then its Neutrosophic 6198

SuperHyperTrace-Decomposition isn’t well-defined if and only if its SuperHyperTrace- 6199
Decomposition isn’t well-defined. 6200

Corollary 32.0.9. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph. Then 6201

its Neutrosophic SuperHyperTrace-Decomposition isn’t well-defined if and only if its 6202
SuperHyperTrace-Decomposition isn’t well-defined. 6203

Corollary 32.0.10. Assume a Neutrosophic SuperHyperPath(-/SuperHyperTrace-Decomposition, 6204

SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). Then 6205
its Neutrosophic SuperHyperTrace-Decomposition isn’t well-defined if and only if its 6206

SuperHyperTrace-Decomposition isn’t well-defined. 6207

Corollary 32.0.11. Assume a Neutrosophic SuperHyperGraph. Then its Neutrosophic 6208

SuperHyperTrace-Decomposition is well-defined if and only if its SuperHyperTrace-Decomposition 6209

is well-defined. 6210

Corollary 32.0.12. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph. Then its 6211

Neutrosophic SuperHyperTrace-Decomposition is well-defined if and only if its SuperHyperTrace- 6212

Decomposition is well-defined. 6213

Corollary 32.0.13. Assume a Neutrosophic SuperHyperPath(-/SuperHyperTrace-Decomposition, 6214

SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). Then its 6215

Neutrosophic SuperHyperTrace-Decomposition is well-defined if and only if its SuperHyperTrace- 6216
Decomposition is well-defined. 6217

Proposition 32.0.14. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. Then V is 6218

(i) : the dual SuperHyperDefensive SuperHyperTrace-Decomposition; 6219

(ii) : the strong dual SuperHyperDefensive SuperHyperTrace-Decomposition; 6220

(iii) : the connected dual SuperHyperDefensive SuperHyperTrace-Decomposition; 6221

(iv) : the δ-dual SuperHyperDefensive SuperHyperTrace-Decomposition; 6222

(v) : the strong δ-dual SuperHyperDefensive SuperHyperTrace-Decomposition; 6223

(vi) : the connected δ-dual SuperHyperDefensive SuperHyperTrace-Decomposition. 6224

Proposition 32.0.15. Let N T G : (V, E, σ, µ) be a Neutrosophic SuperHyperGraph. Then ∅ is 6225

(i) : the SuperHyperDefensive SuperHyperTrace-Decomposition; 6226

(ii) : the strong SuperHyperDefensive SuperHyperTrace-Decomposition; 6227

(iii) : the connected defensive SuperHyperDefensive SuperHyperTrace-Decomposition; 6228

(iv) : the δ-SuperHyperDefensive SuperHyperTrace-Decomposition; 6229

Henry Garrett · 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 SuperHyperTrace-Decomposition; 6230

(vi) : the connected δ-SuperHyperDefensive SuperHyperTrace-Decomposition. 6231

Proposition 32.0.16. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. Then an 6232

independent SuperHyperSet is 6233

(i) : the SuperHyperDefensive SuperHyperTrace-Decomposition; 6234

(ii) : the strong SuperHyperDefensive SuperHyperTrace-Decomposition; 6235

(iii) : the connected SuperHyperDefensive SuperHyperTrace-Decomposition; 6236

(iv) : the δ-SuperHyperDefensive SuperHyperTrace-Decomposition; 6237

(v) : the strong δ-SuperHyperDefensive SuperHyperTrace-Decomposition; 6238

(vi) : the connected δ-SuperHyperDefensive SuperHyperTrace-Decomposition. 6239

Proposition 32.0.17. Let ESHG : (V, E) be a Neutrosophic SuperHyperUniform SuperHyper- 6240

Graph which is a SuperHyperTrace-Decomposition/SuperHyperPath. Then V is a maximal 6241

(i) : SuperHyperDefensive SuperHyperTrace-Decomposition; 6242

(ii) : strong SuperHyperDefensive SuperHyperTrace-Decomposition; 6243

(iii) : connected SuperHyperDefensive SuperHyperTrace-Decomposition; 6244

(iv) : O(ESHG)-SuperHyperDefensive SuperHyperTrace-Decomposition; 6245

(v) : strong O(ESHG)-SuperHyperDefensive SuperHyperTrace-Decomposition; 6246

(vi) : connected O(ESHG)-SuperHyperDefensive SuperHyperTrace-Decomposition; 6247

Where the exterior SuperHyperVertices and the interior SuperHyperVertices coincide. 6248

Proposition 32.0.18. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is a 6249

SuperHyperUniform SuperHyperWheel. Then V is a maximal 6250

(i) : dual SuperHyperDefensive SuperHyperTrace-Decomposition; 6251

(ii) : strong dual SuperHyperDefensive SuperHyperTrace-Decomposition; 6252

(iii) : connected dual SuperHyperDefensive SuperHyperTrace-Decomposition; 6253

(iv) : O(ESHG)-dual SuperHyperDefensive SuperHyperTrace-Decomposition; 6254

(v) : strong O(ESHG)-dual SuperHyperDefensive SuperHyperTrace-Decomposition; 6255

(vi) : connected O(ESHG)-dual SuperHyperDefensive SuperHyperTrace-Decomposition; 6256

Where the exterior SuperHyperVertices and the interior SuperHyperVertices coincide. 6257

Proposition 32.0.19. Let ESHG : (V, E) be a Neutrosophic SuperHyperUniform SuperHyper- 6258

Graph which is a SuperHyperTrace-Decomposition/SuperHyperPath. Then the number of 6259

Henry Garrett · 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 SuperHyperTrace-Decomposition; 6260

(ii) : the SuperHyperTrace-Decomposition; 6261

(iii) : the connected SuperHyperTrace-Decomposition; 6262

(iv) : the O(ESHG)-SuperHyperTrace-Decomposition; 6263

(v) : the strong O(ESHG)-SuperHyperTrace-Decomposition; 6264

(vi) : the connected O(ESHG)-SuperHyperTrace-Decomposition. 6265

is one and it’s only V. Where the exterior SuperHyperVertices and the interior SuperHyperVertices 6266
coincide. 6267

Proposition 32.0.20. Let ESHG : (V, E) be a Neutrosophic SuperHyperUniform SuperHyper- 6268

Graph which is a SuperHyperWheel. Then the number of 6269

(i) : the dual SuperHyperTrace-Decomposition; 6270

(ii) : the dual SuperHyperTrace-Decomposition; 6271

(iii) : the dual connected SuperHyperTrace-Decomposition; 6272

(iv) : the dual O(ESHG)-SuperHyperTrace-Decomposition; 6273

(v) : the strong dual O(ESHG)-SuperHyperTrace-Decomposition; 6274

(vi) : the connected dual O(ESHG)-SuperHyperTrace-Decomposition. 6275

is one and it’s only V. Where the exterior SuperHyperVertices and the interior SuperHyperVertices 6276
coincide. 6277

Proposition 32.0.21. Let ESHG : (V, E) be a Neutrosophic SuperHyperUniform SuperHy- 6278

perGraph which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyper- 6279
Complete SuperHyperMultipartite. Then a SuperHyperSet contains [the SuperHyperCenter 6280

and] the half of multiplying r with the number of all the SuperHyperEdges plus one of all the 6281
SuperHyperVertices is a 6282

(i) : dual SuperHyperDefensive SuperHyperTrace-Decomposition; 6283

(ii) : strong dual SuperHyperDefensive SuperHyperTrace-Decomposition; 6284

(iii) : connected dual SuperHyperDefensive SuperHyperTrace-Decomposition; 6285

O(ESHG)
(iv) : 2 + 1-dual SuperHyperDefensive SuperHyperTrace-Decomposition; 6286

O(ESHG)
(v) : strong 2 + 1-dual SuperHyperDefensive SuperHyperTrace-Decomposition; 6287

O(ESHG)
(vi) : connected 2 + 1-dual SuperHyperDefensive SuperHyperTrace-Decomposition. 6288

Henry Garrett · 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- 6289

Graph which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperCom- 6290
plete SuperHyperMultipartite. Then a SuperHyperSet contains the half of multiplying r with 6291
the number of all the SuperHyperEdges plus one of all the SuperHyperVertices in the biggest 6292
SuperHyperPart is a 6293

(i) : SuperHyperDefensive SuperHyperTrace-Decomposition; 6294

(ii) : strong SuperHyperDefensive SuperHyperTrace-Decomposition; 6295

(iii) : connected SuperHyperDefensive SuperHyperTrace-Decomposition; 6296

(iv) : δ-SuperHyperDefensive SuperHyperTrace-Decomposition; 6297

(v) : strong δ-SuperHyperDefensive SuperHyperTrace-Decomposition; 6298

(vi) : connected δ-SuperHyperDefensive SuperHyperTrace-Decomposition. 6299

Proposition 32.0.23. Let ESHG : (V, E) be a Neutrosophic SuperHyperUniform SuperHyper- 6300

Graph which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperCom- 6301

plete SuperHyperMultipartite. Then Then the number of 6302

(i) : dual SuperHyperDefensive SuperHyperTrace-Decomposition; 6303

(ii) : strong dual SuperHyperDefensive SuperHyperTrace-Decomposition; 6304

(iii) : connected dual SuperHyperDefensive SuperHyperTrace-Decomposition; 6305

O(ESHG)
(iv) : 2 + 1-dual SuperHyperDefensive SuperHyperTrace-Decomposition; 6306

O(ESHG)
(v) : strong 2 + 1-dual SuperHyperDefensive SuperHyperTrace-Decomposition; 6307

O(ESHG)
(vi) : connected 2 + 1-dual SuperHyperDefensive SuperHyperTrace-Decomposition. 6308

is one and it’s only S, a SuperHyperSet contains [the SuperHyperCenter and] the half of 6309
multiplying r with the number of all the SuperHyperEdges plus one of all the SuperHyperVertices. 6310
Where the exterior SuperHyperVertices and the interior SuperHyperVertices coincide. 6311

Proposition 32.0.24. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. The number of 6312
connected component is |V − S| if there’s a SuperHyperSet which is a dual 6313

(i) : SuperHyperDefensive SuperHyperTrace-Decomposition; 6314

(ii) : strong SuperHyperDefensive SuperHyperTrace-Decomposition; 6315

(iii) : connected SuperHyperDefensive SuperHyperTrace-Decomposition; 6316

(iv) : SuperHyperTrace-Decomposition; 6317

(v) : strong 1-SuperHyperDefensive SuperHyperTrace-Decomposition; 6318

(vi) : connected 1-SuperHyperDefensive SuperHyperTrace-Decomposition. 6319

Henry Garrett · 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 6320
number is at most O(ESHG) and the Neutrosophic number is at most On (ESHG). 6321

Proposition 32.0.26. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is 6322

SuperHyperComplete. The number is O(ESHG:(V,E)) 2 + 1 and the Neutrosophic number is 6323

min Σv∈{v1 ,v2 ,··· ,vt } O(ESHG:(V,E)) ⊆V σ(v), in the setting of dual 6324
t>
2

(i) : SuperHyperDefensive SuperHyperTrace-Decomposition; 6325

(ii) : strong SuperHyperDefensive SuperHyperTrace-Decomposition; 6326

(iii) : connected SuperHyperDefensive SuperHyperTrace-Decomposition; 6327

(iv) : ( O(ESHG:(V,E))
2 + 1)-SuperHyperDefensive SuperHyperTrace-Decomposition; 6328

(v) : strong ( O(ESHG:(V,E))

2 + 1)-SuperHyperDefensive SuperHyperTrace-Decomposition; 6329

(vi) : connected ( O(ESHG:(V,E))

2 + 1)-SuperHyperDefensive SuperHyperTrace-Decomposition. 6330

Proposition 32.0.27. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is ∅. The 6331
number is 0 and the Neutrosophic number is 0, for an independent SuperHyperSet in the setting 6332
of dual 6333

(i) : SuperHyperDefensive SuperHyperTrace-Decomposition; 6334

(ii) : strong SuperHyperDefensive SuperHyperTrace-Decomposition; 6335

(iii) : connected SuperHyperDefensive SuperHyperTrace-Decomposition; 6336

(iv) : 0-SuperHyperDefensive SuperHyperTrace-Decomposition; 6337

(v) : strong 0-SuperHyperDefensive SuperHyperTrace-Decomposition; 6338

(vi) : connected 0-SuperHyperDefensive SuperHyperTrace-Decomposition. 6339

Proposition 32.0.28. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is 6340

SuperHyperComplete. Then there’s no independent SuperHyperSet. 6341

Proposition 32.0.29. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is 6342

SuperHyperTrace-Decomposition/SuperHyperPath/SuperHyperWheel. The number is O(ESHG : 6343

(V, E)) and the Neutrosophic number is On (ESHG : (V, E)), in the setting of a dual 6344

(i) : SuperHyperDefensive SuperHyperTrace-Decomposition; 6345

(ii) : strong SuperHyperDefensive SuperHyperTrace-Decomposition; 6346

(iii) : connected SuperHyperDefensive SuperHyperTrace-Decomposition; 6347

(iv) : O(ESHG : (V, E))-SuperHyperDefensive SuperHyperTrace-Decomposition; 6348

(v) : strong O(ESHG : (V, E))-SuperHyperDefensive SuperHyperTrace-Decomposition; 6349

(vi) : connected O(ESHG : (V, E))-SuperHyperDefensive SuperHyperTrace-Decomposition. 6350

Henry Garrett · 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 6351

SuperHyperStar/complete SuperHyperBipartite/complete SuperHyperMultiPartite. The number 6352

is O(ESHG:(V,E))
2 + 1 and the Neutrosophic number is min Σv∈{v1 ,v2 ,··· ,vt } O(ESHG:(V,E)) ⊆V σ(v), 6353
t>
2
in the setting of a dual 6354

(i) : SuperHyperDefensive SuperHyperTrace-Decomposition; 6355

(ii) : strong SuperHyperDefensive SuperHyperTrace-Decomposition; 6356

(iii) : connected SuperHyperDefensive SuperHyperTrace-Decomposition; 6357

(iv) : ( O(ESHG:(V,E))
2 + 1)-SuperHyperDefensive SuperHyperTrace-Decomposition; 6358

(v) : strong ( O(ESHG:(V,E))

2 + 1)-SuperHyperDefensive SuperHyperTrace-Decomposition; 6359

(vi) : connected ( O(ESHG:(V,E))

2 + 1)-SuperHyperDefensive SuperHyperTrace-Decomposition. 6360

Proposition 32.0.31. Let N SHF : (V, E) be a SuperHyperFamily of the ESHGs : (V, E) 6361
Neutrosophic SuperHyperGraphs which are from one-type SuperHyperClass which the result is 6362

obtained for the individuals. Then the results also hold for the SuperHyperFamily N SHF : (V, E) 6363
of these specific SuperHyperClasses of the Neutrosophic SuperHyperGraphs. 6364

Proposition 32.0.32. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph. If S is a 6365

dual SuperHyperDefensive SuperHyperTrace-Decomposition, then ∀v ∈ V \ S, ∃x ∈ S such that 6366

(i) v ∈ Ns (x); 6367

(ii) vx ∈ E. 6368

Proposition 32.0.33. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph. If S is 6369

a dual SuperHyperDefensive SuperHyperTrace-Decomposition, then 6370

(i) S is SuperHyperTrace-Decomposition set; 6371

(ii) there’s S ⊆ S 0 such that |S 0 | is SuperHyperChromatic number. 6372

Proposition 32.0.34. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph. Then 6373

(i) Γ ≤ O; 6374

(ii) Γs ≤ On . 6375

Proposition 32.0.35. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph which is 6376
connected. Then 6377

(i) Γ ≤ O − 1; 6378

(ii) Γs ≤ On − Σ3i=1 σi (x). 6379

Proposition 32.0.36. Let ESHG : (V, E) be an odd SuperHyperPath. Then 6380

(i) the SuperHyperSet S = {v2 , v4 , · · · , vn−1 } is a dual SuperHyperDefensive SuperHyperTrace- 6381

Decomposition; 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

(ii) Γ = b n2 c + 1 and corresponded SuperHyperSet is S = {v2 , v4 , · · · , vn−1 }; 6383

(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· ,vn−1 } Σ3i=1 σi (s)}; 6384

(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn−1 } and S2 = {v1 , v3 , · · · , vn−1 } are only a dual 6385
SuperHyperTrace-Decomposition. 6386

Proposition 32.0.37. Let ESHG : (V, E) be an even SuperHyperPath. Then 6387

(i) the set S = {v2 , v4 , · · · .vn } is a dual SuperHyperDefensive SuperHyperTrace- 6388

Decomposition; 6389

(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · .vn } and {v1 , v3 , · · · .vn−1 }; 6390

(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 6391

(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 6392
SuperHyperTrace-Decomposition. 6393

Proposition 32.0.38. Let ESHG : (V, E) be an even SuperHyperTrace-Decomposition. Then 6394

(i) the SuperHyperSet S = {v2 , v4 , · · · , vn } is a dual SuperHyperDefensive SuperHyperTrace- 6395

Decomposition; 6396

(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · , vn } and {v1 , v3 , · · · , vn−1 }; 6397

(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } σ(s), Σs∈S={v1 ,v3 ,··· ,vn−1 } σ(s)}; 6398

(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn } and S2 = {v1 , v3 , · · · , vn−1 } are only dual 6399
SuperHyperTrace-Decomposition. 6400

Proposition 32.0.39. Let ESHG : (V, E) be an odd SuperHyperTrace-Decomposition. Then 6401

(i) the SuperHyperSet S = {v2 , v4 , · · · , vn−1 } is a dual SuperHyperDefensive SuperHyperTrace- 6402

Decomposition; 6403

(ii) Γ = b n2 c + 1 and corresponded SuperHyperSet is S = {v2 , v4 , · · · , vn−1 }; 6404

(iii) Γs = min{Σs∈S={v2 ,v4 ,··· .vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 6405

(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn−1 } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 6406
SuperHyperTrace-Decomposition. 6407

Proposition 32.0.40. Let ESHG : (V, E) be SuperHyperStar. Then 6408

(i) the SuperHyperSet S = {c} is a dual maximal SuperHyperTrace-Decomposition; 6409

(ii) Γ = 1; 6410

(iii) Γs = Σ3i=1 σi (c); 6411

(iv) the SuperHyperSets S = {c} and S ⊂ S 0 are only dual SuperHyperTrace-Decomposition. 6412

Proposition 32.0.41. Let ESHG : (V, E) be SuperHyperWheel. Then 6413

Henry Garrett · 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 6414

SuperHyperDefensive SuperHyperTrace-Decomposition; 6415

6+3(i−1)≤n
(ii) Γ = |{v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 |; 6416

(iii) Γs = Σ{v1 ,v3 }∪{v6 ,v9 ··· ,vi+6 ,··· ,vn }6+3(i−1)≤n Σ3i=1 σi (s); 6417
i=1

6+3(i−1)≤n
(iv) the SuperHyperSet {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is only a dual maximal 6418
SuperHyperDefensive SuperHyperTrace-Decomposition. 6419

Proposition 32.0.42. Let ESHG : (V, E) be an odd SuperHyperComplete. Then 6420

b n c+1
(i) the SuperHyperSet S = {vi }i=1
2
is a dual SuperHyperDefensive SuperHyperTrace- 6421
Decomposition; 6422

(ii) Γ = b n2 c + 1; 6423

(iii) Γs = min{Σs∈S Σ3i=1 σi (s)} b n c+1

2
; 6424
S={vi }i=1

b n c+1
(iv) the SuperHyperSet S = {vi }i=1
2
is only a dual SuperHyperDefensive SuperHyperTrace- 6425
Decomposition. 6426

Proposition 32.0.43. Let ESHG : (V, E) be an even SuperHyperComplete. Then 6427

bnc
(i) the SuperHyperSet S = {vi }i=1
2
is a dual SuperHyperDefensive SuperHyperTrace- 6428
Decomposition; 6429

(ii) Γ = b n2 c; 6430

(iii) Γs = min{Σs∈S Σ3i=1 σi (s)} bnc

2
; 6431
S={vi }i=1

bnc
(iv) the SuperHyperSet S = {vi }i=1 2
is only a dual maximal SuperHyperDefensive 6432
SuperHyperTrace-Decomposition. 6433

Proposition 32.0.44. Let N SHF : (V, E) be a m-SuperHyperFamily of Neutrosophic SuperHy- 6434

perStars with common Neutrosophic SuperHyperVertex SuperHyperSet. Then 6435

(i) the SuperHyperSet S = {c1 , c2 , · · · , cm } is a dual SuperHyperDefensive SuperHyperTrace- 6436

Decomposition for N SHF; 6437

(ii) Γ = m for N SHF : (V, E); 6438

(iii) Γs = Σm 3
i=1 Σj=1 σj (ci ) for N SHF : (V, E); 6439

(iv) the SuperHyperSets S = {c1 , c2 , · · · , cm } and S ⊂ S 0 are only dual SuperHyperTrace- 6440
Decomposition for N SHF : (V, E). 6441

Proposition 32.0.45. Let N SHF : (V, E) be an m-SuperHyperFamily of odd SuperHyperCom- 6442

plete SuperHyperGraphs with common Neutrosophic SuperHyperVertex SuperHyperSet. Then 6443

Henry Garrett · 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 6444

SuperHyperTrace-Decomposition for N SHF; 6445

(ii) Γ = b n2 c + 1 for N SHF : (V, E); 6446

(iii) Γs = min{Σs∈S Σ3i=1 σi (s)} 2

b n c+1 for N SHF : (V, E); 6447
S={vi }i=1

b n c+1
(iv) the SuperHyperSets S = {vi }i=1 2
are only a dual maximal SuperHyperTrace- 6448

Decomposition for N SHF : (V, E). 6449

Proposition 32.0.46. Let N SHF : (V, E) be a m-SuperHyperFamily of even SuperHyperCom- 6450

plete SuperHyperGraphs with common Neutrosophic SuperHyperVertex SuperHyperSet. Then 6451

bnc
(i) the SuperHyperSet S = {vi }i=1 2
is a dual SuperHyperDefensive SuperHyperTrace- 6452
Decomposition for N SHF : (V, E); 6453

(ii) Γ = b n2 c for N SHF : (V, E); 6454

(iii) Γs = min{Σs∈S Σ3i=1 σi (s)} 2

bnc for N SHF : (V, E); 6455
S={vi }i=1

bnc
(iv) the SuperHyperSets S = {vi }i=1
2
are only dual maximal SuperHyperTrace-Decomposition 6456
for N SHF : (V, E). 6457

Proposition 32.0.47. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph. Then 6458

following statements hold; 6459

(i) if s ≥ t and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 6460

SuperHyperTrace-Decomposition, then S is an s-SuperHyperDefensive SuperHyperTrace- 6461

Decomposition; 6462

(ii) if s ≤ t and a SuperHyperSet S of SuperHyperVertices is a dual t-SuperHyperDefensive 6463

SuperHyperTrace-Decomposition, then S is a dual s-SuperHyperDefensive SuperHyperTrace- 6464
Decomposition. 6465

Proposition 32.0.48. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph. Then 6466
following statements hold; 6467

(i) if s ≥ t + 2 and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 6468

SuperHyperTrace-Decomposition, then S is an s-SuperHyperPowerful SuperHyperTrace- 6469

Decomposition; 6470

(ii) if s ≤ t and a SuperHyperSet S of SuperHyperVertices is a dual t-SuperHyperDefensive 6471

SuperHyperTrace-Decomposition, then S is a dual s-SuperHyperPowerful SuperHyperTrace- 6472
Decomposition. 6473

Proposition 32.0.49. Let ESHG : (V, E) be a[an] [V-]SuperHyperUniform-strong-Neutrosophic 6474

SuperHyperGraph. Then following statements hold; 6475

(i) if ∀a ∈ S, |Ns (a) ∩ S| < b 2r c + 1, then ESHG : (V, E) is an 2-SuperHyperDefensive 6476

SuperHyperTrace-Decomposition; 6477

Henry Garrett · 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 6478
SuperHyperTrace-Decomposition; 6479

(iii) if ∀a ∈ S, |Ns (a) ∩ V \ S| = 0, then ESHG : (V, E) is an V-SuperHyperDefensive 6480

SuperHyperTrace-Decomposition; 6481

(iv) if ∀a ∈ V \ S, |Ns (a) ∩ V \ S| = 0, then ESHG : (V, E) is a dual V-SuperHyperDefensive 6482

SuperHyperTrace-Decomposition. 6483

Proposition 32.0.50. Let ESHG : (V, E) is a[an] [V-]SuperHyperUniform-strong-Neutrosophic 6484

SuperHyperGraph. Then following statements hold; 6485

(i) ∀a ∈ S, |Ns (a) ∩ S| < b 2r c + 1 if ESHG : (V, E) is an 2-SuperHyperDefensive 6486

SuperHyperTrace-Decomposition; 6487

(ii) ∀a ∈ V \ S, |Ns (a) ∩ S| > b 2r c + 1 if ESHG : (V, E) is a dual 2-SuperHyperDefensive 6488

SuperHyperTrace-Decomposition; 6489

(iii) ∀a ∈ S, |Ns (a) ∩ V \ S| = 0 if ESHG : (V, E) is an V-SuperHyperDefensive 6490

SuperHyperTrace-Decomposition; 6491

(iv) ∀a ∈ V \ S, |Ns (a) ∩ V \ S| = 0 if ESHG : (V, E) is a dual V-SuperHyperDefensive 6492

SuperHyperTrace-Decomposition. 6493

Proposition 32.0.51. Let ESHG : (V, E) is a[an] [V-]SuperHyperUniform-strong-Neutrosophic 6494

SuperHyperGraph which is a SuperHyperComplete. Then following statements hold; 6495

(i) ∀a ∈ S, |Ns (a) ∩ S| < b O−1

2 c + 1 if ESHG : (V, E) is an 2-SuperHyperDefensive 6496
SuperHyperTrace-Decomposition; 6497

(ii) ∀a ∈ V \ S, |Ns (a) ∩ S| > b O−1

2 c + 1 if ESHG : (V, E) is a dual 2-SuperHyperDefensive 6498
SuperHyperTrace-Decomposition; 6499

(iii) ∀a ∈ S, |Ns (a) ∩ V \ S| = 0 if ESHG : (V, E) is an (O − 1)-SuperHyperDefensive 6500

SuperHyperTrace-Decomposition; 6501

(iv) ∀a ∈ V \ S, |Ns (a) ∩ V \ S| = 0 if ESHG : (V, E) is a dual (O − 1)-SuperHyperDefensive 6502

SuperHyperTrace-Decomposition. 6503

Proposition 32.0.52. Let ESHG : (V, E) is a[an] [V-]SuperHyperUniform-strong-Neutrosophic 6504

SuperHyperGraph which is a SuperHyperComplete. Then following statements hold; 6505

(i) if ∀a ∈ S, |Ns (a) ∩ S| < b O−1

2 c
+ 1, then ESHG : (V, E) is an 2-SuperHyperDefensive 6506

SuperHyperTrace-Decomposition; 6507

(ii) if ∀a ∈ V \ S, |Ns (a) ∩ S| > b O−1 2 c + 1, then ESHG : (V, E) is a dual 2- 6508
SuperHyperDefensive SuperHyperTrace-Decomposition; 6509

(iii) if ∀a ∈ S, |Ns (a) ∩ V \ S| = 0, then ESHG : (V, E) is (O − 1)-SuperHyperDefensive 6510

SuperHyperTrace-Decomposition; 6511

(iv) if ∀a ∈ V \ S, |Ns (a) ∩ V \ S| = 0, then ESHG : (V, E) is a dual (O − 1)- 6512

SuperHyperDefensive SuperHyperTrace-Decomposition. 6513

Henry Garrett · 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 6514

SuperHyperGraph which is SuperHyperTrace-Decomposition. Then following statements hold; 6515

(i) ∀a ∈ S, |Ns (a)∩S| < 2 if ESHG : (V, E)) is an 2-SuperHyperDefensive SuperHyperTrace- 6516

Decomposition; 6517

(ii) ∀a ∈ V \ S, |Ns (a) ∩ S| > 2 if ESHG : (V, E) is a dual 2-SuperHyperDefensive 6518

SuperHyperTrace-Decomposition; 6519

(iii) ∀a ∈ S, |Ns (a) ∩ V \ S| = 0 if ESHG : (V, E) is an 2-SuperHyperDefensive 6520

SuperHyperTrace-Decomposition; 6521

(iv) ∀a ∈ V \ S, |Ns (a) ∩ V \ S| = 0 if ESHG : (V, E) is a dual 2-SuperHyperDefensive 6522

SuperHyperTrace-Decomposition. 6523

Proposition 32.0.54. Let ESHG : (V, E) is a[an] [V-]SuperHyperUniform-strong-Neutrosophic 6524

SuperHyperGraph which is SuperHyperTrace-Decomposition. Then following statements hold; 6525

(i) if ∀a ∈ S, |Ns (a) ∩ S| < 2, then ESHG : (V, E) is an 2-SuperHyperDefensive 6526

SuperHyperTrace-Decomposition; 6527

(ii) if ∀a ∈ V \ S, |Ns (a) ∩ S| > 2, then ESHG : (V, E) is a dual 2-SuperHyperDefensive 6528
SuperHyperTrace-Decomposition; 6529

(iii) if ∀a ∈ S, |Ns (a) ∩ V \ S| = 0, then ESHG : (V, E) is an 2-SuperHyperDefensive 6530

SuperHyperTrace-Decomposition; 6531

(iv) if ∀a ∈ V \ S, |Ns (a) ∩ V \ S| = 0, then ESHG : (V, E) is a dual 2-SuperHyperDefensive 6532

SuperHyperTrace-Decomposition. 6533

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 CHAPTER 33 6534

Neutrosophic Applications in Cancer’s 6535

Neutrosophic Recognition 6536

The cancer is the Neutrosophic disease but the Neutrosophic model is going to figure out what’s 6537
going on this Neutrosophic phenomenon. The special Neutrosophic case of this Neutrosophic 6538
disease is considered and as the consequences of the model, some parameters are used. The cells 6539

are under attack of this disease but the moves of the cancer in the special region are the matter 6540
of mind. The Neutrosophic recognition of the cancer could help to find some Neutrosophic 6541
treatments for this Neutrosophic disease. 6542
In the following, some Neutrosophic steps are Neutrosophic devised on this disease. 6543

Step 1. (Neutrosophic Definition) The Neutrosophic recognition of the cancer in the long- 6544
term Neutrosophic function. 6545

Step 2. (Neutrosophic Issue) The specific region has been assigned by the Neutrosophic 6546

model [it’s called Neutrosophic SuperHyperGraph] and the long Neutrosophic cycle of the 6547
move from the cancer is identified by this research. Sometimes the move of the cancer 6548
hasn’t be easily identified since there are some determinacy, indeterminacy and neutrality 6549
about the moves and the effects of the cancer on that region; this event leads us to 6550
choose another model [it’s said to be Neutrosophic SuperHyperGraph] to have convenient 6551
perception on what’s happened and what’s done. 6552

Step 3. (Neutrosophic Model) There are some specific Neutrosophic models, which are well- 6553
known and they’ve got the names, and some general Neutrosophic models. The moves 6554
and the Neutrosophic traces of the cancer on the complex tracks and between complicated 6555
groups of cells could be fantasized by a Neutrosophic SuperHyperPath(-/SuperHyperTrace- 6556
Decomposition, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, Super- 6557

HyperWheel). The aim is to find either the Neutrosophic SuperHyperTrace-Decomposition 6558

or the Neutrosophic SuperHyperTrace-Decomposition in those Neutrosophic Neutrosophic 6559
SuperHyperModels. 6560

329
 CHAPTER 34 6561

Case 1: The Initial Neutrosophic Steps 6562

Toward Neutrosophic 6563

SuperHyperBipartite as Neutrosophic 6564

SuperHyperModel 6565

Step 4. (Neutrosophic Solution) In the Neutrosophic Figure (34.1), the Neutrosophic Super- 6566
HyperBipartite is Neutrosophic highlighted and Neutrosophic featured. 6567

Figure 34.1: a Neutrosophic SuperHyperBipartite Associated to the Notions of Neutrosophic

SuperHyperTrace-Decomposition 136NSHGaa21aa

331
 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- 6568
perBipartite is obtained. 6569
The obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous 6570
Neutrosophic result, of the Neutrosophic SuperHyperVertices of the connected Neut- 6571
rosophic SuperHyperBipartite ESHB : (V, E), in the Neutrosophic SuperHyperModel 6572

(34.1), is the Neutrosophic SuperHyperTrace-Decomposition. 6573

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 CHAPTER 35 6574

Case 2: The Increasing Neutrosophic 6575

Steps Toward Neutrosophic 6576

SuperHyperMultipartite as 6577

Neutrosophic SuperHyperModel 6578

Step 4. (Neutrosophic Solution) In the Neutrosophic Figure (35.1), the Neutrosophic Super- 6579
HyperMultipartite is Neutrosophic highlighted and Neutrosophic featured. 6580

By using the Neutrosophic Figure (35.1) and the Table (35.1), the Neutrosophic SuperHy- 6581
perMultipartite is obtained. 6582
The obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous 6583

Figure 35.1: a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic

SuperHyperTrace-Decomposition 136NSHGaa22aa

333
 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- 6584

perMultipartite ESHM : (V, E), in the Neutrosophic SuperHyperModel (35.1), is the 6585
Neutrosophic SuperHyperTrace-Decomposition. 6586

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 CHAPTER 36 6587

Wondering Open Problems But As The 6588

Directions To Forming The Motivations 6589

In what follows, some “problems” and some “questions” are proposed. 6590
The SuperHyperTrace-Decomposition and the Neutrosophic SuperHyperTrace-Decomposition 6591
are defined on a real-world application, titled “Cancer’s Recognitions”. 6592

Question 36.0.1. Which the else SuperHyperModels could be defined based on Cancer’s 6593
recognitions? 6594

Question 36.0.2. Are there some SuperHyperNotions related to SuperHyperTrace-Decomposition 6595

and the Neutrosophic SuperHyperTrace-Decomposition? 6596

Question 36.0.3. Are there some Algorithms to be defined on the SuperHyperModels to compute 6597
them? 6598

Question 36.0.4. Which the SuperHyperNotions are related to beyond the SuperHyperTrace- 6599
Decomposition and the Neutrosophic SuperHyperTrace-Decomposition? 6600

Problem 36.0.5. The SuperHyperTrace-Decomposition and the Neutrosophic SuperHyperTrace- 6601

Decomposition do a SuperHyperModel for the Cancer’s recognitions and they’re based on 6602
SuperHyperTrace-Decomposition, are there else? 6603

Problem 36.0.6. Which the fundamental SuperHyperNumbers are related to these SuperHyper- 6604
Numbers types-results? 6605

Problem 36.0.7. What’s the independent research based on Cancer’s recognitions concerning 6606
the multiple types of SuperHyperNotions? 6607

335
 CHAPTER 37 6608

Conclusion and Closing Remarks 6609

In this section, concluding remarks and closing remarks are represented. The drawbacks of this 6610

research are illustrated. Some benefits and some advantages of this research are highlighted. 6611
This research uses some approaches to make Neutrosophic SuperHyperGraphs more under- 6612
standable. In this endeavor, two SuperHyperNotions are defined on the SuperHyperTrace- 6613
Decomposition. For that sake in the second definition, the main definition of the Neutro- 6614
sophic SuperHyperGraph is redefined on the position of the alphabets. Based on the new 6615
definition for the Neutrosophic SuperHyperGraph, the new SuperHyperNotion, Neutrosophic 6616

SuperHyperTrace-Decomposition, finds the convenient background to implement some results 6617

based on that. Some SuperHyperClasses and some Neutrosophic SuperHyperClasses are the 6618
cases of this research on the modeling of the regions where are under the attacks of the cancer 6619
to recognize this disease as it’s mentioned on the title “Cancer’s Recognitions”. To formalize the 6620
instances on the SuperHyperNotion, SuperHyperTrace-Decomposition, the new SuperHyper- 6621
Classes and SuperHyperClasses, are introduced. Some general results are gathered in the section 6622

on the SuperHyperTrace-Decomposition and the Neutrosophic SuperHyperTrace-Decomposition. 6623

The clarifications, instances and literature reviews have taken the whole way through. In this 6624
research, the literature reviews have fulfilled the lines containing the notions and the results. 6625
The SuperHyperGraph and Neutrosophic SuperHyperGraph are the SuperHyperModels on the 6626
“Cancer’s Recognitions” and both bases are the background of this research. Sometimes the 6627
cancer has been happened on the region, full of cells, groups of cells and embedded styles. In this 6628

segment, the SuperHyperModel proposes some SuperHyperNotions based on the connectivities 6629
of the moves of the cancer in the longest and strongest styles with the formation of the design 6630
and the architecture are formally called “ SuperHyperTrace-Decomposition” in the themes of 6631
jargons and buzzwords. The prefix “SuperHyper” refers to the theme of the embedded styles to 6632
figure out the background for the SuperHyperNotions. In the Table (37.1), benefits and avenues 6633
for this research are, figured out, pointed out and spoken out. 6634

337
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. SuperHyperTrace-Decomposition

3. Neutrosophic SuperHyperTrace-Decomposition 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 6635

Neutrosophic SuperHyperDuality But As 6636

The Extensions Excerpt From Dense And 6637

Super Forms 6638

Definition 38.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperDuality). 6639

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider a 6640

Neutrosophic SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and E 0 = {E1 , E2 , . . . , Ez }. Then either V 0 6641
or E 0 is called 6642

(i) Neutrosophic e-SuperHyperDuality if ∀Ei ∈ E 0 , ∃Ej ∈ EESHG:(V,E) \ E 0 such that 6643

Va ∈ Ei , Ej ; 6644

(ii) Neutrosophic re-SuperHyperDuality if ∀Ei ∈ E 0 , ∃Ej ∈ EESHG:(V,E) \ E 0 such that 6645

Va ∈ Ei , Ej and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 6646

(iii) Neutrosophic v-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 6647

Vi , Vj ∈ Ea ; 6648

(iv) Neutrosophic rv-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 6649

Vi , Vj ∈ Ea and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; 6650

(v) Neutrosophic SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 6651

Neutrosophic re-SuperHyperDuality, Neutrosophic v-SuperHyperDuality, and Neutro- 6652

sophic rv-SuperHyperDuality. 6653

Definition 38.0.2. ((Neutrosophic) SuperHyperDuality). 6654

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider a 6655

Neutrosophic SuperHyperEdge (NSHE) E = {V1 , V2 , . . . , Vs }. Then E is called 6656

(i) an Extreme SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 6657

Neutrosophic re-SuperHyperDuality, Neutrosophic v-SuperHyperDuality, and Neutro- 6658
sophic rv-SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : 6659
(V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high 6660
Extreme cardinality of the Extreme SuperHyperEdges in the conseNeighborive Extreme 6661
sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 6662

form the Extreme SuperHyperDuality; 6663

339
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, 6664

Neutrosophic re-SuperHyperDuality, Neutrosophic v-SuperHyperDuality, and Neutro- 6665
sophic rv-SuperHyperDuality and C(N SHG) for a Neutrosophic SuperHyperGraph 6666
N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic Su- 6667
perHyperEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 6668
conseNeighborive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices 6669

such that they form the Neutrosophic SuperHyperDuality; 6670

(iii) an Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of Neut- 6671

rosophic e-SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic v- 6672

SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for an Ex- 6673
treme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains 6674
the Extreme coefficients defined as the Extreme number of the maximum Extreme cardin- 6675
ality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme 6676
cardinality conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVer- 6677

tices such that they form the Extreme SuperHyperDuality; and the Extreme power is 6678
corresponded to its Extreme coefficient; 6679

(iv) a Neutrosophic SuperHyperDuality SuperHyperPolynomial if it’s either of Neut- 6680

rosophic e-SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic v- 6681

SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for a Neut- 6682
rosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 6683
contains the Neutrosophic coefficients defined as the Neutrosophic number of the max- 6684
imum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic 6685
SuperHyperSet S of high Neutrosophic cardinality conseNeighborive Neutrosophic Super- 6686

HyperEdges and Neutrosophic SuperHyperVertices such that they form the Neutrosophic 6687
SuperHyperDuality; and the Neutrosophic power is corresponded to its Neutrosophic 6688
coefficient; 6689

(v) an Extreme R-SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 6690

Neutrosophic re-SuperHyperDuality, Neutrosophic v-SuperHyperDuality, and Neutro- 6691
sophic rv-SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : 6692
(V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high 6693
Extreme cardinality of the Extreme SuperHyperVertices in the conseNeighborive Extreme 6694

sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 6695
form the Extreme SuperHyperDuality; 6696

(vi) a Neutrosophic R-SuperHyperDuality if it’s either of Neutrosophic e- 6697

SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic v-SuperHyperDuality,6698
and Neutrosophic rv-SuperHyperDuality and C(N SHG) for a Neutrosophic SuperHyper- 6699
Graph N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic 6700
SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 6701
conseNeighborive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices 6702
such that they form the Neutrosophic SuperHyperDuality; 6703

(vii) an Extreme R-SuperHyperDuality SuperHyperPolynomial if it’s either of 6704

Neutrosophic e-SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic 6705

v-SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for an 6706

Henry Garrett · 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 6707

contains the Extreme coefficients defined as the Extreme number of the maximum 6708
Extreme cardinality of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S 6709
of high Extreme cardinality conseNeighborive Extreme SuperHyperEdges and Extreme 6710
SuperHyperVertices such that they form the Extreme SuperHyperDuality; and the Extreme 6711
power is corresponded to its Extreme coefficient; 6712

(viii) a Neutrosophic SuperHyperDuality SuperHyperPolynomial if it’s either of Neut- 6713

rosophic e-SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic v- 6714
SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for a Neut- 6715

rosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 6716

contains the Neutrosophic coefficients defined as the Neutrosophic number of the max- 6717
imum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic 6718
SuperHyperSet S of high Neutrosophic cardinality conseNeighborive Neutrosophic Super- 6719
HyperEdges and Neutrosophic SuperHyperVertices such that they form the Neutrosophic 6720
SuperHyperDuality; and the Neutrosophic power is corresponded to its Neutrosophic 6721

coefficient. 6722

136EXM1 Example 38.0.3. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E) in 6723
the mentioned Neutrosophic Figures in every Neutrosophic items. 6724

• On the Figure (30.1), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 6725

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 6726

E1 and E3 are some empty Extreme SuperHyperEdges but E2 is a loop Neutrosophic 6727
SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of 6728
Neutrosophic SuperHyperNeighbor, there’s only one Neutrosophic SuperHyperEdge, 6729
namely, E4 . The Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means 6730
that there’s no Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. 6731
Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in every given Neutrosophic 6732

SuperHyperDuality. 6733

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 6734

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 6735
E1 , E2 and E3 are some empty Neutrosophic SuperHyperEdges but E4 is a Neutrosophic 6736
SuperHyperEdge. Thus in the terms of Neutrosophic SuperHyperNeighbor, there’s only 6737
one Neutrosophic SuperHyperEdge, namely, E4 . The Neutrosophic SuperHyperVertex, V3 6738
is Neutrosophic isolated means that there’s no Neutrosophic SuperHyperEdge has it as 6739

a Neutrosophic endpoint. Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in 6740

Henry Garrett · 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. 6741

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 6742

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 6743

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 6744

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 6745

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 6746

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 6747

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 6748

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 6749

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 6750

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 6751

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 6752

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 6753

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 6754

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 6755

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 6756

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 6757

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 6758

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 6759

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 6760

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 6761

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 6762

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 6763

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 6764

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 6765

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 6766

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 6767

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 6768

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 6769

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 6770

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 6771

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 6772

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 6773

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 6774

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 6775

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 6776

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 6777

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 6778

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 6779

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 6780

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 6781

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 6782
Neutrosophic SuperHyperClasses. 6783

Proposition 38.0.4. Assume a connected Neutrosophic SuperHyperPath ESHP : (V, E). Then 6784

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 6785

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). 6786

There’s a new way to redefine as 6787

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 6788

ViEXT ERN AL in the literatures of SuperHyperDuality. The latter is straightforward.  6789

Henry Garrett · 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 : 6790
(V, E), is highlighted and featured. The Neutrosophic SuperHyperSet, in the Neutrosophic 6791
SuperHyperModel (31.1), is the SuperHyperDuality. 6792

Proposition 38.0.6. Assume a connected Neutrosophic SuperHyperCycle ESHC : (V, E). Then 6793

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 6794

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). 6795
There’s a new way to redefine as 6796

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 6797
ViEXT ERN AL in the literatures of SuperHyperDuality. The latter is straightforward.  6798

136EXM19a Example 38.0.7. In the Figure (31.2), the connected Neutrosophic SuperHyperCycle N SHC : 6799

(V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, in the 6800
Neutrosophic SuperHyperModel (31.2), is the Neutrosophic SuperHyperDuality. 6801

Proposition 38.0.8. Assume a connected Neutrosophic SuperHyperStar ESHS : (V, E). Then 6802

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 6803

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 6804

new way to redefine as 6805

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 6806
ViEXT ERN AL in the literatures of SuperHyperDuality. The latter is straightforward.  6807

136EXM20a Example 38.0.9. In the Figure (31.3), the connected Neutrosophic SuperHyperStar ESHS : 6808
(V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, by the Algorithm 6809

in previous Neutrosophic result, of the Neutrosophic SuperHyperVertices of the connected 6810

Neutrosophic SuperHyperStar ESHS : (V, E), in the Neutrosophic SuperHyperModel (31.3), is 6811
the Neutrosophic SuperHyperDuality. 6812

Proposition 38.0.10. Assume a connected Neutrosophic SuperHyperBipartite ESHB : (V, E). 6813
Then 6814

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 6815

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). 6816
There’s a new way to redefine as 6817

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 6818
to ViEXT ERN AL in the literatures of SuperHyperDuality. The latter is straightforward. 6819

Then there’s at least one SuperHyperDuality. Thus the notion of quasi isn’t up and the 6820
SuperHyperNotions based on SuperHyperDuality could be applied. There are only two 6821
SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as the 6822
representative in the 6823

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 6824

ESHB : (V, E). Thus only some SuperHyperVertices and only minimum-Neutrosophic-of- 6825
SuperHyperPart SuperHyperEdges are attained in any solution 6826

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.  6827

136EXM21a Example 38.0.11. In the Neutrosophic Figure (31.4), the connected Neutrosophic SuperHy- 6828

perBipartite ESHB : (V, E), is Neutrosophic highlighted and Neutrosophic featured. The 6829
obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous Neutrosophic 6830
result, of the Neutrosophic SuperHyperVertices of the connected Neutrosophic SuperHyper- 6831
Bipartite ESHB : (V, E), in the Neutrosophic SuperHyperModel (31.4), is the Neutrosophic 6832
SuperHyperDuality. 6833

Proposition 38.0.12. Assume a connected Neutrosophic SuperHyperMultipartite ESHM : 6834

Henry Garrett · 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 6835

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 6836

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 6837

ESHM : (V, E). There’s a new way to redefine as 6838

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 6839
to ViEXT ERN AL in the literatures of SuperHyperDuality. The latter is straightforward. 6840
Then there’s at least one SuperHyperDuality. Thus the notion of quasi isn’t up and 6841
the SuperHyperNotions based on SuperHyperDuality could be applied. There are only z 0 6842
SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as the 6843

representative in the 6844

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). 6845
Thus only some SuperHyperVertices and only minimum-Neutrosophic-of-SuperHyperPart 6846
SuperHyperEdges are attained in any solution 6847

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). 6848
The latter is straightforward.  6849

136EXM22a Example 38.0.13. In the Figure (31.5), the connected Neutrosophic SuperHyperMultipartite 6850
ESHM : (V, E), is highlighted and Neutrosophic featured. The obtained Neutrosophic 6851

SuperHyperSet, by the Algorithm in previous Neutrosophic result, of the Neutrosophic 6852

SuperHyperVertices of the connected Neutrosophic SuperHyperMultipartite ESHM : (V, E), 6853
in the Neutrosophic SuperHyperModel (31.5), is the Neutrosophic SuperHyperDuality. 6854

Proposition 38.0.14. Assume a connected Neutrosophic SuperHyperWheel ESHW : (V, E). 6855
Then, 6856

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 6857

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 6858

ESHW : (V, E). There’s a new way to redefine as 6859

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 6860

to ViEXT ERN AL in the literatures of SuperHyperDuality. The latter is straightforward. 6861

Henry Garrett · 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 6862
SuperHyperNotions based on SuperHyperDuality could be applied. The unique embedded 6863
SuperHyperDuality proposes some longest SuperHyperDuality excerpt from some representatives. 6864
The latter is straightforward.  6865

136EXM23a Example 38.0.15. In the Neutrosophic Figure (31.6), the connected Neutrosophic SuperHyper- 6866
Wheel N SHW : (V, E), is Neutrosophic highlighted and featured. The obtained Neutrosophic 6867
SuperHyperSet, by the Algorithm in previous result, of the Neutrosophic SuperHyperVer- 6868
tices of the connected Neutrosophic SuperHyperWheel ESHW : (V, E), in the Neutrosophic 6869

SuperHyperModel (31.6), is the Neutrosophic SuperHyperDuality. 6870

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 CHAPTER 39 6871

Neutrosophic SuperHyperJoin But As 6872

The Extensions Excerpt From Dense And 6873

Super Forms 6874

Definition 39.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperJoin). 6875

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider a 6876
Neutrosophic SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and E 0 = {E1 , E2 , . . . , Ez }. Then either V 0 6877
or E 0 is called 6878

(i) Neutrosophic e-SuperHyperJoin if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such that 6879

Va ∈ Ei , Ej ; and ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; 6880

(ii) Neutrosophic re-SuperHyperJoin if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such that 6881

Va ∈ Ei , Ej ; ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; and |Ei |NEUTROSOPIC CARDINALITY = 6882
|Ej |NEUTROSOPIC CARDINALITY ; 6883

(iii) Neutrosophic v-SuperHyperJoin if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such that 6884

Vi , Vj 6∈ Ea ; and ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; 6885

(iv) Neutrosophic rv-SuperHyperJoin if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such that 6886

Vi , Vj ∈ Ea ; ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; and |Vi |NEUTROSOPIC CARDINALITY = 6887
|Vj |NEUTROSOPIC CARDINALITY ; 6888

(v) Neutrosophic SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 6889

Neutrosophic re-SuperHyperJoin, Neutrosophic v-SuperHyperJoin, and Neutrosophic 6890
rv-SuperHyperJoin. 6891

Definition 39.0.2. ((Neutrosophic) SuperHyperJoin). 6892

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider a 6893
Neutrosophic SuperHyperEdge (NSHE) E = {V1 , V2 , . . . , Vs }. Then E is called 6894

(i) an Extreme SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 6895

Neutrosophic re-SuperHyperJoin, Neutrosophic v-SuperHyperJoin, and Neutrosophic 6896
rv-SuperHyperJoin and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 6897

is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Extreme 6898

353
Henry Garrett · Independent Researcher · Department of Mathematics ·
DrHenryGarrett@gmail.com · Manhattan, NY, USA

cardinality of the Extreme SuperHyperEdges in the conseNeighborive Extreme sequence 6899

of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 6900
Extreme SuperHyperJoin; 6901

(ii) a Neutrosophic SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 6902

Neutrosophic re-SuperHyperJoin, Neutrosophic v-SuperHyperJoin, and Neutrosophic 6903
rv-SuperHyperJoin and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 6904
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of 6905
a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality conseNeighborive 6906

Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they 6907

form the Neutrosophic SuperHyperJoin; 6908

(iii) an Extreme SuperHyperJoin SuperHyperPolynomial if it’s either of Neutrosophic 6909

e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic v-SuperHyperJoin, 6910
and Neutrosophic rv-SuperHyperJoin and C(N SHG) for an Extreme SuperHyperGraph 6911
N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients 6912
defined as the Extreme number of the maximum Extreme cardinality of the Extreme 6913
SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme cardinality conseNeigh- 6914

borive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form 6915
the Extreme SuperHyperJoin; and the Extreme power is corresponded to its Extreme 6916
coefficient; 6917

(iv) a Neutrosophic SuperHyperJoin SuperHyperPolynomial if it’s either of 6918

Neutrosophic e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic v- 6919
SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for a Neutrosophic 6920
SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains 6921
the Neutrosophic coefficients defined as the Neutrosophic number of the maximum Neutro- 6922
sophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet 6923

S of high Neutrosophic cardinality conseNeighborive Neutrosophic SuperHyperEdges and 6924

Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperJoin; 6925
and the Neutrosophic power is corresponded to its Neutrosophic coefficient; 6926

(v) an Extreme R-SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 6927

Neutrosophic re-SuperHyperJoin, Neutrosophic v-SuperHyperJoin, and Neutrosophic 6928
rv-SuperHyperJoin and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 6929
is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Extreme 6930
cardinality of the Extreme SuperHyperVertices in the conseNeighborive Extreme sequence 6931

of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 6932
Extreme SuperHyperJoin; 6933

(vi) a Neutrosophic R-SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 6934

Neutrosophic re-SuperHyperJoin, Neutrosophic v-SuperHyperJoin, and Neutrosophic 6935
rv-SuperHyperJoin and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 6936
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of 6937
a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality conseNeighborive 6938
Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they 6939

form the Neutrosophic SuperHyperJoin; 6940

Henry Garrett · 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 6941

Neutrosophic e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic v- 6942
SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for an Extreme 6943
SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the 6944
Extreme coefficients defined as the Extreme number of the maximum Extreme cardinality 6945
of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme 6946

cardinality conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVertices 6947

such that they form the Extreme SuperHyperJoin; and the Extreme power is corresponded 6948
to its Extreme coefficient; 6949

(viii) a Neutrosophic SuperHyperJoin SuperHyperPolynomial if it’s either of 6950

Neutrosophic e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic v- 6951
SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for a Neutrosophic 6952

SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains 6953

the Neutrosophic coefficients defined as the Neutrosophic number of the maximum 6954
Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic 6955
SuperHyperSet S of high Neutrosophic cardinality conseNeighborive Neutrosophic Super- 6956
HyperEdges and Neutrosophic SuperHyperVertices such that they form the Neutrosophic 6957
SuperHyperJoin; and the Neutrosophic power is corresponded to its Neutrosophic 6958

coefficient. 6959

136EXM1 Example 39.0.3. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E) in 6960

the mentioned Neutrosophic Figures in every Neutrosophic items. 6961

• On the Figure (30.1), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 6962

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 6963

E1 and E3 are some empty Neutrosophic SuperHyperEdges but E2 is a loop Neutrosophic 6964
SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of 6965
Neutrosophic SuperHyperNeighbor, there’s only one Neutrosophic SuperHyperEdge, 6966
namely, E4 . The Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means 6967
that there’s no Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. 6968

Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in every given Neutrosophic 6969

SuperHyperJoin. 6970

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 6971

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 6972
E1 , E2 and E3 are some empty Neutrosophic SuperHyperEdges but E4 is a Neutrosophic 6973
SuperHyperEdge. Thus in the terms of Neutrosophic SuperHyperNeighbor, there’s only 6974
one Neutrosophic SuperHyperEdge, namely, E4 . The Neutrosophic SuperHyperVertex, V3 6975
is Neutrosophic isolated means that there’s no Neutrosophic SuperHyperEdge has it as 6976

a Neutrosophic endpoint. Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in 6977

Henry Garrett · 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. 6978

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 6979

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 6980

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 6981

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 6982

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 6983

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 6984

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 6985

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 6986

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 6987

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 6988

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 6989

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 6990

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 6991

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 6992

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 6993

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 6994

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 6995

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 6996

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 6997

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 6998

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 6999

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7000

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 7001

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7002

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 7003

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7004

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 7005

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7006

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 7007

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7008

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 7009

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7010

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 7011

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7012

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 7013

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7014

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 7015

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7016

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 7017

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7018

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 7019
Neutrosophic SuperHyperClasses. 7020

Proposition 39.0.4. Assume a connected Neutrosophic SuperHyperPath ESHP : (V, E). Then 7021

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 7022

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). 7023

There’s a new way to redefine as 7024

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 7025

ViEXT ERN AL in the literatures of SuperHyperJoin. The latter is straightforward.  7026

Henry Garrett · 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 : 7027
(V, E), is highlighted and featured. The Neutrosophic SuperHyperSet, in the Neutrosophic 7028
SuperHyperModel (31.1), is the SuperHyperJoin. 7029

Proposition 39.0.6. Assume a connected Neutrosophic SuperHyperCycle ESHC : (V, E). Then 7030

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 7031

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). 7032
There’s a new way to redefine as 7033

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 7034
ViEXT ERN AL in the literatures of SuperHyperJoin. The latter is straightforward.  7035

136EXM19a Example 39.0.7. In the Figure (31.2), the connected Neutrosophic SuperHyperCycle N SHC : 7036

(V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, in the 7037
Neutrosophic SuperHyperModel (31.2), is the Neutrosophic SuperHyperJoin. 7038

Proposition 39.0.8. Assume a connected Neutrosophic SuperHyperStar ESHS : (V, E). Then 7039

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 7040

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 7041

new way to redefine as 7042

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 7043
ViEXT ERN AL in the literatures of SuperHyperJoin. The latter is straightforward.  7044

136EXM20a Example 39.0.9. In the Figure (31.3), the connected Neutrosophic SuperHyperStar ESHS : 7045
(V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, by the Algorithm 7046

in previous Neutrosophic result, of the Neutrosophic SuperHyperVertices of the connected 7047

Neutrosophic SuperHyperStar ESHS : (V, E), in the Neutrosophic SuperHyperModel (31.3), is 7048
the Neutrosophic SuperHyperJoin. 7049

Proposition 39.0.10. Assume a connected Neutrosophic SuperHyperBipartite ESHB : (V, E). 7050
Then 7051

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 7052

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). 7053
There’s a new way to redefine as 7054

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 7055

ViEXT ERN AL in the literatures of SuperHyperJoin. The latter is straightforward. Then there’s 7056
no at least one SuperHyperJoin. Thus the notion of quasi may be up but the SuperHyperNotions 7057
based on SuperHyperJoin could be applied. There are only two SuperHyperParts. Thus every 7058
SuperHyperPart could have one SuperHyperVertex as the representative in the 7059

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 7060

ESHB : (V, E). Thus only some SuperHyperVertices and only minimum-Neutrosophic-of- 7061
SuperHyperPart SuperHyperEdges are attained in any solution 7062

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.  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

136EXM21a Example 39.0.11. In the Neutrosophic Figure (31.4), the connected Neutrosophic SuperHy- 7064
perBipartite ESHB : (V, E), is Neutrosophic highlighted and Neutrosophic featured. The 7065
obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous Neutrosophic 7066
result, of the Neutrosophic SuperHyperVertices of the connected Neutrosophic SuperHyper- 7067
Bipartite ESHB : (V, E), in the Neutrosophic SuperHyperModel (31.4), is the Neutrosophic 7068
SuperHyperJoin. 7069

Proposition 39.0.12. Assume a connected Neutrosophic SuperHyperMultipartite ESHM : 7070

(V, E). Then 7071

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 7072

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 7073

ESHM : (V, E). There’s a new way to redefine as 7074

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 7075
ViEXT ERN AL in the literatures of SuperHyperJoin. The latter is straightforward. Then there’s 7076
no at least one SuperHyperJoin. Thus the notion of quasi may be up but the SuperHyperNotions 7077

based on SuperHyperJoin could be applied. There are only z 0 SuperHyperParts. Thus every 7078
SuperHyperPart could have one SuperHyperVertex as the representative in the 7079

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). 7080
Thus only some SuperHyperVertices and only minimum-Neutrosophic-of-SuperHyperPart 7081
SuperHyperEdges are attained in any solution 7082

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). 7083
The latter is straightforward.  7084

136EXM22a Example 39.0.13. In the Figure (31.5), the connected Neutrosophic SuperHyperMultipartite 7085
ESHM : (V, E), is highlighted and Neutrosophic featured. The obtained Neutrosophic 7086
SuperHyperSet, by the Algorithm in previous Neutrosophic result, of the Neutrosophic 7087

SuperHyperVertices of the connected Neutrosophic SuperHyperMultipartite ESHM : (V, E), 7088

in the Neutrosophic SuperHyperModel (31.5), is the Neutrosophic SuperHyperJoin. 7089

Proposition 39.0.14. Assume a connected Neutrosophic SuperHyperWheel ESHW : (V, E). 7090

Henry Garrett · 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, 7091

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 7092

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 : 7093

(V, E). There’s a new way to redefine as 7094

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 7095

ViEXT ERN AL in the literatures of SuperHyperJoin. The latter is straightforward. Then there’s 7096
at least one SuperHyperJoin. Thus the notion of quasi isn’t up and the SuperHyperNotions based 7097
on SuperHyperJoin could be applied. The unique embedded SuperHyperJoin proposes some 7098
longest SuperHyperJoin excerpt from some representatives. The latter is straightforward.  7099

136EXM23a Example 39.0.15. In the Neutrosophic Figure (31.6), the connected Neutrosophic SuperHyper- 7100
Wheel N SHW : (V, E), is Neutrosophic highlighted and featured. The obtained Neutrosophic 7101
SuperHyperSet, by the Algorithm in previous result, of the Neutrosophic SuperHyperVer- 7102
tices of the connected Neutrosophic SuperHyperWheel ESHW : (V, E), in the Neutrosophic 7103
SuperHyperModel (31.6), is the Neutrosophic SuperHyperJoin. 7104

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 CHAPTER 40 7105

Neutrosophic SuperHyperPerfect But As 7106

The Extensions Excerpt From Dense And 7107

Super Forms 7108

Definition 40.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperPerfect). 7109

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider a 7110

Neutrosophic SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and E 0 = {E1 , E2 , . . . , Ez }. Then either V 0 7111
or E 0 is called 7112

(i) Neutrosophic e-SuperHyperPerfect if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃!Ej ∈ E 0 , such that 7113

Va ∈ Ei , Ej ; 7114

(ii) Neutrosophic re-SuperHyperPerfect if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃!Ej ∈ E 0 , such 7115

that Va ∈ Ei , Ej ; and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 7116

(iii) Neutrosophic v-SuperHyperPerfect if ∀Vi ∈ VESHG:(V,E) \ V 0 , ∃!Vj ∈ V 0 , such that 7117

Vi , Vj ∈ Ea ; 7118

(iv) Neutrosophic rv-SuperHyperPerfect if ∀Vi ∈ VESHG:(V,E) \ V 0 , ∃!Vj ∈ V 0 , such that 7119

Vi , Vj ∈ Ea ; and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; 7120

(v) Neutrosophic SuperHyperPerfect if it’s either of Neutrosophic e-SuperHyperPerfect, 7121

Neutrosophic re-SuperHyperPerfect, Neutrosophic v-SuperHyperPerfect, and Neutrosophic 7122

rv-SuperHyperPerfect. 7123

Definition 40.0.2. ((Neutrosophic) SuperHyperPerfect). 7124

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider a 7125

Neutrosophic SuperHyperEdge (NSHE) E = {V1 , V2 , . . . , Vs }. Then E is called 7126

(i) an Extreme SuperHyperPerfect if it’s either of Neutrosophic e-SuperHyperPerfect, 7127

Neutrosophic re-SuperHyperPerfect, Neutrosophic v-SuperHyperPerfect, and Neutrosophic 7128
rv-SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 7129
is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Extreme 7130
cardinality of the Extreme SuperHyperEdges in the conseNeighborive Extreme sequence 7131
of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 7132

Extreme SuperHyperPerfect; 7133

367
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, 7134

Neutrosophic re-SuperHyperPerfect, Neutrosophic v-SuperHyperPerfect, and Neutrosophic 7135
rv-SuperHyperPerfect and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : 7136
(V, E) is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges 7137
of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality conseNeighborive 7138
Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they 7139

form the Neutrosophic SuperHyperPerfect; 7140

(iii) an Extreme SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7141

rosophic e-SuperHyperPerfect, Neutrosophic re-SuperHyperPerfect, Neutrosophic v- 7142

SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for an Ex- 7143
treme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains 7144
the Extreme coefficients defined as the Extreme number of the maximum Extreme cardin- 7145
ality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme 7146
cardinality conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVer- 7147

tices such that they form the Extreme SuperHyperPerfect; and the Extreme power is 7148
corresponded to its Extreme coefficient; 7149

(iv) a Neutrosophic SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7150

rosophic e-SuperHyperPerfect, Neutrosophic re-SuperHyperPerfect, Neutrosophic v- 7151

SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for a Neut- 7152
rosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 7153
contains the Neutrosophic coefficients defined as the Neutrosophic number of the max- 7154
imum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic 7155
SuperHyperSet S of high Neutrosophic cardinality conseNeighborive Neutrosophic Super- 7156

HyperEdges and Neutrosophic SuperHyperVertices such that they form the Neutrosophic 7157
SuperHyperPerfect; and the Neutrosophic power is corresponded to its Neutrosophic 7158
coefficient; 7159

(v) an Extreme R-SuperHyperPerfect if it’s either of Neutrosophic e-SuperHyperPerfect, 7160

Neutrosophic re-SuperHyperPerfect, Neutrosophic v-SuperHyperPerfect, and Neutrosophic 7161
rv-SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 7162
is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Extreme 7163
cardinality of the Extreme SuperHyperVertices in the conseNeighborive Extreme sequence 7164
of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 7165

Extreme SuperHyperPerfect; 7166

(vi) a Neutrosophic R-SuperHyperPerfect if it’s either of Neutrosophic e- 7167

SuperHyperPerfect, Neutrosophic re-SuperHyperPerfect, Neutrosophic v-SuperHyperPerfect,7168
and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for a Neutrosophic SuperHyper- 7169
Graph N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic 7170
SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 7171
conseNeighborive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices 7172
such that they form the Neutrosophic SuperHyperPerfect; 7173

(vii) an Extreme R-SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7174

rosophic e-SuperHyperPerfect, Neutrosophic re-SuperHyperPerfect, Neutrosophic v- 7175
SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for an Ex- 7176

treme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains 7177

Henry Garrett · 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- 7178
ality of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme 7179
cardinality conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVer- 7180
tices such that they form the Extreme SuperHyperPerfect; and the Extreme power is 7181
corresponded to its Extreme coefficient; 7182

(viii) a Neutrosophic SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7183

rosophic e-SuperHyperPerfect, Neutrosophic re-SuperHyperPerfect, Neutrosophic v- 7184
SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for a Neut- 7185
rosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 7186
contains the Neutrosophic coefficients defined as the Neutrosophic number of the max- 7187

imum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic 7188

SuperHyperSet S of high Neutrosophic cardinality conseNeighborive Neutrosophic Super- 7189
HyperEdges and Neutrosophic SuperHyperVertices such that they form the Neutrosophic 7190
SuperHyperPerfect; and the Neutrosophic power is corresponded to its Neutrosophic 7191
coefficient. 7192

136EXM1 Example 40.0.3. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E) in 7193
the mentioned Neutrosophic Figures in every Neutrosophic items. 7194

• On the Figure (30.1), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 7195

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7196
E1 and E3 are some empty Neutrosophic SuperHyperEdges but E2 is a loop Neutrosophic 7197
SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of 7198
Neutrosophic SuperHyperNeighbor, there’s only one Neutrosophic SuperHyperEdge, 7199

namely, E4 . The Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means 7200

that there’s no Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. 7201
Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in every given Neutrosophic 7202
SuperHyperPerfect. 7203

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 7204

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7205
E1 , E2 and E3 are some empty Neutrosophic SuperHyperEdges but E4 is a Neutrosophic 7206

SuperHyperEdge. Thus in the terms of Neutrosophic SuperHyperNeighbor, there’s only 7207

one Neutrosophic SuperHyperEdge, namely, E4 . The Neutrosophic SuperHyperVertex, V3 7208
is Neutrosophic isolated means that there’s no Neutrosophic SuperHyperEdge has it as 7209
a Neutrosophic endpoint. Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in 7210
every given Neutrosophic SuperHyperPerfect. 7211

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 7212

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7213

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 7214

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7215

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 7216

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7217

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 7218

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7219

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 7220

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7221

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 7222

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7223

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 7224

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7225

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 7226

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7227

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 7228

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7229

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 7230

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7231

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 7232

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7233

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 7234

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7235

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 7236

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7237

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 7238

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7239

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 7240

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7241

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 7242

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7243

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 7244

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7245

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 7246

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7247

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 7248

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7249

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 7250

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7251

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 7252

Neutrosophic SuperHyperClasses. 7253

Henry Garrett · 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 7254

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 7255

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). 7256
There’s a new way to redefine as 7257

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 7258
ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is straightforward.  7259

136EXM18a Example 40.0.5. In the Figure (31.1), the connected Neutrosophic SuperHyperPath ESHP : 7260
(V, E), is highlighted and featured. The Neutrosophic SuperHyperSet, in the Neutrosophic 7261
SuperHyperModel (31.1), is the SuperHyperPerfect. 7262

Proposition 40.0.6. Assume a connected Neutrosophic SuperHyperCycle ESHC : (V, E). Then 7263

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 7264

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). 7265

There’s a new way to redefine as 7266

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 7267
ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is straightforward.  7268

136EXM19a Example 40.0.7. In the Figure (31.2), the connected Neutrosophic SuperHyperCycle N SHC : 7269
(V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, in the 7270
Neutrosophic SuperHyperModel (31.2), is the Neutrosophic SuperHyperPerfect. 7271

Proposition 40.0.8. Assume a connected Neutrosophic SuperHyperStar ESHS : (V, E). Then 7272

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 7273

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 7274
new way to redefine as 7275

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 7276

ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is straightforward.  7277

Henry Garrett · 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 : 7278
(V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, by the Algorithm 7279
in previous Neutrosophic result, of the Neutrosophic SuperHyperVertices of the connected 7280
Neutrosophic SuperHyperStar ESHS : (V, E), in the Neutrosophic SuperHyperModel (31.3), is 7281
the Neutrosophic SuperHyperPerfect. 7282

Proposition 40.0.10. Assume a connected Neutrosophic SuperHyperBipartite ESHB : (V, E). 7283
Then 7284

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 7285

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). 7286
There’s a new way to redefine as 7287

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 7288
ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is straightforward. Then 7289

there’s no at least one SuperHyperPerfect. Thus the notion of quasi may be up but the 7290
SuperHyperNotions based on SuperHyperPerfect could be applied. There are only two 7291
SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as the 7292
representative in the 7293

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 7294

ESHB : (V, E). Thus only some SuperHyperVertices and only minimum-Neutrosophic-of- 7295
SuperHyperPart SuperHyperEdges are attained in any solution 7296

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.  7297

136EXM21a Example 40.0.11. In the Neutrosophic Figure (31.4), the connected Neutrosophic SuperHy- 7298

perBipartite ESHB : (V, E), is Neutrosophic highlighted and Neutrosophic featured. The 7299
obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous Neutrosophic 7300
result, of the Neutrosophic SuperHyperVertices of the connected Neutrosophic SuperHyper- 7301
Bipartite ESHB : (V, E), in the Neutrosophic SuperHyperModel (31.4), is the Neutrosophic 7302
SuperHyperPerfect. 7303

Proposition 40.0.12. Assume a connected Neutrosophic SuperHyperMultipartite ESHM : 7304

Henry Garrett · 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 7305

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 7306

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 7307

ESHM : (V, E). There’s a new way to redefine as 7308

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 7309
to ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is straightforward. 7310
Then there’s no at least one SuperHyperPerfect. Thus the notion of quasi may be up but 7311
the SuperHyperNotions based on SuperHyperPerfect could be applied. There are only z 0 7312
SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as the 7313
representative in the 7314

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). 7315
Thus only some SuperHyperVertices and only minimum-Neutrosophic-of-SuperHyperPart 7316
SuperHyperEdges are attained in any solution 7317

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). 7318
The latter is straightforward.  7319

136EXM22a Example 40.0.13. In the Figure (31.5), the connected Neutrosophic SuperHyperMultipartite 7320
ESHM : (V, E), is highlighted and Neutrosophic featured. The obtained Neutrosophic 7321
SuperHyperSet, by the Algorithm in previous Neutrosophic result, of the Neutrosophic 7322

SuperHyperVertices of the connected Neutrosophic SuperHyperMultipartite ESHM : (V, E), 7323

in the Neutrosophic SuperHyperModel (31.5), is the Neutrosophic SuperHyperPerfect. 7324

Proposition 40.0.14. Assume a connected Neutrosophic SuperHyperWheel ESHW : (V, E). 7325
Then, 7326

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 7327

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 7328

ESHW : (V, E). There’s a new way to redefine as 7329

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 7330
ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is straightforward. Then there’s 7331

at least one SuperHyperPerfect. Thus the notion of quasi isn’t up and the SuperHyperNotions 7332
based on SuperHyperPerfect could be applied. The unique embedded SuperHyperPerfect 7333
proposes some longest SuperHyperPerfect excerpt from some representatives. The latter is 7334
straightforward.  7335

136EXM23a Example 40.0.15. In the Neutrosophic Figure (31.6), the connected Neutrosophic SuperHyper- 7336
Wheel N SHW : (V, E), is Neutrosophic highlighted and featured. The obtained Neutrosophic 7337
SuperHyperSet, by the Algorithm in previous result, of the Neutrosophic SuperHyperVer- 7338
tices of the connected Neutrosophic SuperHyperWheel ESHW : (V, E), in the Neutrosophic 7339
SuperHyperModel (31.6), is the Neutrosophic SuperHyperPerfect. 7340

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 CHAPTER 41 7341

Neutrosophic SuperHyperTotal But As 7342

The Extensions Excerpt From Dense And 7343

Super Forms 7344

Definition 41.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperTotal). 7345

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider a 7346

Neutrosophic SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and E 0 = {E1 , E2 , . . . , Ez }. Then either V 0 7347
or E 0 is called 7348

(i) Neutrosophic e-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that 7349

Va ∈ Ei , Ej ; 7350

(ii) Neutrosophic re-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that 7351

Va ∈ Ei , Ej ; and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 7352

(iii) Neutrosophic v-SuperHyperTotal if ∀Vi ∈ VESHG:(V,E) , ∃!Vj ∈ V 0 , such that 7353

Vi , Vj ∈ Ea ; 7354

(iv) Neutrosophic rv-SuperHyperTotal if ∀Vi ∈ VESHG:(V,E) , ∃!Vj ∈ V 0 , such that 7355

Vi , Vj ∈ Ea ; and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; 7356

(v) Neutrosophic SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 7357

Neutrosophic re-SuperHyperTotal, Neutrosophic v-SuperHyperTotal, and Neutrosophic 7358

rv-SuperHyperTotal. 7359

Definition 41.0.2. ((Neutrosophic) SuperHyperTotal). 7360

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider a 7361

Neutrosophic SuperHyperEdge (NSHE) E = {V1 , V2 , . . . , Vs }. Then E is called 7362

(i) an Extreme SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 7363

Neutrosophic re-SuperHyperTotal, Neutrosophic v-SuperHyperTotal, and Neutrosophic 7364
rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 7365
is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Extreme 7366
cardinality of the Extreme SuperHyperEdges in the conseNeighborive Extreme sequence 7367
of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 7368

Extreme SuperHyperTotal; 7369

381
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, 7370

Neutrosophic re-SuperHyperTotal, Neutrosophic v-SuperHyperTotal, and Neutrosophic 7371
rv-SuperHyperTotal and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7372
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of 7373
a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality conseNeighborive 7374
Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they 7375

form the Neutrosophic SuperHyperTotal; 7376

(iii) an Extreme SuperHyperTotal SuperHyperPolynomial if it’s either of Neutrosophic 7377

e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v-SuperHyperTotal, 7378

and Neutrosophic rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph 7379
N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients 7380
defined as the Extreme number of the maximum Extreme cardinality of the Extreme 7381
SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme cardinality conseNeigh- 7382
borive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form 7383

the Extreme SuperHyperTotal; and the Extreme power is corresponded to its Extreme 7384
coefficient; 7385

(iv) a Neutrosophic SuperHyperTotal SuperHyperPolynomial if it’s either of 7386

Neutrosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v- 7387

SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for a Neutro- 7388
sophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 7389
contains the Neutrosophic coefficients defined as the Neutrosophic number of the max- 7390
imum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic 7391
SuperHyperSet S of high Neutrosophic cardinality conseNeighborive Neutrosophic Super- 7392

HyperEdges and Neutrosophic SuperHyperVertices such that they form the Neutrosophic 7393
SuperHyperTotal; and the Neutrosophic power is corresponded to its Neutrosophic coeffi- 7394
cient; 7395

(v) an Extreme R-SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 7396

Neutrosophic re-SuperHyperTotal, Neutrosophic v-SuperHyperTotal, and Neutrosophic 7397
rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 7398
is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Extreme 7399
cardinality of the Extreme SuperHyperVertices in the conseNeighborive Extreme sequence 7400

of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 7401
Extreme SuperHyperTotal; 7402

(vi) a Neutrosophic R-SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 7403

Neutrosophic re-SuperHyperTotal, Neutrosophic v-SuperHyperTotal, and Neutrosophic 7404

rv-SuperHyperTotal and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7405
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of 7406
a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality conseNeighborive 7407
Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they 7408
form the Neutrosophic SuperHyperTotal; 7409

(vii) an Extreme R-SuperHyperTotal SuperHyperPolynomial if it’s either of Neut- 7410

rosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v- 7411

SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for an Extreme 7412

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 Henry Garrett · Independent Researcher · Department of Mathematics ·
DrHenryGarrett@gmail.com · Manhattan, NY, USA

SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the 7413

Extreme coefficients defined as the Extreme number of the maximum Extreme cardinality 7414
of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme 7415
cardinality conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVer- 7416
tices such that they form the Extreme SuperHyperTotal; and the Extreme power is 7417
corresponded to its Extreme coefficient; 7418

(viii) a Neutrosophic SuperHyperTotal SuperHyperPolynomial if it’s either of 7419

Neutrosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v- 7420
SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for a Neutro- 7421

sophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 7422

contains the Neutrosophic coefficients defined as the Neutrosophic number of the max- 7423
imum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic 7424
SuperHyperSet S of high Neutrosophic cardinality conseNeighborive Neutrosophic Super- 7425
HyperEdges and Neutrosophic SuperHyperVertices such that they form the Neutrosophic 7426
SuperHyperTotal; and the Neutrosophic power is corresponded to its Neutrosophic coeffi- 7427

cient. 7428

136EXM1 Example 41.0.3. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E) in 7429
the mentioned Neutrosophic Figures in every Neutrosophic items. 7430

• On the Figure (30.1), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 7431

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7432

E1 and E3 are some empty Neutrosophic SuperHyperEdges but E2 is a loop Neutrosophic 7433
SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of 7434
Neutrosophic SuperHyperNeighbor, there’s only one Neutrosophic SuperHyperEdge, 7435
namely, E4 . The Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means 7436
that there’s no Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. 7437
Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in every given Neutrosophic 7438

SuperHyperTotal. 7439

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 7440

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7441
E1 , E2 and E3 are some empty Neutrosophic SuperHyperEdges but E4 is a Neutrosophic 7442
SuperHyperEdge. Thus in the terms of Neutrosophic SuperHyperNeighbor, there’s only 7443
one Neutrosophic SuperHyperEdge, namely, E4 . The Neutrosophic SuperHyperVertex, V3 7444
is Neutrosophic isolated means that there’s no Neutrosophic SuperHyperEdge has it as 7445

a Neutrosophic endpoint. Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in 7446

Henry Garrett · 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. 7447

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 7448

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7449

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 7450

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7451

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 7452

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7453

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 7454

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7455

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 7456

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7457

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 7458

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7459

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 7460

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7461

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 7462

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7463

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 7464

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7465

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 7466

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7467

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 7468

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7469

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 7470

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7471

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 7472

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7473

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 7474

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7475

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 7476

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7477

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 7478

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7479

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 7480

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7481

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 7482

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7483

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 7484

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7485

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 7486

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7487

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 7488
Neutrosophic SuperHyperClasses. 7489

Proposition 41.0.4. Assume a connected Neutrosophic SuperHyperPath ESHP : (V, E). Then 7490

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 7491

P :
V2EXT ERN AL , E2 ,
V3EXT ERN AL , E3 ,
...

be a longest path taken from a connected Neutrosophic SuperHyperPath ESHP : (V, E). 7492
There’s a new way to redefine as 7493

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 7494
ViEXT ERN AL in the literatures of SuperHyperTotal. The latter is straightforward.  7495

136EXM18a Example 41.0.5. In the Figure (31.1), the connected Neutrosophic SuperHyperPath ESHP : 7496

(V, E), is highlighted and featured. The Neutrosophic SuperHyperSet, in the Neutrosophic 7497
SuperHyperModel (31.1), is the SuperHyperTotal. 7498

Proposition 41.0.6. Assume a connected Neutrosophic SuperHyperCycle ESHC : (V, E). Then 7499

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 7500

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). 7501
There’s a new way to redefine as 7502

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 7503
ViEXT ERN AL in the literatures of SuperHyperTotal. The latter is straightforward.  7504

136EXM19a Example 41.0.7. In the Figure (31.2), the connected Neutrosophic SuperHyperCycle N SHC : 7505
(V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, in the 7506
Neutrosophic SuperHyperModel (31.2), is the Neutrosophic SuperHyperTotal. 7507

Proposition 41.0.8. Assume a connected Neutrosophic SuperHyperStar ESHS : (V, E). Then 7508

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 7509

P : ViEXT ERN AL , Ei , CEN T ER, Ej .

be a longest path taken a connected Neutrosophic SuperHyperStar ESHS : (V, E). There’s a 7510
new way to redefine as 7511

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 7512
ViEXT ERN AL in the literatures of SuperHyperTotal. The latter is straightforward.  7513

136EXM20a Example 41.0.9. In the Figure (31.3), the connected Neutrosophic SuperHyperStar ESHS : 7514
(V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, by the Algorithm 7515
in previous Neutrosophic result, of the Neutrosophic SuperHyperVertices of the connected 7516

Neutrosophic SuperHyperStar ESHS : (V, E), in the Neutrosophic SuperHyperModel (31.3), is 7517
the Neutrosophic SuperHyperTotal. 7518

Proposition 41.0.10. Assume a connected Neutrosophic SuperHyperBipartite ESHB : (V, E). 7519
Then 7520

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 7521

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

is a longest path taken from a connected Neutrosophic SuperHyperBipartite ESHB : (V, E). 7522
There’s a new way to redefine as 7523

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 7524
ViEXT ERN AL in the literatures of SuperHyperTotal. The latter is straightforward. Then there’s 7525

no at least one SuperHyperTotal. Thus the notion of quasi may be up but the SuperHyperNotions 7526

Henry Garrett · 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 7527
SuperHyperPart could have one SuperHyperVertex as the representative in the 7528

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

is a longest SuperHyperTotal taken from a connected Neutrosophic SuperHyperBipartite 7529

ESHB : (V, E). Thus only some SuperHyperVertices and only minimum-Neutrosophic-of- 7530
SuperHyperPart SuperHyperEdges are attained in any solution 7531

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

The latter is straightforward.  7532

136EXM21a Example 41.0.11. In the Neutrosophic Figure (31.4), the connected Neutrosophic SuperHy- 7533
perBipartite ESHB : (V, E), is Neutrosophic highlighted and Neutrosophic featured. The 7534
obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous Neutrosophic 7535
result, of the Neutrosophic SuperHyperVertices of the connected Neutrosophic SuperHyper- 7536

Bipartite ESHB : (V, E), in the Neutrosophic SuperHyperModel (31.4), is the Neutrosophic 7537
SuperHyperTotal. 7538

Proposition 41.0.12. Assume a connected Neutrosophic SuperHyperMultipartite ESHM : 7539

(V, E). Then 7540

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 7541

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

is a longest SuperHyperTotal taken from a connected Neutrosophic SuperHyperMultipartite 7542

ESHM : (V, E). There’s a new way to redefine as 7543

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 7544
ViEXT ERN AL in the literatures of SuperHyperTotal. The latter is straightforward. Then there’s 7545
no at least one SuperHyperTotal. Thus the notion of quasi may be up but the SuperHyperNotions 7546

based on SuperHyperTotal could be applied. There are only z 0 SuperHyperParts. Thus every 7547
SuperHyperPart could have one SuperHyperVertex as the representative in the 7548

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

is a longest path taken from a connected Neutrosophic SuperHyperMultipartite ESHM : (V, E). 7549
Thus only some SuperHyperVertices and only minimum-Neutrosophic-of-SuperHyperPart 7550
SuperHyperEdges are attained in any solution 7551

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

is a longest path taken from a connected Neutrosophic SuperHyperMultipartite ESHM : (V, E). 7552
The latter is straightforward.  7553

136EXM22a Example 41.0.13. In the Figure (31.5), the connected Neutrosophic SuperHyperMultipartite 7554

ESHM : (V, E), is highlighted and Neutrosophic featured. The obtained Neutrosophic 7555
SuperHyperSet, by the Algorithm in previous Neutrosophic result, of the Neutrosophic 7556
SuperHyperVertices of the connected Neutrosophic SuperHyperMultipartite ESHM : (V, E), 7557
in the Neutrosophic SuperHyperModel (31.5), is the Neutrosophic SuperHyperTotal. 7558

Proposition 41.0.14. Assume a connected Neutrosophic SuperHyperWheel ESHW : (V, E). 7559
Then, 7560

∗
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 7561

P : ViEXT ERN AL , Ei∗ , CEN T ER, Ej .

is a longest SuperHyperTotal taken from a connected Neutrosophic SuperHyperWheel ESHW : 7562

(V, E). There’s a new way to redefine as 7563

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 7564
ViEXT ERN AL in the literatures of SuperHyperTotal. The latter is straightforward. Then there’s 7565
at least one SuperHyperTotal. Thus the notion of quasi isn’t up and the SuperHyperNotions 7566

based on SuperHyperTotal could be applied. The unique embedded SuperHyperTotal 7567

proposes some longest SuperHyperTotal excerpt from some representatives. The latter is 7568
straightforward.  7569

136EXM23a Example 41.0.15. In the Neutrosophic Figure (31.6), the connected Neutrosophic SuperHyper- 7570
Wheel N SHW : (V, E), is Neutrosophic highlighted and featured. The obtained Neutrosophic 7571
SuperHyperSet, by the Algorithm in previous result, of the Neutrosophic SuperHyperVer- 7572
tices of the connected Neutrosophic SuperHyperWheel ESHW : (V, E), in the Neutrosophic 7573
SuperHyperModel (31.6), is the Neutrosophic SuperHyperTotal. 7574

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 CHAPTER 42 7575

Neutrosophic SuperHyperConnected But 7576

As The Extensions Excerpt From Dense 7577

And Super Forms 7578

Definition 42.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperConnected). 7579

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider a 7580
Neutrosophic SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and E 0 = {E1 , E2 , . . . , Ez }. Then either V 0 7581
or E 0 is called 7582

(i) Neutrosophic e-SuperHyperConnected if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such 7583

that Va ∈ Ei , Ej ; and ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; 7584

(ii) Neutrosophic re-SuperHyperConnected if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ 7585

E 0 , such that Va ∈ Ei , Ej ; ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; and 7586
|Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 7587

(iii) Neutrosophic v-SuperHyperConnected if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such 7588

that Vi , Vj 6∈ Ea ; and ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; 7589

(iv) Neutrosophic rv-SuperHyperConnected if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ 7590

V 0 , such that Vi , Vj ∈ Ea ; ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; and 7591
|Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; 7592

(v) Neutrosophic SuperHyperConnected if it’s either of Neutrosophic e-SuperHyperConnected,

7593
Neutrosophic re-SuperHyperConnected, Neutrosophic v-SuperHyperConnected, and Neut- 7594
rosophic rv-SuperHyperConnected. 7595

Definition 42.0.2. ((Neutrosophic) SuperHyperConnected). 7596

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider a 7597
Neutrosophic SuperHyperEdge (NSHE) E = {V1 , V2 , . . . , Vs }. Then E is called 7598

(i) an Extreme SuperHyperConnected if it’s either of Neutrosophic e-SuperHyperConnected,

7599
Neutrosophic re-SuperHyperConnected, Neutrosophic v-SuperHyperConnected, and Neut- 7600
rosophic rv-SuperHyperConnected and C(N SHG) for an Extreme SuperHyperGraph 7601
N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S 7602

395
Henry Garrett · Independent Researcher · Department of Mathematics ·
DrHenryGarrett@gmail.com · Manhattan, NY, USA

of high Extreme cardinality of the Extreme SuperHyperEdges in the conseNeighborive 7603

Extreme sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such 7604
that they form the Extreme SuperHyperConnected; 7605

(ii) a Neutrosophic SuperHyperConnected if it’s either of Neutrosophic e- 7606

SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neutrosophic v- 7607
SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) 7608
for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic 7609
cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S 7610

of high Neutrosophic cardinality conseNeighborive Neutrosophic SuperHyperEdges and 7611

Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperCon- 7612
nected; 7613

(iii) an Extreme SuperHyperConnected SuperHyperPolynomial if it’s either of Neut- 7614

rosophic e-SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neutrosophic 7615
v-SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) for 7616
an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial 7617
contains the Extreme coefficients defined as the Extreme number of the maximum Ex- 7618
treme cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S 7619

of high Extreme cardinality conseNeighborive Extreme SuperHyperEdges and Extreme 7620

SuperHyperVertices such that they form the Extreme SuperHyperConnected; and the 7621
Extreme power is corresponded to its Extreme coefficient; 7622

(iv) a Neutrosophic SuperHyperConnected SuperHyperPolynomial if it’s either of 7623

Neutrosophic e-SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neut- 7624
rosophic v-SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and 7625
C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic 7626
SuperHyperPolynomial contains the Neutrosophic coefficients defined as the Neutrosophic 7627

number of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges 7628

of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality conseNeighborive 7629
Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form 7630
the Neutrosophic SuperHyperConnected; and the Neutrosophic power is corresponded to 7631
its Neutrosophic coefficient; 7632

(v) an Extreme R-SuperHyperConnected if it’s either of Neutrosophic e- 7633

SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neutrosophic v- 7634
SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) 7635
for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme cardinality 7636

of an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme SuperHyper- 7637

Vertices in the conseNeighborive Extreme sequence of Extreme SuperHyperEdges and 7638
Extreme SuperHyperVertices such that they form the Extreme SuperHyperConnected; 7639

(vi) a Neutrosophic R-SuperHyperConnected if it’s either of Neutrosophic e- 7640

SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neutrosophic v- 7641
SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) 7642
for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic 7643
cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S 7644

of high Neutrosophic cardinality conseNeighborive Neutrosophic SuperHyperEdges and 7645

Henry Garrett · 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- 7646
nected; 7647

(vii) an Extreme R-SuperHyperConnected SuperHyperPolynomial if it’s either of 7648

Neutrosophic e-SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neut- 7649
rosophic v-SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and 7650
C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme Super- 7651
HyperPolynomial contains the Extreme coefficients defined as the Extreme number of the 7652
maximum Extreme cardinality of the Extreme SuperHyperVertices of an Extreme Super- 7653

HyperSet S of high Extreme cardinality conseNeighborive Extreme SuperHyperEdges and 7654

Extreme SuperHyperVertices such that they form the Extreme SuperHyperConnected; 7655
and the Extreme power is corresponded to its Extreme coefficient; 7656

(viii) a Neutrosophic SuperHyperConnected SuperHyperPolynomial if it’s either of 7657

Neutrosophic e-SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neut- 7658
rosophic v-SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and 7659
C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic 7660

SuperHyperPolynomial contains the Neutrosophic coefficients defined as the Neutrosophic 7661

number of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices 7662
of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality conseNeighborive 7663
Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form 7664
the Neutrosophic SuperHyperConnected; and the Neutrosophic power is corresponded to 7665
its Neutrosophic coefficient. 7666

136EXM1 Example 42.0.3. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E) in 7667
the mentioned Neutrosophic Figures in every Neutrosophic items. 7668

• On the Figure (30.1), the Neutrosophic SuperHyperNotion, namely, Neutrosophic Super- 7669
HyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7670

E1 and E3 are some empty Neutrosophic SuperHyperEdges but E2 is a loop Neutrosophic 7671
SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of Neutro- 7672
sophic SuperHyperNeighbor, there’s only one Neutrosophic SuperHyperEdge, namely, E4 . 7673
The Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means that there’s no 7674
Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. Thus the Neutrosophic 7675

SuperHyperVertex, V3 , is excluded in every given Neutrosophic SuperHyperConnected. 7676

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- 7677
HyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7678
E1 , E2 and E3 are some empty Neutrosophic SuperHyperEdges but E4 is a Neutrosophic 7679
SuperHyperEdge. Thus in the terms of Neutrosophic SuperHyperNeighbor, there’s only 7680
one Neutrosophic SuperHyperEdge, namely, E4 . The Neutrosophic SuperHyperVertex, V3 7681

is Neutrosophic isolated means that there’s no Neutrosophic SuperHyperEdge has it as 7682

Henry Garrett · 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 7683

every given Neutrosophic SuperHyperConnected. 7684

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- 7685

HyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7686

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- 7687
HyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7688

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- 7689
HyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7690

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- 7691
HyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7692

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- 7693
HyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7694

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- 7695
HyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7696

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- 7697
HyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7698

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- 7699
HyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7700

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- 7701
HyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7702

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- 7703
HyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7704

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- 7705
HyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7706

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- 7707
HyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7708

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- 7709
HyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7710

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- 7711
HyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7712

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- 7713

HyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7714

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- 7715
HyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7716

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- 7717
HyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7718

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- 7719
HyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7720

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- 7721

HyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7722

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- 7723
HyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7724

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 7725

Neutrosophic SuperHyperClasses. 7726

Henry Garrett · 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 7727

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 7728

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). 7729
There’s a new way to redefine as 7730

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 7731
ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is straightforward.  7732

136EXM18a Example 42.0.5. In the Figure (31.1), the connected Neutrosophic SuperHyperPath ESHP : 7733
(V, E), is highlighted and featured. The Neutrosophic SuperHyperSet, in the Neutrosophic 7734
SuperHyperModel (31.1), is the SuperHyperConnected. 7735

Proposition 42.0.6. Assume a connected Neutrosophic SuperHyperCycle ESHC : (V, E). Then 7736

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 7737

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). 7738
There’s a new way to redefine as 7739

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 7740
ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is straightforward.  7741

136EXM19a Example 42.0.7. In the Figure (31.2), the connected Neutrosophic SuperHyperCycle N SHC : 7742
(V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, in the 7743
Neutrosophic SuperHyperModel (31.2), is the Neutrosophic SuperHyperConnected. 7744

Proposition 42.0.8. Assume a connected Neutrosophic SuperHyperStar ESHS : (V, E). Then 7745

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 7746

P : ViEXT ERN AL , Ei , CEN T ER, Ej .

be a longest path taken a connected Neutrosophic SuperHyperStar ESHS : (V, E). There’s a 7747

new way to redefine as 7748

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 7749

ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is straightforward.  7750

Henry Garrett · 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 : 7751
(V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, by the Algorithm 7752
in previous Neutrosophic result, of the Neutrosophic SuperHyperVertices of the connected 7753
Neutrosophic SuperHyperStar ESHS : (V, E), in the Neutrosophic SuperHyperModel (31.3), is 7754
the Neutrosophic SuperHyperConnected. 7755

Proposition 42.0.10. Assume a connected Neutrosophic SuperHyperBipartite ESHB : (V, E). 7756
Then 7757

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 7758

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

is a longest path taken from a connected Neutrosophic SuperHyperBipartite ESHB : (V, E). 7759
There’s a new way to redefine as 7760

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 7761
ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is straightforward. Then 7762
there’s no at least one SuperHyperConnected. Thus the notion of quasi may be up but the 7763
SuperHyperNotions based on SuperHyperConnected could be applied. There are only two 7764
SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as the 7765
representative in the 7766

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 7767

ESHB : (V, E). Thus only some SuperHyperVertices and only minimum-Neutrosophic-of- 7768
SuperHyperPart SuperHyperEdges are attained in any solution 7769

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

The latter is straightforward.  7770

136EXM21a Example 42.0.11. In the Neutrosophic Figure (31.4), the connected Neutrosophic SuperHy- 7771

perBipartite ESHB : (V, E), is Neutrosophic highlighted and Neutrosophic featured. The 7772
obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous Neutrosophic 7773
result, of the Neutrosophic SuperHyperVertices of the connected Neutrosophic SuperHyper- 7774
Bipartite ESHB : (V, E), in the Neutrosophic SuperHyperModel (31.4), is the Neutrosophic 7775
SuperHyperConnected. 7776

Proposition 42.0.12. Assume a connected Neutrosophic SuperHyperMultipartite ESHM : 7777

(V, E). Then 7778

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 7779

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 7780

ESHM : (V, E). There’s a new way to redefine as 7781

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 7782
ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is straightforward. Then 7783
there’s no at least one SuperHyperConnected. Thus the notion of quasi may be up but 7784
the SuperHyperNotions based on SuperHyperConnected could be applied. There are only 7785

z 0 SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as the 7786
representative in the 7787

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

is a longest path taken from a connected Neutrosophic SuperHyperMultipartite ESHM : (V, E). 7788
Thus only some SuperHyperVertices and only minimum-Neutrosophic-of-SuperHyperPart 7789
SuperHyperEdges are attained in any solution 7790

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

is a longest path taken from a connected Neutrosophic SuperHyperMultipartite ESHM : (V, E). 7791

The latter is straightforward.  7792

136EXM22a Example 42.0.13. In the Figure (31.5), the connected Neutrosophic SuperHyperMultipartite 7793
ESHM : (V, E), is highlighted and Neutrosophic featured. The obtained Neutrosophic 7794

SuperHyperSet, by the Algorithm in previous Neutrosophic result, of the Neutrosophic 7795

SuperHyperVertices of the connected Neutrosophic SuperHyperMultipartite ESHM : (V, E), 7796
in the Neutrosophic SuperHyperModel (31.5), is the Neutrosophic SuperHyperConnected. 7797

Proposition 42.0.14. Assume a connected Neutrosophic SuperHyperWheel ESHW : (V, E). 7798
Then, 7799

∗
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 7800

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 7801

ESHW : (V, E). There’s a new way to redefine as 7802

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 7803
to ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is straightforward. 7804

Then there’s at least one SuperHyperConnected. Thus the notion of quasi isn’t up and 7805
the SuperHyperNotions based on SuperHyperConnected could be applied. The unique 7806
embedded SuperHyperConnected proposes some longest SuperHyperConnected excerpt from 7807
some representatives. The latter is straightforward.  7808

136EXM23a Example 42.0.15. In the Neutrosophic Figure (31.6), the connected Neutrosophic SuperHyper- 7809
Wheel N SHW : (V, E), is Neutrosophic highlighted and featured. The obtained Neutrosophic 7810
SuperHyperSet, by the Algorithm in previous result, of the Neutrosophic SuperHyperVer- 7811
tices of the connected Neutrosophic SuperHyperWheel ESHW : (V, E), in the Neutrosophic 7812
SuperHyperModel (31.6), is the Neutrosophic SuperHyperConnected. 7813

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 CHAPTER 43 7814

Background 7815

There are some scientific researches covering the topic of this research. In what follows, there 7816
are some discussion and literature reviews about them. 7817

The seminal paper and groundbreaking article is titled “neutrosophic co-degree and neutrosophic 7818
degree alongside chromatic numbers in the setting of some classes related to neutrosophic 7819
hypergraphs” in Ref. [HG1] by Henry Garrett (2022). In this research article, a novel approach 7820
is implemented on SuperHyperGraph and neutrosophic SuperHyperGraph based on general 7821
forms without using neutrosophic classes of neutrosophic SuperHyperGraph. It’s published in 7822
prestigious and fancy journal is entitled “Journal of Current Trends in Computer Science Re- 7823

search (JCTCSR)” with ISO abbreviation “J Curr Trends Comp Sci Res” in volume 1 and issue 7824
1 with pages 06-14. The research article studies deeply with choosing neutrosophic hypergraphs 7825
instead of neutrosophic SuperHyperGraph. It’s the breakthrough toward independent results 7826
based on initial background. 7827
The seminal paper and groundbreaking article is titled “Super Hyper Dominating and Super Hy- 7828
per Resolving on Neutrosophic Super Hyper Graphs and Their Directions in Game Theory and 7829

Neutrosophic Super Hyper Classes” in Ref. [HG2] by Henry Garrett (2022). In this research 7830
article, a novel approach is implemented on SuperHyperGraph and neutrosophic SuperHyper- 7831
Graph based on fundamental SuperHyperNumber and using neutrosophic SuperHyperClasses 7832
of neutrosophic SuperHyperGraph. It’s published in prestigious and fancy journal is entitled 7833
“Journal of Mathematical Techniques and Computational Mathematics(JMTCM)” with ISO 7834
abbreviation “J Math Techniques Comput Math” in volume 1 and issue 3 with pages 242-263. 7835

The research article studies deeply with choosing directly neutrosophic SuperHyperGraph 7836
and SuperHyperGraph. It’s the breakthrough toward independent results based on initial 7837
background and fundamental SuperHyperNumbers. 7838
The seminal paper and groundbreaking article is titled “Some Super Hyper Degrees and 7839
Co-Super Hyper Degrees on Neutrosophic Super Hyper Graphs And Super Hyper Graphs 7840
Alongside Applications in Cancer’s Treatments” in Ref. [HG3] by Henry Garrett (2023). In 7841

this research article, a novel approach is implemented on SuperHyperGraph and neutrosophic 7842
SuperHyperGraph based on fundamental notions and using vital tools in Cancer’s Treatments. 7843
It’s published in prestigious and fancy journal is entitled “Journal of Mathematical Techniques 7844
and Computational Mathematics(JMTCM)” with ISO abbreviation “J Math Techniques Com- 7845
put Math” in volume 2 and issue 1 with pages 35-47. The research article studies deeply with 7846
choosing directly neutrosophic SuperHyperGraph and SuperHyperGraph. It’s the breakthrough 7847

toward independent results based on initial background and fundamental SuperHyperNumbers. 7848

409
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 7849
(Dual)Resolving and (Dual)Coloring alongside (Dual)Dominating in (Neutrosophic)n- 7850
SuperHyperGraph” in Ref. [HG4] by Henry Garrett (2022), “0049 | (Failed)1-Zero-Forcing 7851
Number in Neutrosophic Graphs” in Ref. [HG5] by Henry Garrett (2022), “Extreme SuperHy- 7852
perClique as the Firm Scheme of Confrontation under Cancer’s Recognition as the Model in 7853
The Setting of (Neutrosophic) SuperHyperGraphs” in Ref. [HG6] by Henry Garrett (2022), 7854

“Uncertainty On The Act And Effect Of Cancer Alongside The Foggy Positions Of Cells Toward 7855
Neutrosophic Failed SuperHyperClique inside Neutrosophic SuperHyperGraphs Titled Cancer’s 7856
Recognition” in Ref. [HG7] by Henry Garrett (2022), “Neutrosophic Version Of Separates 7857
Groups Of Cells In Cancer’s Recognition On Neutrosophic SuperHyperGraphs” in Ref. [HG8] 7858
by Henry Garrett (2022), “The Shift Paradigm To Classify Separately The Cells and Affected 7859
Cells Toward The Totality Under Cancer’s Recognition By New Multiple Definitions On the 7860

Sets Polynomials Alongside Numbers In The (Neutrosophic) SuperHyperMatching Theory 7861

Based on SuperHyperGraph and Neutrosophic SuperHyperGraph” in Ref. [HG9] by Henry 7862
Garrett (2022), “Breaking the Continuity and Uniformity of Cancer In The Worst Case of 7863
Full Connections With Extreme Failed SuperHyperClique In Cancer’s Recognition Applied in 7864
(Neutrosophic) SuperHyperGraphs” in Ref. [HG10] by Henry Garrett (2022), “Neutrosophic 7865
Failed SuperHyperStable as the Survivors on the Cancer’s Neutrosophic Recognition Based 7866

on Uncertainty to All Modes in Neutrosophic SuperHyperGraphs” in Ref. [HG11] by Henry 7867

Garrett (2022), “Extremism of the Attacked Body Under the Cancer’s Circumstances Where 7868
Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs” in Ref. [HG12] by Henry 7869
Garrett (2022), “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Recognitions And 7870
(Neutrosophic) SuperHyperGraphs” in Ref. [HG13] by Henry Garrett (2022), “Neutrosophic 7871
Messy-Style SuperHyperGraphs To Form Neutrosophic SuperHyperStable To Act on Cancer’s 7872

Neutrosophic Recognitions In Special ViewPoints” in Ref. [HG14] by Henry Garrett (2022), 7873
“Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To Use Neutrosophic 7874
SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond” in Ref. [HG15] 7875
by Henry Garrett (2022), “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by 7876
Well- SuperHyperModelled (Neutrosophic) SuperHyperGraphs ” in Ref. [HG16] by Henry 7877
Garrett (2022), “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic Su- 7878

perHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints” in 7879

Ref. [HG12] by Henry Garrett (2022), “Basic Notions on (Neutrosophic) SuperHyperFor- 7880
cing And (Neutrosophic) SuperHyperModeling in Cancer’s Recognitions And (Neutrosophic) 7881
SuperHyperGraphs” in Ref. [HG17] by Henry Garrett (2022), “Neutrosophic Messy-Style 7882
SuperHyperGraphs To Form Neutrosophic SuperHyperStable To Act on Cancer’s Neutrosophic 7883

Recognitions In Special ViewPoints” in Ref. [HG18] by Henry Garrett (2022),“(Neutrosophic) 7884

SuperHyperModeling of Cancer’s Recognitions Featuring (Neutrosophic) SuperHyperDefensive 7885
SuperHyperAlliances” in Ref. [HG19] by Henry Garrett (2022), “(Neutrosophic) Super- 7886
HyperAlliances With SuperHyperDefensive and SuperHyperOffensive Type-SuperHyperSet 7887
On (Neutrosophic) SuperHyperGraph With (Neutrosophic) SuperHyperModeling of Cancer’s 7888
Recognitions And Related (Neutrosophic) SuperHyperClasses” in Ref. [HG20] by Henry 7889

Garrett (2022), “SuperHyperGirth on SuperHyperGraph and Neutrosophic SuperHyperGraph 7890

With SuperHyperModeling of Cancer’s Recognitions” in Ref. [HG21] by Henry Garrett (2022), 7891
“Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic SuperHyperGraphs 7892
and SuperHyperGraphs Alongside Applications in Cancer’s Treatments” in Ref. [HG22] by 7893
Henry Garrett (2022), “SuperHyperDominating and SuperHyperResolving on Neutrosophic 7894

Henry Garrett · 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” 7895
in Ref. [HG23] by Henry Garrett (2022), “SuperHyperMatching By (R-)Definitions And 7896
Polynomials To Monitor Cancer’s Recognition In Neutrosophic SuperHyperGraphs” in Ref. 7897
[HG24] by Henry Garrett (2023), “The Focus on The Partitions Obtained By Parallel Moves 7898
In The Cancer’s Extreme Recognition With Different Types of Extreme SuperHyperMatching 7899
Set and Polynomial on (Neutrosophic) SuperHyperGraphs” in Ref. [HG25] by Henry Garrett 7900

(2023), “Extreme Failed SuperHyperClique Decides the Failures on the Cancer’s Recognition 7901
in the Perfect Connections of Cancer’s Attacks By SuperHyperModels Named (Neutrosophic) 7902
SuperHyperGraphs” in Ref. [HG26] by Henry Garrett (2023), “Indeterminacy On The All 7903
Possible Connections of Cells In Front of Cancer’s Attacks In The Terms of Neutrosophic Failed 7904
SuperHyperClique on Cancer’s Recognition called Neutrosophic SuperHyperGraphs” in Ref. 7905
[HG27] by Henry Garrett (2023), “Perfect Directions Toward Idealism in Cancer’s Neutrosophic 7906

Recognition Forwarding Neutrosophic SuperHyperClique on Neutrosophic SuperHyperGraphs” 7907

in Ref. [HG28] by Henry Garrett (2023), “Demonstrating Complete Connections in Every 7908
Embedded Regions and Sub-Regions in the Terms of Cancer’s Recognition and (Neutrosophic) 7909
SuperHyperGraphs With (Neutrosophic) SuperHyperClique” in Ref. [HG29] by Henry Garrett 7910
(2023), “Different Neutrosophic Types of Neutrosophic Regions titled neutrosophic Failed 7911
SuperHyperStable in Cancer’s Neutrosophic Recognition modeled in the Form of Neutro- 7912

sophic SuperHyperGraphs” in Ref. [HG30] by Henry Garrett (2023), “Using the Tool As 7913
(Neutrosophic) Failed SuperHyperStable To SuperHyperModel Cancer’s Recognition Titled 7914
(Neutrosophic) SuperHyperGraphs” in Ref. [HG31] by Henry Garrett (2023), “Neutrosophic 7915
Messy-Style SuperHyperGraphs To Form Neutrosophic SuperHyperStable To Act on Cancer’s 7916
Neutrosophic Recognitions In Special ViewPoints” in Ref. [HG32] by Henry Garrett (2023), 7917
“(Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well-SuperHyperModelled 7918

(Neutrosophic) SuperHyperGraphs” in Ref. [HG33] by Henry Garrett (2023), “Neutrosophic 7919

1-Failed SuperHyperForcing in the SuperHyperFunction To Use Neutrosophic SuperHyper- 7920
Graphs on Cancer’s Neutrosophic Recognition And Beyond” in Ref. [HG34] by Henry 7921
Garrett (2022), “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Recognitions And 7922
(Neutrosophic) SuperHyperGraphs” in Ref. [HG35] by Henry Garrett (2022), “Basic Notions 7923
on (Neutrosophic) SuperHyperForcing And (Neutrosophic) SuperHyperModeling in Cancer’s 7924

Recognitions And (Neutrosophic) SuperHyperGraphs” in Ref. [HG36] by Henry Garrett 7925

(2022), “Basic Neutrosophic Notions Concerning SuperHyperDominating and Neutrosophic 7926
SuperHyperResolving in SuperHyperGraph” in Ref. [HG37] by Henry Garrett (2022), “Initial 7927
Material of Neutrosophic Preliminaries to Study Some Neutrosophic Notions Based on Neutro- 7928
sophic SuperHyperEdge (NSHE) in Neutrosophic SuperHyperGraph (NSHG)” in Ref. [HG38] 7929

by Henry Garrett (2022), and [HG4; HG5; HG6; HG7; HG8; HG9; HG10; HG11; HG12; 7930
HG13; HG14; HG15; HG16; HG17; HG18; HG19; HG20; HG21; HG22; HG23; 7931
HG24; HG25; HG26; HG27; HG28; HG29; HG30; HG31; HG32; HG33; HG34; 7932
HG35; HG36; HG37; HG38; HG94; HG942; HG95; HG952; HG96; HG962; HG97; 7933
HG972; HG98; HG982; HG106; HG107; HG111; HG112; HG115; HG116; HG120; 7934
HG121; HG122; HG123; HG124; HG125; HG126; HG127; HG128; HG129; HG130; 7935

HG131; HG132; HG134; HG135; HG136; HG137; HG138; HG139; HG140; HG141; 7936
HG142; HG143; HG144; HG145; HG146; HG147; HG148; HG149; HG150; HG151; 7937
HG152; HG153; HG154; HG155; HG156; HG157; HG158; HG159; HG160; HG161; 7938
HG162; HG163; HG164; HG165; HG166; HG167; HG168; HG169; HG170; HG171; 7939
HG172; HG173; HG174; HG175; HG176; HG177; HG178; HG179; HG180; HG181; 7940

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics ·
DrHenryGarrett@gmail.com · Manhattan, NY, USA

HG182; HG183; HG184; HG185; HG186; HG187; HG188; HG189; HG190; HG191; 7941
HG192; HG193; HG194; HG195; HG196; HG197; HG198; HG199; HG200; HG201; 7942
HG202; HG203; HG204; HG205; HG206; HG207; HG208; HG209; HG210; HG211; 7943
HG212; HG213; HG214; HG215; HG216], there are some endeavors to formalize the basic 7944
SuperHyperNotions about neutrosophic SuperHyperGraph and SuperHyperGraph alongside 7945
scientific research books at [HG60b; HG61b; HG62b; HG63b; HG64b; HG65b; HG66b; 7946

HG67b; HG68b; HG69b; HG70b; HG71b; HG72b; HG73b; HG74b; HG75b; HG76b; 7947
HG77b; HG78b; HG79b; HG80b; HG81b; HG82b; HG83b; HG84b; HG85b; HG86b; 7948
HG87b; HG88b; HG89b; HG90b; HG91b; HG92b; HG93b; HG94b; HG95b; HG96b; 7949
HG97b; HG98b; HG99b; HG100b; HG101b; HG102b; HG103b; HG104b; HG105b; 7950
HG106b; HG107b; HG108b; HG109b; HG110b; HG111b; HG112b; HG113b; 7951
HG114b; HG115b; HG116b; HG117b; HG118b; HG119b; HG120b; HG121b; 7952

HG122b; HG123b; HG124b; HG125b; HG126b; HG127b; HG128b; HG129b; 7953

HG130b; HG131b; HG132b; HG133b; HG134b; HG135b; HG136b; HG137b; 7954
HG138b; HG139b; HG140b; HG141b; HG142b; HG143b; HG144b; HG145b; 7955
HG146b; HG147; HG148b; HG218]. Two popular scientific research books in Scribd 7956
in the terms of high readers, 4087 and 5084 respectively, on neutrosophic science is on [HG32b; 7957
HG44b]. 7958

Some scientific studies and scientific researches about neutrosophic graphs, are proposed as 7959
book in Ref. [HG71b] by Henry Garrett (2023) which is indexed by Google Scholar and has 7960
more than 4093 readers in Scribd. It’s titled “Beyond Neutrosophic Graphs” and published 7961
by Dr. Henry Garrett. This research book covers different types of notions and settings in 7962
neutrosophic graph theory and neutrosophic SuperHyperGraph theory. 7963
Also, some scientific studies and scientific researches about neutrosophic graphs, are proposed 7964

as book in Ref. [HG70b] by Henry Garrett (2023) which is indexed by Google Scholar and 7965
has more than 5090 readers in Scribd. It’s titled “Neutrosophic Duality” and published by Dr. 7966
Henry Garrett. This research book presents different types of notions SuperHyperResolving and 7967
SuperHyperDominating in the setting of duality in neutrosophic graph theory and neutrosophic 7968
SuperHyperGraph theory. This research book has scrutiny on the complement of the intended 7969
set and the intended set, simultaneously. It’s smart to consider a set but acting on its 7970

complement that what’s done in this research book which is popular in the terms of high readers 7971
in Scribd. 7972
See the seminal scientific researches [HG1; HG2; HG3]. The formalization of the notions on 7973
the framework of notions in SuperHyperGraphs, Neutrosophic notions in SuperHyperGraphs the- 7974
ory, and (Neutrosophic) SuperHyperGraphs theory at [HG4; HG5; HG6; HG7; HG8; HG9; 7975

HG10; HG11; HG12; HG13; HG14; HG15; HG16; HG17; HG18; HG19; HG20; 7976
HG21; HG22; HG23; HG24; HG25; HG26; HG27; HG28; HG29; HG30; HG31; 7977
HG32; HG33; HG34; HG35; HG36; HG37; HG38; HG94; HG942; HG95; HG952; 7978
HG96; HG962; HG97; HG972; HG98; HG982; HG106; HG107; HG111; HG112; 7979
HG115; HG116; HG120; HG121; HG122; HG123; HG124; HG125; HG126; HG127; 7980
HG128; HG129; HG130; HG131; HG132; HG134; HG135; HG136; HG137; HG138; 7981

HG139; HG140; HG141; HG142; HG143; HG144; HG145; HG146; HG147; HG148; 7982
HG149; HG150; HG151; HG152; HG153; HG154; HG155; HG156; HG157; HG158; 7983
HG159; HG160; HG161; HG162; HG163; HG164; HG165; HG166; HG167; HG168; 7984
HG169; HG170; HG171; HG172; HG173; HG174; HG175; HG176; HG177; HG178; 7985
HG179; HG180; HG181; HG182; HG183; HG184; HG185; HG186; HG187; HG188; 7986

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 Henry Garrett · Independent Researcher · Department of Mathematics ·
DrHenryGarrett@gmail.com · Manhattan, NY, USA

HG189; HG190; HG191; HG192; HG193; HG194; HG195; HG196; HG197; HG198; 7987
HG199; HG200; HG201; HG202; HG203; HG204; HG205; HG206; HG207; HG208; 7988
HG209; HG210; HG211; HG212; HG213; HG214; HG215; HG216; HG218] alongside 7989
scientific research books at [HG60b; HG61b; HG62b; HG63b; HG64b; HG65b; HG66b; 7990
HG67b; HG68b; HG69b; HG70b; HG71b; HG72b; HG73b; HG74b; HG75b; HG76b; 7991
HG77b; HG78b; HG79b; HG80b; HG81b; HG82b; HG83b; HG84b; HG85b; HG86b; 7992

HG87b; HG88b; HG89b; HG90b; HG91b; HG92b; HG93b; HG94b; HG95b; HG96b; 7993
HG97b; HG98b; HG99b; HG100b; HG101b; HG102b; HG103b; HG104b; HG105b; 7994
HG106b; HG107b; HG108b; HG109b; HG110b; HG111b; HG112b; HG113b; 7995
HG114b; HG115b; HG116b; HG117b; HG118b; HG119b; HG120b; HG121b; 7996
HG122b; HG123b; HG124b; HG125b; HG126b; HG127b; HG128b; HG129b; 7997
HG130b; HG131b; HG132b; HG133b; HG134b; HG135b; HG136b; HG137b; 7998

HG138b; HG139b; HG140b; HG141b; HG142b; HG143b; HG144b; HG145b; 7999

HG146b; HG147b; HG148b]. Two popular scientific research books in Scribd in the 8000
terms of high readers, 4093 and 5090 respectively, on neutrosophic science is on [HG32b; 8001
HG44b]. 8002

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 Bibliography 8003

HG1 [1] Henry Garrett, “Neutrosophic Co-degree and Neutrosophic Degree alongside Chromatic 8004

Numbers in the Setting of Some Classes Related to Neutrosophic Hypergraphs”, J Curr 8005
Trends Comp Sci Res 1(1) (2022) 06-14. 8006

HG2 [2] Henry Garrett, “Super Hyper Dominating and Super Hyper Resolving on Neutro- 8007

sophic Super Hyper Graphs and Their Directions in Game Theory and Neutrosophic 8008
Super Hyper Classes”, J Math Techniques Comput Math 1(3) (2022) 242-263. (doi: 8009
10.33140/JMTCM.01.03.09) 8010

HG3 [3] Henry Garrett, “Some Super Hyper Degrees and Co-Super Hyper Degrees on Neut- 8011
rosophic Super Hyper Graphs And Super Hyper Graphs Alongside Applications 8012
in Cancer’s Treatments”, J Math Techniques Comput Math 2(1) (2023) 35-47. 8013
(https://www.opastpublishers.com/open-access-articles/some-super-hyper-degrees-and- 8014
cosuper-hyper-degrees-on-neutrosophic-super-hyper-graphs-and-super-hyper-graphs- 8015

alongside-a.pdf) 8016

HG216 [4] Henry Garrett, “A Research on Cancers Recognition and Neutrosophic Super 8017
Hypergraph by Eulerian Super Hyper Cycles and Hamiltonian Sets as Hyper Cov- 8018

ering Versus Super separations”, J Math Techniques Comput Math 2(3) (2023) 8019
136-148. (https://www.opastpublishers.com/open-access-articles/a-research-on-cancers- 8020
recognition-and-neutrosophic-super-hypergraph-by-eulerian-super-hyper-cycles-and- 8021
hamiltonian-sets-.pdf) 8022

HG4 [5] Garrett, Henry. “0039 | Closing Numbers and Super-Closing Numbers as (Dual)Resolving 8023
and (Dual)Coloring alongside (Dual)Dominating in (Neutrosophic)n-SuperHyperGraph.” 8024
CERN European Organization for Nuclear Research - Zenodo, Nov. 2022. CERN 8025
European Organization for Nuclear Research, https://doi.org/10.5281/zenodo.6319942. 8026
https://oa.mg/work/10.5281/zenodo.6319942 8027

HG5 [6] Garrett, Henry. “0049 | (Failed)1-Zero-Forcing Number in Neutrosophic Graphs.” 8028
CERN European Organization for Nuclear Research - Zenodo, Feb. 2022. CERN 8029
European Organization for Nuclear Research, https://doi.org/10.13140/rg.2.2.35241.26724. 8030

https://oa.mg/work/10.13140/rg.2.2.35241.26724 8031

415
 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 8032
Cancer’s Recognition as the Model in The Setting of (Neutrosophic) SuperHyperGraphs”, 8033
Preprints 2023, 2023010308 (doi: 10.20944/preprints202301.0308.v1). 8034

HG7 [8] Henry Garrett, “Uncertainty On The Act And Effect Of Cancer Alongside The Foggy 8035
Positions Of Cells Toward Neutrosophic Failed SuperHyperClique inside Neutrosophic 8036
SuperHyperGraphs Titled Cancer’s Recognition”, Preprints 2023, 2023010282 (doi: 8037
10.20944/preprints202301.0282.v1). 8038

HG8 [9] Henry Garrett, “Neutrosophic Version Of Separates Groups Of Cells In Cancer’s 8039
Recognition On Neutrosophic SuperHyperGraphs”, Preprints 2023, 2023010267 (doi: 8040
10.20944/preprints202301.0267.v1). 8041

HG9 [10] Henry Garrett, “The Shift Paradigm To Classify Separately The Cells and Affected Cells 8042
Toward The Totality Under Cancer’s Recognition By New Multiple Definitions On the Sets 8043
Polynomials Alongside Numbers In The (Neutrosophic) SuperHyperMatching Theory Based 8044

on SuperHyperGraph and Neutrosophic SuperHyperGraph”, Preprints 2023, 2023010265 8045

(doi: 10.20944/preprints202301.0265.v1). 8046

HG10 [11] Henry Garrett, “Breaking the Continuity and Uniformity of Cancer In The Worst Case of 8047

Full Connections With Extreme Failed SuperHyperClique In Cancer’s Recognition Applied 8048
in (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010262,(doi: 10.20944/pre- 8049
prints202301.0262.v1). 8050

HG11 [12] Henry Garrett, “Neutrosophic Failed SuperHyperStable as the Survivors on the Cancer’s 8051
Neutrosophic Recognition Based on Uncertainty to All Modes in Neutrosophic SuperHy- 8052
perGraphs”, Preprints 2023, 2023010240 (doi: 10.20944/preprints202301.0240.v1). 8053

HG12 [13] Henry Garrett, “Extremism of the Attacked Body Under the Cancer’s Circumstances 8054
Where Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 8055
2023010224, (doi: 10.20944/preprints202301.0224.v1). 8056

HG13 [14] Henry Garrett, “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Recognitions 8057
And (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010105 (doi: 10.20944/pre- 8058
prints202301.0105.v1). 8059

HG14 [15] Henry Garrett, “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic 8060
SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints”, 8061
Preprints 2023, 2023010088 (doi: 10.20944/preprints202301.0088.v1). 8062

HG15 [16] Henry Garrett, “Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To 8063
Use Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond”, 8064
Preprints 2023, 2023010044 8065

HG16 [17] Henry Garrett, “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well- 8066
SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010043 (doi: 8067
10.20944/preprints202301.0043.v1). 8068

HG17 [18] Henry Garrett, “Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic) 8069
SuperHyperModeling in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs”, 8070

Preprints 2023, 2023010105 (doi: 10.20944/preprints202301.0105.v1). 8071

Henry Garrett · 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 8072
SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints”, 8073
Preprints 2023, 2023010088 (doi: 10.20944/preprints202301.0088.v1). 8074

HG19 [20] Henry Garrett, “(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions Featuring 8075
(Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, Preprints 2022, 2022120549 8076

(doi: 10.20944/preprints202212.0549.v1). 8077

HG20 [21] Henry Garrett, “(Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and 8078
SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With 8079
(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions And Related (Neutrosophic) 8080
SuperHyperClasses”, Preprints 2022, 2022120540 (doi: 10.20944/preprints202212.0540.v1). 8081

HG21 [22] Henry Garrett, “SuperHyperGirth on SuperHyperGraph and Neutrosophic SuperHyper- 8082
Graph With SuperHyperModeling of Cancer’s Recognitions”, Preprints 2022, 2022120500 8083
(doi: 10.20944/preprints202212.0500.v1). 8084

HG22 [23] Henry Garrett, “Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic 8085
SuperHyperGraphs and SuperHyperGraphs Alongside Applications in Cancer’s Treatments”, 8086
Preprints 2022, 2022120324 (doi: 10.20944/preprints202212.0324.v1). 8087

HG23 [24] Henry Garrett, “SuperHyperDominating and SuperHyperResolving on Neutrosophic Super- 8088
HyperGraphs And Their Directions in Game Theory and Neutrosophic SuperHyperClasses”, 8089
Preprints 2022, 2022110576 (doi: 10.20944/preprints202211.0576.v1). 8090

HG218 [25] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph 8091
By Trace-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 8092

10.5281/zenodo.7777857). 8093

HG215 [26] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 8094
By Trace-Decomposition As Hyper Decompress On Super Decompensation”, Zenodo 2023, 8095
(doi: 10.5281/zenodo.7771831). 8096

HG214 [27] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of Trace- 8097

Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 8098

2023, (doi: 10.5281/zenodo.7772468). 8099

HG213 [28] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 8100
By Trace-Cut As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 8101
10.13140/RG.2.2.20913.25446). 8102

HG212 [29] Henry Garrett, “New Ideas On Super Tract By Hyper Track Of Trace-Cut In 8103
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 8104
10.5281/zenodo.7764916). 8105

HG211 [30] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 8106
By Edge-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 8107

10.13140/RG.2.2.11770.98247). 8108

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 Henry Garrett · Independent Researcher · Department of Mathematics ·
DrHenryGarrett@gmail.com · Manhattan, NY, USA

HG210 [31] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Edge-Neighbor In 8109
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 8110
10.13140/RG.2.2.12400.12808). 8111

HG209 [32] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 8112
By Edge-Decomposition As Hyper Decompress On Super Decompensation”, ResearchGate 8113
2023, (doi: 10.13140/RG.2.2.22545.10089). 8114

HG208 [33] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of 8115
Edge-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 8116
ResearchGate 2023, (doi: 10.13140/RG.2.2.29544.34564). 8117

HG207 [34] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyper- 8118
Graph By Edge-Cut As Hyper Edify On Super Eddy”, ResearchGate 2023, (doi: 8119
10.13140/RG.2.2.11377.76644). 8120

HG206 [35] Henry Garrett, “New Ideas On Super Eddy By Hyper Edify Of Edge-Cut In Can- 8121
cer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 8122
10.13140/RG.2.2.23750.96329). 8123

HG205 [36] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 8124
By Vertex-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 8125
10.13140/RG.2.2.31366.24641). 8126

HG204 [37] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Vertex-Neighbor In 8127
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 8128
10.13140/RG.2.2.34721.68960). 8129

HG203 [38] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyper- 8130
Graph By Vertex-Decomposition As Hyper Decompress On Super Decompensation”, 8131
ResearchGate 2023, (doi: 10.13140/RG.2.2.30212.81289). 8132

HG202 [39] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of 8133
Vertex-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 8134
ResearchGate 2023, (doi: 10.13140/RG.2.2.18468.76169). 8135

HG201 [40] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyper- 8136
Graph By Vertex-Cut As Hyper Vertu On Super Vertigo”, ResearchGate 2023, (doi: 8137
10.13140/RG.2.2.24288.35842). 8138

HG200 [41] Henry Garrett, “New Ideas On Super Vertigo By Hyper Vertu Of Vertex-Cut In 8139
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 8140
10.13140/RG.2.2.32467.25124). 8141

HG199 [42] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 8142
By Stable-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 8143
10.13140/RG.2.2.31025.45925). 8144

HG198 [43] Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of Stable-Neighbor In 8145
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 8146

10.13140/RG.2.2.17184.25602). 8147

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 Henry Garrett · Independent Researcher · Department of Mathematics ·
DrHenryGarrett@gmail.com · Manhattan, NY, USA

HG197 [44] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 8148
By Stable-Decompositions As Hyper Stain On Super Stagy”, ResearchGate 2023, (doi: 8149
10.13140/RG.2.2.23423.28327). 8150

HG196 [45] Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Decompositions In 8151
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 8152
10.13140/RG.2.2.28456.44805). 8153

HG195 [46] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyper- 8154
Graph By Stable-Cut As Hyper Stain On Super Stagy”, ResearchGate 2023, (doi: 8155
10.13140/RG.2.2.23525.68320). 8156

HG194 [47] Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Cut In 8157
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 8158
10.13140/RG.2.2.20170.24000). 8159

HG193 [48] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 8160
By Clique-Neighbors As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 8161
10.13140/RG.2.2.36475.59683). 8162

HG192 [49] Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of Clique-Neighbors In 8163
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 8164
10.13140/RG.2.2.29764.71046). 8165

HG191 [50] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 8166
By Clique-Decompositions As Hyper Decompile On Super Decommission”, ResearchGate 8167
2023, (doi: 10.13140/RG.2.2.18780.87683). 8168

HG190 [51] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of 8169
Clique- Decompositions In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 8170
ResearchGate 2023, (doi: 10.13140/RG.2.2.27169.48487). 8171

HG189 [52] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyper- 8172
Graph By Clique-Cut As Hyper Click On Super Cliche”, ResearchGate 2023, (doi: 8173
10.13140/RG.2.2.26134.01603). 8174

HG188 [53] Henry Garrett, “New Ideas On Super Cliff By Hyper Cling Of Clique-Cut In 8175
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 8176
10.13140/RG.2.2.27392.30721). 8177

HG187 [54] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHy- 8178
perGraph By Space As Hyper Spin On Super Spacy”, ResearchGate 2023, (doi: 8179
10.13140/RG.2.2.33028.40321). 8180

HG186 [55] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyper- 8181
Graph By List- Coloring As Hyper List On Super Lisle”, ResearchGate 2023, (doi: 8182
10.13140/RG.2.2.21389.20966). 8183

HG185 [56] Henry Garrett, “New Ideas On Super Lith By Hyper Lite Of List-Coloring In 8184
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 8185

10.13140/RG.2.2.16356.04489). 8186

Henry Garrett · 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 [57] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHy- 8187
perGraph By Space As Hyper Sparse On Super Spark”, ResearchGate 2023, (doi: 8188
10.13140/RG.2.2.21756.21129). 8189

HG183 [58] Henry Garrett, “New Ideas On Super Solidarity By Hyper Soul Of Space In Can- 8190
cer’s Recognition With (Extreme) SuperHyperGraph”, ResearchGate 2023, (doi: 8191
10.13140/RG.2.2.30983.68009). 8192

HG182 [59] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 8193
By Edge-Connectivity As Hyper Disclosure On Super Closure”, ResearchGate 2023, (doi: 8194
10.13140/RG.2.2.28552.29445). 8195

HG181 [60] Henry Garrett, “New Ideas On Super Uniform By Hyper Deformation Of Edge- 8196
Connectivity In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Re- 8197
searchGate 2023, (doi: 10.13140/RG.2.2.10936.21761). 8198

HG180 [61] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 8199
By Vertex-Connectivity As Hyper Leak On Super Structure”, ResearchGate 2023, (doi: 8200
10.13140/RG.2.2.35105.89447). 8201

HG179 [62] Henry Garrett, “New Ideas On Super System By Hyper Explosions Of Vertex-Connectivity 8202
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, 8203
(doi: 10.13140/RG.2.2.30072.72960). 8204

HG178 [63] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 8205
By Tree-Decomposition As Hyper Forward On Super Returns”, ResearchGate 2023, (doi: 8206
10.13140/RG.2.2.31147.52003). 8207

HG177 [64] Henry Garrett, “New Ideas On Super Nodes By Hyper Moves Of Tree-Decomposition In 8208
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 8209
10.13140/RG.2.2.32825.24163). 8210

HG176 [65] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyper- 8211
Graph By Chord As Hyper Excellence On Super Excess”, ResearchGate 2023, (doi: 8212
10.13140/RG.2.2.13059.58401). 8213

HG175 [66] Henry Garrett, “New Ideas On Super Gap By Hyper Navigations Of Chord In 8214
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 8215
10.13140/RG.2.2.11172.14720). 8216

HG174 [67] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 8217
By SuperHyper(i,j)-Domination As Hyper Controller On Super Waves”, ResearchGate 8218
2023, (doi: 10.13140/RG.2.2.22011.80165). 8219

HG173 [68] Henry Garrett, “New Ideas On Super Coincidence By Hyper Routes Of SuperHyper(i,j)- 8220
Domination In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchG- 8221
ate 2023, (doi: 10.13140/RG.2.2.30819.84003). 8222

HG172 [69] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyper- 8223
Graph By SuperHyperEdge-Domination As Hyper Reversion On Super Indirection”, 8224

ResearchGate 2023, (doi: 10.13140/RG.2.2.10493.84962). 8225

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 Henry Garrett · Independent Researcher · Department of Mathematics ·
DrHenryGarrett@gmail.com · Manhattan, NY, USA

HG171 [70] Henry Garrett, “New Ideas On Super Obstacles By Hyper Model Of SuperHyperEdge- 8226
Domination In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchG- 8227
ate 2023, (doi: 10.13140/RG.2.2.13849.29280). 8228

HG170 [71] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 8229
By SuperHyperK-Domination As Hyper k-Actions On Super Patterns”, ResearchGate 8230
2023, (doi: 10.13140/RG.2.2.19944.14086). 8231

HG169 [72] Henry Garrett, “New Ideas On Super Harmony By Hyper k-Function Of SuperHyperK- 8232
Domination In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchG- 8233
ate 2023, (doi: 10.13140/RG.2.2.23299.58404). 8234

HG168 [73] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 8235
By SuperHyperK-Number As Hyper k-Partition On Super Layers”, ResearchGate 2023, 8236
(doi: 10.13140/RG.2.2.33103.76968). 8237

HG167 [74] Henry Garrett, “New Ideas On Super Gradient By Hyper k-Class Of SuperHyperK- 8238
Number In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 8239
2023, (doi: 10.13140/RG.2.2.23037.44003). 8240

HG166 [75] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 8241
By SuperHyperOrder As Hyper Enumerations On Super Landmarks”, ResearchGate 2023, 8242
(doi: 10.13140/RG.2.2.35646.56641). 8243

HG165 [76] Henry Garrett, “New Ideas On Super Analogous By Hyper Visions Of SuperHyperOrder 8244
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, 8245
(doi: 10.13140/RG.2.2.18030.48967). 8246

HG164 [77] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 8247
By SuperHyperColoring As Hyper Categories On Super Neighbors”, ResearchGate 2023, 8248
(doi: 10.13140/RG.2.2.13973.81121). 8249

HG163 [78] Henry Garrett, “New Ideas On Super Relations By Hyper Identifications Of SuperHyper- 8250
Coloring In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 8251
2023, (doi: 10.13140/RG.2.2.34106.47047). 8252

HG162 [79] Henry Garrett, “New Ideas On Super Contradiction By Hyper Detection of SuperHyper- 8253
Defensive In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 8254
ResearchGate 2023, (doi: 10.13140/RG.2.2.13397.09446). 8255

HG161 [80] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 8256
By SuperHyperDimension As Hyper Distinguishing On Super Distances”, ResearchGate 8257
2023, (doi: 10.13140/RG.2.2.31956.88961). 8258

HG160 [81] Henry Garrett, “New Ideas On Super Locations By Hyper Differing Of SuperHyperDi- 8259
mension In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 8260
2023, (doi: 10.13140/RG.2.2.15179.67361). 8261

HG159 [82] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 8262
By SuperHyperDominating As Hyper Closing On Super Messy”, ResearchGate 2023, (doi: 8263

10.13140/RG.2.2.21510.45125). 8264

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 Henry Garrett · Independent Researcher · Department of Mathematics ·
DrHenryGarrett@gmail.com · Manhattan, NY, USA

HG158 [83] Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDomin- 8265
ating In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 8266
2023, (doi: 10.13140/RG.2.2.13121.84321). 8267

HG157 [84] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 8268
By SuperHyperConnected As Hyper Group On Super Surge”, ResearchGate 2023, (doi: 8269
10.13140/RG.2.2.11758.69441). 8270

HG156 [85] Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of SuperHyperCon- 8271
nected In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 8272
2023, (doi: 10.13140/RG.2.2.31891.35367). 8273

HG155 [86] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 8274
By SuperHyperTotal As Hyper Covering On Super Infections”, ResearchGate 2023, (doi: 8275
10.13140/RG.2.2.19360.87048). 8276

HG154 [87] Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyper- 8277
Total In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 8278
2023, (doi: 10.13140/RG.2.2.32363.21286). 8279

HG153 [88] Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect 8280
In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, 8281
(doi: 10.13140/RG.2.2.23266.81602). 8282

HG152 [89] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 8283
By SuperHyperPerfect As Hyper Idealism On Super Vacancy”, ResearchGate 2023, (doi: 8284
10.13140/RG.2.2.19911.37285). 8285

HG151 [90] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 8286
By SuperHyperJoin As Hyper Separations On Super Sorts”, ResearchGate 2023, (doi: 8287
10.13140/RG.2.2.11050.90569). 8288

HG150 [91] Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of 8289
SuperHyperJoin In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, 8290
ResearchGate 2023, (doi: 10.13140/RG.2.2.17761.79206). 8291

HG149 [92] Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of SuperHy- 8292
perDuality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 8293
ResearchGate 2023, (doi: 10.13140/RG.2.2.34953.52320). 8294

HG148 [93] Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyper- 8295
Graph By SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, 8296
ResearchGate 2023, (doi: 10.13140/RG.2.2.33275.80161). 8297

HG147 [94] Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph 8298
By Path SuperHyperColoring As Hyper Correction On Super Faults”, ResearchGate 2023, 8299
(doi: 10.13140/RG.2.2.30182.50241). 8300

HG146 [95] Henry Garrett, “New Ideas On Super Reflections By Hyper Rotations Of Path SuperHy- 8301
perColoring In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 8302

ResearchGate 2023, (doi: 10.13140/RG.2.2.33459.30243). 8303

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 Henry Garrett · Independent Researcher · Department of Mathematics ·
DrHenryGarrett@gmail.com · Manhattan, NY, USA

HG145 [96] Henry Garrett, “New Ideas As Hyper Deformations On Super Chains In Cancer’s 8304
Neutrosophic Recognition and Neutrosophic SuperHyperGraph By SuperHyperDensity”, 8305
ResearchGate 2023, (doi: 10.13140/RG.2.2.13444.60806). 8306

HG144 [97] Henry Garrett, “New Ideas As Hyper Ignorance By SuperHyperDensity On Super 8307
Resistances In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 8308
ResearchGate 2023, (doi:10.13140/RG.2.2.16800.05123). 8309

HG143 [98] Henry Garrett, “New Research On Cancer’s Recognition and Neutrosophic SuperHyper- 8310
Graph By Eulerian SuperHyperCycles and Hamiltonian Sets As Hyper Covering Versus 8311
Super separations-VI”, ResearchGate 2023, (doi: 10.13140/RG.2.2.29913.80482). 8312

HG142 [99] Henry Garrett, “New Research On Cancer’s Recognition and Neutrosophic SuperHyper- 8313
Graph By Eulerian SuperHyperCycles and Hamiltonian Sets As Hyper Covering Versus 8314
Super separations-V”, ResearchGate 2023, (doi: 10.13140/RG.2.2.33269.24809). 8315

HG141 [100] Henry Garrett, “New Research On Cancer’s Recognition and Neutrosophic SuperHyper- 8316
Graph By Eulerian SuperHyperCycles and Hamiltonian Sets As Hyper Covering Versus 8317
Super separations-IV”, ResearchGate 2023, (doi: 10.13140/RG.2.2.34946.96960). 8318

HG140 [101] Henry Garrett, “A Research On Cancer’s Recognition and Neutrosophic SuperHyperGraph 8319
By Eulerian SuperHyperCycles and Hamiltonian Sets As Hyper Covering Versus Super 8320
separations-III”, ResearchGate 2023, (doi: 10.13140/RG.2.2.14814.31040). 8321

HG139 [102] Henry Garrett, “A Research On Cancer’s Recognition and Neutrosophic SuperHyperGraph 8322
By Eulerian SuperHyperCycles and Hamiltonian Sets As Hyper Covering Versus Super 8323
separations-II”, ResearchGate 2023, (doi: 10.13140/RG.2.2.15653.17125). 8324

HG138 [103] Henry Garrett, “A Research On Cancer’s Recognition and Neutrosophic SuperHyperGraph 8325
By Eulerian SuperHyperCycles and Hamiltonian Sets As Hyper Covering Versus Super 8326
separations-I”, ResearchGate 2023, (doi: 10.13140/RG.2.2.25719.50089). 8327

HG137 [104] Henry Garrett, “New Ideas On Super Disruptions In Cancer’s Extreme Recognition 8328
As Neutrosophic SuperHyperGraph By Hyper Plans Called SuperHyperConnectivities”, 8329
ResearchGate 2023, (doi: 10.13140/RG.2.2.29441.94562). 8330

HG136 [105] Henry Garrett, “Cancer’s Neutrosophic Recognition As Neutrosophic SuperHyperGraph 8331
By SuperHyperConnectivities As Hyper Diagnosis On Super Mechanism”, ResearchGate 8332
2023, (doi: 10.13140/RG.2.2.17252.24968). 8333

HG135 [106] Henry Garrett,“Cancer’s Recognition and (Neutrosophic) SuperHyperGraph By the 8334
Criteria of Eulerian and Hamiltonian Type-Sets As Hyper Modified Cycles On Super 8335
Mess”, ResearchGate 2023,(doi: 10.13140/RG.2.2.16652.59525). 8336

HG134 [107] Henry Garrett,“Eulerian and Hamiltonian In Cancer’s Neutrosophic Recognition and 8337
Neutrosophic SuperHyperGraph On Super Interactions By Hyper Extensions of Cycles”, 8338
ResearchGate 2023,(doi: 10.13140/RG.2.2.34583.24485). 8339

HG132 [108] Henry Garrett,“SuperHyperGirth Type-Results on extreme SuperHyperGirth theory and 8340
(Neutrosophic) SuperHyperGraphs Toward Cancer’s extreme Recognition”, Preprints 8341

2023, 2023010396 (doi: 10.20944/preprints202301.0396.v1). 8342

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 Henry Garrett · Independent Researcher · Department of Mathematics ·
DrHenryGarrett@gmail.com · Manhattan, NY, USA

HG131 [109] Henry Garrett,“Neutrosophic SuperHyperGraphs Warns Hyper Landmark of neutrosophic 8343
SuperHyperGirth In Super Type-Versions of Cancer’s neutrosophic Recognition”, Preprints 8344
2023, 2023010395 (doi: 10.20944/preprints202301.0395.v1). 8345

HG130 [110] Henry Garrett,“The Constructions of (Neutrosophic) SuperHyperGraphs on the Cancer’s 8346
Recognition in The Confrontation With Super Attacks In Hyper Situations By 8347
Implementing (Neutrosophic) 1-Failed SuperHyperForcing in The Technical Approaches to 8348
Neutralize SuperHyperViews”, ResearchGate 2023, (doi: 10.13140/RG.2.2.26240.51204). 8349

HG129 [111] Henry Garrett,“(Neutrosophic) 1-Failed SuperHyperForcing As the Entrepreneurs on 8350

Cancer’s Recognitions To Fail Forcing Style As the Super Classes With Hyper Effects 8351
In The Background of the Framework is So-Called (Neutrosophic) SuperHyperGraphs”, 8352
ResearchGate 2023, (doi: 10.13140/RG.2.2.12818.73925). 8353

HG128 [112] Henry Garrett,“Super Actions On The Types of Hyper Levels In The Sensible 8354
Neutrosophic SuperHyperGirth On Cancer’s Neutrosophic Recognition and Neutrosophic 8355
SuperHyperGraph”, ResearchGate 2023,(doi: 10.13140/RG.2.2.26836.88960). 8356

HG127 [113] Henry Garrett,“SuperHyperGirth Approaches on the Super Challenges on the Cancer’s 8357

Recognition In the Hyper Model of (Neutrosophic) SuperHyperGraph”, ResearchGate 8358

2023,(doi: 10.13140/RG.2.2.36745.93289). 8359

HG126 [114] Henry Garrett,“Extreme SuperHyperClique as the Firm Scheme of Confrontation under 8360
Cancer’s Recognition as the Model in The Setting of (Neutrosophic) SuperHyperGraphs”, 8361
Preprints 2023, 2023010308 (doi: 10.20944/preprints202301.0308.v1). 8362

HG125 [115] Henry Garrett,“Uncertainty On The Act And Effect Of Cancer Alongside The Foggy 8363
Positions Of Cells Toward Neutrosophic Failed SuperHyperClique inside Neutrosophic 8364
SuperHyperGraphs Titled Cancer’s Recognition”, Preprints 2023, 2023010282 (doi: 8365

10.20944/preprints202301.0282.v1). 8366

HG124 [116] Henry Garrett,“Neutrosophic Version Of Separates Groups Of Cells In Cancer’s 8367
Recognition On Neutrosophic SuperHyperGraphs”, Preprints 2023, 2023010267 (doi: 8368
10.20944/preprints202301.0267.v1).). 8369

HG123 [117] Henry Garrett, “The Shift Paradigm To Classify Separately The Cells and Affected 8370
Cells Toward The Totality Under Cancer’s Recognition By New Multiple Definitions On 8371
the Sets Polynomials Alongside Numbers In The (Neutrosophic) SuperHyperMatching 8372

Theory Based on SuperHyperGraph and Neutrosophic SuperHyperGraph”, Preprints 8373

2023, 2023010265 (doi: 10.20944/preprints202301.0265.v1). 8374

HG122 [118] Henry Garrett,“Breaking the Continuity and Uniformity of Cancer In The Worst Case of 8375
Full Connections With Extreme Failed SuperHyperClique In Cancer’s Recognition Applied 8376
in (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010262,(doi: 10.20944/pre- 8377
prints202301.0262.v1). 8378

HG121 [119] Henry Garrett, “Neutrosophic Failed SuperHyperStable as the Survivors on the 8379
Cancer’s Neutrosophic Recognition Based on Uncertainty to All Modes in Neutrosophic 8380

SuperHyperGraphs”, Preprints 2023, 2023010240 (doi: 10.20944/preprints202301.0240.v1). 8381

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 Henry Garrett · Independent Researcher · Department of Mathematics ·
DrHenryGarrett@gmail.com · Manhattan, NY, USA

HG120 [120] Henry Garrett, “Extremism of the Attacked Body Under the Cancer’s Circumstances 8382
Where Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 8383
2023010224, (doi: 10.20944/preprints202301.0224.v1). 8384

HG24 [121] Henry Garrett,“SuperHyperMatching By (R-)Definitions And Polynomials To Monitor 8385

Cancer’s Recognition In Neutrosophic SuperHyperGraphs”, ResearchGate 2023,(doi: 8386

10.13140/RG.2.2.35061.65767). 8387

HG25 [122] Henry Garrett,“The Focus on The Partitions Obtained By Parallel Moves In The 8388

Cancer’s Extreme Recognition With Different Types of Extreme SuperHyperMatching 8389

Set and Polynomial on (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 8390
10.13140/RG.2.2.18494.15680). 8391

HG26 [123] Henry Garrett,“Extreme Failed SuperHyperClique Decides the Failures on the Can- 8392

cer’s Recognition in the Perfect Connections of Cancer’s Attacks By SuperHy- 8393

perModels Named (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 8394
10.13140/RG.2.2.32530.73922). 8395

HG27 [124] Henry Garrett,“Indeterminacy On The All Possible Connections of Cells In Front 8396

of Cancer’s Attacks In The Terms of Neutrosophic Failed SuperHyperClique on Can- 8397

cer’s Recognition called Neutrosophic SuperHyperGraphs”, ResearchGate 2023, (doi: 8398
10.13140/RG.2.2.15897.70243). 8399

HG116 [125] Henry Garrett,“Extreme Failed SuperHyperClique Decides the Failures on the Can- 8400
cer’s Recognition in the Perfect Connections of Cancer’s Attacks By SuperHy- 8401
perModels Named (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 8402
10.13140/RG.2.2.32530.73922). 8403

HG115 [126] Henry Garrett, “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Recognitions 8404
And (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010105 (doi: 10.20944/pre- 8405
prints202301.0105.v1). 8406

HG28 [127] Henry Garrett,“Perfect Directions Toward Idealism in Cancer’s Neutrosophic Recogni- 8407

tion Forwarding Neutrosophic SuperHyperClique on Neutrosophic SuperHyperGraphs”, 8408

ResearchGate 2023, (doi: 10.13140/RG.2.2.30092.80004). 8409

HG29 [128] Henry Garrett,“Demonstrating Complete Connections in Every Embedded Regions 8410
and Sub-Regions in the Terms of Cancer’s Recognition and (Neutrosophic) Su- 8411

perHyperGraphs With (Neutrosophic) SuperHyperClique”, ResearchGate 2023, (doi: 8412

10.13140/RG.2.2.23172.19849). 8413

HG112 [129] Henry Garrett, “Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic) 8414

SuperHyperModeling in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs”, 8415

Preprints 2023, 2023010105 (doi: 10.20944/preprints202301.0105.v1). 8416

HG111 [130] Henry Garrett, “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic 8417
SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints”, 8418

Preprints 2023, 2023010088 (doi: 10.20944/preprints202301.0088.v1). 8419

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 Henry Garrett · Independent Researcher · Department of Mathematics ·
DrHenryGarrett@gmail.com · Manhattan, NY, USA

HG30 [131] Henry Garrett,“Different Neutrosophic Types of Neutrosophic Regions titled neut- 8420
rosophic Failed SuperHyperStable in Cancer’s Neutrosophic Recognition modeled 8421
in the Form of Neutrosophic SuperHyperGraphs”, ResearchGate 2023, (doi: 8422
10.13140/RG.2.2.17385.36968). 8423

HG107 [132] Henry Garrett, “Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction 8424
To Use Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition And 8425
Beyond”, Preprints 2023, 2023010044 8426

HG106 [133] Henry Garrett, “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well- 8427
SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010043 8428

(doi: 10.20944/preprints202301.0043.v1). 8429

HG31 [134] Henry Garrett, “Using the Tool As (Neutrosophic) Failed SuperHyperStable To SuperHy- 8430
perModel Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs”, ResearchGate 8431
2023, (doi: 10.13140/RG.2.2.28945.92007). 8432

HG32 [135] Henry Garrett, “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic 8433
SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints”, 8434
ResearchGate 2023, (doi: 10.13140/RG.2.2.11447.80803). 8435

HG33 [136] Henry Garrett, “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well- 8436
SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 8437
10.13140/RG.2.2.35774.77123). 8438

HG34 [137] Henry Garrett, “Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To 8439
Use Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond”, 8440

ResearchGate 2022, (doi: 10.13140/RG.2.2.36141.77287). 8441

HG35 [138] Henry Garrett, “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Re- 8442
cognitions And (Neutrosophic) SuperHyperGraphs”, ResearchGate 2022, (doi: 8443
10.13140/RG.2.2.29430.88642). 8444

HG36 [139] Henry Garrett, “Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic) 8445
SuperHyperModeling in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs”, 8446
ResearchGate 2022, (doi: 10.13140/RG.2.2.11369.16487). 8447

HG982 [140] Henry Garrett, “(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions Featuring 8448
(Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, Preprints 2022, 2022120549 8449
(doi: 10.20944/preprints202212.0549.v1). 8450

HG98 [141] Henry Garrett, “(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions Featuring 8451
(Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, ResearchGate 2022, (doi: 8452

10.13140/RG.2.2.19380.94084). 8453

HG972 [142] Henry Garrett, “(Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and 8454
SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With 8455
(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions And Related (Neutrosophic) 8456

SuperHyperClasses”, Preprints 2022, 2022120540 (doi: 10.20944/preprints202212.0540.v1). 8457

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 Henry Garrett · Independent Researcher · Department of Mathematics ·
DrHenryGarrett@gmail.com · Manhattan, NY, USA

HG97 [143] Henry Garrett, “(Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and 8458
SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With 8459
(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions And Related (Neutrosophic) 8460
SuperHyperClasses”, ResearchGate 2022, (doi: 10.13140/RG.2.2.14426.41923). 8461

HG962 [144] Henry Garrett, “SuperHyperGirth on SuperHyperGraph and Neutrosophic SuperHyper- 8462
Graph With SuperHyperModeling of Cancer’s Recognitions”, Preprints 2022, 2022120500 8463
(doi: 10.20944/preprints202212.0500.v1). 8464

HG96 [145] Henry Garrett, “SuperHyperGirth on SuperHyperGraph and Neutrosophic SuperHyper- 8465
Graph With SuperHyperModeling of Cancer’s Recognitions”, ResearchGate 2022 (doi: 8466
10.13140/RG.2.2.20993.12640). 8467

HG952 [146] Henry Garrett,“Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic Su- 8468

perHyperGraphs and SuperHyperGraphs Alongside Applications in Cancer’s Treatments”, 8469

Preprints 2022, 2022120324 (doi: 10.20944/preprints202212.0324.v1). 8470

HG95 [147] Henry Garrett, “Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic 8471
SuperHyperGraphs And SuperHyperGraphs Alongside Applications in Cancer’s Treat- 8472

ments”, ResearchGate 2022 (doi: 10.13140/RG.2.2.23123.04641). 8473

HG942 [148] Henry Garrett, “SuperHyperDominating and SuperHyperResolving on Neutrosophic 8474

SuperHyperGraphs And Their Directions in Game Theory and Neutrosophic SuperHyper- 8475
Classes”, Preprints 2022, 2022110576 (doi: 10.20944/preprints202211.0576.v1). 8476

HG94 [149] Henry Garrett, “SuperHyperDominating and SuperHyperResolving on Neutrosophic 8477

SuperHyperGraphs And Their Directions in Game Theory and Neutrosophic SuperHyper- 8478
Classes”, ResearchGate 2022 (doi: 10.13140/RG.2.2.23324.56966). 8479

HG37 [150] Henry Garrett, “Basic Neutrosophic Notions Concerning SuperHyperDominating and 8480
Neutrosophic SuperHyperResolving in SuperHyperGraph”, ResearchGate 2022 (doi: 8481
10.13140/RG.2.2.29173.86244). 8482

HG38 [151] Henry Garrett, “Initial Material of Neutrosophic Preliminaries to Study Some Neutrosophic 8483
Notions Based on Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic SuperHyper- 8484
Graph (NSHG)”, ResearchGate 2022 (doi: 10.13140/RG.2.2.25385.88160). 8485

HG148b [152] Henry Garrett, “Trace-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 8486
(doi: 10.5281/zenodo.7773119). 8487

HG147b [153] Henry Garrett, “SuperHyperDuality”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8488
odo.7637762). 8489

HG146b [154] Henry Garrett, “Trace-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 8490
10.5281/zenodo.7766174). 8491

HG145b [155] Henry Garrett, “Edge-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 8492
10.5281/zenodo.7762232). 8493

HG144b [156] Henry Garrett, “Edge-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 8494

(doi: 10.5281/zenodo.7758601). 8495

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 Henry Garrett · Independent Researcher · Department of Mathematics ·
DrHenryGarrett@gmail.com · Manhattan, NY, USA

HG143b [157] Henry Garrett, “Edge-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 8496
10.5281/zenodo.7754661). 8497

HG142b [158] Henry Garrett, “Vertex-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 8498
10.5281/zenodo.7750995) . 8499

HG141b [159] Henry Garrett, “Vertex-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 8500
(doi: 10.5281/zenodo.7749875). 8501

HG140b [160] Henry Garrett, “Vertex-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 8502
10.5281/zenodo.7747236). 8503

HG139b [161] Henry Garrett, “Stable-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 8504
10.5281/zenodo.7742587). 8505

HG138b [162] Henry Garrett, “Stable-Decompositions In SuperHyperGraphs”. Dr. Henry Garrett, 2023 8506
(doi: 10.5281/zenodo.7738635). 8507

HG137b [163] Henry Garrett, “Stable-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 8508
10.5281/zenodo.7734719). 8509

HG136b [164] Henry Garrett, “Clique-Neighbors In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 8510
10.5281/zenodo.7730484). 8511

HG135b [165] Henry Garrett, “Clique-Decompositions In SuperHyperGraphs”. Dr. Henry Garrett, 2023 8512

(doi: 10.5281/zenodo.7730469). 8513

HG134b [166] Henry Garrett, “Clique-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 8514
10.5281/zenodo.7722865). 8515

HG133b [167] Henry Garrett, “Space In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8516
odo.7713563). 8517

HG132b [168] Henry Garrett, “Space In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8518

odo.7709116). 8519

HG131b [169] Henry Garrett, “Edge-Connectivity In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 8520
10.5281/zenodo.7706415). 8521

HG130b [170] Henry Garrett, “Vertex-Connectivity In SuperHyperGraphs”. Dr. Henry Garrett, 2023 8522
(doi: 10.5281/zenodo.7706063). 8523

HG129b [171] Henry Garrett, “Tree-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 8524

(doi: 10.5281/zenodo.7701906). 8525

HG128b [172] Henry Garrett, “Chord In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8526
odo.7700205). 8527

HG127b [173] Henry Garrett, “(i,j)-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 8528
10.5281/zenodo.7694876). 8529

HG126b [174] Henry Garrett, “Edge-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 8530

10.5281/zenodo.7679410). 8531

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 Henry Garrett · Independent Researcher · Department of Mathematics ·
DrHenryGarrett@gmail.com · Manhattan, NY, USA

HG125b [175] Henry Garrett, “K-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 8532
10.5281/zenodo.7675982). 8533

HG124b [176] Henry Garrett, “K-Number In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 8534
10.5281/zenodo.7672388). 8535

HG123b [177] Henry Garrett, “Order In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8536
odo.7668648). 8537

HG122b [178] Henry Garrett, “Coloring In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 8538
10.5281/zenodo.7662810). 8539

HG121b [179] Henry Garrett, “Dimension In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 8540
10.5281/zenodo.7659162). 8541

HG120b [180] Henry Garrett, “Cancer In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8542
odo.7653233). 8543

HG119b [181] Henry Garrett, “SuperHyperWheel”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8544
odo.7653204). 8545

HG118b [182] Henry Garrett, “SuperHyperMultipartite”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8546
odo.7653142). 8547

HG117b [183] Henry Garrett, “SuperHyperBipartite”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8548

odo.7653117). 8549

HG116b [184] Henry Garrett, “SuperHyperStar”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8550
odo.7653089). 8551

HG115b [185] Henry Garrett, “SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8552
odo.7651687). 8553

HG114b [186] Henry Garrett, “SuperHyperPath”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8554

odo.7651619). 8555

HG113b [187] Henry Garrett, “SuperHyperDomination”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8556
odo.7651439). 8557

HG112b [188] Henry Garrett, “SuperHyperDominating”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8558
odo.7650729). 8559

HG111b [189] Henry Garrett, “SuperHyperConnected”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8560

odo.7647868). 8561

HG110b [190] Henry Garrett, “SuperHyperTotal”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8562
odo.7647017). 8563

HG109b [191] Henry Garrett, “SuperHyperPerfect”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8564
odo.7644894). 8565

HG108b [192] Henry Garrett, “SuperHyperJoin”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8566

odo.7641880). 8567

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 Henry Garrett · Independent Researcher · Department of Mathematics ·
DrHenryGarrett@gmail.com · Manhattan, NY, USA

HG107b [193] Henry Garrett, “Path SuperHyperColoring”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8568
odo.7632923). 8569

HG106b [194] Henry Garrett, “SuperHyperDensity”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8570
odo.7623459). 8571

HG105b [195] Henry Garrett, “Neutrosophic SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 8572
10.5281/zenodo.7606416). 8573

HG104b [196] Henry Garrett, “Extreme SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 8574
10.5281/zenodo.7606416). 8575

HG103b [197] Henry Garrett, “SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8576
odo.7606404). 8577

HG102b [198] Henry Garrett, “Neutrosophic SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 8578
10.5281/zenodo.7580018). 8579

HG101b [199] Henry Garrett, “Extreme SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8580
odo.7580018). 8581

HG100b [200] Henry Garrett, “Extreme SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8582
odo.7580018). 8583

HG99b [201] Henry Garrett, “SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8584

odo.7579929). 8585

HG98b [202] Henry Garrett, “Neutrosophic SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 8586
10.5281/zenodo.7563170). 8587

HG97b [203] Henry Garrett, “Extreme SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8588
odo.7563164). 8589

HG96b [204] Henry Garrett, “SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8590

odo.7563160). 8591

HG95b [205] Henry Garrett, “Extreme SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8592
odo.7563160). 8593

HG94b [206] Henry Garrett, “Overlook On SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 8594
10.5281/zenodo.7563160). 8595

HG93b [207] Henry Garrett, “Neutrosophic SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 8596

10.5281/zenodo.7557063). 8597

HG92b [208] Henry Garrett, “Extreme SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 8598
10.5281/zenodo.7557009). 8599

HG91b [209] Henry Garrett, “Overlook On SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 8600
10.5281/zenodo.7539484). 8601

HG90b [210] Henry Garrett, “Neutrosophic Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 8602

10.5281/zenodo.7523390). 8603

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 Henry Garrett · Independent Researcher · Department of Mathematics ·
DrHenryGarrett@gmail.com · Manhattan, NY, USA

HG89b [211] Henry Garrett, “Extreme Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 8604
10.5281/zenodo.7523390). 8605

HG88b [212] Henry Garrett, “Overlook On Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 8606
10.5281/zenodo.7523390). 8607

HG87b [213] Henry Garrett, “Extreme SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8608
odo.7574952). 8609

HG86b [214] Henry Garrett, “Neutrosophic SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 8610
10.5281/zenodo.7574992). 8611

HG85b [215] Henry Garrett, “Extreme SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8612
odo.7523357). 8613

HG84b [216] Henry Garrett, “Overlook On SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 8614
10.5281/zenodo.7523357). 8615

HG83b [217] Henry Garrett, “Neutrosophic Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 8616
10.5281/zenodo.7504782). 8617

HG82b [218] Henry Garrett, “Extreme Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 8618
10.5281/zenodo.7504782). 8619

HG81b [219] Henry Garrett, “Overlook On Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 8620

10.5281/zenodo.7504782). 8621

HG80b [220] Henry Garrett, “Neutrosophic SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 8622
10.5281/zenodo.7499395). 8623

HG79b [221] Henry Garrett, “Extreme SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8624
odo.7499395). 8625

HG78b [222] Henry Garrett, “Overlook On SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 8626

10.5281/zenodo.7499395). 8627

HG77b [223] Henry Garrett, “Neutrosophic Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 8628
10.5281/zenodo.7497450). 8629

HG76b [224] Henry Garrett, “Extreme Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 8630
10.5281/zenodo.7497450). 8631

HG75b [225] Henry Garrett, “Neutrosophic SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 8632

10.5281/zenodo.7494862). 8633

HG74b [226] Henry Garrett, “Extreme SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8634
odo.7494862). 8635

HG73b [227] Henry Garrett, “Overlook On SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 8636
10.5281/zenodo.7494862). 8637

HG72b [228] Henry Garrett, “Neutrosophic SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 8638

10.5281/zenodo.7493845). 8639

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 Henry Garrett · Independent Researcher · Department of Mathematics ·
DrHenryGarrett@gmail.com · Manhattan, NY, USA

HG71b [229] Henry Garrett, “Extreme SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 8640
10.5281/zenodo.7493845). 8641

HG70b [230] Henry Garrett, “Overlook On SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 8642
10.5281/zenodo.7493845). 8643

HG69b [231] Henry Garrett, “SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8644
odo.7539484). 8645

HG68b [232] Henry Garrett, “Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8646

odo.7523390). 8647

HG67b [233] Henry Garrett, “SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8648
odo.7523357). 8649

HG66b [234] Henry Garrett, “Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8650
odo.7504782). 8651

HG65b [235] Henry Garrett, “SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8652
odo.7499395). 8653

HG64b [236] Henry Garrett, “Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8654
odo.7497450). 8655

HG63b [237] Henry Garrett, “SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8656

odo.7494862). 8657

HG62b [238] Henry Garrett, “SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8658
odo.7493845). 8659

HG61b [239] Henry Garrett, “SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8660
odo.7480110). 8661

HG60b [240] Henry Garrett, “Neut. SuperHyperEdges”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8662
odo.7378758). 8663

HG32b [241] Henry Garrett, “Beyond Neutrosophic Graphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8664
odo.6320305). 8665

HG44b [242] Henry Garrett, “Neutrosophic Duality”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 8666

odo.6677173). 8667

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 CHAPTER 44 8668

Books’ Contributions 8669

“Books’ Contributions”: | Featured Threads 8670

The following references are cited by chapters. 8671

8672
[Ref217] 8673
Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Trace-Neighbor In 8674
Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zen- 8675
odo.7779286). 8676
8677

[Ref218] 8678
Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph 8679
By Trace-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 10.5281/zen- 8680
odo.7777857). 8681
8682
The links to the contributions of this scientific research book are listed below. 8683

[HG217 8684
Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Trace-Neighbor In 8685
Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zen- 8686
odo.7779286). 8687
8688
[TITLE] “New Ideas On Super Nebulous By Hyper Nebbish Of Trace-Neighbor In Re- 8689

cognition of Cancer With (Neutrosophic) SuperHyperGraph” 8690

8691
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ResearchGate”] 8692
https://www.researchgate.net/publication/369588536 8693
8694
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “Scribd”:] 8695

https://www.scribd.com/document/634422675 8696
8697
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ZENODO_ORG”:] 8698
https://zenodo.org/record/7779286 8699
8700
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “academia”:] 8701

https://www.academia.edu/99237492 8702

433
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 Trace-
Neighbor In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi:
10.5281/zenodo.7779286).

8703
[ADDRESSED CITATION] 8704
Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Trace-Neighbor In 8705
Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zen- 8706
odo.7779286). 8707
[ASSIGNED NUMBER] #217 Article 8708

[DATE] March 2023 8709

[DOI] 10.5281/zenodo.7779286 8710
[LICENSE] CC BY-NC-ND 4.0 8711
[PROJECT] Neutrosophic SuperHyperGraphs and SuperHyperGraphs 8712
[AVAILABLE AT TWITTER’S IDS] WordPress ResearchGate Scribd academia ZEN- 8713
ODO_ORG Twitter facebook LinkedIn Amazon googlebooks GooglePlay 8714

8715
[HG218] 8716
Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph 8717
By Trace-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 10.5281/zen- 8718
odo.7777857). 8719
8720

[TITLE] “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph By 8721

Trace-Neighbor As Hyper Nebbish On Super Nebulous” 8722
8723
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ResearchGate”] 8724
https://www.researchgate.net/publication/369561067 8725
8726

[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “Scribd”:] 8727

Henry Garrett · 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 Trace-
Neighbor In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi:
10.5281/zenodo.7779286).

Figure 44.3: Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Trace-
Neighbor In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi:
10.5281/zenodo.7779286).

Henry Garrett · 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 Trace-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023,
(doi: 10.5281/zenodo.7777857).

https://www.scribd.com/document/634317561 8728
8729
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ZENODO_ORG”:] 8730
https://zenodo.org/record/7777857 8731
8732
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “academia”:] 8733

https://www.academia.edu/99219432 8734
8735
[ADDRESSED CITATION] 8736
Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph 8737
By Trace-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 10.5281/zen- 8738
odo.7777857). 8739

[ASSIGNED NUMBER] #218 Article 8740

[DATE] March 2023 8741
[DOI] 10.5281/zenodo.7777857 8742
[LICENSE] CC BY-NC-ND 4.0 8743
[PROJECT] Neutrosophic SuperHyperGraphs and SuperHyperGraphs 8744
[AVAILABLE AT TWITTER’S IDS] 8745

WordPress ResearchGate Scribd academia ZENODO_ORG Twitter facebook LinkedIn Amazon 8746
googlebooks GooglePlay 8747
8748
[ASSIGNED NUMBER] | Book #149 8749
[ADDRESSED CITATION] 8750
Henry Garrett, “Trace-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: -). 8751

[TITLE] Trace-Neighbor In SuperHyperGraphs 8752

Henry Garrett · 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 Trace-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023,
(doi: 10.5281/zenodo.7777857).

Figure 44.6: Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic
SuperHyperGraph By Trace-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023,
(doi: 10.5281/zenodo.7777857).

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics ·
DrHenryGarrett@gmail.com · Manhattan, NY, USA

#Latest_Updates 8753
#The_Links 8754
[AVAILABLE AT TWITTER’S IDS] 8755
WordPress ResearchGate Scribd academia ZENODO_ORG Twitter facebook LinkedIn Amazon 8756
googlebooks GooglePlay 8757
8758

#Latest_Updates 8759
8760
#The_Links 8761
8762
[ASSIGNED NUMBER] | Book #149 8763

8764
[TITLE] Trace-Neighbor In SuperHyperGraphs 8765
8766
[AVAILABLE AT TWITTER’S IDS] 8767
WordPress ResearchGate Scribd academia ZENODO_ORG Twitter facebook LinkedIn Amazon 8768
googlebooks GooglePlay 8769
8770

– 8771
8772
[PUBLISHER] 8773
(Paperback): https://www.amazon.com/dp/- 8774
(Hardcover): https://www.amazon.com/dp/- 8775

(Kindle Edition): https://www.amazon.com/dp/- 8776

8777
– 8778
8779
[ISBN] 8780
(Paperback): - 8781

(Hardcover): - 8782
(Kindle Edition): CC BY-NC-ND 4.0 8783
(EBook): CC BY-NC-ND 4.0 8784
8785
– 8786
8787

[PRINT LENGTH] 8788

(Paperback): - pages 8789
(Hardcover): - pages 8790
(Kindle Edition): - pages 8791
(E-Book): - pages 8792
8793

– 8794
8795
#Latest_Updates 8796
8797
#The_Links 8798

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 Henry Garrett · Independent Researcher · Department of Mathematics ·
DrHenryGarrett@gmail.com · Manhattan, NY, USA

8799
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ResearchGate”] 8800
https://www.researchgate.net/publication/- 8801
8802
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “WordPress”] 8803
https://drhenrygarrett.wordpress.com/2023/04/22/Trace-Neighbor-In-SuperHyperGraphs/ 8804

8805
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “Scribd”] 8806
https://www.scribd.com/document/- 8807
8808
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “academia”] 8809

https://www.academia.edu/- 8810
8811
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ZENODO_ORG”] 8812
https://zenodo.org/record/- 8813
8814
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “googlebooks”] 8815

https://books.google.com/books/about?id=- 8816
8817
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “GooglePlay”] 8818
https://play.google.com/store/books/details?id=- 8819
8820
8821

Henry Garrett · 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.7: [HG148b] Henry Garrett, “Trace-Neighbor In SuperHyperGraphs”. Dr. Henry

Garrett, 2023 (doi: 10.5281/zenodo.7773119).

[TITLE] Trace-Neighbor In SuperHyperGraphs (Published Version) 8822

8823
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “WordPress”] 8824
8825
https://drhenrygarrett.wordpress.com/2023/04/22/Trace-Neighbor-In-SuperHyperGraphs/ 8826
8827
– 8828

8829
[POSTED BY] Dr. Henry Garrett 8830
8831
[DATE] March 029, 2023 8832
8833
[POSTED IN] 0149 | Trace-Neighbor In SuperHyperGraphs 8834

8835
[TAGS] 8836
Applications, Applied Mathematics, Applied Research, Cancer, Cancer’s Recognitions, Combin- 8837
atorics, Edge, Edges, Graph Theory, Graphs, Latest Research, Literature Reviews, Modeling, 8838
Neutrosophic Graph, Neutrosophic Graph Theory, Neutrosophic Science, Neutrosophic Su- 8839
perHyperClasses, Neutrosophic SuperHyperGraph, Neutrosophic SuperHyperGraph Theory, 8840

neutrosophic SuperHyperGraphs, Neutrosophic Trace-Neighbor In SuperHyperGraphs, Open 8841

Problems, Open Questions, Problems, Pure Math, Pure Mathematics, Questions, Real-World 8842
Applications, Recent Research, Recognitions, Research, scientific research Article, scientific re- 8843
search Articles, scientific research Book, scientific research Chapter, scientific research Chapters, 8844
Review, SuperHyperClasses, SuperHyperEdges, SuperHyperGraph, SuperHyperGraph Theory, 8845
SuperHyperGraphs, Trace-Neighbor In SuperHyperGraphs, SuperHyperModeling, SuperHyper- 8846

Vertices, Theoretical Research, Vertex, Vertices. 8847

Henry Garrett · 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.8: [HG148b] Henry Garrett, “Trace-Neighbor In SuperHyperGraphs”. Dr. Henry

Garrett, 2023 (doi: 10.5281/zenodo.7773119).

Figure 44.9: [HG148b] Henry Garrett, “Trace-Neighbor In SuperHyperGraphs”. Dr. Henry

Garrett, 2023 (doi: 10.5281/zenodo.7773119).

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics ·
DrHenryGarrett@gmail.com · Manhattan, NY, USA

In this scientific research book, there are some scientific research chapters on “Extreme an 8848
Extreme In SuperHyperGraphs” and “Neutrosophic an Extreme In SuperHyperGraphs” about 8849
some researches on Extreme an Extreme In SuperHyperGraphs and neutrosophic an Extreme 8850
In SuperHyperGraphs. 8851

Henry Garrett · Independent Researcher · Department of Mathematics ·

DrHenryGarrett@gmail.com · Manhattan, NY, USA
 CHAPTER 45 8852

“SuperHyperGraph-Based Books”: | 8853

Featured Tweets 8854

“SuperHyperGraph-Based Books”: | Featured Tweets 8855

443
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 8856

CV 8857

471
 8858
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

 8859
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)
 8860
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett @gmail.com · Manhattan, NY, USA

Publications: Articles

2023 184 Manuscript

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/-
@ZENODOO RG : 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/-
@ZENODOO RG : 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/-
@ZENODOO RG : 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/-
@ZENODOO RG : 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/-
@ZENODOO RG : https : //zenodo.org/record/7705887
@academia: https://www.academia.edu/98103871

2023 179 Manuscript

 8861
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/-
@ZENODOO RG : 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/-
@ZENODOO RG : 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/-
@ZENODOO RG : 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
@ZENODOO RG : 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/-
@ZENODOO RG : https : //zenodo.org/record/7700125
@academia: https://www.academia.edu/97976111

2023 174 Manuscript

 8862
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
@ZENODOO RG : 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/-
@ZENODOO RG : 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/-
@ZENODOO RG : 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/-
@ZENODOO RG : 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
@ZENODOO RG : https : //zenodo.org/record/7675903
@academia: https://www.academia.edu/97484903

2023 169 Manuscript

 8863
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
@ZENODOO RG : 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
@ZENODOO RG : 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
@ZENODOO RG : 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
@ZENODOO RG : 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
@ZENODOO RG : https : //zenodo.org/record/7668620
@academia: https://www.academia.edu/97378363

2023 164 Manuscript

 8864
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
@ZENODOO RG : 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
@ZENODOO RG : 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
@ZENODOO RG : 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
@ZENODOO RG : 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
@ZENODOO RG : 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
 8865
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

 8866
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

 8867
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

 8868
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

 8869
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
 8870
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
 8871
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
 8872
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
 8873
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
 8874
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
 8875
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
 8876
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
 8877
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
 8878
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
 8879
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
 8880
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
 8881
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
 8882
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
 8883
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
 8884
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett @gmail.com · Manhattan, NY, USA

Publications: Books

2023 0127 | Space In SuperHyperGraphs Amazon

@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/-
@ZENODOO RG : 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

2023 0126 | Edge-Connectivity In SuperHyperGraphs Amazon

@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/-
@ZENODOO RG : https : //zenodo.org/record/7706415
@academia:https://www.academia.edu/98110249

(Paperback): https://www.amazon.com/dp/B0BXNDNSNQ
(Hardcover): https://www.amazon.com/dp/-
(Kindle Edition): https://www.amazon.com/dp/B0BXQTPCWV
ISBN
(Paperback): 9798386227593
(Hardcover): -
(Kindle Edition): CC BY-NC-ND 4.0

2023 0125 | Vertex-Connectivity In SuperHyperGraphs Amazon

@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/-
@ZENODOO RG : 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
 8885
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett @gmail.com · Manhattan, NY, USA
2023 0124 | Tree-Decomposition In SuperHyperGraphs Amazon

@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/-
@ZENODOO RG : 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

2023 0123 | Chord In SuperHyperGraphs Amazon

@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/-
@ZENODOO RG : 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

2023 0122 | (i,j)-Domination In SuperHyperGraphs Amazon

@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/-
@ZENODOO RG : 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

2023 0121 | Edge-Domination In SuperHyperGraphs Amazon

 8886
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett @gmail.com · Manhattan, NY, USA

@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/-
@ZENODOO RG : 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

2023 0120 | K-Domination In SuperHyperGraphs Amazon

@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/-
@ZENODOO RG : 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

2023 0119 | K-Number In SuperHyperGraphs Amazon

@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/- @ZENODOO RG : 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

2023 0118 | Order In SuperHyperGraphs Amazon

 8887
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett @gmail.com · Manhattan, NY, USA

@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/-
@ZENODOO RG : 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

2023 0117 | Coloring In SuperHyperGraphs Amazon

@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/-
@ZENODOO RG : 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

2023 116 | Dimension In SuperHyperGraphs Amazon

@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/- @ZENODOO RG : 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

2023 - Amazon
 8888
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett @gmail.com · Manhattan, NY, USA
“ 115th Book
|| Cancer in SuperHyperGraphs
Link (Paperback): https://www.amazon.com/dp/B0BW3BK14G
(Hardcover): https://www.amazon.com/dp/B0BW2K9GPL (Kindle Edition):
https://www.amazon.com/dp/B0BW6JCNY1
ISBN (Paperback): 9798378064847 (Hardcover): 9798378065530 (Kindle Edition): CC BY-NC-
ND 4.0

2023 115- Amazon

Cancer in SuperHyperGraphs

@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/-
@ZENODOO RG : https : //zenodo.org/record/7653233
@academia:https://www.academia.edu/97119655

2023 - Amazon

“ 114th Book
|| 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

2023 - Amazon

“ 114th
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/-
@ZENODOO RG : https : //zenodo.org/record/7653204
@academia:https://www.academia.edu/97118644

2023 - Amazon

“ 113rd Book
|| 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 - Amazon

“ 113rd”
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/-
@ZENODOO RG : https : //zenodo.org/record/7653142
@academia:https://www.academia.edu/97116637
 8889
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett @gmail.com · Manhattan, NY, USA
2023 - Amazon

“ 112nd Book”
|| 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

2023 - Amazon

“ 112nd”
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/-
@ZENODOO RG : https : //zenodo.org/record/7653117
@academia:https://www.academia.edu/97115621

2023 - Amazon

“ 111st Book”
|| 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 - Amazon

“ 111st”
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/-
@ZENODOO RG : https : //zenodo.org/record/7653089
@academia:https://www.academia.edu/97114710

2023 - Amazon

“ 110th Book”
|| 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 - Amazon

“ 110th”
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/-
@ZENODOO RG : https : //zenodo.org/record/7651687
@academia:https://www.academia.edu/97088922
 8890
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett @gmail.com · Manhattan, NY, USA
2023 - Amazon

“ 109th Book”
|| 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

2023 - Amazon

“ 109th”
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
@ZENODOO RG : https : //zenodo.org/record/7651619
@academia:https://www.academia.edu/97086960

2023 - Amazon

“ 108th Book”
|| 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 - Amazon

“ 108th”
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/-
@ZENODOO RG : https : //zenodo.org/record/7651439
@academia:https://www.academia.edu/97082532

2023 - Amazon

“ 107th Book”
|| SuperHyperDominating
Link (Paperback): https://www.amazon.com/dp/B0BW2K99NB (Hardcover):
https://www.amazon.com/dp/B0BW2PWT1G (Kindle Edition):
https://www.amazon.com/dp/B0BW4SFRXP
ISBN (Paperback): 9798377922339 (Hardcover): 9798377923053 (Kindle Edition): CC BY-
NC-ND 4.0

2023 - Amazon

“ 107th”
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
@ZENODOO RG : https : //zenodo.org/record/7650729
@academia:https://www.academia.edu/97071295
 8891
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett @gmail.com · Manhattan, NY, USA
2023 - Amazon

“ 106th Book”
|| 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

2023 - Amazon

“ 106th”
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/-
@ZENODOO RG : https : //zenodo.org/record/7647868
@academia:https://www.academia.edu/97033545

2023 - Amazon

“ 105th Book”

|| 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

2023 - Amazon

“ 105th”
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/-
@ZENODOO RG : https : //zenodo.org/record/7647017
@academia:https://www.academia.edu/97015085

2023 - Amazon

“ 104th Book”

|| 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 - Amazon
 8892
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett @gmail.com · Manhattan, NY, USA
“ 104th”
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/-
@ZENODOO RG : https : //zenodo.org/record/7644894
@academia:https://www.academia.edu/96976482

2023 - Amazon

“ 103rd Book”

|| 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

2023 - Amazon

“ 103rd”
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
@ZENODOO RG : https : //zenodo.org/record/7641880
@academia: https://www.academia.edu/96922889

2023 - Amazon

“ 102nd Book”

|| SuperHyperDuality
Link (Paperback): https://www.amazon.com/dp/B0BVPMX6C4 (Hardcover):
https://www.amazon.com/dp/B0BVNTYX6M (Kindle Edition):
ISBN (Paperback): 9798377344674 (Hardcover): 9798377346043 (Kindle Edition): CC BY-NC-
ND 4.0

2023 - Amazon

“ 102nd”
SuperHyperDuality
@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://drhenrygarrett.wordpress.com/2023/02/14/superhyperduality
@Scribd: https://www.scribd.com/document/625758800
@ZENODOO RG : https : //zenodo.org/record/7637762
@academia: https://www.academia.edu/96858234

2023 - Amazon

“ 101st Book”

|| Path SuperHyperColoring
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
 8893
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett @gmail.com · Manhattan, NY, USA
2023 - Amazon

“ 101st Book”

|| 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
@ZENODOO RG : https : //zenodo.org/record/7632923
@academia: https://www.academia.edu/96737450

2023 - Amazon

“ 100th Book”

|| SuperHyperDensity
@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
@ZENODOO RG : https : //zenodo.org/record/7623459
@academia: https://www.academia.edu/96571852

2023 - Amazon

“ 100th Book”

|| 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

2023 - Amazon

Book 99 || “Neutrosophic SuperHyperConnectivities”

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
@ZENODOO RG : https : //zenodo.org/record/7606434
@academia:https://www.academia.edu/96305174

2023 - Amazon

Book 99 || “Neutrosophic SuperHyperConnectivities”

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

2023 - Amazon

Book 98 || “Extreme SuperHyperConnectivities”

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
@ZENODOO RG : https : //zenodo.org/record/7606416
@academia:https://www.academia.edu/96304920
 8894
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett @gmail.com · Manhattan, NY, USA
2023 - Amazon

Book 98 || “Extreme SuperHyperConnectivities”

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

2023 - Amazon

Book 97 || “SuperHyperConnectivities”

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
@ZENODOO RG : https : //zenodo.org/record/7606404
@academia: https://www.academia.edu/96304608

2023 - Amazon

Book 96 || “Neutrosophic SuperHyperCycle”

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
@ZENODOO RG : https : //zenodo.org/record/7580018
@academia: https://www.academia.edu/95870656
@WordPress: -

2023 - Amazon

Book 96 || “Neutrosophic SuperHyperCycle”

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

2023 - Amazon

Book 95 || “Extreme SuperHyperCycle”

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
@ZENODOO RG : https : //zenodo.org/record/7580018
@academia: https://www.academia.edu/95870656
@WordPress: -

2023 - Amazon

Book 95 || “Extreme SuperHyperCycle”

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 - Amazon
 8895
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett @gmail.com · Manhattan, NY, USA

Book 94 || “SuperHyperCycle”

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
@ZENODOO RG : https : //zenodo.org/record/7579929
@academia: https://www.academia.edu/95868812
@WordPress: -

2023 - Amazon

0092 | Neutrosophic SuperHyperGirth

https://amazon.com/dp/B0BSV66BWV
https://amazon.com/dp/B0BSV7CZH4
9798374731323
9798374736922
CC BY-NC-ND 4.0
@WordPress: -
@Scribd: -
@ResearchGate: https://www.researchgate.net/publication/367351622
@ZENODOO RG : https : //zenodo.org/record/7563170
@academia: https://www.academia.edu/95563414

2023 - Amazon

0091 | Extreme SuperHyperGirth

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: -
@ZENODOO RG : https : //zenodo.org/record/7563164
@academia: https://www.academia.edu/95563241

2023 - Amazon

0070 | SuperHyperGirth
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 - Amazon

“Neutrosophic SuperHyperGirth”

@googlebooks: http://books.google.com/books/about?id=yL-qEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=yL-qEAAAQBAJ

2023 - Amazon

“Extreme SuperHyperGirth”

@googlebooks: http://books.google.com/books/about?id=vL-qEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=vL-qEAAAQBAJ
 8896
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett @gmail.com · Manhattan, NY, USA
2023 - Amazon

“Overlook On SuperHyperGirth”

@googlebooks: http://books.google.com/books/about?id=rr-qEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=rr-qEAAAQBAJ

2023 - Amazon

“Book 90”
Neutrosophic SuperHyperMatching
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: -
@ZENODOO RG : https : //zenodo.org/record/7557063
@academia: https://www.academia.edu/95421010
@WordPress: -

2023 - Amazon

Book 80 Extreme SuperHyperMatching

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: -
@ZENODOO RG : https : //zenodo.org/record/7557009
@academia: https://www.academia.edu/95418790
@WordPress: -

2023 - Amazon

Book 69 SuperHyperMatching

@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/

2023 - Amazon

Book 69 SuperHyperMatching

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

2023 - Amazon

“Neutrosophic SuperHyperMatching”

@googlebooks: http://books.google.com/books/about?id=6bmqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=6bmqEAAAQBAJ

2023 - Amazon

“Extreme SuperHyperMatching”

@googlebooks: http://books.google.com/books/about?id=47mqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=47mqEAAAQBAJ
 8897
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett @gmail.com · Manhattan, NY, USA
2023 - Amazon

“Overlook On SuperHyperMatching”

@googlebooks: http://books.google.com/books/about?id=kC-oEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=kC-oEAAAQBAJ

2023 - Amazon

68 Failed SuperHyperClique

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

2023 - Amazon

“Neutrosophic Failed SuperHyperClique”

@googlebooks: http://books.google.com/books/about?id=h7qqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=h7qqEAAAQBAJ

2023 - Amazon

“Extreme Failed SuperHyperClique”

@googlebooks: http://books.google.com/books/about?id=gbqqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=gbqqEAAAQBAJ

2023 - Amazon

“Overlook On Failed SuperHyperClique”

@googlebooks: http://books.google.com/books/about?id=e7qqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=e7qqEAAAQBAJ

2023 - Amazon

“Book 88: Neutrosophic SuperHyperClique”

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
@ZENODOO RG : https : //zenodo.org/record/7574992
@academia: https://www.academia.edu/95770247
@WordPress: -

2023 - Amazon

“Book 88: Neutrosophic SuperHyperClique”

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

2023 - Amazon
 8898
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett @gmail.com · Manhattan, NY, USA

“Book 78: Extreme SuperHyperClique”

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
@ZENODOO RG : https : //zenodo.org/record/7574952
@academia: https://www.academia.edu/95769763
@WordPress: -

2023 - Amazon

“Book 78: Extreme SuperHyperClique”

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

2023 - Amazon

Book 67 SuperHyperClique

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/

2023 - Amazon

“Neutrosophic SuperHyperClique”

@googlebooks: http://books.google.com/books/about?id=7f2pEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=7f2pEAAAQBAJ

2023 - Amazon

“Extreme SuperHyperClique”

@googlebooks: http://books.google.com/books/about?id=52 pEAAAQBAJ

@GooglePlay: https://play.google.com/store/books/details?id=52 pEAAAQBAJ

2023 - Amazon

“Overlook On SuperHyperClique”

@googlebooks: http://books.google.com/books/about?id=Cf6pEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=Cf6pEAAAQBAJ

2023 - Amazon

66 Failed SuperHyperStable

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/
 8899
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett @gmail.com · Manhattan, NY, USA
2023 - Amazon

“Neutrosophic Failed SuperHyperStable”

@googlebooks: http://books.google.com/books/about?id=cLuqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=cLuqEAAAQBAJ

2023 - Amazon

“Extreme Failed SuperHyperStable”

@googlebooks: http://books.google.com/books/about?id=aruqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=aruqEAAAQBAJ

2023 - Amazon

“Overlook On Failed SuperHyperStable”

@googlebooks: http://books.google.com/books/about?id=YruqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=YruqEAAAQBAJ

2023 - Amazon

Book 65 SuperHyperStable

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/

2023 - Amazon

“Neutrosophic SuperHyperStable”

@googlebooks: http://books.google.com/books/about?id=gLyqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=gLyqEAAAQBAJ

2023 - Amazon

“Extreme SuperHyperStable”

@googlebooks: http://books.google.com/books/about?id=CryqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=CryqEAAAQBAJ

2023 - Amazon

“Overlook On SuperHyperStable”

@googlebooks: http://books.google.com/books/about?id=hLuqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=hLuqEAAAQBAJ

2023 - Amazon
 8900
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett @gmail.com · Manhattan, NY, USA
64 Failed SuperHyperForcing
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/

2023 - Amazon

“Neutrosophic Failed SuperHyperForcing”

@googlebooks: http://books.google.com/books/about?id=yLyqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=yLyqEAAAQBAJ

2023 - Amazon

“Extreme Failed SuperHyperForcing”

@googlebooks: http://books.google.com/books/about?id=wLyqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=wLyqEAAAQBAJ

2023 - Amazon

“Failed SuperHyperForcing”

@googlebooks: http://books.google.com/books/about?id=vryqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=vryqEAAAQBAJ

2023 - Amazon

63 | “SuperHyperForcing”

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/

2023 - Amazon

“Neutrosophic SuperHyperForcing”

@googlebooks: http://books.google.com/books/about?id=5LyqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=5LyqEAAAQBAJ

2023 - Amazon

“Extreme SuperHyperForcing”

@googlebooks: http://books.google.com/books/about?id=3ryqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=3ryqEAAAQBAJ

2023 - Amazon

“Overlook On SuperHyperForcing”

@googlebooks: http://books.google.com/books/about?id=zryqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=zryqEAAAQBAJ
 8901
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett @gmail.com · Manhattan, NY, USA
2023 - Amazon

“Neutrosophic SuperHyperAlliances”

@googlebooks: http://books.google.com/books/about?id=cr2qEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=cr2qEAAAQBAJ

2023 - Amazon

“Extreme SuperHyperAlliances”

@googlebooks: http://books.google.com/books/about?id=ZL2qEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=ZL2qEAAAQBAJ

2023 - Amazon

“Overlook On SuperHyperAlliances”

@googlebooks: http://books.google.com/books/about?id=Sr2qEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=Sr2qEAAAQBAJ

2023 - Amazon

62 |“SuperHyperAlliances”

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/

2023 - Amazon

Book 61 | “SuperHyperGraphs”

@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.wordpress.com/2022/12/24/superhypergraphs-published-
version/

2023 - Amazon

Book 61 | “SuperHyperGraphs”

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

2023 - Amazon
 8902
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett @gmail.com · Manhattan, NY, USA
60 | “Neut. SuperHyperEdges”

@googlebooks: http://books.google.com/books/about?id=rr2qEAAAQBAJ
@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/

2023 - Amazon

Book 60 | “Neut. SuperHyperEdges”

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

2023 0069 | SuperHyperMatching Amazon

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

2023 0068 | Failed SuperHyperClique Amazon

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

2023 0067 | SuperHyperClique Amazon

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

2023 0066 | Failed SuperHyperStable Amazon

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

2023 0065 | SuperHyperStable Amazon

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
 8903
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett @gmail.com · Manhattan, NY, USA
2023 0064 | Failed SuperHyperForcing Amazon

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

2022 0063 | SuperHyperForcing Amazon

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

2022 0062 | SuperHyperAlliances Amazon

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

2022 0061 | SuperHyperGraphs Amazon

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

2022 0060 | Neut. SuperHyperEdges Amazon

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

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

 8904
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett @gmail.com · Manhattan, NY, USA

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

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

 8905
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett @gmail.com · Manhattan, NY, USA

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

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
 8906
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett @gmail.com · Manhattan, NY, USA
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

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
 8907
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett @gmail.com · Manhattan, NY, USA
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

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
 8908
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett @gmail.com · Manhattan, NY, USA
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

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

 8909
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett @gmail.com · Manhattan, NY, USA

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
-

2021 0023 | List Amazon

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
-

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

 8910
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett @gmail.com · Manhattan, NY, USA

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
-

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
-

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

 8911
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett @gmail.com · Manhattan, NY, USA
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

Анализ моделей и руководство за пределами Подход и проблемы в двух моде-

лях 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
 8912
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett @gmail.com · Manhattan, NY, USA
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

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

 8913
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett @gmail.com · Manhattan, NY, USA
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
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
 8914
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett @gmail.com · Manhattan, NY, USA
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

2021 0002 | Modell-Analysen und Anleitungen darüber hinaus Amazon | MoreBooks |

Walmart | eBay
 8915
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett @gmail.com · Manhattan, NY, USA
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

 8916
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
 8917
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
...
 8918
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/
 8919
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
8920