New Ideas in Recognition of Cancer and Neutrosophic SuperHyperGraph As Hyper Tool On Super Toot

Department of Mathematics · DrHenryGarrett@gmail.
com · Manhattan, NY, USA

Research Article Current Trends in Mass Communication
New Ideas In Recognition of Cancer and Neutrosophic Super Hypergraph as
Hyper Tool on Super Toot
Henry Garrett* 1
Ideas In Recognition of Cancer And Neutrosophic Corresponding Author *

2
Department of Mathematics, City University of New York, Henry Garrett, Department of Mathematics, City University of New York,
erHyperGraph As Hyper Tool On Super Toot
New York, NY 10010, USA
3
New York, NY 10010, 4USA.
Garrett · Independent Researcher · Department of Mathematics · 5
nryGarrett@gmail.com · Manhattan, NY, USA Submitted: 2023, Apr 26;

6 Accepted: 2023, May 20; Published: 2023, Jun 08
Citation: Garrett, H. (2023), New Ideas In Recognition of Cancer and Neutrosophic Super Hypergraph as Hyper Tool on
ABSTRACT
Super Toot. Curr Trends Mass Comm, 2(1), 32-55. 7
s scientific research,
Abstract new setting is introduced to study dominating, resolving, 8
ng, Eulerian(Hamiltonian) neutrosophic path, n-Eulerian(Hamiltonian)

In this scientific research, new setting is introduced to study dominating, resolving, 9
Coloring, Eulerian (Hamiltonian)
osophic path, zero forcing number, zero forcing neutrosophic-number, independent
neutrosophic path, n-Eulerian (Hamiltonian) Neutrosophic path, zero forcing number, zero forcing neutrosophic- 10
er, independentnumber, independent Number,

neutrosophic-number, clique independent
number, clique neutrosophic-number,
neutrosophic-number, clique number, 11 clique neutrosophic-number, Matching
number, matching neutrosophic-number, girth, neutrosophic girth, 1-zero-forcing
ing number, matching neutrosophic-number, girth, neutrosophic girth, 12 number, 1-zero-forcing neutrosophic-
-forcing number, number, failed 1-zero-forcing
1-zero-forcing number, failed
neutrosophic-number, 1-zero-forcing
failed 1-zero-forcing neutrosophic-number,
number, 13 global-offensive alliance, t-offensive
1-zero-forcing alliance, t-defensive alliance,
neutrosophic-number, t-powerful alliance,
global-offensive alliance, and global-powerful
t-offensive alliance, alliance 14 in SuperHyperGraph and Neutrosophic
nsive alliance, Super Hypergraph.

t-powerful alliance,Some andClasses of SuperHyperGraph
global-powerful alliance in and Neutrosophic SuperHyperGraph 15 are cases of study. Some
HyperGraph and results are applied SuperHyperGraph.
Neutrosophic in family of SuperHyperGraph Some Classes and Neutrosophic
of SuperHyperGraph.
16
A basic familiarity with Super
HyperGraph and Hypergraphs
Neutrosophic theory, and Neutrosophicare
SuperHyperGraph SuperHyperGraph
cases of study. theory Some are results proposed. 17
plied in family of SuperHyperGraph and Neutrosophic SuperHyperGraph. A 18

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY,
familiarity Keywords: SuperHyperGraph,
with SuperHyperGraphs Neutrosophic
theory, SuperHyperGraph,
and Neutrosophic SuperHyperGraphsClasses, Families, 19 Cancer’s Recognition.
y are proposed. 20
eywords: AMS Subject Classification:

SuperHyperGraph, 05C17, 05C22,
Neutrosophic 05E45
SuperHyperGraph, Classes, Families, 21 +
Henry Garrett · Independent Researcher where· Department
the functions of Mathematics
T, I, F 22: X →]· DrHenryGarrett@gmail.com
−
0, 1 [ define respectively· Manhattan, the a NY, USA
r’s Recognition
Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett · Independent Researchertruth-membership
· Department of function,
Mathematics · an indeterminacy-membership
DrHenryGarrett@gmail.com · function, an
Henry
MS Subject Garrett
Neutrosophic · Independent Researcher
Preliminaries
Classification: 05C17, of05C22, · Department
This 05E45 ofResearch
Scientific Mathematics on · function,
DrHenryGarrett@gmail.com
and a23 falsity-membership · Manhattan, NY, USA
function of the element x USA
Manhattan, NY,
falsity-membership function of the+ element x ∈ X to the set A with the cond
the Redeemed Ways: In this section, the basic material wherein this ∈ X to the
the functions T, set
I, FA: withX →]the − condition
0, 1 [ define respectively the a
scientific research, is wherereferredtheto [Single T, Valued
I, F : Neutrosophic
− +
functions X →] 0, 1 [
truth-membership define respectively −
function, the aan ++ I (x) + F (x) ≤ 3+ .
indeterminacy-membership
Neutrosophic the a function, and a
Set] (Ref. [23],Preliminaries Offunctions
ThisT, Scientific
where the −
: X functions
+
→] 0, 1 [T,define 024 ≤→]TA0,
I, F :respectively
X − (x)1 the[ define respectively
2.2, where the I, indeterminacy-membership
F(Ref. a and
A A
Definition
truth-membership p.2), [Neutrosophic
function, Set]
an
falsity-membership function of function,
the element aX
∈
truth-membership truth-membership
function, Xfunction,
an indeterminacy-membership an function, and aset Afunction,
A indeterminacy-membership
x to the with the condition
and a
Research [23] , OnDefinition
the2.1,Redeemed
p.1), [Neutrosophic
falsity-membership
Ways SuperHyperGraph
function
The
of the element
functions The
T
x ∈functions
(x), I
to the set
(x) T
and
25 A
(x), F IA(x)
with
(x)
theand
are F
condition
real A
(x)
standardare real
or standard
nonstandard orcondition
subsets
falsity-membership falsity-membership
function of the
A element function
A x − ∈ Xoftothe Atheelement
set A x
with ∈ X
the to the
condition
+ set A with the
(NSHG)] (Ref. [23], Definition 2.5, p.2), [Characterization − ] −
0, 1
+
[. nonstandard
0 ≤ TA (x) + IA (x) + FA (x) ≤ −3 .
subsets
+ 0 ≤ TA of]
(x)−0,+ 1I+A[.(x) + FA (x) ≤ 3 .
s section,ofthethe Neutrosophic
basic material inSuperHyperGraph
this scientific research, (NSHG)] (Ref. −[23],
is referred 0to≤[Single
TA (x) +Valued IA (x) +0F≤ A TA (x)
26 (x) ≤ 3+ +
.IA (x) + FA (x) ≤ 3+ .
The functions TA (x), IA (x) and FA (x) are real standard or nonstandard subsets of
Definition [23],Definition
osophic Set](Ref. 292.7, p.3),The [t-norm]
2.2,p.2),(Ref. [23], Definition
[Neutrosophic
functions TA (x), IA (x) and F]A 2.7,
Definition
Set](Ref.
− (x) +p.3),
are Definition
2.2 (Single
[23],Definition 2.2:
Valued (Single
real standard or nonstandard subsets
27 Valued
Neutrosophic Neutrosophic
Set). (Ref.
of 39 Set). (Ref. [23],
[23],Definition 2.2,p.2)
0, 1 [.
and [Characterization
1), [Neutrosophic SuperHyperGraph ]of
−
0,the
1 [.30Neutrosophic
+ The functionsSuperHyperGraph
(NSHG)](Ref. +
TA (x),The IALet
[23],Definition(x)functions
+
and
X beFADefinition
aT
(x)
2.5,p.2),A (x),
areIreal 2.2,
A (x)
Eulerian-Path-Cut and p.2).
standard
28 of Let
Fpoints
A (x) X
are be
realanstandard
or nonstandard
(objects) Eulerian-Path-Cut
subsets
with or nonstandard
of
generic
40 of39 points
elements subsets
in Xofdeno
acterization(NSHG)] (Ref. [23], Definition
of the Neutrosophic ]− 0, 12.7,
SuperHyperGraph [. p.3),(NSHG)](Ref.
x.]−Definition
0, 1single
[Neutrosophic
A [. [23],Definition
(objects)
valued
2.2 (Single with
Neutrosophic
Valued generic
29 elements
Neutrosophicset A (SVNS in X (Ref.
Set). denoted by x. A40 single
A) is[23],Definition
characterized by
2.2,p.2).
Definition 2.2 (Single Valuedtruth-membership Neutrosophic Set). (Ref. [23],Definition 2.2,p.2).with generic
31Strength of Definition
the Neutrosophic SuperHyperPaths] (Ref. [23], valued Neutrosophic set A (SVNS A) is characterized by truth-
41
3), [t-norm](Ref. [23], 2.7, p.3), and [Characterization Let
Definition X
of be
the a function
Eulerian-Path-Cut
2.2 with
(Single Valued T of
A (x),
points an
Neutrosophic indeterminacy-membership
(objects) Set). (Ref. elements function
in X IA (x),
denoted by
by is [23],Definition 2.2,p.2).
30
Let X be Definition 2.2 (Single
a Eulerian-Path-Cut of points Valued Neutrosophic
(objects) Set).elements
generic (Ref. [23],Definition
in XAdenoted 2.2,p.2). 41
Definition 5.3, p.7),

osophic SuperHyperGraph and [Different
(NSHG)](Ref.
x. A single valued Neutrosophic
[23],Definition
Let X Neutrosophic Types
x. A
2.7,p.3),
Let
be a Eulerian-Path-Cut set X of
single
falsity-membership membership
valued
[Neutrosophic
ofAbe function
a Eulerian-Path-Cut
points
(SVNS (objects)
A) function
Neutrosophic
with F
of points
31
is characterizedA (x).
generic T
set
For(x),
(objects)
Aelements
by an
(SVNS
each withindeterminacy-membership
point A) x
in Xgeneric characterized
in
denoted X, T
elements
by A (x), Iby
in X denoted by∈
A (x), FA (x)
gth of theNeutrosophic
Neutrosophic SuperHyperEdges
SuperHyperPaths] (NSHE)](Ref.
x. A single (Ref. [23], A
[23],Definition
valued x.truth-membership
Definition
SVNS
A
Neutrosophic A can
5.3,p.7),
single function
valuedbe
and function
I
written (x),
Neutrosophic
set A (SVNS T
and
as
32A (x),
a
A) is an
set indeterminacy-membership
falsity-membership
A
characterized(SVNS A)
by a function
is F
characterized function
(x). For by eachIA (x), and
truth-membership function TA (x), an indeterminacy-membership
falsity-membership A
function F function
(x). For IA (x),
each pointand x in X, T A
(x), I (x), F (x) ∈ [0, a1
5.4, p.7). Also,
rent Neutrosophic Types theof
new ideas and their
Neutrosophic clarifications
function Fare
SuperHyperEdges
truth-membership
falsity-membership addressed
function
A (x).
(NSHE)]
truth-membership
ForTAeach point
(x), point xx in
function
in X, T
A
33(x), an indeterminacy-membership
an indeterminacy-membership function I (x), and
A (x), IA (x), FA (x) ∈ [0, 1].A
Tas
A
A afunctionA IAA(x), and
A SVNS A can be written
Apoint
=F {< x
in :X,TAT(x), IApoint
I(x), FAin (x)X,>, ∈1].X}.
x(x),
to Ref. 5.4,p.7).
[23],Definition [23]. In this subsection,
Also, Athe
SVNS newAthe basic material
falsity-membership
ideas
can beand which
function
theirasclarifications
written is used
falsity-membership (x).Aaddressed
FA are SVNS
For each A
function can be
A
34 written
x(x). For as
each
A (x), A (x),xF A (x) ∈TA[0, IA (x), FA (x) ∈ [0, 1].
f. [23]. in this scientific research, is presented. A SVNS Also,
A canthebenew Aideas
written SVNS asand A can be written as 35
A = {< xof: Ttruth-membership,
A (x), IA (x), FA (x) >, x ∈ X}.
their clarifications
this subsection, the basic are elicited.
material which is used A in=this xDefinition
{< scientific
: TA (x), research, 2.3.
IA (x), FAThe is >,degree
(x) x ∈ 36 X}.
A = {< x : TA (x), IAA
indeterminacy-membership (x),= F{<A (x)x : >,Tand
Ax(x), IA (x), FA (x) >, x ∈ X}.of the subset X ⊂ A
∈falsity-membership
X}.
nted. Also, the new ideas and their clarifications are elicited. Definition Definition 2.3. The degree 2.3:37 of The degree of truth-membership,
truth-membership,
Definition 2.3. The degree of truth-membership,
theindeterminacy-membership
single valued Neutrosophic and set A = {< x : TA (x), IA (x), FA (x) >, xX∈⊂X}:
Definition 2.1: (Neutrosophic Set). (Ref. [23], Definition
Definition 2.3. TheDefinition
indeterminacy-membership degree
and 2.1, indeterminacy-membership
of 2.3. The degree
truth-membership,
falsity-membership of truth-membership,
of38 the subset Xand ⊂: TAfalsity-membership
falsity-membership
of
of the subsetof the A of
ition 2.1 (Neutrosophic Set). (Ref. [23],Definition 2.1,p.1). the single valued Neutrosophic set A = {< x (x), I (x), F (x) >, x ∈ X}:
p.1). Let X be a Eulerian-Path-Cut
the (objects) of points
single valued Neutrosophic (objects) with
set A =in{<Xand subset X ⊂
x : Tfalsity-membership
A (x), Iby
A
A (x),
of
TAF(X) the
and
A (x) =
single valued
falsity-membership
xof∈ the
>,min[T X}: Neutrosophic
A
subset X ⊂ A of A of set
A
the subset X ⊂ A of
t X be a Eulerian-Path-Cut of points with generic elements A (vi ), TA (vj )]vi ,vj ∈X ,
generic elements in X denoted bythex;single then the Neutrosophic
valued the single
Neutrosophic setdenoted
setvalued A =Neutrosophic
{< x : TA (x),set IAA (x),= F{< A x
(x) : T
>, A x(x),
∈ I
X}:
A (x), F A (x) >, x ∈ X}:
n the Neutrosophic set A (NS A) is an object having the TA (X) = min[T A (vi ), TA (vj )]vi ,vj ∈X ,
A (NS A) is an object having the form TA (X) = form
min[TA (vi ), TA (vj )]vi ,vj ∈X I ,(X) = min[I (v ), I (v )]
A A i A j v i ,j ∈X ,
,v
TA (X) = min[TA (vi ),TTAA(X) (vj )]=vimin[Tj ∈X A
, (vi ), TA (vj )]vi ,vj ∈X
IA (X) =,vmin[I A (vi ), IA (vj )]vi ,vj ∈X ,
A = {< x : TA (x), IA (x), FA (x) >, xIA ∈(X)
X} = min[IA (vi ), IA (vj )]vi ,vand j ∈X F , A (X) = min[FA (vi ), FA (vj )]v ,v ∈X . i j
IA (X) = min[IA (vi ),
andIIAA(X)
(v =
FAj )]
(X) min[I
vi ,v =∈X ,A (viA),(v
min[F IAi ),(vFj A
)](v j )]
vi ,v vi ,v,j ∈X .
j ∈X
where the functions T, I, F : X →]−0,1+[ define respectively the a A (vi ), FThe
j
and FA (X) = min[F A (vj )]vi ,vj ∈X .
Definition
and FA (X)2.4. support (vjofof X ⊂A ofi ),the single,vvalued Neutrosophic set
truth-membership function, an indeterminacy-membership Definition = min[F
2.4. TheAand
(v FF
i ),
support AA(X) =vX
)] min[F
i ,v⊂ A.Aof(vthe
j ∈X
Fsingle
A (vj )]v i j ∈X .Neutrosophic set
valued
A = {< x : T (x), I (x), F (x) >, x ∈ X}:
Definition 2.4. The support ofAX= ⊂
{<Axof: Tthe
A single A valuedA Neutrosophic set
A (x), IA (x), FA (x) >, x ∈ X}:
X ⊂ A Neutrosophic
Curr Trends Mass Comm x :Definition
, 2023
A = {< 2.4.
TA (x), IA (x), TheDefinition
FA (x) x ∈ X}: of2.4.
>,support X ⊂TheA ofsupport of valued
the single of the single valued
set
VolumeNeutrosophic
2 | Issue 1 | 32set
A = {< x : TA (x), IAA = F{<
(x), A (x) TAx(x),
x : >, IAsupp(X)
∈ X}: (x), FA (x)=>,{xx ∈∈X}:
X : T A (x), I A (x), FA (x) > 0}.
supp(X) = {x ∈ X : TA (x), IA (x), FA (x) > 0}.
Department of Mathematics · DrHenryGarrett@gmail.com
supp(X) = ·{x Manhattan,
∈ X : TA (x), NY, USA
IA (x), FA (x) > 0}.
supp(X)
Definition : supp(X)
= {x ∈ X(Neutrosophic {xSuperHyperGraph
TA (x), IA=(x), ∈AX
F (x): >
TA0}.
(x), IA (x),(NSHG)).
FA (x) > 0}.(Ref. [23],Definitio
Definition2.5 2.5 (Neutrosophic SuperHyperGraph (NSHG)). (Ref. [23],Definition
Definition 2.5 (Neutrosophic SuperHyperGraph (NSHG)). (Ref. [23],Definition 42
Let X be2.2
falsity-membership
Definition a Eulerian-Path-Cut
function
(Single Valued of points
FA (x). (objects)
For each
Neutrosophicpointwith
x in
Set). generic elements inFX
X, T[23],Definition
(Ref. A (x), IA (x), A (x) ∈ [0, 1].
denoted
2.2,p.2). by 41
truth-membership a function
truth-membership TValued
function (x), an indeterminacy-membership function Iby(x), and and
a bya
A SVNSx. A single
Let
Definition
A can valued
X bebe
2.2 (Single
written asA Tof
Eulerian-Path-Cut A (x),
Neutrosophic anset
points indeterminacy-membership
A (SVNS
(objects)
Neutrosophic withA)
Set). generic
(Ref. function
is characterized
elements in
[23],DefinitionAX IAdenoted
(x),
2.2,p.2). 41
falsity-membership XT a(X) function = FA (x).
min[T Foran each TApoint x)] inA) X, TX, (x), IA (x), Fin (x) ∈ [0,∈1].
falsity-membership function TF A (v
(x). For ), each (v point vxi ,v in
TisjA (X) T,A (x), Imin[T
A (x),
=function FA (x)
(v i ),
[0,Tby
1].a (v )]
A j vi ,vj ∈X ,
truth-membership
x. A single valued function
Neutrosophic (x), indeterminacy-membership A A IA (x), and
Let beA Eulerian-Path-Cut of
AA points iset (objects) A(SVNS jwith generic ∈X characterized
elements by X denoted
A
A SVNS A AA
SVNS
falsity-membershipcan A can be written
be A =as
written
function {< as xTFA:A(x),
T(x). For IAeach point x>, inisxX, ∈T (x),∈ and
truth-membership
x. single valued function
Neutrosophic A (x), an set (x), F A (x)A)
A (SVNS X}. A (x),function
characterized IA (x), byFA IA(x) [0, 1].a
A SVNS A can be function
falsity-membership written
functionas TF (x).an For (x),∈ and
truth-membership
Definition
A SVNS2.3.
falsity-membership A can
IAThe (X) A=
be degree
=A{<
written
function
min[I
= x{< as
(x),
:ATAAA:(x), (v
ofFAxtruth-membership,
(x). TAFor I),
i(x),A (x), Ieach
IA
each
F(v
A (x),
point x in X, TA (x),function
jF)]Av
A (x)
point
>,
(x)ix,v
x>,
in Ij∈∈XA X, (X)
X}.
x , AX}.
∈T (x),
IA (x), FA
=Imin[IA (x), FA
IA(x)
A(x)
[0, 1].a
(v∈i ),[0,I1]. A (vj )]vi ,vj ∈X ,
A SVNS2.3. A can be degree written A = {< asand x : falsity-membership
TA (x), IA (x), FA (x) >, xof ∈ theX}. subset X ⊂ A of
Definition and 2.3. The
FNeutrosophic of truth-membership,
Definition A (X) The A == min[F
degree {< setx A T= A (x),
A (v
{<iI),
of: truth-membership, FTA
xA:(x), F(v Aandj I)]
(x) >,
v iF ,vx jF ∈∈X (X)
X}. . >, =xmin[F (vi ), FA (vj )]vi ,vj ∈X .
the single valued
indeterminacy-membership and falsity-membership A (x), A (x), of A the A (x) subset ∈
X X}:⊂XA⊂ AofA of
Definition 2.3. The A degree= {< xofand TA falsity-membership
(x), IA (x), FA (x) >, x ∈ofX}.
: truth-membership, the subset
the single
the valued
single valued Neutrosophic
2.3. Neutrosophic set A set = {< x : T
= {< xA: TA (x), (x), I (x), F (x) >, x ∈ X}:
x ∈ X}:
ition 2.4. Definition
Definition
The support 2.4: The
The ofTdegree
Definition AXsupport
(X) ⊂=A of and
min[T ofA2.4.
of
truth-membership,
the
A (v Xi ),The
falsity-membership
⊂TAA
single A IA (x),
ofvalued
(vsupport
j )] vi ,vthe
A of
j ∈X single
F the (x) >,
, ANeutrosophic
of subset
X valued
⊂ AX of⊂ Aset
incidence
theof
single matrix valued of Neutrosophicset
Neutrosophic SuperHyperGraph (NSHG)
the single valued
Definition 2.3. Neutrosophic The degree of set
and = {< x : TA (x), IA (x),of
Afalsity-membership
truth-membership, FAthe (x) >, subset x ∈ X}: X ⊂ A of
< x : TA (x), Neutrosophic
I A (x),
the single valued Neutrosophic
indeterminacy-membership F A set
(x) A >, T = Ax{< (X)T
IA (X) =set
∈ A
=X}:
(X) x min[T =:
andAA
min[I
Tmin[T =
(v
A (x), ),
iA (vIT A
i
(v
),
{< x :ATAj(x),
falsity-membership
A (vi ), IA (v
T )]
(x),
jA (v vij,v)]
)] i ,v
F
j
IAA
∈X
v i ,v
,
(x)
(x),of
j ∈X ,
FAthe >,(x) >, x ∈
subset X}:
x ∈ X}: X ⊂ A of are of the form (VI, TV0 (Ei0), IV0 (Ei0), FV0 (Ei0)), the sets
j ∈X ,
the single valued Neutrosophic TA (X)set = min[TAA= {<A (v x i ),
: TTAA(x),(vjv)] I vAi ,v(x),j ∈X F ,A (x) >, x ∈ X}: V and E are crisp sets.
IA (X) = min[I (v ), I (v )] ,
supp(X) = and and ∈
{x FTAIX A(X) (X)==
(X) := =
=min[F
T
min[IiA (v
min[T (x),(v A(v
Ai ),
I),A
IT
i ),(x),
jA (v
F vij,v)]
A(v(vF j ∈X
jj)] )]vvivi,v(x) j ∈X ,, .
> 0}.
. ,, {x ∈ X : TA (x), IA (x), FA (x) > 0}.
∈X
Fsupp(X) =
A A A ,v,v
i jj ∈X
FATI(X) (X) A
min[Fmin[I (v ), IT),A(v(v )] )]v)]ivA
and AA F(X) A (X) = =min[T min[F AA A (viA ),
ii(v
iA AF (v
jA jj(v ,v∈X
i)]
,v
jv ij,v
∈X
vjji∈X,vj ∈X .
Definition 2.4. The support of X ⊂ A
IA (X) = min[IA (vi ), IA (vj )]vi ,vj ∈X , of the single valued Neutrosophic set Example 2.6. : Assume a Neutrosophic Super Hypergraph
and Fof A (X) =Amin[F (vi ), FAvalued (vj )]vi ,v j ∈X .
ition 2.5 ADefinition
{< x : T2.4.
=(Neutrosophic
Definition A (x), 2.4.The IA (x), support
The SuperHyperGraph
Fsupport
Definition A (x) IA (X) >, Xxof =⊂∈X X}:
2.5
min[I ⊂ofAAthe ofAi single
(NSHG)).
the IAsingle
(Neutrosophic
(v ), (vj )]vivalued Neutrosophic
,vj ∈X ,(Ref. Neutrosophic
SuperHyperGraph set set
[23],Definition (NSHG)). 42 (Ref. [23],Definition
I(Neutrosophic SuperHyperGraph set (NSHG) S is a43pair S = (V, E) in the mentioned Neutrosophic
Definition A (vi ), FA (vj )]vi ,vj ∈X . (NSHG)).
T2.5:
and F>, 42
A (X) = min[F
A A{<
=Definition
= x{< : TxA:(x), A (x),
2.4. IA (x), The Fsupport
A (x), A (x) FA (x) x>, ∈x
of X}:
X ∈⊂X}: A of (v the),single valued Neutrosophic
). 2.5,p.2). and F (X) = min[F F (v )] .
(Ref. A = [23], Definition set Figures in every Neutrosophic items.
=2.5, p.2). TA: Assume is
Definition {< x : T A (x),The
2.4. supp(X) IA (x), support F=A (x)
A
{x ∈ ofX
>, X∈
x :⊂X}: TA A (x),
A
of the
i (x),VF0Avalued
IA single A j (x)a>given
v i ,v j ∈X 0}.
Neutrosophic set. A
43
ume V is aDefinition
A given
= {< x set.
supp(X)
a Neutrosophic
supp(X)Assume {x=∈{x X∈ V :X is (x),Ta Igiven
A (x), A (x),
SuperHyperGraph IsingleFAset.
A (x),
(x) F > a0}.
A (x) > Neutrosophic
0}. (NSHG) S is a
SuperHyperGraph (NSHG) S is a
Neutrosophic SuperHyperGraph : T(NSHG) S is (Ref. a>pair S = (V,
: T2.4. (x), TheI (x),support F (x) >,
of x
X ∈ ⊂ X}: A of the valued Neutrosophic set 44 44
A A A
= (V, E), Definition
A = {< 2.5
where (Neutrosophic IAsupp(X) SuperHyperGraph
= {x >, ∈ X X}:
∈ A (x), I (NSHG)).
A (x), FA (x) 0}.[23],Definition 42
x : T(Neutrosophic A (x), pair (x), S =
FASuperHyperGraph
(x) (V, xE), where
where 2.5 (Neutrosophic > 0}. [23],Definition On the4243Figure (1), the Neutrosophic SuperHyperNotion, namely,
Definition 2.5 (NSHG)). (Ref. [23],Definition
E),Definition
45 45
2.5,p.2). supp(X) = {x SuperHyperGraph
∈ X : TA (x), IA(NSHG)). (x), FA (x) (Ref.
42
2.5,p.2).
2.5,p.2).
Sa isNeutrosophic V ; 46notion, is up. subsets
The Neutrosophic
of V ; 46 Algorithm is
43
Definition V is2.5 (Neutrosophic SuperHyperGraph (NSHG)). (Ref. [23],Definition
2Assume
Assume a given set. a Neutrosophic SuperHyperGraph (NSHG) S is a 43
supp(X) = {x ∈ X : TA (x), IA (x), FA (x) > 0}. 42
44
V = {V1 ,pair V ,2.5,p.2).
SS. .= . (V,
, VVnE),
Assume
Definition }isV2.5 aa isgiven
where finitea given set.set
(i)
(Neutrosophic set. ofa=SuperHyperGraph
aVNeutrosophic finite
{V1 , Vsingle
Neutrosophic ,valued
SuperHyperGraph
2 , . . .SuperHyperGraph n } a finite
V(NSHG)). Neutrosophic
(Ref. (NSHG)
set of Sfinite
(NSHG)
[23],Definition issubsets a 44 of42
single 44 valued
43 Neutrosophic
(i) 2.5,p.2).
V = {V1,V2,...,V } a finite set of finite single valued Neutrosophicly straightforward. And E3 are some empty
45
pair pair = S(V,
Assume = E),
Definition 2.5 (Neutrosophic (V, V where
E),
is where
a given set. a Neutrosophic
SuperHyperGraph (NSHG)). (Ref. [23],Definition SuperHyperGraph (NSHG) S is a 45 45
44
n
43
42
V = {(Vi ,Neutrosophic
T
(i) V
pair (V
V2.5,p.2).
(i) V(i) = Si ),
Assume
= {V=I
{V 1(V, ,,VV V V ,, subsets
(V
2E), . a),
.is.. i..where
, n}}Vaaof
F
,VVgiven
(ii) (Vfinite
V
set.
finite Vi ))
a ;
0set
= set:{(V
Neutrosophic
of
V =1 {V21, V2 , . .n. , Vn } a finite set of finite single valued Neutrosophic subsets of V ; 46 T
of finite
finite
Vi , T (V V ),
single
single
i (V I ), (V
valued
I
SuperHyperGraph
ivalued
V V i ),(V F
Neutrosophic
Neutrosophic
i ),
V F(V V i)(V ≥ ))
(NSHG)
subsets
i 0},
subsets
: of (i
T
S V
V
ofNeutrosophic
=
is;
V 46; ), 43
(V
a i I
46
45
44
V (V i SuperHyperEdges
),47F (V ) ≥ 0}, (ibut
V i = E2 is a loop47 Neutrosophic
pairAssume S = (V,VE), is wherea given set. a Neutrosophic SuperHyperGraph (NSHG) S is a
(ii)
, 2, . . . , n); SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge.
45
44
(ii)
(ii)pairV (i)
V = = V{(V
SV{(V =
==(V, {V
, T
, TE),
ii{(V 1 ,
V ,(V V(V 2
Twhere
, .
),
ii),
. .
I ,
IVV), V (V
n }
(Vi ),
1,
I i (V
a
), 2,
finite
F
FiV),V (V. .
(V
FVi ))
.
set ,
))
i : )) n);
of: finite
T
TV: V(V (V
T i ),
single
), I
i IV ), V
valued
(V
(V ),iF (V
), F Neutrosophic
V )≥ (V ) ≥
i 0}, (i = 0}, subsets
(i = of V ; 46
47
48 48
(ii) (V (V (V i IVi (ViV), FVi (Vi ) ≥ 0}, (i =
V 47 45
47
1,1,(i)
2,
2, V
.1,
. =
.. .2,
. ,, n); {V1i, V2V, . . . i, Vn }V a finite
n); set iof finiteV single valued Neutrosophic subsets of Thus V 48; in 46
48
the terms of Neutrosophic SuperHyperNeighbor, there’s
. . . , n);
{(Vi,,VTV, . (V (Vi ), FV (Vi )) : TV (Vi ), IV (Vi ), FV (Vi ) ≥ 0}, (i =
E = {E1 , E2 ,(ii) V = . . i, ),VnI}Vset
48
.(i). .1,V, E } 1 a2 finite =of{E finite of V single
1i,))E: 2single . i,),Evalued Neutrosophic subsets
=n{V ; 47 46 of
(iii) E a finite set of finite, V. .single valued } i ),a Neutrosophic
finite set subsets
of finite only one valued
NeutrosophicNeutrosophic subsets of namely,
SuperHyperEdge, E4. The
(iii) = {E ,E ,...,E 0} a finite set of finite single valued
49
E n(V 49
(iii) (ii)
E =
E =E{E V{E 2,
= . , .
{(VE . , n);
, ,. T . . (Vi ),
, E } I a (Vi ), FV (V
finite set of finite T (V
single I valued F (Vi ) ≥ 0}, (i =
Neutrosophic subsets of
=1 {E211, E. 2.2,, .E.n.n,}Enanfinite
48
(iii)(iii) i V V
} a finite set of setfinite of finite single singlevalued V
valued Neutrosophic
V
Neutrosophic subsets subsets of of 49 49 47
49
V; , TV (Vi ), IVV ;i ), FV (V
V;; 1,
(ii)
Neutrosophic
V 2, =.{(V
V ;= {E1isubsets
. . , n);
of
(V i )) : TV (Vi ), IV (Vi ), FV (Vi ) ≥ 0}, (i =
Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated
50
V;
V 48
47
50
50
50
(iii) E
1, 2, . . . , n); 2 , E , . . . , E n } a finite set of finite single valued Neutrosophic subsets of 50
49
48
means that
(iv) ), IV there’s no (E
Neutrosophic SuperHyperEdge has it as a
V{(E;= {E , E2 ,. . . , En } a finite
E = {(Ei(iv) , TV(iii)
(iv) (iv)
EE(E ==E Ei
{(E
),= i{(E I ,T1V
V (E
i ,(E
V
(E ),
),IIiF
),
TiVii(iv)
(E VV),(E
V
(EIE V
i(E i),
),FF
(E = i
set of
))
iV),
(E
V{(EF(E :
i i))
V (E i T
)) : :))
i,V
T
T
finite
single
(E
VT: (E
V VT (E
(E
i i ),
V
),
iI
(Ei I
), valued
i), I(E
V ),
V VI (E
I(E
V
V
i ),
(E iiF
(E i),
),
Neutrosophic
V),
i F
F(E ) ≥
),
F
V i(E
VV F
(Eii) 0},
(E
V
)(E
i
(i≥
≥≥)0}, subsets
=0},
))(i
0},
i (i: ==T(i
subsetsVof 52 49
of51= 49
(E i
50
51
51 (E51i ), F V i ) ≥ 0}, (i =

51

(iii)
1,1,2,
(iv) 2,.1,V
. ..;2,
E
E .=
= , .n{E {(E
, E , . . . , E } a finite set of finite
. .);,1ni,);T2V (Ei ),nIV (Ei ), FV (Ei )) : TV (Ei ), IV (Ei ), FV (Ei ) ≥ 0}, (i =Neutrosophic
single valued Neutrosophic 50
endpoint.
, 2, . . . , n ); V;
1, 2, . . ., n );
52
52
51
50 52 52
TV. (E
(v)
(v) (iv)
(v) Vii =
V(v) =1,
E∅,2,
V∅,
1, i =
E 2,
=(i
=.{(E
.{(E
(i∅,=
. . , ni1,
=(i1, =
,);
2,
2,1,...2,
), I (Ei ), F (Ei )) : T (Ei ), I (Ei ), F (Ei ) ≥ 0}, (i =
..,i,.n); . . ,Vn);
n); V

. . , ni ,);TV (Ei ), IV (Ei ), FV (Ei )) : TV (Ei ), IV (Ei ), FV (Ei ) ≥ 0}, (i =
V

V

V

53
52
51
53
53
= (iv) On 54the53525454Figure (2), the Neutrosophic SuperHyperNotion, namely,

Vi = ∅, (i(vi) 1,Ei2,
(v) V.2, .=.. (i∅, ,.n); (i = 1, .(v)
2,. ..,.n. ,V n); = ∅, (i = 1, 2, . . . , n);
52
51
53 53
(vi) (vi) E =
i = Eii∅,
1, ∅,
= (i. ∅, ,= =n(i ); 1, 2,
1, =2,1, . .2, . .,..n.,.); );,in );
(vi)
(v)

(vi)

(vii)
V

E
i
=

=
∅,
∅,
(i
(i
=
=
1, 2,
1,
.
2, . . .
n);
, n
); Neutrosophic 53
Notion, is up. The Neutrosophic Algorithm is
n=V,

Ei = ∅, (vii) (i =Garrett , n );
i 54
(vii)
(i =(vi)
(v)1, i supp(V
V2,i = .supp(V.∅,.ii)),(i= )); 1,(i V,=
2, . .(i1,
. ,E 2, 1,
n); . . ..= ,. .n); ∅,
=(vi) 1, 2, . .· .Independent
= = i.);2, , .n);
. , n); 55
i supp(V =(ii V, (i 2,=. .1, . ,2, Neutrosophicly straightforward.
of Mathematics ·E1, E2 and E3 are some empty
53
55 54
ii = ∅,
E 1, n Henry Researcher · Department
55
54 DrHenryGarrett@gmail.com
54
· Manhattan
(vii) i supp(V i)= =1,V, (i = 1,
(viii) i E
(vi) supp(E
ii = ∅,i )(i= V,
)V,=(i(i V,.==
2, .(i
.1, , n2, );2,
. . .2,
. ., .n,n); .);,);n );
55
(viii)
(vii)
supp(E 1,= 1, .......,,.nn); Neutrosophic SuperHyperEdges but E4 is a
56 54
(viii) supp(E i )1, =i = 1,2,2,
56
i supp(Vi )(viii) = iV, i(i =

(vii) supp(V i ) 2, .
V, . .
(i , = n); 56
supp(E)i = (vii)
) =V,V,(i(i= =
i 2,supp(V
1, .2,. .. ,. n); . , n );
i ) = V, (i = 1, 2, . . . , n); 55 55 55

56
(vii) iisupp(V 1, 55
t Researcher(viii) · Department supp(Ei ) = V, (i
i
of Mathematics
= 1, 2, . . . · nDrHenryGarrett@gmail.com
,
); · Manhattan, 56 NY, USA

(i =i(viii) . . ,=in1,supp(E
i

i supp(E
) = V, supp(E 1,
) =2, V,. (i );
(viii)
i(viii) i 2, . . . , n );i ) = V, (i = 1, 2, . . . , n ); 56 56 56
ent Researcher
endent · Department
Researcher of Mathematics
· Department · DrHenryGarrett@gmail.com
of Mathematics · Manhattan,
· DrHenryGarrett@gmail.com NY,NY,
· Manhattan, USAUSA
nt Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
endent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
epartment
tt · Independent Researcher· ·DrHenryGarrett@gmail.com
of Mathematics Department of Mathematics· ·Manhattan, NY, USA
DrHenryGarrett@gmail.com · Manhattan, NY, USA
Figure 1. The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions

Figure 2. The Neutrosophic SuperHyperGraphs Associated to the Neutroso
Figure 1: The Neutrosophic Super Hypergraphs Associated to
in the Neutrosophic Example (2.6) in the Neutrosophic Example (2.6)
the Neutrosophic Notions in the Neutrosophic Example (2.6) Figure 2: The Neutrosophic SuperHyperGraphs Associated to
the Neutrosophic Notions in the Neutrosophic Example (2.6)
And
(ix) the
andfollowing
the following conditions hold:hold:
conditions Neutrosophic SuperHyperEdge. Thus in the terms of Neutrosophic
TV0 (Ei0) ≤ min [TV 0(VI), TV 0(VJ)] VI, Vj∈Ei0, Neutrosophic SuperHyperEdge.
SuperHyperNeighbor, Thus
there’s only one in the terms
Neutrosophic of
SuperHyperEdg
TV (Ei ) ≤ min[TV (Vi ), TV (Vj )]Vi ,Vj ∈Ei , Neutrosophic SuperHyperNeighbor,
E4 . The Neutrosophic SuperHyperVertex,there’s V3 is only
Neutrosophicone isolated
IV0 (Ei0) ≤ min[IV 0(Vi),IV 0(Vj)]Vi,Vj∈Ei0, and where i0
there’s no Neutrosophic SuperHyperEdge has it as a Neutrosophic en
= 1,2,...,n0. Here the Neutrosophic SuperHyperEdges
IV (Ei ) ≤ min[I (NSHE) Neutrosophic SuperHyperEdge, namely, E4. The Neutrosophic
V (Vi ), IV (Vj )]Vi ,Vj ∈Ei ,
Ej0 and the Neutrosophic SuperHyperVertices (NSHV) VJ SuperHyperVertex,
• On the Figure (3), V3theisSuperHyperNotion,
Neutrosophic isolated means
namely, SuperHyperGirth
and FV (Ei ) ≤ min[FV (Vi ), FV (Vj )]Vi ,Vj ∈Eithat there’s no ENeutrosophic SuperHyperEdge has butit Eas4 isa a SuperH
are single valued Neutrosophic sets. TV 0(Vi), IV 0(Vi), and E1 , E2 and 3 are some empty SuperHyperEdges
FV 0(Vi)
wheredenote
i = 1,the . , n . of truth-membership, the degree Neutrosophic
2, . .degree Thus in the endpoint.
terms57 of SuperHyperNeighbor, there’s only one SuperHy
of indeterminacy-membership and the degree of falsity- namely, E4 .
Here the Neutrosophic SuperHyperEdges (NSHE) Ej and the Neutrosophic
membership the Neutrosophic
(NSHV) Vj SuperHyperVertex (NSHV) Visets.• TOn • Onthe Figure(4),(3), thenoSuperHyperNotion, namely,
58
SuperHyperVertices are single valued Neutrosophic the Figure

V (Vi ), IV (Vi ),
there’s empty SuperHyperEdge but E3 are a lo
SuperHyperGirth, is up. E1, E2 and E3 are some empty
59
to the Neutrosophic SuperHyperVertex (NSHV)
and FV (Vi ) denote the degree of truth-membership, the degree of V., and) denote SuperHyperEdge on
60
{F } and there are some SuperHyperEdges, nam
the degree of truth membership, the degree of indeterminacy-
indeterminacy-membership and the degree of falsity-membership the Neutrosophic SuperHyperEdges
{H, V 1 , V3 }, but E4
alongside
61
is a
E SuperHyperEdge.
2 on {O, H, V 4 , V3 }Thus
and in
E 4the
, E 5terms
on {N, V 1 , V2 ,
membership and the degree of falsity-membership
SuperHyperVertex (NSHV) Vi to the Neutrosophic SuperHyperVertex •(NSHV) of the of SuperHyperNeighbor,
On theV. Figure (5),there’s
62 there’s only one SuperHyperEdge,
neither empty SuperHyperEdge nor loop
Neutrosophic
TV (Ei ), TV (ESuperHyperEdge
(NSHE)
i ), and TV (Ei ) denote theEi0 to theofNeutrosophic
degree truth-membership, namely,
the E4. of
degree
SuperHyperEdge. 63
SuperHyperEdge
indeterminacy-membership (NSHE) and E. Thus, the ii0th
the degree element of the of the Neutrosophic
of falsity-membership 64
SuperHyperEdge (NSHE) Ei to the Neutrosophic SuperHyperEdge (NSHE) • On the Figure (6),
E. Thus, 65 there’s neither empty SuperHyperEdge nor loop
Curr
the ii Trends

Mass
th element Comm
of the incidence SuperHyperEdge.
, 2023 matrix of Neutrosophic SuperHyperGraph (NSHG) 66 Volume 2 | Issue 1 | 33
are of the form (Vi , TV (Ei ), IV (Ei ), FV (Ei )), the sets V and E are crisp sets. 67
• On the Figure (7), there’s neither empty SuperHyperEdge nor loop
Example 2.6. Assume a Neutrosophic SuperHyperGraph (NSHG) S is aSuperHyperEdge. pair 68
S = (V, E) in the mentioned Neutrosophic Figures in every Neutrosophic • Onitems. 69

the Figure (8), there’s neither empty SuperHyperEdge nor loop
SuperHyperEdge.
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, N
• On the Figure (4), there’s no empty SuperHyperEdge but

E3 are a loop SuperHyperEdge on {F} and there are some
SuperHyperEdges, namely, E1 on {H,V1,V3}, alongside E2 on
{O,H,V4,V3} and E4,E5 on {N,V1,V2,V3,F}.
• On the Figure (5), there’s neither empty SuperHyperEdge nor

loop SuperHyperEdge.
t Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
• On
t Researcher the Figure (9),
· Department there’s neither
of Mathematics empty SuperHyperEdge nor
· DrHenryGarrett@gmail.com · Manhattan,
FigureNY, USANeutrosophic SuperHyperGraphs Associated to the Neutrosophic
5. The
loop SuperHyperEdge. in the Neutrosophic Example (2.6)
Figure 5. The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic
loop SuperHyperEdge. Figure
in the5:Neutrosophic
The Neutrosophic SuperHyperGraphs Associated to
Example (2.6)
• On the Figure (11), there’s neither empty SuperHyperEdge nor the Neutrosophic Notions in the Neutrosophic Example (2.6)

in the Neutrosophic Example (2.6)
Henry Garrett · Independent

Figure 3. The Neutrosophic SuperHyperGraphs Researcher
Associated to · Department
the Neutrosophic Notionsof Mathematics · DrHenryGarrett@gmail.com · Manhattan
Figure
in 3: The Neutrosophic
the Neutrosophic Super Hypergraphs Associated to
Example (2.6)
the Neutrosophic Notions in the Neutrosophic Example (2.6) Figure 6. The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic
Figure
in the 6: The Neutrosophic
Neutrosophic SuperHyperGraphs Associated to
Example (2.6)
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, N

Figure
in 4:The Neutrosophic
the Neutrosophic Super Hypergraphs Associated to
Example (2.6)

Figure
in 7: The Neutrosophic
the Neutrosophic SuperHyperGraphs Associated to
Example (2.6)
the Neutrosophic
Figure 4. The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions Notions in the Neutrosophic Example (2.6)
Curr Trends Mass Comm, 2023 Volume 2 | Issue 1 | 34
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan
ent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

Figure 8: The Neutrosophic SuperHyperGraphs Associated to Figure 11. The Neutrosophic SuperHyperGraphs Associated to the N
the Neutrosophic Notions in the Neutrosophic Example (2.6) Figure 11:inThe
Notions the Neutrosophic SuperHyperGraphs
Neutrosophic Example (2.6) Associated to
SuperHyperEdge.
ent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, •NY, OnUSA
the
• OnFigure (13), there’s
the Figure neitherneither
(13), there’s emptyempty
SuperHyperEdge
SuperHyperEdgenor nor loop
SuperHyperEdge.
• On the
SuperHyperEdge
SuperHyperEdge.
SuperHyperEdge.
• On theSuperHyperEdge.
Figure (17), there’s neither empty SuperHyperEdge nor
• On theSuperHyperEdge.
in the Neutrosophic Example (2.6) • On theSuperHyperEdge.
Figure 9. The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic • On the
the Figure
Notions neitherneither
SuperHyperEdge
SuperHyperEdge.
Figure 9: The Neutrosophic SuperHyperGraphs Associated to loop SuperHyperEdge.
the Neutrosophic Notions in the Neutrosophic Example (2.6) • On the
SuperHyperEdge
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
SuperHyperEdge.
• On the
SuperHyperEdge
SuperHyperEdge.
SuperHyperEdge.

Figure
Notions10: TheNeutrosophic
in the Neutrosophic SuperHyperGraphs
Example (2.6) Associated to Figure 12: The
Figure 12. Neutrosophic
The NeutrosophicSuperHyperGraphs Associated
SuperHyperGraphs Associated to Neutrosoph
to the
Notions in the Neutrosophic Example (2.6)
the Neutrosophic Notions in the Neutrosophic Example (2.6) the Neutrosophic Notions in the Neutrosophic Example (2.6)


Figure 14. The Neutrosophic SuperHyperGraphs Associated to the N

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, U
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan,
Figure 15. The Neutrosophic SuperHyperGraphs Associated to the N

Figure 15: The Neutrosophic SuperHyperGraphs Associated to
Figure
nt Researcher 13. TheofNeutrosophic
· Department Mathematics ·SuperHyperGraphs Associated
DrHenryGarrett@gmail.com the Neutrosophic
to the NY, USA Notions in the Neutrosophic Example (2.6)
Neutrosophic
· Manhattan,
Figure
Example (2.6) Associated to

Figure 16. The Neutrosophic SuperHyperGraphs Associated to the Ne

Figure
Notions16:
in The NeutrosophicExample
the Neutrosophic SuperHyperGraphs
(2.6) Associated to


Figure
Figure 17. The Neutrosophic SuperHyperGraphs Associated to the Ne

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, U
political science international, 2023 Volume 2 | Issue 1 | 36

Figure 20. The Neutrosophic SuperHyperGraphs Associated to the Neu




Figure 21:inThe NeutrosophicExample
SuperHyperGraphs Associated to
Henry Garrett · Independent ResearcherNotions the Neutrosophic
· Department (2.6)
of Mathematics · DrHenryGarrett@gmail.com · Manhattan,
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan,
Figure
nt Researcher 19. TheofNeutrosophic
· Department MathematicsSuperHyperGraphs Associated to· the
· DrHenryGarrett@gmail.com Neutrosophic
Manhattan, NY, USA
Figure
dent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

ent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, Notions
NY, USAin the Neutrosophic Example (2.6)
Definition 2.7 (Characterization of the Neutrosophic SuperHyperGraph (N
(Ref. [23],Definition 2.7,p.3).
Definition 2.7: (Characterization of the Neutrosophic
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E
SuperHyperGraph (NSHG)). (Ref.
Neutrosophic SuperHyperEdges [23],
(NSHE) Ei Definition 2.7, p.3). SuperHyp
and the Neutrosophic
Assume
(NSHV) Vi of Neutrosophic SuperHyperGraph (NSHG) S =S(V,
a Neutrosophic SuperHyperGraph (NSHG) isE)a could be
pair S = (V, E).
characterized The Neutrosophic
as follow-up items. SuperHyperEdges (NSHE)
Ei0 and the Neutrosophic Super hyper vertices (NSHV) Vi of
(i) If |Vi | = 1, then Vi is called vertex;
Neutrosophic SuperHyperGraph (NSHG) S = (V, E) could be
characterized
(ii) if |Vi | ≥ 1,as then
follow-up items.
Vi is called If |Vi| = 1, then Vi is called
SuperVertex;
vertex;
(iii) if for all Vi s are incident in Ei , |Vi | = 1, andif|Efor
if |Vi| ≥ 1, then Vi is called SuperVertex; all Vis are
i | = 2, then Ei is calle
incident in
Figure 20. The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Ei0, |Vi| = 1, and |Ei0| = 2, then Ei0 is called edge;
Figure 20: The Neutrosophic SuperHyperGraphs
Notions in the Neutrosophic Example (2.6) Associated to if for
(iv) ifall
forVis
all Vare incident
i s are incidentin Ei0,
in Ei ,|Vi|
|Vi |==1,
1, and |Ei0|
and |E i | ≥≥ 2,2,then
thenEi is calle
the Neutrosophic Notions in the Neutrosophic Example (2.6) Ei0 is HyperEdge;
called Hyper Edge; if there’s a Vi is incident in Ei0 such
(v) if there’s a Vi is incident in Ei such that |Vi | ≥ 1, and |Ei | = 2, then E
Curr Trends Mass Comm, 2023 SuperEdge; Volume 2 | Issue 1 | 37
(vi) if there’s a Vi is incident in Ei such that |Vi | ≥ 1, and |Ei | ≥ 2, then E
SuperHyperEdge.
If we choose different types of binary operations, then we could get hugel
that |Vi| ≥ 1, and |Ei0| = 2, then Ei0 is called Super Edge; incidence matrix of Neutrosophic SuperHyperGraph (NSHG)
if there’s a Vi is incident in Ei0 such that |Vi| ≥ 1, and |Ei0| ≥ 2, are of the form, the sets V and E are crisp sets.
then Ei0 is called SuperHyperEdge. If we choose different types
of binary operations, then we could get hugely diverse 143 types Definition 2.12: (Characterization of the Neutrosophic
of general forms of Neutrosophic Super Hyper graph (NSHG). SuperHyperGraph (NSHG)). (Ref. [23], Definition 2.7, p.3).
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a
Definition 2.8: (t-norm). (Ref. [23], Definition 2.7, p.3). A binary pair S = (V, E). The Neutrosophic SuperHyperEdges (NSHE)
operation ⊗ : [0,1] × [0,1] → [0,1] is a t-norm if it satisfies the Ei0 and the Neutrosophic SuperHyperVertices (NSHV) Vi of
following for x,y,z,w ∈ [0,1]: Neutrosophic SuperHyperGraph (NSHG) S = (V, E) could be
(i) 1 ⊗ x = x; characterized as follow-up items.
(ii) x ⊗ y =
Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA y ⊗ x;
tt · Independent
Department
Department (iii) of of Mathematics X ⊗ (y ⊗ z)···=Department
Researcher
Mathematics (x ⊗ y) ⊗ z;of(IV)
DrHenryGarrett@gmail.com Mathematics If w ≤ x and··· yDrHenryGarrett@gmail.com ≤ z then (i)
Manhattan,
Manhattan, NY,
NY, If |Vi|USA
USA = 1, then· Vi Manhattan,
is called vertex; NY, USA
w ⊗ y ≤ x ⊗ z. (ii) if |Vi| ≥ 1, then Vi is called SuperVertex;
(iv) If w ≤ x and y ≤ z then w ⊗ y ≤ x ⊗ z. (iii) if for all Vis are incident 151 in Ei0, |Vi| = 1, and |Ei0| = 2, then
) IfIf w w≤ ≤ xxDefinition
and yy ≤
and ≤ zz then 2.9.:(iv)
then w w⊗ ⊗ The yIf
y≤ ≤wxx≤ degree
⊗ ⊗xz. z. and yof≤ z truth-membership, then w ⊗ y ≤ x ⊗ z. Ei0 is called edge; 151
151
151
Definition 2.9. The degree and of falsity-membership
truth-membership, of the (iv)
indeterminacy-membership if for all Vis are incident in Ei0, |Vi| = 1, and |Ei0| ≥ 2, then
inition
nition 2.9. 2.9. The The degree degreeDefinition of of truth-membership,
truth-membership, 2.9. The degree of truth-membership, indeterminacy-membership
subset
and falsity-membership X ⊂ A of the single valued of the subsetindeterminacy-membership
Neutrosophic Xset ⊂ A of the singleEi0 valued is called HyperEdge;
Neutrosophic set
falsity-membership of ofand thefalsity-membership subset X X ⊂A A of of the the single ofsingle thevalued subset
valued X ⊂ A of the
Neutrosophic setsingle valued Neutrosophic set
falsity-membership
A = {< x : TA (x), the IA (x), subset FA (x) ⊂ >, x ∈ X} (with (with respect
respect Neutrosophic
to to(with
t-norm (v)respect
if Tthere’s set
norm ):a Vi is incident in Ei0 such that |Vi| ≥ 1, and |Ei0| =
{< xx :: TTAA(x),
{< (x),IIAA(x), (x), F (x) A
(x) >, =>,xx ∈∈ X} {< x X} A: T (x),
(with respect I (x),
respect F (x)
to t-norm >,
t-norm TTnorm x ∈ X} ): to t-norm Tnorm ):
Tnorm):FofAAMathematics (with to norm):
A A
t-norm
nt Researcher · Department · DrHenryGarrett@gmail.com · Manhattan, NY, USA
2, then Ei0 is called SuperEdge;
T· ADrHenryGarrett@gmail.com
(X) = Tnorm [TA (vi ),· Manhattan, T (vj )]viNY, ∈X , If there’s a VI is incident in Ei0 such that |Vi| ≥ 1, and |Ei0|
(vi)
dent
nt Researcher · Department
Researcher· Department
TTA ofA(X)
of(X) Mathematics
Mathematics = = TTnorm norm [T[TAA(v (vii),),TTAA(v
· DrHenryGarrett@gmail.com (vjj)] T)]Avi(X) ,vjj·∈X =,,ATnorm
Manhattan,
∈X [T,vAjUSA
NY, (v USAi ), TA (vj )]vi ,vj ∈X ,
vi ,v
≥ 2, then Ei0 is called SuperHyperEdge.
w ⊗IA (X) ⊗= z.),TInorm [IA (vi ), IA (vj )]vi ,vj ∈X ,
(vjj)])]IvvAii,v(X) ∈X= ,, Tnorm [IA (vi ), IA (vj )]vi ,vj ∈X ,
(iv) If w ≤ x and ≤ z then
(iv)If Ifw w≤≤x xand
(iv)
IIandAA(X)
y(X)
y y≤≤z zthen
= =then TTnorm ww
norm
⊗⊗ y y≤≤
[I≤A
y [I
xx
x(v
A(v
⊗⊗ ii),
z. z. IA A(v ,vjj∈X
151
This . SuperHyperModel is too messy and too dense. Thus

151151
Definition 2.9. The degree and FA (X) = Tnormindeterminacy-membership
of truth-membership, [FA (vi ), FA (vj )]vi ,vj ∈X
and
and FFThe (X)
(X) = =ofthe Ttruth-membership,
Tof [FAAX(v
[F (v⊂ii),), F and F)])]Av(X)
(vindeterminacy-membership =..Tnorm [FA (v i ), FA (vj )]vi ,vj ∈X .
Definition
Definition
and falsity-membership 2.9. 2.9.The A Adegree degree of normtruth-membership,
normsubset AF ofA (v
Athe jjsingle vii,v ,vvalued
indeterminacy-membership jj∈X
∈X Neutrosophicthere’s set a need to have some restrictions and conditions on
and
Definition falsity-membership
x : TA (x),2.10. IA (x), FThe ofthe the xsubset
support X⊂of ⊂AAX ofthe⊂ thesingle
Ato singleof valued
the singleNeutrosophicsetsetNeutrosophic
Aand = {< falsity-membership of
A (x) >, subset ∈ X}X(with of
respect valued
t-norm T norm ): valued
Neutrosophic set
inition
nition 2.10. Definition
2.10.A
A = {< The= {< The x : T 2.10.:
support
(x), I (x), The
Definition F of support
(x) X >,
>, x⊂∈ A ⊂ x ∈ A X} of
2.10. of X the
(with ⊂The A
single
respect of
supportto the
valued
t-norm single of
T X valued
Neutrosophic
):⊂ A of SuperHyperGraph.
the set single The special case
valued Neutrosophic set of this SuperHyperGraph
A = {< xA support
x : T (x), A I (x), A F of A X
(x) X}of (with thexrespect single valuedTnorm
to t-norm Neutrosophic
norm ): set
: TAA(x),T IA(X) A (x), F (x) >, ∈ X}:
{< x : T Neutrosophic
(x),
{< x : TAA(x), IAA(x), FAA(x)TAT>, I (x), F set (x) A A=>,A (X)
{<x
x=∈=Tnorm=∈x TX}:
X}: :
norm
Tnorm
A
T A[T(x),
[T[T
A (vi ),IT
A (v
A
i jA(x),(vj )]vF,vA∈X (x) , >, x ∈ X}: makes the patterns and
(X) A (v i ),i ),
TAT(v A (v j )]jv)],vv ,v ∈X , ,
Regularities.
i ij j ∈X
IA (X) supp(X) = Tnorm= [IA{x (vi ),∈IAX (vj :)]v T ,vA∈X (x), , IA (x), FA (x) > 0}.
supp(X) = =I{x I(X)
{x A (X) ∈=X =Tnorm
X T:norm T[IAA [I(v (v
(x), IAIIsupp(X)
i ),i ),
i j
A (v
(v )]jv)],v
j(x), F ∈X =
,(x) , {x > ∈0}. X : TA (x), IA (x), FA (x) > 0}.
supp(X) A
∈
and FA (X) = Tnorm [FA (vi ),
: T A A
(x), Ii ij j
A (x),
A F (v )]A
v ,v
F ∈X A (x) >.
0}.
A j v ,v ∈X
andFAF(X) A (X) ==Tnorm Tnorm [F[F A (v i ),
FAFNeutrosophic
A (vj )]jv)],v . . Definition(NSHG)). 2.13.: A graph is SuperHyperUniform if
i j
Definition 2.11. and (General Forms A (v i ),of i ij j
(v v ,v ∈X ∈X
SuperHyperGraph 152
inition 2.11.
Definition (General 2.10. The Definition
Forms support of Neutrosophic
of X 2.11.
⊂ A of the(General
singleSuperHyperGraph
valued Forms Neutrosophic of Neutrosophic (NSHG)).
set SuperHyperGraph (NSHG)).
nition 2.11. Definition (General 2.11.: Forms (General
of ofNeutrosophic Forms of
SuperHyperGraph Neutrosophic (NSHG)). it’s SuperHyperGraph and the number of elements of
152 152
Definition 2.10. The support ofXX⊂⊂A Aof of thesingle single valuedNeutrosophicNeutrosophic set
Definition
AA Assume
{<{<
2.10. V The is a
support given set.
xx∈∈VX}: a Neutrosophic
the valued SuperHyperGraph set (NSHG) 152
S is a 153
Assume V =is
ssume V SuperHyperGraph = a xgiven: T: AT(x),
x (x), set.IAI (x), a
(x), FAAssume
FNeutrosophic
(x)(x) >,>, X}: is a given
SuperHyperGraph set. a Neutrosophic (NSHG) SuperHyperGraph
S is a (NSHG) S is a
is aSgiven = (V,set. E),awhere (NSHG)). Assume
Neutrosophic V is a given set.(NSHG)
SuperHyperGraph A SuperHyperEdges S is a are the same. To get more visions on
153
A = {< x : T (x),
A I (x),
A F (x)
A >, x ∈ X}: 0 153
pair A A A 153
154
SS = = (V,(V,E),E), where where pair S = ∈(V, E), where 154
Neutrosophic SuperHyperGraph supp(X) = {x X :
(NSHG)
T (x), I (x),
SFAFis(x)
F
a >153
(x) > 0}.pair S = (V,
0}.
SuperHyperUniform, the some SuperHyperClasses are
154
supp(X)=={x{x∈ ∈XX: :TA
supp(X) T(x),
A A (x), IAI(x),
A (x),
A A (x)
A >0}. 154

(i) V = {V , V , . . . , V } a finite set of finite single valued Neutrosophic subsets of V ;
E), , Vwhere introduced. VV ;; It155
155makes to havesubsetsSuperHyperUniform more
1(General 2 155
) VV = = {V{VDefinition
Definition , . . . 2.11. ,VV 2.11.n}}(General aa(General finite (i)Forms Forms V n=
set
Forms ofofof{V 1 , V2single
Neutrosophic
finite
Neutrosophic , . . .SuperHyperGraph
single n } a finite
, SuperHyperGraph
Vvalued
valued
SuperHyperGraph Neutrosophic set of finite
(NSHG)).
(NSHG)). singleof
subsets ofvalued Neutrosophic of V ; 155
11, V22, . . . ,2.11. finite set of finite Neutrosophic subsets
152
Definition n of Neutrosophic (NSHG)).
152152
Assume
AssumeV
Assume V V is a given set. a Neutrosophic SuperHyperGraph (NSHG) S is a
is isa agiven givenset. set.a aNeutrosophic NeutrosophicSuperHyperGraph SuperHyperGraph(NSHG) (NSHG)S Sis isa aunderstandable.
153
(ii) =V = {(V i , TV (Vi ), IV (Vi ), FV (Vi )) : TV (Vi ),IV (Vi ), FV (Vi ) ≥ 0}, (i =
153153
156
pair
(i) , ST
pair
VS==
(V,
=(V,
E),
ii),{V
),E), wherewhere
),(ii) FFnV}VV(V a= )){(V
finite :: TiT,VVT set (V(V ),),iI),
iiof VIV
IVfinite (V(V ),
ii),single
FVVFV(V (V(V )) 0},
ii)valued
: TV(i (i(V =i ), IV (Vi ), 156 F V (Vi ) ≥ 0}, (i =
.I.V.V1,V ,...,V
) VV = {(V
= {(V pair
ii, TV
SV (V(V
(V, E), Iwhere (Vi ), (V ),iF )i≥ ≥154
0},
, (V ii)) (V (V =
154154 156
V 156
1, 2, n);
2 i 157
1,2,
1, 2,......,Neutrosophic
,n);n);
(i)
(i) V
(i)V V=={V{V = {V 1 , 1V,22V, 2.subsets
1
, V , . . . , V
,. .. ., .V,nV }
n}n } a of
a 1,
finite
afinitefinite 2,
V set0 .
set . .
; setofoffinite
of , n);
finite
finitesingle single
singlevalued valued
valuedNeutrosophic Neutrosophic
Neutrosophicsubsets subsetsofofV VDefinition
subsets
155155155 of V ;
; ; 2.14: 157
157 Assume a Neutrosophic SuperHyperGraph. 157
{E(ii) There areof some subsets SuperHyperClasses as

(iii)
(ii)VV V=E ={(V ={(V, {E iT,V TV(V 1(V,(V E),i ),I2IVV,IV.(V .(V . ),i,),FEFVF (V }i ))ii))
(V a)) :finite (V),.iset of finite )single
i))≥ ≥0}, (ivalued Neutrosophic of
(ii) (V ,:TE TTVV(V ),
I.V,IVE (V ),
),VFF (Vi(V 0}, (i=
(i == 158
(ii) ii), i i), VnV(V i≥

} a(iii)

Eset

= of :1finite
{E
2 , i.single
(V i ),
ii}F aVV(Vfinite 0}, set of finite single valued 158 Neutrosophic subsets of
156156156
)E E= = {E , E1,
11, E1, 22,1,
, .2,.........,,,.in);
2,.V ,E
V
finite
nn } a finite set of finite single valued Neutrosophic subsets of
V
valued Neutrosophic subsets
; E
n 158
n); 157157157
158
159
V
V; ; V ; 159 159
(iii) EE ={E 1 ,{E 2,1,2.,E
.,.....2.,,,...,E }}}aa0} a set finite setsingle of valued finite single valued Follows.
159
(iii)
(iii)(iii)E E= ={E 1E , 2E .EE, nE nn afinite
finite
finite setofof
set offinitefinite
finite single valued
valued Neutrosophic
Neutrosophic
Neutrosophic subsets
subsets
subsets
158158158 ofof of
n
(iv) VV ;VE ; = {(E i , T (Ei ), IV (Ei ), F V (E i )) : TV (Ei), IV(Ei ), F V (E i ) ≥ 0}, (i =
(Ei ) ≥ 0}, (i if=it’s only160one SuperVertex
Neutrosophic
, T (Ei ), Isubsets ),of V(E ; {(E T(i) (E its Neutrosophic ), FVSuperHyperPath
160
V i=
(iv) FE = )) :i ,T T (E (Eii),),),IIIVV(E (Eii),),),FFFVV(E (Eii)))) ≥: 0},
)E E= = {(E{(E (E (E 159159159
(E (i ), I (Ei160
ii , TVV1, (E2,i .),. I. V,Vn(E ); ii ), FVV (Eii )) : TVVV(E i V
i V i ≥ 0},V (i = V 160
(iv) === as intersection161 amid two given SuperHyperEdges

161
with two

nn(iv) E= ={(E {(E T,VVT(E (E i),), IIVVI(E (E i1, 2,
FFVFV.(E
), V.(E(E.i i,))i n )): :);
:TVTT(E (E ),
IVII(E (E ii ),),VFF(E VV(E ))≥0},
≥0}, (i(i(i

1,2,
1, 2,......,(iv)
,(iv) );
);EE1, ii ,iT

(E
V ii ),

V(E

i),i),
))

V (E
V i ),

ii ),

V (E
V i ),

F
i )i i≥
(E 0},
160160160
161 161
2,2, . .. ... .,,.n ,n); );
(v) Vi = ∅, (i = 1, 2, . . . , n);
1,1, 2, . n ); 161161161
exceptions; 162
) VVii = = ∅,∅, (v) (i(v) = 1, 2, . .(i= ..,=,= n); ......(v) , n);Vi = ∅, (i = 1, 2, . . . , n);
(i =V VViiV1, 6= 2, ∅,.(i(i.(i n); 1,2,...,n); (ii) it’s SuperHyperCycle if it’s only one SuperVertex as
162
i =
(v)
(v)
i
=
= ∅,
∅, ∅, = 1,
1, 1,
2,
2, 2,

..,,.n);
n);

162162
162
162
162
(vi)(vi) iE0
Ei=6=

= ∅, (i = 1, 2, . . . , n );
E= 2,(i∅, ....=.(i.,1, =2,2, .1,2,...,n ); i ); intersection amid two given SuperHyperEdges;
(vi)
i∅,∅,(i
= (i
==
0 0
); = ∅, (i = 1, 2, . . . , n ); 163
,n1, ......,,.nn , n);
E
)E Eii = = ∅, (vi)
∅,(vi) (iE
(i i=

i =
1,
1,

∅,2, 1, n2, (vi)
.);
);
E 163163
163 163 163
163

(vii)
(vii)(vii)
(vii)
i supp(V
supp(V supp(V i ) )
i= V, (i = V, ) (i
== = 1,V,
1,
2, 2,
. .
(i.
. ., . ,
n);
= n); 1, 2, . . . , n); 164164 (iii) it’s SuperHyperStar it’s only one SuperVertex as intersection
(vii) i supp(V
i
i i ) = V,(vii) i (i = 1, 2, . . . , n); 164
i supp(V ) = V, (i = 1, 2, . . . , n); amid all SuperHyperEdges;
164
) supp(V ) = V, V, (i = =) = 1,V,2, 2,......,,n); n);
ii supp(V ) = (i 1, 164
ii i 164
i
164
(viii)
(viii) supp(E
isupp(E i )i = V, (i(i ==1,1, 2,2, . . .. ., .n,n). ). 165165

1, 2, . . . , n ). (iv) it’s SuperHyperBipartite
165 it’s only one SuperVertex as

(viii) supp(E ) = V, (i = 1, 2, . .
. , n ).
(viii) i i supp(E i
i ) = V, (i = 1, 2, . . . , n ). 165
) supp(E Herethe )Neutrosophic

the = V, (i
Neutrosophic (i = (viii)
=SuperHyperEdges
1,2, 2,.....i.,,n
SuperHyperEdges supp(E
n ).). (NSHE) (NSHE) i ) = EjEV, and (ithethe =Neutrosophic
Neutrosophic
ii supp(E ii ) Neutrosophic
= V, 1,
Here jand 165
Here the Neutrosophic SuperHyperEdges (NSHE) Ej0 intersection amid two given SuperHyperEdges and these
166166 165
165
Here the
SuperHyperVertices(NSHV) SuperHyperEdges
(NSHV)VjVare (NSHE) E j and the Neutrosophic 166
SuperHyperVertices j are singlevalued
single valuedNeutrosophic
Neutrosophicsets. sets.TVTV(V(V
),
167167 i ),
I IV(V(V i ),
),
Here the Neutrosophic j SuperHyperEdges (NSHE)
sets.ETjV (V
i
and V
IVthe
i
Neutrosophic
andandFVFthe
SuperHyperVertices )Neutrosophic (NSHV) V
SuperHyperVertices
are single valued Neutrosophic
(NSHV) VJ iare ), (NSHE)
SuperVertices,
(Vi ),
forming two separate sets, has no 166 SuperHyperEdge
166
e the
the Neutrosophic
Neutrosophic
and V(V(V

i ) idenote denote
SuperHyperEdges
SuperHyperEdges the theHeredegree degree theof of Neutrosophic
truth-membership,
truth-membership, (NSHE) E
(NSHE) Ethe SuperHyperEdges
the
and anddegree
degree the
the

ofof Neutrosophic 168168
Neutrosophic
167
Ej and the 166 Neutrosophic
and SuperHyperVertices
FV (Vi ) denote
the degree (NSHV)
and of truth-membership,
the degree Vjofofare single jjthe
falsity-membership valued
degree of theNeutrosophic
Neutrosophic sets. TV (Vi ), 166
IV (Vi ), 167
single valued Neutrosophic sets. TV 0(Vi), IV 0(Vi), and in common;
168
indeterminacy-membership and
SuperHyperVertices the degree falsity-membership
(NSHV) V the are Neutrosophic
single
169169
valued Neutrosophic sets. T (V ), I (Vi ),
erHyperVertices
rHyperVertices (NSHV) V are single valued Neutrosophic sets. T (V ), I (V ),
FV(NSHV) Vjj are i single valued Neutrosophic sets. theTVdegree (Vii), IofVV (Vii),
j V i V 167
SuperHyperVertex (NSHV) Vand the degree of falsity-membership the Neutrosophic VV. 167
iVto to the Neutrosophic SuperHyperVertex (NSHV) V.
and
SuperHyperVertex (Vi ) denote (NSHV) the degree
the Neutrosophic of truth-membership,
SuperHyperVertex (NSHV)
170170
169 167
FV V i0(Vi) denote the
)degree of truth-membership, of the degree V.of(v) it’s the SuperHyperMultiPartite it’s only one168SuperVertex as
168
FFVV(V (Vii))SuperHyperVertex
Tdenote
T (E
denote (E ),
i ),
Tthe the
T (E

V (E degree
i ),
i degree
), and andTand
(NSHV) Tof of
(E
V

(E VF )Vto
iidenote
(V
thei )the
truth-membership,
denote
i truth-membership,
denote
Neutrosophic
the degreeofthe
degree degree
SuperHyperVertex
the
oftruth-membership,
truth-membership,
the degree
degree truth-membership,
ofof
the (NSHV)
the degreeof
degree
171171
170 degree168 of
V V V and the degree of falsity-membership the Neutrosophic 168
of indeterminacy-membership and the degree of falsity- intersection amid two given SuperHyperEdges and these Super
Tindeterminacy-membership
(E ), T (E ), and T (E ) denote the degree of truth-membership, the degree of 169
i i indeterminacy-membership

and the
i and the degree
degreeof of of falsity-membership
falsity-membership and ofthe of the Neutrosophic
degree
the Neutrosophic 171
of falsity-membership the Neutrosophic
terminacy-membership
terminacy-membership V V and
and the V the
anddegree
degree falsity-membership the
172172
Neutrosophic
Viofto falsity-membership the Neutrosophic 169 169
SuperHyperVertex
SuperHyperEdge(NSHE)
SuperHyperEdge (NSHE) E(NSHV)
iEitoto
the
the degree
theNeutrosophic
Neutrosophic of the Neutrosophic
falsity-membership
SuperHyperEdge
SuperHyperEdge of(NSHE)
theSuperHyperVertex
(NSHE) Neutrosophic
E.E.Thus,Thus, (NSHV) 169
V.
membership the Neutrosophic SuperHyperVertex (NSHV) Vi Vertices, forming multi separate sets, has no SuperHyperEdge
173173172 170
erHyperVertex
rHyperVertex SuperHyperEdge (NSHV)
(NSHV) (NSHE) V
Vthe SuperHyperVertex

to to Ethe the
i to the
Neutrosophic
Neutrosophic
Neutrosophic (NSHV) SuperHyperVertex
SuperHyperVertex
SuperHyperEdge V i to the Neutrosophic
(NSHV)
(NSHV) Thus, V. V. SuperHyperVertex (NSHV) V. 170
of (NSHE) E. 170
theTthe ii iithth
element
element of ofthe iiincidence
incidence matrix
matrix ofofNeutrosophic
Neutrosophic SuperHyperGraph
SuperHyperGraph (NSHG)
(NSHG)
V (E i ), TV (Ei ), and TV (E i) denote the degree truth-membership, the degree of
174174173 170
toare the Neutrosophic SuperHyperVertex (NSHV) E)V., an) denote in common;
171
Eii),),TTVV (E
E (E
the
are iii
of
),),ofth
the
andand
the
element
form formT TVV(V(E (E
(V
of
i , iT the
T
) incidence
,ViT)(E
V (E
denote i(E
Videnote
), ),
IVIi(E
V ),
(E Tthe ),
FVF
i matrix
),
i the V (E

Vdegree
(E (E
degree i),
ii )),of and
)),the the of
Neutrosophic
ofsets sets VV (E
Ttruth-membership,
and and
truth-membership,
V denote
Eare are
iSuperHyperGraph crisp
crisp the
sets.the
sets.
175175174 degree
the(NSHG) degree
degree of truth-membership,
of
of 171 the degree of 171
i
of the form (Vi , TV indeterminacy-membership
i
(Ei ), IV (Ei ), Fand the degree of falsity-membership of the Neutrosophic
171
172
are
the
terminacy-membership
terminacy-membership Definition
Definition degree
SuperHyperEdge 2.12of
2.12 (Characterization truth-membership,
and

and(NSHE)
(Characterization the
the degree

degree ofEtheof

V ofthe
(E
the
i )),
degree
the
falsity-membership
ofNeutrosophic
falsity-membership
Neutrosophic
sets V
of andand indeterminacy-
SuperHyperGraph
SuperHyperGraph
E are
the crisp
degree
of
of the
sets.
the
175
of (vi)
Neutrosophic
Neutrosophic
(NSHG)).
(NSHG)). it’s
falsity-membership SuperHyperWheel
172 of the if it’s
Neutrosophic only one 172SuperVertex as
i to the Neutrosophic SuperHyperEdge (NSHE)172E. Thus, 173
176176
erHyperEdge
rHyperEdge membership
(Ref.[23],Definition
Definition
(Ref.
the
[23],Definition
(NSHE)
(NSHE)
ii 2.12
tha element andE 2.7,p.3).
(Characterization
Ei to 2.7,p.3).
i to the
SuperHyperEdge the
the
of SuperHyperGraph
the degreeNeutrosophic
of
Neutrosophic the of falsity-membership
(NSHE)
Neutrosophic SuperHyperEdge
SuperHyperEdge E to the Neutrosophic
SuperHyperGraph
i of the
(NSHE)
(NSHG)).
(NSHE)
177177176 intersection
E. SuperHyperEdge
Thus,
E. Thus, 173 (NSHG) 174 amid
173 two given
(NSHE) SuperHyperEdges
E. Thus, 173 and one
Assume aNeutrosophic
Neutrosophic incidence
SuperHyperGraph matrix
(NSHG) S Sis isaof apair Neutrosophic
pair S S== (V, E).The The SuperHyperGraph
ii th element
i th element Neutrosophic
(Ref. Assume [23],Definition
of
Neutrosophic
are
of
of the
the
the
incidence
incidence SuperHyperEdge
SuperHyperEdges
form
2.7,p.3).
the
(V
ii th
matrix
matrix element (NSHE)
ofof (NSHG)
of the
Neutrosophic
Neutrosophic Ei0 to
incidence the Neutrosophic
SuperHyperGraph
SuperHyperGraph
(V,
matrix E).
178178177
of SuperVertex
Neutrosophic
(NSHG)
(NSHG) has one
SuperHyperGraph
174 SuperHyperEdge (NSHG) with
174 any common
i, T (E (NSHE)
i ), IE Vi (E
Neutrosophic
Assume SuperHyperEdges
a Neutrosophic SuperHyperGraph(NSHE) Eiand and ),
the
i(NSHG)
the Neutrosophic
F Neutrosophic
(E S iis )), a pair the SuperHyperVertices
S sets
= (V, V
SuperHyperVertices
179179178E).and The E are crisp sets. 174
175
off thethe formform SuperHyperEdge
(NSHV)
(NSHV) (Vii,,VTiTVVof
(V
Neutrosophic
i of(E
V (E ), Iare
ii ), IVV
Neutrosophic
Neutrosophic
SuperHyperEdges
(NSHE)
(E of V
(ESuperHyperGraph),the
),
F FE.
iiSuperHyperGraph
form
VV (EiiE
(NSHE) Thus,
(E
)),
)), (Vthe
i and
i ,(NSHG)
the
the
(NSHG) Tthe ii0th
Vsets
V(E
sets SiS= V
V
Neutrosophic element
),=(V,Iand
and
(V,
VE) (E ),
EEicould
E)could are
are of
F
bebe thei )),
(E
crisp
Vcrisp
SuperHyperVertices
180180179 SuperVertex
sets.
sets. the sets V and 175 E are crisp sets.
175
175
characterized
characterized Vi of as asfollow-up
follow-upitems. items.
Definition
(NSHV) Neutrosophic2.12 (Characterization
SuperHyperGraph (NSHG) of theSNeutrosophic = (V, E) could beSuperHyperGraph (NSHG)).
181181180
176
inition 2.12 (Characterization Definition the2.12
ofvertex; Neutrosophic (Characterization SuperHyperGraph of the Neutrosophic (NSHG)). SuperHyperGraph (NSHG)).
nition 2.12 Curr Trends
(i)(i)If(Characterization Mass i Comm
of the Neutrosophic SuperHyperGraph (NSHG)). Volume 2 | Issue 1 | 38
176
characterized as
1,1,follow-up isitems. , 2023
176
(Ref. If
|V [23],Definition
|V
i | i= |= then thenViVis called 2.7,p.3).
called vertex; 182182
181 176
177
f. [23],Definition
. [23],Definition 2.7,p.3). (Ref. [23],Definition 2.7,p.3).
|Vi |2.7,p.3).
177 177
(i) If Assume = 1, a then Neutrosophic
Vi is called vertex; SuperHyperGraph (NSHG) S is a pair S = (V, E). 182
177
The 178
Assume
ssume aa Neutrosophic
Neutrosophic SuperHyperGraph SuperHyperGraph (NSHG) Assume a Neutrosophic (NSHG) S is aa pair SuperHyperGraph pair SS = = (V, (V,E). (NSHG)
E). The The S is a pair S = (V, E). The
(NSHE) ESi isand
178 178
Neutrosophic SuperHyperEdges the Neutrosophic SuperHyperVertices 178
179
trosophic
rosophic (NSHV) SuperHyperEdges (NSHE)
SuperHyperEdges Neutrosophic (NSHE) E Eii andSuperHyperEdges
and the the Neutrosophic (NSHE)
Neutrosophic SuperHyperVertices E
SuperHyperVertices
i and the Neutrosophic 179 SuperHyperVertices 179
Vi ofofNeutrosophic SuperHyperGraph (NSHG) SNY,=USA (V, E) could be179 180
dent Researcher
HV) VVii of
nt
HV) Researcher ·
of Neutrosophic Department
· Department of (NSHV)
Mathematics
SuperHyperGraph
Mathematics · V
· of Neutrosophic
DrHenryGarrett@gmail.com (NSHG) S = (V, E) could be SuperHyperGraph
· · Manhattan,
Manhattan, NY, USA (NSHG) S = (V, E) could be
follow-up items. (NSHG) S = (V, E) could be
i 180 180
characterized as 180
181
acterized
nt Researcheras follow-upof items.
· Department characterized
Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA as follow-up items. 181 181
Example 2.15: In the Figure (23), the connected Neutrosophic

SuperHyperPath ESHP: (V, E), is highlighted and featured.
The Neutrosophic SuperHyperSet, in the Neutrosophic
SuperHyperModel (23), is the notion.
Example 2.16: In the Figure (24), the connected Neutrosophic

SuperHyperCycle 218 NSHC: (V, E), is highlighted and featured.
The obtained Neutrosophic SuperHyperSet, in the Neutrosophic
SuperHyperModel (24), is up.
Example
nt Researcher 2.17: Inof the
· Department Figure (25),
Mathematics the Garrett
connected Neutrosophic
· DrHenryGarrett@gmail.com
Henry · Independent
· Manhattan, NY, USA
Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhatta
SuperHyperStar 221 ESHS: (V, E), is Highlighted and featured.
The obtained Neutrosophic SuperHyperSet, 222 by the
Algorithm
nt Researcher in previous
· Department Neutrosophic
of Mathematics result, of the Neutrosophic
· DrHenryGarrett@gmail.com · Manhattan, NY, USA
223 SuperHyperVertices of the connected Neutrosophic
SuperHyperStar ESHS : (V,E), in Garrett
Henry 224 the Neutrosophic
· Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhatta
Figure
Figure 25:
25. A NeutrosophicSuperHyperStar
a Neutrosophic SuperHyperStar Associated
Associated to the
to the Neutrosophi
Neutrosophic Notions
the Neutrosophic in the
Example Neutrosophic Example (2.17)
(2.17)
Example 2.18. In the Neutrosophic Figure (26), the connected Neutrosop

SuperHyperBipartite ESHB : (V, E), is Neutrosophic highlighted and Neu
featured. The obtained Neutrosophic SuperHyperSet, by the Neutrosophic A
previous Neutrosophic result, of the Neutrosophic SuperHyperVertices of th
Neutrosophic SuperHyperBipartite ESHB : (V, E), in the Neutrosophic
Example 2.19. In the Figure (27), the connected Neutrosophic
SuperHyperMultipartite ESHM : (V, E), is highlighted and Neutrosophic
The obtained Neutrosophic SuperHyperSet, by the Algorithm in previous N
result, of the Neutrosophic SuperHyperVertices of the connected Neutrosop
SuperHyperMultipartite ESHM : (V, E), in the Neutrosophic SuperHyperM
Figure 23. a Neutrosophic SuperHyperPath Associated to the Notions isinup.
the Example
(2.15) Figure 26. Neutrosophic SuperHyperBipartite Neutrosophic Associated t
Example 2.20. In the Neutrosophic Figure (28), the connected Neutrosop
sophic Notions in the Example (2.18)
SuperHyperWheel N SHW : (V, E), is Neutrosophic highlighted and featur
Figure 23. a Neutrosophic SuperHyperPath Associated to the Notions obtained
in the Example
Figure 23: A Neutrosophic SuperHyperPath Associated to the Neutrosophic SuperHyperSet, by the Algorithm in previous result
(2.15) Neutrosophic SuperHyperVertices of the connected Neutrosophic SuperHyp
Notions in the Example (2.15)
ESHW : (V, E), in the Neutrosophic SuperHyperModel (28), is up.
Figure 26. Neutrosophic SuperHyperBipartite Neutrosophic Associated t
Figure
Definition26: 2.21.
Neutrosophic
sophic Notions in Let pairSuperHyperBipartite
the aExample
S =(2.18) Neutrosophic
(V, E) be a Neutrosophic SuperHyperGra
Associated to the Neutrosophic
S. Then a sequence Notions
of Neutrosophic in the Example (NSHV)
SuperHyperVertices (2.18) and Neut
SuperHyperEdges (NSHE)
V1 , E1 , V2 , E2 , V3 , . . . , Vs−1 , Es−1 , Vs
is called a Neutrosophic SuperHyperPath (NSHP) from Neutrosophic

SuperHyperVertex (NSHV) V1 to Neutrosophic SuperHyperVertex (NSHV)
of following conditions hold:
(i) Vi , Vi+1 ∈ Ei ;
Figure 24. a Neutrosophic SuperHyperCycle Associated to the Neutrosophic Notions

Figure 24: A Neutrosophic
in the Neutrosophic ExampleSuperHyperCycle
(2.16) Associated to the Figure 27. a Neutrosophic SuperHyperMultipartite Associated to the N
Neutrosophic Notions in the Neutrosophic Example (2.16) Figure 27:(2.19)
Example A Neutrosophic SuperHyperMultipartite Associated
Figure 24. a Neutrosophic SuperHyperCycle Associated to the Neutrosophic Notionsin the Example (2.19)
to the Notions
Figure 27. a Neutrosophic SuperHyperMultipartite Associated to the N
Example
nt Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, (2.19)
NY, USA
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhatta

(ix) There are a SuperVertex Vi0 ∈ VI and a SuperVertex such

that
Definition 2.22: (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.

Figure
Figure 28: 28. aANeutrosophic
NeutrosophicSuperHyperWheel SuperHyperWheel Neutrosophic
Neutrosophic Associated(i) Iftoforthe allNeutro-
Vi,Ej0, |Vi| = 1, |Ej0| = 2, then NSHP is called path;
Associated
sophic Notions to thein the Neutrosophic
NeutrosophicNotions Examplein(2.20) the Neutrosophic (ii) if for all Ej0, |Ej0| = 2, and there’s Vi, |Vi| ≥ 1, then NSHP is
Example (2.20) called SuperPath;
(ii) there’s a vertex vi ∈ Vi such that vi , Vi+1 ∈ Ei ; (iii) if for all Vi,Ej0,247|Vi| = 1, |Ej0| ≥ 2, then NSHP is called
(ii) There’s a vertex VI ∈ VI such that VI, VI+1 ∈ Ei0; HyperPath;

(iii)
(iii) There’s
there’s aa SuperVertex
SuperVertexViVi0 ∈ V∈ VI such
i such that Vthat i , Vi+1 Vi0,∈ E VI+1
i ; ∈ (iv) If there are Vi, E248j0, |Vi| ≥ 1, |Ej0| ≥ 2, then NSHP is called
Ei0;
(iv) there’s a vertex vi+1 ∈ Vi+1 such that Vi , vi+1 ∈ Ei ; neutrosophi super hyper 249
path.
(iv) There’s a vertex VI+1 ∈ VI+1
such that VI, VI+1 ∈
Ei0;
(v)(v)There’s
there’sa aSuperVertex
SuperVertex such Vi+1 ∈thatVi+1 such that Vi , Vi+1 ∈ E i ; Definition 2.23: (Neutrosophic 250
Strength of the Neutrosophic
(vi) There are a vertex VI ∈ VI and a vertex
(vi) there are a vertex vi ∈ Vi and a vertex vi+1 ∈ Vi+1 such that vi , vi+1 ∈ Ei ; VI+1 ∈ VI+1 such SuperHyperPaths). (Ref.
251 [23], Definition 5.3, p.7).
that
archer · Department
archer · Department VI, VI+1 Ei0;
of∈Mathematics
ofaMathematics
(vii) There
(vii) there areare vertex VI
a vertex vi ∈∈VVI i and andaaSuperVertex
SuperVertexVi+1 such∈ that Vi+1 such that
Assume vi , Vai+1 ∈ Ei ; 252 SuperHyperGraph (NSHG) S is a pair
Neutrosophic
(viii) there
(viii) Thereare area aSuperVertex
SuperVertex Vi Vi0 ∈ Vi∈and VIaand vertex a vertex
vi+1 ∈VI+1 Vi+1 such ∈ thatS = V(V, E). A Neutrosophic
i , vi+1 ∈ Ei ; 253 SuperHyperPath (NSHP) from
TableVI+1 1. Thesuch Values
that Vi0,ofVI+1 ∈ Ei0;
Vertices, SuperVertices, Edges, HyperEdges, Neutrosophic
and SuperHyperVertex
SuperHy- (NSHV)
Table(ix)
perEdges 1.Belong
The are
there Values
to aThe ofNeutrosophic
SuperVertex Vertices, Vi ∈SuperVertices,
ViSuperHyperGraph
and a SuperVertex Edges,VMentioned HyperEdges, and SuperHy-
i+1 ∈ Vi+1 such in thatDefinition
the 254
perEdges Belong Vi , Vi+1

to
∈ EThe i . Neutrosophic SuperHyperGraph Mentioned in the Definition 255
(2.27)
Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
(2.27) The Values of The Vertices The Number of Position in Alphabet
Definition
The Values 2.22. of (Characterization
The Vertices of the The NeutrosophicNumber SuperHyperPaths).
of Position in Alphabet 256
The Values
Assume a The
of The
Neutrosophic Values of The SuperVertices
Vertices
SuperHyperGraph The (NSHG)Number S isofa Position
pair SThe= maximum
in E).
(V, Alphabet
a Values of Its Vertices
The Values of The SuperVertices The maximum Values of Its Vertices
TableThe1.Values
NeutrosophicThe Values of The
The of Values
SuperHyperPath Vertices,
SuperVertices
of The SuperVertices,
(NSHP)Edgesfrom TheEdges, maximum
Neutrosophic HyperEdges, ValuesandThe
SuperHyperVertex SuperHy-
of Its Vertices
maximum Values of Its Vertices
(NSHV)
perEdges The Values
Belong to of The
The Edges
Neutrosophic SuperHyperGraph The maximum Values the of Its Vertices
V1 toThe Neutrosophic
ValuesThe ofSuperHyperVertex
The Edges (NSHV) The isMentioned
Vsmaximum sequenceValues in Neutrosophic
of Definition
of Its Vertices
(2.27)The Values of The(NSHV) Values
HyperEdgesof The HyperEdges TheSuperHyperEdges
maximum Values The
of maximum
Its Vertices Values of Its Vertices
SuperHyperVertices
The Values of The HyperEdges and Neutrosophic The maximum Values (NSHE)
of Its Vertices
The Values of The
The Values The
of SuperHyperEdges
The Values
Verticesof The TheThe
SuperHyperEdges Number maximum of Position Values of Its
The
in Alphabet Endpoints
maximum Values of Its Endpoints
The The Values
Values of ofThe TheSuperHyperEdges
SuperVertices The maximum Values of Its Endpoints
V1 , E1 , V2 , E2 , The V3 , . maximum
. . , Vs−1 , EValues s−1 , Vsof , Its Vertices
Table The 1. The Values values of The of vertices,
Edges superThe vertices,
maximum edges, Values hyperof Itsedges,
Vertices and super hyper edges belong to the neutrosophic super
V1 to hyper
could The graph
be
NeutrosophicValues mentioned
characterized
ofSuperHyperVertex
The HyperEdges in the definition
as follow-up items. The maximum
(NSHV) Vs is sequenceValues of Its of Vertices
Neutrosophic 257
V1 to Neutrosophic
The Values of The
SuperHyperVertices SuperHyperVertex
SuperHyperEdges (NSHV)
(NSHV) and Neutrosophic The maximum Vs isValues
SuperHyperEdges sequence of Its of Neutrosophic
Endpoints
(NSHE)
(i) If for all Vi ,(NSHV)
SuperHyperVertices Ej , |Vi | =and 1, |E j | = 2, then NSHP
Neutrosophic is called path; (NSHE)
SuperHyperEdges 258
V1 to neutrosophic super hyper vertex (NSHV) Vs is sequence II. Neutrosophic i-connective: if I (E) ≥ maximum number
V1 ofto(ii) j , |EjV
if for all ESuperHyperVertex | ,
1 =E2, 1 ,and
V2 , E 2 , V3 ,V. i.V,.s|V
there’s ,isVi |s−1
≥ 1, , Ethen of,NSHP
Vs , is called SuperPath; 259
neutrosophic
Neutrosophic super Vhyper 1 , E 1 vertices
, V 2 ,
(NSHV)
E 2 ,(NSHV)
V 3 , . . . , V and
sequence
s−1 neutrosophic
, E
s−1
s−1
Neutrosophic
, Vs , of Neutrosophic i-strength of SuperHyperPath (NSHP) from
SuperHyperVertices (NSHV) and Neutrosophic SuperHyperEdges (NSHE)
have super
(iii) ifhyper
for all edges
Vi , E(NSHE)
j , |Vi | = 1, |Ej | ≥ 2, then NSHP is called HyperPath; Neutrosophic SuperHyperVertex 260
265
(NSHV) Vi to Neutrosophic
have V1 , E1 , V2 , E2 , V3 , . . . , Vs−1 , Es−1 , Vs , SuperHyperVertex (NSHV) 265 Vj where 1 ≤ i, j ≤ s;
265
(iv) if there are Vi , Ej , |Vi | ≥ 1, |Ej | ≥ 2, then NSHP is called Neutrosophic
(i) Neutrosophic t-strength ; (min{T (Vi )}, m, n)si=1 III. Neutrosophic f-connective: if F (E) ≥ maximum number
261
(i) Neutrosophic
SuperHyperPath t-strength . s ; 266
(i)
have Neutrosophic t-strength (min{T (V )}, m, n) ; 262
of Neutrosophic f-strength of SuperHyperPath (NSHP) from
266
266
i i=1 265
(ii) (i)
Neutrosophic 2.23 i-strength (m, min{I(V i )}, n)si=1 s ;
(ii) (ii) Neutrosophic
Definition I-strength
(Neutrosophic ; (min{T Strength(Vi )}, of m,the Neutrosophic 266 SuperHyperVertex (NSHV) V to Neutrosophic
s Neutrosophic SuperHyperPaths). 267
Neutrosophic
Neutrosophic t-strength
i-strength (m, min{I(V n) i=1 ;n)
)}, ; 263
i i=1
267
267 i
(Ref. [23],Definition 5.3,p.7).
(iii) (ii)
Neutrosophic f-strength (m, n, min{F i )}, n)(V
s s SuperHyperVertex (NSHV)
264
V where 1 ≤ i, j ≤ s;
Neutrosophic i-strengthSuperHyperGraph
(m, min{I(V i=1i;)})i=1 ; = (V, E). A 267 268 j
(iii) (iii) Assume a Neutrosophic
Neutrosophic f-strength
Neutrosophic f-strength ; (m, n, min{F (NSHG) (Vi )})si=1S; is a pair SIV. Neutrosophic connective: 268
268 if (T (E), I (E), F (E)) ≥
Neutrosophic SuperHyperPath (NSHP) from Neutrosophic
s SuperHyperVertex (NSHV)
(iv)(iii) i )}, min{F (Vmaximum s . number of Neutrosophic strength of SuperHyperPath
Neutrosophic
Neutrosophic f-strength (m,
strength (min{T n, min{F (Vi )},(Vi )}) i=1 ;
min{I(V s
i )})i=1
268
269
(iv) Neutrosophic strength (min{T (Vi )}, min{I(Vi )}, min{F (Vi )})i=1 . 269
(iv)Neutrosophic
Neutrosophicstrength strength. (min{T (Vi )}, min{I(Vi )}, min{F (Vi )})si=1 . (NSHP) from 269 Neutrosophic SuperHyperVertex (NSHV) V to
269
(iv) i
Definition 2.24 (Different Neutrosophic Types of Neutrosophic SuperHyperEdges
Neutrosophic270SuperHyperVertex (NSHV) VjWhere 1 ≤ i, j ≤ s.
270
Definition
Definition 2.24
2.24 (Different
(Different
(NSHE)). (Ref. [23],Definition 5.4,p.7). Neutrosophic
Neutrosophic Types Types
of of
Neutrosophic Neutrosophic SuperHyperEdges
SuperHyperEdges 270
270
Definition 2.24: (Different 5.4,p.7).Neutrosophic
5.4,p.7). Types of Neutrosophic
271
(NSHE)).
(NSHE)).
Assume (Ref.
a(Ref. [23],Definition
[23],Definition
Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider
271 271
271
t ResearcherSuperHyperEdges
Assume · Department
AssumeaaNeutrosophic
Neutrosophic of (NSHE)).
Mathematics (Ref. [23],
SuperHyperGraph
SuperHyperGraph · Definition
(NSHG) (NSHG) S is a pair 5.4,
S isSp.7). ·
a=pair For =the
Manhattan, (V,sake
S Consider
(V, E). NY,
E). 272 of
USA having a 272
Consider Neutrosophic
272
272 notion, there’s a need to
a Neutrosophic
a Neutrosophic
SuperHyperEdge
Assume a Neutrosophic
a Neutrosophic SuperHyperEdge
SuperHyperEdge (NSHE)(NSHE)
SuperHyperGraph
(NSHE) E =E {V=
E 1= V{V
,(NSHG)
{V 1 , V2 , }.
2 , . . ,. ,VVsS ,
. .is.Then
. . . , V
}.E Then
,aVspair
}. isThen
called E is called
“redefine”
E is thNotion
called
273 of “Neutrosophic
273
273
273 SuperHyperGraph”. The
1 2 s
(ix)(ix)S = (V,
Neutrosophic E). Consider
Neutrosophic t-connective t-connective if Tif(E) T (E) ≥ maximum
≥ maximum numbernumber SuperHyperVertices
of Neutrosophic
of Neutrosophic 274
and the
274
SuperHyperEdges are assigned by
I.Neutrosophic
Neutrosophic
(ix) t-strength t-connective:
t-connective
t-strengthofof SuperHyperPath
SuperHyperPath if(NSHP)
(NSHP) ifT T(E) (E)
from ≥≥ maximum
maximum
Neutrosophic number
number
SuperHyperVertex
from Neutrosophic SuperHyperVertex the
of labels
Neutrosophic from
275 the letters
274
274
275
of the alphabets. In this Procedure,
of
(NSHV) Neutrosophic
t-strength
(NSHV) VVi iof
to t-strength of
toSuperHyperPath
Neutrosophic
Neutrosophic SuperHyperPath
(NSHP) from
SuperHyperVertex
SuperHyperVertex (NSHV)(NSHP)
Neutrosophic
(NSHV)Vj where from Vj1 ≤ there’s
i, j ≤ 1s;the
≤ i,usage
SuperHyperVertex
where of the position
j276≤ s;
275
275
276
of labels to assign to the values.
Neutrosophic
(NSHV) V i SuperHyperVertex (NSHV) V to Neutrosophic j
to Neutrosophic
(x) Neutrosophic i-connective if I(E) ≥ maximum
SuperHyperVertex
i
(NSHV)
number of Neutrosophic
V where 1 ≤ i, j
277
≤ s; 276
276
SuperHyperVertex
(x) Neutrosophic
i-strength of SuperHyperPath (NSHV) Vj where
i-connective if I(E)
(NSHP) 1 from
≤ i,j ≥≤ s;
maximum
Neutrosophic number of Neutrosophic
SuperHyperVertex 277
(x) i-strength
Neutrosophic i-connective if I(E) ≥ maximum number of Neutrosophic 278
277
277
(NSHV) Vof i toSuperHyperPath
Neutrosophic SuperHyperVertex (NSHP) from Neutrosophic
(NSHV) Vj where 1SuperHyperVertex
≤ i, j ≤ s; 279 278
Curr Trends
i-strength
(NSHV) Vi toMass
of Comm, 2023
SuperHyperPath
Neutrosophic (NSHP) from Neutrosophic
SuperHyperVertex (NSHV) Vj where 1 ≤ i, j ≤ s; SuperHyperVertex 278
278
279
Volume 2 | Issue 1 | 40
(xi)(NSHV) Vi to Neutrosophic
Neutrosophic f-connective ifSuperHyperVertex F (E) ≥ maximum number (NSHV) Vj where 1 ≤ i, 280
of Neutrosophic j ≤ s; 279
279
f-strength of SuperHyperPath
(xi) Neutrosophic f-connective (NSHP)
if F (E) from≥Neutrosophic
maximum SuperHyperVertex number of Neutrosophic 281
280
(xi) f-strength
Neutrosophic
(NSHV) Vi to Neutrosophic f-connective if
SuperHyperVertex F (E)
of SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex ≥ maximum
(NSHV) Vj where number 1 ≤of i, jNeutrosophic
≤ s; 282 280
280
281
f-strength
(NSHV)
(xii) of SuperHyperPath
Vi to Neutrosophic
Neutrosophic (NSHP) from
(T (E), I(E), F (E)) ≥ maximum
connective if SuperHyperVertex Neutrosophic
(NSHV) number SuperHyperVertex
Vj where of 1 ≤ i, j283≤ s;
281
281
282
(NSHV) V i to Neutrosophic SuperHyperVertex
Neutrosophic strength of SuperHyperPath (NSHP) from Neutrosophic (NSHV) V j where 1 ≤ i, j
284 ≤ s; 282
282
Definition 2.25: Assume a Neutrosophic SuperHyperGraph It’s useful to define a “Neutrosophic” version of
(NSHG) S is a pair S = (V, E). It’s redefined Neutrosophic SuperHyperClasses. Since there’s more ways to get Neutrosophic
SuperHyperGraph if the Table (1) holds. type-results to make a Neutrosophic more understandable.
The Values of The Vertices The Number of Position in Alphabet

The Values of The Edges The maximum Values of Its Vertices
The Values of The HyperEdges The maximum Values of Its Vertices
The Values of The SuperHyperEdges The maximum Values of Its Endpoints
Table 2: The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges Belong to the Neutrosophic
SuperHyperGraph, Mentioned in the Definition (2.26)
The Values of The Vertices The Number of Position in Alphabet

The Values of The Edges x The maximum Values of Its Vertices
The Values of The HyperEdges The maximum Values of Its Vertices
rtment of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
tment of MathematicsThe · DrHenryGarrett@gmail.com
Values of The SuperHyperEdges · Manhattan, NY, USA The maximum Values of Its Endpoints
.com · Manhattan, NY, USA
ofTable
.com · Manhattan,
rtment 3. The
Mathematics NY,Values
· USA of Vertices, SuperVertices,
DrHenryGarrett@gmail.com Edges, HyperEdges,
· Manhattan, NY, USA and SuperHyperEdges Belong to the Neutrosophic
is calledSuperHyperGraph Mentioned in the Definition
optimal-SuperHyper-dominating number (2.27)
and X is called 322
is called optimal-SuperHyper-dominating number and X is called 322
optimal-SuperHyper-dominating set. 323
numberIsand called
X isoptimal-SuperHyper-dominating
optimal-SuperHyper-dominatingcalled 322 set. number and X is Proposition 323
3.3: aaAssume SuperHyperGraph SHG = (G ⊆ P
is called optimal-SuperHyper-dominating
number and X is called number and X is called
called optimal-SuperHyper-dominating
323 are defined asset.
322 322
erHyper-resolving
rHyper-resolving
set and number
set and number
optimal-SuperHyper-dominating 323 are defined
follows.
set. as follows. (V), E ⊆ P (V)).
324
324
323
If optimal-SuperHyper-coloring number is |V |,
then for every SuperVertex there’s at least one SuperHyperEdge
sA Afollows.
SuperVertex x SuperHyper-resolves SuperVertices y, w if
(B): Super
SuperVertex
erHyper-resolving
s follows. x set Hyper-resolving
SuperHyper-resolves
and number
324
setdefined
324 are andSuperVertices
number
as follows. are y,
defined
w if as which contains 324 has all members of V.
follows.
erVertices y, w if d(x, y) = d(x, w).
A SuperVertex
erVertices y,A
(i): if x SuperHyper-resolves
w Super d(x, y) = d(x,SuperVertices
Vertex x SuperHyper-resolves w). SuperVertices y, w y,ifw if Proposition 3.4: Assume SuperHyperGraph SHG = (G ⊆ P (V),
. E ⊆ P (V)). 325If there’s at least one SuperHyperEdge which has all
. d(x, y) = d(x, w). 325
A set S is called SuperHyper-resolving set if for every Yn ∈ Gn \ S, members of
326V, then optimal-SuperHyper-coloring number is |V |.
A set S (ii):
.there’s is called
A set SuperHyper-resolving
S is called SuperHyper-resolving
325 set ifset forif every
for Yn ∈ Gn \ S,
every 326
at least one SuperVertex Xn which SuperHyper-resolves
325 325
327
there’s at
least ∈one SuperVertex Xnleast
S, There’s326at which oneSuperHyper-resolves
SuperVertex XYn which
n\ Proposition 3283.5: Assume SuperHyperGraph SHG = (G ⊆ P (V), E
ifSuperVertices
for every Yn Y G
,W n .S,
327
A
if set
for S is
every
SuperVertices called
Y n ∈ nG n
Yn , Wn .\
SuperHyper-resolving326 set if for every n ∈ G n \ S, 326
SuperHyper-resolves
perHyper-resolves
there’s at least SuperVertices
327 Y , W . ⊆ P (V)). If
328
optimal-SuperHyper-dominating number is |V |, then
perHyper-resolves
If S is set of allonesetsSuperVertex 327Xn whichn SuperHyper-resolves
of SuperHyper-resolving n
sets, then 327
If S is (iii):
set of If
allS
SuperVertices Yn , Wn . is
setssetofof all sets of
328 SuperHyper-resolving
SuperHyper-resolving
328
sets, then sets, then there’s one member
328
of V, is contained in, at least one SuperVertex
ets, then |X| = min |{∪Xn |Xn ∈ S}| which doesn’t have incident to any SuperHyperEdge.
If Sthen
ets, is set of all sets of SuperHyper-resolving
|X| = minS∈S |{∪Xn |Xn sets,∈ S}|then
S∈S
∈isS}|
∈isS}| called optimal-Super
calledIsoptimal-SuperHyper-resolving |X| = min Hyper-resolving
|{∪Xn |Xnnumbernumber
∈ S}|number and and is Proposition
X isXcalled 329 3.6: Assume SuperHyperGraph SHG = (G ⊆ P (V),
called called optimal-SuperHyper-resolving
optimal-SuperHyper-resolving
optimal-SuperHyper-resolving set. S∈S set. and X is called E ⊆ P (V)).
330Then optimal-SuperHyper-dominating number is <
329
umber and X is called 329 set. |V |. 330
is called
umber and optimal-SuperHyper-resolving
X is called 329 number and X is called 329
erHyper-coloring
rHyper-coloring(C): SuperHyper-coloring
set and number are
set and number330 are
330
set and number
defined
defined
set.
as follows.
as follows. are defined as 331
331
330
follows.
A SuperVertex Xn SuperHyper-colors
follows. a SuperVertex Yn differently with 332 3.7: Assume SuperHyperGraph SHG = (G ⊆ P (V),
Proposition
(i): A SuperVertex Xn SuperHyper-colors a SuperVertex Yn Ewith 331 If optimal-SuperHyper-resolving number is |V |,
⊆ P (V)).
331
A SuperVertex
erHyper-coloring
follows. Xset
n SuperHyper-colors
and number are defined
331 a SuperVertex
as follows. Yn differently 332
itself if there’s at least one SuperHyperEdge which is incident to them.
differently with itself if there’s at least one SuperHyperEdge
333
itself if there’s at
perVertex Yn differently with 332least one SuperHyperEdge which is incident to them.then every given SuperVertex doesn’t have incident to any super
333
AA SuperVertex
perVertex
set Snwhich isX
Yisn called
differentlySuperHyper-colors
with
nSuperHyper-coloring
incident to them. 332 a set
SuperVertex
if for every YnYdifferently Snwith
n ∈ Gn \ hyper , edge.332
334
hich
A is incident
setisifSincident
is called
nthere’s to them.
SuperHyper-coloring 333 setwhich
if forisevery Yn ∈toGthem.
n \ Sn , 334
itself
hich
there’s at least
(ii): A setat
to Sleast
one them. one SuperHyperEdge
isSuperVertex
called 333X
set if incident
n which SuperHyper-colors
SuperHyper-coloring SuperVertex
for everySuperVertex
333
335
there’s
ifYnfor at
every least
Y ∈one
G n SuperVertex
\ S , X n which SuperHyper-colors 335
. Sn n
n \ Sn , there’s
n n
334 at least one
334
setSuperVertex
if for every XYnnwhich Proposition336 3.8: Assume SuperHyperGraph SHG = (G ⊆ P (V),
A for
if
Y set every n ∈ GSuperHyper-coloring
is Ycalled ∈ Gn \ S n, 336
334
n.
perHyper-colors SuperVertex
SuperHyper-colors SuperVertex
335
there’s
If Sn isat
perHyper-colors setleast one SuperVertex
SuperVertex
of all sets Yn. SuperHyper-colors
335Xn which
of SuperHyper-coloring sets, then E ⊆ P (V)).
SuperVertex 335 Then optimal-SuperHyper-resolving number is <
YnS. n is set
If of all sets of SuperHyper-coloring sets, then
336
(iii): If Sn is set of all sets 336 of SuperHyper-coloring sets, then |V |. 336
ets, then |X| = min |{∪Xn |Xn ∈ Sn }|

If S
ets, then
n is set of all sets of SuperHyper-coloring
|X| = Smin n ∈Sn|{∪Xn |Xn ∈ Sn }| sets, then
∈isScalled
}|
Sn ∈Sn
Proposition 3.9: Assume SuperHyperGraph SHG = (G ⊆ P
called optimal-SuperHyper-coloring
∈ Snn }| isoptimal-SuperHyper-coloring
is called optimal-SuperHyper-coloring
|X| = min |{∪Xn |Xnumber
Sn ∈Sn
nnumber
∈ Sn }| andand
number and X is called
Xisiscalled
X called (V), E ⊆ 337 P (V)). If optimal-SuperHyper-coloring number is
337
optimal-SuperHyper-coloring
set.set. |V |, then all
338
SuperVertices which have incident to at least one
mber and X is called 337 set. 338
is called
mber andoptimal-SuperHyper-coloring
X is called 337 number and X is called SuperHyperEdge. 337
ion 3.2. Assume SuperHyperGraph SHG = (G ⊆ P (V ), E ⊆ P (V )). S is 339
3.2. Proposition 3.2: AssumeformSuperHyperGraph
SHG = (G ⊆SHG P (V = (G⊆ ⊆ PP(V
(V),
338
on Assume SuperHyperGraph
optimal-SuperHyper-coloring 338 set. ), E )). S is 339
338
set of SuperVertices which a SuperHyperEdge. Then 340
set ),EE⊆⊆PP(V)).
⊆ Pof(VSuperVertices
uperHyper-coloring (V )).set Sis
Swhich
has maximum
is form 339
as set of as SuperVertices
a SuperHyperEdge.
cardinality S has. which form a Proposition
Then 340 3.10: Assume SuperHyperGraph SHG = (G ⊆ P
ion⊆ P3.2. E ⊆ P (VSuperHyperGraph
(V ), Assume )). S hasisThen SHG as=S(G ⊆ P (V ), E ⊆ P (V )). S is 341
SuperHyperEdge. optimal-SuperHyper-coloring set has as (V), E ⊆ 341P (V)). Then optimal-SuperHyper-coloring number
339 339
perHyper-coloring
Edge. Then set as cardinality
340 has.
set ofThen
Edge. SuperVertices which form 340a SuperHyperEdge. Then
cardinality as S has.
⊆ P (V ), E ⊆ P (V )). Ifisn’t < |V |.342
340
ion 3.3.
as. Assume SuperHyperGraph 341 SHG = (G ⊆ P (V ), E ⊆ P (V )). If 342
on 3.3. Assume SuperHyperGraph
uperHyper-coloring
as. set has as cardinality 341 SHGas=S(G has. 341
uperHyper-coloring number is |V |, then for every SuperVertex there’s at least 343
perHyper-coloring
⊆ P (V ), E which number
)). If is
⊆ P (Vcontains |V |,342then for every SuperVertex there’s at least 343
HyperEdge
ion⊆ P3.3.(V ), Assume ⊆ P (V
Ewhich SuperHyperGraph
)). If has has all 342 members
SHG =of of(GV.⊆ P (V ), E ⊆ P (V )). If 344
342
HyperEdge Curr Trends
there’s Mass
contains Comm all343members V. Volume 2 | Issue 1 | 41
|V |,343,then
2023
y SuperVertex at least 344
uperHyper-coloring
yion SuperVertex there’s number
at leastis for every SuperVertex there’s at least 343
.on 3.4.3.4. Assume SuperHyperGraph 344 SHG = (G ⊆ P (V ), E ⊆ P (V )). If 345
HyperEdge
. Assume SuperHyperGraph
which contains has all members SHG =of(GV.⊆ P (V ), E ⊆ P (V )). If 345
344
least one SuperHyperEdge which344has all members of V, then 346
east one SuperHyperEdge
⊆ P (V ), E ⊆ P (V )). If which has all members of V, then 346
uperHyper-coloring
ion⊆ P3.4.
(V ), E ⊆
Assume P (V number
SuperHyperGraph
)). If is |V 345
|. SHG = (G ⊆ P (V ), E ⊆ P (V )). If
345 347
345
perHyper-coloring
rs of V, then number is |V |.346 347
rseastof one
V, SuperHyperEdge which 346has all members of V, then
then 346
ion 3.5. Assume SuperHyperGraph 347 SHG = (G ⊆ P (V ), E ⊆ P (V )). If 348
Proposition 3.11: Assume SuperHyperGraph SHG = (G ⊆ P simultaneously.
(V), E ⊆ P (V)). Then optimal-SuperHyper-dominating set has
cardinality which is greater than n − 1 where n is the cardinality Proposition 3.26: Assume G is a family of SuperHyperGraph.
of the set V. Then union of SuperHyper-resolving sets from each member
of G is SuperHyper-resolving set for all members of G,
Proposition 3.12: Assume SuperHyperGraph SHG = (G ⊆ P simultaneously.
(V), E ⊆ P (V)). S is maximum set of SuperVertices which form
a SuperHyperEdge. Then S is optimal-SuperHyper-coloring set Proposition 3.27: Assume G is a family of SuperHyperGraph.
and | {∪Xn | Xn ∈ S}| is optimal-SuperHyper-coloring number. Then union of SuperHyper-coloring sets from each member of G
is SuperHyper-coloring set for all members of G, simultaneously.
Proposition 3.13: Assume SuperHyperGraph SHG = (G ⊆
P (V), E ⊆ P (V)). If S is SuperHyper-dominating set, then D Proposition 3.28: Assume G is a family of SuperHyperGraph.
contains S is SuperHyper-dominating set. For every given SuperVertex, there’s one SuperHyperGraph
such that the SuperVertex has another SuperVertex which are
Proposition 3.14: Assume SuperHyperGraph SHG = (G ⊆ P (V), incident to a SuperHyperEdge. If for given SuperVertex, all
E ⊆ P (V)). If S is SuperHyper-resolving set, then D contains S is SuperVertices have a common SuperHyperEdge in this way,
SuperHyper-resolving set. then Gn \ {Xn} is optimal-SuperHyper-dominating set for all
members of G, simultaneously.
Proposition 3.15: Assume SuperHyperGraph SHG = (G ⊆ P
(V), E ⊆ P (V)). If S is SuperHyper-coloring set, then D contains Proposition 3.29: Assume G is a family of SuperHyperGraph.
S is SuperHyper-coloring set. For every given SuperVertex, there’s one SuperHyperGraph
such that the SuperVertex has another SuperVertex which are
Proposition 3.16: Assume SuperHyperGraph SHG = (G ⊆ P incident to a SuperHyperEdge. If for given SuperVertex, all
(V), E ⊆ P (V)). Then Gn is SuperHyper-dominating set. SuperVertices have a common SuperHyperEdge in this way, then
Gn \ {Xn} is optimal-SuperHyper-resolving set for all members of
Proposition 3.17: Assume SuperHyperGraph SHG = (G ⊆ P G, simultaneously.
(V), E ⊆ P (V)).Then Gn is SuperHyper-resolving set.
Proposition 3.30: Assume G is a family of SuperHyperGraph.
Proposition 3.18: Assume SuperHyperGraph SHG = (G ⊆ P For every given SuperVertex, there’s one SuperHyperGraph
(V), E ⊆ P (V)). Then Gn is SuperHyper-coloring set. such that the SuperVertex has another SuperVertex which are
incident to a SuperHyperEdge. If for given SuperVertex, all
Proposition 3.19: Assume G is a family of SuperHyperGraph. SuperVertices have a common SuperHyperEdge in this way,
Then Gn is SuperHyper-dominating set for all members of G, then Gn is optimal-SuperHyper-coloring set for all members of
simultaneously. G, simultaneously.
Proposition 3.20: Assume G is a family of SuperHyperGraph. Proposition 3.31: Let SHG be a SuperHyperGraph. An (k − 1)-
Then Gn is SuperHyper-resolving set for all members of G, set from a k-set of twin SuperVertices is subset of a SuperHyper-
simultaneously. resolving set.
Proposition 3.21: Assume G is a family of SuperHyperGraph. Corollary 3.32: Let SHG be a SuperHyperGraph. The number of
Then Gn is SuperHyper-coloring set for all members of G, twin SuperVertices is n − 1. Then SuperHyper-resolving number
simultaneously. is n − 2.
Proposition 3.22: Assume G is a family of SuperHyperGraph. Corollary 3.33: Let SHG be SuperHyperGraph. The number
Then Gn \ {Xn} is SuperHyper-dominating set for all members of of twin SuperVertices is n − 1. Then SuperHyper-resolving
G, simultaneously. number is n − 2. Every (n − 2)-set including twin SuperVertices
is SuperHyper-resolving set.
Then Gn \ {Xn} is SuperHyper-resolving set for all members of Proposition 3.34: Let SHG be SuperHyperGraph such that it’s
G, simultaneously. complete. Then SuperHyper-resolving number is n − 1. Every
(n − 1)-set is SuperHyper-resolving set.
Then Gn \ {Xn} isn’t SuperHyper-coloring set for all members of Proposition 3.35: Let G be a family of Super Hypergraphs with
G, simultaneously. common super vertex set Gn. Then simultaneously SuperHyper-
resolving number of G is |V | − 1
Then union of SuperHyper-dominating sets from each member Proposition 3.36: Let G be a family of SuperHyperGraphs with
of G is SuperHyper-dominating set for all members of G, common SuperVertex set Gn. Then simultaneously SuperHyper-

resolving number of G is greater than the maximum SuperHyper- isn’t SuperHyper-resolving set in any given even SuperHyper-
resolving number of n-SHG ∈ G. cycle.

Proposition 3.37: Let G be a family of SuperHyperGraphs with Proposition 3.48; Consider two antipodal SuperVertices Xn and
common SuperVertex set Gn. Then simultaneously SuperHyper- Yn in any given even SuperHyper-cycle. Xn SuperHyper-resolves
resolving number of G is greater than simultaneously a given couple of SuperVertices, Zn and Zn0, if and only if Yn
SuperHyper-resolving number of H ⊆ G. does.
Theorem 3.38: Twin SuperVertices aren’t SuperHyper-resolved Proposition 3.49: there are two antipodal SuperVertices aren’t
in any given SuperHyperGraph. SuperHyper-resolved by other two antipodal SuperVertices in
any given even SuperHyper-cycle.
Proposition 3.39: Let SHG = (G ⊆ P (V), E ⊆ P (V)) be a
SuperHyperGraph. If SuperHyperGraph SHG = (G ⊆ P (V), E Proposition 3.50: For any two antipodal SuperVertices in any
⊆ P (V)) is complete, then every couple of SuperVertices are given even SuperHyper-cycle, there are only two antipodal
twin SuperVertices. SuperVertices don’t SuperHyper-resolve them.

Theorem 3.40: Let G be a family of SuperHyperGraphs SHG = Proposition 3.51: In any given even SuperHyper-cycle, for any
(G ⊆ P (V), E ⊆ P (V)) with SuperVertex set Gn and n-SHG ∈ G SuperVertex, there’s only one SuperVertex such that they’re
is complete. Then simultaneously SuperHyper-resolving number antipodal SuperVertices.
is |V| − 1. Every (n − 1)-set is simultaneously SuperHyper-
resolving set for G. Proposition 3.52: Let SuperHyperGraphs SHG = (G ⊆ P (V),
E ⊆ P (V)) be an even SuperHyper-cycle. Then every couple of
Corollary 3.41; Let G be a family of SuperHyperGraphs SHG SuperVertices are SuperHyper-resolving set if and only if they
= (G ⊆ P (V), E ⊆ P (V)) with SuperVertex set Gn and n-SHG aren’t antipodal SuperVertices.
∈ G is complete. Then simultaneously SuperHyper-resolving
number is |V | − 1. Every (|V | − 1)-set is simultaneously Super Corollary 3.53: Let SuperHyperGraphs SHG = (G ⊆ P (V),
Hyper-resolving set for G. E ⊆ P (V)) be an even SuperHyper-cycle. Then SuperHyper-
resolving number is two.
Theorem 3.42; Let G be a family of Super Hypergraphs SHG
= (G ⊆ P (V), E ⊆ P (V)) with Super Vertex set Gn and for Corollary 3.54: Let SuperHyperGraphs SHG = (G ⊆ P (V),
every given couple of Super Vertices, there’s an n-SHG ∈ G such E ⊆ P (V)) be an even SuperHyper-cycle. Then SuperHyper-
that in that, they’re twin SuperVertices. Then simultaneously resolving set contains couple of SuperVertices such that they
SuperHyper-resolving number is |V | − 1. Every (|V | − 1)-set is aren’t antipodal SuperVertices.
Simultaneously SuperHyper-resolving set for G.
Corollary 3.55: Let G be a family SuperHyperGraphs SHG = (G
Theorem 3.43: Let G be a family of SuperHyperGraphs SHG = ⊆ P (V), E ⊆ P (V)) be an odd SuperHyper-cycle with common
(G ⊆ P (V), E ⊆ P (V)) with SuperVertex set Gn. If G contains SuperVertex set Gn. Then simultaneously super hyper-resolving
three 455 SuperHyper-stars with different SuperHyper-centers, set contains couple of SuperVertices such that they aren’t
then simultaneously SuperHyper-resolving number is |V | − 2. antipodal SuperVertices and SuperHyper-resolving number is
Every (|V | − 2)-set is simultaneously SuperHyper-resolving set two.
for G.
Proposition 3.56: In any given Super Hypergraph SHG = (G
Corollary 3.44; Let G be a family of SuperHyperGraphs SHG ⊆ P (V), E ⊆ P (V)) which is odd SuperHyper-cycle, for any
= (G ⊆ P (V), E ⊆ P (V)) with SuperVertex set Gn. If G contains SuperVertex, there’s no SuperVertex such that they’re antipodal
three SuperHyper-stars with different SuperHyper-centers, then super vertices.
simultaneously SuperHyper-resolving number is |V | − 2. Every
(|V | − 2)-set is simultaneously SuperHyper-resolving set for G. Proposition 3.57; Let Super Hypergraph SHG = (G ⊆ P (V),
E ⊆ P (V)) be an odd SuperHyper-cycle. Then every couple of
Proposition 3.45: Consider two antipodal SuperVertices Xn and SuperVertices are SuperHyper-resolving set.
Yn in any given even SuperHyper-cycle. Let Un and Vn be given
SuperVertices. Then d(Xn,Un) 6= d(Xn,Vn) if and only if d(Yn,Un) Proposition 3.58: Let SuperHyperGraph SHG = (G ⊆ P (V), E
6= d(Yn,Vn). ⊆ P (V)) be an odd Cycle. Then SuperHyper-resolving number
is two.
Proposition 3.46; Consider two antipodal SuperVertices Xn and
Yn in any given even cycle. Let Un and Vn be given SuperVertices. Corollary 3.59: Let SuperHyperGraph SHG = (G ⊆ P (V), E ⊆
Then d(Xn,Un) = d(Xn,Vn) if and only if d(Yn,Un) = d(Yn,Vn). P (V)) be an odd cycle. Then SuperHyper-resolving set contains
couple of SuperVertices.
Proposition 3.47; the set contains two antipodal SuperVertices,

Corollary 3.60: Let G be a family of SuperHyperGraphs SHG = is optimal-SuperHyper-resolving set and optimal-SuperHyper-
(G ⊆ P (V), E ⊆ P (V)) which are odd SuperHyper-cycles with resolving number is |V | − 2.
common SuperVertex set Gn. Then simultaneously SuperHyper-
resolving set contains couple of SuperVertices and SuperHyper- Corollary 3.70: Let SuperHyperGraph SHG = (G ⊆ P (V), E ⊆
resolving number is two. P (V)) be a SuperHyper-star. Then every (|V | − 2)-set excludes
SuperHyper-center and a given SuperVertex, is optimal-
Proposition 3.61: Let SuperHyperGraph SHG = (G ⊆ P (V), SuperHyper-resolving set and optimal-SuperHyper-resolving
E ⊆ P (V)) be a SuperHyper-path. Then every SuperHyper-leaf number is (|V | − 2).
forms SuperHyper-resolving set.
Corollary 3.71: Let SuperHyperGraph SHG = (G ⊆ P (V), E
Proposition 3.62: Let SuperHyperGraph SHG = (G ⊆ P (V), ⊆ P (V)) be a SuperHyper-wheel. Let |V | ≥ 3. Then every (|V
E ⊆ P (V)) be a SuperHyper-path. Then a set including every | − 2)-set excludes SuperHyper-center and a given SuperVertex,
couple of SuperVertices is SuperHyper-resolving set. is optimal-SuperHyper-resolving set and optimal-SuperHyper-
resolving number is |V | − 2.
Proposition 3.63: Let SuperHyperGraph SHG = (G ⊆ P (V),
E ⊆ P (V)) be a SuperHyper-path. Then a 1-set contains leaf is Corollary 3.72: Let G be a family of SuperHyperGraphs SHG
SuperHyper-resolving set and SuperHyper-resolving number is = (G ⊆ P (V), E ⊆ P (V)) which are SuperHyper-t-partite with
one. common SuperVertex set Gn. Let |V | ≥ 3. Then simultaneously
optimal SuperHyper-resolving number is |V | − 2 and every (|V
Corollary 3.64; Let G be a family of SuperHyperGraphs SHG | − 2)-set excludes two SuperVertices from different parts, is
= (G ⊆ P (V), E ⊆ P (V)) are SuperHyper-paths with common simultaneously optimal-SuperHyper-resolving set for G.
SuperVertex set Gn such that they’ve a common SuperHyper-
leaf. Then simultaneously SuperHyper-resolving number is 1, Corollary 3.73: Let G be a family of SuperHyperGraphs SHG
1-set contains common leaf, is simultaneously SuperHyper- = (G ⊆ P (V), E ⊆ P (V)) which are SuperHyper-bipartite with
resolving set for G. common SuperVertex set Gn. Let |V | ≥ 3. Then simultaneously
optimal-SuperHyper-resolving number is |V | − 2 and every (|V
Proposition 3.65: Let G be a family of SuperHyperGraphs | − 2)-set excludes two SuperVertices from different parts, is
SHG = (G ⊆ P (V), E ⊆ P (V)) are SuperHyper-paths with simultaneously optimal-SuperHyper-resolving set for G.
common SuperVertex sent such that for every SuperHyper-
leaf Ln from n-SHG, there’s another n-SHG ∈ G such n that Corollary 3.74: Let G be a family of SuperHyperGraphs SHG =
Ln isn’t SuperHyper-leaf. Then a 2-set contains every couple (G ⊆ P (V), E ⊆ P (V)) which are SuperHyper-star with common
of SuperVertices, is SuperHyper-resolving set. An 2-set contains SuperVertex set Gn. Let |V | ≥ 3. Then simultaneously optimal-
every couple of SuperVertices, is optimal-SuperHyper-resolving SuperHyper-resolving number is |V | − 2 and every (|V | − 2)-
set. Optimal-SuperHyper-resolving number is two. set excludes SuperHyper-center and a given SuperVertex, is
simultaneously optimal-SuperHyper-resolving set for G.
Corollary 3.66: Let G be a family of SuperHyperGraphs SHG
= (G ⊆ P (V), E ⊆ P (V)) are SuperHyper-paths with common Corollary 3.75: Let G be a family of SuperHyperGraphs SHG
SuperVertex set Gn such that they’ve no common SuperHyper- = (G ⊆ P (V), E ⊆ P (V)) which are SuperHyper-wheel with
leaf. Then an 2-set is simultaneously optimal-SuperHyper- common SuperVertex set Gn. Let |V | ≥ 3. Then simultaneously
resolving set and simultaneously optimal-SuperHyper-resolving optimal-SuperHyper-resolving number is |V | − 2 and every (|V
number is 2. | − 2)-set excludes SuperHyper-center and a given SuperVertex,
is simultaneously optimal-SuperHyper-resolving set for G.
Proposition 3.67: Let SuperHyperGraph SHG = (G ⊆ P (V), E
⊆ P (V)) be a SuperHyper-t-partite. Then every set excluding Proposition 3.76: Let SuperHyperGraphs SHG = (G ⊆ P (V), E
couple of SuperVertices in different parts whose cardinalities ⊆ P (V)) be a SuperHyper-complete. Then optimal-SuperHyper-
of them are strictly greater than one, is optimal-SuperHyper- coloring number is |V |.
resolving set.
Proposition 3.77: Let SuperHyperGraphs SHG = (G ⊆ P (V),
Corollary 3.68: Let SuperHyperGraph SHG = (G ⊆ P (V), E E ⊆ P (V)) be a SuperHyper-path. Then optimal-SuperHyper-
⊆ P (V)) be a SuperHyper-t-partite. Let |V | ≥ 3. Then every coloring number is two.
(|V | − 2)-set excludes two SuperVertices 536 from different
parts whose cardinalities of them are strictly greater than one, Proposition 3.78: Let SuperHyperGraphs SHG = (G ⊆ P
is optimal-SuperHyper-resolving set and optimal-SuperHyper- (V), E ⊆ P (V)) be an even SuperHyper-cycle. Then optimal-
resolving number is. SuperHyper-coloring number is two.
Corollary 3.69: Let SuperHyperGraph SHG = (G ⊆ P (V), E Proposition 3.79: Let SuperHyperGraphs SHG = (G ⊆ P
⊆ P (V)) be a SuperHyper-bipartite. Let |V | ≥ 3. Then every (V), E ⊆ P (V)) be an odd SuperHyper-cycle. Then optimal-
(|V | − 2)-set excludes two SuperVertices from different parts, SuperHyper-coloring number is three.

Proposition 3.80: Let SuperHyperGraphs SHG = (G ⊆ P (V), (ii) n-Eulerian(Hamiltonian) neutrosophic path Ne(SHG)
E ⊆ P (V)) be a SuperHyper-star. Then optimal-SuperHyper- (Nh(SHG)) for a neutrosophic SuperHyperGraph SHG = (G ⊆
coloring number is two. P(V ),E ⊆ P(V )) is the number of sequences of consecutive
Henry
Henry
Henry Garrett
Garrett
Garrett
Henry · Henry Garrett
Independent
·· Independent
Garrett Independent · Independent
Researcher
Researcher
Researcher
· Independent · Researcher
Department
·· Department
Researcher Department
· Departmentof
edges(vertices)
of·ofMathematics
of Department
Mathematics
Mathematics
Mathematics
x1,xof2·,······Mathematics
DrHenryGarrett@gmail.com 2
,··· ,xO(SHG)) ···which
,xS(SHG)(x1·,xDrHenryGarrett@gmail.com Manhattan,
Manhattan,
Manhattan,
Manhattan,
is ·NY,
Man
NY,U
NY,
NY,
Proposition 3.81: Let SuperHyperGraphs SHG = (G ⊆ P neutrosophic path.
(V), E ⊆ P (V)) be a SuperHyper-wheel such that it has even
SuperHyper-cycle. Then optimal-SuperHyper-coloring number Proposition
Proposition Proposition
3.92. Let 3.92:
SHG 3.92. =Let(G LetSHG ⊆ SHG = (G
),= E⊆ (G ⊆PP ⊆ (V),
P (V ))E), be⊆
Eaa⊆ P (V )) bebea a comple
Pcomplete-neutrosop
(V))
Proposition
Proposition3.92.
Proposition 3.92.
3.92.Let Let
LetSHGSHG
SHG == =(G (G (G ⊆⊆ ⊆P PPP(V(V
(V
(V), ),), EEE ⊆⊆ PP(V (V
(V ))
)) be
be complete-neutrosop
complete-neutrosoph
a complete-neutrosop
is Three. SuperHyperGraph complete-neutrosophic
SuperHyperGraph
with two weakest with supertwo
edges. hyper
weakest
Then graph
edges. with
Then two weakest
SuperHyperGraph
SuperHyperGraphwith
SuperHyperGraph with two
withtwotwoweakestweakest
weakestedges. edges.
edges. Then Then
Then
edges. Then
Proposition 3.82: Let SuperHyperGraph SHG = (G ⊆ P (V), E ⊆ MMMeee(CM (CMTTTσσσσ))):::M
(CM Not e (CM T σ ) : Not Existed;
Existed;
Existed;
M e(CM Not
Not Existed;
P (V)) be a SuperHyper-wheel such that it has odd SuperHyper- Mh (CM T σ ) : vτ (1) , vτ (2) , · · · , vτ,,(O(CM
M T σ )−1) , vτ (O(CM
cycle. Then optimal-SuperHyper-coloring number is four. M
M M h(CM
(CM
(CM
hhh(CM TTTTσσσ)σ)))::::vvvτvττ(1)
(1)
τ(1)
(1) (2),,,·········,,,v
,,,v,vvvττττ(2)
(2)
(2) vvτττ(O(CM
(O(CMTT
(O(CM
(O(CM TTσ )−1), v
σσ)−1)
)−1) vvvττττ(O(CM
(O(CM
(O(CM
(O(CM TTTTσσσσ
))))
))
σ )−1) ))
where where τ is a permutation
O(CM on O(CM T σ ).
where
where
where τττ τis
isisaaaapermutation
is permutation
permutationon
permutation onon
onO(CM O(CMTTTTσσσ).
O(CM σ ).
).
Proposition 3.83: Let SuperHyperGraph SHG = (G ⊆ P (V), E Where τ is a permutation on O (CMTσ).
N0; e (CM T σ ) = 0;
⊆ P (V)) be a SuperHyper-complete and SuperHyper-bipartite. NN N (CMTTTσσσ)))=
Neeee(CM (CM ==
=0; 0;
0;
Then optimal-SuperHyper-coloring number is two. NO(CM = O(CM T σ )!.
Nhh(CM (CMTT σσ)) = h (CM T TTσσσ))!.
NN N (CM
hh(CM T
= O(CM
σσ) = O(CM
O(CM TT )!.
)!.
σσ)!.
Proposition 3.84: Let SuperHyperGraph SHG = (G ⊆Proposition P (V), E Proposition
3.93.Let LetSHG SHG 3.93. =(G (G Let⊆SHG P(V(V ), ),=E E(G ⊆ ⊆
P P (V
(V )) ),beEa⊆path-neutrosophic
P (V )) be a path-n
Proposition 3.93. 3.93. Let SHG = (G ⊆⊆PPP (V ),),⊆EEP⊆ ⊆⊆PP P(V (V)) )) be be aaa path-neutrosophic
path-neutrosophic
Proposition
⊆ P (V)) be a SuperHyper-complete and SuperHyper-t-partite.
Proposition
SuperHyperGraph. Then Proposition
3.93. Let
SuperHyperGraph.
Then
SHG3.93: =Let
= (G SHG
Then ⊆ = (V (G (V), (VE ))
⊆ P
be (V)) be a path-
path-neutrosophic
SuperHyperGraph.
SuperHyperGraph.
Then optimal-SuperHyper-coloring number is t. SuperHyperGraph. neutrosophic
Then
Then Super hyper graph. Then
MMe(P (PTTH) H) :: vvM 1 ,, v
e (P
v
T H) : v1 , v2 ,; · · · , vS(P T H) ;
2 ,, ·· ·· ·· ,, v
MM (P
(P
e T T H)
H) :: vv 1,, vv 2,, ·· ···· ,,vvvS(P
S(P T H) ;
S(PTTTH) H);;
Proposition 3.85: Let SHG = (G ⊆ P (V), E ⊆ P (V)) be ee 1
1 2 2 S(P H)
M h (P T H) : v 1 , v 2 ,.· · · , vO(P T H) .
SuperHyperGraph. Then optimal-SuperHyper-coloring number MM Mh(P (P TH)
(PTTTH)
H) : v1 , v2 , · · · , vO(P T H)
H) :::vvv111,,,vvv222,,,·········,,,vvvO(P H)...
M hhh(P O(PTTTH)
O(P H)
is 1 if and only if SHG = (G ⊆ P (V), E ⊆ P (V)) is SuperHyper- Ne(P (P T T H) = Ne (P T H) = 1;
1;
empty. NN N eee(P
(P TT H) H)
H) === 1;
1;
1;
Nh (P T H) = 1. Nh (P T H) = 1.
N N
Nhh(P T H) = 1.1.
h (P
(P TT H)
H) == 1.
Proposition 3.86: Let SHG = (G ⊆ P (V), E ⊆ PProposition (V)) be Proposition
3.94. Let SHG 3.94. = (G Let⊆ SHG
P (V ),=E(G ⊆⊆ P (V P (V )) ),beEa⊆cycle-neutrosophic
P (V )) be a cycle-n
SuperHyperGraph. Then optimal-SuperHyper-coloring number
Proposition
Proposition
Proposition
SuperHyperGraph Proposition
3.94. Let
SuperHyperGraph
3.94.
3.94. where Let
Let SHG 3.94:
SHG
SHG
O(CY=C) Let
== (G
where
(G SHG
(G≥⊆3.PThen ⊆⊆ =
P
O(CY
P (G
(V
(V ),⊆
), C)
EE P ⊆(V),
⊆
≥ PP
3. E
(V
(V ⊆
Then ))
))
(V ), E ⊆ P (V )) be a cycle-neutrosophic Pbe (V))
be a a be a cycle-
cycle-neutrosophic
cycle-neutrosophic
(V) is both neutrosophic
is 2 if and only if SHG = (G ⊆ P (V), E ⊆ P SuperHyperGraph
SuperHyperGraph
SuperHyperGraph where
where O(CYSuperHyperGraph
O(CY
where O(CY C) ≥ 3. Then C)
C) ≥≥ 3.
3. Then
Then where O (CY C) ≥ 3. Then
SuperHyper-complete and SuperHyper-bipartite. Me (CY C) : Not Me (CY Existed; C) : Not Existed;
MMM (CY
(CY
ee(CY
C)
C) ::
C): x: iNot Not
Not Existed;
Existed;
Mh (CY C) : xM h (CY
e
C) , xi+1Existed; , · · · , xO(CY C)−1 , xO(CY C) , · · · , x
Proposition 3.87: Let SHG = (G ⊆ P (V), E ⊆ P (V)) be i , xi+1 , · · · , xO(CY C)−1 , xO(CY C) , · · · , xi−1 .
MM
Mhhh(CY (CY
(CY C) C) : x
C) :: xxiii,,xxi+1 , x , · ·
i+1,, ·· ·· ·· ,, x · , x
xO(CYO(CYC)−1 C)−1,,,x xxO(CY
O(CYC) C),,,·········,,,x
xxi−1
i−1...
SuperHyperGraph. Then optimal-SuperHyper-coloring number i+1 O(CY C)−1 O(CY C) i−1
is |V | if and only if SHG = (G ⊆ P (V), E ⊆ P (V)) is SuperHyper- Ne (CY C) = 0; Ne (CY C) = 0;

complete. NN Neee(CY (CYC)
(CY C)N
C) ===(CY
h 0;
0; C) = O(CY C).
0;
Nh (CY C) = O(CY C).
NNNhhh(CY (CYC)
(CY C)=
C) ==O(CY O(CYC).
O(CY C).
C).
Proposition 3.88: Let SHG = (G ⊆ P (V), E ⊆ PProposition (V)) be Proposition 3.95. Let 3.95:
Proposition SHG 3.95. Let
= (G SHG
Let⊆SHG = (V
P (G),= ⊆E(G P⊆(V), ⊆
P (V PE(V ⊆),be
)) PE(V)) Pbe(Va))star-
a⊆star-neutrosophic be a star-ne
SuperHyperGraph. Then optimal-SuperHyper-coloring number
Proposition
neutrosophic
3.95. Let SHGSuperHyperGraph= with
(G ⊆ center
P (V c.
with
), E Then center
⊆ P (V c.)) Then
be a star-neutrosophic
Proposition
Proposition 3.95.with
3.95. Let center
Let SHG =
SHG =c. (G Then
(G ⊆⊆ PP(V (V ), ),E E⊆ ⊆ PP(V (V )) )) bebe aa star-neutrosophic
star-neutrosophic
is obtained from the number of SuperVertices which is |Gn| and
SuperHyperGraph
SuperHyperGraph
SuperHyperGraph with center
with
with center c.
center c. Then
c. Then
Then
optimal-SuperHypercoloring number is at most |V |. Me (ST R1,σ2 )M : ve1(ST , v2 R1,σ2 ) : v1 , v2
MMMee(ST (STR
(ST RR1,σ 1,σ22))):::vvv111,,,vvv222
1,σ 2 Mh (ST R1,σ2 ) : v1 , c, v2
Mhe (ST R1,σ 2 ) : v1 , c, v2
Proposition 3.89: Let SHG = (G ⊆ P (V), E ⊆ P (V)) be
SuperHyperGraph. Then optimal-SuperHyper-coloring number O(ST Rwhere O(ST R1,σ2M M)M ≤hhh(ST (STR
2;
(ST RR1,σ1,σ22))):::vvv111,,,c, c,vvv222
c,
where 1,σ2 ) ≤ 2; 1,σ 2
M (ST R 1,σ2 ) : Not Existed
is at most ∆ + 1 and at least 2. where O(ST
where
where O(STR
O(ST RR1,σ
1,σ22)))≤
1,σ
≤2;
≤ 2;
2; Me (ST R1,σ2 ) : Not e Existed
2
M M (ST R 1,σ22))))M h (ST
:: Not
Not R1,σ2 ) : Not Existed
Existed
M Meee(STh(ST(STR R R1,σ
1,σ
1,σ 2 2 : :Not Not Existed
Existed
Existed
Proposition 3.90: Let SHG = (G ⊆ P (V), E ⊆ P (V)) be
O(ST Rwhere O(ST R1,σ M M ≥
) (ST (ST 3. R R1,σ 1,σ22))):::Not Not Existed Existed
SuperHyperGraph and SuperHyper-r-regular. Thenwhere optimal- 1,σ2 ) ≥ 3. M 2 h
hh (STR 1,σ 2
Not Existed
Ne (ST R1,σ2 ) = 2(ST R1,σ2 ) = 2 N e
SuperHyper-coloring number is at most r + 1. where O(ST
where
where O(STR
O(ST RR1,σ
1,σ22)))≥
1,σ
≥3.
≥ 3.
3.

2
NNNNeeeh(ST(ST
(ST
(STR RR
R1,σ1,σ2222)))=
1,σ
1,σ
)N= =h2232(ST R1,σ2 ) = 3
=
Definition 3.91: (Eulerian (Hamiltonian) Neutrosophic O(ST R1,σ2 ) ≤N
Path). Let SHG = (G ⊆ P (V), E ⊆ P (V)) be a neutrosophic where O(ST Rwhere 1,σ2 ) ≤ 2; N
2; (ST R1,σ ) = 3
Nhhh(ST (STR R1,σ 1,σ222)) = = 33
N (ST R ) N =e0(ST R1,σ2 ) = 0
SuperHyperGraph. Then. where O(ST
where
where O(STR
O(ST RR1,σ
1,σ
1,σ222))
) ≤≤
≤ 2;
2;
2;
e 1,σ 2
Neeeh(ST (ST
(STR R1,σ N =h000 (ST R1,σ2 ) = 0
NN (ST R 1,σ22)))=
1,σ =
(i) Eulerian(Hamiltonian) neutrosophic path Me(SHG)
2
where O(ST Rwhere O(ST R1,σ2 ) ≥N 3. (ST R

1,σ2 ) ≥ 3. Nhhh(ST (STR R1,σ 1,σ22)))= ==000
(M (SHG)) for a neutrosophic SuperHyperGraph SHG = (G ⊆
h
N 1,σ 2
P(V ),E ⊆ P(V )) is a sequence of consecutive edges(vertices)

where
where O(STR
where O(ST
O(ST R 1,σ
≥3.
1,σ22)))≥
R1,σ ≥ 3.
3.
x1,x2,··· ,xS(SHG)(x1,x2,··· ,xO(SHG)) which is neutrosophic
2
path;
Henry GarrettHenry Garrett · Researcher

· Independent Independent Researcher ·ofDepartment
· Department of ·Mathematics
Mathematics · DrHenryGarrett@gmail.com
DrHenryGarrett@gmail.com · Manhattan, ·NY,
ManU
Henry
Henry Garrett···Independent
HenryGarrett
Garrett Independent Researcher···Department
IndependentResearcher
Researcher Departmentof
Department of Mathematics···DrHenryGarrett@gmail.com
ofMathematics
Mathematics DrHenryGarrett@gmail.com···Manhattan,
DrHenryGarrett@gmail.com Manhattan,NY,
Manhattan, NY,
NY,
where O(CM
where O(CM C
Cσσ111O(CM
where
where ,σ
,σ222,···
O(CM ,··· ,σ
)) σ=
,σtttC
C =,σ2;2;,··· ,σ ) = 2;
σ11 ,σ22 ,··· ,σtt ) = 2;
1 2 t
N
Nee(CM
(CMCCσσN ,σe22(CM
,··· ,σtttC
,··· ,σ =,σ−
)) σ= −,··· ,σ ) = −
N
1
1 ,σ
1
e2(CM C σ11 ,σ22 ,··· ,σtt ) = −
1 2 t
Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, N
USA
N (CM C σN
h (CM Cσ
h h222(CM
,σ ,··· )) σ=
,σtttC
,··· ,σ =,σ11 ,··· ,σ ) = 1
N
1
h (CM
1 ,σ
1
C σ11 ,σ22 ,··· ,σtt ) = 1 1 2 t
where O(CM
where O(CM C
Cσσ111O(CM
where
where ,σ
,σ222,···
O(CM ,··· ,σ
)) σ=
,σtttC
C =,σ1.1.,··· ,σ ) = 1.
σ11 ,σ22 ,··· ,σtt ) = 1.
1 2 t
position Proposition
3.96. Let SHG =Let ⊆ P (V
(G SHG = ), E⊆ ⊆ P (V )) be a
Proposition
t Researcher 3.96:
3.96.
· Department Let SHG
of Mathematics · (G
= (G ⊆P P(V),
(V ),EE⊆⊆ PP (V
DrHenryGarrett@gmail.com )) ·be
(V))
Proposition 3.98. Let
Proposition
a Proposition
Proposition 3.98.
beManhattan, NY,
Proposition
SHG
3.98.
LetUSA
SHG =
3.98.Let
3.98: Let
= (G
SHG⊆
⊆=
(GSHG
Let SHG
P
P (V
(G
=
(V ),
⊆E
(G
= ),
(GEP⊆PP
⊆⊆(V),
⊆ (V
PP(V
(V
(V
))
E),⊆E
),))
be
P⊆
Ebe
aaPwheel-neutrosophic
⊆(V))(Vbe
(V )) abe
)) bewheel-
aa wheel-neutros
Pwheel-neutrosophic
wheel-neutro
lete-bipartite-neutrosophic SuperHyperGraph.
acomplete-bipartite-neutrosophic Then
complete-bipartite-neutrosophic SuperHyperGraph.
SuperHyperGraph.Then SuperHyperGraph. Then
SuperHyperGraph. Then
neutrosophic
SuperHyperGraph.
Then ThenSuperHyperGraph.
SuperHyperGraph. Then Then
Me (CM Cσ ,σ ) : Not Existed M
Mhh(W
(W HL
HLM1,σ
1,σh
)(W
) :: xxHL
ii,, x , · · ·· i,,,xxxO(W
i+122,))·::· x
x1,σ
i+1 ·· ·· ··1,σ
i+1 ,,HL ,, x )−1 ,, xxO(W HL ,, x ,, xxi−1
))O(W .. 1,σ ) , xi−1
SHG1 =M M O(W
(Ge (CM Cσ),1E ) :P
· Not
(V ))Existed 2 (W HL xi , xO(W x HL )−1 x HL
2 O(W HL1,σ2 ) , xi−1
2
2 O(W 1,σ i−1
i+1 HL )−1 1,σ HL
2 1,σ 2
2 1,σ 2
2
Proposition
archer · Department of Mathematics ⊆ P (V ,σ2⊆
3.96. Let· DrHenryGarrett@gmail.com be a NY, USA
Manhattan, h 1,σ 2
1,σ 2 O(W HL1,σ2 )−1 1,σ
O(W HL1,σ2 )−1 O(W HL1,σ2 )
complete-bipartite-neutrosophic
v1 , v2C, · · · ,SuperHyperGraph. Then M
Mee(W
(W HL
HLM )) :: vvHL
11,, v 22,, v
Mh (CM Cσ1 ,σM 2
) : (CM )vO(CM
: v , vC,σ·1 ,σ , v , vO(CM Cσ1 ,σ2,)v
· ·2 )−1 1,σ2e22e(W
1,σ
M (W HL v1,σ v3) : v1 , v2 , v3
1,σ223) : v1 , v2 , v3
h σ1 ,σ2 1 2 O(CM Cσ1 ,σ2 )−1 O(CM Cσ1 ,σ2 ) 2
O(CM ≥ 3,Let|V1| = =
|V2 |,3,
M(Ve (CM∈ ⊆C ) be
: Not Existedwhere S(W
2 ; V , v where
HL
S(Wwhere )) =
HL1,σS(W 3.
=HL
3. 1,σ ) = 3.
Cwhere
Proposition )O(CM
σ1 ,σ2 3.96. CSHG (G ⊆vP EV
|),= |V1Pσ,|,1(V
,σ
v2)) ∈
v2i Va ∈ ∈ V ; where1,σS(W 1,σ22 ) = 3.
2
)≥ |V
2i+1
σ1 ,σ2 SuperHyperGraph.
1 2Then2i+1
2
2 HL 1 2i 2
Mh (CM Cσ1 ,σ2 ) : v1 , v2 , · · · , vO(CM Cσ1 ,σ2 )−1 , vO(CM Cσ1M M h (W HLM
2 )h (W HLM
1,σ )(W
) :: xxHL
ii,, x
x1,σ
i+1 , · · ·· i,,,xxxO(W
i+12 ,))·::· x i+1 ,,HL ·· ·· ··1,σ
,, x )−1 ,, xx O(W HL ,, x ,, xxi−1 .. 1,σ ) , xi−1
Me (CM C M ) :(CM v1 v2 Cσ ,σ ) : v1 v2 ,σ 1,σh2 (W HL
2
2
h 1,σ xi , xO(W i+1 HL
1,σ
x O(W
2 )−1
2
2 O(W HL
HLO(W )−1
1,σ2HL 1,σ
1,σ
x))O(W
2
2 HL
i−1
1,σ2 )−1 2 O(W HL1,σ2 )
2 , xi−1
Cσ1 ,σ2σ)1:,σNot
1,σ 1,σ
Me (CM 2 eExisted
1 2
2
where O(CM Cσ1 ,σ2 ) ≥ 3, |V1 | = |V2 |, v2i+1 ∈ V1 , v2i ∈ V2 ; M
Mee(W (W HL HLM 1,σ
M
)) :: Not
1,σ2e22e(W
(WNot HL
HL1,σ
Existed) : Not Existed
Existed
1,σ22 ) : Not Existed
Mh (CM Cσ1 ,σ2 M ) : vh1(CM
, v2 , · · ·C,σv1O(CM
,σM 2 )h C:(CM
v12,)−1 v2C,σvO(CM
1 ,σ2 ) : v 1 ,2 )v2
σ1 ,σ Cσ1 ,σ
Me (CM Cσ ,σ ) : v1 v2 where S(W
where HL
S(Wwhere
HL1,σ )) >
1,σS(W
3.
>HL
3. 1,σ ) > 3.
where O(CM
O(CM Cwhere C 1=
σ1 ,σ2 )σO(CM
) ≥ 3, |V1 | = |V2 |, v2i+1 ∈ V1 , v2i ∈ 1V2 2;
,σ22; where S(W
2
2
2 HL 1,σ22 ) > 3.
Cσ1 ,σ2 ) = 2;
MMee(CM(CMCM C
σ1σ
h (CM
,σ12,σ)M :2 v)1e:vC− ) : v1 , v)2 : −
σ1 ,σ2 C
(CM N
Nhh(W (W HL HL1,σ N )) =
Nh2h22(W
(W=HL O(W
HLO(W 1,σHL HL ) =1,σ O(W
O(W
);
); HLHL1,σ );
1,σ22 ) = 1,σ22 );
2 σ1 ,σ2 1,σ 1,σ22
2
where O(CM Cσ1 ,σ2 ) =M 2; (CM C

Mhh(CM Cσ1 ,σ σ12 ),σM:2v)1h,:(CM
vv2 1 Cσ1 ,σ2 ) : v1 N
Nee(W (W HL N )) = 3;
M e (CM Cσ1 ,σ2 ) : −
HL1,σ N2e22e(W
1,σ (W =HL 3; 1,σ
HL ) = 3;
1,σ222 ) = 3;
where O(CM
O(CM Cwhere C
σ1 ,σ2 )σO(CM
= ) =
,σ21. C2;
1
σ1 ,σ2 ) = 1. M (CM C ):v where S(W
where HL
S(Wwhere
HL1,σ
where
)) =
1,σS(W
S(W
2
2
3.
=HL
3. 1,σ2 )) =
HL = 3.3.
NM − 0 1 2
e (CM Cσ ,σ )): = h σ ,σ 1 2 1,σ22
e (CM Cσ11 ,σ22N e (CM Cσ1 ,σ2 ) = 0
where O(CM Cσ1 ,σ2 ) = 1. N
Nhh(W
(W HL N )) = O(W
1,σHL O(W ); HL1,σ2 );
Mh (CM Cσ1 ,σ2 ) : v1
Nh (CM CσN1 ,σ Nh2h22(W
HL1,σ
1,σ (W=HL
O(W
HL HL) =1,σ
1,σ22 ) =
1,σ 2 );
O(W
2
2
HL1,σ2 );
N)h=
e (CM
2 Ccσ1 ,σC
(CM 2)σ1= 2) = c
,σ0
2 2
where O(CM Cσ1 ,σ2 ) = 1. N
O(CM Cwhere ≥ 3, |V Nee(W
(W HL N
HL1,σ
1,σ
)) =
N2e22e(W
(W
0;
=HL
0; 1,σ
HL ) = 0;
1,σ22 ) = 0;
σ1 ,σ2 )O(CM C1σ|1 ,σ
=2 |V
)≥2N|,e3,v2i+1
(CM ∈
|VC1 |σ1N
= 2V
,σh =2,|,0vC
)(CM
|V 1 ∈ V2=
1 ,σ2 )∈
vσ2i+1
2i ; Vc1 , v2i ∈ V2 ; 2
where S(W HL )) >
1,σS(W
S(Wwhere 3.
>HL ) > 3.
where O(CM Cσ1 ,σ2 ) ≥ 3, Nh|V(CM C 1 ,σ2|,) =
1 | = σ|V v c ∈ V1 , v2i ∈ V2where
; HL1,σ
where S(W
2
2
2
3. 1,σ
HL 1,σ22 ) > 3.
Ne (CM Cσ 2,σ N) 2i+1
= 2 C
(CM ) =2
where O(CM Cσ1 ,σ2 ) ≥ 3, |V1 | = |V2 |, v2i+1 ∈1 V12, ve2i ∈ V2 ; σ1 ,σ2
Ne (CM Cσ1 ,σ2 ) = 2 Neutrosophic Super Hypergraph
NN
h (CM C 11,σ,σ
e (CM Cσσ )N
2 2
)h=
= 2 Cσ1 ,σ2 ) = 24
2(CM 4 Neutrosophic
4
4 Neutrosophic
Neutrosophic
Definition
SuperHyperGraph
SuperHyperGraph
4.1: (Zero Forcing Number). 628 Let SHG = (G ⊆ P
SuperHyperGraph
O(CM Cwhere
σ1 ,σ2 )O(CM
= 2; Cσ1 ,σ2 ) = Nh2;
Nh (CM Cσ1 ,σ2 ) = 2
Definition
DefinitionDefinition (V),
4.1. E⊆ (ZeroP (V)) be(Zero
Forcing
4.1. a neutrosophic
Number).
Forcing SuperHyperGraph. Then
(CM Cσ1 ,σ2 ) = 2 4.1.
Definition (Zero Forcing
4.1. (Zero Forcing Number).
Number). Number).
where O(CM Cσ1 ,σ2 ) =N2; − Cσ1 ,σ2 ) = − Let Let SHG SHG = (G ⊆
⊆P P (V ), E⊆ P (V )) be a neutrosophic SuperHyperGraph. Then
where O(CM Cσ1 ,σ2 ) = 2; e (CM Cσ1 ,σ2N ) e= (CM =Let
Let (GSHGSHG =
(V= ),(GE⊆
(G ⊆⊆P PP(V (V),
(V ),))EEbe ⊆
⊆ aP (V
(V ))
)) be
Pneutrosophicbe aa neutrosophic
SuperHyperGraph.
neutrosophic SuperHyperGrap
SuperHyperGrap Then
Ne (CM Cσ1 ,σ2 ) = − (i) zero forcing number Z(SHG) for a neutrosophic
NNhe(CM (CM Cσ1 ,σ2 )N
Cσ1 ,σ2=)h= − (CM1 Cσ ,σ ) = 1 (i) (i) zero forcing
(i)
(i) zero
zeroSuperHyperGraph
forcing number
zeronumber forcing
forcingZ(SHG)
Z(SHG)
number
SHG
number = (G
for
for a neutrosophic
Z(SHG)
⊆a P(V
Z(SHG) for
),E
neutrosophic
for ⊆
SuperHyperGraph
aa neutrosophic
P(V )) is minimum
SuperHyperGraph
SuperHyperGrap
Nh (CM CσN h (CM Cσ1 ,σ2 ) 1= 21 SHG = (G SHG ⊆ P (V= ),
(GE ⊆ ⊆ PP (V(V ),))E is⊆ minimum
P (V )) is cardinality
minimum of a set
cardinality S of black
O(CM C where )O(CM
= 1. CCσ1 ,σ) 2=) = 1. 1 ,σ 2
) = 1 SHG = (G
cardinality SHG⊆ P (V
of
= ),
a
(G E
set⊆ ⊆ S
P Pof(V
(V ))
black
), E is⊆ minimum
vertices
P (V )) cardinality
(whereas
is minimum of
vertices a set
in
cardinality S (G)
V of ablack
of a set
set S S ofof
σ1 ,σ2 O(CM vertices (whereas
vertices vertices
624
(whereas in V (G)
vertices \\624S
in are
V colored
(G) \ S white)
are colored such that
white) V (G)
such is turne
where
where O(CM Cσ1 ,σ2 ) = 1.1 2 σ ,σ 1. vertices
\ S
(whereas
are colored
vertices
624
vertices
white)
(whereas in
624 V
such
(G)
verticesthat
S
V
in are
(G)
colored
V (G)is \turned white)
S are black
coloredsuch
after
that
white) Vsuch that VV (G
finitely
(G) that
is turne (
black
black after
afterblack finitely
finitely many
aftermany applications
finitely many
applications of
of “the
“the color-change
applications of “the
color-change rule”:
rule”: aa white
white vertex
aa wh
vertex
position Proposition
Proposition
3.97.
PropositionLet 3.97:
SHG 3.97.
3.97. = Let
Let(GLet SHG
⊆
SHG SHG
Proposition 3.97. Let SHG = (G ⊆ P (V ), E P (V )) be aP =
(V= (G
),
(G= E ⊆(G
⊆ ⊆ P P⊆P
(V (V),
P
(V), (V
E)) E⊆),
beE
⊆
P a
(V⊆P P
))(V))
(V
be a be
)) be a a many
converted to
black
applications
aa black
after finitely
vertex of “the
if
many applications
color-change of
rule”: “the
a color-change
white vertex rule”:
is wh
Then converted
converted
to
converted black to aa black
vertex
to if it
black
is
is the
itvertex
vertex the if only
it
it is
only
if
whitethe
iswhite
neighbor
the only
neighbor
only white of aa black
whiteofneighbor black vertex;
neighbor of
of aa black
vertex; black
complete-t-partite-neutrosophic
lete-t-partite-neutrosophic
complete-t-partite-neutrosophic SuperHyperGraph.
SuperHyperGraph. SuperHyperGraph.
SuperHyperGraph.
SuperHyperGraph. Then Then Then Then converted to a black vertex if it is the only white neighbor of a
(ii) zero
(ii) zeroblack forcing neutrosophic-number Z (SHG) for a neutrosophic
(ii)
(ii) zero
forcing vertex;
zero forcing
forcing neutrosophic-number
neutrosophic-number neutrosophic-number Znn (SHG) Z Z n (SHG)
for for a neutrosophic
a neutrosophic
n (SHG) for a neutrosophic
MeM e (CM
(CM CCσM eM
σ1 ,σ (CM (CM
,···e,σ ) ): Not
tC :C Not σExisted
1 ,σ ) :,σNot
Existed
2t,···
) :Existed
Not Existed SuperHyperGraph SuperHyperGraph SHG
SHG = (G
(GSHG⊆⊆P P (V= ), E⊆
(GE⊆
(G ⊆⊆P
P (V
PP(V
)) is
(V),
),))E is⊆minimum
P (V )) is neutrosophic
minimum neutr
2 ,··· ,σt σ1 ,σ2 ,···
(ii)
SuperHyperGraph zero forcing =neutrosophic-number(V= ), Z (SHG)
minimum isfor a colored
neutrosophic
1 ,σ
2 ,σ t
SuperHyperGraph SHG (V E n
⊆ P (V )) minimum neutr
Mh (CM Cσ1 ,σ2 ,··· ,σt ) : v1 , v2 , · · · , vO(CM Cσ1 ,σ2 ,··· ,σt )−1 , vO(CM Cσ1 ,σ2 ,··· ,σcardinality cardinality of
of aa set
cardinality set S
S of
of black
a set
black vertices
S of
vertices black (whereas
vertices
(whereas vertices
(whereas
vertices in
in V (G)
vertices
V (G) \\ Sin
S are
V
are(G) \\ S
colored
Mh (CM Cσ1 ,σ MM (CM
h h (CM C
) : σC ) : v , v , · · · ,
: 21 , vC2 , · ·O(CM
)1O(CM v · , vO(CM , v ) neutrosophic
, vCO(CM cardinality SuperHyperGraph
of a set S of black SHG =
vertices (G ⊆ P
(whereas (V), E ⊆
vertices P (V))
in V (G) S
2 · ·t ,σ
v11,σ
σ,12v ,σ · ,t v
,···2,,··· ,,···
vσ1O(CM t
Ctσwhite) σsuch that
σt1),σ2V (G) )is turned black after finitely many applications of “the
,σ Cσ1 ,σ2C )−1 O(CM
)−1 C
2 ,··· ,σt σ1 ,σ2 ,··· ,σt )−1
,σ
,σt2 ,··· ,σ white) white)
1 ,σ)2 ,···
such ,σ
that such
V ,σt that
(G)
,··· is V
turned (G) is
black turnedafter black
finitely after manyfinitely many
applications application
of “the
is minimumwhite) such neutrosophic
that V (G) cardinality
is turned of black a set S
after of black
finitely vertices
many application
,σ2 ,··· ,σ
where O(CM Cσ1 ,σ2 ,··· ,σt ) ≥ 3, |Vi | = |Vj |, v2i+1 ∈ Vi , v2i ∈ Vj ; 1 t
where O(CMO(CM CC ) ≥) 3, ≥ |V 3,i ||V =i ||V= |,|Vvj2i+1
|, v∈∈VV i , ∈v2iV∈ , Vv2i j ; color-change
color-change
∈ Vj ; rule”:
rule”: aa white
white vertex
aa white
vertex is
is converted
vertex
converted is to aa black
converted
to black to vertex
aa black
vertex if
if it is
is the
itvertex
the if onlyit
only
O(CM Cwhere
σ1 ,σ2 ,··· ,σt ) ≥ 3,
σ1σ
,σ2,σ,···,···
1 |V
,σt ,σ
2 i| = t|Vj |, v2i+1 ∈j V i , v2i2i+1 j; i color-change rule”: \white vertex is white)
converted suchtothat black vertex if it
Me (CM Cσ1 ,σ2 ,··· ,σt ) : v1 v2 white(whereas
white neighbor
neighborwhite
white
vertices
of
of aa black
neighbor
black
neighbor
in V
of (G)
vertex.
a
vertex.
of a black
black
S are colored
vertex.
vertex.
V (G)
Me (CM Cσ1 ,σ2 ,··· ,σt ) : v1 v2 is turned black after finitely many applications of “the color-
MM e (CM Cσ11,σ,σ2M e (CM C1σv1 ,σ
) t: )v1:, v
v2 2 2 ,··· ,σt
) : Definition
v 1 v2 4.2.
4.2. (Independent Number).
h (CM Cσ 2 ,···
,··· ,σt,σ DefinitionDefinition change
Definition rule”: 4.2.
(Independent a white
4.2. vertex is converted
(Independent
Number).
(Independent Number). to a black vertex if it is
Number).
Mh (CM Cσ1 ,σ2 ,··· ,σt ) : v1 , v2 Let SHG =Let (G SHG⊆ P (V
= ),
(G EE⊆⊆P⊆⊆ PP(V(V ),))
))aE be⊆ aaPneutrosophic
(V )) SuperHyperGraph. Then
where O(CM Cσ1 ,σ2 ,··· ,σt ) = 2; M
Mh (CM Cσ ,σ ,···h ,σ ) : v1σ,1 ,σ (CM C v22 ,··· ,σt ) : v ,
1 2 vLet SHG the = only
Let (GSHG ⊆white
P (V = neighbor
),
(G P (V
(V of), E black
be⊆ (V )) be
vertex.
Pneutrosophicbe aa neutrosophic
SuperHyperGraph.
SuperHyperGrap Then
where O(CM Cσ1 ,σ2 ,··· ,σt ) = 2; 1 2 t
O(CM Cwhere O(CM Cσ ,σ M (CM

,··· e,σ 1 ,σ2 ,··· ,σt ) : −
) =Cσ2;
σ1 ,σ2 ,··· ,σt ) = 2;1 2 t
Definition 4.2: (Independent Number). Let SHG = (G ⊆ P (V),
M (CM C
Mh (CM Cσ1 ,σe2 ,··· ,σt ) : σv11,σ2 ,··· ,σt
):−
E ⊆ P (V)) be a neutrosophic SuperHyperGraph. Then
M (CM Cσ1 ,σM e (CM Cσ1 ,σ2 ,··· ,σt ) : −
2 ,··· ,σt ) : −
where O(CM Cσ1 ,σ2 ,··· ,σt ) = 1. e Mh (CM Cσ1 ,σ2 ,··· ,σt ) : v1
where O(CM Cσ1 ,σ2M Henry ) =Garrett
h e(CM CσσHenry
1.C M · ,σh (CM
Independent C σ ,σ Researcher
,···
) =)0: v1·· 1Independent
Garrett ,σ ) : v 1
Researcher(i) · Department
·· Department Independent
of number
of Mathematics
of I · (SHG) for a neutrosophic
·· DrHenryGarrett@gmail.com ·· Manhattan, NY,
NY, USA
·· Manhattan
Henry
N Garrett 2·,···
Independent Researcher Department of Mathematics
DrHenryGarrett@gmail.com Manhattan, USA
2 t
,··· ,σ t (CM 1 ,σ
Henry
1 ,σ 2 ,··· t ,σt
Garrett Independent Researcher · Department Mathematics DrHenryGarrett@gmail.com Manhattan
where O(CM C ) = 1. SuperHyperGraph SHG = (G ⊆ P (V), E ⊆ P (V)) is maximum
O(CM Cσ1 ,σ2 ,··· ,σt ) = 1. σ1 ,σ2 ,···
Nh,σ CσN cardinality of a set S of vertices Such that every two vertices of
t
(CM 1 ,σ ,··· ,σt )C=
e2(CM σ1c,σ2 ,··· ,σt ) = 0
where O(CM Cσ1 ,σ2 ,··· ,σt ) ≥ 3, |Vi | = |Vj |, v2i+1 Ne (CM∈ V i , v
C 2i ∈ V j ;
) =,σct ) = 0 S aren’t endpoints for an edge, simultaneously;
Ne (CM CσN h2(CM,··· ,σC ) = σ01 ,σ2 ,···
t σ1 ,σ2 ,··· ,σt
· Department
1 ,σ
(ii) Independent neutrosophic-number In (SHG) for a
Researcherwhere O(CM Cσ1 ,σ2of Mathematics
N e (CM Cσ1 ,σ2 ,··· ,σ
,··· ,σt ) ≥ 3, |Vi |N =h·|VtDrHenryGarrett@gmail.com · Manhattan, NY, USA
)=2
(CMj |, vC σ1 ,σ∈
2i+1 Vi , v2i ∈ Vj ;
2 ,··· ,σt ) = c neutrosophic SuperHyperGraph SHG = (G ⊆ P (V), E ⊆ P
Nh (CM Cσ1 ,σ2 ,··· ,σt ) = c
where O(CM Cσ1 ,σ2 ,··· ,σt ) ≥ N 3, (CM |Vi | = C |Vj2|,,···v,σ2i+1
) =∈ 2 Vi , v2i ∈ Vj(V)) ; is maximum neutrosophic cardinality of a set S of vertices
O(CM Cσ1 ,σ2 ,··· ,σt ) ≥ 3, |Vi | = |Vj |, ve2i+1 ∈σV1 ,σ
i , v2i ∈ Vj ;
t
such that every two vertices of S aren’t endpoints for an edge,
Nh(CM (CMCCσ1 ,σ2 ,··· ,σt))==22
archer · Department of Mathematics N
· DrHenryGarrett@gmail.com · Manhattan, simultaneously.
Ne (CM Cσ1 ,σ2 ,···e ,σt ) = σ21 ,σ2 ,··· ,σt NY, USA
where O(CM Cσ1 ,σ2 ,··· ,σt ) = 2;
Definition 4.3: (Clique Number). Let SHG = (G ⊆ P (V), E ⊆ P
Ne (CM Cσ1 ,σ2 ,··· ,σt ) = − (V)) be a neutrosophic SuperHyperGraph. Then
(i) Clique number C (SHG) for a neutrosophic SuperHyperGraph
Researcher · Department of MathematicsN·hDrHenryGarrett@gmail.com (CM Cσ1 ,σ2 ,··· ,σt ) = 1 · Manhattan, NY, USA
Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan,SHG NY,=USA (G ⊆ P (V), E ⊆ P (V)) is maximum cardinality of a set
where O(CM Cσ1 ,σ2 ,··· ,σt ) = 1. S of vertices such that every two625 vertices of S are endpoints for
Curr Trends Mass

Proposition Comm
3.98. , 2023 = (G ⊆ P (V ), E ⊆ P (V )) be a wheel-neutrosophic
Let SHG Volume 2 | Issue 1 | 46
Mh (W HL1,σ2 ) : xi , xi+1 , · · · , xO(W HL1,σ2 )−1 , xO(W HL1,σ2 ) , xi−1 .
M (W HL ) : v ,v ,v
4.
Henry Garrett · Independent Researcher 4. · Department ofM(SHG) n 2
Mathematics = · DrHenryGarrett@gmail.com
. ·M
artment of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, 5.USA 2 n
M(SHG) = .
epartment of Mathematics
tment of Mathematics · DrHenryGarrett@gmail.com
· DrHenryGarrett@gmail.com · Manhattan,
· Manhattan, NY,NY,
USAUSA G(SHG) = ∞. 2
· Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, 5. NY, USA
5. G(SHG) = ∞.
dependent number I(SHG) for a neutrosophic SuperHyperGraphProposition 643 4.8. Let SHG = (G ⊆ P (V ), E ⊆ P (V ))G(SHG) be a cycle-neutrosophic
G(SHG) == ∞.
3.
ndependent
pendent
HG = (G ⊆number
P (Vnumber
), E I(SHG)
⊆ P I(SHG)
(V )) for
is afor
maximuma neutrosophic
neutrosophic
cardinality SuperHyperGraph
SuperHyperGraph
of a set S of vertices
i) independent number I(SHG) for a neutrosophic SuperHyperGraph SuperHyperGraph
Proposition643 644 643
4.8.643
where
Let O(CY
SHG = (G C)⊆≥P 3.
(V Then
), E ⊆ P (V )) be a cycle-neutrosophic
SHG =⊆ (GP⊆ P),(V
E ),⊆E P⊆(VP))(VisS))maximum
is maximum cardinality a of
seta SsetofSvertices
of vertices 644645 644
Gh=that
uch
(G
SHG =an
every (Gedge,
(Vtwo
(Vsimultaneously;
⊆ Pvertices), E of⊆ P (V aren’t cardinality
)) is endpoints
maximum for of edge,
an
cardinality S of vertices Proposition
simultaneously;
of a setSuperHyperGraph 4.8: Let
Proposition
where
644 O(CY SHG
C)4.7. =Then
≥ 3.Let
4.8. (G
SHG⊆ P=(V),(GE⊆⊆PP(V(V)) ), Ebe
⊆ aPcycle-
(V )) be a path
cycl
thatthat
everyevery
two two vertices
vertices of Sofaren’t
S aren’t endpoints
endpoints for an foredge,
an edge, simultaneously;
simultaneously; 1.
(ii) Clique neutrosophic-number for a neutrosophic neutrosophic SuperHyperGraph where ≥ 3. Then
645
such that every two vertices
dependent neutrosophic-number In (SHG) for of S aren’t C
endpoints SHG)for an
n a neutrosophic
edge,
645
simultaneously; 646
645SuperHyperGraph.
SuperHyperGraph Then
where O(CY O
C) (CY
≥ 3. C)
Then
pendent SuperHyperGraph
1. Z(CY C n ) = 2.
ndependent
perHyperGraph
i) independent
neutrosophic-number
neutrosophic-number
SHG = (G ⊆ P
neutrosophic-numberSHG(V ),In= (G
I
E(SHG)
⊆ nP ⊆
(SHG)P)) (V),
for
(V(SHG)
I isafor E ⊆aPneutrosophic
neutrosophic
maximum
for (V))
a neutrosophic is maximum
neutrosophic 646 647 646
uperHyperGraph SHG = (G ⊆ P (V ), E ⊆ n
P (V )) is maximum neutrosophic 646 1. Z(CY C n ) = 2.
rHyperGraph
dinality ofneutrosophic
a set
SuperHyperGraph
SHG (Gcardinality
S of=vertices ⊆ Psuch E⊆
(V ),that
Pof
⊆ that
Pa(Vset
every SP maximum
)) is
E two
⊆ two of ))vertices
vertices S such
of neutrosophicthat every647648 647
aren’tneutrosophic
endpoints 647
ardinality of ofSHG
a SsetofSvertices = (G
vertices such (V ),
every (V is maximum
vertices ofaren’t
S aren’t 2.
endpoints Z(P
Z(CY TH C nn ) = 1.
2.
nality two
ancardinality
or
edge,
an edge, vertices
of a set S of
of asimultaneously.
set
simultaneously. of S are endpoints
such
vertices
that
such thatfor
every two
everyan twoedge,
vertices of simultaneously.
S
vertices
endpoints
of S aren’t
2.
648 649 648
endpoints649 648 O(SHG)
n edge, simultaneously. 649
I(SHG) = .
on for an (Clique
4.3. edge, simultaneously.
Number). 649
2. O(SHG)
650
I(SHG) = 2 .
tion
nHG 4.3.
=4.3.
efinition (G Definition
(Clique
(Clique
⊆
4.3. P Number).
(V ),
(Clique E ⊆4.4:
Number).
P (Matching
(V
Number). )) be a Number).
neutrosophic Let SHG =
SuperHyperGraph. (G ⊆ P (V),
Then E ⊆650 651 650 2 I(SHG) = O(SHG) .
SHG =⊆ (GP⊆ (VP),(V E ),⊆aEP ⊆
(VP))(Vbe))abe a neutrosophic SuperHyperGraph. 3.Then 651 651 651
650
.
P=(V)) ⊆be P (Vneutrosophic P (V )) SuperHyperGraph. Then
G = (G neutrosophic SuperHyperGraph. Then 2
Let SHG
que number (GC(SHG) forE a⊆neutrosophic
), be a neutrosophic
SuperHyperGraph SuperHyperGraph. 3. Then652
ue
HGlique
= (G number
number ⊆number(V ),C(SHG)
PC(SHG) ⊆for
E C(SHG)P (V afor)) afor
isneutrosophic
neutrosophic
maximum SuperHyperGraph
SuperHyperGraph
cardinality of a set S of vertices 652 653 652 3.
C(SHG) = 2.
i) clique amaximum
neutrosophic SuperHyperGraph C(SHG) = 2.
P(i)
(G ⊆matching
is number M(SHG) offor Sa of vertices
neutrosophic
652
SHG =
(G ⊆
Gh=that (G
every ⊆ P
(Vtwo (V ), E ⊆
⊆ P (V ))
), Evertices P (V )) is
maximum cardinality
cardinality of
a set a set S of vertices
), E of ⊆S are))endpoints for an edge, simultaneously; 653
SHG = P (V P (V
653 654
C(SHG) = 2.
uch
thatthat every
two two verticesof Sofare areisendpoints
S endpoints maximum forcardinality
an edge, of a set S of
simultaneously; 4.vertices 653
quesuch
every SuperHyperGraph
vertices
that every two vertices
neutrosophic-number
SHG
Cnof
=
S are for
(SHG)
(G ⊆
for
endpointsP(V
an
a neutrosophic
),E
edge, ⊆ P(V ))
simultaneously;
for an edge, is maximum
4.
simultaneously; 655
SuperHyperGraph
654 654
654 n
M(SHG) n .
ue
HGlique
= (G ⊆cardinality
neutrosophic-number
neutrosophic-number
P (V ), E ⊆ P of(Va ))Cset CS
(SHG)
nis n of
(SHG)
maximum edges
for afor such
aHenry thatGarrett
neutrosophic
neutrosophic
neutrosophic every two edges
of a setof
· Independent
SuperHyperGraph
SuperHyperGraph
cardinality S S655
Researcher 4.
· Department ofM(SHG)
Mathematics = =· DrHenryGarrett@gmail.com
. ·M
2 2M(SHG) = n .
655
656
i) clique neutrosophic-number C (SHG) for a neutrosophic SuperHyperGraph
Pdon’t Ehave any vertex in common;
n 655
SHG
G = (G =⊆
vertices (G
such⊆ P),(V
(Vthat ⊆EP⊆
),
every P))(V
(Vtwo ))maximum
is maximum
isvertices of S neutrosophic
neutrosophic
are endpoints cardinality
cardinality
for an edge,of a of seta Sset S656657 656
SHG =such (G ⊆ ), E ⊆
P (Vevery P (V )) is maximum neutrosophic cardinality
rtices such(ii)
f vertices
multaneously. that Matching
that
every twoneutrosophic-number
two
verticesvertices
of Sofare S endpoints Mnendpoints
are endpoints (SHG)
for an forforan
edge,aedge, 5. of a set
neutrosophic
5.
S
657 658 657
656 2
of vertices
imultaneously. such that every two vertices of S are for an edge, 657
SuperHyperGraph G(SHG) = O(SHG).

Number). SHG = (G ⊆ P (V), E ⊆ P (V)) is maximum 659
ltaneously. 658 658
5. G(SHG) = O(SHG).
on simultaneously.
4.4. (Matching 658
tion
nHG 4.4.
=4.4. neutrosophic
(Matching
(Matching
(G ⊆ P (V ),Number).
E ⊆ P cardinality
Number).(V )) be a of a set S ofSuperHyperGraph.
neutrosophic edges such that every Then two659660 659 G(SHG)
G(SHG)
G(SHG) == ∞.
= O(SHG). 3.
efinition 4.4.
G = (G ⊆edges
(Matching
P (V ),of ⊆ don’t
Number).
P (V ))have be a any
Proposition
Proposition 4.9.
4.9. Let
659 Let SHG
SHG = =
(G (G
⊆ ⊆
P P
(V (V
), E),⊆ E P⊆ (VP (V
)) ))
be abe a star-neutrosophic
star-neutrosophic
SHG
Let SHG
= (G ⊆ P
= (G ⊆M(SHG)
(VES ), E ⊆ P
P (V ), E ⊆for
(V ))
P (V
be a vertex
neutrosophic
neutrosophic in
)) be a neutrosophic common.
SuperHyperGraph.
SuperHyperGraph.
SuperHyperGraph.
Then Then 660 Proposition 4.9: Let SHG = (G ⊆ P (V), E ⊆ P (V)) be a star-
Then661
660
atching number a neutrosophic SuperHyperGraph SuperHyperGraph

SuperHyperGraph withcenter
with
660
Proposition 4.8.
centerc. c.
ThenThen
4.9.
4.7. Let SHG (G ⊆ c. (V ), E ⊆ P (V )) be a path cycl
star
matching
ching
HG = (Gnumber
⊆ number
P (V M(SHG)
), E M(SHG)
⊆ P (V for
)) afor
is a neutrosophic
neutrosophic
maximum cardinality SuperHyperGraph
SuperHyperGraph of a set S of edges such neutrosophic SuperHyperGraph with=center P Then
i) matching number M(SHG) for a neutrosophic SuperHyperGraph
661 662 661 SuperHyperGraph where
661SuperHyperGraph. with Then O(CYc.C)
center ≥ 3. Then
Then
SHG
G
at=every
(G=⊆ (G PDefinition
two ⊆ P),(V
(Vedges E ),⊆EPS⊆ 4.5:
(VP))(V (Girth
is))maximum and vertex
is maximum Neutrosophic
cardinality
cardinality of aGirth).
of
seta SsetofLet ofSHG
Sedges edges
1.
1.
such (G662663 662
=such
SHG = (G ⊆ Pof (V ),Sdon’t ⊆ Phave
E don’t (V ))any is maximum in cardinality
common; of a set S of edges such
⊆ P (V),
of SEofdon’t
⊆ P (V)) be
anyaany neutrosophic SuperHyperGraph. Then
662
hat
everyevery
two twoedges edges havehave vertexvertex in common;
in common; 663
1. Z(ST R1,σ )= O(ST R1,σ2 1,σ ) −2 )2.− 2.
that every
atching two edges of S don’tM
neutrosophic-number have any vertex in common;
663
Z(ST R21,σ2 ) = O(ST R
n (SHG) for a neutrosophic
663
664
Z(ST R Z(CY
Z(P2) =THC n) =R
O(ST
n 2.
1.1,σ2 ) − 2.
matching neutrosophic-number
ching neutrosophic-number
perHyperGraph SHG = (G ⊆ PM (V n),M(SHG)
En⊆ (SHG) for))afor
P (V a neutrosophic
isneutrosophic
maximum neutrosophic 664 665 664
1,σ
i) matching
rHyperGraph
dinality (i)
uperHyperGraph
of a setGirth
SHG G
S of=edges(SHG)
neutrosophic-number
SHG = (G
(G ⊆such for
⊆ P a
(V
P (V ), E ⊆ neutrosophic
), EM⊆ n (SHG)
P (VtwoP (V ))
)) isedges SuperHyperGraph
isfor
maximum
a neutrosophic
maximum 2.
neutrosophic
neutrosophic SHG
2. = 664
= (Gthat ⊆ Pevery )) of S don’t have any 665 666 665

SuperHyperGraph ofSHG ), E ⊆two
(Vevery P (V isofmaximum neutrosophic I(SHG) = O(SHG) − 1.− 1.
of a(G
ardinality
nality
tex in common. seta⊆Sset
of PofS (V),
edges E ⊆ Psuch
edges
such (V))
thatthat is minimum
every two edges crispof Scardinality
edges S don’t
don’t of
havehave any vertices
any 666667 666 665 2. I(SHG) = O(SHG)
cardinality of a set S of edges such that every two edges of S don’t have any I(SHG) O(SHG)
forming shortest cycle. If there isn’t, then girth is ∞; 3. I(SHG)= =O(SHG) −.
.1.
666
ertex in
x in common.common. 667 667

vertex in common.
on 4.5. (Girth and Neutrosophic Girth). 667 2
(ii) Neutrosophic girth Gn (SHG) for a neutrosophic 3. 668
tion
nHG =4.5.
4.5. (Girth
(G4.5.(Girth
⊆ Pand(V ),and Neutrosophic
Neutrosophic
E⊆ P (V )) beGirth). Girth).
a neutrosophic 3. C(SHG) = 2.
Girth). SuperHyperGraph. Then 668 669 668
efinition
GSHG
= (G =⊆ (G P⊆
(Girth
SuperHyperGraph
(VP),(V
and
E ),⊆EP⊆
Neutrosophic
(VP))(VbeSHG ))abe a=neutrosophic
(G
neutrosophic E ⊆ P (V)) isThen
⊆ P SuperHyperGraph.
(V),SuperHyperGraph. Then 669 669 668 3.
minimum C(SHG) = 2.
LetG(SHG)
SHG = for (G ⊆ P (V ), E ⊆ P SuperHyperGraph
(V )) be a neutrosophic SuperHyperGraph. Then670 C(SHG) = 2.
th neutrosophica neutrosophic cardinality of vertices forming shortest cycle. If C(SHG) = 2.
669
girth G(SHG) for a neutrosophic SuperHyperGraph 4.

h G(SHG)
HG = (G ⊆ for
P (Va ),neutrosophic
Efor⊆ aP neutrosophic
(V )) is SuperHyperGraph
minimum crisp cardinality of vertices forming 4. 670
Pthere isn’t, then (Vgirth is is ∞.

670 671
G
i) girth
SHG= (G
ortest = ⊆(GG(SHG)
cycle. ⊆(VIfP),there
(V
E P⊆
),⊆Eisn’t,
(VP))then is))minimum
girthminimumSuperHyperGraph
crispcrisp
∞;
isminimum cardinality
cardinality of vertices
of vertices formingforming671672 671 670 4. 4. M(SHG) = 1.
SHG = (iii)
(G ⊆ Neutrosophic
P (V ), E ⊆ P (Vgirth
)) is G (SHG)
∞; crisp for a neutrosophic
cardinality of vertices Super
forming 671 M(SHG) = 1. M(SHG) = 1.
hortest cycle. If there isn’t,
est cycle. If there isn’t, then girth is ∞;n then girth is 672 n
shortest cycle. IfGnthere isn’t, then girth· is ∞; SuperHyperGraph 5.
672
M(SHG)·=Manhattan, .
utrosophic Hypergraph
girth (SHG)SHG
Henry =
for a (G
Garrett ⊆ P
neutrosophic (V),
Independent E ⊆ P (V))
Researcher is minimum
· Department of Mathematics · DrHenryGarrett@gmail.com NY
672
673
2
neutrosophic
HGrosophic
= (G ⊆ girth
P (V girth
), GnP(SHG)
GEn (SHG)
⊆ (V forisafor
)) a neutrosophic
neutrosophic
minimum neutrosophic SuperHyperGraph
SuperHyperGraph
· cardinality of 5.
vertices 673 674 673
· 5. G(SHG) · = ∞. ·
(GPneutrosophic cardinality forofa neutrosophic
vertices forming shortest ofcycle. If674 674 673 5.
Henry Garrett Independent Researcher Department of Mathematics DrHenryGarrett@gmail.com Man
G
i) neutrosophic
SHG= (G
ming = ⊆
shortest⊆(VP), (V girth
E ),⊆EP ⊆
(V PG n (SHG)
))(Visisn’t,
))minimum
is minimum neutrosophic
neutrosophic
is ∞.
SuperHyperGraph
cardinality
cardinality of verticesvertices G(SHG) = ∞. G(SHG) = ∞.
SHG
orming (G cycle.
=there
shortest P (VIf),then
⊆isn’t,
cycle.
there
If ⊆girth
Ethere P (V is
))
isn’t,
then
∞.
is girth
minimum
then girth neutrosophic
is ∞. cardinality of vertices 675
674
ing shortest cycle. If there isn’t, then girth is ∞.
forming shortest ∞.
675 675
G(SHG)
G(SHG) = O(SHG).
= ∞.
tion 4.6. Let SHGcycle. = (G ⊆ If there
P (V ),isn’t,
E⊆P then
(V ))girthbe aiscomplete-neutrosophic Proposition 676Proposition
675
4.10. SHGLet
Let 4.10: = (GSHG ⊆ =P (G ⊆EP ⊆
(V ), (V),
P (VE⊆ a be a 684
)) Pbe(V))
osition 4.6.
on 4.6. Let Let SHG = (G ⊆ P (V ), E ⊆ P
SHG = (G ⊆ P (V ), E ⊆ P (V )) be a complete-neutrosophic(V )) be a complete-neutrosophic
opositionProposition
perGraph. Then 4.6: Let⊆ SHG P (V ), = (GP (V ⊆ ))P be(V), E ⊆ P complete-bipartite-neutrosophic complete-bipartite-neutrosophic
(V)) be a676Proposition =SuperHyperGraph.
(VP),(VE),⊆EThen
676
HyperGraph. 4.6.
ThenLet SHG = (G E⊆ a complete-neutrosophic 677
4.10. 4.8.
676Proposition Let SHG
SuperHyperGraph.
4.9. Let SHG (G=⊆ (GPThen
⊆ P⊆(VP)) (V be
)) a star
be a cycl
rGraph. Then 677
complete-neutrosophic SuperHyperGraph. Then
677
perHyperGraph. Then complete-bipartite-neutrosophic
SuperHyperGraph
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, US
677 with
wherecenter
O(CY c.
C) Then
SuperHyperGraph.
≥ 3. Then Then
Z(CM σ ) = O(CM
TGarrett ) − 1. Garrett
T σ Henry 1.
Henry · Independent ) − 1. · Researcher
· Independent· NY, Researcher
Department · Department ·ofDrHenryGarrett@gmail.com
Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY ·M
1. of Mathematics
1.
nt of Mathematics Z(CM · DrHenryGarrett@gmail.com
Z(CM = O(CM
T=σ )O(CM T−σ1. Manhattan, USA 1.
1. T σ ) T σ
Z(CM T σ ) = O(CM T σ ) − 1.
) Z(CM T σ1 ,σ2 ) = O(CM T σ1 ,σ2 ) − 2.
ent of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA Z(CM TZ(ST R= Z(CY
σ1 ,σ2 ) 1,σ
) =C
O(CM
2 O(ST
nT)= R2.1,σ
σ1 ,σ 2 ) − 2.
2 ) − 2.
I(SHG) = 1.
2. of Mathematics · DrHenryGarrett@gmail.com
nt 2. I(SHG)I(SHG)= 1.= 1.
· Manhattan,2.NY, USA
2.
I(SHG) = 1.
rtment of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, 2. USA I(SHG) = max{|V1 |, |V2 |}.
O(SHG)
I(SHG) I(SHG) = O(SHG) − 1.
nt of Mathematics · DrHenryGarrett@gmail.com
C(SHG)
G(SHG) = O(SHG).
= 3. · Manhattan, NY, USA = max{|V
I(SHG) = 1 |, |V2 |}. .
nt 3.· DrHenryGarrett@gmail.com
3. of Mathematics C(SHG)
C(SHG) = O(SHG).
= O(SHG). · Manhattan, 3.NY, USA 2
C(SHG) =
G(SHG) = O(SHG).
3. 3.
4.7. Let SHG = (G ⊆ PG(SHG) (V ), E ⊆=P 3. (V
n )) be a path-neutrosophic 3. 678 3. C(SHG) = 2.
4. M(SHG) =n .
C(SHG) = 2.
4.
aph. Then
4.7. Let SHG = (G ⊆M(SHG) P M(SHG) E=⊆
(V ),G(SHG) P 2(Vn
)) be a path-neutrosophic 679 C(SHG) C(SHG) = 2. = 2.
=
. 2 =. 3.
n 678
M(SHG) 2 = . 4. 4.
.7. Let
raph. SHG
Then
5. = (G ⊆ P (VG(SHG) ), E ⊆ P=(V3.)) be2 a path-neutrosophic 678 679
4.
4. M(SHG) = min{|V1 |, M(SHG) |V2 |}.
4.7. Let SHG = (GG(SHG)
ion Then
ph. ⊆ P (V ), = E 3.⊆ P (V )) be a path-neutrosophic 679 678
=n 1.
Z(P T H n ) = 1. M(SHG) M(SHG) = min{|V1=|, |V 2.|}.
4.7. Let SHG
erGraph. Then = (G ⊆ P (V ), E ⊆ P (V )) be a path-neutrosophic 2
Proposition 4.7: Let SHG = (G P (V), E P (V)) be a path-
678
⊆ ⊆
679
4.7. Let
artment SHG = (G ⊆ P (V ), E ⊆ P
Z(P T H n ) = 1.(V
of Mathematics · DrHenryGarrett@gmail.com )) be a path-neutrosophic
· Manhattan, NY, USA 5. 678 5.
aph. Then
epartment
ph.
tment Then neutrosophic
of Mathematics
of Mathematics SuperHyperGraph.
· Z(P ) = 1. Then · Manhattan,
· Department of Mathematics T H nO(SHG)
· Manhattan,NY,NY, USAUSA
5. 679679 5. G(SHG) = 4 G(SHG) = ∞.
I(SHG) Z(P = T H n ) = . 1. G(SHG)
G(SHG) = = 4O(SHG).
2 where O(SHG) ≥ 4. And
1. I(SHG) Z(P T = H n )O(SHG)
= 1. . where O(SHG)4.9.
≥ 4.Let AndG(SHG) =∞
Z(P T HO(SHG)
n ) = 1. 2 . Proposition SHG = (G ⊆ P (V ), E ⊆ P (V )) be a star
I(SHG) = O(SHG) SuperHyperGraph with center c. G(SHG)
Then =∞
2. C(SHG) =
I(SHG) =22. . where O(SHG) ≤ 3.
O(SHG) Henry
2 Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · M
I(SHG) = O(SHG)
C(SHG) = 2. . where 1. O(SHG) ≤ 3.
I(SHG) = 2 . Proposition 4.11. Let SHG = (G ⊆ P (V ), E ⊆ P (V )) be a
3. C(SHG) = 2. 2n Z(ST R1,σ2 ) = O(ST R1,σ2 ) − 2.
Let SHG = (G ⊆ PThen
Proposition 4.11. SuperHyperGraph.
complete-t-partite-neutrosophic (V ), E ⊆ P (V )) be a
M(SHG) =
C(SHG)2 = 2. .
n complete-t-partite-neutrosophic SuperHyperGraph. Then
4. C(SHG) =
M(SHG) =n2. . 1. Proposition 4.11: Let SHG = (G ⊆ P (V), E ⊆ P (V)) be a 687
2.
C(SHG) = 2. I(SHG) = O(SHG) − 1.
M(SHG) = .2 n complete-t-partite-neutrosophic
1. Z(CM T σ1 ,σ2 ,··· ,σt )SuperHyperGraph.
= O(CM T σ1 ,σ2 ,···Then ,σt ) − 1.
5. G(SHG)M(SHG) 2
= ∞.= .
n 2 3. Z(CM T σ 1 ,σ 2 ,··· ,σ t
) = O(CM T σ1 ,σ2 ,··· ,σt ) − 1
G(SHG)==n∞.
M(SHG) . 2. C(SHG) = 2.
4.8. Let Curr = (G ⊆Mass
SHGTrends M(SHG)
PG(SHG)), E ⊆=
(V Comm =P(V2.
2 )) be a cycle-neutrosophic
, 2023
∞. 2. 680 I(SHG) = max{|V1 |,Volume |V2 |, · · 2· |, Issue
|Vt |}.1 | 47
aph4.8. Let O(CY
where SHG = C)(G≥⊆ 3. PThen
(V ), E ⊆ P (V
G(SHG) = ))∞.be a cycle-neutrosophic 681680
4. I(SHG) = max{|V1 |, |V2 |, · · · , |Vt |}.
.8. Let
raph SHG
where = (G
O(CY C)⊆≥P3. (V ), E ⊆ P=(V∞.
Then
G(SHG) )) be a cycle-neutrosophic 3. 680 681 M(SHG) = 1.
ionwhere
ph 4.8. O(CY
Let SHG
C) ≥ (GG(SHG)
= 3. ⊆ P (V ),=E∞.
Then ⊆ P (V )) be a cycle-neutrosophic 3. 681 680 C(SHG) = t.
Z(CY C n ) = 2.
4.8. Letwhere
erGraph = (G ⊆
SHG O(CY C)P≥ E ⊆ P (V )) be a cycle-neutrosophic
(V3.), Then 680 5. 681 C(SHG) = t.
4.8. Let SHG = (G ⊆ P (V Z(CY), E ⊆C nP)(V = ))
2. be a cycle-neutrosophic 680
wherewhere O(SHG)
O(SHG) ≥≥ 4.
4.G(SHG)
And And = ∞
G(SHG) =∞ 3
In (SHG) = max{ i=1 i=1 (σi (x1 ) + σi (x3 ) + · · · + σi (x
G(SHG)
G(SHG)==∞ 3 3
σi (x i (x4 ) + · · · + σi (xt ))}xi xi+1 ∈E .

here O(SHG) ≤ 3. ∞ 3. 2) + σ i=1
where O(SHG) ≤ 3.
where O(SHG) ≤ 3. G(SHG) = ∞ σ i (x 2 )
σi (x2 ) + σi (x4 ) + + σ i (x σ 4 ) +
686
(x )·
i · ·2· + σ
686 +· · +
σ3 3 σ
(x i (x) +))} ·
i(x 4))}xi xi+1 ∈E .i
t · x· i +
x i+1 σ ∈E(x3t
. ))} xi xi+1 ∈E .
i=1
3i tσ (x
686
wherewhere O(SHG)
O(SHG) ≤≤ 3. 3. i=1 i=1 σ (x
i 686 )
2 )++σσi (x
686 i (x )
4 )++· ·· ·· ·++σσi (x i (x ))}x x
))}
t xi x ∈E.
sition 4.11. Let
where SHGO(SHG)= (G ≤ ⊆ P
3. (V ), E ⊆ P (V )) be a i=1 C n (SHG) σ
i
(x
2 =) + max{σ (x
4
) + (σ ·i (x
· · j)σ
+ +(x σit(x j+1 ))}
i i+1
i+1x∈E
j xj+
t ))}xii xi+1 .
687
position 4.11. Let4.11.
Proposition SHGLet = (G SHG ⊆ P= (V(G ), E ⊆⊆ P (VP (V ), E)) ⊆ be Pa(V )) be a 3. 687
i=1i=1
687 i 2 686 i 4 i i+1 ∈E
e-t-partite-neutrosophic
Proposition
Proposition
plete-t-partite-neutrosophic SuperHyperGraph.
4.11.
4.11. Let LetSHG
SuperHyperGraph. SHG = =(G (G ⊆ 3.
Then
3. Then⊆ P P(V (V ),),E E ⊆ ⊆3. PP (V
(V ))
)) be
be a
a 688 i=1 687 i=1
3
Proposition 4.11. Let SHG SuperHyperGraph.
(G ⊆ P (V ), E
=SuperHyperGraph. Then ⊆ PThen (V )) be a3.3. 3
3688 688
3
687
complete-t-partite-neutrosophic SuperHyperGraph. Then 4. Cn (SHG) =687
688 max{ 3 (σi (xj ) + σi (xj+1 ))}xj xj+1
688
complete-t-partite-neutrosophic SuperHyperGraph. Then
C C
(SHG)n (SHG) 3. = =
max{C max{
(SHG) (σ (σ=
(x i (x
max{
) +j ) σ+ σi (x (σ j+1(x ))}+
688jx)
x jσ
x i (x∈E
3j+1 .j+1. ))}xj xj+1 ∈E .
1. n n i j i j+1i))}
(x j xj+1 i=1
3 ∈E(σ (x ) +
i=1 C
Cn (SHG)
n (SHG) i=13 = max{ = max{ (σi3(x i j) j + σσ i (x
i (x j+1 ))}xxxj xj+1∈
))}
1. 1. Z(CM Z(CM T Tσ1σ,σ ))== O(CM
O(CM )T T σσO(CM −
Tttσ))1−,σ21.
1. i=1 = max{ i=1(σ j+1 j 3
Z(CM ,··· ,σt ) − 4. xjj
2 ,···
1 ,σ 2 ,··· tTt σ
,σ,σ = 1 ,σ
1 ,··· ,σ
,σ22,··· ,σ 1. C (SHG) (x ) + σ (x ))} j+1
1 ,σ2 ,··· ,σt
1. n i j i j+1 j+1 ∈
xj+1
Z(CM Z(CM T σT1σ,σ1 ,σ 24.,σt t
2 ,···,··· ,σ ) )= = O(CM
O(CM 4. TT σ
σ11,σ22,σ ,··· ,σ tt
) −
− M 1.
1.n (SHG) = max{ µ (x
i 0 1i=1 x i=1
) + µ (x
i 2 3 x ) + · · · + µ
2. Z(CM T σ1 ,σ4.2 ,··· ,σt ) = O(CM T σ1 ,σ2 ,··· ,σ 4. ) − 1. i=1 i=1 i=1
4. t
3 3 3
2. 2. I(SHG)==
I(SHG) max{|V1=
max{|V
I(SHG) |,max{|V
1|, |V22|,|, · · ·1 |,, |V
|V |Vtt2|}.
|}.
|, · · · , |Vt |}. 3 4.3 M (SHG)
n 33 3
= max{ 3 3
µi (x 3
03x1 ) + 3 µi (x
3
2 x3 ) + · · · + 3 µi
2. I(SHG)== Mn (SHG)
max{|V |,= 2=
|V2max{|,|,·max{
M ·n·· ·(SHG)
· ,, |V
|Vµ |}.
5. µ=i (x 0 x1 ) + µi (x
max{ µi (x2 x+ 3)·+ · · ·+ · ·i (x+ 2 xµ3 )(x µ+ i3(x · ·j−1
x· +)} xj )}|S|= n .
i 02x13) µ µin(x 2 x
I(SHG) 3)}|S|=
max{|V 11|, |V tt |}.
3
M n (SHG) i (x 0x 1) + i=1
3 i i=1
3j−1 µj (x|S|=
.j−1
2 · · · + 3
ji=1
I(SHG) = max{|V1 |, |V2 |, · · · i=1 , |Vt |}. Mn (SHG) M (SHG) = max{ µ (x x )
x1 ) +Gn (SHG) + x
x3∞. ) + · · · + µµi (i
) +
i=1 = max{ µi (x0i=1 µi (x2i=1 =
3. i=1 n i=1 i=1 i=1 i 0 i=1
1 i 2 3
Mn (SHG) = max{ i=1 i=1µi (x0 x1 ) + i=1 i=1µi (x2 x3 ) + · · · + i=1 i=1µi (
3. 3. C(SHG) =
C(SHG) = t.t.
C(SHG) = t. 5.
3. 5.
5. C(SHG) = C(SHG) =
5. t. t. Proposition 4.14. Let i=1
SHG = (G ⊆ P i=1
(V ), E ⊆ P (V )) be ai=1 cycle
Gn (SHG) = ∞.
4. 5.
SuperHyperGraph
5. G (SHG) where = ∞.
O(CY C) ≥ 3. Then
C(SHG)
t
= t.
5. Gn (SHG) = ∞.Gn (SHG) = ∞.
n
4.
4.14. Let SHG = (G ⊆GGP (SHG) ==P ∞.
M(SHG)M(SHG) |Vi||= t
==min min|V i=1 .. |Vi |i=1 . t
t min (SHG) ∞.
4. M(SHG) i Proposition nn (V ), E ⊆ (V )) be a cycle-
4. Proposition
M(SHG)
Proposition
i=1 = min 4.14.
Proposition
4.14. |V
Let i |Let
ti=1
SHG .SHG 4.14.
= 1.(G
Proposition = Let
(G⊆ ⊆
PSHG(VP ),
4.14: (VE ), ⊆
Let
= E
(GSHGP⊆⊆ (V PP = (V
)) (V(G))),⊆be
be aE P ⊆a(V), cycle-neutrosophic
PGn(V E
cycle-neutrosophic(SHG)
⊆)) P be (V)) a ∞.a cycle- 694 694
=cycle-neutrosophic
be
M(SHG) = min |V | . SuperHyperGraph where O(CY C) ≥ 3. Then 3
5. SuperHyperGraph i ti=1 O(CY
where Proposition
neutrosophic
Proposition C) ≥ Then
3.
O(CY 4.14.
Then
694
4.14. Let
≥Z3.
SuperHyperGraph
C)Let nSHG
SHG (CY =C=n(G )(G =⊆⊆
where PP(V
min{Σ (V),
O (CY),EEσ⊆ C)⊆ P≥P(V
i (x) (V
3.+)) Σ))3i=1
Then bebeaσaicycle-ncycle-
(y)}
M(SHG)
SuperHyperGraph =SuperHyperGraph
min |V
where i |i=1 O(CY C)where
.Proposition ≥ 3. 4.14. Let SHG
Then
= (G ⊆ P (V ),
i=1
E ⊆ P (V )) be a 695
cycle-n
695xy
5. G(SHG) = 3
G(SHG) =3 SuperHyperGraph
1.
SuperHyperGraph where O(CY
where O(CY C) ≥ 3. Then C) ≥ 3. Then
5. G(SHG) = 3
5. 1. 1. G(SHG)1.= 3 SuperHyperGraph
2. where ZnO(CY (CY C3C) ≥ 3. Then3 σ (x) + Σ3 σ (y)}
3n ) = min{Σ 3 3i=1 i i=1 i xy∈
where t ≥where
3. t ≥ 3. G(SHG) = 3 Z Z n (CY 1. 1.C n ) = Z min{Σ
(CY 3 Ci=1
3
) σ
= i (x)
min{Σ +3 Σi=1 σ σii(x)(y)}+ Σ.i=1
xy∈E. .σi (y)}xy∈E. .
here t ≥ 3. where t ≥ 3. n (CY C n ) = min{Σ
n σ
n i (x)
I + Σ σ
i=1
i (y)} xy∈E. · · ·
G(SHG) = 4 G(SHG)
G(SHG) =4 =3 1. i=1 (SHG)
ZnZnn(CY
i=1
(CYCCnn) )==min{Σ= max{ min{Σ3 i=1 (σ 3 (x )
i σ1i (x) +i Σ + σ (x 3 ) +
3 3 σi (y)}xy∈
σi (y)}xy∈Ei
+ σ
where t ≥ 3. G(SHG) = 42. G(SHG) = 4 2. 3i=1 σi (x) + Σ3i=1 i=1
Zn (CY C n ) = min{Σ 3 i=1 σi (x) + Σi=1 σi (y)}xy∈E
i=1
2.where
where t ≤where Andt ≤t2.≥And 3. 2. G(SHG) 2. =4 3
2. 2. 3 I (SHG) 33
= max{ (σi (x1 ) + σi (x3 ) + · · · + σi (
here t ≤ 2. And where t ≤ 2. And G(SHG) = ∞ G(SHG) n
G(SHG) = ∞ =I4n (SHG) In (SHG) 2.
= = Imax{
max{ n (SHG) (σ i
(σ
(x=i1(xmax{
) +1 )σ +(x
i
σi (x
3 (σ
)σ + )·+
3i (x
(x ·
1·) )·+ · ·
+
+ σ +
33

σ
σ
i=1
ii(x
σi3(x
(x
(x t4)), )) t+
+ )),· · · + σi (xt )),
· · · + σi (xt ))}xi xi+1 ∈E
where t ≤ 2. And G(SHG) = ∞ G(SHG) = ∞ i=1 I Inn(SHG)
(SHG) =
i
=max{ 2
max{ i
3 (σ
(σ i (x
(x ) )++σσi (x i (x ) )++· ·· ·· ·++σσi (x i(
where O(SHG) ≤ 2. i=1 i 11 33
where
where O(SHG)t ≤ 2. ≤ And2. G(SHG) = ∞
i=1 689
I n (SHG) i=1
3
689 = max{ i=1 (σ i (x 1 ) + σ i (x 3 ) + · · · + σ i (x
here O(SHG) ≤where 2. O(SHG) ≤ 2. G(SHG) = ∞ 3
3
3 689
σi (x 689
2) + σ
i=1
i=1 i (x4 ) + · · · + σi (xt ))}xi xi+1 ∈E .

position 4.12.
Proposition Let SHG
4.12. =
Let (GSHG ⊆ P =(V (G), E⊆ ⊆
P P
(V (V), ))
E be
⊆ Pa complete-neutrosophic
(V )) be a σ 3. (x
complete-neutrosophic ) + σ (x ) + · · · + 3σi(x ))} ·x·i+1·i +∈E .
where O(SHG) ≤ 2. σi (x2 ) + σi (x4 )σ+ i (x· ·2·)+ +σ σi=1 (x4))} ) t+xi689 σ.i (x3 t ))}xi xi+1 ∈E .
i 2 i 690
4 3 x x ∈E
ii(x
690 i+1
Proposition
Proposition 4.12:4.12.
Let ⊆Let
SHG SHG
= ),(GE= ⊆⊆(G PP(V), ⊆P ))E(Vbe⊆),aE ⊆ P (V be ))
P complete-neutrosophic
(V)) a be i=1a complete-neutrosophic 3691 tσi (x 690 ) + σ (x + · ·· ·++σσi (x
rHyperGraph.
sition 4.12. Then
Let
where
SuperHyperGraph. SHGO(SHG)=
Then (G ≤ P (V
2. (V i=1 i=1 691 690 C
n (SHG) σ i (x 2 =)
2689+ max{σ i (x
i 44 ) )+ (σ··i··(x j)σ +(x i (x ))}x x
σit(x ))}
t xi x
j+1 ))}
i i+1
i+1x∈E
∈E.
σ (x ) + σ (x ) + · + j xj+
yperGraph. SuperHyperGraph.
complete-neutrosophic
Then
Proposition 4.12. Let Then
690SHG SuperHyperGraph.
Henry=Garrett (G ⊆ P· (V Then
Independent
), E ⊆ P (VResearcher · Department
)) be a3.complete-neutrosophic i=1 i 2 690 · DrHenryGarrett@gmail.com
691 of Mathematics
i=1
691 i 4 i t ))}xii xi+1 i+1 ∈E · .M
1.
Proposition 4.12. Let SHG = (G ⊆ 3. P (V
3. · Independent ), E ⊆ 3. P (V )) be a complete-neutrosophic i=1 i=1
3
SuperHyperGraph. Then ·3.Department 690
Henry Garrett Researcher 3 of Mathematics =·691 DrHenryGarrett@gmail.com ))}x· jMan
3 3 3 691
Henry1.Garrett
Zn (CM· TIndependent
SuperHyperGraph. σ)
Z =Henry
(CM
Then OnT(CM =TO
σ )Garrett σ)
Researcher −· max{Σ
n (CM T· σDepartment
Independent − max{Σ
) i=1 σi (x)} x∈Vσ.i (x)}
3of Mathematics
Researcher ·3. . max{
Department · of
Cn (SHG)
Mathematics

·
max{
(σi (xj ) + σNY,
· 3Manhattan, i (xj+1 USA ···Manh xj+1
n Henry
Henry
Z (CM Garrett
Garrett
T ) = ·
· O Independent
Independent
(CM − Researcher
Researcher
C
i=1 C n (SHG)
3 ·
3.·x∈V
Department
=
Department
Cx∈V
n (SHG)
of
of(σ=Mathematics
(x )
Mathematics
i )max{ + σ
j σ (xi (σj+1 (x ··
(x DrHenryGarrett@gmail.com
))}
jx)j x+ x jσ
x i (x∈E
3j+1 .
j+1 ))}xj xj+1 ∈E .
Manh
Man
Henry Garrett · Independent Henry
Henry
Researcher
n Garrett
Garrett σ · · · Independent
Independent
Departmentn 3 T of σ ) max{Σ
Researcher
Researcher
Mathematics
n (SHG) ·σ· =
·i (x)}
max{
Department
Department . (σ of
DrHenryGarrett@gmail.comof
i (x +
Mathematics
Mathematics
j i j+1 i))}
· ··DrHenryGarrett@gmail.com
Manhattan, i=1 ∈E . NY, USA · · Manh
Man
1. Zn (CM T σ ) = OHenry n (CMGarrett T σ ) − max{Σ · Independent i=1 σi (x)} x∈V .
Researcher i=1
· Department
4. i=1of Mathematics
C Cnn(SHG)
(SHG) i=1 == ·max{max{ (σ j+1 3
DrHenryGarrett@gmail.com (σi (x i (x j )++σσ i (x ))}x·xMan
2. 1. Henry GarrettT·· Independent
Independent Researcher · Department
Department 3 i=1
of Mathematics
DrHenryGarrett@gmail.com j)
· Manhattan,
Manhattan, i (x j+1 j+1
NY,
))} USA
j xj+1
j xj+1 ∈
Researcher · Department HenryZ n (CM
Garrett σ ) = 3
of Mathematics · DrHenryGarrett@gmail.comO n (CM T
Researcher
σ ) − max{Σ
· σ i (x)}
of x∈V . · C n (SHG) = max{ i=1 (σ i (x
· j ) + σ i (x j+1 NY, ))} USA
x x j+1 ∈
2. 3 3 · 4.
i=1 Manhattan, NY, USA j j+1
Zn (CM 3 i=1
3 j
3
epartment of MathematicsIn· (SHG) σ ) = On
Tmax{ (CM
4. −
T σ ·). Manhattan,
3max{Σi=1 σi (x)}x∈V . i=1
I=
n (SHG) 3 = σ
max{
i (x)} x∈V σ i
(x)} x∈V . NY,
4.
4.
4. USA M (SHG) = max{ µ (x x ) + µ (x x ) + · · · +
Department 2.ofof Mathematics ·DrHenryGarrett@gmail.com
Henry Garrett · Independent ·Manhattan,
Manhattan,
Researcher NY, USA n
· Department of Mathematics i· DrHenryGarrett@gmail.com
0 1 3 i 2 3 3 · Ma
·epartment Mathematics · ·DrHenryGarrett@gmail.com I4.n (SHG) = max{ · ·Manhattan, σi (x)}x∈V NY,
4. . NY, USA
· DrHenryGarrett@gmail.com · Manhattan, 4. 3
Department
partment of of Mathematics
Mathematics i=1 NY, 4. 3USAUSA 3 3 i=1
esearcher
Researcher 2.
·· Department
Department I
of
ofn (SHG)
Mathematics
Mathematics = max{ ·· σi (x)}i=1
DrHenryGarrett@gmail.comx∈V . 3 4.
4. ··
Manhattan,
Manhattan, M (SHG) NY,
NY, =USA
USAmax{ 333 i=1 µ (x x )
+ 333 µ (x x ) + · · · +
333 i=1 µi (
esearcher ··3.
Researcher
Researcher
Mathematics Department
· Department
Department of Mathematics ··· DrHenryGarrett@gmail.com
Mathematics
of Mathematics
of DrHenryGarrett@gmail.com
· i=1
Manhattan, MnNY, (SHG) i=1
3 USA = max{ · Manhattan,
3 ·· Manhattan,
Manhattan, µi (xn NY,
NY,
x31NY,
) +=USA USA
USA µi (x 233
i
3x3 ) + ·3· · +
0 1 i 2
33µi (xj−1 xj )}|S|= n 3
.333 µ (x
Henry Garrett In (SHG) = max{
· Independent σi (x)}
Researcher x∈V ·. Department
MMM nn
0
(SHG)
(SHG)
(SHG) 3 ==
of max{
max{
max{
Mathematics
i=13µ µ
µii(x
(x
(x ·
00 xxx ) )
) + ++
3 µ
11 i=1 µ
µ
i3ii(x
(x
(x 22x x
x33 ))) ++
+ ··· ······++
+2
i=1· µi (x
µ
Man (
Henry Garrett · Independent In (SHG)
Researcher Cn (SHG)M n= max{
(SHG)
· Researcher
Department
= =
On (SHG). ofσiMathematics
max{ (x)} µi (x .of
i=1 5.
0MxM1)
n
(SHG)
n+(SHG)
·nmax{ 3
µµi= =
(xi=1max{
DrHenryGarrett@gmail.com max{ ·3· ·µµ+
xxDrHenryGarrett@gmail.com
31)) ++i=1
i
ii(x(x020x0 1
x31µ1))))i+·++
(xi=1
· +xµµ
Manhattan, µj3i)}i(x(x 2
22x x 3
)))n+
NY,
·333j−1 x.·j··)}
+ ······+
USA +i=1 µµiiii(x
(
Henry Garrett ·Henry
Independent · Independent
Garrett Researcher · Department of· Department
i=1 MathematicsMn x∈V (SHG) ·M= n (SHG)
Mathematics
DrHenryGarrett@gmail.comi=
(x 2·max{
0 i=1 µi (x
i=1
Mn (SHG) = max{ (x 0xx +
· 1Manhattan, · j−1
·i=1
i=1
i=1 i (x µ|S|=
NY,x
i2(x +
Manhattan,
2USA +
|S|=
µi (x0 x1 ) +i=1 µi (x2 x3 )G+n·(SHG) i=1 n .µ
n NY,
i=1 i( ·i=1
·+ µi (xj−1 xj )}|S|=i=1 2 .
3. Cn (SHG) HenryGarrett = Garrett
On (SHG). ·Independent
Independent Researcher i=1 5. ·Department
Department i=1 ofMathematics
Mathematics i=1 i=1·DrHenryGarrett@gmail.comi=1 i=1 = On (SHG).
DrHenryGarrett@gmail.com 2
i=1 ·ManMa
3. C Henry
(SHG) = O ·
(SHG). 5. i=1 Researcher · i=1 of
i=1 i=1i=1
i=1 · i=1 i=1 ·
i=1
3.
3.
4.
3. CnC(SHG)
nn (SHG)
Henry
Cn (SHG) =OO
=Garrett =nnO (SHG). · (SHG).
Independent Researcher5. 5.
5.· Department of Mathematics · DrHenryGarrett@gmail.com G (SHG) = O (SHG). · Man
3. n (SHG). n
Proposition 4.15.= Let n
SHG = (G ⊆ P (V ), E ⊆ P (V )) be a star n
Department
earcher · Departmentof Mathematics of = Mathematics· DrHenryGarrett@gmail.com CCC5. (SHG)=
n(SHG)
· DrHenryGarrett@gmail.com =O O (SHG). (SHG). 5.
· Manhattan, 5.
· Manhattan,5.NY, USA GNY, n (SHG) USA On (SHG). GGGnnn(SHG)
C· nDepartment
(SHG) Oof n (SHG).
nn (SHG)
CCnnn(SHG)
(SHG) = ==O O (SHG).
Onnnnnn(SHG).
(SHG). 5. 5.
SuperHyperGraph G with (SHG) center == Oc. (SHG)=
(SHG)
Then
(SHG).
==O OOnnn(SHG).
(SHG).
(SHG).
nt
4. Researcher Mathematics 3 · DrHenryGarrett@gmail.com
3 Proposition
3 · Manhattan,
Gn (SHG)4.15. NY,
= OnG(SHG). Letn
n (SHG)
USA SHG= O GG
(G
nG (SHG)
(SHG).
nn (SHG)
⊆
(SHG) P (V ),= =EO
= O⊆
O nn(SHG).
(SHG).
P (V )) be a star-ne
Proposition 4.15. Let SHG = (G ⊆ P (V ), E ⊆ P (V )) n
be n a star-neutrosophic n (SHG).
partment4. of
4.
4.
4. Mathematics
M n (SHG) 3 ·
= DrHenryGarrett@gmail.com
max{ 3 µ i (x 0 x 1 ) + µ i (x 3
1 ·
x Manhattan,
)
Proposition
2 + · · ·Proposition
+
Proposition
Proposition
Proposition
SuperHyperGraph
4.15.NY,
µ 1. i (x LetUSA
j−1 SHG4.15.
x 4.15.
4.15: )}
4.15.
j = Let
with
j= Let
(G LetLet
n
SHG
⊆ . SHG
SHG
SHG
center
P (V = ), =
(G=
=
c.
E (G
(G
⊆(G
⊆
ThenP ⊆⊆
P(V⊆
(V PP P
)) (V
(V
);E(Vbe ),
⊆),
),
a EEP(V
E ⊆ ⊆⊆ P
))P
P
star-neutrosophic(V (V))
(V
be ))
a)) bebe aaa star-neu
be
star- star-ne
star-ne
696
Mn (SHG) 4. = max{ 33 3 3

µofi (xMathematics
3 3 3
3Proposition
SuperHyperGraph · · ·4.15. 3
3 3 3 withProposition
Proposition
Let
µi (xSHG center
Proposition
= 4.15.
(G ⊆c. LetThen
n .P (V 4.15.
SHG 4.15.
4.15. =
), Ewith (G
⊆NY, Let 2 ⊆ SHG
Let
Pcenter
(V P SHG
(V
)) bec. ), =
E = ⊆
aThen(G(GP ⊆⊆
(V P
))
star-neutrosophic P (V
(V
be ),
a ), EE ⊆ ⊆ P P
star-neutrosophic (V(V )))) bebe a a star-neu
star-ne 697
Researcher · Department 0 x1 ) + i=1 µi (x ·(x 1 x2 ) +i=1
DrHenryGarrett@gmail.com +
SuperHyperGraph xSuperHyperGraph
)}
j−1SuperHyperGraph
Proposition
SuperHyperGraph
jneutrosophic
i=1 j= · with Manhattan,
2 .centercenter 696c. Zc.with Let
SuperHyperGraph
with
Then
(ST center
center
R USA
SHG )c.=
c.= (Gwith
Then
Then
O ⊆ PR
(ST (V ), E
center ) c:
− ⊆Then P (V ))3 beσa696(c)
max{Σ star-ne+ Σ 3
MM (SHG)
(SHG)
Mn3(SHG)
Researcher
n n ·= == max{
max{
= max{
Department µ µ
ofi (x
i (x
µ 0 x
(x
0 x
Mathematics
1 )
1 )
x+
+3333
) + µ µ (x
SuperHyperGraph
i ·
i µ 1 x
(x
1 x2 )
2 x)+ +
DrHenryGarrett@gmail.com3333· · · ·+
) + · ·+ · with
+ µ µ
SuperHyperGraph
i (x (x
center
i µ (x
j−1j−1 x x
c.
j j333)}
)}
SuperHyperGraph
x3
1.
SuperHyperGraph
Then
j=)}
·
j= with
nn .
Manhattan,
. Then
with
n
with NY, center
center1,σ
USA 2 c.
c. Then
Then n 1,σ 2 i=1 i i
Mn (SHG) max{ i=1
3µ (x
i 0 1 x i ) 0+ 1
i=1
3 3 i=1 µ (x
i 3xi
1 2 1. ) 1 + 2· 3 3
µµ (x· · + i=1 µ (x
i j−1 j i x j−1 )}
SuperHyperGraph
3 3 j
j= 2 n j=
2 .2 n
2 with center c. Then 697
MM
M (SHG)
(SHG) i=1 == max{
max{ µµ (x
(x xx ) ) ++ (x x x
i=1 )) +
1. + · ·· ·· · ++ 1.1.
1. µµ (x(x x x Z )})} (ST nn n ..
R ) = O (ST R ) − max{Σ 3
σ (c) + Σ 3
= max{ 5.
µi (xM M nn
n (SHG)
(SHG)
x1nnn)(SHG)
+i=1
i=1 i=1
µ= =
=i (x
max{
max{
1 x2 ) i=1
max{ + i=1
i=1
·µ ·µ
i
µ·ii(xii(x
(x000xxx111)))µ+
i=1
+
0 0
0 111 ++i (x j−1µ
µ i
µxiii(x ii (x
j(x
i=1
1 1
1
xxxZ
)}111j=
i=1
22 ))1.
2
2
i=1
22)nn +++.·······R
(ST ·· +
++ 1. )n=
1. µ
µµ2. iii
iO(x
ii(x
(xR j−1
j−1
j−1
j−1
(ST xxx)jjR
j jj)}
)})} j=
j=
j=
n j=n n
..max{Σ
2 1,σ
)R222n22−.R
2 3 n
σi (c) 3 +Σ
1,σ2 3
σΣi3(x)} i=1 i
33 σ.x∈V 333i=1
i=1 i 1.
0 j−1 j= j= 3 3(x)}
2 2Z (ST O 2 (ST −
)) − max{Σ σσ2i2i2(c)
)(c) +max{Σ σix∈V ..3+
1,σi=1 nj−11,σ Z 1,σ
j= O −
Z1. n(ST )) = n(ST R σiii(c) Σ σσσ
i=1 ))i=1
n (ST R1,σ22)Z (ST R 2= O (ST R − max{Σ σ (c) + Σ
3i=1
Gn (SHG) i=1
i=1 = min{Σ
i=1i=1
i=1
3
i=1 (σ (x) + σ (y) + σ
i=1
i=1
i=1 (z))}. Z= nn (ST
O n
n (ST R1,σ R321,σ
1,σ 22 )2 =
1,σ O max{Σ
nn (ST R1,σ1,σ − + max{Σ
Σi=1 i=1σ i (x)}
i=1
3i=1 (c)
+ Σi=1
i=1 i=1 i=1
i=1 i=1 i=1
i=1i=1Zn (ST R1,σ ) = O i i i=1
i=1 i
n2. (ST R1,σ2 Z Z−
)Z nn(ST
(ST
max{Σ
(ST R R1,σ
R
1,σ
1,σ ))=
22 ) σ==i (c)OOnn+
O (ST
(ST
(ST Σ= 3
R i=1
RR1,σ1,σ
1,σσi22(x)} )))− −−max{Σ max{Σ
max{Σ . σ(c) 3
3
i=1
i=1σσ
x∈V
σii(c)(c)+
(c) ++ΣΣ Σ3i=1
i=1
3 σ
i=1
3 σ
iσ
I (SHG) O (SHG) x∈V − i=1 = i=1 σ
5. Gn (SHG) = min{Σi=1 3
(σi (x) + σ2.i (y) + σi (z))}. 2. 2 n 1,σ i=12 n n i=1 1,σ n 2 i=1 i
3 i=1
5.
5. G (SHG) = min{Σ 3 3 3 (σ (x) + σ (y) + σ (z))}. 2. 2.2.
2.
GnG(SHG) (SHG) ==min{Σ min{Σ (σ(G i (x) ++P σiσ(V i (y) E+σ⊆ σ+ (z))}. 3 3
Gn4.13.
(SHG) = SHG min{Σ (σ = O
5. nn 3 i=1 i=1 i i (x) + i σi (y) i σi (z))}.
Proposition
5. Let i=1 (σ =i=1 i (x) ⊆ 3333 ),+
(y) iP
i (z))}. (V )) be a path-neutrosophic 2. 2. 3 333 i=1 xj =c
OIn− (SHG)
n (SHG) − σ(c)
5. 2. ). = σi (xj
692
GG
G n(SHG)(SHG) = = min{Σ
min{Σ (σ
(σ iiii(x)
(x) ++ σσσiiii(y)(y) ++ 2.
Iσσσniii(SHG)
i(z))}.
(z))}. =In(SHG)
(SHG)
On692 (SHG) =O n
(SHG)
σ(c) = − σ(c)
σ(c) = σi (x− σi(x
). (x 33
osition 4.13. Let
SuperHyperGraph. SHG 3 = Then (G G⊆nn (SHG)
P
(SHG) (V ), E == ⊆ min{Σ
P
min{Σ (V )) 3
i=1i=1
i=1 be (σ
(σ a (x)
(x) +
path-neutrosophic
+ σ (y)
(y) +
+ σ (z))}.
(z))}. I = I I (SHG)
(SHG)
(SHG) 3 − == OO = (SHG)
(SHG) jσ
− σ(c)
σ(c)
j).
= = σσiii(x(xjjj))
j =cσ (x
3 n
I n
(SHG) = O (SHG) − i
σ(c) j
= 3
G (SHG) = min{Σ (σ (x) G n+ (SHG) σ (y) + = σ (z))}.
min{Σ i=1 (σ (x) + σ (y) + σ (z))}. n 693 n i=1
x
= Let abe aIpath-
n i i i
Proposition 4.13: 3. n n
position
n
osition
oposition
HyperGraph.
sition
4.13.
4.13.
4.13. 4.13.
Then
Let
LetLet
Let SHG
SHG
SHG i=1 =
SHG =(G
(G=⊆
i (G SHG⊆⊆
n
(GPP(V ⊆P=(Vi
),(G
(V
P ),
EE
(V),⊆E ),⊆
⊆ PE ⊆(V),
i
PP(V ⊆ P(V (V
P
))E))i=1
(V ))
⊆
i=1
bebe P
be(V))
)) a abe
i apath-neutrosophic
path-neutrosophici
path-neutrosophic
path-neutrosophic n (SHG) = On (SHG)
i
692693− σ(c)
692
692 IIInn= n
(SHG)
(SHG)=
(SHG) =
i=1
= O
σ O
O n
n
(x
x nj(SHG)
(SHG)
=
(SHG)
i=1
c xjj=c−
).
i=1
x
= c
−−σ(c) σ(c)=
σ(c) =i=1
= σσσii(x(xjj)
=cc i (xj
692 i j
n n 3 i=1
i=1 x 3
=
xxjjj= c
HyperGraph.
HyperGraph.
perHyperGraph. neutrosophic
Proposition
Proposition
1.
Proposition
Proposition
Then
Then Then 692
4.13.
4.13.
4.13.
4.13. SuperHyperGraph.
Let
Let
Let
Let
SHG
SHG
SHG
SHG
==
=
=a(G
(G(G
(G
(G Then
⊆⊆
⊆
⊆P
PPP
P(V
(V
(V
(V
(V
),),
), E EE ⊆⊆ ⊆
⊆P
P
PP (V(V
(V ))
))
))
3. bebe
be a a path-neutrosophic
path-neutrosophic
3.
be aaa path-neutrosophic
path-neutrosophic 693
693 692
692
692 i=1
i=1 x x
=
= c c
3.),),E E⊆ P(V (V3. )) be path-neutrosophic
yperGraph. i=1 =c
Let SHG =Then(G ⊆ P (V
Proposition ), E ⊆
4.13. Let P (VSHG )) be = path-neutrosophic
⊆ )) 692 693
693
3 692
692
692Cxnj(SHG)
=3 σi (c) + max{ i=1 3 xj =σ
j j
c i (xj )}
SuperHyperGraph.
SuperHyperGraph.
Then
Then Z (P T H ) = min{Σ 3
σ (x)} 3.3.
3. . 3 3 693 693
693 3 3
hen SuperHyperGraph.
SuperHyperGraph. Then Then n n i=1 i x is a leaf 693

3. CCnn(SHG)
(SHG) = = Cσ σ693i(c)
(c) + + max{
max{ 333 σ (xj)}. )}.
3. 693 i=1 i=1
333 σ (x )}.
3. σ (x)} ni(SHG) = σσii(x
i (c) j + max{
693
1. Zn (P T H n ) = min{Σ3i=1 x is a leaf . 3.Cn (SHG) i j
Znn(P (P T H ) = min{Σ 33 3 σ i
(x)} . 3 = σi (c) i=1 +
C max{
3(SHG) =σi (x
3 )}.
3i=1
3j σ (c) + max{ 33
3 σ
1.
1.
1.
2.
1. Z Z (P Z Tn
T(P
H H T )n )
H
n
= = n ) min{Σ
min{Σ = min{Σ 3 i=1i=1σ σ i
(x)} (x)}
i σ i (x)} x x is is
x a a
is leaf
leaf .
a
.leaf . 4. i=1CC
n nn (SHG)
(SHG) == i=1
i=1 σσi i
i (c)
(c) + + max{
max{ i=1 σσiii(x (x(xjjj)}. )}.
)}.
1. n n
Z (P T i=1
H )
i=1
i
= 3 min{Σ
x is a 3333leaf
σ (x)} Cisis
n (SHG) . = σi (c) + max{CCnnn(SHG)
i=1 C (SHG)
(SHG)
σi (xj )}.
i=1 = =i=1
= σ σ (c)
σii(c) (c) + + max{
+3 max{max{i=1 σ σii(x
σ (x (xjj)}.)}.
)}.
3 Z
Z n
Znnn(Pnn (P
(P
(PisTTaH TT HH n
Hleaf nn )
) =
= min{Σ
min{Σ 3
i=1i=1 σσ iii (x)}
(x)} 4.
4. xx is xxx is a a
a leaf
leaf
leaf .. i=1
i=1 i i=1
i=1 i j
n)).= = min{Σ min{Σ3i=1 σiii(x)}
(x)} .
i=1 4.
Zn (P T H n ) = min{Σi=1 In (SHG)σ i (x)} Z
3 x = max{ 4. n
n i=1σ
i=1
(σi (x1 ) + σi (x3 ) + · · · 4. x isis aaa leaf
leaf
leaf .
+ σi (xt )), i=1 i=1 M 3
(SHG) i=1
i=1
= max{ µ (x i=1
i=1
x )}
2. 33 3 4.
4. 3n i=1
3 i j−1 i=1 j xj−1 xj ∈
2. In (SHG) = max{ 3 Mn(SHG) (SHG) = = max{ µµi(x (xj−1 xj )}xj−1 xj ∈E..
i (x3 ) + · · · + σi (xt )),
2. (σi (x1 )4. + σi=1 4. M 3 max{ i j−1 xj )}xj−1
2.
2. 4.
4. n
M (SHG) = max{ 333xji=1 ∈E
µ i j−1 xj )}xj−1 xj ∈E .
(x
2. IInn(SHG) I(SHG) =max{ max{ (σi (x i (x ) )++) 3σ (x3(x ) )++)· + · · ··+·+·σ+ σi (x (xti )), t )),
==max{ (σ(σ σ i3(x
33 n i=1
In (SHG) n3(SHG) = max{ i=1 (σ
i (x1 )i + 1σ
1(x
1

i
+ iσ 3
33 3 )i + 3· · · + σi (xt )),
(x iσ (x t )), Mn (SHG) = max{
3 M µi (x j−1 xj )}
i=1
(SHG) = j−1 xj ∈E
xmax{ 33.
µ (x
MM (SHG) = max{ µ (x j−1x xxjjj)} )} ∈E...
3 5. (SHG) = max{ 3
µ i(x µ (xj−1 )}xxxj−1
IIInnnn(SHG) = max{ (σ iiii(x 1111))) + σiiii(x 3333)))) + · ······ + σσiiii(x tttt)),
n i=1 i xxjjj∈E
∈E
+n··x··(SHG)
(SHG) = max{ (σ (x + n i j−1 j−1x
++σσσ (x + + (x )), Mxnnnj(SHG)
i=1 5.
(SHG)
)Inn+(SHG)
(SHG) i=1 i=1 == ·max{
max{
·)· + σ (σ
(σ (x
(x 1·))· +
+ σiσi(x (x
(x 5. 3)M
+ ··x· +++ σσ σii(x (x(x= )),
max{
)), µi (x i=1 M )}xj−1 xj=
(SHG) = max{
max{
. µii(x (xj−1 j−1xx xjj)} )}xxj−1 j−1
jj∈E∈E..
n (SHG) = max{ 3 (σi (x1I σ
i=1i (x3 σ )= +
i (x max{
2 ii (x (σ4t )),
)
i i(x + 1 · i (x3 +
))} · ∈E . t t)), j−1 M n (SHG) =∈E max{ G i=1
i=1
i=1(SHG) µ i =
j−1 ∞. j )} x j−1xx
x ∈E .
33 3 i=1 i=1
i=1 t i i+1
5. GGn(SHG)
(SHG) = = ∞. ∞. n j−1 j

3
i=1 σi (x2 ) + σi=1 (x4 ) + · · · +i=1 i=1
σi (x5.t ))}
i=1
xi xi+1 ∈E .
i=1 n i=1
i=1
i=1
σi (x
σ(x iσ(x2i (x
)+)+ +σ
2σ)i
σii3333(x
+ i (x )+)+ +· · · ··+·+·σ+ σi (x (xti ))} t ))} ∈E.∈E . . 5.5.
5. G⊆ (SHG) =⊆ ∞.P (V )) be a
3 4σ)4 i (x 4· )· ·++
2 4 iσ (x ))} x ix x∈E Proposition 4.16. ⊆Let (VSHG ⊆= (G)) nbe Paa(V ), E
3 i=1 σ )
(x
3 5. σ (x ))} tix ix xi+1
i+1
∈E Proposition
.
Proposition 5. 4.16.
5.
4.16. Let SHG
Let SHG G ==(SHG)(G ⊆
(G P P(V= ),E
∞.
), E⊆ PP(V (V )) be
3. i=1
i=1 i=1
i 2 σ σ (x(x ) ) ++ σσ
i
(x(x t
) ) + +
x
· ·
x
· · ·
i+1
· + +
i
σ σ
iiii(x4444) + · · · + σcomplete-bipartite-neutrosophic
i+1
(x(x
))}))} 5. . .
n GGG n n (SHG)
(SHG)
(SHG) = == ∞.
∞.
∞.
σ
σiiii(x(x222222i)))x+++ σσ (x . 344)) + + ······ + iiii(xttt))}x
(x ))}xxxiiixxxxi+1
+ σσcomplete-bipartite-neutrosophic i+1∈E ∈E.
∈E
∈E.. Gn (SHG)
∈E SuperHyperGraph. SuperHyperGraph. Then
⊆GG GnPnn(SHG)(SHG) ==P ∞.
∞. (VThen
i (x4 ) + · · · + σ
i+1
σi (x2 ) + σi=1 i (xσ t ))}
ii(xx i+1σ ∈E ii(x ii(xttt))}xxiiixxProposition i+1
i+1∈E 4.16. ∞. SHG = (G
SuperHyperGraph.
=Let Then (V ), E ⊆
n (SHG) = ∞.
)) be a
i=1
i=1
i=1
i=1 Proposition 4.16. Let i+1
SHG
Proposition = (G ⊆
4.16. P (V Let ), E SHG ⊆ P (V= ))
(G be ⊆ aP (V ), E ⊆ P (V )) be 698
3. i=1 C i=13
(SHG)
n
i=1 = max{ (σ (x
i j ) + σ 1.
(x
i1. j+1 ))}Proposition
Proposition
xj xj+1 1.⊆ ∈E . 4.16.
4.16. LetLet SHG
SHG =
= (G
(G ⊆⊆
SuperHyperGraph. P P (V
(V ),
), EE ⊆⊆ P
P (V
(V
Then )))) be aaa
be
3 3 3 Proposition
4.16. Let SHG Proposition
Proposition
= (G P (V 4.16.
SuperHyperGraph.4.16.
), E ⊆ Let Let
P (V SHGSHG
)) Then
be = =
a (G(G ⊆⊆ P P (V
(G ⊆3 P (V ), E ⊆3 Then(V ),), EE ⊆ ⊆ P P (V(V )))) bebe a a 699
3.
3. C (SHG) = max{ 3 (σi (xj ) + σi=1 i (xj+1 ))}xj xj+1 ∈E . complete-bipartite-neutrosophic Proposition 4.16. Let SHG = SuperHyperGraph. PThen(V )) be a 698
3.
3. complete-bipartite-neutrosophic
complete-bipartite-neutrosophic SuperHyperGraph.
SuperHyperGraph. Then (x)}
3. C Cnnn(SHG)
C(SHG)
(SHG) = = =max{
max{ max{ (σ (σ (x
(σ
i (x )
(x
j )+ + ) σ +σ
333(x
i (x
σ (x
j+1 ))} ))} ))}x x ∈E . . ZZ
.
(CM
n(CM T σ1 ,σ2)) =
1.
SuperHyperGraph.
T =O On(CM (CMThen
Zn (CM T σ11,σ22) = O TT σ1 ,σ2)) − − max{Σ
max{Σ
SuperHyperGraph. 3i=1 σi (x) + Σ3i=1
SuperHyperGraph. σ
i=1T σ ,σ ) − (x) + Σ σi(x
Then
Then
σ )}3x,x ∈V ..
Cn (SHG) i j i
3 j+1 x x ∈E . ∈E complete-bipartite-neutrosophic n (CM
SuperHyperGraph. max{Σ
Then i=1 σi (x) + Σ 699
n3 = max{ i=1 (σi (xj )i + jσ i (x
33 1. i ))} j+1 j j j+1
xj xj+1
j+1 n σ 1 ,σ 2 n σ ,σ i i=1 i x,x ∈V
j+1 xj xj+1
σσσiiii∈E xj1.
1 2
4. CCnnn(SHG)
(SHG) i=1 == max{
max{ (σ(σ iiii(x
(x jjjj))) + + (x(x j+1))} ))} 1.
1. ∈E...
Cn (SHG) = max{ (σi (xjC)CCnn+ (SHG) i=1 i=1 = max{ (σ (x + (x j+1j+1 ))} x x jjx j+1∈E
xj+1
x ∈E
(SHG)
σi=1
n(SHG) (x
i j+1 == ))} max{
max{ 1.j xj+1
x (σ
∈E i j(σ . i (x
(x j ) ) + + σ σ i(x(x
2.
i 2. j+1
j+1
j+1 ))}
))} xx 1.
j 1.
xx
j+1
j+1 ∈E
∈E . .
j+1∈E Zn (CM T σ ,σ ) = On 3(CM T σ1 ,σ ) − max{Σ3i=1 σi (x) + Σ3i=1
T σ1 ,σ2x)j x1. 3 2 3σ (x )}
j j+1
i=1i=1
i=1
i=1 Zn (CM =O 2.n (CM Z T σ1T ,σ2 ) − )
1
max{Σ
2 3
3= O (CM σiT(x) + 3Σ i 333x,x ∈V . 333
4. Curr Trends Mass Comm,
i=1 2023
3 i=1 3
i=1 (CM T 3 In(SHG) Z n
(SHG)
(CM
Znn (CM(CM =TTT σσσ111,σ
max{( ,σ,σ222 3 ) =
) = Onn (CMO n i=1
(CMσi(x(xjT)),TT3σσ1Volume
)),σ ,σ
(1,σ,σ2 )
223))−i=1
−− max{Σ
2max{Σ

max{Σ |σIssue
max{Σ (xj))}. i=1
))}.1i=1
3|σ
3i=1 σ48
σσiii(x)
(x)
(x)
3+
++Σ

ΣΣi=1
3i=1
3 σ
i=1
σ
4. Z n σ ,σ ) = O n (CM IT n σZ Z
Z n
,σn (CM
(CM
)
(CM − = T
max{Σ
max{(
T σ σ ,σ,σ ))
) = =
= σOOO
i (x)
nn (CM
(CM
σ
(CM +
i Σj T
T σ σ(
1
,σσ ))
(x
11 2i2 ) − max{Σ
,σ − − )} max{Σ
σ
x,x i
i(x
∈Vj .
i=13 σ
σ i (x)
i (x)
(x) ++
+ Σ Σ
Σ 3
i=1
4.
4. Mn (SHG)
4. 3 = max{ 3µi (x0 x1 ) +2. µi (x 3 2 x3 ) + · · · +
3 1 2 2. µi (xj−1 xj )}|S|=1 2I2ni=1
1 n 2 σ
11 22 i=1
,σ .(SHG) n i=1σ ,σ i=1 i i=1
xjj∈V11 = max{( σi (x j )),3(
n i=1 x ∈V 1i=1 2 xj ∈V2 i=1 i=1σ
Mn (SHG) 4. = max{ 3 33 3
3 3 3
· · · + 3
33 3
2.2. 3i=1 x j ∈V2

µi (x0 x1 ) + i=1 µi (x2 x3 ) +i=1 µi (xj−1 xj )} i=1 2.|S|= n . 3 3 ∈V ∈V
MMnM (SHG) =max{ max{ µµi (x (x0i (x x ) + µi (x (x2i (x
i2. xx3 3)x)+ +333 · · · + µi3.
3. (xj−1 xxj 2.
)}
32.|S|=nn .n . . In (SHG) = max{( 3 i=1 x
σi (xj )), ( 3 i=1
σi (x
x
·33)3···++·+· ·i=1
(SHG) 33 33
==max{ x10x)101)+x+ ) +µµ +µµ (x )}
3333 2
n n3(SHG) = max{ iµ µ 2 iµ (x
j−1 j33x
3
j )}|S|=
j 1
j 2
M n (SHG) i=1 3µi (x0
1 33i=1 i (x 23x 3 ) 2+
3 i (xj−1 iI x(SHG)
j )}
j−1 32. |S|= =n 2max{(.23 2 σ 3i (x )), ( 33 σ (x ))}. 33
n 3|S|= IImax{ (SHG)
(SHG)
= 3=j
max{(
max{( i σ j (x )), ( σ (x
M nn(SHG) i=1 = max{ µ ii(x x1111))) + µ (x xxx333i=1
3)) + ········· + µ i(x xxxjjjj)} j ∈V1σ σiii(x (xjjj)),)),. (( j ∈V2σ σi (x
n .. 3
M =σII
(SHG) = max{ µ (x (SHG) = max{( 3 3 (xj
(x000000xxx + µ (x + + µ (x )} i=1 x i=1 x
i=1 2
M (SHG) i=1 = max{ i=1 22i=1 nn nn
·µ (x + µ (x i=1
I33n)))(SHG)+ + µµiiiii3.(x )} 1... ((σ σσiiii(x
n
max{ µ5.i (xMM x1nnnn)(SHG)
+i=1 i=1
(SHG) µ= =
i (x max{
2 x3 ) i=1
max{ +i=1 ·µ µ·iiii=1
+
i(x x11))µ+ +
i (x j−1µ µxiiiiii(x
j(x )}2222|S|=
i=1 xx ++ n ··.···· + += max{( µ (x
(x CCj−1
j−1
j−1
j−1
j−1 xxjj)}
(SHG) )} |S|=
|S|=
|S|=
|S|=I jn(SHG)
in(x
n 2
(SHG)
)),
(σ= i=(xmax{()) +
jmax{(+ σσσii(x(x
(x j ))} xj ∈Vσ 1σ , (xx(x j)),)),2. (( (x
x))}.
2
∈V j ∈V
i=1 x n i=1 x j j∈V
n(SHG)
j−1 2
0 2 n =
|S|=
|S|= Imax{ n
(SHG)
2
2j i= (x jmax{( ii=1 j j))} 2 x
jj3∈V j ∈V 111 1σ ,iiix(x
j ∈V )), ( xxxjjj∈V 222 σi (x
i=1
i=1
i=1 i=1
i=1
i=1
i=1 i=1
i=1
i=1
i=1 n 2
i=1
i=1
i=1
xx j∈V
∈V j 2 i=1
i=1
i=1 ∈V
∈V
3
Mn (SHG) = max{ µi (xj−1 xj )}xj−1 xj ∈E .
i=1
5.
Gn (SHG) = ∞.
Proposition 4.16. Let SHG = (G ⊆ P (V ), E ⊆ P (V )) be a
Proposition 4.16: Let SHG = (G ⊆ P (V), E ⊆ P (V)) be a complete-bipartite-neutrosophic SuperHyperGraph. The
698
complete-bipartite-neutrosophic SuperHyperGraph. Then 699
1.
Zn (CM T σ1 ,σ2 ) = On (CM T σ1 ,σ2 ) − max{Σ3i=1 σi (x) + Σ3i=1 σi (x )}x,x ∈V .
2.
3
3

In (SHG) = max{( σi (xj )), ( σi (xj ))}.
i=1 xj ∈V1 i=1 xj ∈V2
3.
3

Cn (SHG) = max{ (σi (xj ) + σi (xj ))}xj ∈V1 , xj ∈V2 .
i=1
4.
3
3
3

Mn (SHG) = max{ µi (x0 x1 )+ µi (x2 x3 )+· · ·+ µi (xj−1 xj )}|S|=min{|V1 |,|V2 |} .
i=1 i=1 i=1
5.
Gn (SHG) = min{Σ3i=1 (σi (x) + σi (y) + σi (z) + σi (w))}x,y∈V1 , z,w∈V2 .
where O(SHG) ≥ 4 and min{|V1 |, |V2 |} ≥ 2. Also,

Gn (SHG) = ∞
ett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
where O(SHG) ≤ 3. 700
Proposition 4.17. Let SHG = (G ⊆ P (V ), E ⊆ P (V )) be a 701
Be a complete-t-partite-neutrosophic
Proposition 4.17:complete-t-partite-neutrosophic SuperHyperGraph.
Then 702
1.
t · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Zn (CM T σ1 ,σ2 ,··· ,σt ) = On (CM T σ1 ,σ2 ,··· ,σt ) − max{Σ3i=1 σi (x)}x∈V .
2.
3
3

In (SHG) = max{( σi (xj )), ( σi (xj )), · · · ,
i=1 xj ∈V1 i=1 xj ∈V2
3

( σi (xj ))}.
i=1 xj ∈Vt
3.
3

Cn (SHG) = max{ (σi (xj1 ) + σi (xj2 ) + · · · + σi (xjt ))}xj1 ∈V1 ,xj2 ∈V2 ,··· , xjt ∈Vt .
i=1
4.
3
3
3

Mn (SHG) = max{ µi (x0 x1 )+ µi (x2 x3 )+· · ·+ µi (xj−1 xj )}|S|=min |Vi |ti=1 } .
i=1 i=1 i=1
5.
Gn (SHG) = min{Σ3i=1 (σi (x) + σi (y) + σi (z))}x∈V1 , y∈V2 , z∈V3 .
where t ≥ 3.
Gn (SHG) = min{Σ3i=1 (σi (x) + σi (y) + σi (z) + σi (w))}x,y∈V1 , z,w∈V2 .
where t ≤ 2. And
Gn (SHG) = ∞
where O(SHG) ≤ 2. 703
Curr Trends Mass Comm , 2023 Volume 2 | Issue 1 | 49

4.1 Setting of Neutrosophic 1-Zero-Forcing Number 704
Definition 4.18. (1-Zero-Forcing Number). 705
Let SHG = (G ⊆ P (V ), E ⊆ P (V )) be a neutrosophic SuperHyperGraph. Then 706
(i) 1-zero-forcing number Z(SHG) for a neutrosophic SuperHyperGraph 707

n ) = 1.
Proposition 4.22. Let SHG = (G ⊆ PZ(P (V ),TEH⊆ n P (V )) be a cycle-neutrosophic
Proposition
SuperHyperGraph Proposition 4.22.
where 4.22. Let
O(CY SHG
Let SHG C) ≥= (G
=3.(G ⊆
Then P
⊆ P (V ), E(V ), E⊆ ⊆PP(V (V))))bebea acycle-neutrosophic
cycle-neutrosophic
Proposition
SuperHyperGraph 4.22.
SuperHyperGraph where O(CY C) ≥ 3. Then where Let SHG
O(CY =C) (G ≥ ⊆
3. PThen (V ), E ⊆ P (V )) be a cycle-neutrosophic
SuperHyperGraph where O(CY C) ≥ 3. Then
Z(CY C n ) = 1.
Z(CY
Z(CY C n )) = = 1.1.
Z(CY C n ) = 1.
Proposition 4.23. Let SHG SHG = (G =⊆(G P (V ),(V E ),⊆EP⊆(VP)) be a star-neutrosophic
Proposition
SuperHyperGraph
Proposition 4.23.
with
4.23. LetLet
center SHGc. Then = (G ⊆⊆ PP(V ), E ⊆ P(V (V))))bebea astar-neutrosophic
star-neutrosophic
Definition 4.18: (1-Zero-Forcing Number). Let SHG = SuperHyperGraph
Proposition(G ⊆ P Proposition
SuperHyperGraph 4.23. with with
Letcenter centerc.=
SHG
4.23: Let c.Then Then
(G SHG ⊆ P=(V(G),⊆ E P⊆(V), P (VE)) ⊆ be P (V)) a star-neutrosophic
be a star-
(V), E ⊆ P (V)) be a neutrosophic SuperHyperGraph. SuperHyperGraph
Then neutrosophic with center c. Then
SuperHyperGraph with center c. Then
Z(STZ(ST R1,σ2R ) 1,σ= 2O(ST ) = O(ST R1,σR21,σ )− 3.
2 ) − 3.
Z(ST R 1,σ2 ) = O(ST R1,σ2 ) − 3.
Z(ST R1,σ⊆2 )P= O(ST R (V2)) ) − 3.a
(i) 1-zero-forcing number Z(SHG) for Proposition a neutrosophic Proposition 4.24. Let 4.24. SHG Let SHG = (G =⊆(G P (V ),(V E ),⊆EP⊆(VP1,σ )) be be a
SuperHyperGraph SHG = (G ⊆ P(V ),E ⊆ P(V )) isProposition
minimum 4.24.
Proposition
complete-bipartite-neutrosophic Let SHG
4.24: = Let
SuperHyperGraph. (G ⊆
SHG
SuperHyperGraph. P (V
= ),
(G E ⊆ ⊆
Then PP
Then(V
(V), ))Ebe⊆a P (V)) be a
Proposition 4.24. Let SHG =
complete-bipartite-neutrosophic (G ⊆ P (V ), E ⊆ PThen
SuperHyperGraph. (V )) be a
cardinality of a set S of black vertices (whereas vertices in V (G) complete-bipartite-neutrosophic
complete-bipartite-neutrosophic SuperHyperGraph. SuperHyperGraph. Then Then
\ S are colored white) such that V (G) is turned black after finitely Z(CMZ(CM T σ1 ,σT2 )σ1= ,σ2 ) = O(CM T σ1 ,σ2 ) − 3.
O(CM T σ1 ,σ2 ) − 3.
Z(CM T σ1 ,σ2 ) = O(CM T σ1 ,σ2 ) − 3.
many applications of “the color-change rule”: a white vertex Proposition is 4.25. LetZ(CM SHG =T (G σ1 ,σ⊆ )P= (VO(CM ), E ⊆ P T(V )) be ) −a 3.
converted to a black vertex if it is the only white Proposition
neighbor of 4.25. Let SHG4.25:
Proposition
complete-t-partite-neutrosophic = (GLet ⊆ PSHG (V2 ), =
SuperHyperGraph. E (G ⊆ P⊆(VPThen ))σ(V),
1 ,σ2
be aE ⊆ P (V)) be a
Proposition 4.25. Let SHG
complete-t-partite-neutrosophic = (G ⊆ P (V ), EThen
SuperHyperGraph. ⊆ P (V )) be a
a black vertex. The last condition is as follows. For one time, complete-t-partite-neutrosophic
Proposition
complete-t-partite-neutrosophic 4.25. Let SHG = (G ⊆ P (V ),
SuperHyperGraph. SuperHyperGraph.
E ⊆ PThen (V )) be a Then
Z(CM T σ1 ,σ2 ,··· ,σt ) = O(CM T σ1 ,σ2 ,··· ,σt ) − 2.
black can change any vertex from white to black. complete-t-partite-neutrosophic SuperHyperGraph. Then
Z(CM T σ1 ,σ2 ,··· ,σt ) = O(CM T σ1 ,σ2 ,··· ,σt ) − 2.
(ii) 1-zero-forcing neutrosophic-number Zn(SHG) for a Z(CM T σ1 ,σ2 ,··· ,σt ) = O(CM T σ1 ,σ2 ,··· ,σt ) − 2.
neutrosophic SuperHyperGraph SHG = (G ⊆ P(V ),E ⊆ 4.2P(V ))Setting Setting of of 1-Zero-Forcing
Z(CM 1-Zero-Forcing
T σMathematics ) =Neutrosophic-Number
1 ,σ2 ,··· ,σt Neutrosophic-Number
O(CM T σ1 ,σ2 ,··· ,σt ) − 2.
Henry Garrett · Independent Researcher · Department of · DrHenryGarrett@gmail.com · Manha
is minimum neutrosophic cardinality of a set S 4.2
of black Setting
vertices
Proposition of 1-Zero-Forcing
Proposition
4.26. Let 4.26:
SHG Let
= (G SHG ⊆ Neutrosophic-Number
P =
(V (G
), E ⊆⊆ PP (V(V),)) be P (V)) be a
E a⊆complete-neutrosophic
Henry Garrett · Independent Henry Garrett
Researcher · Independent
· Department 4.2 of Setting
Researcher
Mathematics of
· 1-Zero-Forcing
Department
· DrHenryGarrett@gmail.com of Mathematics Neutrosophic-Number · DrHenryGarrett@gmail.com
· Manhattan, NY, USA NY, ·M
(whereas vertices
Henry in V (G) \· SIndependent
Garrett are colored white) Researcher such 4.2
Proposition
· SuperHyperGraph.
that (G)
VSetting
Department
4.26. complete-neutrosophic
ofofMathematics
Let SHGThen
1-Zero-Forcing
= (G
⊆ P SuperHyperGraph.
(V ), E Neutrosophic-Number
⊆ P (V )) Then.
be a
· Manhattan,
Henry Garrett · Independent Researcher · Department of Mathematics ·(G DrHenryGarrett@gmail.com · Manhattan, NY, U
Henryis Garrett
turned black · Henry
Henry after
Independent finitely
Garrett
Garrett Henry many
Researcher Garrett
·· Independent
Independent applications
· Independent
· Department
Researcher ofProposition
“the
SuperHyperGraph.
Researcher color- 4.26.
of ·Researcher
·Mathematics
Department
Department Proposition · Department
Then ·of Let
Mathematics
Mathematics
SHGof=Mathematics
ofDrHenryGarrett@gmail.com
4.27. Let(G ·· TSHG
⊆ P (V ), E
= ), ⊆
⊆ P (V )) be3 a NY,
(G·EDrHenryGarrett@gmail.com
3· Manhattan,
P (V ), E ⊆ P
complete-neutrosop
(V·· )) USA
Manhattan,
Manhattan,
be a path-neu · Man NY
NY
change rule”: a white vertex is converted to a blackSuperHyperGraph. Proposition
vertex if it Z
4.26.n (CM Then T
Let σ ) =
SHG O n (CM
= ⊆
σ ) −
P max{Σ
(V ⊆
i=1 σP i (x)
(V +
)) Σbe i=1 i (y)}x,y∈V .
a σcomplete-neutrosop
Henry Garrett · Independent Researcher · Department of Mathematics SuperHyperGraph.
Proposition · (G Then
DrHenryGarrett@gmail.com ·⊆Manhattan, ⊆NY, P (V USA
is the only white neighbor of a black vertex. Proposition The last SuperHyperGraph.
condition
4.27.
Proposition ZnLet (CM SHG T σ) =
4.27. Then
=Let OnSHG ⊆ P 4.27.
(CM (VT=σ),(G )E−⊆
Let
⊆max{ΣPPSHG (V ),
(V ))3E =be⊆(G (VP))(V
aPpath-neutrosophic 3be),aEpath-neutrosophic )) be a path
SuperHyperGraph. Then i=1 σ3i (x) + Σi=1 σ3i (y)}x,y∈V .
is as follows. For one time, black Proposition can SuperHyperGraph.
change any4.27. vertex from Z (CM T ) = O (CM T ) − max{Σ σ (x) + Σ σ (y)} x,y∈V .
ELet be i a path-
Proposition ⊆ P=(V(G ⊆
P 4.27:
Proposition
SuperHyperGraph. Then n4.27. Then Let
σ SHG n = (GSHG σ ), ⊆ EP (V),
P (V E3))⊆), P
be (V))
ai=1 path-neutrosophic
PropositionLet SHG Z Proposition
(CM = (G
4.27. T ⊆ Let
) = (V4.27.
SHG
O ),(CM = ⊆Let
Z(G nP(P
(G
T SHG
(V)⊆ T))
− P H (V n=
be
max{Σ )),),a= (GE i=1
3⊆
min{Σ Pi (V
path-neutrosophic
σ (V
(x) ))+σEbebe
iΣ ⊆
(x)}3a Ppath-neutrosophic
σ (V ))
(y)} be a .path-ne
Proposition 4.27. Let SHG = ⊆ P (V E ⊆ P i=1)) a x is
path-neutrosophic x,y∈V .
a vertex
white to black. SuperHyperGraph.
SuperHyperGraph.
Then
SuperHyperGraph.
n
neutrosophic
SuperHyperGraph.
Then SuperHyperGraph. Then
σ
Then
n
Then
σ i=1 i
3
i=1 i
PropositionSuperHyperGraph. Then 3 ZPn(V (P)) T3 H n) = min{Σ i=1 σi.(x)}x is a vertex .
4.27. Let ZSHG n (P T H =of n(G)Z = n⊆ PT(V
min{Σ
(P H), )E= ⊆imin{Σ
σDrHenryGarrett@gmail.com
(x)} is be ia(x)}
aσvertex path-neutrosophic
.x is a vertex
3(G ⊆ P (V ), E ⊆ P
Henry Garrett · Independent Researcher · Department Proposition 4.28.
Mathematics Let
ni=1 · SHG =x i=1 (V )) be a cycle-neu
Definition 4.19: (Failed 1-Zero-Forcing Number). Let SHG SuperHyperGraph. Then = Z n (P T 3 H n ) = min{Σ i=1 σ i (x)} x is 3 a vertex .
Z (P T H SuperHyperGraph n ) = min{Σ
Proposition Z⊆ (P where
T
4.28.Hσ),nin(x)} Z
)) = O(CY
=⊆ (P
n min{Σ
Let T H
C) 33≥ ) =3.
σ(G min{Σ
Then
.i(x)}
(x)}⊆ σ (x)}
i ⊆ ..P be a. cycle
Proposition 4.28. nLet SHG
Proposition 4.28. =Let (GZ n(P
SHG
n Pi=1 T(V= H (G E ⊆xmin{Σ
PPSHG
is a vertex
(V ),
(V E=
))ni=1
i=1 be⊆ σ ai P Px (Vi=1
is
beaa),
cycle-neutrosophic
(V x)) is aEcycle-neutrosophic
vertex
vertex
x (V is a))vertex
(G ⊆ PHenry (V), EGarrett ⊆ P (V)) be a neutrosophic
· Independent Researcher ·Proposition SuperHyperGraph. Proposition 4.28: ·= Let SHG = (G ⊆ P (V), E ⊆ P (V)) be a cycle-
Department of Mathematics
artment of Mathematics
Department of Mathematics
Henry· Garrett ·· DrHenryGarrett@gmail.com
DrHenryGarrett@gmail.com SuperHyperGraph
Department
·4.28.·· Manhattan,
Manhattan,
Manhattan, where ZnNY, of
(P4.28.
O(CY
Mathematics
SuperHyperGraph
NY,
NY, TUSA H Let
USA
C) )⊆= ≥PSHGmin{Σ
3.
O(CY Then
3 (G where
·≥ ⊆
σPi(CY(x)} O(CY
PThen (V ), aEC) ⊆≥ P .(V3. 3))Then be ·aManhattan,
cycle-neutrosophic NY, USA
Then · Independent Proposition Researcher SuperHyperGraph
· Department
Proposition
Proposition Let SHG Proposition=
4.28.
4.28.
of
neutrosophic(GUSA
whereMathematics
n
Let
Let (V4.28.
SHG
SHG ), E C)
SuperHyperGraph ==⊆
i=1 Let
Z n (V
(G
(G
3.
SHG
⊆⊆Then PPC
)) x be
(V
(V
is
n= )where
),a=
), (Gvertex
E
E min{Σ⊆OP P(CY
cycle-neutrosophic
⊆ (Vi=1
(V ),C)
))
)) σEbe ≥⊆a3.
i (x)}
be a P·cycle-neutrosophic
x(V
Manhattan,
Then is ))
cycle-neutrosophic be a .cycle-n
a vertex
NY,
Henry Garrett · Independent Researcher · Department SuperHyperGraph where
of MathematicsO(CY C) · ≥ 3.
DrHenryGarrett@gmail.com · Manhattan, NY,
SuperHyperGraph
PropositionSuperHyperGraph
where O(CY
SuperHyperGraph
4.28. Let ZSHG
SuperHyperGraph
C) where ≥ 3. Then
=where )Z=n⊆ O(CY
O(CY where C)
C)
3 ≥
≥ O(CY
Z3.
3.
⊆imin{Σ Then
(CY
Then 3C) C ≥ 3.
n) = Then
min{Σ 3
i=1 σi.(x)}x is a vertex .
n (CY C
Proposition n(G P (V
min{Σ
(CY
4.29. C), Let )E=σ SHG Pn(V
(x)} =x)) is
(G be
aσ⊆ ia (x)}
vertex Pcycle-neutrosophic
(V .x ),is Ea vertex
⊆ P (V )) be a star-neut
(i) Failed 1-zero-forcing number Z (SHG) for a neutrosophic
0 ni=1 i=1
SuperHyperGraph where O(CY Z≥n3. (CY 3C n) = min{Σ3i=1 3)σ= i (x)}x is 3a vertex .
nition 4.19. (Failed
SuperHyperGraph 1-Zero-Forcing
SHG = (G ⊆Number).
P (V), Proposition
E ⊆ P (V)) Proposition is maximum Zn (CY C n ) C)
SuperHyperGraph
Proposition = min{Σ 4.29:
Thenwith σin(x)}
Let Z=
center
SHG n (CY =(Vc.CThen .imin{Σ σvertex
i (x)} ⊆be ais star- be a. star-
(Va(G beP ai(V), (VEP beaP a(V))
on 4.19.
nition 4.19. (Failed
(Failed 1-Zero-Forcing
1-Zero-Forcing Number).
Number). Proposition Z (CY 4.29.C ) =
Let min{Σ ⊆=
n3i=1 σ(G (x)}⊆ x⊆ ..P
Z PSHG ))(V a), E x (V a))vertex
721
4.29. Let SHG 4.29. =Let (GSHG
721
⊆n (CY
n P (V
721
i=1 C
=),n(G )
E⊆ ⊆ min{Σ
x
P is vertex
))
), E
i=1 σ
⊆ (x)} i=1
is
Pstar-neutrosophic
x is vertex star-neutrosophic 740
t
SHG SHG
t SHG = (G = (G
(G ⊆
=cardinality
⊆P ⊆(V P
P (V (V
),of ),
E), a⊆E
EsetP⊆
⊆(V PP
S (V(V
of be
)) ))
))blackbe a neutrosophic
aVertices
a neutrosophic
be neutrosophic (whereas SuperHyperGraph.
vertices
SuperHyperGraph.
SuperHyperGraph.
Proposition in VZcenter Then
4.29. Then
neutrosophic
Then
SuperHyperGraph Let SHG SuperHyperGraph
722 722 722
=3i=1 (Gwith ⊆ center
P (V ),withEc.vertexThen
⊆ center
P .(V )) c. Then
be a star-neutrosophic741
SuperHyperGraph SuperHyperGraph with (CY C c.
with )Then= min{Σ
center c. Then σ (x)} ⊆P
(G) \ S are colored white) Zsuch
Proposition 4.29.
that V (G) isn’t Turned Proposition
Proposition
SuperHyperGraph
Let SHG
black
n
Proposition= (G ⊆
4.29.
4.29.
n
withLet Let P (V
center
4.29.
SHG
SHG ), E=
c. =
⊆Let
Then (G
(G
i
P (V SHG
⊆⊆ )) P
x
P (V (V is
be=), a
),a(G P (V
Estar-neutrosophic
E ⊆ (V )) ),
)) Ebe be⊆aa Pstar-neutrosophic
(V )) be a 740
star-neutrosophic star-ne
failed
led
failed 1-zero-forcing
1-zero-forcing
1-zero-forcing numbernumber
number Z (SHG)
Z (SHG) (SHG) forforfor aa neutrosophic
SuperHyperGraph neutrosophic
a neutrosophic with
SuperHyperGraphSuperHyperGraph
SuperHyperGraph
SuperHyperGraph
center SuperHyperGraph
Z c. (ST
Then withR )
center
723 =723 O with
c. (ST
Then center
R c.
) − Then max{Σ 3
σ (c) + Σ 3
σ (x) + Σ3i=1
after finitely many applications of “the color-change rule”: a ofSHG n 1,σ 723 n 1,σ i i
Proposition SuperHyperGraph
4.29. Let = with(G center ⊆ P724
2
(V c. ), E Then ⊆ P (V )) be a star-neutrosophic
2 i=1 i=1 741
740
HG SHG
SHG = (G=
= (G (G
⊆P ⊆
⊆(V P (V
P (V ),
), E), ⊆ E
EP ⊆
⊆(V P (V
)) is
P (V )) is
)) maximum maximum
is maximum cardinality
cardinality
cardinality of
of aofset a
a set set
S of S
S black black
of blackZn (ST724 RR1,σ 3 On (ST R 3 2 ) − max{Σ
3 3
white. Vertex is converted to a black vertex if it is the only white 2 ) )= σ(y)}
i (c) +3Σi=1 σi (x)741+
724
SuperHyperGraph
Z (ST R ) =with O center
(ST R c. Then
) − max{Σ σ (c) + Σ3 1,σ σ (x) + 3 3 i=1
Σ σ .
vertices
vertices (whereas
tices (whereas
(whereas vertices
vertices
vertices in inVin(G)
VV (G) \ S\\are
(G) SS are
are
colored colored
colored nwhite)
white)white) such 1,σ Z
such
such 2that (ST
that
n that R
VnProposition
(G)VV
1,σ (G)
(G) )
2isn’t =1,σ O
isn’t
isn’t 2 n (ST 4.30.
725 725
1,σ2Let
725
−
i=1 SHG max{Σ
i =3i=1 σ (c)
i=1 i⊆i P (V ),i=1
(G + Σ σ
Ei=1⊆i P (x)i (V ))+ Σ
x,y∈Vbe ai
i=1 σ (y)} x,y∈V
neighbor offinitely
a black many Vertex.applications
The last condition is as follows. Zn (ST For R1,σ2 ) = On (ST R31,σ2 ) − max{Σ σi (c) + 3Σ3i=1 3 3 σi (x) + Σi=1
3
3 3 σi (y)}x,y∈V
turned
rned black blackafter after
finitely many applications
turned black after finitely many applicationsProposition of Z of
“the
of “the
(ST R color-change
color-change
n “the color-change ) = O
Znnn(ST(ST
rule”: R
rule”: a Z )
white
2 an=
(ST
rule”: a −white
white max{Σ
O(G R ) = σ O (c) (ST + Σ R 3 i=1
σ 3)(x) −
SuperHyperGraph. max{Σ
+ Σ σ σ
(y)} (c) Then + Σ . σ (x) + Σ3i=
(ST R4.30. E−Let
i2 ))n− max{Σ σ(G (c)⊆+ + Σi=1 σiE (x)⊆+ + Σ σ (y)}
Proposition 3 3 3
Z O 1,σ2726
PSHG 1,σ2i=1 i =σ P)) (V i ),σ P (V )) iσ beii(y)}
a x,y∈
726
one time, Black can change any vertex from white
1,σ2
to black.
4.30.
Proposition The Let R SHG 1,σ
1,σ
4.30.
1,σ 2) =
Proposition
2
2 =Let n(ST
n
726
⊆4.30:
SHG PR
i=1
=Let
1,σ),
(V
1,σ 22(G ⊆
⊆max{Σ
SHG P i=1
(V
(V= (G
))
), i=1Ebe⊆ ⊆iia(c) P (V),
(V i=1 Σ E
i=1
be
i=1 ⊆ aii(x)P
x,y∈V
(V)) Σi=1
be i=1
i=1 a x,y∈
vertex
vertex is converted
is converted
tex is converted to to atoblack
aa black
black vertexvertex
vertex if itififis it the
it is the
is the
only only
only white white
white neighbor
neighbor
neighbor of(ST of4.30.
aof aa black
black black
complete-bipartite-neutrosophic 727 3
⊆ P+ 3 ESuperHyperGraph. ))3i=1 Then.
last condition is as follows. For one time, black can Proposition
Change any Let SHG
Complete-bipartite-neutrosophic
727 727
= (G (VΣ), σ⊆
SuperHyperGraph. P (V beσai (y)}
be⊆aa Then
Z n (ST R4.30.
complete-bipartite-neutrosophic 2) = O
1,σ n R 1,σ 2) − max{Σ
SuperHyperGraph. σP i (c)
SuperHyperGraph. Then (x)
⊆Then P+(V 3Σ 3x,y∈V
(x a)+Σ3i=1 σ
vertex.
tex. The Thelast last condition
condition is asis as follows.
follows.
vertex. The last condition is as follows. For one time, Black For ForProposition
one onetime, time, Black Black Proposition
can can Let
change
Proposition change
can change any SHGZ
Proposition
any
n (CM =
4.30.
any (G
vertex
4.30. T ⊆
vertex
vertex
σ 1 Let
,σ P
Let SHG
2 )(V
728
4.30.
=
SHG ),OE
728 ni=1
=(CM
=⊆ Let (G
(G
SuperHyperGraph.
SHG
T
(V⊆⊆σ)) P
1P,σ(V(Vbe=
2 ),
),a(G
)−max{Σ
i=1 Ei ⊆
E P
Then
(V
i=1)) ),
σiE(x)+Σ
)) be P (V i=1 ))σibe
vertex from white to black;
728
mfrom white
white to toto black.
black.black. The The last
lastlast condition
condition is as complete-bipartite-neutrosophic
is as follows.
follows. ForFor For
one complete-bipartite-neutrosophic
one time, complete-bipartite-neutrosophic
black Z SuperHyperGraph.
n (CMcan T⊆ )= O Then
SuperHyperGraph.
(CM T3)) SuperHyperGraph.
)−max{Σ Then 3
σi)+ΣThen
(x)+Σ 3
σi(x )+Σ
from white
(Ii) failed
The
1-zero-forcing
condition is as Zfollows.
Proposition
n (CM T σ1Z
neutrosophic-number) )time,
one
,σn24.30.
(CM =for
time,
OTnLetblack
σ(CMa
1
black
,σSHG
2 ) =σ1
Proposition Tcan can
O =n2(CM
,σ (G
)−max{Σ σ729
1T Pσ729
,σ
4.31.
2(V
729
1 ,σi=1
3 SuperHyperGraph.
),
2Let EσnSHG
)−max{Σ i⊆(x)+ΣP (V= 3
σ1 ,σ
i=1
i=1 (G be
σσ2i⊆ ia(xP )+Σ
(x)+Σ (V
Then 3 3 i=1
),
i=1 E
i=1 σ⊆ iσ(xi (xP (V )}))x,x 3 i=1
i=1 be ,x ∈V .)}x,x ,x
σai (x
change
ange
change any
anyany vertex
vertex
vertex from from
from white white
white to to to black;
black; black; Zn (CM T σ1 ,σ2 ) = OSuperHyperGraph. n (CM730 T 3σ730 1 ,σ2 )−max{Σ
3
σi (x)+Σ 3
33 σi (x

)+Σ 3
3 3 σi (x )}

Zncomplete-bipartite-neutrosophic Then
730
neutrosophic SuperHyperGraph SHG (CM= (GT σ⊆1 ,σP2 )(V),E =
ZZ O(CM
n (CM
n⊆(CM P(VTT σT1Z σn
,σ (CM
) = )−max{Σ
12Proposition
,σ) 2= O
O Tnσ(CM 1 ,σ2 )T
(CM T =
i=1 O
σ
4.31.
σ ,σin (CM
(x)+Σ
)−max{Σ
)−max{Σ Let T 3 i=1
SHG
i=1
3(x
i2 )−max{Σ
σ1SuperHyperGraph.
σ
,σ3i=1 = σ
σ )+Σ
(G
i (x)+Σ
(x)+Σ
3 i=1
⊆
i=1 P σ3(V
i=1 i (x σ),
σσ
(x)+Σ
iiE )}
(x
(xThen i=1
⊆
x,x )+Σ
)+Σ P 3∈V
(V
,xi=1 σσ
)) .i (x
σ be
i (x
(x )+Σ x,x3 ,x
a)}
)}x,xi=
x,x
Proposition 4.31.
Proposition
n Let σ 1 SHG
,σ 4.31. = Let
n (G ⊆
SHG P (V
σ 1
= ,σ ),(G
2 E ⊆
⊆ PP (V
(V ))
),i=1 E be ⊆ i a P (V )) i=1
i=1 be a
i i=1
i=1 i
)) is maximum neutrosophic Cardinality of a(SHG)
setProposition
S of black
1 2
2 1
1 2
2

failed
led
failed 1-zero-forcing
1-zero-forcing
1-zero-forcing neutrosophic-number
neutrosophic-number
neutrosophic-number Z Znn(SHG)
(SHG)
Z for for
fora aa neutrosophic
neutrosophic
neutrosophic complete-t-partite-neutrosophic
4.31. Let SHG
731 731 731 3
= (G ⊆ P (V 3), ESuperHyperGraph.
⊆ P (V )) 3 be a Then
Zcomplete-t-partite-neutrosophic
n
n (CM T σ14.31. ,σ2 ) = Let On (CM
complete-t-partite-neutrosophic T(CM )−max{Σ
2SuperHyperGraph. σiP(x)+Σ
SuperHyperGraph. Then σi (x⊆)+Σ Then σmax{Σ
i (x⊆aaPP)} 3 ,x ∈V . 3
vertices (whereas
SuperHyperGraph
perHyperGraph
SuperHyperGraph SHG SHG
SHG = (G=vertices
= (G(G
⊆P ⊆(V
⊆ in
PP(V VE
(V
), (G)
),⊆
), E \P⊆S(V
⊆ are
EProposition
PP(V(Vcolored
)) )) maximum
is
)) White)
is maximum
is maximumProposition
Proposition such SHG
neutrosophic
neutrosophic
neutrosophic
ZProposition
Proposition=σ1 ,σ
4.31.
n4.31. (G T⊆ σ1P
Let
Let ,σ 4.31:
(V4.31.
SHG
2 ,···
SHG
732 ),,σE
732
732 t Let
i=1 )=⊆
= Let
= (G
(G
SuperHyperGraph. SHG
O(VSHG
⊆n (CM
⊆ PP=(V
)) (V =
i=1
be (G ),a(G
T), σEE1⊆,σ⊆ 2P
P(V),
,···
P
Then
(Vti=1
,σ
(V ),EEbe
))−
))) be⊆ (V))
(V x,x ))be
i=1 σbe i (x)aa + Σi=1
cardinality
rdinality
cardinality that ofVset
of aof aa(G)S isn’t
set
set of ofturned
SS black
of black
black black
vertices
vertices
vertices after
(whereas finitely
(whereas Zmany
vertices
vertices applications
(whereas vertices in in Vin VV ,···
(G) (G) \of
\,σSLet \)are
SS=
(G) are
are Complete-t-partite-neutrosophic
coloredSuperHyperGraph.
Zcolored
n (CM
colored T ⊆ T Then
)max{Σ
),tSuperHyperGraph. = On)) 3SuperHyperGraph.
SuperHyperGraph.
(CM aiT(x) σ1Then 3 3,σt )σ− Then
Then
max{Σ

3
3 i=1.σi(x) +
Proposition 4.31. σ1SHG O = (G P21(CM(V )E −σt⊆ P (V ) be
733
n (CM T σ1Z (CM −σmax{Σ +2 ,···
Σ i (x+ )}Σx,x
733σ733 ,σ2 ,··· ,σ ,σ
,σn2(CM tT ,σ 2n ,··· ,σ t ) =σ1 O,σn ,··· ,σ T 1 ,σ2 ,··· ,σti=1 i=1 σi (x) i=1∈V σi (x )}x,x ∈
white)
ite)
white)such “the
such
such that color-change
that
thatV (G)VV (G)
(G)isn’t rule”:
isn’t
turned
isn’t turned
turned a black
whiteblack
black vertex
after after
after is
finitelyconverted
finitely
finitely many many
many
complete-t-partite-neutrosophic to a black
applications
Zn (CM T4.3
applications
applications σ1 ,σ2 ,···Setting
of of
“the
of “the
“the of
t ) = On (CM T σ1 ,σ2Then
,σSuperHyperGraph.734 734
734 Neutrosophic ,··· ,σt ) − max{Σ Failed
i=1
3
σ i 1-Zero-Forcing
(x) + Σ 3
3 σ (x )} N
3∈
Z Z n2 (CM T2= )T =σ1O 3(CM T− 3 i=1
i −σ
3) (x max{Σ i=1
.3i=1σiiσ (x) (x+ x,x
)}Σ
color-change
or-change
color-change vertex
rule”: if ita is
rule”:
rule”: aathe
white only
white
white white
vertex
vertex
vertex neighbor
is converted
is converted
is converted ofntoa(CMblack aaTblack
atoblack
to σvertex.
1 ,σ
black 2 ,···
vertex ZZThe
,σ
vertex
vertex n
)if=
(CM
nt (CM itififOis
last T
it (CM
Titnσσthe
is
is
11 ,σ
4.3
,σ
1 2 the
the
2 onlyTonly
,···
,··· σ 1t,σ
only
,σ
,σ )) =σ,···
735
O
1 ,σ
O n )−
(CM
t,···
,σ2735 (CM
ttSetting of Neutrosophic
n
735
,σtmax{Σ T σ 1 2
1
,σ
,σ
n2i=1
2
,···
,···
σit(x)
,σ
,σ tt )) −σ1+ ,σ2Σ
max{Σ
max{Σ ,···
i=1,σσ t3
i=1
Failed
i=1
σ )}
i
i (x)
(x) x,x+ + ∈VΣ
Σi=1
1-Zero-Forcin
3 σ
i=1 ii(x )} x,x x,xi=
condition ais as follows. ForThe one time, 4.3Black isSetting

can 4.3 of
Setting Neutrosophic
Proposition oftime, Neutrosophic
4.32. Failed Let SHG 1-Zero-Forcing
Failed
=3(G ⊆1-Zero-Forcing P (V ), 3E ⊆ Number P (V )) beNumber a complete
σchange any + Σi=1 σi (x )}x,x ∈V
742
white
ite
white neighbor
neighbor
neighbor of aofofblack
a black
black vertex.
vertex.
vertex. The The last
lastlast condition
condition
condition
Z n (CM isTas
as
is as follows.
follows.
follows. ,σFor For
For
t ) = On (CM
oneone one time, time, T σ1 ,σ 736 ,···736
,σt ) − max{Σ i=1 σi (x) .
vertex from white tofrom
black. The lasttotocondition islast
4.3
aslast
1 ,σ2 ,··· Setting
follows. For SuperHyperGraph. of Neutrosophic 2
736
Then Failed 1-Zero-Forcing Number
ackBlack
Black can
cancan change
change
change anyanyanyvertexvertex
vertex from
from white white
white to 4.3
black.black.
black. Setting
The
Proposition The
The last 4.3of
condition
4.3 Neutrosophic
condition
condition
4.32.
Proposition Setting
Let
Setting is 4.3asis
SHG Proposition
is4.32.follows.
as of
as follows.
ofSetting
follows.
=Let (G Failed
Neutrosophic
⊆
737 P
Neutrosophic
SHG 737
737 (Vof
4.32.
=),(G Neutrosophic
E Let
1-Zero-Forcing
⊆P
⊆ PSHG (V
(VFailed
Failed))E=
), be⊆(G ⊆ Failed
P))
aP1-Zero-Forcing (Vbe),aE1-Zero-Forcing
Number
1-Zero-Forcing
(V ⊆ P (V ))Number
complete-neutrosoph be 742
Number a com
For
rFor one
oneonetime,one
time,
time, time,
blackblack
black black
can can
can can
change change
change
change anyany any any
vertex vertex
vertex
vertex from from
from
from white white
white
white
SuperHyperGraph. to to
to black.
black.
to black.
Proposition
black. Setting
SuperHyperGraph.
4.32. of
Let Neutrosophic
SHG = (G Then ⊆ Failed
P (V ), 1-Zero-Forcing
E ⊆ P (V )) be Number
a complete-neutrosoph
LetThen
SuperHyperGraph. Then 738
4.3
Proposition Setting 4.32.Propositionof Neutrosophic
SHG Proposition= (G
4.32. ⊆ Let
738
P (V 4.32.
SHG Failed
738
), E=⊆ Let (GP (V 1-Zero-Forcing
SHG
⊆Z)) P=

be=),
(CM
(V ),a(G E ⊆) = P (V (V
O(CM
Tcomplete-neutrosophic ),
))EENumber
be ⊆T Pcomplete-neutroso
)(V − )) 3. be a comple
Proposition 4.32: = Let(G ⊆ aaPσcomplete-neutrosop
(V)) be a
742
Proposition
SuperHyperGraph. 4.32. Then Let SHG SHG ⊆ P (V (G E ⊆σ⊆PP(V), )) be
osition
ition
osition 4.20. 4.20.
4.20. Let Let
SHG
Let SHG
SHG = =
(G
= (G
(G⊆ P⊆
⊆ (VP P (V
),
(V E ),
), ⊆EE SuperHyperGraph.
P
⊆⊆ (VP P (V
))
(V ))
be
)) abe
be a Then
SuperHyperGraph.
a complete-neutrosophic SuperHyperGraph. Then Then Z
(CM T ) = O(CM T ) − 3.
Proposition 4.20: Let SHG = (G ⊆ Proposition P (V), E ⊆ PSuperHyperGraph. (V)) beLet
4.32. aProposition
SHG complete-neutrosophic
Z=(CM Then
(G ⊆ T σP)Z
4.33. (V
=(CM ),
O(CM
Let E SHG SuperHyperGraph.
⊆
T σPT ) (V =σ= ))
−(G
) O(CM be⊆a P
3. (V) Then
Tcomplete-neutrosophic
σ
σ − 3.
), E ⊆ P (V )) be a path-neu
σ
HyperGraph.
perGraph.
HyperGraph. Then Then
Then
complete-neutrosophic SuperHyperGraph. Then
SuperHyperGraph. Then Z (CM T σ ) = O(CM
T σ ) − 3.
SuperHyperGraph.
ZProposition
(CM T σ ) = O(CM ZThen (CM T σT ) σσ− Z3.
=(CM O(CM T σT T)⊆σσ=)P) O(CM
− 3.), E T⊆σ P )− (V3.)) be a path
Proposition 4.33. =Let (GSHG ⊆ P 4.33. Z
(V =(CM ),(G ELet ⊆TP
⊆ PSHG))(V
(V = ))
), E=
O(CM be⊆ (G (V ))−
aPpath-neutrosophic
(Vbe 3. a path-neutrosophic
Z(CM Z(CM
Z(CM T σT)Tσ= σ)) O(CM
= O(CM
= O(CM − −− 2.
T σT)TSuperHyperGraph.
σ))2. 2. SuperHyperGraph.
Proposition SuperHyperGraph.
4.33. Let SHG = (G Then ⊆TPσ=(V ),3. EP Z (P
⊆(V), T H
P (VE))n⊆be ) = 0.
a path-neutrosophic
σ
LetThen Proposition
Proposition=Z (G (CM
Then T 4.33:) = O(CM
σ4.33. Let Let SHG SHG ) (G
−be=), ⊆a(G ⊆ P (V ), P
Ebe (V))
⊆ be a path-
Ppath-neutrosophic
(V
Proposition 4.33.Proposition
Proposition
SuperHyperGraph.
SHG 4.33.
4.33. Then
⊆ Let
Let P (V
), E=
SHG
SHG =⊆ (G
(G P (V ⊆⊆ )) PP (V (V ), Epath-neutrosophic
E ⊆ Z P (V
(P ))H
))
T be )aa= 0. )) be a path-ne
path-neutrosophic
osition
ition
osition 4.21.Proposition
4.21.
4.21. LetLetLet
SHG 4.21:
SHG
SHG = (G =Let
= (G(G
⊆PSHG ⊆(V
⊆ =
PP(V (G
(VE),
), ⊆
),⊆E P (V),
ESuperHyperGraph.
P
⊆⊆(V PP(V E
(V be
)) ⊆
)) be
)) P (V)) be a path- Proposition
Then SuperHyperGraph.
SuperHyperGraph.
abepath-neutrosophic
aa path-neutrosophic
path-neutrosophic neutrosophic Then
Z SuperHyperGraph.
(P
4.34. T H Let
Then
n ) Z =
SHG 0.
(P T = H (G
n Then) =⊆ 0.P (V ), E ⊆ n
P (V )) be a cycle-neu
Proposition SuperHyperGraph.
4.33. Let SHG =Then (G ⊆ P (V ), E Z ⊆(P P (VT C)H))n≥ )be=3. a0. path-neutrosophic
neutrosophic SuperHyperGraph. Then SuperHyperGraph where O(CY Z
HyperGraph.
perGraph.
HyperGraph. Then Then
Then Proposition
SuperHyperGraph. 4.34.Then
Proposition Let SHG Proposition
4.34. =Z Let (G (PSHG⊆TH P 4.34.
(V=
n )= ),(G E 0.Let Z
⊆
⊆ZP
P(PSHG(VT),
(V HE
)) n
n
=be)⊆ (G
= aP(P 0. ⊆ T H n )),=E0.⊆ P (V )) be a cycle
(VP))(V
cycle-neutrosophic
be a cycle-neutrosophic
Z(P Z(P
Z(P T HTTnH H
) n=n)) 1.== 1. 1.SuperHyperGraph Proposition
SuperHyperGraph where O(CY SuperHyperGraph
4.34. whereC)Let ≥ SHG
3.
O(CY = C) (Gwhere
≥ ⊆3. P O(CY
(V ), E C) ⊆ ≥ P 3.
(V )) be a cycle-neutrosophic
Proposition Z (P
P 4.34: T H
), ELet ) =
SHG 0.
⊆ ⊆a Pbe (Va )) cycle-
3.⊆=P(G Pcycle-neutrosophic
(V), PE(V
Proposition 4.34. PropositionLet SHG Proposition= (G ⊆
4.34. Let (V4.34.
SHG =⊆
n Let (GP (V SHG )) (V be=⊆ ),a(G ZE ⊆P
(CY C
(V⊆ n), )P=
)) Ebe (V))0. cycle-neutrosophic be a cycle-n
SuperHyperGraph where O(CY C) ≥
osition
ition
osition 4.22.Proposition
4.22.
4.22. LetLetLet
SHG 4.22:
SHG
SHG = (G =Let(G
= ⊆SHG
(G P⊆(V
⊆ PP=(V),(G
(V E),),⊆
⊆E PP⊆⊆(V),
ESuperHyperGraph
(VP P E
(V
))
(V ⊆))
be
)) Pabe
be
Proposition 4.34. Let(V))
a be a
where
cycle-neutrosophic
a cycle-
cycle-neutrosophic
cycle-neutrosophic
SuperHyperGraph O(CY neutrosophic
SuperHyperGraph
SHG = (G Z
C) where ≥ 3. O(CY
⊆ SuperHyperGraph
P (V C
where
), C) E) Z ≥ O(CY

⊆ (CY3.
P (V=C ))(Gwhere
C)
be=
≥ 3.O Z (CY

(CY C) C ≥ ) 3.= 0.
(CY = 0. ⊆a0. Pcycle-neutrosophic
n
Proposition 4.35. Let n SHG n) (V ), E ⊆ P (V )) be a star-neut
HyperGraph
perGraph
HyperGraph neutrosophic
wherewhere
where O(CY O(CY
O(CYSuperHyperGraph
C)C) C)
≥ 3. ≥≥ Then
3. Then
3. ThenwhereSuperHyperGraphO (CY C) ≥ 3. Thenwhere O(CY C) ≥ 3. Z (CY C n ) = 0.
SuperHyperGraph
Proposition Z (CY Cwith n ) = center 0. Z ZP
(CY c. Then Cnn= ))⊆ Z = (CY
0. ⊆ C n ) = 0.⊆ P (V )) be a star-
Proposition 4.35. =Let (GSHG ⊆ P 4.35. (V=),(G ELet ⊆
⊆ P(CYSHG(V ),
(V C
)) Ebe (G
= aP0. (VP))(Vbe),aEstar-neutrosophic
star-neutrosophic
Z(CY Z(CY
Z(CY C nC C
) n=n)) 1.
== 1. 1.SuperHyperGraph Proposition
SuperHyperGraph with center SuperHyperGraph
4.35. c.Let Then Z
SHG (CY =C nThen(Gwith
)= ⊆0.center
P (V ), E c. ⊆ Then P (V )) be a star-neutrosophic
Proposition 4.35.PropositionLet SHG Proposition= with
4.35. (G ⊆centerP (V 4.35.),c.E ⊆Let P (V Z ))
SHG
⊆ (ST be=R ),a(G ⊆) = P
P (V
Estar-neutrosophic
2⊆ O(ST )) EbeR⊆1,σ
), a Pstar-neutrosophic
(V )) be a star-ne
2 ) − 4.
SuperHyperGraph withLet center SHG c. = Then (G P (V 1,σ (V
osition
ition
osition 4.23.Curr
4.23.
4.23. LetTrends
Let
SHG
Let SHG
SHG Mass
= (G ==Comm
(G
(G⊆P ⊆(V
⊆ PP, 2023
(VE),
),
(V ),⊆EESuperHyperGraph
P
⊆⊆(V P P (V
))
(V ))
be
)) abe
be a with center
star-neutrosophic
star-neutrosophic
a star-neutrosophic
c. Then with center with
c. Then center Z c. (STThen R Volume ) = 2
O(ST | Issue R 1 | 250 ) − 4.
Proposition Z (ST = (G R1,σ ⊆ P) (V
Z
4.36. =(ST ),
O(ST E
R1,σ ⊆R P (V
2 )1,σ == ))
) (G
2O(ST −be4. ⊆aRPstar-neutrosophic
1,σ2 ) − 4.
(V2 ), E ⊆ P (V )) be a
1,σ
Let SHG
2 1,σ
HyperGraph
perGraph
HyperGraph with with
with centercenter
center c. Then
c. Then
c. Then SuperHyperGraph with complete-bipartite-neutrosophic center c.R Then Z (ST R1,σ2 ) = O(ST R1,σ2 ) − 4.
Z (ST 2 ) = O(ST
(STRR
Z4.36. )Z )− (ST R1,σ
SuperHyperGraph.
4.O(ST 2) =P2 )O(ST 4. R 1,σ ) − 4.
Then
Proposition Proposition
4.36. =1,σ
Let (G ⊆ PZ
SHG (V=(ST ),(G ER1,σ Let
⊆
⊆1,σ
1,σ 22
PP
2
SHG
2 )(V(V =
= ))O(ST
), E= be⊆ (G aP R
R ⊆
1,σ
(V
1,σ 2
2
)−
))(V
−),4.
be aE ⊆ P2 (V )) be a
Z(ST Z(ST
Z(ST R1,σ R21,σ
R )=
1,σ = O(ST
)O(ST
22) = O(ST1,σ
RR 1,σ )3.− 3. complete-bipartite-neutrosophic
Rcomplete-bipartite-neutrosophic
)− 22) − 3. Proposition 4.36. complete-bipartite-neutrosophic
Z=(ST LetR1,σ SHG ) ), =E = O(ST (G ⊆R P (V)),−E4.SuperHyperGraph.
⊆ PThen (V )) be a Then
(GSuperHyperGraph. Then
21,σ SuperHyperGraph. ,σ2⊆ )) Ebe⊆
Proposition 24.36. Let SHG 1,σ be=T),σa(G P
Proposition 4.36.PropositionLet SHG
complete-bipartite-neutrosophic 4.36. ⊆ Let P (V SHG =⊆ (GPZ(V
SuperHyperGraph. ⊆(CM ))
P2(V 1E ⊆)Then
=P (V O(CM
(V ), TaσP1 ,σ (V2 )))−be 4. a
complete-bipartite-neutrosophic complete-bipartite-neutrosophiccomplete-bipartite-neutrosophic
SuperHyperGraph. SuperHyperGraph. Then Then
erHyperGraph. Then Z (P
T H n ) = 0. SuperHyperGraph. Then
Z
Z (P
(P T
THH nn )) =
= 0.
0. Definition 4.44. Let SHG = (G ⊆ P (V ), E ⊆ P (V )) be a neutrosophic
position 4.34. Let SHG = (G ⊆ P (V ), E ⊆ P (V )) be a cycle-neutrosophic SuperHyperGraph. Thenglobal-offensive alliance if
(i) a set S is called
oposition
oposition 4.34.
4.34. Let
Let SHG
SHG =
= (G
(G ⊆
⊆ P
P (V
(V ),
), E
E ⊆
⊆ P
P (V
(V ))
)) be
be a
a cycle-neutrosophic
cycle-neutrosophic
rHyperGraph where O(CY C) ≥ 3. (i) a set S is called global-offensive alliance if
erHyperGraph where O(CY
erHyperGraph where O(CY C) C) ≥
≥ 3.3. ∀a ∈ V \ S, |N s (a) ∩ S| > |Ns (a) ∩ (V \ S)|;
Z (CY C n ) = 0. ∀a ∈ V \ S, |Ns (a) ∩ S| > |Ns (a) ∩ (V \ S)|;

Z (CY
Z (CY CC nn )) =
= 0.
0. (ii) ∀S ⊆ S, S is global offensive alliance but S isn’t global offensive alli
positionProposition SHGLet
4.35. Let 4.35: SHG
= (G ⊆= (G ),⊆EP ⊆
P (V (V), E⊆
P (V )) Pbe(V)) (ii) alliance;
be a star- ∀SS ⊆
a star-neutrosophic is S,
called
S is minimal-global-offensive
global offensive alliance but Salliance;

isn’t global offensive alliance
oposition
oposition 4.35.
4.35. Let
neutrosophic
Let SHG
SHG =
= (G
SuperHyperGraph
(G ⊆
⊆ P
P (V
(V ),
with
), E
E ⊆ P
center
⊆ P (V
c.
(V )) be
Then
)) be a
a star-neutrosophic
(iii)
star-neutrosophic
S is Minimal-global-offensive-alliance
called minimal-global-offensive number
alliance; of SHG is is
rHyperGraph with center c. Then (iii) minimal-global-offensive-alliance number of SHG
erHyperGraph
erHyperGraph with
with center
center c. c. Then
Then
(iii) minimal-global-offensive-alliance number of SHG is
Z (ST
R1,σ2 ) = O(ST R1,σ2 ) − 4. |S|
Z (ST
Z (ST RR1,σ ) = O(ST R1,σ2 )) −
1,σ2 ) = O(ST R1,σ
− 4.
4.
2 2 |S|
S is a minimal-global-offensive alliance.
positionProposition 4.36: Let
4.36. Let SHG = (G ⊆ P=(V(G
SHG ), E⊆ ⊆P P(V), ⊆ aPa (V)) be a and it’s denoted by Γ;
(V ))E be S is a minimal-global-offensive alliance.
oposition
oposition 4.36.
4.36. Let
Let SHG
SHG = = (G ⊆
(G ⊆P P (V
(V ), E⊆
), E ⊆P P (V
(V ))
)) be
be a
plete-bipartite-neutrosophic
plete-bipartite-neutrosophic SuperHyperGraph.
SuperHyperGraph. Then Then
plete-bipartite-neutrosophic SuperHyperGraph.
SuperHyperGraph. Then Then and it’s denoted by Γ;
(iv)(iv)

Minimal-global-offensive-alliance-neutrosophic number
minimal-global-offensive-alliance-neutrosophic of of SH
number
Z (CM
T σ1 ,σ2 ) = O(CM T σ1 ,σ2 ) − 4. (iv) SHG is
minimal-global-offensive-alliance-neutrosophic
number of SHG is
Z (CM
Z (CM T
T σσ1 ,σ ) = O(CM T σ1 ,σ
,σ2 ) = O(CM T σ
) − 4.
,σ2 ) − 4. 3
1 2 1 2 Σs∈S Σi=1 σi (s)
position 4.37. Let SHG = (G ⊆ P (V ), E ⊆ P (V )) be a Σs∈S Σ3i=1 σi (s)
oposition
oposition Proposition
4.37. Let
4.37. SHGLet
Let 4.37:
SHG = (G
= (G SHG ⊆P
⊆ P=(V (V(G), ), ⊆ E⊆
E ⊆PP (V),
P (V E
(V )) ⊆
)) be Pa
be a (V)) be a S is a minimal-global-offensive alliance.
plete-t-partite-neutrosophic SuperHyperGraph. Then S is a minimal-global-offensive alliance.
plete-t-partite-neutrosophic
plete-t-partite-neutrosophic SuperHyperGraph.
SuperHyperGraph. SuperHyperGraph. Then
Then Then and it’s denoted by Γs .
Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan,and NY,it’sUSA denoted by Γs .
Z (CM T σ1 ,σ2 ,··· ,σt ) = O(CM T σ1 ,σ2 ,··· ,σt ) − 3.
Department of Mathematics Z (CM
Z (CM T T σσ1 ,σ ·
2
,··· ,σ t
)
) =
= O(CM
O(CM T
T σ 1 ,σ 2 ,··· ,σ t
)
) −
−· Manhattan,
3.
3. NY, USA
Department of Mathematics1·,σDrHenryGarrett@gmail.com 2 ,··· ,σt σ1 ,σ2 ,··· ,σ·t Manhattan, NY, USA
Proposition 4.45: Let SHG = (G ⊆ P (V), E ⊆ P (V)) Be a
dent Researcher
Setting Settingof ·Failed Department
of Failed 1-Zero-Forcing of Mathematics
1-Zero-Forcing · DrHenryGarrett@gmail.com
Neutrosophic-Number
Neutrosophic-Number · Manhattan,
strong neutrosophic NY, USA
743 SuperHyperGraph. If S is global-offensive
Setting Proposition of Failed 4.38: 1-Zero-Forcing
Let SHGHenry= Garrett (G ⊆ P Neutrosophic-Number
(V),
· Independent E ⊆ P (V))
Researcher be a alliance, then
· Department of ∀v ∈
Mathematics
743 V \ S, ∃x· ∈ S such that
DrHenryGarrett@gmail.com · Manhattan, NY
Setting
osition
Department 4.38. ofof Failed
Let
Mathematics SHG 1-Zero-Forcing ⊆ P (V
=· DrHenryGarrett@gmail.com
(G· DrHenryGarrett@gmail.com ), E ⊆ Neutrosophic-Number
P (VNY, )) beUSA ··aManhattan,
Manhattan, NY,
743
USA
743
ematics
rcher · complete-neutrosophic
· Department of Mathematics SuperHyperGraph. · Manhattan, Then NY, USA
oposition
HyperGraph.
Department 4.38. ofThen Let SHG = ·of
Mathematics (G ⊆ P (V ),1-Zero-Forcing
DrHenryGarrett@gmail.com E ⊆ P (V )) be a complete-neutrosophic · Manhattan,
oposition
·· Department
Department 4.38.4.4 of Let
of
Setting
SHG =
Mathematics
Mathematics (G·· ⊆
Failed
P (V ), E ⊆ P (V )) be a complete-neutrosophic
Neutrosophic-Number
·· Manhattan,
Manhattan, (i) NY,VNY,
NY,
USA
∈ Ns(x);
USA
USA
743
erHyperGraph. Then Z (CM T ) =

Henry O Henry(CM
Garrett T
Garrett
· )−
Independent · Independent Researcher Researcher · ·
Department Department of of
MathematicsMathematics · DrHenryGarrett@gmail.com
· DrHenryGarrett@gmail.com · Manh
· Manhattan
), E ⊆ P (V )) be a (ii) Vx ∈ E.
erHyperGraph. Then n σ n σ
4.4 Setting Proposition of Failed Z4.38.

1-Zero-Forcing
(CM Let T SHG
) = O = (CM (G ⊆TP (V
Neutrosophic-Number
)− complete-neutrosophic
Setting
led 1-Zero-Forcing of Failed
min{Σ 3 1-Zero-Forcing
n
ZNeutrosophic-Number
(CM 3
T i=1σ) =
σ
σ σiO n (CM
n
n Neutrosophic-Number
3T σ )− σ
σ
743 743
i=1 σ (x) n +Then

·ΣIndependent (y) +Σ σi (z)}·x,y,z∈V .
743
SuperHyperGraph.
Henry in
Garrett Researcher
i=1 Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Proposition
position 4.38. 4.38.
min{Σ
Let Let
SHG 33 3SHG
= σ (G =⊆
(x) (G + P⊆3Σ (V
3
P
3 (Vσ), (y)
), E E
Z ⊆ ⊆+
(CM
P P(V
3(VΣ 3
3))
T
))Henry
bebe
)σ =aa(z)}complete-neutrosophic
O
Garrett (CM · .
Independent
complete-neutrosophic T )− Definition
Researcher · Department 4.46: Let SHG of Mathematics (V), E ⊆ P (V)) be a strong
= (G ⊆ ·PDrHenryGarrett@gmail.com · Manhattan, NY
SHG
osition = (G ⊆ P
4.39. LetThen min{Σ
(V ), E ⊆i=1
i=1 σP i (x)
(Vi ))+be
i Σ a i=1σ (y) i +
i
i=1 i
SHG = (G ⊆ P (V ), E ⊆ P (V )) be a path-neutrosophic n Σ σ
i=1
i=1 σ
i (z)} i
i x,y,z∈V x,y,z∈V
nx,y,z∈V . σ
SuperHyperGraph. i=1 i=1 i=1 Proposition Proposition 4.45. 4.45. Let SHG Let SHG = (G = ⊆ (GP (V⊆),PE(V⊆),PE(V⊆))Pbe (V a))strong
be a strong
neutron
rHyperGraph. PropositionThen 4.39: Let SHG = 3 ⊆ P (V), E3 ⊆ P (V)) be3a path-
(G neutrosophic SuperHyperGraph. Suppose S is a set of vertices.
oposition
HyperGraph.
oposition 4.39.
4.39. Then Let
Let SHG
SHG = Z= (G (G
(CM min{Σ
⊆ ⊆TPσ(V P
) i=1
=(V), OEσ),ni(CM
(x)
E
⊆ P⊆+T(V PΣ
σ )−(V
)) beσi (y)
)) abe + path-neutrosophic
a Σi=1 σi (z)}SuperHyperGraph.
path-neutrosophic x,y,z∈V .
SuperHyperGraph. If S is Ifglobal-offensive
S is global-offensive alliance, alliance,
then then
∀v ∈ V∀v\ ∈S,V ∃x\ S,
∈ S∃
σ )− Proposition 4.45. Then
i=1
neutrosophic SuperHyperGraph. T σ ) 3= OnThen.
n
Zn (CM T σ ) Then = On (CM Z3n (CM T σ )−Z (CM T Let SHG = (G ⊆ P (V ), E ⊆ P (V )) be a strong neutrosophic
erHyperGraph.
erHyperGraph. Then
Proposition min{Σi=14.39. σi (x) +nLet Σ(P T
SHGσH n )+
i (y) ==Σ 0.
3
i=1⊆ σi (z)} ), E ⊆. P (V )) be aIf (i)
Proposition 4.45. Let SHG = (G ⊆ P (V ), E ⊆ P (V )) be a strong 751
neutrosoph
i=1 3(G P (Vx,y,z∈V path-neutrosophic
S isv ∈ (i) Nvs (x);∈ Ns (x); alliance, then ∀v ∈ Valliance, \ S, ∃xthen ∈ S∀vsuch
3min{Σ3 σi (x)
Σ3i=1 σi (x) + ΣSuperHyperGraph. σi (y)i=1 + Σ3i=1 σ+i (z)} Σ3i=1
Z σ
Z (P (PTi (y)
HT H +.
) n =Σ) =
0.
i=1 σi (z)}SuperHyperGraph.
0. x,y,z∈V .
global-offensive
SuperHyperGraph. If S is global-offensive ∈ V \thatS, ∃x ∈752 S suc
(i) is called dominating set if such that either
x,y,z∈V
Proposition
osition i=1
4.40.4.39. Let Let SHG SHG == (G(G Then
n n
⊆⊆nPP(V (V ), n
), E n
E ⊆⊆PP(V(V )) )) be be a path-neutrosophic
a cycle-neutrosophic S (ii) vx ∈ E.
∀v ∈ V \ S, ∃s ∈ S
∈0.Ns (x); (ii) vx ∈(i) E.v Ns (x);
position
SHG
oposition
oposition = (G
HyperGraph 4.39.
SuperHyperGraph. P Let
Proposition
⊆ where
4.40.
4.40. (VLet
Let SHG
),Then
E ⊆ P=Let
4.40:
SHG
SHG
O(CY (V
=C)(G
=(G))SHG
≥ ⊆be
(G ⊆3.P⊆ aP(V
=
),(V
P(G ),E⊆ ),⊆PE
path-neutrosophic
(V
Then E ⊆P(V),P(VZ
⊆ (V E(P
P))
n (Vbebe
))⊆ T)) a(i)
PaH(V))be ) av=be
path-neutrosophic a cycle- v ∈ Ns(s) or vs ∈ E;
cycle-neutrosophic
ncycle-neutrosophic 753
rHyperGraph. Then Z (P T H ) = 0.
neutrosophic SuperHyperGraph where ),≥E3.vx ⊆Then a (ii) |S| is called4.46. chromatic number if(V⊆ ∀v ∈(V⊆ V,),P∃s ∈))PSbe such that
∈
whereO(CY C)≥≥3. O⊆ (CY C)(ii) (ii) vx E.
erHyperGraph where C) n
erHyperGraph Proposition O(CY 4.40.
n
Let 3.Then
TH
Then
SHG = (G P (V ∈ (V
P E.)) be Definition Definition
cycle-neutrosophic 4.46.
Let SHG Let SHG = (G = ⊆ (GP ),PE E(V⊆ (V a))strong
be a strong 754 ne
neutroso
Proposition Zn SuperHyperGraph
(P4.40. T H nLet ) =SHG 0. =Zwhere nZ
(G (Pn⊆ (CYP (V nC ) nE
),
O(CY C) ≥ 3. Then
=) ⊆ 0.
= P 0 (V )) be a cycle-neutrosophic either
SuperHyperGraph. v ∈ Ns(s)
SuperHyperGraph.
Definition or vs
4.46. ∈
SupposeLet E implies
Suppose
S
SHG is = aS s
set
(G and
is⊆ a
ofP v
set have
of
vertices.
(V ), E ⊆ different
vertices.
P Then
(V )) be colors.
Then
a strong neutrosophi
SuperHyperGraph where O(CY C)Z ≥nZ3. (CY Then
n (CY
C nC) n=) 0= 0 Definition 4.46. Let SHG
(i) S (i)
= (G ⊆ P (V ), E
SuperHyperGraph. ⊆ P (VS ))
Suppose is abeseta ofstrong
vertices. neutrosophic
Then 755
position
SHG
osition = (G 4.40.
4.41.⊆ P Let (V
Let ),SHG
E
SHG ⊆ P=(V =(G(G ))⊆be ⊆Pan(V ), E
Pcycle-neutrosophic
(V ), E ⊆n ⊆ P (V PZ(V )) be abecycle-neutrosophic
)) SuperHyperGraph.
a star-neutrosophic Suppose is S Sisisa called
called dominating
set of dominating
vertices. setThen ∀v ∈if V∀v\ ∈S,V ∃s
if set \ S, ∈ S∃ssuch ∈ S thatsucheither
that756eith
v∈
(CY C ) = 0 calledLet be either
a
rHyperGraph
oposition
O(CY
oposition C) Proposition
HyperGraph 3.where
≥4.41.
4.41. Then
with Let
Let 4.41:
O(CY
SHG
centerSHG C)
c.=Let = (GSHG
≥
Then (G3.⊆ZThen ⊆n =(V
P(CY P(G (V),
CE ⊆) E
n), ⊆
=P 0P (V),
⊆(V PE
n)) ⊆
(V be ))Pabe(V)) be a star- Proposition
nstar-neutrosophic
a star-neutrosophic vs ∈(i) E;vsS∈ 4.47:
is E; SHG = (G
dominating set if⊆∀vP∈(V), V \ S,E ∃s ⊆∈PS such (V)) that v∈N
neutrosophic SuperHyperGraph with⊆center c. Then a strong neutrosophic ∀v ∈SuperHyperGraph.
V \ S, ∃s ∈ S such If S iseither
global-offensive
erHyperGraph with (i)E S⊆isP called dominating vs ∈
set if E; that v ∈ Ns (s) or
erHyperGraph
Proposition withcenter
Proposition
4.41. center c.4.41.
c.Then
=Then
Z(G Let ⊆ PSHG (V ), E= P (V⊆))Pbe(Va),star-neutrosophic
(G (V )) be star-neutrosophic 757
Zn (CY C nLet) =Z SHG0 (ST R n (CY C n ) = 0

) = O (ST R )− vs ∈ E; alliance,
(ii) |S|(ii)is
(ii)
|S|
then
called
|S|
isiscalled
chromatic
called
chromatic
chromatic number number
number if ∀v
if ∀v
∀v
∈if∈V,V,
∈
∃s∃s
V,
∈
∈ S∃s
S
∈ Sthat
such
such
such
that that
758 ei
either
either v ∈ vN
with center c. Thenwith 1,σ center n c. Then1,σ2
Znn (ST R1,σ22) = On (ST R1,σ2 )− vs ∈ E vsvs ∈∈EE implies
implies s and sv and
have v have
different different
colors. colors.
position
SHG = (G 4.41.⊆ P3Let (V ),SHG E⊆P Z=(V

n(G
(ST⊆RP1,σ )= E3O
a(Vstar-neutrosophic
), ⊆n nP(ST (V )) R1,σ be 223a)− star-neutrosophic implies s and v have different colors.
n )) be 1,σ 2 1,σ (ii) |S| is called chromatic number if ∀v ∈ V, ∃s ∈ S such that either v ∈ Ns (s) or 759
Zn3i=1
2
rHyperGraph
nter c. Then
min{Σ
min{Σi=1with σi (c) +c.Σ
3 center
i=1 σi (c) + Σi=1 3(ST
Then σR i (x)1,σ2 + ) =ΣZ Oi=1
3 n (ST
n
σ (x) + Σ 33σi (y) + Σi=133σi (z)}
(ST σi (y)RR1,σ 1,σ+22)
)− Σ3= i=1 Oσni(ST (z)}Rx,y,z∈V 1,σ2 )− . Proposition
∈ E implies . (i) S is dominating
Proposition
v have4.47.
Proposition set; SHG
4.47.
Let
4.47. LetSHG
Let SHG
= (G = (G=
⊆ (GP⊆(V P⊆ ),P),E(V
(V E⊆⊆ (V⊆))
),PPE(V ))Pbe (Vaa))
be be aneutrosoph
strong
strong strong
neutro n
min{Σ33i=1 3σii (c) + Σi=1
3 iσ (x) +i=1
3
3 3 ii Σ
3 i=1 σii (y) + 3 Σi=1 σvsii (z)}
x,y,z∈V
x,y,z∈V
x,y,z∈V .(ii)s and
There’s
SuperHyperGraph.
SuperHyperGraph. S
SuperHyperGraph. ⊆
different
S 0
Ifsuch
colors.
S isIfIfthat
SSisis|Sglobal-offensive
0
| is chromatic
global-offensive
global-offensive number.
alliance,
alliance, then then
alliance,
then
760
osition 4.42. min{Σ i=1

Let SHG
i=1 σi (c) +=
min{Σ Σ(G
i=1
i=1 σ⊆ i (x)P
σ +Σ
(V
(c) ),+i=1E i=1
Σ σ⊆3i (y) Pσ +(V
(x)Σ))i=1+ σΣi (z)}
be i=13 a σ (y)
x,y,z∈V +. Σ 3
σ (z)} .
oposition R4.42. Let SHG R=1,σ (G ⊆2 )P= i(VO ),nE ⊆i=1 RP1,σ (Vi )) )−beProposition
Zn (ST
Ea a⊆
R2 )− (ST i=1 i i=1 iLet SHG x,y,z∈V
Zn (STProposition Let
i=1 = (G ⊆ P (V ), E ⊆ P (V )) be a strong neutrosophic
a (V)) be a If(i)
1,σ2 ) = On4.42: SHG 4.47.
⊆PP= (G P(V (V), be P
(ST 1,σ
⊆ 2
(i) S is dominating set;
761
ete-bipartite-neutrosophic
oposition
Proposition 4.42.
plete-bipartite-neutrosophic 4.42. LetLetSHG SHGSuperHyperGraph.
= = (G (G ⊆
SuperHyperGraph. (V(V), ), EE ⊆P ⊆ Then
Then P ))(Vbe)) SuperHyperGraph. S S
is (i) S is dominating
is dominating
global-offensive set;
alliance, set; then
Proposition
plete-bipartite-neutrosophic
min{Σ 3
σΣi 3i=1
(c) σ+i (y)Σi=1 34.42. Let
SuperHyperGraph.
σ i (x)
SHG
+i (z)} 3 SuperHyperGraph.
Σi=1x,y,z∈V
=
σi (y)Then
(G
+
⊆
ThenP3 (V ),
Σi=1 σi (z)}x,y,z∈V .
E Then
⊆ P (V )) be a Proposition 4.48: Let SHG = (G ⊆ P (V), E ⊆ P (V)) be a strong 762
(c) + Σ3i=1
σi (x) i=1 + + Σ 3
SuperHyperGraph.σ . (ii) there’s S ⊆ S such that |S | is chromatic number.
ZZnn (CM
(CM T
i=1
T σσ11,σ ,σ22)) = =OOnn(CM SuperHyperGraph.
(CM TTσ1σ,σ 2 )−
1 ,σ 2 )− (i) S is dominating
Then neutrosophic
(ii) set; (ii) there’s
there’s S SuperHyperGraph.
⊆ SS such
⊆ S that such|Sthat Then
| is|Schromatic
| is chromatic number. number. 763
position
SHG = (G 4.42.⊆ P Let (V ),SHG E⊆ Z Z=
P (CM
n (V (G))⊆
(CM TbeσP1 a
T σ ,σ(V
,σ2 ) ),
)== E
OnO ⊆(CM n
P(CM(VT )) σ1T ,σbe2 )−
σ
a,σ )− Proposition 4.48. Let SHG = (G ⊆ P (V ), E ⊆ P (V )) be a strong neutrosoph
33 33 nn σ11 ,σ3 23Z (CM
2 n T 3)
σ 1
= ,σ O
2
(CM
T )− P (V⊆),PE(V⊆),PE(V⊆))Pbe
min{Σ σ i(x)
lete-bipartite-neutrosophic
sophic min{Σ i=1 σi3
SuperHyperGraph.
i=1
min{Σ (x)+ +Σ Σi=1 σii (x ))+
SuperHyperGraph.
Then
3 +Σ Σi=1 3 σσ
i=1
n i(x (x Then
σi (x )) +
)++ σ1 ,σ
Σ3Σ 32
i=1
1
σ(x iσ
2
(ii)
(x i (x

n there’s
)})}
)}
x,x
,x
σS

x,x 1 ,σ
,x,x⊆ 2 S
,x∈V
Proposition

∈V such
.(i) .ΓProposition 4.48. 4.48.
SuperHyperGraph.
O; |S | is chromatic number.
≤that
Let Then
SHG Let SHG = (G = ⊆ (G (V a))strong
be a strong
neutro
764 n
i=1 σi (x) + Σ σi (x ) + Σ Σ i=1 σ3 ,x ∈V .
i=1 i=1
min{Σ33i=1 σ (x) + Σ 3
3 i=1 σ (x ) + Σi=13 3 iσ (x
3 ) + Σ 3i σ (x x,x
,x)} SuperHyperGraph.
SuperHyperGraph.
. Then Then
i=1 Let i
i min{Σ
i=1 i=1
3 i
i σi (x) + Σ
⊆2⊆)PP= i=1
i=1 Eσi⊆
i (x ) (V
+))Σ 3i=1
i=1 i
σii(x ) + x,x x,x 3
Σi=1 ,x
,xσi,x

(x(ii)
,x

∈V
∈V )}ΓSHG ≤ O ,x
(i) . (G
Γ ≤ O; . P (V ), E ⊆ P (V )) be a strong neutrosophic
osition

oposition
ZProposition 4.43.
4.43.
n (CM T σ1 ,σ24.43. )= Let SHG
Z
OLet n (CM
SHG
n (CM SHG =
Ti=1Tσ=
(Gσ1(G
1 ,σ
⊆
2 )−
,σ P(V(V
(VO ),),
nE
i=1
), (CM
E ⊆i⊆P PTP(V(V
σ1)) ,σ2)) )−
bebe
i=1 be
aa a
Proposition 4.48. Let s ,x n=
x,x ∈V⊆ 765
oposition Proposition
4.43.
ete-t-partite-neutrosophic
plete-t-partite-neutrosophic
Proposition Let 4.43:
SHG Let
= (G SHG
SuperHyperGraph.
SuperHyperGraph.
4.43. ⊆
SuperHyperGraph.
Let P=
SHG (V (G ), =⊆
E (G⊆P P(V),
Then
Then
Then ⊆ (V
P E
))
(V ),⊆
be E P
a
SuperHyperGraph. ⊆ (V))P (V be)) a
be Then
a (i) Γ (i)
≤ O;
(ii) Γ Γ≤ s O;
≤ O n. 766
3 3 + Σ3 σi (x3 3 3
min{Σ
Σ3i=1 σ i (x complete-t-partite-neutrosophic

)
i=1 +σ
+plete-t-partite-neutrosophic Σ
i (x)
i=1 i σ (x i=1 )
complete-t-partite-neutrosophic+ Σ )
i=1 i
+ σ Σ
SuperHyperGraph.(x i=1 σ
)} iSuper
(x
x,x ,x ) +
Hypergraph.Then
Σ
,x3 Then
i=1
∈V
SuperHyperGraph.
σ. i (x )} x,x
,x ,x ∈V .
Then Proposition 4.49: Let SHG = (G ⊆ P (V), E ⊆ P (V)) be a strong
3 3 σi (x)+Σ (i)3i=13Γσ3i≤ σ O;
3 (ii)
3i (x Γ Proposition
(ii)≤ O.Γsn∈V.≤ .On .4.49. Let SHG = (G ⊆ P (V ), E ⊆ P (V )) be a strong neutrosoph
MZTnT(CM
CM
position σ1σ,σ
1 ,σ
T ,···
σ ,σ
2 1,σ
,···
24.43.
))Let
,σt2 t,···==t O
,σ )O=n(CM
SHG
On (CM
n (CM = T(G σ
T σ1 ,σ,···
σ11,σ,σ
⊆
2 ,···
22 ,···
P ,σ
(V,σt),
)−min{Σ
,σ)−min{Σ
t)−min{Σ
t E ⊆ P (V
i=1
i=1i=1
))
σσ i (x)+Σ
be i (x)+Σ
a i=1
(x )+Σ
(x
i=1iσi (x )+Σ
)+Σ i=1 σ 3σ
i=1
)}σx,x
i=1neutrosophic
i (x
s)}
i (x
∈V
x,x)}
SuperHyperGraph
x,x SuperHyperGraph
∈V . which is connected. which Then is connected. Then 767
SHG =
CM T σσ11 ,σ (G ⊆ P (V
)=O ), E ⊆ P (V )) be a 3 3 3 3
3
nσ(CM ,···T )−min{Σ ,σσ (x)+Σ Oσnσ ii.(x )+Σ σiii(x
(x )+Σ )}x,x . )}Let
3 3 3
,···Z ,σntt(CM Tn σt 11),σ =22 ,···On,σ ,σ(CM TThen )−min{Σ i (x)+Σ Proposition σ
Proposition
(i) Γ4.49.
σ4.49.
(x
− iLet
1; SHG
SHG
= (G . = ⊆ (GP (V⊆),PE(V⊆),PE(V⊆))Pbe (V a))strong
be a strong
neutro n
∈V
,σ22 ,··· ,σ
lete-t-partite-neutrosophic
sophic 1 ,σ2 ,σσ
SuperHyperGraph. ,σ ,··· t σ1 ,σ2 ,··· i=1
i=1 ti i(ii) Γs i=1 ≤i=1
i=1 i=1
i=1 x,x
≤ O∈V
i=1 x,x ∈V
4.5 SuperHyperGraph. Then t 768
Global Offensive Alliance
Global Offensive
Global Offensive Alliance
Alliance SuperHyperGraph
SuperHyperGraph
744
744
744
which which is connected.
is connected. Then Then
≤⊆ Σ3i=1 ⊆ P (V )) be a strong neutrosophic
σaProposition
)}x,x ∈V . 4.49. LetSHG
CM TGlobal OLet
),σ=t )−min{Σ
(CMSHGT3i=1 3), E ⊆ P 3
)−min{Σ σ3i=1
(x)+Σ 3 σi (x )+Σ 3 (ii)=Γ(G OnP−(V ), E σi (x).
Definition 4.44. = (G ⊆ ,σP t(V (V )) ibe neutrosophic i=1 σi (x )}x,x 745 ∈V s.
769
n (CM
inition
σ1T
,σσ
21,···
4.44. 4.5
t Offensive
,σ2,σ,···
Let
nGlobal
SHG = (G Offensive
σAlliance
1σ
,σ i2(x)+Σ
⊆
,···
P (V i=1
), E
σiAlliance
⊆
(x )+Σ
P
i=1
(V )) be i (x
a
i=1
neutrosophic
SuperHyperGraph (i) Γ (i)
≤ O Γ − ≤ 1;O −7441;
744 744
nition 4.44. Let SHG
SuperHyperGraph. Then = (G ⊆ P (V ), E ⊆ P (V )) be a neutrosophic which is Proposition
connected.
Proposition 746
746
745 Then
4.50: Let SHG = (G ⊆ P (V), E ⊆ P (V)) be an odd
745 4.50. Let SHG = (G ⊆ P (V ), E ⊆ P (V )) be an odd path. Then
770
erHyperGraph.
inition
rHyperGraph. 4.44. ThenSHG4.44.
Definition
Let
Then = (G Let
⊆ PSHG (V ), =
E (G
⊆ P⊆(V P (V)) ),
be Ea⊆neutrosophic
P (V )) be a neutrosophic
path.Γ(ii)Then 3 3 745
sive Global Global
(i)Alliance
a set Offensive
S Offensive
is called Alliance
Alliance
global-offensive
SuperHyperGraph.
alliance if
Thenalliance if
(i) Γ ≤ 744 O − 1; (ii) s ≤(i) ≤
Γ744snthe
O O
−set
Σi=1
746 745−σΣ
745
nS = i{v (x). σi (x).
2 , v4 , · · · , vn−1 } is minimal-global-offensive alliance; 771
i=1
)erHyperGraph.
a set S Definition
is called Then
4.44: Let
global-offensive SHG = (G ⊆ P (V), E ⊆ P (V)) be a 746
746
746
HG a set
nition =S (G is⊆called
4.44. P Let
(V ),global-offensive
SHG
E ⊆ =(V
∀a
P (G))
∈ V⊆ \be P a(V
S, |N ),alliance
E ∩⊆S|P>
s (a)
neutrosophic (V|N if))s (a)
be ∩a (V neutrosophic
(ii)\ S)|;Γs ≤745On − Σ3i=1 PropositionProposition
σi (x). (ii)745Γ4.50.= n2 4.50.
+Let
1 and SHG Let SHG
= (G =
corresponded ⊆ (G Pset(V⊆ is),SPE= (V⊆
{v ),2PE
, v(V4⊆ ·P
, ·)) · be,(V
vn−1 )) };be
an oddanpath. odd 772 pa
T
a set Sneutrosophic
)rHyperGraph. is called(i) a setSuperHyperGraph.
S is called global-offensive
Thenglobal-offensive
∀a ∈ V \ S, |N (a) ∩ Then
alliance
S| > |N if (a)
alliance if
∩ (V \ S)|;
(i) The set746 S = {v2, v4, ···, vn−1} is 3minimal-global-offensive3
s s
alliance; (iii) Γs set
= {v
min{Σ }Σ isσi (s),
oddΣpath. Σi=1 σallianc
i (s)};
746
(ii) ∀S ⊆ S, S is global ∀a ∈ offensive
V \ S, |N s (a) ∩
alliance S|S>
but |N (a)Proposition
isn’tsglobal ∩ offensive
(V \ S)|;alliance. 4.50. Then (i) the
Let SHG(i) setthe
747 =S (G= ⊆ S2P,=(V {v,),·2·E
v4s∈S={v ,·v,42⊆ ·4P
v,v, n−1 · ·(V
,··· ,v}, n−1
v))
is
n−1 be } an
i=1 minimal-global-offensive
minimal-global-offensive
s∈S={v1 ,v3 ,··· ,vn−1 }alliance;
Then 773
a set SS isis called global-offensive ∀a

alliance ∈ V \if S, |N s (a) ∩ S| > |N s (a) ∩ (V \ S)|;
obal-offensive
) ∀S (i) a
called set S is called
∀a ∈
⊆ S, S is global offensive alliance
V global-offensive
\
alliance if S, |N s (a) ∩ alliance
S|
alliance;
s but S isn’t s > |N if
s (a)
global
∩ (V \ S)|; (iv)
748
n the sets
n S 1 = {v 2 , v 4 , · · · , v n−1 } and S 2 = {v 1 , v 3 , · · · , v n−1 } are only
(i) offensive
the set Salliance.
= {v2(ii) , v4Then
,Γ·(ii)
·=· ,vΓ =+}12isand
747 + 1corresponded
and corresponded
minimal-global-offensive set is set =is{vS2 ,=v4{v
S alliance; , ·2·,·v,4v, n−1 · · · };, vn−1 };774
∀SS ⊆called
is
(iii) S, S is global offensive alliance number
minimal-global-offensive-alliance
(ii) ∀S ⊆
but S isn’t
alliance; of SHG globalis offensive
alliance. Then 2n−1
747
alliances.
∀a ∈ VS,
∀a ∈ V \ S, |Ns (a) ∩ S| > |Ns (a) ∩s(V \ S)|; \ S
S, is|N global
(a) ∩offensive
S| > |N alliance
s(a) ∩ (V but
\ S
S)|; isn’t global offensive alliance.
748 Then 747
(iii)corresponded 3 3 3 3
)S ∀S is called
⊆ S, Sminimal-global-offensive
is global offensive
S is called alliance
minimal-global-offensive alliance;
but S isn’t global (ii)alliance;
Γ= n2 + 1 alliance.
offensive (iii)
and Γ(iii)
=Then Γs = min{Σ
min{Σ
s Proposition set
748 is s∈S={v
7474.51.
s∈S={v
747 S2 ,vLet
=4 ,··· {v SHG,v
2 2,v
748
, 4v,···
n−1 4= }, Σ
·(G
,v·n−1
·⊆
i=1 Σ
, v}σPn−1
i (s),
(V
i=1 ),σ
}; Σ (s),
⊆ PΣ
Eis∈S={v (Vs∈S={v
)),vbe
1 3 ,···an,v,v
1 even }Σ
3 ,···
n−1 path.
,v i=1 }
n−1 σ Σ
i (s)
Then
775 i=
) minimal-global-offensive-alliance
∀SS (ii)
is called
⊆ S, Salliance∀S 0
is global ⊆ S, S is
butoffensive global
S isn’t alliance offensive
but
numberalliance
alliance;

S isn’t
of SHG
but
global
|S|S 0is isn’t
offensive global
alliance. Then (i)the
747the set
748
748
=3S{v S =2 ,={v
v42{v ,, v·2Σ · ,·4·v, .v
4·,,·v · ·n·}1},,visvand
}Sand , ·1·,·v,3alliance;
lminimal-global-offensive-alliance
offensive S is aglobal
(iii) minimal-global-offensive-alliance offensive
number alliance.
of SHG Then
(iii)
number iss =747min{Σ
Γ of SHG
(iv) (iv)sets
the Ssets
is 2 ,v4 ,··· ,v748n−11} Σi=11σ i (s), n−1 n−1 2 =Σ S3i=1
{v 21 ,=σvi3{v(s)}; · · · }, vare
v, n−1 n−1 } 776are
only
offensive alliance. Then
is called minimal-global-offensive
alliance.
S 3 ,··· ,vn−1 }
s∈S={v s∈S={v
S is called
al-global-offensive minimal-global-offensive
) minimal-global-offensive-alliance alliance; alliance; minimal-global-offensive
minimal-global-offensive alliances. alliances.
and it’s denoted by Γ; number of SHG
(iv)
|S| is 748
the sets S1 = {v2 , v4 , · 749
n
(ii) Γ = and corresponded sets are {v2 , v4 , · · · .vn } and {v1 , v3 , · · · .vn−1 };
· · , vn−1 }2 and S2 = {v1 , v3 , · · · , vn−1 } are only 777
S is a minimal-global-offensive alliance. |S| |S| σiVolume ⊆),2PE|(V
Curr
ffensive-alliance Trends
minimal-global-offensive-alliance
numberMass Comm
of SHG , is number
2023 of SHG is Proposition
minimal-global-offensive Proposition Γ4.51.
(iii)alliances.
s = min{Σ 4.51.
Lets∈S={v
SHG Let2 ,vSHG = 4 ,···(G ,vn }= ⊆Σ3i=1(G
P (V ⊆ ),PEΣ(V
(s), s∈S={v Issue
⊆3 ,···
1 ,v))
Pbe 1
(V
.v |an51
))}Σ be3 an even p
even path.
i=1 σi (s)}; 778 T
(iv) minimal-global-offensive-alliance-neutrosophic
S is a minimal-global-offensive number
alliance.
S is a minimal-global-offensive |S|of SHG is
alliance.
n−1
and it’s denoted by Γ; (iv) 749 sets S = {v , v , · · · .v } and S = {v , v , · · · .v

the 1v {v 4, · } · ·(V } are only
(i) the (i)setthe =S(G set⊆S2P,=
= {v (V4 ,),·2·E ,2·v.v is.vn))n } be is an minimal-global-offensive
2
even1 path. 3 n−1 alliance; alliance;
Σ|S|
S
S is
is aa minimal-global-offensive
|S|Γ;
minimal-global-offensive Proposition
alliance.
alliance.
3 4.51. Let SHG 4⊆ nP Then 779
and it’s denoted by andΓ;it’s denoted by Σs∈S i=1 σi (s) minimal-global-offensive
749 749 alliances.
) minimal-global-offensive-alliance-neutrosophic
S is a minimal-global-offensive S is a minimal-global-offensive
alliance. alliance. number of SHG is n = n and corresponded sets are {v , v , · · · .v } and {v , v , ·
and it’s denoted byS Γ; is a minimal-global-offensive alliance.
(i) the set S = {v2(ii) , v4 ,Γ·(ii)
·= Γ is
·Proposition
.v 2} and corresponded sets are {v
2 749 2 , v4 , ·2· · .v
alliance; 4 n } and n {v1 , v3 , ·1· 780 · .v
3 n−
SHG is 4.52. Let SHG = (G ⊆ P (V ), E ⊆ P (V )) be an even cycle. The
n 749
(iv)
minimal-global-offensive-alliance-neutrosophic
minimal-global-offensive-alliance-neutrosophic number of SHGnumber is of
and
Γ; it’s denoted
and it’s denotedby Γ;by Γs . Σs∈S(ii) Σi=13 750 749
Γσ= i (s)
749 3 3 3 3
) minimal-global-offensive-alliance-neutrosophic number n and
of SHG (iii) Γ (iii)
is
correspondeds =(i) Γsthe
min{Σ = set
sets min{ΣS ={v
are
s∈S={v {v
s∈S={v
2 44, ··2,v
,,v4v,···
22,v ··,v vΣ
·n· 4,}.v
,···nn} ,v
i=1 } Σ i=1{vσΣ (s),
v3 , ·Σ· s∈S={v
σminimal-global-offensive
}isnand i (s), 1i,s∈S={v ·1.v
,v3n−1 ,··· 1.v };
,v }Σ
alliance;
3 ,···
n−1 i=1 }
.vn−1 σΣ i=1 σ
(s)};
i 781
Proposition
(iv) the 4.54.
3 S =Let SHG
{c} = (G ⊆ PS
⊂SS (V E ⊆only
),are P (V ))global-offensive
be star. Then
)) be (ii)
a strong
Γs ≤
(ii) Γneutrosophic
sO≤n O
Proposition Σ−3i=1
−n4.50.Σσ3Let SHG
i (x).
769
σiSHG
(x). = (G ⊆ P (V ), E ⊆ P (V )) be an odd(iii)
(iii)
(iv) (iv)
path. =sets
ΓThen
the theΣsets
s sets S=
i=1 σiS
(c);
{c}
= and
773 {c}
and SS
772⊂772
and ⊂areS only global-offensive
are only all
alli
global-offensive
Proposition 4.50. Let 771 = (G ⊆ P (V ), E ⊆ P (V )) be an odd path. Then
i=1 773
(i) Γ ≤ O − 1; 770 (i) the set S = {c} is minimal-global-offensive
771 alliance;
Proposition (G ⊆ P (V ), E ⊆ P (V )) be w
(i) the set4.50.
Proposition
Proposition S= {vLet
4.50. , · · ·SHG
2 , vLet
4SHG , vn−1 }=is(G
⊆minimal-global-offensive
P⊆(VP),(VE),⊆EP⊆(VP)) (iv)
))alliance;
be(iv) the sets S4.55. 774Let
{c}
=4.55. and
and SHG ⊂
SS773
⊂S S= are
are only
only global-offensive
global-offensive (VP))alliance
allianc
(i) the
(ii) Γs ≤set OnnS−=Σ{v3 2 , v4 , · ·771
σ (x). ·= (G
,772vn−1 } is (Vbe
minimal-global-offensivean an
odd
Proposition odd
path.
Proposition
(ii)
path.
alliance;
Γ = 1;
Then Then
4.55. Let SHG
Let
772
SHG =773
774 (G =⊆ (G P⊆ (V P),(VE ),⊆EP ⊆ (Vbe))wh
be
i=1 i
(ii) Γ = 2 + 1 and corresponded set is S = {v2 , v4 , · · · , vn−1 }; PropositionProposition (G ⊆ ),),EE·⊆⊆ ))6+3(i−1)≤n
Sσ4.55. Let
,vv3}SHG
SHG =
=6774,(G ⊆ PP(V (Vi+6 PP(V (V))6+3(i−1)≤n
bebe6+3(i−1
wheel.
wheel.
775
S+{v
12{v
, v42, ·vcorresponded
·4·, ·,772
·v·n−1
, v } is} minimal-global-offensive {v
V )) be(i)
an(i) ,}∪
v∪3{v
}{v vv969·,··v··9·,·,v·vi+6 · · ·· ·,,·,v·vn·n},}i=1
theΓthe
set set
Sn =Then
= is minimal-global-offensive
773 n−1 set is S = {v , v , · · · , v(i)
alliance;
alliance;
the set =S{v
(ii) odd path.
= and (iii) Γs =
}; Σ3i=1 i (c); · , v, ,i+6
774
Proposition 2 4.50. Let SHG = (G 3⊆ P (V ), E ⊆ P (V 2 ))4 be an (i)n−1the
odd
3 (i)
path.set
the Sset
Then = =11, {v 31 773 ∪ , {v
775
6 n }i=1
vi=1
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn−1 } Σi=1 σi (s), Σs∈S={v1 ,v3 ,··· ,vn−1 } Σi=1 σminimal-global-offensive
i (s)}; 776
alliance; 6+3(i−1)≤n
6+3(i−1)≤n
};minimal-global-offensive
};Σminimal-global-offensive alliance;
99 ···alliance;
n n
be (ii)
))-offensive an (ii)
odd
(iii) Γ=
Γalliance;
=
Γ path. min{Σ
2S1=
+
Then +and
1 and corresponded
corresponded set is Sis=S{v
3set =2{v, v42, ·v·4·, ·, ·v·n−1 , v(iv)
(i) the
the 3set SS==
sets {c}{vand 11, v3S3} }⊂774 ∪
∪S{v {v 66,776
are vvonly
,775 ··global-offensive
· ,,vvi+6i+6,,······ , ,vvnn}}i=1
alliances. isis
s = } Σminimal-global-offensive
i=1 σi (s), Σs∈S={v1 ,v3 ,···alliance; } i=1 σi (s)}; 777
n−1 775
(i) the 2set {v 2 , v,4v, ·,2··,v· 773
4,,···
v774 } is i=1
(iv) The
(iv) the sets S
sets 1 =s∈S={v
{v ,vn−1
n−1
2 4 · · , vn−1 } and S2 = {v1 , v3 , · · · , vn−1 } are (i)only
,vn−1
The set is minimal-global-offensive
alliance; alliance; 6+3(i−1)≤n
Proposition 3|{v4.55. v3},}Let SHG ,v=v9(G ⊆· P, v (V ), E, ·⊆· P (V )) }6+3(i−1)≤n
be wheel. Then|;
(ii) Γ3= = 1i,v(s)}; v∪3778{v
}{v ,··v··777 · · · ·,,·,v·vn6+3(i−1)≤n
6+3(i−1)≤n
, · · (iii)
4ffensive · , v(iv) are
Γ};
(iii) only
Γ=
alliance;Γ Minimal-global-offensive
smin{Σ
= nmin{Σ
·alliances.
775 ,v} Σ alliances.
3 3
}}Σisσ i (s),
Sσ= i (s),
Σ= Σvs∈S={v (ii) ,v(ii)ΓΣ ΣΓ|{v
σ =(s)};
1σ,|{v 31 ∪ ∪ 6{v
6 , 775 96·776 ,·v·i+6 ·i+6 , v, i+6 ·n},i=1 n }i=1
vi=1 |; |;
(ii) = 2S +1s∈S={v
1=and{v22corresponded ·4,v ·n−1 set 2{v 2 ,{v 41, ,· v· ,v
· ,,3·1,···
·n−1
v,v ·3,v v};n−1 }i=1
n−1 sthe sets s∈S={v ,,vv442,···
,,v774 ,··· , vn−1 i=1 and
i=1 S s∈S={v 1 ,n−1
,··· }
n−1 }are ionly
i=1 9776
n−1 3
minimal-global-offensive alliances. (ii)
(ii)
(ii)(i) the Γ
Γ == |{v
S 11=,, v
set|{v v{v3 }
}
1 ,∪
v∪3 }{v
{v ∪66{v, , vv69,9v··9······ ·778
,, i+6,,·········, ,v,v
,vvvi+6 nv}
n }}
6+3(i−1)≤n
6+3(i−1)≤n
i=1 3 is |;|;
Proposition 4.51. Let SHG , ·,= (G,⊆v}⊆ Pand ),SE ⊆
}(Vσand P{v(V {v ))v be, ·van ·, ·,even , v}path. }sThen 3 i+6 n
3 i=1
{v· ·1 ,v, v3(iv)
,···
n−1 (iv)
};
(iii)
,v n−1
Σ
the}Γthe
sets
Proposition =sets
s i=1
σSi (s)};
min{Σ = {v 2{v
S1s∈S={v
14.51:=Let , vSHG
22,,v
4 ·v4·4,···
·=
775 ·v·n−1
(G
776
,v n−1 }Σ3i=1
P
n−1 (V), E ⊆
i (s),2 =SΣ2(V))
P = 1 ,be
s∈S={v 11an
3 ,v3·even
3,··· ,v ·(iii)
·(iii)
vn−1n−1 Σ}Γ
(iii)
n−1 3Γ
are
s σ ==are
Γ ΣΣ=
ionly
(s)}; only
{vΣ
i=1
779
1 ,v3 }∪{v6 ,v776 9alliance;
777 777
··· ,v i+6 ,··· ,vn }
6+3(i−1)≤n i=1 Σ
Σ3i=1 Σσσ i (s);
3 (s);
i σi (s);
s {v ,v {v }∪{v,v }∪{v
,v ··· ,v
,v ··· ,···
,v ,v }
,···
6+3(i−1)≤n
i=1}6+3(i−1)≤n
,v 33 i=1 i=1
(i)}3minimal-global-offensive
path. Then
the set = {v2 , v4 , · ·SHG
S4.51. · .vnalliances.
} isalliances.
(G ⊆ P (V ), E ⊆ P (Valliance; )) be(iii) (iii)
(iii) Γs =
Γ =path.
Σ{v1 ,v
Σ
1 3 1 3 6 9 6 9i+6 i+6 n i=1 n
6+3(i−1)≤n Σ
6+3(i−1)≤n i=1 Σi=1 σσi (s);i (s);
· ·,vProposition S1 = {vLet , v= an even Then 778 778
3 ,3·,···
v,v , n−1
v(iv) are only Γ sonly ∪33}∪{v ,v· 99· ··· , nvnn}}i=1
780
{v6 , v669,v ····, ,v ,,···
· · ·,v
6+3(i−1)≤n
n−1} Σthe
i=1 σ i (s)};
sets 2 , v4 , · ·776 · 777 n−1 } and S2 = {v1 , v3 , · · · , vn−1 } (ii) are = |{v 1 ,{v
v31},v }∪{v i+6779
v,vi+6
i+6 ,··· ,v }i=1 |; i=16+3(i−1)≤n

777 i=1
Γ = n4.51. (iv) the set {v {v , v
1 v 3},781∪} ∪ {v , v · ·
6 v 9·,·v· ,·v· ·i+6 · , v , · · · , v }6+3(i−1)≤n
n}, vi=1 6+3(i−1)≤n
isisono
and corresponded
(ii)minimal-global-offensive sets= are
alliances. ⊆ P{v ⊆(V , v),
4 ,E· ),
· ·⊆.vPn⊆ }(V and (V{v (iv)
))1 ,an v3 , an ·the
· ·(iv) .v set
theΣ{vset
};path. 1 , {v 31 v3{v } 778 ∪6 , {v · ·σ·i (s);
,·v3,· i+6 ,,·}v·6+3(i−1)≤n
n·6+3(i−1)≤n
n }i=1 is only
778
Proposition
Proposition set2 S 4.51.
= {vLet, LetSHG SHG ·= (G (G 2P (V E P)) be be even even path.
n−1 Then Then 96780 7799 i+6
(i)
(i) The
the onlyset 2 v4 , · ·777
.v n } is is minimal-global-offensive
minimal-global-offensive (iv) (iv)minimal-global-offensive
alliance; The
779 i=1
· · · , vn−1 } are (iii)
(iv) Γ
thes =set
set 1{v{v , v } ∪
, v336 },v9∪
theminimal-global-offensive
,v31 1}∪{v
{v
{v
··· ,v ,
66,···v · · · , v
alliance.
, v9,v9n·}alliance.
·i=1· , vi+6
6+3(i−1)≤n ,Σ · , v
i+6 , · · · , vnn }i=1
i=1 is only
V )) bePropositionanalliance;
even s path. Then 3 3
is
only Minimal-global-offensive
i+6
alliance.
alliance. alliance. i=1
(i)(iii)
(i) Γset
the the =set
Snmin{Σ
=4.51.
S{v {v Let
=s∈S={v
, v , ·2 SHG
v ·
,v ·
,
4 · 778,v779
.v
,··· · · =
}
.v
n }Σ (G
is}
i=1 ⊆σi (s),
P (V Σ),s∈S={v
E
(ii) Γ = 2 and corresponded sets are {v2 , v4 , · · · .vn } and(iv) is
{v1the
⊆ P
, · ·{v
· .v
1 ,v(V
3 ,···)) be
.vn−1 }anΣalliance;
i=1evenσalliance;
i (s)};
path. Then
minimal-global-offensive 782 779 alliance. 6+3(i−1)≤n
, v3set 3 } ∪};
2 4 2 4 n n 780 780
1, v
n−1 {v6 , v9 · · · , vi+6
781, · · · , vn } is only
Proposition 4.56.
i=1 LetSHG SHG == (G ⊆PP⊆
⊆(G (VP),),(V
EE),⊆EPP⊆ (VP))))bebe an
fensive
)) be an alliance;
(iv) the
even
(i)
(ii)
the
Γ
path.
=n setsnThen
set SS=
min{Σ {v{v
1 =
and ,2v,4v,4·, ·· ·· 779
corresponded
·.v.v780n}} isand
sets
S2 = {v1 , v3 , · · · .vn−1 } are
are {v(s),
, v42Σ, ·v·4·, ·.v· n· }.vand
Proposition
Proposition
only
} alliance;
Proposition
{vProposition
4.56.
Proposition 4.56.
4.56.
Let
4.56.
Let
783
}; Let
·4.56: Let SHG
Let
SHG =
SHG
alliance.
SHG (G =
=⊆ (G(G=
⊆
P(V
781(G ⊆ PP(V
);E ⊆
(V
(V ),EE ⊆
),P(V ))
⊆ P⊆
be
P(V
an
(V
(V
)) bebe(V
odd
)) an
an
an
))odd
be
od
(ii)(ii)
Γ= and and
corresponded 2{v 1{v 1 ,3·v·3·σ
, ·.v·(s)}; };
2 corresponded n sets sets
are
3 are and and , vΣ .vn−1 780
(iii) Γ s =
2 2 alliances.
s∈S={v2 ,v4 ,··· ,vn } i=1 i Σ σ n
s∈S={v1 ,v3 ,··· .vn−1 } i=1 i
3 n−1 784
n
+1
781
782
n } and
vnsive
{v 1 ,Γv3=, · · ·n .v n−1 }; ,complete.
Proposition
1(i) 3,the set Then4.56.809
Let
{v}iSHG n2 =n(G ⊆ P (V ), E ⊆ P (V )) be an odd complete. Th
}i=1
SS};=={v 781 2 is minimal-global-offensive allianc
alliance; n +1
2+1 +1
(ii) 2 and corresponded sets 3 {v2 , v4 , · · · .vn } and {v(i)
3 are v3the · · ·3set
.v
780 781 n
(iii) (iii) Γsthe
Proposition =
Γsmin{Σ = min{Σ 4.52. Let2,,v SHG Σni=1}Σ
⊆ Pσ i (s),
σ (s),
Σ⊆s∈S={vΣ(V n−1 2
(i)
+1Σi=1 is minimal-global-offensive alliance
(i)the
Σσ theset σiset
(s)}; S
S= =S{v
(s)}; }}{v
=ii785 2 i} is 782is minimal-global-offensive
782 minimal-global-offensive alliance; alli
(iv) 3
sets S =s∈S={v
s∈S={v
1 {v 2 v442,··· ·=
,,v·4,v,··· }(G
·n .v,v n} and (V
i=1 ),SiE
2 =
P
{v )) be
1 , v13,v
s∈S={v ·an
, 3· 1,···· 3.v
,v even
.v
,···
n−1
n−1.v} cycle.
(i)
}(i)
n−1 }the
are
the
Then
iset
only
i=1
set S = {v
{v
}
n 2 +1
i=1
i=1
i=1 is
i=1 is minimal-global-offensive
783
alliance;
1(iii)
Σ σ (s)};
(i) ΓΓ s·s·=
},vand {v
(iii) ,i=1 =· min
.v n−1 };s∈S={v2 ,v4 ,···
,}v3minimal-global-offensive
imin{Σ 782 3
Σminimal-global-offensive
i=1 σi (s), Σs∈S={v1 ,v3 ,···alliance; Σ 3
σ (s)}; n= n i i=1
+
3 ,··· .v
,vnalliances.
}(ii) i=1Γ i= + 1;+ 786
1 n−1 781 n 782
n 1;
(iv)(iv) the the
the
sets setS1S =
sets =1{v
S {v =22,{v,vv442, ·, ··v··4,·,v·.v
n·}n· }}is
.vnand } and S2 = S2{v =1{v , v31, ·v·3·, ·.v·.vn−1 ·n−1 }
.v(ii)
n−1 (ii)
are
(ii)
(ii)
Γare
}(ii)Γ
Γ
Γonly
= =
=Γonly
= n2n222+ +
+2
1;
1;
1; 1; 784
783 783
·3 ,···
· · .v
.vn−1 }
}Σ
are
3 only
σi (s)};
minimal-global-offensive , · ·782·alliances.
alliances. 2
(iv) the 1 = {vLet
sets S4.52. 2 , v4 SHG .vn= } (Gand⊆SP 2 = (V{v , v3⊆, ·P · ·(V .vn−1 } arean only
n−1 783
i=1
Proposition ),1E )) be (iii) even cycle. Then 3 3 783 σ784 784
(iii) ΓΓΓΓΓsss= = min{Σ
min{Σ 3 ΣΣ i (s)}
σσσi3(s)} nn ;+1 ;
3(s)} 785
s∈S n +1
minimal-global-offensive 784 alliances. (iii)
(iii) (iii)
(iii) s s= Γ
=min{Σ
smin{Σ
min{Σ= min{Σ s∈S
s∈Ss∈SΣ
s∈Si=1 Σs∈S3i i=1
σi=1
i=1 Σ ii (s)}
(s)}
i=1 σ i n(s)}
S={v
+1 ; } 2n
2 S={v }
+1 ; n2; +1 ;
2+1
(iv) The sets S = {v , v , ··· .v } and S = {v , v , ··· .v } are only i=1 784 S={vi }i=1 i i=1 i2 2
i=1
.vn−1 }Proposition
are only 4.52. S={v
S={v }
S={v
} i=1i }i=1
Proposition
(i) the cycle.set S = 14.52. Let 2 Let SHG
4
{v2 , v4 , ·alliances. SHG783
n= (G = ⊆
(G2 P ⊆ (V 1P), (V3E),⊆
· · ,785vn } is minimal-global-offensive alliance;E P ⊆
n−1 (V P ))
(V be)) an
be an
even even cycle. cycle. Then Then 785 785
i
i i=1
786
V )) beProposition
an even Then
4.52. Let SHG 784 = (G ⊆ P (V ), E ⊆ P (V )) be an even cycle. Then n2 +1 nn
+1+1
Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, (iv)(iv) the
(iv) the
theset setS S
set
NY, S==
USA{v
= }{v
i{vi=1i} }
2nis
n
+1
2+1only
785
nis minimal-global-offensive
is
+1 only
only minimal-global-offensive
minimal-global-offensivealliances. allianc a
(i) (i)
the the set set S =S{v =2{v , v42, ·v·4·, ·, ·v·n,}vnis} minimal-global-offensive
is minimal-global-offensive (iv)(iv) the
(iv)
alliance; theset
alliance; theset Sset S= =S{v{v= i}
i
i=1
i}{v
i=1
i=1
2
2
i=1 i } 2 is only
i=1 is
786 786is minimal-global-offensive
only minimal-global-offensiv allian
all
ffensive
)) be an alliance;
even cycle. Then
= {vLet
Proposition
(i) the set S4.52: 4, · · · =
2 , vSHG , v(G n} ⊆ (V), E ⊆ P (V)) be an evenalliance;
is Pminimal-global-offensive Proposition4.57. 4.57: LetLet SHG = (G(G= P(V(V),
), EE⊆⊆PP (V(V)))) bebeananeven
even
786
785 Proposition Let SHG =
786 ⊆⊆P(G complete. T
Proposition
Proposition 4.57.
4.57. LetSHG SHG =(G ⊆P
(G ⊆ (V P⊆ ),
(V E),⊆E P⊆ (VP ))(V
be))anbeeven
an
cycle. Then Proposition
complete.
Proposition
Proposition Then 4.57.
4.57. 4.57.
n Let
Let
SHG
SHG
Let =
SHG= (G = ⊆ ⊆ P
(G P (V (V),P E
), E
(V⊆ ⊆P
), E(V
P ⊆))
(V be(Vbe
P)) an))an
eve
be
nsive alliance; 786 (i) the set S = {vi }i=1 2
isn minimal-global-offensive alliance;

(i) the set S = {vi }i=1 n
2n n
isnminimal-global-offensive alliance;
searcher (i) · Department of Mathematics · DrHenryGarrett@gmail.com
The set S = {v2, v4, ··, vn} is minimal-global-offensive (i) (i)
(i) ·The
(i) the
Manhattan,
the
the set
set
n S
2 ;
S= ==S{v
{v{v
NY, i}}USA22
2 is is
is
alliance;
(ii) Γ
(i) =set
the Sset = i}
i {v
i=1
i=1
i=1 i is2minimal-global-offensive
}i=1 minimal-global-offensive
is minimal-global-offensive alliance;
alliance;
allian
Researcher
searcher
archer
esearcher · ·· Department
·alliance;
Department
Department
Department and of of
ofNY, Mathematics
Mathematics
corresponded
Mathematics
of Mathematics sets are
· · DrHenryGarrett@gmail.com
{v
· , v , ···, v }
DrHenryGarrett@gmail.com and {v , v , ···, ·
· (iii)
(ii)
· Manhattan,
Manhattan,
· ΓManhattan,
Manhattan, = nnn
;NY,NY,
NY, USA USA
NY,
3 USA USA
gmail.com · Manhattan, USA
esearcher · Department of Mathematics · DrHenryGarrett@gmail.com ·(ii) 2 4 n 1 3 (ii)
Manhattan, Γ =
Γ 2 ; min{Σ 2
NY, Σ σ (s)} n;
n USA
ΓΓ==ΓnNY, ;
s s∈S i=1 i 2
vn−1 · };
S={vi }i=1
2; USA
2 ; n Σ3 σ (s)}
ett@gmail.com
Researcher
Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan,
(ii) (ii) 2=
ail.com · Manhattan, NY, USA (iii) Γ s = min{Σ s∈S 2 i=1 i n;
(iii)
(iv) Γ
(iii) Γss =
the = min{Σ
set S = {vi }s∈S
min{Σ i=1 Σ is3i=1
Σ 3
3onlyσσ i (s)} S={vi }i=1 2
(s)} nn ;
2 ;
alliances.
n
(iii) Γ = min{Σ s∈S Σ σ 3 i
(s)}
(ii) Γ = and corresponded sets areare and (iii) Γ = min{Σ Σ σ (s)} n2 ; n ;
}
(ii)(ii) Γ= 22 and
n and corresponded
corresponded sets sets are {v{v ,
2 4 v
2 , v
, ·
4 ,
· · ·, ·
v ,
n v} n }
and and {v {v,
1 3 v
1 , v
, s·
3 ,
· · ·, ·
s v ,n−1v };
n−1 };
s∈S s∈S i=1 i
787
i=1 i=1 S={vS={v
787 i
S={v
S={v i i=1
i} 2
i=1 2
i }i=1i }i=1
n
2
Researcher
· · · , vn }(iii) (ii)
and · Department
Γ{v=1= · ·of, vcorresponded
3, ·and
,vnmin{Σ Mathematics
n−1 };
sets are
787
{v , v , · · · , v } and {v
· Manhattan,
,
(iv)
v , · ·
the
· , v
set NY,
};
S USA
= {vi }i=1 787n is only minimal-global-offensive alliances
Γ σ(s), Σ σ(s)};(iv) the set S = {v } 2n
is only minimal-global-offensive
(iii) Γ = min{Σ σ(s), Σ σ(s)}; minimal-global-offensive alliance
2 4 n 1 3 n−1
sof Mathematics NY,(iv) Theset set S is only minimal-global-offensive
s 2 s∈S={v ,v ,··· ,v } s∈S={v ,v ,··· ,v } 788
s∈S={v2 ,v24 ,··· 4 ,vn } n s∈S={v1 ,v13 ,··· 3 ,vn−1 } i n2 788 n
Department · DrHenryGarrett@gmail.com · Manhattan,(iv)
n−1
(iv) USAthe
the
(iv) set
the Sset = =S{v {v
= }i}
i=1
{v 2 is
i=1 } is2 only
only
is minimal-global-offensive
only minimal-global-offensive allia
alliaa
v3 ,··· ,vn−1
Researcher (iv) (iii)
(iii)
(iv) } σ(s)};
·the Γ
the =sets
Department
ssets min{Σ
S1S= =
1of {v
s∈S={v{v
2 4, v
2 ,
Mathematics v
2 ,v
, ·
4·
4 , ·
,··· ·,v
, ·n,}
v n
· vσ(s),
}n }788 Σ
and and S
s∈S={v
S 2 =2 ={v
1 ,v{v
3,,···
1 3 v
1 , v
,v
, ·
3
n−1·, · }·,σ(s)};
·
v ,
n−1v ·
n−1} alliances.
}
Manhattan,
are are only only NY, USA
i i=1
788
i i=1
789 789
(ii) Γ = n2 and corresponded
minimal-global-offensive HenryHenry Garrett
sets are Garrett {v 2 , ·v4Independent
· Independent , · · · , vn } Researcher and {v1 , v3 ,··· Department
Researcher · , vn−1 }; of of
·Department Mathematics
Mathematics
787 · DrHenryGarrett@gmail.com
· DrHenryGarrett@gmail.com · Manhattan, NY
· Man
1 , v3 , · · · ,(iv) minimal-global-offensive
vn−1 } are
the setsonly S1 = {v2 , Henry 4 , · · · , Garrett
vHenry valliances.
alliances.
Garrett
n } and S· Independent
· 2Independent
= {v1 , v3 , · · ·Researcher ,Researcher
vn−1 } are ·only · Department
Department of of Mathematics
Mathematics 790 790
· · DrHenryGarrett@gmail.com
DrHenryGarrett@gmail.com · Manh·M
(iv) ΓThe = sets S1 = {v , vHenry , ···, vn}vσ(s),and · n=Independent
}{v , v3, ···, }· ,arevn−1 };Proposition 4.58: be788 an m-family of neutrosophic stars with · Manh
789
· · ·ΣS,s∈S={v v, n−1 of G
789
) Γ = n2(iii) andminimal-global-offensive
corresponded
s min{Σ s∈S={v sets 2 are 4
2 ,v4 ,··· ,v
{valliances.
2n,Garrett
} 4 ,790 2v and 1 ,v {v
1 3 ,··· ,vn−1
1 , v3 Researcher·}·σ(s)}; · Department 787 Mathematics
790 · DrHenryGarrett@gmail.com
onlyΓminimal-global-offensive
Proposition
Proposition
(ii) = n2 4.53. 4.53.
and LetLet
corresponded SHG SHG =alliances.
=
(G(G
sets ⊆are⊆ P{v P2(V
(V ,),vE ), E ⊆⊆ P (V P (V
4 , · · · , vn }Researcher
))and ))
be be an1an
{v v3common
, odd odd · ,cycle.
cycle.
,·· ·Department
vn−1 neutrosophic
};Thenof Mathematics
Then vertex 791 791 set. Then
Henry Garrett · Independent 787
· DrHenryGarrett@gmail.com · Ma
) Γ =
⊆ P (V )) be
s min{Σ
(iv)
Propositionanthe odd
s∈S={v sets S
4.53.
cycle.
2 ,v 41,···= ,v {v
n Let
}
Then σ(s),
2 , v
Henry SHG
4 , Σ
· · ·
s∈S={v,= v
Garrettn(G} 1and
,v⊆ 3 P
,···S (V
,v =), E
}{v
791 · Independent Researcher
2 n−1
σ(s)};
⊆
1 , vP 3 ,
(V · · ·
)) , v
be n−1 an } are
odd only
cycle.
Proposition
· DepartmentThen 788
4.58. Let G be a m-family
of Mathematics
789
791 of neutrosophic stars with
· DrHenryGarrett@gmail.com ·M c
(i)
(iii)(i)the Γtheset
= setS
min{Σ S= ={v {v, v
2Let4SHG, v, · ,
· · ·, ·v , v }
σ(s), }
is is minimal-global-offensive
Σ σ(s)}; alliance;
alliance;
beonly }an oddProposition (i) The set7894.58. = of {cLet ,Mathematics
cG2,Then ···, a} m-family
is ·minimal-global-offensive
792
) the setsProposition 4.53:

2 4 n−1
S =
s
{v , v , · · ·
s∈S={v
Henry
, v }
2 ,v4 ,···
and S=,valliances.
Garrett (G
n−1
=
n } ⊆ P (V),
{v · , v
s∈S={v
Independent
, · · E, ⊆
· v
1P ,v3(V)),··· ,vn−1
} are Researcher Proposition
neutrosophic
· Department S 4.58.
vertex set.
1
Let
788
790 G abecm-family
be
792
m
of neutrosophic
of neutrosophic
DrHenryGarrett@gmail.com starsstars
with wi co
(i)1 thealliance;2 4S = Henry
set {v2n, vHenry 4 , ·Garrett
· · , v2Garrettn−1 }·1792 3 · Independent
isIndependent
minimal-global-offensiven−1 Researcher Researcher · Department
alliance;
Proposition · Department 4.58. ofset.
Mathematics
Let of792Then
GMathematics
be a m-family · DrHenryGarrett@gmail.com
·ofDrHenryGarrett@gmail.c
neutrosophic stars with co
global-offensive cycle.
(ii)
(iv) Γ theΓThen
= n n
sets +
S4.53.
1 =and 1alliances.
and
{v , vcorresponded
, · · · ,= vn(G } and setSis 2 is= S
{v = , vP {v v·2·,4))
·v , ·n−1
, ·4, v·be ·,an
·v},n−1
vodd
are };alliance
neutrosophic
neutrosophic
};
only for790 G;
vertex
vertex set. Then
(ii)
Proposition = 2 2+ 2corresponded
Let SHG setP
⊆ (V S), E= 1⊆ {v 23,(V cycle. Then 793 793
1 4 n−1
neutrosophic vertex set. 789
Then
Γ = n2 + 1 and corresponded set is S = {v2 , v4 , · · · , vn−1 }; (i) the set S = {c ,
1 793 c 791
2 , · · · , c m } is minimal-global-offensive alliance
vposition ·(ii)
2 , v4 , · ·(iii) ,4.53.
vn−1minimal-global-offensive
}; alliances. 7933 3 (i) (i) the 3 setset
the S =
S {c
= ,
{c c ,
790
, c· · ·
, · ,· c· , }c is} minimal-global-offensive
is minimal-global-offensive alliance
alliaf
(iii) (i)
(i)ΓThe Γ=
sthe =set
s Let
min{Σ
set SS =
min{Σ
SHG =s∈S={v
{v{v= 22,,(G
s∈S={v vv424,⊆ ,· 2·4···,
,v P
·,···4,(V
,v vn−1
v.vn−1
,··· ),.vE }} ⊆Σ is} Σ
is
n−1 } 3i=1 i
n−1 minimal-global-offensive
i=1 σibe
(s), (s),
Pminimal-global-offensive
(V σ )) Σan Σs∈S={v
s∈S={v odd cycle. ,v3 ,···
1 ,v13 ,···
Then .vn−1
n−1 (ii)
}3Σ}i=1
.valliance;
(i)
(ii)
3
Γ
Σ
the
Γ =σ=m
i=1 σifor
(s)};
i (s)};
setm
791
G;
Sfor= G;
1 2
{c1 , c12792
m
, ·2· ·794, c794m }mis minimal-global-offensive alliance f
(iii) Γs = min{Σ
Proposition 4.53. Let SHG = (G Σ⊆ P σ
(V (s),
), E Σ ⊆ P (V )) be an odd Σ cycle. σ (s)};
Then
alliance; and 3 corresponded set is S =794i=1 {v2, iv4, ···, s∈S={v }; 1 ,v3 ,··· .vn−1 }(ii)
vn−1alliance;
794
2 ,v4 ,··· .vn−1 } i=1 i
σ,1ivs∈S={v
791
) the set
s∈S={v
(iv) S
1 ,v(iv)
3 =
,···
(ii) .v{v
the Γthe=
sets
n−1 Σ
2 , }v
ni=1
42,S
sets · 1·+S· =1 =
(s)};
and
{v
n−1 {v
2, v
}corresponded
2 is
,4 v, ·4minimal-global-offensive
·, · ·.v· n−1 .vn−1 }set } is
and and S 2= S= 2{v =
{v 2 ,{v1v,4v ,· ·3· ·,,·v·n−1
1, ,3· v .v· n−1
.v}; n−1}(ii)} Γare
are
==
Γ
ΓΓonly
mm
only for G;
792 for G; 795
(iii) m G;3 793
(iv) sets S = {v , v , · · .v } and S = {v , v , · · · .v } (ii)
(iii)
are only = m for
s = Σi=1 Σj=1 σj792 (ci )795for G;
(i) the set S =
minimal-global-offensive 1 {v 2 , v
2 4 , ·
4 · · , v n−1 } is
alliances.
n−1
alliances. minimal-global-offensive
2 1 3 n−1 alliance; m 3
795
796
{v
) 1Γ, v=3 ,·2·(iii)
n ·+
(iii)
.vn−1 } are only
1minimal-global-offensive
Γand
s = corresponded
min{Σ s∈S={v2set is .v Sn−1 =}{v Σ 3, v , · · · , v
2 σ 4 i (s), Σs∈S={v n−1 }; 1 ,v3 ,··· .vn−1(iii) }Σ
3 Γs = Σ793 m Σ 3Σ3σj (c i ) for
796
G; G;
i=1 σ (s)};
795
,v4 ,··· alliances. i=1 (iii)
(iii) Γ iΓ s== Σ Σ
i=1
m i=1j=1
Σ σ
j=1 σ794
796
(c j (c
) ) for
ifor G;

n (iv)
(iv) the
s
The sets
sets S =
= {c
{c ,
j, c i
, , ·
···, · · , c}mand} and S ⊂S S⊂ 0 S are only minimal-globa
are
S c c only minimal-
(ii)
Proposition Γ = + 1
4.54. and corresponded
Let set
796
⊆ is S = {v , ⊆v , · · · , v }; i=1 j=1 1 7932
3SHG = (G P (V ), E 2 4 P (V
3)) ))
n−1 be star. Then
Proposition 2 4.54. Let SHG = (G ⊆ P (V ), E ⊆ P (V be star. Then 794S = {c1 , c2 1 2 797 797m
) Γs = min{Σ (iv) the
Proposition sets2 ,vS ,···=.v{v
4.54. Let ,Σ vSHG , · ·σ· i.v (s),
=n−1 (G Σ}s∈S={v
⊆and P (VS1), ,v3= E,···{v ⊆ 1P , v(V 3 ,Σ ·i=1
)) · ·be.v σistar.(s)}; }(iv)
are
Then the
only thesets
alliances for G. 1795 ,,c· ··,···,,·cG. m } and S ⊂SS⊂ are
S only minimal-global
Σglobal-offensive
s∈S={v 41 n−1 2} 4i=1 2 .vn−1 } n−1 (iv) sets S=alliances
{c{c
= 2 , ·2for
797
c· m, }cmand } and S ⊂ S are are
onlyonly minimal-g
⊆ P (V ))(iii) be Γ s = Then
star. min{Σs∈S={v2 ,v4 ,··· .valliances.
minimal-global-offensive n−1 } 797
Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 }(iv) 3 the
i=1 σi (s)};
alliances sets Sfor G. 1 , c794 minimal-global
) the sets (i) (i)
(iv)
S the
= the
The
(i)1 the setset
{v set
sets
, Sv SS
=
, ·
2 4S 1= {c}n−1
=
·=
{c}
· {c}
{v
.v is, vis , minimal-global-offensive
··· .v
} and S }
= and
{v S
, v = , · {v
· · ,
.v v , ··· alliance;
alliance;
} .vn−1}
are only are alliances
alliances for for G.
G. Let
796
798
2 is 4minimal-global-offensive 3alliance;
798
n−12 1 23 1 n−1 Proposition 795
4.59. 798 G be a m-family of odd complete graphs with
only
(iv)
alliance; Proposition
(ii) minimal-global-offensive
the
Γ= =
sets S4.54. {vLet
1 =alliances. 2 , v4 , · · · .v=alliances.
SHG n−1 (G}798 ⊆and P (VS2),= E {v ⊆1P, v(V 3 , )) · · ·be.vn−1 areProposition
star.}Proposition
Then only
neutrosophic 4.59:
7964.59.
vertex Let
Let
set. G 795
797Gbe bean799
Then am-family
m-familyofofodd oddcomplete
complete graphs
graphs with
(ii) Γ 1;1;1;
(ii)Γ minimal-global-offensive
= Proposition
Proposition 4.59.LetLet
4.59. 799G be G
799 be a set.
a m-family m-family of oddof odd complete
complete graphsgraphs
with wc
alliances. with
neutrosophic common neutrosophic
vertex set. Then
796
vertex Then
position (i) 4.54. the Let set3 SHG S3 = {c} = (G ⊆ P (V ), E ⊆
is minimal-global-offensive P (V )) be star.
alliance; Then neutrosophic
neutrosophic vertex
vertex set. set. n
Then Then
Proposition 4.54: Let SHG = (G P (V), E P (V)) be star. +1
797
⊆ ⊆
799 798
(iii)
(iii)(iii)ΓsΓ
Proposition Γ=ss =
=ΣΣ Σi=1
3 σi (c);
σσi (c);
4.54.
i=1 i (c);Let SHG = (G ⊆ P (V ), E ⊆ P (V )) be star. Then (i) the set S = {vi}ni=1 2
800 800 is 800 minimal-global-offensive alliance for G
i=1 2 +1
797
) the set S Then
(ii) = {c}Γ = is 1; minimal-global-offensive 800alliance; (i) The
(i) the set set 798S = {vi }i=1 n n is
+1
2799 +1 isminimal-global-offensive
minimal-global-offensivealliance alliance for G;
(iv) the sets {c} ⊂⊂ (i)(i)the the=set nS S
set == {vfor
i }i=1
{v i}
2 is801minimal-global-offensive
is minimal-global-offensive alliance for G;fo
alliance
(iv) (i)the the setssets
set SSSS === {c}
{c} {c} and
is and and SS S ⊂
minimal-global-offensive S Sare areare only
only only global-offensive
global-offensive
alliance; alliances.
global-offensive alliances.
alliances. For
(ii) ΓG; 2 + 1 G; i=1
801
798 801
) Γ = 1; (iii) Γs = Σ3i=1 σi (c); (ii) Γ = n2n799 + 1 for G;800
l-offensive (i) The set S =4.55. {c} isLet minimal-global-offensive ),alliance;
(ii)alliances.
Proposition
Proposition
Proposition Γ = 1; 4.55. 4.55. LetLet SHGSHG SHG ==
= (G(G
(G ⊆
801
⊆P ⊆P(V P ),
(V (V ),EE ⊆E⊆P⊆ P(V(V P))(V ))be)) bewheel.
be
wheel.
(ii)
(ii)
Then
wheel.
(iii) ΓΓThen
Then Γ=
s= = 2min{Σ
n + 11
2 + s∈S
forfor ΣG; 3G;
i=1 σ
802
799 i (s)}
802 n +1 for G;
3(ii) Γ = 1;
802 2
) Γs = Σ(iv) 3 801 S={vi }ni=1
i=1 σithe (c); sets S = {c} and S ⊂ S are only global-offensive alliances. (iii) Γ s = min{Σ
800 Σ
s∈S i=1 3 σ i (s)} +1 for G;
⊆ P (V ))(iii) be
(iii) wheel.
Γ = Σ Then
3
σ (c); 802 6+3(i−1)≤n 6+3(i−1)≤n (iii)

(iii) Γ = min{Σ Σ 3 σ (s)} S={vi }i=1 2
n +1 for G;
2 n +1 for G;
(i)the
(i) the
the
sset set
set SS ==i{v{v 1 ,v v }}3∪
,33v }∪ {v ∪ {v{v 6,, v v9 v··9·· ·· ,·,v·vi+6
6 ,9 ,i+6vi+6, ,· ·· ·,· ·,·v, ·nv,}vi=1 6+3(i−1)≤n
}i=1 is is is Γs = min{Σs∈S Σ
s s∈S i=1
800 i σi (s)}
(i) Si=1 = S{v ⊂1S,Let }ni=1 803n S={vi }i=1
1 2i=1+1803 803 2
) the sets
Proposition {c}
S =minimal-global-offensive
and 4.55. areSHG only6alliance;
= global-offensive
(G ⊆ P (V ), E alliances.
⊆ P n(V )) be wheel. (iv)
Then the sets801 S = {v }n
i 802
i=1 are only i }i=1
S={vminimal-global-offensive allianc
6+3(i−1)≤n minimal-global-offensive
vn }i=1 (iv)minimal-global-offensive
issets S = {c} and S ⊂alliance; Salliance;

(iv) the sets S = {vi }i=1
2n+1804 804
804
n are only minimal-global-offensive alliance

the are 0 only global-offensive alliances. 8012 +1
(iii) The sets S = {c} and S ⊆ S are only global-offensive (iv) The sets are only minimal-global-offensive
803
(iv) the sets802 S4.60. = {vi Let }i=1G2 beare
+1 only minimal-global-offensive alliance
position (i) 4.55. the=Let SHG =3 }{v= v36},⊆v∪9P·{v
(G (V6 ,),v9E· ·⊆ P (V )) be· ,wheel.
vn }i=1Then
6+3(i−1)≤n
|; |; is Proposition }i=1 aare m-family of even complete graphs wit
6+3(i−1)≤n
set
|{vS ,{v ,· ·,·,v··i+6
,· v· n,,}·v·i=1 (iv) the sets S = {v only minimal-global-offensive all
(ii) Γ 1 , ,vv }∪1{v · · ·,·v,i+6 6+3(i−1)≤n
alliances. alliances for G.
804 803
i805
6+3(i−1)≤n
(ii) (ii)
Proposition Γ= |{v|{v
Γ minimal-global-offensive
= 1, v 3 }3∪
14.55. ∪Let {v
6 , SHGv6 ,9 v·9· · alliance;
=, v(G vi+6
i+6 ⊆ ,·P · 6+3(i−1)≤n
(V , v),n }Eni=1 }⊆i=1 P (V )) be |; wheel. Then
Proposition
neutrosophic vertex 4.60. Let 802G
set.804GThen be
805 805a m-family of even complete graphs with
)(i−1)≤n
the set (iii) S = {v , v3Σ} ∪ {v6 , v9 · · · , vi+6 , · · · , v6+3(i−1)≤n n }i=1
Proposition 4.60. Let be a m-family of even complete graphs with
|;(iii) Γs1= {v1 ,v3 }∪{v6 ,v9 ··· ,vi+6 ,··· ,vn805
Σ3i=1 σisi (s);
3Σ}36+3(i−1)≤n neutrosophic
Proposition vertex
803
4.60. set.Let Then
806 G be a m-family of even complete graphs
(iii) Proposition
(i) Γ
minimal-global-offensive Γ
the
(ii) Γ = |{v =s =Σ
set Σ S 4.55:
= {v Let, v
alliance;
}3∪ {v SHG
} ∪ {v
v99,v·i+6 = ,
· ·i+6(Gv ·
⊆ · }i=16+3(i−1)≤n
·P , (V),
v ,E · ·⊆ · Σ,Pv
6+3(i−1)≤n
(V))i=1σ σ
be
(s);i (s);
wheel. is neutrosophic
Proposition vertex
4.60: set.G803
Let
nThen806
2 be 806 anminimal-global-offensive
m-family of even completealliance graphs for G;
s {v11,,vv133}∪{v 1 369,··· 6 , vi+69 ,vn,}·i=1 n· ·i=1 , vn }i=1
i+6 n i |;
{v ,v }∪{v ,v ··· ,v ,··· ,v 6+3(i−1)≤n
}
6 ,v6 ,··· i=1 i=1 (i) the set804S
neutrosophic = {v
vertex } set.
i i=1
n
805

is
Then
3
σ (s); Then minimal-global-offensive alliance; 6+3(i−1)≤n with common
the set S = {vi }i=1 Neutrosophic vertex set. Then
2807 is minimal-global-offensive alliance for G;
804
is only (i)
2n
set, {v
(iv) the 1·,·v·3,}v∪ {v , ·6 ·, ·v,9,vv· n· ·}·i=1 , vi+6 , · · · ,|;vn }i=1
806
i=1 i 6+3(i−1)≤n
) Γ = |{v(iii) 1 , v3 }Γ ∪ ={v 6 v{v
Σ 36+3(i−1)≤n
,nΣv}i=1
6+3(i−1)≤n
σi (s); (i) the set805 nS = {vi }i=1 nis minimal-global-offensive alliance for G;
(iv) (iv)
(ii)
the the
sset set{v{v191,,vv13,3}∪{v
Γ = |{v , v }
v}3∪}i+6
∪ {v
∪
6{v,v9{v
, 6···, v
v
6
,v9i+6
· · · ,
· ,,v·vn,i+6
·alliance.
9·,···
v ,
}vi=1
· ·
, · ·, · ·, ·v6+3(i−1)≤n
6+3(i−1)≤n
i+6
· , v }
n
i=1
}i=1
|;
is is only
only
(ii)
(i) Γthe = set
n 2 Sfor= G;
{v }
806
808 2 807
i 805 is807minimal-global-offensive alliance for
i=1
=2n2806 for
for G;
1 3 6 9 i+6 n (ii)
minimal-global-offensive alliance. (ii) ΓΓ=
+3(i−1)≤n minimal-global-offensive i=1
)=1 Γs = Σ{v1is alliance. Σ3i=1
807 σi (s); G; 3 808 808
,v3only 6+3(i−1)≤n
6+3(i−1)≤n
}∪{vset 6 ,v9{v ··· ,v,i+6 ,···∪ ,v{vn }i=1 (iii) ΓΓs = = min{Σ Σ806 σi (s)} n for G;
Volume
(iv)
CurrΓthe
Proposition
(iii) sTrends
= Σ 1 v3 } Let
Mass
4.56. Comm 6 , v,92023
SHG ·= · · (G , vi+6 ⊆ ,P· ·(V
6+3(i−1)≤n
· ,),vnEΣ }i=1⊆
3
i=1 i
P σ (V (s); )) be isan only odd complete.
(ii) Then
n
for s∈SG; 807
3 i=1
809
S={vi }ni=1 2 2 | Issue 1 | 52
{v14.56.,v3 }∪{v6Let ,v9 ···SHG } (iii) Γ = min{Σ Σ 808 σi809 (s)} for G;
808
Proposition
Proposition minimal-global-offensive
4.56. Let SHG ,vi+6 ,···=
alliance.
= ,vn(G
(G ⊆i=1 ⊆
6+3(i−1)≤nP P
(V (V ), ),
E E⊆ ⊆P P
(V (V)) ))
be be
an anodd
(iii) odd complete.
complete.
Γ s =
2
min{Σ ThenThen
s∈S Σ 3
i=1 σ (s)}809
S={v } for G;
2
n
) the set {v s s∈S i
3} ∪ set{vS6 , = · · ·}, v2i+6 , ·is · · minimal-global-offensive
, vn }i=1
n
(i)1, v the v9 {v +1 is only alliance; 807 i=1
n 3
i
S={vi }i=1 i=1
2
⊆ minimal-global-offensive
P (V ))Proposition
be an i i=1 6+3(i−1)≤n (iii) Γs = min{Σ Σ
810
2 σ (s)} n for G;
(iv) theodd set complete.
{v4.56. } Let
∪
1 , v3alliance.n Then
{v
2 +1
n
6+1
SHG , v9 · = · · (G , vi+6 809 , · · · , v }
⊆ P (V ), nE i=1 ⊆ P (V )) be isan only odd (iv) the
complete. sets Then
808 S = {v s∈S i}807n i=1are i only minimal-global-offensive
2 alliances
(i)
(i) the theset setS
n
S= ={v {v
i } i } i=1
2
is is minimal-global-offensive
alliance; (iv) the sets S = {v }
i=1
809
n
2 810
are 810
only
S={vi }i=1
minimal-global-offensive alliances
(ii) minimal-global-offensive
Γ = 2 + 1; i=1 alliance. i
(iv) the sets S = {vi }i=1 nare only minimal-global-offensive alliances f
i=1 2
808
811
position 4.56. Let n ⊆ Pis ), E ⊆
fensive alliance;
(i)
(ii) the
Γ = n nSHG
set S = + {v
1;
= }(G 2 +1 (Vminimal-global-offensive
810 P (V )) be an odd alliance; complete. Then 809
810 2 811
(ii) Γ
Proposition =
(iii) Γ =2 min{Σ 2 + 1;
4.56. Let
i i=1
Σ SHG3
σ (s)} = (G ⊆ Pn (V ), ; E ⊆ P (V )) be an odd(iv) 4.6 complete. Global
the sets
Then S Powerful
= {vi809 } 811 are
812i=1
Allianceonly minimal-global-offensive allian
)) the
the set
set SS = s i }} 2
={v isiss∈S i=1 i
minimal-global-offensive for G;
{v i i=1
i=1 3 S={vi } 2alliance
minimal-global-offensive alliance for
i=1
G; SuperHyperGraph.
and it’s
and it’s denotedThen
828denoted
828 by Γ; following statements hold;
by Γ;
(iii)
nn(iii) s
Γ Γ ==min{Σ min{Σ s∈S ΣΣ i=1 3 σi (s)}
σ (s)} n +1 for G;
2 n +1 for G;
830
)) ΓΓ= =22+ s
for G;
+11 for G; s∈S n
2 +1i=1 i S={v i
S={vii=1
}
}i=1 2 (i)
(ix)
(i) if ss≥≥
(ix)ifminimal-global-powerful-alliance-neutrosophic
t and a set S of vertices
minimal-global-powerful-alliance-neutrosophic
829t and a set S of vertices is t-defensive number
829
830 is t-defensive Σ alliance,
number
alliance,
s∈S Σ3i=1 σof then
of (s) SHG
SHG
i then SSisisisiss-d s-d
(iv) the sets S = {vi }i=1 are only minimal-global-offensive alliances
alliance; for G. S is a minimal-global-offensive 831
alliance.
33 n
+1 alliance; 3 3
3
)) ΓΓss = =min{Σ
min{Σ s∈SΣ Σi=1i=1 σ
σSii(s)}
(s)}S={v n2n for G;
for G; minimal-global-offensive alliances ΣΣs∈Ss∈SΣ Σi=1 σ (s)
i=1σiii(s)
S=={v i }ii=1
(iv) 830 for G.
(iv)the thesets +1 are only
s∈S 2
+1
n+1 830
831
s∈S i=1
Proposition sets 4.60. {v
S={v
Let i} i}}
Gi=1be a are
i=1
i=1
22
m-family of even complete graphs (ii) alliances
and
if with
s ≤it’stcommon
denoted
and fora G. setSSby
S isS
isis aΓ a of. vertices
sminimal-global-offensive
a minimal-global-offensive
minimal-global-offensive 832
831
is t-offensive
alliance. alliance, then S is s-offe
alliance.
alliance.
(ii) if s ≤ t and a set S of vertices is t-offensive alliance, then S is s-off
neutrosophic n vertex
22+1
areset. Then
G Gbebea am-family
n
)) the Proposition
the sets SS =={v
Proposition{vii}}i=1 4.60.
+1
are Let
only m-familyofofeven
minimal-global-offensive complete
alliances for G.
for G.graphs
Proposition with
and it’s common
denoted
4.62. Let bySHG ΓΓsSHGs.. = (G833 832 ⊆832P (V ), E ⊆ P (V )) be a strong neutrosophi
sets i=1 4.60. onlyLet minimal-global-offensive even
alliances complete graphs and with
it’s common
831denoted by
831 s
neutrosophic vertex set. n Then
Proposition
Proposition 4.63.
SuperHyperGraph. 4.63. Then
LetLet SHG==
following
(G(G⊆⊆PP(V
statements
833 (V ),),EE⊆⊆PP(V
hold; (V))))be beaastrong strongneut neu
positionneutrosophic vertex set.
2 Then
SuperHyperGraph. Then following Pstatements hold;
oposition (i)
(i) The
4.60.
the Let
4.60. set
Let GS
set G bebe a{v
= a m-family
}
m-family
i i=1 is is
of minimal-global-offensive
even complete
of even complete graphs
graphs with
with alliance
common
alliance
common S
for is
Proposition
Proposition G;
SuperHyperGraph. s-powerful 832
832
4.62. Let
4.62. alliance;
LetThen SHG
SHG == (G
following (G ⊆ ⊆ P833
834
(V(V),),EE ⊆
statements ⊆ PP(V (V )))) be
hold; be aa strong strong neutrosophic
neutrosophic
n SuperHyperGraph.
SuperHyperGraph.
(i) ifIf ss ≥ and aThen
tt and Then
set S following
Sfollowing
of vertices
vertices statements
statements is t-defensive hold; alliance, then S is s-defensive
hold;
rosophic (i)
trosophic for
vertex G;
vertex
the set.
set.
set Then
Then
S = {v i }i=1
2 n
2 isisminimal-global-offensive alliance (ii) if
for
(i) G;sG;≥ tt++22aand
≤833833 set aaof set SS ofofvertices 834is t-offensive isist-defensive alliance,alliance, then S isthen S is
(i) the n S = {v
set } minimal-global-offensive alliance (i) foralliance;
if s ≥ and set vertices t-defensive
(ii) Γ = n2n for G; i i=1 t-powerful
(i) ifif ss ≥
(i) ≥ tt and alliance.
and aa set set SS of of vertices
vertices 835 is
834
is t-defensive
t-defensive alliance, then
alliance, thenalliance,SS isis s-defensive
s-defensive then S i
)) the
the set SS =
set(ii) =Γ {v
{v=ii}}i=1
22
n is
is minimal-global-offensive
minimal-global-offensive alliance
alliance for
for G;G; alliance;
alliance;
alliance;
(ii)
(ii)ΓsΓ==i=1 2 n for G; 3 if s ≤ t and a set S of vertices 835
alliance; 834
834
(ii) is835t-offensive alliance, then S is s-offensive al
(iii) min{Σ 2 for G;
s∈S Σi=1 σi (s)} n for G;
Proposition 4.64: Let SHG = (G PEalliance,
(V), Ealliance, ⊆be PSaS strong (V)) be
836
)) ΓΓ= nn
for
= 22 for G; G; S={v i } 2 (ii)(ii) if if s
(ii) if s ≤835t4.63.
(ii) if s s ≤
≤≤ t
835t
t and
and
and and aLet a a aset
set set S
setSHG
S ofS
of of
vertices
S of=vertices
vertices vertices is
is isis⊆t-offensive
t-offensive
t-offensive alliance,
t-offensive then
alliance,
then then
is s-offensive
is s-offensive
then SS isisallianct-pow
allian
t-po
(iii) 3 i=1
n n for G;
Proposition (G836 ⊆ P (V ), ⊆ P (V )) neutrosophi
(iii)ΓsΓs==
(iii) min{Σmin{Σ s∈S ΣΣ
s∈S i=1 3 σi (s)}
ni=1
σ i (s)}S={v } 2 for G; a
Proposition r-regular-strong-neutrosophic
SuperHyperGraph. 4.63. ThenLet SHGfollowing = (G 836 Super
statements
⊆ P (V ), E ⊆hold;P Hypergraph.
(V )) be a strong Then
neutrosophic
Proposition 836 4.64. Let SHGSHG= =837(G (G⊆⊆PP(V (V),),EE⊆⊆PP(V (V))))be beaa
33 i i=1 2
)) ΓΓss = =min{Σ
min{Σ ΣΣi=1 σσii(s)}
(s)} n for G;
G; S={v
foronly i }i=1 Proposition
Proposition 4.63. 4.64. Let SHG
Let = (G ⊆ P (V ), E ⊆ P (V )) be a strong neutrosophic
= {v i }i=1
2n
followingfor statements
G. hold;
s∈S 836
(iv) thes∈Ssets i=1S S={v
S={v ii}}
22 are minimal-global-offensive alliances
SuperHyperGraph.
SuperHyperGraph. Then following
Then following statements
statements hold;
hold;
n
i=1
i=1
2
r-regular-strong-neutrosophic
(i) if s ≥ t + 2 and a set S of SuperHyperGraph.
SuperHyperGraph.
vertices is t-defensive Then
Then
alliance, following then S statemen
following stateme
is s-powe
(iv)(iv)the
(iv) The
the sets
sets
sets
n
2n S S =={v{v i }i=1
} 2 are
n
are only
are only
minimal-global-offensive alliances
alliances
(i) if s ≥
for
t for
+ 2
G.and G. a set S of vertices
837
(i) alliance;
if s ≥837 t + 2 and a set S of vertices rr is t-defensive alliance, then SS is
is t-defensive alliance, then is s-powerful
s-powerful
iminimal-global-offensive 837
)) the
the sets SS =={v
setsalliances {vii}}i=1for
2 are only minimal-global-offensive
i=1 G. are only i=1 alliances
alliances for
for G.
G. (i) ∀a + 1, then thenSHG == (G(G ⊆P ⊆(V), P (VE), E ⊆ P (
(i) ∀a∈∈S,
ifalliance; S, |N |Nss(a) (a)∩∩S| S|<<2838 SHG
837
4.6 Global Powerful Alliance (i) if
alliance; 2 + 1, then SHG = (G ⊆ P (V ), E ⊆ P (
4.6 Global Powerful Alliance ⊆
(ii) P (V))
s ≤ tisand
2-defensive
if2-defensive 2-defensive aalliance;
set
alliance; S of alliance;
vertices is t-offensive alliance, then S is t-powerful al
Global
Global 4.6
Global
Definition Global
Powerful
Powerful 4.61.Alliance
Powerful Powerful
Alliance
Alliance
Let SHG = (G Alliance
⊆ P (V ), E ⊆ P (V )) be a neutrosophic (ii) ifif ss ≤
(ii) ≤838tt and
838
and aa set set SS of of vertices
vertices isis 838t-offensive alliance, then S is t-powerful allian
839 838
t-offensive alliance, then S is t-powerful allianc
rr(V ), E ⊆ P (V )) be a
Proposition ifif∀a 4.64. Let SHG =S| (G>⊆P
Definition 4.61: Let be
(ii) ∀a∈∈V
aa r-regular-strong-neutrosophic
(ii) V \\S, |NSHG ss(a) ∩ ),++ 1,1, then
then
SHG = (G ⊆ PP(V ), EE⊆⊆
⊆SHG (V),= E(G P ))(V), (V),aaE PPP (V))
SuperHyperGraph. Then P⊆ ⊆⊆⊆ (ii) S, Let|N (a)= ∩(G S|⊆ >PP(V then ))SHG be aa ==
SHG (G(G ⊆⊆ P (V ),hold;
P⊆
Definition 4.61. Let SHG = (G ⊆ ⊆P
⊆P (V ),E (V (V)))) bebe neutrosophic
inition 4.61. Let ⊆ ⊆ Proposition
Proposition 4.64.
4.64. Let SHG = (G 2(V
2 ), EE ⊆ P (V(V)) be
finition 4.61.
Definition Let SHG SHG =
4.61. =(G (G Let PPSHG(V ),E =⊆(G (V
(V )) P bebe neutrosophic
neutrosophic
E ar-regular-strong-neutrosophic
neutrosophic
2-offensive 839
839
alliance; SuperHyperGraph. 840839
839 Then following statements
neutrosophic
SuperHyperGraph.
erHyperGraph.
erHyperGraph. Then Super Then
Then
SuperHyperGraph. Hypergraph.
Then Then (V), E ⊆ 8402-offensive
840 (V)) is 2-offensive alliance;
P
r-regular-strong-neutrosophic alliance; SuperHyperGraph.
SuperHyperGraph. 840
Then following
Then following statements hold; statements hold;
(i) a set S of vertices is called t-offensive alliance if (i) if ∀a ∈ S, |Ns (a) ∩ S| < rrr2r + 1, 840
then SHG = (G ⊆ P (V ), E ⊆ P (V )) is
(iii) (i) if
(i) ifif ∀a
(iii) if ∀a ∀a ∈∈ S,
S,
∀a∈∈S,S,|Nalliance; |N |N |N (a)
s(a)
ss (a)
ss (a) ∩ ∩
S|
∩ S|∩<V 2\ V
< \ S|
2 S|
2 + =
+ 1,=then 1, 0,then then
0, then SHG
SHGSHG SHG == (G (G= ⊆⊆(G
= PP(G(V(V⊆ ),
⊆),E P
EP⊆ (V
⊆(VPP),(V EE
),(V ))⊆
)) isisPP(V
⊆ (V)
)) aa set
set SS(i) of
of vertices
a set
vertices S isisof
called
vertices
called t-offensive
t-offensiveis called alliance
t-offensive
alliance ifif alliance if 2-defensive
(i) a set S of vertices is called
(i) a set S of vertices is called t-offensive alliance if t-offensive alliance if (iii) If ∀
2-defensive
r-defensive
2-defensive ∈ , |Ns
alliance;
alliance;
alliance; (a) ∩ V \ S| = 0, then SHG = (G ⊆ P (V), E ⊆
∀a ∈ V \ S, |Ns (a) ∩ S| − |Ns (a) ∩ (V \(ii) S)|ifr-defensive
> t;a∈ V S\ S,alliance;
∀a∀a∈∈VV \\S, S, |N ss(a) ∩∩S| − |N ss(a) ∩∩(V \\S)| > t;t; P(ii)
(ii) (V)) ifif∀a∀a is∈∈r-defensive
∀a VV \\S, S, |N |Nss(a)
|N ss (a)∩
alliance;
(a) ∩∩S| S|S|>>>rrr2r+ ++ 1,1,then
1, then SHG SHG = (G = (G
(G ⊆ ⊆ P⊆(V (VP),), (VE),⊆⊆EPP⊆ (VP ))(Visis))
|N (a)
∀a∀a∈∈V V\ \S,S,|N|N S| − |N (a)
(a) ∩(V S| S)|
− >
|N (a) ∩ (V \
(iv) S)| if >∀a t;∈ V \ S, |N (a) ∩∩VV2\22\S| ==then 0,0,then SHG
SHG =
==P(G ⊆⊆EPP (V (V
), E ))
⊆ ⊆PP
s (a) ∩ S| − |N
s
s (a) ∩ (V(iv)
s \ 2-offensive
S)| if ∀a
>
2-offensive
2-offensive ∈
t; V alliance;
\ S,
alliance;
alliance; |N s s (a) S| then SHG (G (V ), E
(ii) r-offensive alliance.
)) aa t-offensive
t-offensive(ii) aa alliance
t-offensive
t-offensive
alliance isis called
allianceis is
alliance
called global-offensive
global-offensive
called
global-offensive
alliance ififalliance
alliance tt= =0;
alliance(iv)
0; if t = (iii)
if tr-offensive
(iii) ififif
(iii)
If= ∀a
∀a
∀a0;
∀a ∈∈∈∈S,S,
S,V |N \|NS,alliance.
|N (a)|N∩s∩∩(a) VVV\\\S|
∩S| S|V ==\0, 0,S|
841
0,then =then
then 0,SHG
SHGthen
SHG =SHG =(G(G ⊆⊆= P⊆
P(V (G
(VP),(V),⊆ EE),⊆
P⊆E(V),PP⊆ (VP)) E))(Visis)) is
s(a)
ss = = (G (V
841
841
0;
(ii)
(ii) a t-offensive
a t-offensive alliance
alliance is iscalled
global-offensive alliance
alliance ⊆
Propositionif
Proposition P ift (V))
=
r-defensive
r-defensive
t
r-defensive = 0;is 0; r-offensive
4.65.
4.65. alliance;
alliance;
alliance; LetLet alliance.
SHGSHG = =
841
(G 841 ⊆
(G ⊆ P P (V(V ), ), E E ⊆ ⊆ P P (V(V )) )) bebe a a
set(iii)
)) aa set SS of(iii)
a set Sisisofcalled
a set S ofcalled
of vertices
vertices vertices
vertices t-defensiveis calledalliance
is called t-defensive
t-defensive t-defensive
alliance ififalliance alliance if
if r-regular-strong-neutrosophic SuperHyperGraph. Then following statemen
(iii) r-regular-strong-neutrosophic
(iv) ififif∀a
(iv) ∀a∈∈ VV \\\S, S, |N |Nssss(a) (a)∩∩∩VVV\\\S|
(a) S|SuperHyperGraph.
S|===0,0,0,then then
then SHG SHG = (G (G
= Then
(G⊆ PP ⊆(V (V Pfollowing
),),
(V EE),⊆ ⊆EPP⊆ (V stateme
P))))(Visis)) is
(iii) a set S of vertices is called t-defensivealliance
a set S of vertices is called t-defensive allianceif if (iv) Proposition
∀a
r-offensive 4.65:alliance. Let SHG = (G ⊆ P
SHG
(V),
=
E ⊆
⊆
P (V)) be an
(V
∀a ∈ S, |N (a) ∀a ∩ ∈
S| S,
− |N
|N
∀a ∈ S, |Nss (a) ∩ S| − |Nsss(a) ∩ (V \ S)| <s t; (a)(a) ∩ ∩(V S| \ −
S)| |N< t;(a) ∩ (V \ S)| < t;
r-offensive
r-offensive alliance.
alliance. r
(i) ∀a
(i) ∀a∈∈S, S, |N
r-regular-strong-neutrosophic |Nss(a) (a)∩∩S| S|<<22r++Super 11ififSHG SHG ==(G
Hypergraph. (G⊆⊆PP(V (V),),Then EE⊆⊆PP(V (V))))isi
∀a∀a∈∈S,S,|N|N s (a) ∩ S| − |N (a) ∩ (V \ S)| <
Proposition t;
alliance; 4.65. Let SHG = (G ⊆ ⊆ P (V ), E ⊆⊆ P (V )) be a
)) aa t-defensive (iv) aalliance
t-defensive alliance is called global-defensive
s (a) ∩ S| − |N alliance
s
s (a) ∩if(V \ following
Proposition
t Proposition
S)|alliance; < t; statements 4.65.
4.65. Let SHG Let SHG
hold; = (G P (V
= (G ⊆ P (V ), E ⊆ P (V )) be a ), E P (V )) be a
t-defensive
(iv) alliance isis called
a t-defensive called
allianceglobal-defensive
global-defensive
is called global-defensivealliance
alliance ifif tt= =0; 0; alliance r-regular-strong-neutrosophic
if t =842842
r-regular-strong-neutrosophic 0; SuperHyperGraph.
SuperHyperGraph.
Then Then following
following
following statements
statementsstatements hold;hold;
hold;
= 0; ∀a ∈ \ |N ∩
842
rr
⊆
(ii)
(ii) ∀a ∈S,V V S,
\ S, (a)|N
s (a)
s (a) < ∩ r S|S|+ > > 2SHG +
+= 1 1=(Gifif SHG
(GSHG (V=
= (G(G⊆⊆ P P (V(V ), E E⊆⊆PP(V
)) is), 2-defensive (V
set S(iv) (v) a t-defensive
aa aset
sett-defensive
Sisisof alliance
vertices isiscalled isiscalled
t-powerfulglobal-defensive
alliance if it’s ifalliance
both (i)if∀a
(i)
∀a t∈∈∈= 0;|N |N ∩∩
S, S| rr 1 if SHG ⊆ PP(V ), E P (V
)) aa set of
of vertices called t-powerful alliance ifif it’s both t-offensive alliance (i) 843 |N s(a) ∩S| S|<< 2222r ++1 1if ⊆ ⊆ P ), (VE),⊆EP⊆(VP))(Vis))2-defensive
S(v) vertices 842 2
(iv) ofcalled t-powerful
alliance alliance
called it’s
global-defensive both t-offensive it’salliance
alliance ∀aif t = 0;
(i) S, ss
2-offensive s (a) alliance; if842 SHG = (G is 2-defen
843
S vertices called t-powerful alliance both t-offensive
2-offensive
alliance;
alliance; alliance
alliance; 843
t-offensive
Salliance
and
and (t-2)-defensive
(t-2)-defensive alliance;and (t-2)-defensive alliance;
alliance; Is 2-defensive
alliance; 844
844 alliance?
(v)
(v)and
a aset (t-2)-defensive
set verticesisalliance;
Sofofvertices iscalled
calledt-powerful
t-powerfulalliance allianceif ifit’s it’s both
(iii) both ∀a
(ii)
(ii)
(ii)
(iii) ∀a ∈
∀a
∀a
t-offensive
∈∈t-offensive
∈ VS,
VS, \\S, |N
S,|N s|N
|N (a)
s (a)
alliance
(a)
s(a)
∩
alliance
∩∩∩V S|
VS| \\>> S|S|2r= r 0
r
2r+
=
844843
+01843 if
1 ififSHG SHG = == (G (G⊆⊆⊆⊆
(G PPP (V(V ),),EE ⊆EPP⊆
),),⊆E ⊆(VP)) ))(V isis)) is r-
+ if SHG
SHG
SHG==(G (G ⊆ P
(V
P(V
(V
)) aa t-powerful
t-powerful alliance
andalliance is
is
(t-2)-defensive called
called global-powerful
global-powerful
alliance; alliance
alliance if
if tt == 0;
0; (ii) ∀a ∈ V845
845\ S, |N ss
s (a) ∩ S| > 2
1 if (V ), E⊆ PP(V (V ))))isis r
(vi) (vi)aAand t-powerful
t-powerful (t-2)-defensivealliance isis
alliance called
calledglobal-powerful
alliance; global-powerful alliance if t Isif2-offensive
alliance alliance;
2-offensive
2-offensive
talliance;
= 0; alliance;
alliance;
alliance?
alliance; 2 844
844
2-offensive 845
∀S ⊆
) ∀S
)archer S,
⊆·(vi)=
S, S0;
S is
is
Department global-powerful
global-powerful
a at-powerful of Mathematics alliance
alliancealliance but
but SS
isn’t
isn’t global-powerful
global-powerful
· DrHenryGarrett@gmail.com alliance.
alliance. (iii)
Then
Then
(iii)
· Manhattan, ∀a
∀a ∈ ∈ S,
846
NY,
846 |N |N ss USA (a) ∩ ∩ \ \ (G ⊆ ⊆ PP(V EE ⊆ ⊆
allianceisiscalled global-powerful alliance (iv)if∀a t= 0;
(iii) S, (a) VV S|
S| = = 0 0 ifif SHGSHG = = (G (V),),(G PPP (V(V
(V ))))), isisE r-defensive
r-defensive
(iv) t∈∈∈ VV0; \|N\S, |N (a) ∩∩V= V \0\S| = =00if= ifSHG ⊆ P== ⊆⊆ ))Eis⊆⊆ PP(V (V))))
s 845
(vi)∀S t-powerful called global-powerful alliance (iii) if
∀a ∀a =S, sS, (a) |N∩ssV (a) \ S| ifS| SHG SHG
(G (V(G ), E ⊆PP (V(V), r-defensi
SS isis called
(vii) ∀S⊆ ⊆ S, S is global-powerful
(vii)minimal-global-powerful
0 S, S is global-powerful
alliance
alliance; alliance butbut S0 Sisn’t isn’t globalis r-defensive
global-powerful 847 alliance.
alliance; Then
alliance; 845
called minimal-global-powerful alliance; alliance; 847 846
alliance.
alliance.
alliance;
earcher (vii) powerful
(vii) S∀S
· Department is ⊆
∀S alliance.
called of Mathematics Then
⊆S,S,Sminimal-global-powerful
Henry
Sisisglobal-powerful
global-powerfulS· is called alliance
Garrett Minimal-global-powerful
· Independent
alliancebut alliance; Researcher
butS Sisn’t · Manhattan,
isn’tglobal-powerful(iv)
· (iv)
Department
global-powerful
(iv)
NY, ∀a ∈∈USA
∀a S,of
VV \\alliance.
S, alliance.
|N|NMathematics
(a)∩∩Then VVThen \\S| S| = =· 0847 846if SHG = (G ⊆ P (V ), E ⊆ P (V ·))Manhattan
0DrHenryGarrett@gmail.com
if846SHG = (G ⊆ P (V ), E ⊆ P (V )) isis r-offensiv r-offensiv
s(a)
ss
alliance;
S is called minimal-global-powerful
S is called minimal-global-powerful
(viii) minimal-global-powerful-alliance number alliance;
alliance;
of SHG is is
(iv) r-offensive
∀a ∈ V \ S,alliance.
alliance.
alliance. |Ns (a) ∩ V \ S| =847 0 if SHG = (G ⊆ P (V ), E ⊆ P (V )) is r-offe
847
Henry Garrett · Independent Researcher · Department
alliance. of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, US
(viii) minimal-global-powerful-alliance Henry number
HenryGarrett · of
Garrett· Independent SHG is Researcher
Independent Researcher · Department
· DepartmentofofMathematics Mathematics· DrHenryGarrett@gmail.com · DrHenryGarrett@gmail.com· Manhattan, · Manhattan,NY, NY,USA USA
(viii) minimal-global-powerful-alliance number of SHG is LetLet be abe an
Department
Department of Mathematics ·· DrHenryGarrett@gmail.com
of Mathematics DrHenryGarrett@gmail.com ·· Manhattan, Manhattan, |S|NY,NY,Proposition
PropositionUSA
USA 4.66. 4.66: SHG SHG==(G(G⊆ ⊆ P (V P ), (V),E⊆ E P⊆(VP))(V))
Henry Henry
Garrett Garrett · Independent Researcher
· ·Garrett
Independent Researcher r-regular-strong-neutrosophic
· Department of Mathematics
· ··Department
Proposition 4.66. ofofof Let Mathematics
SHG ==
SuperHyperGraph
(G SuperHyperGraph
⊆· PDrHenryGarrett@gmail.com
(V ),EE ⊆⊆⊆ P(V(V
which is which
))beabea a· ·Manhattan,
complete.
· Manhattan, is·NY, Then
Manhatt NY, US fo
searcher · Department of Mathematics S Henry Garrett
Henry
Henry Garrett
is a minimal-global-powerful
· Henry Independent
Garrett
· ·Independent
·Independent|S| Researcher
alliance.
Independent Researcher
Researcher
ResearcherPropositionDepartment
·Department
·Department
Proposition
· Department
Manhattan,
4.66.
4.66. of of
Let Mathematics
Mathematics
Mathematics
NY,
SHG
Mathematics
Let SHG USA =(G · ·(G ⊆PP·(V(V
⊆DrHenryGarrett@gmail.com
DrHenryGarrett@gmail.com DrHenryGarrett@gmail.com
·DrHenryGarrett@gmail.com),),E PP(V ))))be ·Manhattan,
Manhattan, ·NY,Manhat
NY, USA
USAUSA
Henry Garrett
Henry Garrett ·· Independent
S is a minimal-global-powerful alliance.
Independent Researcher statements
Researcher complete.
· Department hold;
· Department Then ofof following
Mathematics
Mathematics statements
SuperHyperGraph
SuperHyperGraph
r-regular-strong-neutrosophic SuperHyperGraph which is complete. Then following · · DrHenryGarrett@gmail.com
DrHenryGarrett@gmail.com hold;
whichwhich is is complete.
complete. ·· Manhattan,
Then Then
Manhattan, followingfollowingNY,
NY, US
USA
esearcher and
Researcher · Department
it’s denotedofof
· Department byMathematics
Γ;
·Garrett
DrHenryGarrett@gmail.com (i) · Department
statements
statements
·∀a Manhattan,
·∈ hold;
S,hold;
Manhattan, |Ns4.66. (a) NY,
∩NY, S| SHG USA
<USA O−1 + 1 (V if ),SHG ⊆aP (V· Manhattan, ), E ⊆ P (V NY,
Henry · Independent Researcher statements
Proposition hold; of MathematicsLet 848
= 2 (G
⊆P E ⊆ P= (V(G )) be )) i
and it’s denoted by Γ; (i)
Proposition
Proposition
Proposition
(i)
(i) ∀a
2-defensive ∈ S,
(i) ∀a ∈ S, |Nsalliance;
S,
r-regular-strong-neutrosophic4.66.
|N
|N4.66.
s4.66.
(a) (a) ∩Let
848 ∩LetLet
S|
s (a) ∩ S| < 2 2
s
S| SHG
SHG
< <SHG O−1
=
O−1
O−1
O−1 (G
+ +
+
⊆
=SuperHyperGraph
=(G (G 1⊆1⊆ 1P
ifPif(V
P(V(V
SHG
if ),),E
SHG
SHG ),E= E⊆⊆= ⊆
=(G
PPwhich
(G
(V
P(V
(G⊆(V ))))
⊆P⊆)) be
P(V
be
P(V
is acomplete.
be
),
(V aE
),a),E⊆E⊆P⊆ P(V(V P)) (V
Then))is)) is
is following
(ix) (ix) minimal-global-powerful-alliance-neutrosophic
minimal-global-powerful-alliance-neutrosophic number numberof SHG is of SHGhold;
2-defensive
2-defensive
2-defensive
statements 2-defensive isalliance; alliance; SuperHyperGraph
alliance;
alliance;
SuperHyperGraph
2
SuperHyperGraph which
which
which isisiscomplete.
complete.Then
complete. ThenThen following
following
following
(ix) minimal-global-powerful-alliance-neutrosophic number of(ii) statements
statements
statements
∀a is
∈ V hold;
hold;
\ hold;
S, |N (a) ∩ S| > O−1
+ 1 if SHG = (G ⊆ P (V ), isE ⊆ P (V
SHG is (ii)
(ii)
(ii)(ii) ∀a∀a
(i)
∀a ∈∈V
∀a
∈ V∈ V\\S,\S,
S,S, |N |N|N s s(a)
|N
s
(a) (a)
s(a) ∩∩∩ ∩S|S|
S| <
S| >> O−1
O−1
O−1 O−1
O−1
2O−1 + +2+ +11 1ifif SHG
SHG
1 ifif SHG
SHG =
==(G =(G(G (G⊆⊆⊆PP ⊆ P(V(V(V),(V
P ),),EEE),⊆⊆ E⊆PP⊆ P(V(V P))))
(V )) is
(V is
)) is
Σ3s∈S Σ3i=1 σi (s) (i)
(i)(i) ∀a
2-offensive
∀a ∀a ∈∈∈ S,S,S,|N |N alliance;
ss(a)
|N (a) s∩
(a) s
∩S|∩ S|S| <<< O−1 O−1
2+ 22
2
+ +11if 1 if SHG
if SHG
SHG === (G(G (G ⊆⊆⊆ PP(V P(V (V),),E),E E⊆⊆⊆ PP(V P(V (V))))))isisis
Σs∈S Σi=1 σi (s) is 2-offensive
2-offensive
2-defensive
2-offensive
2-offensive
2-defensive
2-defensive
2-defensive alliance;
alliance;s
alliance; alliance;
alliance;
alliance;
alliance;
alliance;
2 2 2
(iii) (iii)
(iii) ∀a
(iii)(ii)∀a∈
∀a ∀a ∈S,
∀a
∈ ∈S,
∈ V|NS,
S,|N |N\sss(a)
S,(a) (a)∩ |N∩∩ V\∩\\S|
∩VsVV(a) \S|S|S|
∩ = S|=0= 0ifO−1
> SHG
0
if O−1 SHGif SHG = +=(G 1(G if⊆= ⊆ P(G
SHG P(VP(V ),=
⊆ EP⊆P⊆
),E),(G (V P⊆P(V
⊆ P),
(V(V))E ))is⊆
), isEis P⊆(V P (V)) ))isis
(iii) VVV\|N
S, s(a) = 0 2ifO−1 SHG
2 + 1 if=SHG (G ⊆ (V ⊆⊆E P (V ))
(ii)
(ii)
(ii) ∀a∀a −∈−
∀a ∈1)-defensive
∈ \ \S, S, s |N |N ss(a)
|N (a) (a) ∩S| ∩S|S| > >> O−1 2 2 ++1 1ififSHG SHG == (G
= (G (G ⊆P(V P(V(V ),),E ),EE ⊆ ⊆⊆ PP(V P(V(V ))))))isisis
and it’s
it’sdenoted
denotedbyby (O (O
(O −
(O −
2-offensive -defensive
2-offensive
1)-defensive
1)-defensive
1)-defensive alliance; alliance; alliance;
salliance;
alliance;
alliance;
alliance;
and ΓsΓ . s. 2-offensive
2-offensive alliance;
alliance; 849
(iv)
(iv)
(iv)
(iii) ∀a∀a ∈∈V∈V\S,
∀a \S, S, |N |N|N 849
s (a)
(a) (a) ∩∩\V ∩VVV\\S| S|S|
\\=S|
== 00SHG ififSHG
0if SHG =
if0SHG
==(G (G ⊆⊆(V⊆P P(V (V), ),E E⊆ ⊆ ⊆PP P(V (V ))))isis is
(iv)
(iv)(iii)
(iii)
(iii)∀a
∀a(O(O ∀a∈
∀a ∈
∀a
− ∈V−VS,
∈S,\ \
S,S,
|NS,
∈1)-offensive
|N ss|N
|N |N
(a)
(a)s
s (a) s∩
s(a)
s
s∩ ∩VV∩
(a)
V \∩ \S|V
S| S| = \0=
= 0S| 0=
if if 0=
ifSHG SHG SHG=if
== (GSHG
(G (G
(G
=
⊆ ⊆⊆ (G
P P =⊆
P(V
P),
(V),
(V
(GPE ),⊆
),E(VE⊆ ⊆ E),
PPP
⊆ E(V
P(V (V⊆ (V
)))) Pisis))
),
)) (VE ))⊆isP (V )) is
is
Proposition Proposition 4.62. 4.62: Let
Let SHGSHG =
= (G
(G
Proposition 4.62. Let SHG = (G ⊆ P (V ), E ⊆ P (V )) be a strong neutrosophic ⊆⊆ P P (V),
(V ),E E⊆ P
⊆ (V))
P (V be
)) abestrong
a strong is (O
neutrosophic
(O
− − 1)-offensive
− 1)-offensive
1)-defensive alliance.
alliance.
alliance.
alliance;
(O(O (O − −1)-offensive
1)-defensive 850 alliance.
alliance; 850
(O
−(O − 1)-defensive
1)-defensive
1)-offensive alliance;
alliance;
alliance.
neutrosophic Then
SuperHyperGraph.
SuperHyperGraph. Super Hypergraph.
Thenfollowing
following Thenhold;
statements
statements following
hold; statements Proposition Proposition
Proposition ∀a ∈
4.67.
4.67.
\
Let
|N Let SHG
SHG = =\(G (G ⊆⊆PP(V(V),),EE⊆⊆PP(V(V))))bebea a
(iv) V S, (a) ∩∩ V\VSuperHyperGraph
S| 0= 0if0P if(V SHG =(G (G ⊆ P(VP (V EEa),⊆⊆E P⊆ P))))(V is))
is is
851 851
(iv) (iv)∀a
(iv) ∀a ∈ V \ 4.67.
∀a∈∈VV\ \S,S,|N S, |N Let(a)
ss (a)
|N s SHG
s (a)∩V∩ \S| =
VSuperHyperGraph
\S|S| (G
= == 0⊆if SHG
SHG ), = E == ⊆
(G(G P⊆ ⊆(VP ))
(V be
),
isPcomplete.), P (V
P(V(V isfollowing
hold;
Proposition
Proposition (O(O (O
(O −
−−hold; 4.67. 4.67:
1)-offensive
1)-offensive
− 1)-offensive
1)-offensive
Let Let SHG
alliance.
alliance.
alliance.
alliance. SHG =
SuperHyperGraph =(G(G⊆ ⊆
if SHG
P (V which
Pwhich (V),
),
whichEis⊆ ⊆ (V
Eiscomplete.
P⊆ (V),PE
complete. ))(V)) ⊆ Then
beThen Then
))
abefollowing
anfollowing
(i) if s ≥ t and a set S of vertices is t-defensive alliance, then S isr-regular-strong-neutrosophic statements
s-defensive
(i) if s ≥ t and a set S of vertices is t-defensive alliance, then S statements
is s-defensive hold; 852
statements
Proposition hold; 4.67. Let SHG
852 SuperHyperGraph
= (G P⊆SuperHyperGraph
P(V),(V ),E), E⊆ ⊆(V
which bea(Vawhich
is complete. is Then fo
alliance;
alliance; Proposition
Proposition
Proposition
(i) ifif∀a∀a∈∈S,S, 4.67.
4.67.
|N4.67. s (a)
Let
853 LetLet
∩ SHG
SHG
S| SHG
<<853 = O−1
=O−1
=(G(G
2 2
O−1 (G ⊆ +⊆⊆ P(V
+1,1, P(V
then ),E E
SHG⊆⊆ PP =P
P(V (V (V))
))))
=(G
be ))
be
⊆beaaP
P (V),),EE⊆Then ⊆PP(V(V)) ))isis
(i) If s ≥ t and a set S of vertices is t-defensive alliance, then S statements is r-regular-strong-neutrosophic
complete.
(i) hold;
(i) if ∀a ∈ S, |N Then
2-defensive
2-defensive
|N
alliance;
s
s
following
(a) ∩ S|
s (a) ∩ S| <SuperHyperGraph
alliance;
statements
SuperHyperGraph
O−1
SuperHyperGraph
2
2 + 1, then SHG
SuperHyperGraph
then
hold; SHG
which
which which
whichis= is
(G is ⊆
complete.
iscomplete.
(G complete.
⊆ P (VThen
complete. Then ),
Then E⊆ Pfollowing
following
following (V )) is
following
(ii) s-defensive
if s ≤ t and alliance; statements
statements
∈∈hold;
hold;
if s ≤ t anda asetsetS Sof of vertices is t-offensive alliance, then S is s-offensive alliance.
statements
statements
if 2-defensive hold;
hold; alliance; <> O−1
vertices is t-offensive alliance, then S(i) if∀a S, |N (a) ∩ ∩S|S|854 ++1,1,then then SHG =⊆⊆(G ⊆),),EPE⊆ (VP),(VE)) ⊆ P
854
(ii) is(ii)s-offensive
if∀a ∈VS, V\S,
alliance.
S, s|N s (a)
O−1
22 2
O−1
O−1 SHG ==(G PP(V(V ))isis
(ii) If s ≤ t and a set S of vertices
Proposition 4.63. Let SHG = (G ⊆ P (V ), E ⊆ P (V )) be a strong neutrosophic
is t-offensive alliance, then S is (i)
(ii)
(ii)
(i) If
(i) if
2-defensive
(i)(i) if
if
∀a
if
2-offensive
if ∀a
∀a
∀a ∀a
∈
∀a
∈
2-offensive
∈ V∈
∈ S, S,
\
\|N
|N
S,
|N
alliance;
alliance;
S, |N
s (a) |N
(a)
s|N
alliance; s (a)
(a) ∩s (a) ∩ S|O−1
s
∩
s s (a) ∩ S|S|
∩ ∩
S| S|S|
< < << >
O−1
>O−1
22 2
O−1
2 O−1+2++ +
1,1, 1,then
+
+1,
then 1,then
then
then
1, SHG
then
SHG
SHG
thenSHGSHGSHG==
SHG = =(G
(G=(G
(G ⊆(G
⊆⊆
=
(G
⊆ P⊆
P(G (V
P(VP P
(V
⊆ (V),
(V
),),E EE
),
P ),
⊆⊆E
(V EP
⊆ P(V
), ⊆
⊆
P
⊆P
E(V(V
P(V
))
⊆))))
(V
is))
is
P is
(V
is
))
855 2
Proposition s-offensive
SuperHyperGraph. 4.63. alliance.
Then Letfollowing
SHG =statements (G ⊆ P (Vhold; ), E ⊆ P (V )) be a strong P (V))
(iii)
neutrosophic
2-offensive
if∀a ∀a∀a
is∈2-defensive
2-defensive
2-defensive
2-defensive
2-defensive
S,S, |N
alliance;
alliance;
alliance;
alliance;
alliance; alliance;
856 ∩ V \ S| = 0, then
855
O−1 ⊆⊆PP(V(V ),),EE⊆⊆=
(ii) if ∈ V \ S, s (a) |N (a) ∩ S| > O−1 SHG then+ ==1, (G (Gthen PP(V (V)) ))⊆isisP (V ), E

SuperHyperGraph. Then following statements hold; (ii)
(iii)
(ii) (ii)
(ii) Ifif
ififif
∀a∀a ∀a
∈
∈∈∈ VVV \\S,
V |N
\\S,S,
s (a)
s
S,|N |N |N|N s∩
s(a)
(a)
V ∩∩S|
(a) \ S|
∩
S|
∩S| >
S| =
>> > 0,
O−1
O−1
2O−1
then 2+ 2+ SHG
1,1,
+ +1, 1,then
then thenSHG
SHG SHG
SHG ==SHG(G=
(G =(G (G
⊆ (G
⊆⊆ PP⊆ ⊆(V (G
P
(V(V P
), E
),(V(V),
EE ⊆⊆E
), PP(V ⊆ (V))P))(Visis))
(O − 1)-defensive (a)
alliance; S| then SHG = P⊆ ), ))⊆isP (V )) is
s ssV 856
(iii) if (O
2-offensive ∀a − ∈ S, |N
1)-defensivealliance;s (a) ∩ alliance; \ = 0, 2then2 SHG = (G ⊆ P (V ), E P (V
(i) Proposition
if s ≥ t + 2 and 4.63: Let SSHG
a set of vertices= (G ⊆isP t-defensive
(V), E ⊆ P alliance, (V)) be a then strong S is E ⊆
s-powerful
(O∀a P (V))
2-offensive
2-offensive
2-offensive
2-offensive
−∈ is
1)-defensive 2-offensive
alliance; alliance;
alliance;
alliance;
857
alliance; alliance;
if s ≥ t + 2 and
(i) alliance; a set S of vertices is t-defensive alliance,(iii) then (iv) Sif∀a ∈VS, V\ \|N S,S,|N|N s (a) ∩ V 857 \ \S|S|==0,0,then SHG ==(G ⊆⊆PP(V(V),),EE⊆⊆PP(V(V))))isis
ifis
(iv) if∀a ∀as-powerful s (a) ∩ V then SHG (G
neutrosophic SuperHyperGraph. Then following statements (iii)
(iii)if
(iii)
(iii)
(iii)
(iv) if(O (O ifIf
(O ∀a−−∈

∈
if−∀a
−
∈∈
∀a S, ∈S,S,
1)-offensive |N
S,
1)-offensive
|N |N
|N 858 ∩
sss(a)
\ S, |Nsalliance;
V1)-defensive
(a)
(a) (a)
ss(a)
s
∩
∩ V
∩∩
alliance. VV V\V\S|
alliance.
(a)
\\
S|
\S| ===
S| 0,==
0, 0,then 0,
then
0, then
then
then SHG
thenSHG SHG
SHG
SHG
∩ V858\ S| = 0, then SHG = (G ⊆ P (V ), E ⊆ P (V )) is
===
SHG (G =
(G
=(G ⊆(G
⊆
(G= ⊆PP⊆ ⊆
(V
(G
P(VP(V ),P⊆
),
(VE),E(V),
⊆
),
E P⊆E⊆ P(VP⊆E
(V
P(V ),P
(V⊆
)) E
))(VisP
)) is⊆
))
is is P (V ))
alliance;
hold; (V))
(O (O
−is (O− − 1)-defensive
1)-defensive
1)-defensive
(O1)-defensive
1)-defensive alliance;
alliance;
alliance;
alliance; alliance;
(ii) if s ≤ t and a set S of vertices is t-offensive alliance, then S is t-powerful Proposition(O alliance.
Proposition − 1)-offensive
4.68.
4.68.859 Let Letalliance.
SHG
SHG==(G (G⊆⊆PP(V(V),),EE⊆⊆PP(V(V))))bebea a
(ii) if s ≤ t and a set S of vertices is t-offensive alliance, then (iv) (iv)(iv)ifIf then SHG =⊆(G (G P
(iv)
(iv) ifif∀a∀a ∈∈∈
∀a
(iv) VVV \\S,
V \\S,S,S,|N |N |N|Ns(a)
(a)
ss(a) ∩∩SuperHyperGraph
(a) V
∩∩VV\V\S| \S| \S| =S|== 0,= 0,0, then
then
0, then
thenSHG
SHGSHG
which SHG == (G
is= (G (G
cycle. ⊆⊆ PP⊆ (V
P (V⊆
Then P),),(V
(V E ⊆(V),
⊆E
Efollowing
), E ⊆PP(V⊆P(VE(V))))(V
))isis))
is is
SProposition
is t-powerful
if ∀a ∈ alliance.
\ S, 860Let
V1)-offensive
4.68.
s
|Nalliance. (a)
SHG SuperHyperGraph
∩=V (G
859 \ S| ⊆ P=(V0,), then Ewhich⊆ PSHG (Vis= cycle.
)) be =a(G Then ),
⊆ following
P
P (V ), E ⊆ P (V
⊆ P (Vis), t-defensive
E ⊆ P (V )) alliance, −
Proposition(i) If s ≥ 4.64. t + 2 and Let aSHG set S=of(G vertices be a then r-regular-strong-neutrosophic
⊆ P(O
statements
statements
(O
(V))
(O is1)-offensive
−hold;
− (O − 1)-offensive
1)-offensive
1)-offensive
hold; alliance. alliance.
salliance.
alliance.
SuperHyperGraph which is cycle. Then following
r-regular-strong-neutrosophic SuperHyperGraph. (O − 1)-offensive alliance.
Proposition 4.64. Let SHG = (G ⊆ P (V ),Then E ⊆ following
P (V )) bestatements a (i) hold;
Proposition
Proposition
Proposition
(i)∀a∀a∈∈S,
Proposition
statements S,|N
hold; 4.68.
4.68.
|N s4.68.
(a)
4.68. ∩
s (a) ∩Let
Let
861
LetLet
S| S|SHG
SHG
< SHG
< 2 2if860
SHG =if=
SHG=(G
=(G
SHG (G ⊆⊆
(G =⊆ P=P(G
⊆ (V
P(V
(GP(V),
⊆),⊆
(V EE),P
),P E⊆⊆
(V E ⊆
(VP
),P
⊆ (V
P
E
),(VP
E ))
⊆))
(V (V⊆ be
))
P be
)) a(V
be
P(V abea))aisis2-defensive
)) 2-defensivealliance; alliance;
Curr Trends Mass Comm , 2023 r-regular-strong-neutrosophic
Propositionr-regular-strong-neutrosophic
4.68.
s
Let SHG SuperHyperGraph
SuperHyperGraph
SuperHyperGraph
= (G
SuperHyperGraph ⊆ P (V Volume
which
which
which
), E
which isisis
⊆ P2cycle.
cycle.
cycle.
is |cycle.
(V Issue
Then
)) Then
Thenbe 1following
Then |following
a 53
following
following
r-regular-strong-neutrosophic rSuperHyperGraph.
(i) if ∀a ∈ S, |Ns (a) ∩ S| < 2 + 1, then SHG = (G ⊆ P (V ), E ⊆ P (V Then following statements
(ii)
(i))) ∀a
statements
statements
(ii) is∀a∈
∀a ∈∈V S, hold;
\|N
hold; \S,S,
Vhold; s (a)
|N|N s (a)
862∩s (a)S|∩∩ < S|S| 2>> if2 SHG
861
2ififSHG SHG == (G =(G ⊆(G⊆ P⊆(VPP(V ),(V),
E),E⊆ E⊆P ⊆P(V P(V(V )))))) isisis 2-offensive
2-defensive
2-offensiveallian
statements hold; s statements hold;
2-defensive alliance; r-regular-strong-neutrosophic
alliance;
alliance; 863
SuperHyperGraph which is cycle. Then follow
(i) if ∀a ∈ S, |Ns (a) ∩ S| < 2r (i)
+ 1, then SHG = (G ⊆ P (Vstatements
⊆
), E(ii)(i)P∀a
∀a
(i)
(i) ∀a
(V
∈∈∈V∈
∀a
∀a
S,
))
S,
\
hold;
∈
|N
S,
S,|N
is ss(a)
|N
S,
|N (a)
|N s∩(a)
s (a)
s (a)∩S|
∩∩ <<S|
S|S|
∩
S|
22if
<
< >if
2862
2
SHG
ifSHG
2 SHG
if if
SHG
===
SHG(G
(G⊆⊆⊆
=
=(G
(G
PP
(G(V⊆
⊆P(V
), P
P(V),
EE ⊆⊆
),⊆
(V),E(V
PE (V
E),P⊆
P(VP
⊆))))))
(V is (V
(VPis))
2-defensive
is2-defensive
2-defensive
is
alliance;
alliance;
)) 2-defensive
is 2-offensive
alliance
allian
(iii) ∀a ∈ S, |N (a) ∩ V \ S| = 0 if SHG = (G ⊆ P (V ), E ⊆ P (V )) is 2-defensive
(ii) 2-defensive |Ns (a) ∩ S| > 2r + 1, then SHG = (G ⊆ P (V ), E ⊆ (iii)
if ∀a ∈ V \ S,alliance; P
(ii) alliance;
(V ∀a
∀a))
∀a
∈isVS,\ S,
∈∈ |Ns s (a) ∩ V \ S| = 0 if SHG = (G ⊆ P (V ), E ⊆ P (V )) is 2-defensive
s|N 864(a) ∩∩S| > 22if SHG ===
(G ⊆⊆⊆
PP(V ),),E ⊆⊆⊆PP(V ))))))
isisis
2-offensive
(ii)
(ii) ∀a ∈VV
∈ V\ \\S,
S, |N ss (a)
|N (a) S|S|
∩∩ >> 2ifif
SHG
ifSHG (G
(G P(V(V (V),E),
E P(V(V 2-offensive
2-offensive
863
alliance;
(ii) ∀a (a)|N ∩ssS| (G(G⊆⊆PP(V E ⊆⊆PP(V(V)) ))
2-offensive alliance; (i) ∀a alliance;
∈ S,
alliance; |N sS, (a) < S|
2> if 2SHG SHG== ), E is 2-offensive
is 2-defens
(iii) ∀aalliance;
alliance;
∈ S, |Ns (a)865∩ V \ S| = 0 if SHG = (G ⊆ P (V ), E ⊆ P (V )) is 2-defensive
r alliance;
(iv)∀a∀a∈∈V V\ \S,S,|N|N
(iv) (a)∩∩V V\ \S|S|==0 0ififSHG
s (a) (G⊆⊆PP(V(V),),EE⊆⊆PP(V(V))))isis2-offensive
SHG==(G 2-offensive
(ii) (O ∀a−∈1)-offensive
if2-defensive V \ S,
s
|N
alliance; alliance. ∩ S|2 > O−1
SuperHyperGraph
s (a) SuperHyperGraph 2 +
which
1, then
which
is complete.
SHG =Then
is complete.
890Then(G ⊆ following
P (V ), E ⊆ P
following 892 (V )) is
892
895 896
2-defensive
statements hold; alliance; O−1 895
(i)
(ii) if ∀a
if
statements ∀a ∈
2-offensive
Proposition S,V4.67.
∈hold; \|Nalliance;
S,s (a)
Let|N∩SHGs
S|
(a) <∩= (G
S| 2> ⊆ P
+O−1
(V
O−1
1,
), then
E
⊆
+ P
1,SHG
(V ))
then =
be a(G
SHG ⊆ P
= (V(G
891 ), ⊆E P⊆ (VP (V
), E )) is
⊆ P (V 893
893)) is
894 896 897
(ii) if ∀a ∈ V \alliance;
2-defensive
r-regular-strong-neutrosophic S, |Ns (a) SuperHyperGraph
∩ S|O−1 2 +which
> O−1 2 1, then isSHG SHG =Then
complete. (G ⊆ P (V ), E ⊆ P (V )) is
following 896
(ii)
(i) if ∀a ∈
2-offensive V
S,
if ∀a ∈hold; S, |N
\
|N S, |N
(a)
alliance;
s ∩s (a)
S| ∩
< S|
O−1>
+ 1, +
then1, then
SHG = (G ⊆ = P (G(V ⊆ ),
892
P
E (V
⊆ P), E
(V ⊆
)) P
is (V )) is 894 895
896 897
(i)2-offensive s (a) ∩ S| < 2 + 1, then SHG = (G ⊆ P (V ), E ⊆ P (V )) is
alliance; 2 2
(iii) ∀a ∈ S,
if2-offensive
statements |N s (a) ∩ V \ S| = 0, then SHG = (G ⊆ P (V ), E ⊆ P (V )) is 894895 897 897 898
∈∈VS,\ alliance;
2-defensive alliance; 893
(ii) if ∀a
2-defensive
∀a S,
|N |N
alliance; s (a)
∩ ∩ S|
\ >= O−1 + 1,SHG then SHG = (G ⊆),PE (V ⊆ ), E ⊆P ))(Vis)) is
895 896
(iii)
(iii) (Oif
(i)if if∀a − 1)-defensive
∀a∈∈ S, S, |N |Nsss(a)
s (a)
(a) ∩∩ V
alliance;
S|V< \ S| S|
O−1
2 = O−10,
2 then
+0,1,then
then SHG
SHG == =(G(G(G ⊆⊆ P⊆(V P⊆
P),(V
(VE894 ⊆E
),(V P (V⊆
Pis(V
))
P (V ))))isis 896 897
898 899
(ii)
(iii) 2-offensive
if ∀a ∈ V
S, \ alliance;
S,
|N |N
(a) (a)
∩ V∩ \S|
S| > = 0,
O−1
then + 1,
SHGthen = SHG(G ⊆ = P (G
(V ), EP ⊆ ),
P E(V ⊆)) P (V
is 898
(ii)(O − 1)-defensive
∀a ∈ V \ S,
if2-defensive alliance; s
|Ns (a) alliance;
∩ S| > 2 + 1, then SHG = (G ⊆ P (V ), E ⊆ P (V )) is
2 895 896
898
899
(O
(O ∀a−∈ 1)-defensive
2-offensive
− 1)-defensive
V \|N alliance; alliance;
|N∩alliance; ∩ V= O−1 \ S|
(iv) if S, (a)\ S| = 0, then SHG P= (G E⊆ P (V (VP), Eis ⊆ P (V ))897897is898 899
2-offensive alliance; 899
if∀a
∀a∈ ⊆(G ),⊆(V
sV 900
(iii)(ii)if ∈S, V \\S, s (a)
|N|N ∩ S| \0,S| then 1,SHG = (G (V ),(V EP⊆), ))
(iv) if ∀a ∈ V S, s (a) (a) ∩ >V 2 = + 0, then
then SHG
SHG = = ⊆P
(G ⊆ 896
P E (V⊆ )) P is(V )) is
(iii)
(iv) (Oif
if
(O −
∀a
− 1)-offensive
∈∈ S,V |N
\
1)-defensive S, (a) |N ∩ sValliance.
(a)\
alliance;∩
S| V= \
0, then
S| = SHG
0, then = (G
SHG ⊆ P = (V (G), E ⊆ ⊆ P P (V(V ),)) E is⊆ P (V )) is
900
901
(iv)
Proposition
if ∀a ∈ V \
∈ S, 4.68:
2-offensive S, |N
|Ns (a)Let
alliance; (a) ∩ V \ S| = 0, then
SHG = (G ⊆ P (V), E ⊆ P (V)) be an SHG
s∩ V \ S| = 0, then SHG = (G ⊆ P (V ), E ⊆ P (V )) is = (G ⊆ P (V ), E ⊆ P (V )) is Y. (2019). Assessment of current energy consumption in
s 898 899
(iii)(O − 1)-defensive
1)-offensive
s
alliance. 897 898 900 900
(O
(O(O −
−− 1)-offensive
1)-offensive
1)-defensive alliance;
alliance.
alliance.
alliance; 899
901
E is⊆ P (V )) is residential buildings in Jeddah, Saudi Arabia. Buildings,

901
Proposition
(iv)(iii)if if∀a ∀a∈∈VS, 4.68.
\ |N |NLet
S,s (a) V SHG
s∩(a) \∩S|V =\ 0, = = 0,⊆
S|SuperHyperGraph
(G
then P (V
then
SHG =SHG), E⊆ =
(G ⊆
P (V Pwhich
(G ),(VE ))
⊆ P Pbe
⊆ (V is
898 ),cycle.
(V a)) 899 901
900 902
Proposition
(iv) ifif(O∀a ∈∈ 4.68.
\\S,
VV4.68. |N Let (a) SHG
∩∩ VV = = (G
\\SuperHyperGraph
S| = ⊆ PP(V(V ),E EP ⊆which
PP)) (V
⊆be )) becycle.
),aaE ⊆P
=⊆0, Pthen ),SHG = (G Pis (V E⊆ PThen
(V ))
)) isisfollowing 902
−
−1)-offensive
(iv)(O
Proposition
Proposition
Then
1)-defensive
following
∀a 4.68. Let
Let
S,statements
|N alliance.
ssalliance;
SHG
SHG
(a) =
hold;(G(G
S| 0,⊆ (V
then E),
SHG ⊆ ⊆=(V (G (V⊆ ))
P abe
(V ), (V 9(7), 163.
899 900 901
900 902 902 903
(O −−1)-offensive
r-regular-strong-neutrosophic alliance. SuperHyperGraph which is cycle. Then following 901901 903 903903
(iv) (O
statements
Proposition 1)-offensive
if ∀ahold;
∈ V4.68.\ S, |N Let s (a)SHG∩ VSuperHyperGraph
alliance. SuperHyperGraph
\= S|(G =⊆ 0, Pthen SHG
(V ), E⊆ which
=P which
(G(V⊆ is))Pcycle.
is
be a), EThen
(V cycle. ⊆ PThen
900 (Vfollowing
)) isfollowing
8. Garrett,902 H. 904
(2023).
904
Neutrosophic Version of Separates
statements
statements
statements hold;
hold;
(O − hold;
Proposition 4.68.
4.68. Let
1)-offensive SHG
Letalliance. == (G (G ⊆ ⊆P P (V
(V ), E⊆
), E P
P (V
(V )) becycle.
aa 904
Proposition
(i) SHGSuperHyperGraph ⊆which ))isbe Then following Groups of Cells in Cancer's Recognition on Neutrosophic
901 902 904
(i) ∀a ∈ S, |N (a) ∩ S| < 2 if SHG = (G ⊆ P (V ), E ⊆ P (V )) is 2-defensive 902
alliance;
903
905
(i) ∀a ∈ S,
S, |N |Nsss(a)
statements
(i) ∀a ∀a ∈
Proposition hold; 4.68. (a)Let∩∩ ∩S| S|<<
SHG <2SuperHyperGraph
22if(G
ififSHGSHG
SuperHyperGraph
= ⊆ P (V== = (G
(GE(G
),
which
⊆(V
⊆which
⊆ PP PP)) (V
), is
isE
be
cycle.
),), EP⊆
cycle.
⊆
aE ⊆ Then
PP))(V
(VThen (Vis)) following
)) isis 2-defensive
following 2-defensive
2-defensive alliance;
alliance; 903
SuperHyperGraphs.
903 905
is
(i) ∈
2-defensive S, |N salliance;
(a) S| SHG ⊆ (V alliance;
902 904
905
905
statements
statements hold;
∈ VVhold;
904
∀a \ S, |Ns(a) (a)<∩∩2SuperHyperGraph which is cycle.
⊆P⊆P Then following
(ii) S| >22ifif=SHG SHG =(G (G (V (V), ))E is⊆ P (V )) 2-offensive
is 2-offensive
903 904
9. alliance;
Garrett, 906 H. 906
906(2023). The Shift Paradigm To Classify
906
(i) ∀a
∀a ∈∈ S, \\\|N s (a)|Ns∩(a) S| if > SHG (G=⊆(G =P(G (V ),⊆(V
E P 2-defensive
(ii)
(ii)
(ii)
statements
(ii)
(i) ∀a
∀a∀a∈∈S,
(i)alliance;
V hold;
VS, |N
|N
S,
S,
S, |N
ss(a)|N
(a) ∩∩ssS|
(a)
S| <
∩∩S|S|S|> >
< 22 ifif SHG
SHG
2 2if ifSHG
=SHG
= (G ⊆
(G ⊆=PP (V
⊆P
), ⊆
(V ), E
E⊆ ⊆P ), (VE
(V
P (V
P (V),),⊆
))
))
EP
E is
⊆(V
904 PP))(V
(Vis))
is⊆2-defensive
2-defensive
))2-offensive
isisalliance;
2-offensive
alliance; 905
905
905
907
alliance; Separately The Cells and Affected Cells Toward The
alliance;
alliance;
is
(ii) 2-offensive
(i) ∀a∀a∈∈VS,\ |N
alliance;
∀a ∈∈VV \\S,
S,salliance;
|Ns∩(a)
(a) S| ∩ < S|2 if>SHG2 if = SHG(G ⊆=P(G (V ),⊆EP⊆(V P ),
(VE )) ⊆is P (V )) is 2-offensive
2-defensive 905 906 907
907 907
(ii)
(ii)∀a ∀a∈ S, |N |N ss(a)
(a) ∩∩
V\S|
S| >> 22= ifif SHG
0SHG =
= (G(G = ⊆
⊆P P (V
(V ⊆ ),
), E
E ⊆
⊆ P
P (V
(V )) is
)) is 2-offensive
P2-offensive Totality 908Under Cancer's Recognition By New Multiple
906
(iii)
(iii) alliance; S, |N (a) ∩VV \ S|
S| ifSHG
SHG (G P (V ), E ⊆ (V )) is 2-defensive906
(iii)
(iii) ∀a
∀a ∈
∈
alliance;
∀a∈∈S,S,
S, |N
V \|N|N sss(a)
S,s |N (a) ∩ ∩ \S| = = 0 if
0 SHG
if = (G
= ⊆
(G P⊆ (V P ),
(VE ⊆
), E P ⊆(V P)) (Vis 2-defensive
)) is 2-defensive 907 908
(iii) (ii)∀a alliance; ∩ V∩ S|
(a)s (a) \ S|> 2=if0SHG if SHG = (G = ⊆P (G (V⊆), EP⊆ (VP),(VE))⊆is P2-offensive
(V )) is 2-defensive 906 907
907
908
908
is
(iii)
alliance;
2-defensive
alliance;
alliance;
∀a alliance;
∈ S, |N alliance;
|Ns (a) ∩∩VV \\S| S| =00ififSHG SHG = (G ⊆ P (V ), E ⊆ P (V )) is 2-defensive Definitions 909
On909 the
909
Sets Polynomials Alongside Numbers In
(iii)alliance;
907 908
(iii) ∀a∀a∈∈S, S, |Nss(a) (a) ∩ V \ S| = = 0 if SHG = (G ⊆ P (V ), E ⊆ P (V )) is is 2-defensive
2-defensive 909
The (Neutrosophic) Super Hyper Matching Theory Based

908
(iv)
908
(iv) alliance;
∀a∀a ∀a∈ ∈ V \ S, |N (a) ∩ V \ S| = 0 if SHG = (G ⊆ P (V ), E ⊆ P (V )) is 2-offensive
(iv) ∈∈VVS,\\\|N
S, |Ns∩ssV(a)
(a) ∩V
\ S| V 0\\ifS|
S| ==00=ifif(G SHG
⊆ P (V == E(G ⊆⊆P⊆ P))(V ⊆⊆
),2-defensive
E P (V )) 2-offensive
is908 2-offensive
909
(iv)(iii) alliance;
∀a alliance; S,s (a) |N ∩ = SHG SHG ),(G P(V(V ),isE P (V )) is 909
909
910
910 910
(iv) ∀a ∈ V S, |N s (a) ∩ V \ S| = 0 if SHG = (G ⊆ P (V ), E ⊆ P (V )) is 2-offensive
is 2-offensivealliance.
alliance.
alliance;
alliance.
alliance.
∀a on
909 SuperHyperGraph
911
910
and Neutrosophic SuperHyperGraph.
(iv) ∀a∈ VV \\\S,
∈∈V S, |N (a) ∩VVV \\\S|
S|= ==000if SHG==(G(G⊆⊆
ififSHG P (V ), E ⊆(V P ))(V )) 2-offensive
is 2-offensive910 911 911
∀a
(iv)alliance.
(iv) S, |N (a)∩∩
|Nsss(a) S| SHG P (V ), E ⊆P (V )) isis 2-offensive 910
10. Garrett, H. (2023). Breaking the Continuity and Uniformity

910 911
(iv)alliance.
Proposition ∀a ∈ V \4.69.
alliance.
alliance. S, |NsLet (a) ∩ V \ S|==(G
SHG 0 if⊆SHGP (V ), =E (G⊆⊆PP(V (V ))), Ebe⊆aP (V )) is 2-offensive 910 911
912
Proposition
Proposition alliance. 4.69. Let SHG
Let SHG=
SHG ==(G (G⊆
(G ⊆⊆PPP (V(V),),),
EE⊆ ⊆⊆ P
(V(V
PPis(V )))) bebe aaan a 911
911
following of Cancer In912913The Worst Case of Full Connections With
912
Proposition 4.69:Let LetSHG be
912
Proposition
Proposition
Proposition
4.69.
Proposition 4.69.
4.69.
4.69. Let
Let
Let SHG SHGSHG =
=
=(G(G
SuperHyperGraph
= ⊆⊆P PP(V
SuperHyperGraph
SuperHyperGraph
(G
(G ⊆ P),(V
⊆(V(V (V),
),EE⊆⊆
E
PEP
which
(V⊆(V))P))
which
which (V))
be be
))
cycle.
a is
is
be
acycle.Then
cycle. ThenThen following
following
911
913
912 912 913
statements hold; SuperHyperGraph which is cycle. Then following Extreme
912
Failed Super HyperClique In Cancer's Recognition
Proposition 4.69. Let SHG SuperHyperGraph = (G ⊆ SuperHyperGraph
P (V ), E ⊆ Pwhich (V )) beisawhich is cycle. 914 913
statements
statements hold;
hold; SuperHyperGraph
SuperHyperGraph which is cycle. Then following cycle. Then following
following
912
913
913 913
914
statements hold;
r-regular-strong-neutrosophic SuperHyperGraph which is cycle. Then following 914
Then
(i) if following S, |Nsstatements
(a) ∩ S| < 2,hold; Applied in (Neutrosophic) SuperHyperGraphs.
913 914
statements
statements
statements ∀a ∈hold;
hold; then SHG = (G ⊆ P (V ), E ⊆ P (V )) is 2-defensive 914 914
914 915
statements
(i) if ∀a ∀a ∈∈hold;
S, |N (a) ∩ S| < 2, then SHG == (G ⊆⊆ P(V(V(V ),E E ⊆P P(V(V )) is))
is 2-defensive
2-defensive
914
(i) ifif S, |Nsss(a)(a)∩ ∩S|S|< <2, 2,then thenSHG SHG= (G P ), ⊆E ⊆ P ))(V is Garrett,
11. 2-defensive H. (2023). Neutrosophic Failed Super Hyper Stable
(i)
(i) If
alliance;
∀a ∈ S, (G ⊆ P ), 915 915
916 915
(i)
(i) if ∀a∀a ∈ ∈S,
ifif ∀a ∈ S, |N
if
(i)(i)alliance; S, |N
|N (a)
(a) ∩
|Nssss(a) ∩
∩ S| S|
S|
S| < <
<
< 2, 2,
2, then
then
2, then
thenSHG SHG
SHG = =(G (G ⊆ ⊆P P
(V (V), E), E
⊆ ⊆
P
SHG= (G ⊆ P (V ), E ⊆ P (V )) is))2-defensive P
(V (V
)) ))
is is 2-defensive
2-defensive
is 2-defensive 915 915 915 915
alliance;
alliance; as
916 the Survivors on the Cancer's Neutrosophic Recognition
916
is 2-defensive alliance;
916
(ii) alliance;
ifalliance;
alliance;
∀a ∈ V \ S,
alliance; |Ns (a) ∩ S| > 2, then SHG = (G ⊆ P (V ), E ⊆ P (V )) is 916
916 916
917
916
(ii)
(ii)
(ii) (ii)if
(ii)
(ii)
(ii) If
if
if
if ∀a
2-offensive
ifif∀a
∀a
∀a∀a∈∈∈∈VVV \\\\S,
S,
S,|N
alliance;
S,
S,
S, |N
|N
|N
|N
|N (a)
(a)
sss(a)
(a)
s(a) ∩∩ ∩
∩∩S|
S|
∩S|S|
S|
S|
>
>>2, >>>then
2, 2,2,then
2,
2,then
then
thenthen
SHG
SHG
(ii) if ∀a ∈ V \ S, |Nsss(a) ∩ S| > 2, then SHG = (G ⊆ P (V ), E ⊆ P (V )) is
SHG
SHGSHG
==(G(G==⊆= (G
(G
⊆P(G ⊆),⊆
P⊆(V
(V PPE (V
P⊆
),(VE(V),),
P⊆E
P E
),
(VP⊆
(V
917
⊆P
E
))
))
(V
P(V
⊆
is
is
))
(V
P))
is ))Based
)) isis
(V on Uncertainty
is 917917 917
918 917
917 917 to All Modes in Neutrosophic
2-offensive alliance; SuperHyperGraphs.
is 2-offensive
(iii) if2-offensive
2-offensive
2-offensive
2-offensive
2-offensive
2-offensive
∀a ∈ S, |N alliance;
alliance;
alliance;
alliance;
alliance;
alliance;
alliance;
s (a) ∩ V \ S| = 0, then SHG = (G ⊆ P (V ), E ⊆ P (V )) is
918 918
918
918 918
919
918 918
(iii)
(iii)
(iii)
(iii)
(iii)
(iii)
(iii)
(iii) ifIf
if
ififif∀a
∀a
∀a
2-defensive
∀a
∀a
∀a ∈
∀a∈∈
∈∈S,S,
S,
S, |N
S, alliance;
|N
|N
|N
|N|Nssss(a)(a)
(a)
(a)
s(a)
s(a)
∩
∩∩∩ ∩ V
V∩
VVV \
\\V \
S|
S|
\S|\=
\S| S|
=
S|= =
0,
=0,0,
=0, 0,
then
then
then
0,thenthen
SHG
0,thenSHG
SHGSHG
=
SHG (G
=⊆
=SHG
(G =
⊆
=P=
(G (G
P (V
(V(G
(G
⊆ ⊆ ),
),⊆(V
P E⊆ P
E (V
P⊆),(V
P⊆ ),
P
),P
E(V⊆E E
(V
(V
)) ⊆
))
)) P
Pis
⊆
(V P
is
is (V
⊆(Vis
)) 12.
P)))) isGarrett, H.
920 (2023).
(Vis))919is 919 919 919 919
919 919 Extremism of the Attacked Body under
s (a) S| = then P (V ), E
is 2-defensive
2-defensive
2-defensive
2-defensive
2-defensive
2-defensive
if ∀a ∈ V \ alliance;
2-defensive
(iv) 2-defensive alliance;
alliance;
alliance;
alliance;
alliance;
alliance;
S, |Ns (a) ∩ V \ S| = 0, then SHG = (G ⊆ P (V ), E ⊆ P (V )) is
alliance; the
920
Cancer's
920
920
920
921
Circumstances
920
920 920
Where Cancer's Recognition
(iv)
(iv)
(iv)
(iv) if
(iv) Ifif
if ∀a
∀a∀a
∀a
2-offensive
if ∀a ∈ ∈
∈
∈∈V V \ S,
V \\\\S,S,|N |N
|N
alliance. (a)
(a)
ss(a)
|N
s ∩∩ V
∩∩V∩
(a) V \ \S|S|
V \V\S|\== = 0, then
0,
=0,=
S| then
0, 0,
SHG
SHG
then = (G
=
SHG ⊆
(G P
⊆ (V
= (GP ),
(V
(GP⊆ E
⊆), ⊆
E P⊆
⊆
EP
(VPP),(V
(V(V
P ))
(V
),(V is
))
P ))
E is
⊆isP(V
(V Titled
921
is ))
(Neutrosophic) SuperHyperGraphs.
isis922 is921 921921 921
921 922
(iv) ∀a ∈ VV S, |N s (a) S| then SHG = (G ⊆ ⊆ (V )) 921
(iv)
(iv) ifif ∀a
is 2-offensive ∈ V
2-offensive
2-offensive
2-offensive S, |N
S,
\alliance.
alliance.
alliance.
alliance. |N (a)∩∩VV \\S|S|==0,0,then
sss(a) thenSHG
SHG = = (G ⊆ P ), (VE),⊆ EP ⊆ P))
13. Garrett,
(V
922 ))
H. (2023). Basic Notions on (Neutrosophic) Supe-
2-offensive
2-offensive
2-offensive alliance. alliance.
alliance. 922
922 922
2-offensive alliance.
922
rHyperForcing and922
(Neutrosophic) SuperHyperModeling
Background in Cancer’s Recognitions and (Neutrosophic) SuperHyper-
ResearcherSee the seminal
· Department
· Department of scientific
Mathematics researches [1–3]. The formalization
· DrHenryGarrett@gmail.com of
· Manhattan, NY, Graphs.
USA
dent
nt Researcher
Researcher Department
· ·Department
of Mathematics···DrHenryGarrett@gmail.com
Mathematics
of Mathematics · Manhattan,
DrHenryGarrett@gmail.com NY, USA
·· Manhattan,
Manhattan, NY,
NY, USA
t Researcher
the notions
Researcher ·· Department on
Departmentofof
of
the framework
ofMathematics
of notions in SuperHyperGraphs,
· DrHenryGarrett@gmail.com · Manhattan, 14.
USA
Garrett,
NY, USA H. (2023). Neutrosophic Messy-Style SuperHyper-
Researcher
Researcher · Department Mathematics
Mathematics ·· DrHenryGarrett@gmail.com
DrHenryGarrett@gmail.com ·· Manhattan,
Manhattan, NY, USA
NY, USA
ResearcherNeutrosophic
· Department ofnotions in SuperHyperGraphs
Mathematics theory, and
· DrHenryGarrett@gmail.com Graphs
· Manhattan, NY, to Form Neutrosophic SuperHyperStable to Act on
USA
(Neutrosophic) SuperHyperGraphs theory at [5–23]. Two Cancer's Neutrosophic Recognitions in Special ViewPoints.
popular scientific research books in Scribd in the terms of high 15. Garrett, H. (2023). Neutrosophic 1-Failed SuperHyperForc-
readers, 4216 and respectively, on neutrosophic science is on ing in the SuperHyperFunction to Use Neutrosophic Supe-
[24, 25]. rHyperGraphs on Cancer’s Neutrosophic Recognition and
beyond.
References 16. Garrett, H. (2023). (Neutrosophic) SuperHyperStable on
1. Garrett, H. (2022). Neutrosophic Co-degree and Neutro- Cancer's Recognition by Well-SuperHyperModelled (Neu-
sophic Degree alongside Chromatic Numbers in the Setting trosophic) SuperHyperGraphs.
of Some Classes Related to Neutrosophic Hypergraphs. J 17. Garrett, H. (2023). Basic Notions on (Neutrosophic) Supe-
Curr Trends Comp Sci Res, 1 (1) 06, 14. rHyperForcing and (Neutrosophic) SuperHyperModeling
2. Garrett, H. (2023). Some Super Hyper Degrees and Co- in Cancer’s Recognitions and (Neutrosophic) SuperHyper-
Super Hyper Degrees on Neutrosophic Super Hyper Graphs Graphs.
and Super Hyper Graphs alongside Applications in Cancer’s 18. Garrett, H. (2023). Neutrosophic Messy-Style SuperHyper-
Treatments. J Math Techniques Comput Math, 2(1), 35-47. Graphs to Form Neutrosophic SuperHyperStable to Act on
3. Garrett, H. (2023). A Research on Cancer’s Recognition and Cancer's Neutrosophic Recognitions in Special ViewPoints.
Neutrosophic Super Hypergraph by Eulerian Super Hyper 19. Garrett, H. (2022). (Neutrosophic) SuperHyperModeling of
Cycles and Hamiltonian Sets as Hyper Covering Versus Cancer’s Recognitions Featuring (Neutrosophic) SuperHy-
Super separations. J Math Techniques Comput Math, 2(3), perDefensive SuperHyperAlliances.
136-148. 20. Garrett, H. (2022). (Neutrosophic) SuperHyperAllianc-
4. Garrett, H. (2022). Closing Numbers and Super-Closing es with SuperHyperDefensive and SuperHyperOffensive
Numbers as (Dual) Resolving and (Dual) Coloring alongside Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph
(Dual) Dominating in (Neutrosophic) n-SuperHyperGraph. with (Neutrosophic) SuperHyperModeling of Cancer’s Rec-
5. Garrett, H. (2022). 0049| (Failed) 1-Zero-Forcing Number ognitions and Related (Neutrosophic) SuperHyperClasses.
in Neutrosophic Graphs. CERN European Organization fo r 21. Garrett, H. (2022). SuperHyperGirth on SuperHyperGraph
Nuclear Research-Zenodo, Feb. and Neutrosophic SuperHyperGraph with SuperHyper-
6. Garrett, H. (2023). Extreme SuperHyperClique as the Firm Modeling of Cancer’s Recognitions.
Scheme of Confrontation under Cancer's Recognition as the 22. Garrett, H. (2022). Initial Material of Neutrosophic Pre-
Model in the Setting of (Neutrosophic) SuperHyperGraphs. liminaries to Study Some Neutrosophic Notions Based on
7. Feldman, A., Prieto, A., Knack, U., Klein, T., & Quaffs, Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic

SuperHyperGraph (NSHG).
23. Henry Garrett, “Beyond Neutrosophic Graphs”. Dr. Henry
Garrett, 2023 (doi:10.5281/zenodo.6320305).
24. Henry Garrett, “Neutrosophic Duality”. Dr. Henry Garrett,
2023 (doi:10.5281/zenodo.6677173).
Copyright: ©2023 Henry Garrett. This is an open-access article distributed

under the terms of the Creative Commons Attribution License, which
permits unrestricted use, distribution, and reproduction in any medium,
provided the original author and source are credited.
Curr Trends Mass Comm, 2023 https://opastpublishers.com Volume 2 | Issue 1 | 55

New Ideas in Recognition of Cancer and Neutrosophic SuperHyperGraph As Hyper Tool On Super Toot

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 As Hyper Tool On Super Toot

Uploaded by

Copyright:

Available Formats

Department of Mathematics · DrHenryGarrett@gmail.

com · Manhattan, NY, USA

Ideas In Recognition of Cancer And Neutrosophic Corresponding Author *

nryGarrett@gmail.com · Manhattan, NY, USA Submitted: 2023, Apr 26;

ng, Eulerian(Hamiltonian) neutrosophic path, n-Eulerian(Hamiltonian)

er, independentnumber, independent Number,

nsive alliance, Super Hypergraph.

plied in family of SuperHyperGraph and Neutrosophic SuperHyperGraph. A 18

eywords: AMS Subject Classification:

Definition 5.3, p.7),

= (iv) On 54the53525454Figure (2), the Neutrosophic SuperHyperNotion, namely,

i supp(Vi )(viii) = iV, i(i =

Figure 1. The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions

SuperHyperVertices are single valued Neutrosophic the Figure

S = (V, E) in the mentioned Neutrosophic Figures in every Neutrosophic • Onitems. 69

• On the Figure (4), there’s no empty SuperHyperEdge but

• On the Figure (5), there’s neither empty SuperHyperEdge nor

Figure 3. The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions

Henry Garrett · Independent

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

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

Figure 4. The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions

Figure 7. The Neutrosophic SuperHyperGraphs Associated to the Neutroso

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

ent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

nt Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

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

Figure 10. The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic

Curr Trends Mass Comm, 2023 Volume 2 | Issue 1 | 35

ent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

Figure 14. The Neutrosophic SuperHyperGraphs Associated to the N

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

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

Figure 15. The Neutrosophic SuperHyperGraphs Associated to the N

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

nt Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

Figure 16. The Neutrosophic SuperHyperGraphs Associated to the Neutroso

Figure 16. The Neutrosophic SuperHyperGraphs Associated to the Ne

Figure 14. The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic

Figure 17. The Neutrosophic SuperHyperGraphs Associated to the Neutroso

Figure 17. The Neutrosophic SuperHyperGraphs Associated to the Ne

Figure 15. The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic

Figure 20. The Neutrosophic SuperHyperGraphs Associated to the Neu

Figure 18. The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic

Figure 18: The Neutrosophic SuperHyperGraphs Associated to

Figure 21. The Neutrosophic SuperHyperGraphs Associated to the Neu

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

dent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA

Figure 22. The Neutrosophic SuperHyperGraphs Associated to the Neu

This . SuperHyperModel is too messy and too dense. Thus

{E(ii) There areof some subsets SuperHyperClasses as

(iv) === as intersection161 amid two given SuperHyperEdges

)  supp(E Herethe  )Neutrosophic

Example 2.15: In the Figure (23), the connected Neutrosophic

Example 2.16: In the Figure (24), the connected Neutrosophic

Example 2.18. In the Neutrosophic Figure (26), the connected Neutrosop

is called a Neutrosophic SuperHyperPath (NSHP) from Neutrosophic

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

Figure 24. a Neutrosophic SuperHyperCycle Associated to the Neutrosophic Notions

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhatta

(ix) There are a SuperVertex Vi0 ∈ VI and a SuperVertex such

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

could be characterized as follow-up items.

i supp(Vi )(viii) = iV, i(i =

) supp(E Herethe )Neutrosophic

perEdges Belong Vi , Vi+1

Mn (SHG) 4. = max{ 33 3 3

Z (CY C n ) = 0. ∀a ∈ V \ S, |Ns (a) ∩ S| > |Ns (a) ∩ (V \ S)|;

Zn (CY C nLet) =Z SHG0 (ST R n (CY C n ) = 0

a set SS isis called global-offensive ∀a

and it’s denoted by Γ; (iv) 749 sets S = {v , v , · · · .v } and S = {v , v , · · · .v