New Ideas in Recognition of Cancer and Neutrosophic SuperHyperGraph by Eulerian-Path-Cut As Hyper Eulogy-Path-Cut On Super EULA-Path-Cut

See discussions, stats, and author profiles for this publication at: https://www.researchgate.
net/publication/369881604
New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph By

Eulerian-Path-Cut As Hyper Eulogy-Path-Cut On Super EULA-Path-Cut
Preprint · April 2023

DOI: 10.5281/zenodo.7809358
CITATIONS
1 author:
Henry Garrett
433 PUBLICATIONS 11,010 CITATIONS
SEE PROFILE
Some of the authors of this publication are also working on these related projects:
On Fuzzy Logic View project
Neutrosophic Graphs View project
All content following this page was uploaded by Henry Garrett on 07 April 2023.
The user has requested enhancement of the downloaded file.

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
New Ideas In Recognition of Cancer And Neutrosophic 2
SuperHyperGraph By Eulerian-Path-Cut As Hyper 3
Eulogy-Path-Cut On Super EULA-Path-Cut 4
Henry Garrett · Independent Researcher · Department of Mathematics · 6
DrHenryGarrett@gmail.com · Manhattan, NY, USA 7
1 ABSTRACT 8
In this scientific research, some extreme notions and Neutrosophic notions are defined 9
on the family of SuperHyperGraphs and Neutrosophic SuperHyperGraphs. Some 10
well-known classes are used in this scientific research. A basic familiarity with 11
Neutrosophic SuperHyper Eulerian-Path-Cut theory, SuperHyperGraphs, and 12
Neutrosophic SuperHyperGraphs theory are proposed. 13
Keywords: Neutrosophic SuperHyperGraph, SuperHyperEulerian-Path-Cut, 14
Cancer’s Neutrosophic Recognition 15
AMS Subject Classification: 05C17, 05C22, 05E45 16
2 Neutrosophic Preliminaries Of This Scientific 17
Research On the Redeemed Ways 18
In this section, the basic material in this scientific research, is referred to [Single Valued 19
Neutrosophic Set](Ref. [23],Definition 2.2,p.2), [Neutrosophic Set](Ref. [23],Definition 20
2.1,p.1), [Neutrosophic SuperHyperGraph (NSHG)](Ref. [23],Definition 2.5,p.2), 21
[Characterization of the Neutrosophic SuperHyperGraph (NSHG)](Ref. [23],Definition 22
2.7,p.3), [t-norm](Ref. [23], Definition 2.7, p.3), and [Characterization of the 23
Neutrosophic SuperHyperGraph (NSHG)](Ref. [23],Definition 2.7,p.3), [Neutrosophic 24
Strength of the Neutrosophic SuperHyperPaths] (Ref. [23],Definition 5.3,p.7), and 25
[Different Neutrosophic Types of Neutrosophic SuperHyperEdges (NSHE)] 26
(Ref. [23],Definition 5.4,p.7). Also, the new ideas and their clarifications are addressed 27
to Ref. [23]. 28
Definition 2.1. (Different Neutrosophic Types of Neutrosophic 29
SuperHyperEulerian-Path-Cut). 30
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 31
a Neutrosophic SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and E 0 = {E1 , E2 , . . . , Ez }. Then 32
either V 0 or E 0 is called 33
(i) Neutrosophic e-SuperHyperEulerian-Path-Cut if the following expression 34
is called Neutrosophic e-SuperHyperEulerian-Path-Cut criteria holds 35
∀Ea ∈ P : P is
a SuperHyperPath and it has
the all number of SuperHyperEdges;
(ii) Neutrosophic re-SuperHyperEulerian-Path-Cut if the following expression 36
is called Neutrosophic re-SuperHyperEulerian-Path-Cut criteria holds 37
∀Ea ∈ P : P is
and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 38
(iii) Neutrosophic v-SuperHyperEulerian-Path-Cut if the following expression 39
is called Neutrosophic v-SuperHyperEulerian-Path-Cut criteria holds 40
∀Va ∈ P : P is
(iv) Neutrosophic rv-SuperHyperEulerian-Path-Cut if the following expression 41
is called Neutrosophic v-SuperHyperEulerian-Path-Cut criteria holds 42
∀Va ∈ P : P is
and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; 43
(v) Neutrosophic SuperHyperEulerian-Path-Cut if it’s either of Neutrosophic 44
e-SuperHyperEulerian-Path-Cut, Neutrosophic re-SuperHyperEulerian-Path-Cut, 45
Neutrosophic v-SuperHyperEulerian-Path-Cut, and Neutrosophic 46
rv-SuperHyperEulerian-Path-Cut. 47
Definition 2.2. ((Neutrosophic) SuperHyperEulerian-Path-Cut). 48
a Neutrosophic SuperHyperEdge (NSHE) E = {V1 , V2 , . . . , Vs }. Then E is called 50
(i) an Extreme SuperHyperEulerian-Path-Cut if it’s either of Neutrosophic 51
rv-SuperHyperEulerian-Path-Cut and C(N SHG) for an Extreme 54
SuperHyperGraph N SHG : (V, E) is the maximum Extreme cardinality of an 55
Extreme SuperHyperSet S of high Extreme cardinality of the Extreme 56
SuperHyperEdges in the conseNeighborive Extreme sequence of Extreme 57
SuperHyperEdges and Extreme SuperHyperVertices such that they form the 58
Extreme SuperHyperEulerian-Path-Cut; 59
(ii) a Neutrosophic SuperHyperEulerian-Path-Cut if it’s either of 60
Neutrosophic e-SuperHyperEulerian-Path-Cut, Neutrosophic 61
re-SuperHyperEulerian-Path-Cut, Neutrosophic v-SuperHyperEulerian-Path-Cut, 62
and Neutrosophic rv-SuperHyperEulerian-Path-Cut and C(N SHG) for a 63
Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic 64
cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic 65
SuperHyperSet S of high Neutrosophic cardinality conseNeighborive Neutrosophic 66
SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the 67
Neutrosophic SuperHyperEulerian-Path-Cut; 68
(iii) an Extreme SuperHyperEulerian-Path-Cut SuperHyperPolynomial if 69
it’s either of Neutrosophic e-SuperHyperEulerian-Path-Cut, Neutrosophic 70
and Neutrosophic rv-SuperHyperEulerian-Path-Cut and C(N SHG) for an 72
Extreme SuperHyperGraph N SHG : (V, E) is the Extreme 73
SuperHyperPolynomial contains the Extreme coefficients defined as the Extreme 74
number of the maximum Extreme cardinality of the Extreme SuperHyperEdges of 75
an Extreme SuperHyperSet S of high Extreme cardinality conseNeighborive 76
Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form 77
the Extreme SuperHyperEulerian-Path-Cut; and the Extreme power is 78
corresponded to its Extreme coefficient; 79
(iv) a Neutrosophic SuperHyperEulerian-Path-Cut SuperHyperPolynomial 80
if it’s either of Neutrosophic e-SuperHyperEulerian-Path-Cut, Neutrosophic 81
Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic 84
SuperHyperPolynomial contains the Neutrosophic coefficients defined as the 85
Neutrosophic number of the maximum Neutrosophic cardinality of the 86
Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of high 87
Neutrosophic cardinality conseNeighborive Neutrosophic SuperHyperEdges and 88
Neutrosophic SuperHyperVertices such that they form the Neutrosophic 89
SuperHyperEulerian-Path-Cut; and the Neutrosophic power is corresponded to its 90
Neutrosophic coefficient; 91
(v) an Extreme V-SuperHyperEulerian-Path-Cut if it’s either of Neutrosophic 92
rv-SuperHyperEulerian-Path-Cut and C(N SHG) for an Extreme 95
SuperHyperGraph N SHG : (V, E) is the maximum Extreme cardinality of an 96
Extreme SuperHyperSet S of high Extreme cardinality of the Extreme 97
SuperHyperVertices in the conseNeighborive Extreme sequence of Extreme 98
SuperHyperEdges and Extreme SuperHyperVertices such that they form the 99
Extreme SuperHyperEulerian-Path-Cut; 100
(vi) a Neutrosophic V-SuperHyperEulerian-Path-Cut if it’s either of 101
Neutrosophic e-SuperHyperEulerian-Path-Cut, Neutrosophic 102
Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic 105
cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic 106
SuperHyperSet S of high Neutrosophic cardinality conseNeighborive Neutrosophic 107
SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the 108
Neutrosophic SuperHyperEulerian-Path-Cut; 109
(vii) an Extreme V-SuperHyperEulerian-Path-Cut SuperHyperPolynomial 110
and Neutrosophic rv-SuperHyperEulerian-Path-Cut and C(N SHG) for an 113
Extreme SuperHyperGraph N SHG : (V, E) is the Extreme 114
SuperHyperPolynomial contains the Extreme coefficients defined as the Extreme 115
number of the maximum Extreme cardinality of the Extreme SuperHyperVertices 116
of an Extreme SuperHyperSet S of high Extreme cardinality conseNeighborive 117
Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form 118
the Extreme SuperHyperEulerian-Path-Cut; and the Extreme power is 119
corresponded to its Extreme coefficient; 120
(viii) a Neutrosophic SuperHyperEulerian-Path-Cut SuperHyperPolynomial 121
Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic 125
SuperHyperPolynomial contains the Neutrosophic coefficients defined as the 126
Neutrosophic number of the maximum Neutrosophic cardinality of the 127
Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S of high 128
Neutrosophic cardinality conseNeighborive Neutrosophic SuperHyperEdges and 129
Neutrosophic SuperHyperVertices such that they form the Neutrosophic 130
SuperHyperEulerian-Path-Cut; and the Neutrosophic power is corresponded to its 131
Neutrosophic coefficient. 132
3 Neutrosophic SuperHyperEulerian-Path-Cut But 133
As The Extensions Excerpt From Dense And 134
Super Forms 135
Definition 3.1. (Neutrosophic event). 136
S = (V, E) is a probability Eulerian-Path-Cut. Any Neutrosophic k-subset of A of V is 138
called Neutrosophic k-event and if k = 2, then Neutrosophic subset of A of V is 139
called Neutrosophic event. The following expression is called Neutrosophic 140
probability of A. 141
X
E(A) = E(a). (3.1)
a∈A
Definition 3.2. (Neutrosophic Independent). 142
S = (V, E) is a probability Eulerian-Path-Cut. s Neutrosophic k-events Ai , i ∈ I is 144
called Neutrosophic s-independent if the following expression is called 145
Neutrosophic s-independent criteria 146
Y
E(∩i∈I Ai ) = P (Ai ).
i∈I
And if s = 2, then Neutrosophic k-events of A and B is called Neutrosophic 147
independent. The following expression is called Neutrosophic independent 148
criteria 149
E(A ∩ B) = P (A)P (B). (3.2)
Definition 3.3. (Neutrosophic Variable). 150
S = (V, E) is a probability Eulerian-Path-Cut. Any k-function Eulerian-Path-Cut like 152
E is called Neutrosophic k-Variable. If k = 2, then any 2-function 153
Eulerian-Path-Cut like E is called Neutrosophic Variable. 154
The notion of independent on Neutrosophic Variable is likewise. 155
Definition 3.4. (Neutrosophic Expectation). 156
S = (V, E) is a probability Eulerian-Path-Cut. A Neutrosophic k-Variable E has a 158
number is called Neutrosophic Expectation if the following expression is called 159
Neutrosophic Expectation criteria 160
X
Ex(E) = E(α)P (α).
α∈V
Definition 3.5. (Neutrosophic Crossing). 161
S = (V, E) is a probability Eulerian-Path-Cut. A Neutrosophic number is called 163
Neutrosophic Crossing if the following expression is called Neutrosophic 164
Crossing criteria 165
Cr(S) = min{Number of Crossing in a Plane Embedding of S}.
Lemma 3.6. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair 166
S = (V, E). Consider S = (V, E) is a probability Eulerian-Path-Cut. Let m and n 167
propose special Eulerian-Path-Cut. Then with m ≥ 4n, 168
Proof. Consider a planar embedding G of G with cr(G) crossings. Let S be a 169
Neutrosophic random k-subset of V obtained by choosing each SuperHyperVertex of G 170
Neutrosophic independently with probability Eulerian-Path-Cut p := 4n/m, and set 171
H := G[S] and H := G[S]. 172
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: 173
pm − 3n n 1 3 2
cr(G) ≥ = 3 = 64 m n .
p3 (4n/m)
174
Theorem 3.7. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair 175
S = (V, E). Consider S = (V, E) is a probability Eulerian-Path-Cut. Let P be a 176
SuperHyperSet of n points in the plane, and let l be the Neutrosophic number of 177
SuperHyperLines
√ in the plane passing through at least k + 1 of these points, where 178
1 ≤ k ≤ 2 2n. Then l < 32n2 /k 3 . 179
Proof. Form a Neutrosophic SuperHyperGraph G with SuperHyperVertex 180
SuperHyperSet P whose SuperHyperEdge are the segments between conseNeighborive 181
points on the SuperHyperLines which pass through at least k + 1 points of P. This 182
Neutrosophic SuperHyperGraph has at least kl SuperHyperEdges and Neutrosophic 183
crossing at most l choose two. Thus either kl < 4n, in which case l < 4n/k ≤ 32n2 /k 3 , 184
3
or l2 /2 > l choose 2 ≥ cr(G) ≥ (kl) /64n2 by the Neutrosophic Crossing Lemma, and 185
2 3
again l < 32n /k . 186
S = (V, E). Consider S = (V, E) is a probability Eulerian-Path-Cut. Let P be a 188
SuperHyperSet of n points in the plane, and let k be the number of pairs of points of P 189
at unit SuperHyperDistance. Then k < 5n4/3 . 190
Proof. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 191
Consider S = (V, E) is a probability Eulerian-Path-Cut. Draw a SuperHyperUnit 192
SuperHyperCircle around each SuperHyperPoint of P. Let ni be the Neutrosophic 193
number of these SuperHyperCircles passing through exactly i points of P. Then 194
i = 0n−1 ni = n and k = 21 i = 0n−1 ini . Now form a Neutrosophic

P P
195
SuperHyperGraph H with SuperHyperVertex SuperHyperSet P whose 196
SuperHyperEdges are the SuperHyperArcs between conseNeighborive SuperHyperPoints 197
on the SuperHyperCircles that pass through at least three SuperHyperPoints of P. Then 198
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 199
SuperHyperEdges. Delete from H one of each SuperHyperPair of parallel 200
SuperHyperEdges, so as to obtain a simple Neutrosophic SuperHyperGraph G with 201
e(G) ≥ k − n. Now cr(G) ≤ n(n − 1) because G is formed from at most n 202
SuperHyperCircles, and any two SuperHyperCircles cross at most twice. Thus either 203
3
e(G) < 4n, in which case k < 5n < 5n4/3 , or n2 > n(n − 1) ≥ cr(G) ≥ (k − n) /64n2 204
4/3 4/3
by the Neutrosophic Crossing Lemma, and k < 4n + n < 5n . 205
Proposition 3.9. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair 206
S = (V, E). Consider S = (V, E) is a probability Eulerian-Path-Cut. Let X be a 207
nonnegative Neutrosophic Variable and t a positive real number. Then 208
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. 209
Corollary 3.10. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair 210
S = (V, E). Consider S = (V, E) is a probability Eulerian-Path-Cut. Let Xn be a 211
nonnegative integer-valued variable in a probability Eulerian-Path-Cut (Vn , En ), n ≥ 1. 212
If E(Xn ) → 0 as n → ∞, then P (Xn = 0) → 1 as n → ∞. 213
Proof. 214
S = (V, E). Consider S = (V, E) is a probability Eulerian-Path-Cut. A special 216
SuperHyperGraph in Gn,p almost surely has stability number at most d2p−1 log ne. 217
Consider S = (V, E) is a probability Eulerian-Path-Cut. A special SuperHyperGraph in 219
Gn,p is up. Let G ∈ Gn,p and let S be a given SuperHyperSet of k + 1 220
SuperHyperVertices of G, where k ∈ N. The probability that S is a stable 221
SuperHyperSet of G is (1 − p)(k+1)choose2 , this being the probability that none of the 222
(k + 1)choose2 pairs of SuperHyperVertices of S is a SuperHyperEdge of the 223
Neutrosophic SuperHyperGraph G. 224
Let AS denote the event that S is a stable SuperHyperSet of G, and let XS denote 225
the indicator Neutrosophic Variable for this Neutrosophic Event. By equation, we have 226
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 227
X
X= {XS : S ⊆ V, |S| = k + 1}
and so, by those, 228
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: 229
nk+1
(n choose k+1) ≤ and1 − p ≤ e−p .
(k + 1)!
This yields the following upper bound on E(X). 230
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 231
grows at least as fast as the logarithm of n, implies that E(X) → 0 as n → ∞. Because 232
X is integer-valued and nonnegative, we deduce from Corollary that P (X = 0) → 1 as 233
n → ∞. Consequently, a Neutrosophic SuperHyperGraph in Gn,p almost surely has 234
stability number at most k. 235
Definition 3.12. (Neutrosophic Variance). 236
S = (V, E) is a probability Eulerian-Path-Cut. A Neutrosophic k-Variable E has a 238
number is called Neutrosophic Variance if the following expression is called 239
Neutrosophic Variance criteria 240
2
V x(E) = Ex((X − Ex(X)) ).
S = (V, E). Consider S = (V, E) is a probability Eulerian-Path-Cut. Let X be a 242
Neutrosophic Variable and let t be a positive real number. Then 243
V (X)
E(|X − Ex(X)| ≥ t) ≤ .
t2
Consider S = (V, E) is a probability Eulerian-Path-Cut. Let X be a Neutrosophic 245
Variable and let t be a positive real number. Then 246
2
2 Ex((X − Ex(X)) ) V (X)
E(|X − Ex(X)| ≥ t) = E((X − Ex(X)) ≥ t2 ) ≤ = .
t2 t2
247
S = (V, E). Consider S = (V, E) is a probability Eulerian-Path-Cut. Let Xn be a 249
Neutrosophic Variable in a probability Eulerian-Path-Cut (Vn , En ), n ≥ 1. If 250
Ex(Xn ) 6= 0 and V (Xn ) << E 2 (Xn ), then 251
E(Xn = 0) → 0 as n → ∞
Consider S = (V, E) is a probability Eulerian-Path-Cut. Set X := Xn and 253
t := |Ex(Xn )| in Chebyshev’s Inequality, and observe that 254
E(Xn = 0) ≤ E(|Xn − Ex(Xn )| ≥ |Ex(Xn )|) because |Xn − Ex(Xn )| = |Ex(Xn )| 255
when Xn = 0. 256
S = (V, E). Consider S = (V, E) is a probability Eulerian-Path-Cut. Let G ∈ Gn,1/2 . 258
For 0 ≤ k ≤ n, set f (k) := (n choose k)2−(k choose 2) and let k ∗ be the least value of k 259
for which f (k) is less than one. Then almost surely α(G) takes one of the three values 260
k ∗ − 2, k ∗ − 1, k ∗ . 261
Consider S = (V, E) is a probability Eulerian-Path-Cut. As in the proof of related 263
Theorem, the result is straightforward. 264
S = (V, E). Consider S = (V, E) is a probability Eulerian-Path-Cut. Let G ∈ Gn,1/2 and 266
let f and k ∗ be as defined in previous Theorem. Then either: 267
(i). f (k ∗ ) << 1, in which case almost surely α(G) is equal to either k ∗ − 2 or k ∗ − 1, 268
or 269
(ii). f (k ∗ − 1) >> 1, in which case almost surely α(G) is equal to either k ∗ − 1 or k ∗ . 270
Consider S = (V, E) is a probability Eulerian-Path-Cut. The latter is 272
straightforward. 273
Definition 3.17. (Neutrosophic Threshold). 274
S = (V, E) is a probability Eulerian-Path-Cut. Let P be a monotone property of 276
SuperHyperGraphs (one which is preserved when SuperHyperEdges are added). Then a 277
Neutrosophic Threshold for P is a function f (n) such that: 278
(i). if p << f (n), then G ∈ Gn,p almost surely does not have P, 279
(ii). if p >> f (n), then G ∈ Gn,p almost surely has P. 280
Definition 3.18. (Neutrosophic Balanced). 281
S = (V, E) is a probability Eulerian-Path-Cut. Let F be a fixed Neutrosophic 283
SuperHyperGraph. Then there is a threshold function for the property of containing a 284
copy of F as a Neutrosophic SubSuperHyperGraph is called Neutrosophic Balanced. 285
S = (V, E). Consider S = (V, E) is a probability Eulerian-Path-Cut. Let F be a 287
nonempty balanced Neutrosophic SubSuperHyperGraph with k SuperHyperVertices and l 288
SuperHyperEdges. Then n−k/l is a threshold function for the property of containing F 289
as a Neutrosophic SubSuperHyperGraph. 290
Figure 1. The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions

of Neutrosophic SuperHyperEulerian-Path-Cut in the Neutrosophic Example (3.20)
Consider S = (V, E) is a probability Eulerian-Path-Cut. The latter is 292
straightforward. 293
Example 3.20. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair 294
S = (V, E) in the mentioned Neutrosophic Figures in every Neutrosophic items. 295
• On the Figure (1), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 296
SuperHyperEulerian-Path-Cut, is up. The Neutrosophic Algorithm is 297
Neutrosophicly straightforward. 298
C(N SHG)Neutrosophic Eulerian-Path-Cut

= {E4 , E5 , E1 , E2 }.
C(N SHG)Neutrosophic Eulerian-Path-Cut SuperHyperPolynomial
= 2z 5 + 2z 3 .
C(N SHG)Neutrosophic V-Eulerian-Path-Cut
= {Vi ∈ VN SHG }.
C(N SHG)Neutrosophic V-Eulerian-Path-Cut SuperHyperPolynomial
X
= z |Vi ∈VN SHG | .
299


= {}.
= 0z 0 .
= {}.
= 0z 0 .
303

= {}.
= 0z 0 .
= {}.
= 0z 0 .
307


= {E1 , E2 , E3 , E4 , E5 }.
X
= z |Ei ∈EN SHG | .
= {Vi ∈ VN SHG }.
X
311

= {}.
= 0z 0 .
= {}.
= 0z 0 .
315




= {}.
= 0z 0 .
= {}.
= 0z 0 .
319


= {E2 , E3 , E4 , E5 }.
X
= {Vi ∈ VN SHG }.
X
323
4 The Neutrosophic Departures on The Theoretical 324
Results Toward Theoretical Motivations 325
The previous Neutrosophic approach apply on the upcoming Neutrosophic results on 326
Neutrosophic SuperHyperClasses. 327
Proposition 4.1. Assume a connected Neutrosophic SuperHyperPath ESHP : (V, E). 328
Then 329

= {Ei ∈ EN SHG }.
X
= {Vi ∈ VN SHG }.
X
Proof. Let 330
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V |EN SHG |
, E |EN SHG |
3 3
331
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 SuperHyperPath 332
ESHP : (V, E). There’s a new way to redefine as 333
ViEXT ERN AL ∼ VjEXT ERN AL ≡

∃!Ez ∈ EESHG:(V,E) , ViEXT ERN AL , VjEXT ERN AL ∈ Ez ≡
∃!Ez ∈ EESHG:(V,E) , {ViEXT ERN AL , VjEXT ERN AL } ⊆ Ez .
The term “EXTERNAL” implies |N (ViEXT ERN AL )| ≥ |N (Vj )| where Vj is 334
corresponded to ViEXT ERN AL in the literatures of SuperHyperEulerian-Path-Cut. The 335
latter is straightforward. 336
Example 4.2. In the Figure (8), the connected Neutrosophic SuperHyperPath 337
ESHP : (V, E), is highlighted and featured. The Neutrosophic SuperHyperSet, in the 338
Neutrosophic SuperHyperModel (8), is the SuperHyperEulerian-Path-Cut. 339
Proposition 4.3. Assume a connected Neutrosophic SuperHyperCycle ESHC : (V, E). 340
Figure 8. a Neutrosophic SuperHyperPath Associated to the Notions of Neutrosophic

SuperHyperEulerian-Path-Cut in the Example (4.2)
Then 341

= {}.
= 0z 0 .
= {}.
= 0z 0 .
Proof. Let 342
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V |EN SHG |
, E |EN SHG |
3 3
343
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 344
Figure 9. a Neutrosophic SuperHyperCycle Associated to the Neutrosophic Notions of

Neutrosophic SuperHyperEulerian-Path-Cut in the Neutrosophic Example (4.4)
ESHC : (V, E). There’s a new way to redefine as 345

Example 4.4. In the Figure (9), the connected Neutrosophic SuperHyperCycle 349
N SHC : (V, E), is highlighted and featured. The obtained Neutrosophic 350
SuperHyperSet, in the Neutrosophic SuperHyperModel (9), is the Neutrosophic 351
SuperHyperEulerian-Path-Cut. 352
Proposition 4.5. Assume a connected Neutrosophic SuperHyperStar ESHS : (V, E). 353
Then 354

= {}.
= 0z 0 .
= {}.
= 0z 0 .
Figure 10. a Neutrosophic SuperHyperStar Associated to the Neutrosophic Notions of

Neutrosophic SuperHyperEulerian-Path-Cut in the Neutrosophic Example (4.6)
Proof. Let 355
P :
V1EXT ERN AL , E1 ,
CEN T ER, E2
356
P :
E1 , V1EXT ERN AL ,
E2 , CEN T ER
be a longest path taken a connected Neutrosophic SuperHyperStar ESHS : (V, E). 357
There’s a new way to redefine as 358

Example 4.6. In the Figure (10), the connected Neutrosophic SuperHyperStar 362
ESHS : (V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, 363
by the Algorithm in previous Neutrosophic result, of the Neutrosophic 364
SuperHyperVertices of the connected Neutrosophic SuperHyperStar ESHS : (V, E), in 365
the Neutrosophic SuperHyperModel (10), is the Neutrosophic 366
Proposition 4.7. Assume a connected Neutrosophic SuperHyperBipartite 368
ESHB : (V, E). Then 369

= {}.
= 0z 0 .
= {}.
= 0z 0 .
Proof. Let 370
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
371
P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
...,
EXT ERN AL
E|Pi |=minPj ∈EN SHG |Pj | , V|P i |=minP ∈E |Pj |
j N SHG
is a longest path taken from a connected Neutrosophic SuperHyperBipartite 372
ESHB : (V, E). There’s a new way to redefine as 373

latter is straightforward. Then there’s no at least one SuperHyperEulerian-Path-Cut. 376
Thus the notion of quasi may be up but the SuperHyperNotions based on 377
SuperHyperEulerian-Path-Cut could be applied. There are only two SuperHyperParts. 378
Thus every SuperHyperPart could have one SuperHyperVertex as the representative in 379
the 380
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperEulerian-Path-Cut taken from a connected Neutrosophic 381
SuperHyperBipartite ESHB : (V, E). Thus only some SuperHyperVertices and only 382
Figure 11. Neutrosophic SuperHyperBipartite Neutrosophic Associated to the Neutro-

sophic Notions of Neutrosophic SuperHyperEulerian-Path-Cut in the Example (4.8)
minimum-Neutrosophic-of-SuperHyperPart SuperHyperEdges are attained in any 383
solution 384
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
The latter is straightforward. 385
Example 4.8. In the Neutrosophic Figure (11), the connected Neutrosophic 386
SuperHyperBipartite ESHB : (V, E), is Neutrosophic highlighted and Neutrosophic 387
featured. The obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in 388
previous Neutrosophic result, of the Neutrosophic SuperHyperVertices of the connected 389
Neutrosophic SuperHyperBipartite ESHB : (V, E), in the Neutrosophic 390
SuperHyperModel (11), is the Neutrosophic SuperHyperEulerian-Path-Cut. 391
Proposition 4.9. Assume a connected Neutrosophic SuperHyperMultipartite 392
ESHM : (V, E). Then 393

= {}.
= 0z 0 .
= {}.
= 0z 0 .
Proof. Let 394
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
395
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
SuperHyperMultipartite ESHM : (V, E). There’s a new way to redefine as 397

latter is straightforward. Then there’s no at least one SuperHyperEulerian-Path-Cut. 400
Thus the notion of quasi may be up but the SuperHyperNotions based on 401
SuperHyperEulerian-Path-Cut could be applied. There are only z 0 SuperHyperParts. 402
Thus every SuperHyperPart could have one SuperHyperVertex as the representative in 403
the 404
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest path taken from a connected Neutrosophic SuperHyperMultipartite 405
ESHM : (V, E). Thus only some SuperHyperVertices and only 406
minimum-Neutrosophic-of-SuperHyperPart SuperHyperEdges are attained in any 407
solution 408
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest path taken from a connected Neutrosophic SuperHyperMultipartite 409
ESHM : (V, E). The latter is straightforward. 410
Example 4.10. In the Figure (12), the connected Neutrosophic 411
SuperHyperMultipartite ESHM : (V, E), is highlighted and Neutrosophic featured. 412
The obtained Neutrosophic SuperHyperSet, by the Algorithm in previous Neutrosophic 413
result, of the Neutrosophic SuperHyperVertices of the connected Neutrosophic 414
SuperHyperMultipartite ESHM : (V, E), in the Neutrosophic SuperHyperModel (12), 415
is the Neutrosophic SuperHyperEulerian-Path-Cut. 416
Figure 12. a Neutrosophic SuperHyperMultipartite Associated to the Notions of

Neutrosophic SuperHyperEulerian-Path-Cut in the Example (4.10)
Proposition 4.11. Assume a connected Neutrosophic SuperHyperWheel 417
ESHW : (V, E). Then, 418

= {}.
= 0z 0 .
= {}.
= 0z 0 .
Proof. Let 419
P :
V1EXT ERN AL , E1∗ ,
CEN T ER, E2∗
420
P :
E1∗ , V1EXT ERN AL ,
E2∗ , CEN T ER
SuperHyperWheel ESHW : (V, E). There’s a new way to redefine as 422

Figure 13. a Neutrosophic SuperHyperWheel Neutrosophic Associated to the Neu-

trosophic Notions of Neutrosophic SuperHyperEulerian-Path-Cut in the Neutrosophic
Example (4.12)
latter is straightforward. Then there’s at least one SuperHyperEulerian-Path-Cut. Thus 425
the notion of quasi isn’t up and the SuperHyperNotions based on 426
SuperHyperEulerian-Path-Cut could be applied. The unique embedded 427
SuperHyperEulerian-Path-Cut proposes some longest SuperHyperEulerian-Path-Cut 428
excerpt from some representatives. The latter is straightforward. 429
Example 4.12. In the Neutrosophic Figure (13), the connected Neutrosophic 430
SuperHyperWheel N SHW : (V, E), is Neutrosophic highlighted and featured. The 431
obtained Neutrosophic SuperHyperSet, by the Algorithm in previous result, of the 432
Neutrosophic SuperHyperVertices of the connected Neutrosophic SuperHyperWheel 433
ESHW : (V, E), in the Neutrosophic SuperHyperModel (13), is the Neutrosophic 434
5 Background 436
See the seminal scientific researches [1–3]. The formalization of the notions on the 437
framework of notions in SuperHyperGraphs, Neutrosophic notions in 438
SuperHyperGraphs theory, and (Neutrosophic) SuperHyperGraphs theory at [5–23]. 439
Two popular scientific research books in Scribd in the terms of high readers, 4216 and 440
5214 respectively, on neutrosophic science is on [24, 25]. 441
References 442
1. Henry Garrett, “Neutrosophic Co-degree and Neutrosophic Degree alongside 443
Chromatic Numbers in the Setting of Some Classes Related to Neutrosophic 444
Hypergraphs”, J Curr Trends Comp Sci Res 1(1) (2022) 06-14. 445
2. Henry Garrett, “Super Hyper Dominating and Super Hyper Resolving on 446
Neutrosophic Super Hyper Graphs and Their Directions in Game Theory and 447
Neutrosophic Super Hyper Classes”, J Math Techniques Comput Math 1(3) 448
(2022) 242-263. (doi: 10.33140/JMTCM.01.03.09) 449
3. Henry Garrett, “Some Super Hyper Degrees and Co-Super Hyper Degrees on 450
Neutrosophic Super Hyper Graphs And Super Hyper Graphs Alongside 451
Applications in Cancer’s Treatments”, J Math Techniques Comput Math 2(1) 452
(2023) 35-47. (https://www.opastpublishers.com/open-access-articles/some- 453
super-hyper-degrees-and-cosuper-hyper-degrees-on-neutrosophic-super-hyper- 454
graphs-and-super-hyper-graphs-alongside-a.pdf) 455
4. Henry Garrett, “A Research on Cancers Recognition and Neutrosophic Super 456
Hypergraph by Eulerian Super Hyper Cycles and Hamiltonian Sets as Hyper 457
Covering Versus Super separations”, J Math Techniques Comput Math 2(3) 458
(2023) 136-148. (https://www.opastpublishers.com/open-access-articles/a- 459
research-on-cancers-recognition-and-neutrosophic-super-hypergraph-by- 460
eulerian-super-hyper-cycles-and-hamiltonian-sets-.pdf) 461
5. Garrett, Henry. “0039 — Closing Numbers and Super-Closing Numbers as 462
(Dual)Resolving and (Dual)Coloring alongside (Dual)Dominating in 463
(Neutrosophic)n-SuperHyperGraph.” CERN European Organization for Nuclear 464
Research - Zenodo, Nov. 2022. CERN European Organization for Nuclear 465
Research, https://doi.org/10.5281/zenodo.6319942. 466
https://oa.mg/work/10.5281/zenodo.6319942 467
6. Garrett, Henry. “0049 — (Failed)1-Zero-Forcing Number in Neutrosophic 468
Graphs.” CERN European Organization for Nuclear Research - Zenodo, Feb. 469
2022. CERN European Organization for Nuclear Research, 470
https://doi.org/10.13140/rg.2.2.35241.26724. 471
https://oa.mg/work/10.13140/rg.2.2.35241.26724 472
7. Henry Garrett, “Extreme SuperHyperClique as the Firm Scheme of 473
Confrontation under Cancer’s Recognition as the Model in The Setting of 474
(Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010308 (doi: 475
10.20944/preprints202301.0308.v1). 476
8. Henry Garrett, “Uncertainty On The Act And Effect Of Cancer Alongside The 477
Foggy Positions Of Cells Toward Neutrosophic Failed SuperHyperClique inside 478
Neutrosophic SuperHyperGraphs Titled Cancer’s Recognition”, Preprints 2023, 479
2023010282 (doi: 10.20944/preprints202301.0282.v1). 480
9. Henry Garrett, “Neutrosophic Version Of Separates Groups Of Cells In 481
Cancer’s Recognition On Neutrosophic SuperHyperGraphs”, Preprints 2023, 482
2023010267 (doi: 10.20944/preprints202301.0267.v1). 483
10. Henry Garrett, “The Shift Paradigm To Classify Separately The Cells and 484
Affected Cells Toward The Totality Under Cancer’s Recognition By New 485
Multiple Definitions On the Sets Polynomials Alongside Numbers In The 486
(Neutrosophic) SuperHyperMatching Theory Based on SuperHyperGraph and 487
Neutrosophic SuperHyperGraph”, Preprints 2023, 2023010265 (doi: 488
10.20944/preprints202301.0265.v1). 489
11. Henry Garrett, “Breaking the Continuity and Uniformity of Cancer In The 490
Worst Case of Full Connections With Extreme Failed SuperHyperClique In 491
Cancer’s Recognition Applied in (Neutrosophic) SuperHyperGraphs”, Preprints 492
2023, 2023010262,(doi: 10.20944/preprints202301.0262.v1). 493
12. Henry Garrett, “Neutrosophic Failed SuperHyperStable as the Survivors on the 494
Cancer’s Neutrosophic Recognition Based on Uncertainty to All Modes in 495
Neutrosophic SuperHyperGraphs”, Preprints 2023, 2023010240 (doi: 496
10.20944/preprints202301.0240.v1). 497
13. Henry Garrett, “Extremism of the Attacked Body Under the Cancer’s 498
Circumstances Where Cancer’s Recognition Titled (Neutrosophic) 499
SuperHyperGraphs”, Preprints 2023, 2023010224, (doi: 500
10.20944/preprints202301.0224.v1). 501
14. Henry Garrett, “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s 502
Recognitions And (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 503
2023010105 (doi: 10.20944/preprints202301.0105.v1). 504
15. Henry Garrett, “Neutrosophic Messy-Style SuperHyperGraphs To Form 505
Neutrosophic SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions 506
In Special ViewPoints”, Preprints 2023, 2023010088 (doi: 507
10.20944/preprints202301.0088.v1). 508
16. Henry Garrett, “Neutrosophic 1-Failed SuperHyperForcing in the 509
SuperHyperFunction To Use Neutrosophic SuperHyperGraphs on Cancer’s 510
Neutrosophic Recognition And Beyond ”, Preprints 2023, 2023010044 511
17. Henry Garrett, “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by 512
Well- SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 513
2023010043 (doi: 10.20944/preprints202301.0043.v1). 514
18. Henry Garrett, “Basic Notions on (Neutrosophic) SuperHyperForcing And 515
(Neutrosophic) SuperHyperModeling in Cancer’s Recognitions And 516
(Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010105 (doi: 517
10.20944/preprints202301.0105.v1). 518
19. Henry Garrett, “Neutrosophic Messy-Style SuperHyperGraphs To Form 519
Neutrosophic SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions 520
In Special ViewPoints”, Preprints 2023, 2023010088 (doi: 521
10.20944/preprints202301.0088.v1). 522
20. Henry Garrett, “(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions 523
Featuring (Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, Preprints 524
2022, 2022120549 (doi: 10.20944/preprints202212.0549.v1). 525
21. Henry Garrett, “(Neutrosophic) SuperHyperAlliances With SuperHyperDefensive 526
and SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) 527
SuperHyperGraph With (Neutrosophic) SuperHyperModeling of Cancer’s 528
Recognitions And Related (Neutrosophic) SuperHyperClasses”, Preprints 2022, 529
2022120540 (doi: 10.20944/preprints202212.0540.v1). 530
22. Henry Garrett, “SuperHyperGirth on SuperHyperGraph and Neutrosophic 531
SuperHyperGraph With SuperHyperModeling of Cancer’s Recognitions”, 532
Preprints 2022, 2022120500 (doi: 10.20944/preprints202212.0500.v1). 533
23. Henry Garrett, “Initial Material of Neutrosophic Preliminaries to Study Some 534
Neutrosophic Notions Based on Neutrosophic SuperHyperEdge (NSHE) in 535
Neutrosophic SuperHyperGraph (NSHG)”, ResearchGate 2022 (doi: 536
10.13140/RG.2.2.25385.88160). 537
24. Henry Garrett, “Beyond Neutrosophic Graphs”. Dr. Henry Garrett, 2023 (doi: 538
10.5281/zenodo.6320305). 539
25. Henry Garrett, “Neutrosophic Duality”. Dr. Henry Garrett, 2023 (doi: 540
10.5281/zenodo.6677173). 541
View publication stats

New Ideas in Recognition of Cancer and Neutrosophic SuperHyperGraph by Eulerian-Path-Cut As Hyper Eulogy-Path-Cut On Super EULA-Path-Cut

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

New Ideas in Recognition of Cancer and Neutrosophic SuperHyperGraph by Eulerian-Path-Cut As Hyper Eulogy-Path-Cut On Super EULA-Path-Cut

Uploaded by

Copyright:

Available Formats

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

New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph By

Preprint · April 2023

433 PUBLICATIONS 11,010 CITATIONS

On Fuzzy Logic View project

Neutrosophic Graphs View project

The user has requested enhancement of the downloaded file.

New Ideas In Recognition of Cancer And Neutrosophic 2

SuperHyperGraph By Eulerian-Path-Cut As Hyper 3

Eulogy-Path-Cut On Super EULA-Path-Cut 4

Henry Garrett · Independent Researcher · Department of Mathematics · 6

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

on the family of SuperHyperGraphs and Neutrosophic SuperHyperGraphs. Some 10

Neutrosophic SuperHyper Eulerian-Path-Cut theory, SuperHyperGraphs, and 12

Neutrosophic SuperHyperGraphs theory are proposed. 13

Keywords: Neutrosophic SuperHyperGraph, SuperHyperEulerian-Path-Cut, 14

Cancer’s Neutrosophic Recognition 15

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

2 Neutrosophic Preliminaries Of This Scientific 17

Research On the Redeemed Ways 18

Neutrosophic Set](Ref. [23],Definition 2.2,p.2), [Neutrosophic Set](Ref. [23],Definition 20

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

[Characterization of the Neutrosophic SuperHyperGraph (NSHG)](Ref. [23],Definition 22

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

Neutrosophic SuperHyperGraph (NSHG)](Ref. [23],Definition 2.7,p.3), [Neutrosophic 24

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

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

Definition 2.1. (Different Neutrosophic Types of Neutrosophic 29

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

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

(i) Neutrosophic e-SuperHyperEulerian-Path-Cut if the following expression 34

is called Neutrosophic e-SuperHyperEulerian-Path-Cut criteria holds 35

(ii) Neutrosophic re-SuperHyperEulerian-Path-Cut if the following expression 36

is called Neutrosophic re-SuperHyperEulerian-Path-Cut criteria holds 37

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

(iii) Neutrosophic v-SuperHyperEulerian-Path-Cut if the following expression 39

is called Neutrosophic v-SuperHyperEulerian-Path-Cut criteria holds 40

(iv) Neutrosophic rv-SuperHyperEulerian-Path-Cut if the following expression 41

is called Neutrosophic v-SuperHyperEulerian-Path-Cut criteria holds 42

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

(v) Neutrosophic SuperHyperEulerian-Path-Cut if it’s either of Neutrosophic 44

e-SuperHyperEulerian-Path-Cut, Neutrosophic re-SuperHyperEulerian-Path-Cut, 45

Neutrosophic v-SuperHyperEulerian-Path-Cut, and Neutrosophic 46

Definition 2.2. ((Neutrosophic) SuperHyperEulerian-Path-Cut). 48

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

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

(i) an Extreme SuperHyperEulerian-Path-Cut if it’s either of Neutrosophic 51

e-SuperHyperEulerian-Path-Cut, Neutrosophic re-SuperHyperEulerian-Path-Cut, 52

Neutrosophic v-SuperHyperEulerian-Path-Cut, and Neutrosophic 53

rv-SuperHyperEulerian-Path-Cut and C(N SHG) for an Extreme 54

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

Extreme SuperHyperSet S of high Extreme cardinality of the Extreme 56

SuperHyperEdges in the conseNeighborive Extreme sequence of Extreme 57

SuperHyperEdges and Extreme SuperHyperVertices such that they form the 58

(ii) a Neutrosophic SuperHyperEulerian-Path-Cut if it’s either of 60

Neutrosophic e-SuperHyperEulerian-Path-Cut, Neutrosophic 61

re-SuperHyperEulerian-Path-Cut, Neutrosophic v-SuperHyperEulerian-Path-Cut, 62

and Neutrosophic rv-SuperHyperEulerian-Path-Cut and C(N SHG) for a 63

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

cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic 65

SuperHyperSet S of high Neutrosophic cardinality conseNeighborive Neutrosophic 66

SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the 67

(iii) an Extreme SuperHyperEulerian-Path-Cut SuperHyperPolynomial if 69