Preprint
Article

Extremism of the Attacked Body Under the Cancer's Circumstances Where Cancer's Recognition Titled (Neutrosophic) SuperHyperGraphs

Altmetrics

Downloads

83

Views

25

Comments

0

This version is not peer-reviewed

Submitted:

04 January 2023

Posted:

12 January 2023

You are already at the latest version

Alerts
Abstract
In this research, assume a SuperHyperGraph. Then a ``Failed SuperHyperStable'' $\mathcal{I}(NSHG)$ for a neutrosophic SuperHyperGraph $NSHG:(V,E)$ is the maximum cardinality of a SuperHyperSet $S$ of SuperHyperVertices such that there's a SuperHyperVertex to have a SuperHyperEdge in common. Assume a SuperHyperGraph. Then an ``$\delta-$Failed SuperHyperStable'' is a \underline{maximal} Failed SuperHyperStable of SuperHyperVertices with \underline{maximum} cardinality such that either of the following expressions hold for the (neutrosophic) cardinalities of SuperHyperNeighbors of $s\in S:$ $~|S\cap N(s)| > |S\cap (V\setminus N(s))|+\delta,~|S\cap N(s)| < |S\cap (V\setminus N(s))|+\delta.$ The first Expression, holds if $S$ is an ``$\delta-$SuperHyperOffensive''. And the second Expression, holds if $S$ is an ``$\delta-$SuperHyperDefensive''; a``neutrosophic $\delta-$Failed SuperHyperStable'' is a \underline{maximal} neutrosophic Failed SuperHyperStable of SuperHyperVertices with \underline{maximum} neutrosophic cardinality such that either of the following expressions hold for the neutrosophic cardinalities of SuperHyperNeighbors of $s\in S:$ $~|S\cap N(s)|_{neutrosophic} > |S\cap (V\setminus N(s))|_{neutrosophic}+\delta,~ |S\cap N(s)|_{neutrosophic} < |S\cap (V\setminus N(s))|_{neutrosophic}+\delta.$ The first Expression, holds if $S$ is a ``neutrosophic $\delta-$SuperHyperOffensive''. And the second Expression, holds if $S$ is a ``neutrosophic $\delta-$SuperHyperDefensive''. A basic familiarity with Extreme Failed SuperHyperClique theory, Neutrosophic Failed SuperHyperClique theory, and (Neutrosophic) SuperHyperGraphs theory are proposed.
Keywords: 
Subject: Computer Science and Mathematics  -   Computer Vision and Graphics

1. Background

Fuzzy set in Ref. [54] by Zadeh (1965), intuitionistic fuzzy sets in Ref. [41] by Atanassov (1986), a first step to a theory of the intuitionistic fuzzy graphs in Ref. [51] by Shannon and Atanassov (1994), a unifying field in logics neutrosophy: neutrosophic probability, set and logic, rehoboth in Ref. [52] by Smarandache (1998), single-valued neutrosophic sets in Ref. [53] by Wang et al. (2010), single-valued neutrosophic graphs in Ref. [45] by Broumi et al. (2016), operations on single-valued neutrosophic graphs in Ref. [37] by Akram and Shahzadi (2017), neutrosophic soft graphs in Ref. [50] by Shah and Hussain (2016), bounds on the average and minimum attendance in preference-based activity scheduling in Ref. [39] by Aronshtam and Ilani (2022), investigating the recoverable robust single machine scheduling problem under interval uncertainty in Ref. [44] by Bold and Goerigk (2022), polyhedra associated with locating-dominating, open locating-dominating and locating total-dominating sets in graphs in Ref. [38] by G. Argiroffo et al. (2022), a Vizing-type result for semi-total domination in Ref. [40] by J. Asplund et al. (2020), total domination cover rubbling in Ref. [42] by R.A. Beeler et al. (2020), on the global total k-domination number of graphs in Ref. [43] by S. Bermudo et al. (2019), maker–breaker total domination game in Ref. [46] by V. Gledel et al. (2020), a new upper bound on the total domination number in graphs with minimum degree six in Ref. [47] by M.A. Henning, and A. Yeo (2021), effect of predomination and vertex removal on the game total domination number of a graph in Ref. [48] by V. Irsic (2019), hardness results of global total k-domination problem in graphs in Ref. [49] by B.S. Panda, and P. Goyal (2021), are studied.
Look at [32,33,34,35,36] for further researches on this topic. See the seminal researches [1,2,3]. The formalization of the notions on the framework of Extreme Failed SuperHyperClique theory, Neutrosophic Failed SuperHyperClique theory, and (Neutrosophic) SuperHyperGraphs theory at [4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29]. Two popular research books in Scribd in the terms of high readers, 2638 and 3363 respectively, on neutrosophic science is on [30,31].

2. Extreme Applications in Cancer’s Extreme Recognition toward Extreme Failed SuperHyperStable

For giving the sense about the visions on this even, the extreme Failed SuperHyperStable is applied in the general forms and the arrangements of the internal venues. Regarding the generality, the next section is introduced.
Definition 2.1.
((neutrosophic) Failed SuperHyperStable).
Assume a SuperHyperGraph. Then
( i )
a Failed SuperHyperStable I ( N S H G ) for a SuperHyperGraph N S H G : ( V , E ) is the maximum cardinality of a SuperHyperSet S of SuperHyperVertices such that there’s a SuperHyperVertex to have a SuperHyperEdge in common;
( i i )
a neutrosophic Failed SuperHyperStable  I n ( N S H G ) for a neutrosophic SuperHyperGraph N S H G : ( V , E ) is the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet S of neutrosophic SuperHyperVertices such that there’s a neutrosophic SuperHyperVertex to have a neutrosophic SuperHyperEdge in common.
Definition 2.2.
((neutrosophic) δ Failed SuperHyperStable).
Assume a SuperHyperGraph. Then
( i )
an δ Failed SuperHyperStable is a maximal of SuperHyperVertices with a maximum cardinality such that either of the following expressions hold for the (neutrosophic) cardinalities of SuperHyperNeighbors of s S :
| S N ( s ) | > | S ( V N ( s ) ) | + δ ;
| S N ( s ) | < | S ( V N ( s ) ) | + δ .
The Expression (2.1), holds if S is an  δ SuperHyperOffensive. And the Expression (2.2), holds if S is an δ SuperHyperDefensive;
( i i )
a neutrosophic δ Failed SuperHyperStable  is a maximal neutrosophic of SuperHyperVertices with maximum neutrosophic cardinality such that either of the following expressions hold for the neutrosophic cardinalities of SuperHyperNeighbors of s S :
| S N ( s ) | n e u t r o s o p h i c > | S ( V N ( s ) ) | n e u t r o s o p h i c + δ ;
| S N ( s ) | n e u t r o s o p h i c < | S ( V N ( s ) ) | n e u t r o s o p h i c + δ .
The Expression (2.3), holds if S is a neutrosophic δ SuperHyperOffensive. And the Expression (2.4), holds if S is a neutrosophic δ SuperHyperDefensive.

3. General Extreme Results for Cancer’s Extreme Recognition toward Extreme Failed SuperHyperStable

For the Failed SuperHyperStable, and the neutrosophic Failed SuperHyperStable, some general results are introduced.
Remark 3.1.
Let remind that the neutrosophic Failed SuperHyperStable is “redefined” on the positions of the alphabets.
Corollary 3.2.
Assume Failed SuperHyperStable. Then
N e u t r o s o p h i c F a i l e d S u p e r H y p e r S t a b l e = { t h e F a i l e d S u p e r H y p e r S t a b l e o f t h e S u p e r H y p e r V e r t i c e s | max | S u p e r H y p e r D e f e n s i v e S u p e r H y p e r S t a b l e | n e u t r o s o p h i c c a r d i n a l i t y a m i d t h o s e F a i l e d S u p e r H y p e r S t a b l e . }
Where σ i is the unary operation on the SuperHyperVertices of the SuperHyperGraph to assign the determinacy, the indeterminacy and the neutrality, for i = 1 , 2 , 3 , respectively.
Corollary 3.3.
Assume a neutrosophic SuperHyperGraph on the same identical letter of the alphabet. Then the notion of neutrosophic Failed SuperHyperStable and Failed SuperHyperStable coincide.
Corollary 3.4.
Assume a neutrosophic SuperHyperGraph on the same identical letter of the alphabet. Then a consecutive sequence of the SuperHyperVertices is a neutrosophic Failed SuperHyperStable if and only if it’s a Failed SuperHyperStable.
Corollary 3.5.
Assume a neutrosophic SuperHyperGraph on the same identical letter of the alphabet. Then a consecutive sequence of the SuperHyperVertices is a strongest SuperHyperCycle if and only if it’s a longest SuperHyperCycle.
Corollary 3.6.
Assume SuperHyperClasses of a neutrosophic SuperHyperGraph on the same identical letter of the alphabet. Then its neutrosophic Failed SuperHyperStable is its Failed SuperHyperStable and reversely.
Corollary 3.7.
Assume a neutrosophic SuperHyperPath(-/SuperHyperCycle, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel) on the same identical letter of the alphabet. Then its neutrosophic Failed SuperHyperStable is its Failed SuperHyperStable and reversely.
Corollary 3.8.
Assume a neutrosophic SuperHyperGraph. Then its neutrosophic Failed SuperHyperStable isn’t well-defined if and only if its Failed SuperHyperStable isn’t well-defined.
Corollary 3.9.
Assume SuperHyperClasses of a neutrosophic SuperHyperGraph. Then its neutrosophic Failed SuperHyperStable isn’t well-defined if and only if its Failed SuperHyperStable isn’t well-defined.
Corollary 3.10.
Assume a neutrosophic SuperHyperPath(-/SuperHyperCycle, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). Then its neutrosophic Failed SuperHyperStable isn’t well-defined if and only if its Failed SuperHyperStable isn’t well-defined.
Corollary 3.11.
Assume a neutrosophic SuperHyperGraph. Then its neutrosophic Failed SuperHyperStable is well-defined if and only if its Failed SuperHyperStable is well-defined.
Corollary 3.12.
Assume SuperHyperClasses of a neutrosophic SuperHyperGraph. Then its neutrosophic Failed SuperHyperStable is well-defined if and only if its Failed SuperHyperStable is well-defined.
Corollary 3.13.
Assume a neutrosophic SuperHyperPath(-/SuperHyperCycle, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). Then its neutrosophic Failed SuperHyperStable is well-defined if and only if its Failed SuperHyperStable is well-defined.
Proposition 3.14.
Let N S H G : ( V , E ) be a neutrosophic SuperHyperGraph. Then V is
( i ) :
the dual SuperHyperDefensive Failed SuperHyperStable;
( i i ) :
the strong dual SuperHyperDefensive Failed SuperHyperStable;
( i i i ) :
the connected dual SuperHyperDefensive Failed SuperHyperStable;
( i v ) :
the δ-dual SuperHyperDefensive Failed SuperHyperStable;
( v ) :
the strong δ-dual SuperHyperDefensive Failed SuperHyperStable;
( v i ) :
the connected δ-dual SuperHyperDefensive Failed SuperHyperStable.
Proposition 3.15.
Let N T G : ( V , E , σ , μ ) be a neutrosophic SuperHyperGraph. Then ∅ is
( i ) :
the SuperHyperDefensive Failed SuperHyperStable;
( i i ) :
the strong SuperHyperDefensive Failed SuperHyperStable;
( i i i ) :
the connected defensive SuperHyperDefensive Failed SuperHyperStable;
( i v ) :
the δ-SuperHyperDefensive Failed SuperHyperStable;
( v ) :
the strong δ-SuperHyperDefensive Failed SuperHyperStable;
( v i ) :
the connected δ-SuperHyperDefensive Failed SuperHyperStable.
Proposition 3.16
Let N S H G : ( V , E ) be a neutrosophic SuperHyperGraph. Then an independent SuperHyperSet is
( i ) :
the SuperHyperDefensive Failed SuperHyperStable;
( i i ) :
the strong SuperHyperDefensive Failed SuperHyperStable;
( i i i ) :
the connected SuperHyperDefensive Failed SuperHyperStable;
( i v ) :
the δ-SuperHyperDefensive Failed SuperHyperStable;
( v ) :
the strong δ-SuperHyperDefensive Failed SuperHyperStable;
( v i ) :
the connected δ-SuperHyperDefensive Failed SuperHyperStable.
Proposition 3.17.
Let N S H G : ( V , E ) be a neutrosophic SuperHyperUniform SuperHyperGraph which is a SuperHyperCycle/SuperHyperPath. Then V is a maximal
( i ) :
SuperHyperDefensive Failed SuperHyperStable;
( i i ) :
strong SuperHyperDefensive Failed SuperHyperStable;
( i i i ) :
connected SuperHyperDefensive Failed SuperHyperStable;
( i v ) :
O ( N S H G ) -SuperHyperDefensive Failed SuperHyperStable;
( v ) :
strong O ( N S H G ) -SuperHyperDefensive Failed SuperHyperStable;
( v i ) :
connected O ( N S H G ) -SuperHyperDefensive Failed SuperHyperStable;
Where the exterior SuperHyperVertices and the interior SuperHyperVertices coincide.
Proposition 3.18.
Let N S H G : ( V , E ) be a neutrosophic SuperHyperGraph which is a SuperHyperUniform SuperHyperWheel. Then V is a maximal
( i ) :
dual SuperHyperDefensive Failed SuperHyperStable;
( i i ) :
strong dual SuperHyperDefensive Failed SuperHyperStable;
( i i i ) :
connected dual SuperHyperDefensive Failed SuperHyperStable;
( i v ) :
O ( N S H G ) -dual SuperHyperDefensive Failed SuperHyperStable;
( v ) :
strong O ( N S H G ) -dual SuperHyperDefensive Failed SuperHyperStable;
( v i ) :
connected O ( N S H G ) -dual SuperHyperDefensive Failed SuperHyperStable;
Where the exterior SuperHyperVertices and the interior SuperHyperVertices coincide.
Proposition 3.19.
Let N S H G : ( V , E ) be a neutrosophic SuperHyperUniform SuperHyperGraph which is a SuperHyperCycle/SuperHyperPath. Then the number of
( i ) :
the Failed SuperHyperStable;
( i i ) :
the Failed SuperHyperStable;
( i i i ) :
the connected Failed SuperHyperStable;
( i v ) :
the O ( N S H G ) -Failed SuperHyperStable;
( v ) :
the strong O ( N S H G ) -Failed SuperHyperStable;
( v i ) :
the connected O ( N S H G ) -Failed SuperHyperStable.
is one and it’s only V . Where the exterior SuperHyperVertices and the interior SuperHyperVertices coincide.
Proposition 3.20.
Let N S H G : ( V , E ) be a neutrosophic SuperHyperUniform SuperHyperGraph which is a SuperHyperWheel. Then the number of
( i ) :
the dual Failed SuperHyperStable;
( i i ) :
the dual Failed SuperHyperStable;
( i i i ) :
the dual connected Failed SuperHyperStable;
( i v ) :
the dual O ( N S H G ) -Failed SuperHyperStable;
( v ) :
the strong dual O ( N S H G ) -Failed SuperHyperStable;
( v i ) :
the connected dual O ( N S H G ) -Failed SuperHyperStable.
is one and it’s only V . Where the exterior SuperHyperVertices and the interior SuperHyperVertices coincide.
Proposition 3.21.
Let N S H G : ( V , E ) be a neutrosophic SuperHyperUniform SuperHyperGraph which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperComplete SuperHyperMultipartite. Then a SuperHyperSet contains [the SuperHyperCenter and] the half of multiplying r with the number of all the SuperHyperEdges plus one of all the SuperHyperVertices is a
( i ) :
dual SuperHyperDefensive Failed SuperHyperStable;
( i i ) :
strong dual SuperHyperDefensive Failed SuperHyperStable;
( i i i ) :
connected dual SuperHyperDefensive Failed SuperHyperStable;
( i v ) :
O ( N S H G ) 2 + 1 -dual SuperHyperDefensive Failed SuperHyperStable;
( v ) :
strong O ( N S H G ) 2 + 1 -dual SuperHyperDefensive Failed SuperHyperStable;
( v i ) :
connected O ( N S H G ) 2 + 1 -dual SuperHyperDefensive Failed SuperHyperStable.
Proposition 3.22.
Let N S H G : ( V , E ) be a neutrosophic SuperHyperUniform SuperHyperGraph which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperComplete SuperHyperMultipartite. Then a SuperHyperSet contains the half of multiplying r with the number of all the SuperHyperEdges plus one of all the SuperHyperVertices in the biggest SuperHyperPart is a
( i ) :
SuperHyperDefensive Failed SuperHyperStable;
( i i ) :
strong SuperHyperDefensive Failed SuperHyperStable;
( i i i ) :
connected SuperHyperDefensive Failed SuperHyperStable;
( i v ) :
δ-SuperHyperDefensive Failed SuperHyperStable;
( v ) :
strong δ-SuperHyperDefensive Failed SuperHyperStable;
( v i ) :
connected δ-SuperHyperDefensive Failed SuperHyperStable.
Proposition 3.23.
Let N S H G : ( V , E ) be a neutrosophic SuperHyperUniform SuperHyperGraph which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperComplete SuperHyperMultipartite. Then Then the number of
( i ) :
dual SuperHyperDefensive Failed SuperHyperStable;
( i i ) :
strong dual SuperHyperDefensive Failed SuperHyperStable;
( i i i ) :
connected dual SuperHyperDefensive Failed SuperHyperStable;
( i v ) :
O ( N S H G ) 2 + 1 -dual SuperHyperDefensive Failed SuperHyperStable;
( v ) :
strong O ( N S H G ) 2 + 1 -dual SuperHyperDefensive Failed SuperHyperStable;
( v i ) :
connected O ( N S H G ) 2 + 1 -dual SuperHyperDefensive Failed SuperHyperStable.
is one and it’s only S , a SuperHyperSet contains [the SuperHyperCenter and] the half of multiplying r with the number of all the SuperHyperEdges plus one of all the SuperHyperVertices. Where the exterior SuperHyperVertices and the interior SuperHyperVertices coincide.
Proposition 3.24.
Let N S H G : ( V , E ) be a neutrosophic SuperHyperGraph. The number of connected component is | V S | if there’s a SuperHyperSet which is a dual
( i ) :
SuperHyperDefensive Failed SuperHyperStable;
( i i ) :
strong SuperHyperDefensive Failed SuperHyperStable;
( i i i ) :
connected SuperHyperDefensive Failed SuperHyperStable;
( i v ) :
Failed SuperHyperStable;
( v ) :
strong 1-SuperHyperDefensive Failed SuperHyperStable;
( v i ) :
connected 1-SuperHyperDefensive Failed SuperHyperStable.
Proposition 3.25.
Let N S H G : ( V , E ) be a neutrosophic SuperHyperGraph. Then the number is at most O ( N S H G ) and the neutrosophic number is at most O n ( N S H G ) .
Proposition 3.26.
Let N S H G : ( V , E ) be a neutrosophic SuperHyperGraph. Then the number is at most O ( N S H G ) and the neutrosophic number is at most O n ( N S H G ) .
Proposition 3.27.
Let N S H G : ( V , E ) be a neutrosophic SuperHyperGraph which is SuperHyperComplete. The number is O ( N S H G : ( V , E ) ) 2 + 1 and the neutrosophic number is min Σ v { v 1 , v 2 , , v t } t > O ( N S H G : ( V , E ) ) 2 V σ ( v ) , in the setting of dual
( i ) :
SuperHyperDefensive Failed SuperHyperStable;
( i i ) :
strong SuperHyperDefensive Failed SuperHyperStable;
( i i i ) :
connected SuperHyperDefensive Failed SuperHyperStable;
( i v ) :
( O ( N S H G : ( V , E ) ) 2 + 1 ) -SuperHyperDefensive Failed SuperHyperStable;
( v ) :
strong ( O ( N S H G : ( V , E ) ) 2 + 1 ) -SuperHyperDefensive Failed SuperHyperStable;
( v i ) :
connected ( O ( N S H G : ( V , E ) ) 2 + 1 ) -SuperHyperDefensive Failed SuperHyperStable.
Proposition 3.28.
Let N S H G : ( V , E ) be a neutrosophic SuperHyperGraph which is . The number is 0 and the neutrosophic number is 0 , for an independent SuperHyperSet in the setting of dual
( i ) :
SuperHyperDefensive Failed SuperHyperStable;
( i i ) :
strong SuperHyperDefensive Failed SuperHyperStable;
( i i i ) :
connected SuperHyperDefensive Failed SuperHyperStable;
( i v ) :
0-SuperHyperDefensive Failed SuperHyperStable;
( v ) :
strong 0-SuperHyperDefensive Failed SuperHyperStable;
( v i ) :
connected 0-SuperHyperDefensive Failed SuperHyperStable.
Proposition 3.29.
Let N S H G : ( V , E ) be a neutrosophic SuperHyperGraph which is SuperHyperComplete. Then there’s no independent SuperHyperSet.
Proposition 3.30.
Let N S H G : ( V , E ) be a neutrosophic SuperHyperGraph which is SuperHyperCycle/SuperHyperPath/SuperHyperWheel. The number is O ( N S H G : ( V , E ) ) and the neutrosophic number is O n ( N S H G : ( V , E ) ) , in the setting of a dual
( i ) :
SuperHyperDefensive Failed SuperHyperStable;
( i i ) :
strong SuperHyperDefensive Failed SuperHyperStable;
( i i i ) :
connected SuperHyperDefensive Failed SuperHyperStable;
( i v ) :
O ( N S H G : ( V , E ) ) -SuperHyperDefensive Failed SuperHyperStable;
( v ) :
strong O ( N S H G : ( V , E ) ) -SuperHyperDefensive Failed SuperHyperStable;
( v i ) :
connected O ( N S H G : ( V , E ) ) -SuperHyperDefensive Failed SuperHyperStable.
Proposition 3.31.
Let N S H G : ( V , E ) be a neutrosophic SuperHyperGraph which is SuperHyperStar/complete SuperHyperBipartite/complete SuperHyperMultiPartite. The number is O ( N S H G : ( V , E ) ) 2 + 1 and the neutrosophic number is min Σ v { v 1 , v 2 , , v t } t > O ( N S H G : ( V , E ) ) 2 V σ ( v ) , in the setting of a dual
( i ) :
SuperHyperDefensive Failed SuperHyperStable;
( i i ) :
strong SuperHyperDefensive Failed SuperHyperStable;
( i i i ) :
connected SuperHyperDefensive Failed SuperHyperStable;
( i v ) :
( O ( N S H G : ( V , E ) ) 2 + 1 ) -SuperHyperDefensive Failed SuperHyperStable;
( v ) :
strong ( O ( N S H G : ( V , E ) ) 2 + 1 ) -SuperHyperDefensive Failed SuperHyperStable;
( v i ) :
connected ( O ( N S H G : ( V , E ) ) 2 + 1 ) -SuperHyperDefensive Failed SuperHyperStable.
Proposition 3.32.
Let NSHF : ( V , E ) be a SuperHyperFamily of the N S H G s : ( V , E ) neutrosophic SuperHyperGraphs which are from one-type SuperHyperClass which the result is obtained for the individuals. Then the results also hold for the SuperHyperFamily NSHF : ( V , E ) of these specific SuperHyperClasses of the neutrosophic SuperHyperGraphs.
Proposition 3.33.
Let N S H G : ( V , E ) be a strong neutrosophic SuperHyperGraph. If S is a dual SuperHyperDefensive Failed SuperHyperStable, then v V S , x S such that
( i )
v N s ( x ) ;
( i i )
v x E .
Proposition 3.34.
Let N S H G : ( V , E ) be a strong neutrosophic SuperHyperGraph. If S is a dual SuperHyperDefensive Failed SuperHyperStable, then
( i )
S is SuperHyperDominating set;
( i i )
there’s S S such that | S | is SuperHyperChromatic number.
Proposition 3.35.
Let N S H G : ( V , E ) be a strong neutrosophic SuperHyperGraph. Then
( i )
Γ O ;
( i i )
Γ s O n .
Proposition 3.36.
Let N S H G : ( V , E ) be a strong neutrosophic SuperHyperGraph which is connected. Then
( i )
Γ O 1 ;
( i i )
Γ s O n Σ i = 1 3 σ i ( x ) .
Proposition 3.37.
Let N S H G : ( V , E ) be an odd SuperHyperPath. Then
( i )
the SuperHyperSet S = { v 2 , v 4 , , v n 1 } is a dual SuperHyperDefensive Failed SuperHyperStable;
( i i )
Γ = n 2 + 1 and corresponded SuperHyperSet is S = { v 2 , v 4 , , v n 1 } ;
( i i i )
Γ s = min { Σ s S = { v 2 , v 4 , , v n 1 } Σ i = 1 3 σ i ( s ) , Σ s S = { v 1 , v 3 , , v n 1 } Σ i = 1 3 σ i ( s ) } ;
( i v )
the SuperHyperSets S 1 = { v 2 , v 4 , , v n 1 } and S 2 = { v 1 , v 3 , , v n 1 } are only a dual Failed SuperHyperStable.
Proposition 3.38.
Let N S H G : ( V , E ) be an even SuperHyperPath. Then
( i )
the set S = { v 2 , v 4 , . v n } is a dual SuperHyperDefensive Failed SuperHyperStable;
( i i )
Γ = n 2 and corresponded SuperHyperSets are { v 2 , v 4 , . v n } and { v 1 , v 3 , . v n 1 } ;
( i i i )
Γ s = min { Σ s S = { v 2 , v 4 , , v n } Σ i = 1 3 σ i ( s ) , Σ s S = { v 1 , v 3 , . v n 1 } Σ i = 1 3 σ i ( s ) } ;
( i v )
the SuperHyperSets S 1 = { v 2 , v 4 , . v n } and S 2 = { v 1 , v 3 , . v n 1 } are only dual Failed SuperHyperStable.
Proposition 3.39.
Let N S H G : ( V , E ) be an even SuperHyperCycle. Then
( i )
the SuperHyperSet S = { v 2 , v 4 , , v n } is a dual SuperHyperDefensive Failed SuperHyperStable;
( i i )
Γ = n 2 and corresponded SuperHyperSets are { v 2 , v 4 , , v n } and { v 1 , v 3 , , v n 1 } ;
( i i i )
Γ s = min { Σ s S = { v 2 , v 4 , , v n } σ ( s ) , Σ s S = { v 1 , v 3 , , v n 1 } σ ( s ) } ;
( i v )
the SuperHyperSets S 1 = { v 2 , v 4 , , v n } and S 2 = { v 1 , v 3 , , v n 1 } are only dual Failed SuperHyperStable.
Proposition 3.40.
Let N S H G : ( V , E ) be an odd SuperHyperCycle. Then
( i )
the SuperHyperSet S = { v 2 , v 4 , , v n 1 } is a dual SuperHyperDefensive Failed SuperHyperStable;
( i i )
Γ = n 2 + 1 and corresponded SuperHyperSet is S = { v 2 , v 4 , , v n 1 } ;
( i i i )
Γ s = min { Σ s S = { v 2 , v 4 , . v n 1 } Σ i = 1 3 σ i ( s ) , Σ s S = { v 1 , v 3 , . v n 1 } Σ i = 1 3 σ i ( s ) } ;
( i v )
the SuperHyperSets S 1 = { v 2 , v 4 , . v n 1 } and S 2 = { v 1 , v 3 , . v n 1 } are only dual Failed SuperHyperStable.
Proposition 3.41.
Let N S H G : ( V , E ) be SuperHyperStar. Then
( i )
the SuperHyperSet S = { c } is a dual maximal Failed SuperHyperStable;
( i i )
Γ = 1 ;
( i i i )
Γ s = Σ i = 1 3 σ i ( c ) ;
( i v )
the SuperHyperSets S = { c } and S S are only dual Failed SuperHyperStable.
Proposition 3.42.
Let N S H G : ( V , E ) be SuperHyperWheel. Then
( i )
the SuperHyperSet S = { v 1 , v 3 } { v 6 , v 9 , v i + 6 , , v n } i = 1 6 + 3 ( i 1 ) n is a dual maximal SuperHyperDefensive Failed SuperHyperStable;
( i i )
Γ = | { v 1 , v 3 } { v 6 , v 9 , v i + 6 , , v n } i = 1 6 + 3 ( i 1 ) n | ;
( i i i )
Γ s = Σ { v 1 , v 3 } { v 6 , v 9 , v i + 6 , , v n } i = 1 6 + 3 ( i 1 ) n Σ i = 1 3 σ i ( s ) ;
( i v )
the SuperHyperSet { v 1 , v 3 } { v 6 , v 9 , v i + 6 , , v n } i = 1 6 + 3 ( i 1 ) n is only a dual maximal SuperHyperDefensive Failed SuperHyperStable.
Proposition 3.43.
Let N S H G : ( V , E ) be an odd SuperHyperComplete. Then
( i )
the SuperHyperSet S = { v i } i = 1 n 2 + 1 is a dual SuperHyperDefensive Failed SuperHyperStable;
( i i )
Γ = n 2 + 1 ;
( i i i )
Γ s = min { Σ s S Σ i = 1 3 σ i ( s ) } S = { v i } i = 1 n 2 + 1 ;
( i v )
the SuperHyperSet S = { v i } i = 1 n 2 + 1 is only a dual SuperHyperDefensive Failed SuperHyperStable.
Proposition 3.44.
Let N S H G : ( V , E ) be an even SuperHyperComplete. Then
( i )
the SuperHyperSet S = { v i } i = 1 n 2 is a dual SuperHyperDefensive Failed SuperHyperStable;
( i i )
Γ = n 2 ;
( i i i )
Γ s = min { Σ s S Σ i = 1 3 σ i ( s ) } S = { v i } i = 1 n 2 ;
( i v )
the SuperHyperSet S = { v i } i = 1 n 2 is only a dual maximal SuperHyperDefensive Failed SuperHyperStable.
Proposition 3.45.
Let NSHF : ( V , E ) be a m-SuperHyperFamily of neutrosophic SuperHyperStars with common neutrosophic SuperHyperVertex SuperHyperSet. Then
( i )
the SuperHyperSet S = { c 1 , c 2 , , c m } is a dual SuperHyperDefensive Failed SuperHyperStable for NSHF ;
( i i )
Γ = m for NSHF : ( V , E ) ;
( i i i )
Γ s = Σ i = 1 m Σ j = 1 3 σ j ( c i ) for NSHF : ( V , E ) ;
( i v )
the SuperHyperSets S = { c 1 , c 2 , , c m } and S S are only dual Failed SuperHyperStable for NSHF : ( V , E ) .
Proposition 3.46.
Let NSHF : ( V , E ) be an m-SuperHyperFamily of odd SuperHyperComplete SuperHyperGraphs with common neutrosophic SuperHyperVertex SuperHyperSet. Then
( i )
the SuperHyperSet S = { v i } i = 1 n 2 + 1 is a dual maximal SuperHyperDefensive Failed SuperHyperStable for NSHF ;
( i i )
Γ = n 2 + 1 for NSHF : ( V , E ) ;
( i i i )
Γ s = min { Σ s S Σ i = 1 3 σ i ( s ) } S = { v i } i = 1 n 2 + 1 for NSHF : ( V , E ) ;
( i v )
the SuperHyperSets S = { v i } i = 1 n 2 + 1 are only a dual maximal Failed SuperHyperStable for NSHF : ( V , E ) .
Proposition 3.47.
Let NSHF : ( V , E ) be a m-SuperHyperFamily of even SuperHyperComplete SuperHyperGraphs with common neutrosophic SuperHyperVertex SuperHyperSet. Then
( i )
the SuperHyperSet S = { v i } i = 1 n 2 is a dual SuperHyperDefensive Failed SuperHyperStable for NSHF : ( V , E ) ;
( i i )
Γ = n 2 for NSHF : ( V , E ) ;
( i i i )
Γ s = min { Σ s S Σ i = 1 3 σ i ( s ) } S = { v i } i = 1 n 2 for NSHF : ( V , E ) ;
( i v )
the SuperHyperSets S = { v i } i = 1 n 2 are only dual maximal Failed SuperHyperStable for NSHF : ( V , E ) .
Proposition 3.48.
Let N S H G : ( V , E ) be a strong neutrosophic SuperHyperGraph. Then following statements hold;
( i )
if s t and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive Failed SuperHyperStable, then S is an s-SuperHyperDefensive Failed SuperHyperStable;
( i i )
if s t and a SuperHyperSet S of SuperHyperVertices is a dual t-SuperHyperDefensive Failed SuperHyperStable, then S is a dual s-SuperHyperDefensive Failed SuperHyperStable.
Proposition 3.49.
Let N S H G : ( V , E ) be a strong neutrosophic SuperHyperGraph. Then following statements hold;
( i )
if s t + 2 and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive Failed SuperHyperStable, then S is an s-SuperHyperPowerful Failed SuperHyperStable;
( i i )
if s t and a SuperHyperSet S of SuperHyperVertices is a dual t-SuperHyperDefensive Failed SuperHyperStable, then S is a dual s-SuperHyperPowerful Failed SuperHyperStable.
Proposition 3.50.
Let N S H G : ( V , E ) be a[an] [r-]SuperHyperUniform-strong-neutrosophic SuperHyperGraph. Then following statements hold;
( i )
if a S , | N s ( a ) S | < r 2 + 1 , then N S H G : ( V , E ) is an 2-SuperHyperDefensive Failed SuperHyperStable;
( i i )
if a V S , | N s ( a ) S | > r 2 + 1 , then N S H G : ( V , E ) is a dual 2-SuperHyperDefensive Failed SuperHyperStable;
( i i i )
if a S , | N s ( a ) V S | = 0 , then N S H G : ( V , E ) is an r-SuperHyperDefensive Failed SuperHyperStable;
( i v )
if a V S , | N s ( a ) V S | = 0 , then N S H G : ( V , E ) is a dual r-SuperHyperDefensive Failed SuperHyperStable.
Proposition 3.51.
Let N S H G : ( V , E ) is a[an] [r-]SuperHyperUniform-strong-neutrosophic SuperHyperGraph. Then following statements hold;
( i )
a S , | N s ( a ) S | < r 2 + 1 if N S H G : ( V , E ) is an 2-SuperHyperDefensive Failed SuperHyperStable;
( i i )
a V S , | N s ( a ) S | > r 2 + 1 if N S H G : ( V , E ) is a dual 2-SuperHyperDefensive Failed SuperHyperStable;
( i i i )
a S , | N s ( a ) V S | = 0 if N S H G : ( V , E ) is an r-SuperHyperDefensive Failed SuperHyperStable;
( i v )
a V S , | N s ( a ) V S | = 0 if N S H G : ( V , E ) is a dual r-SuperHyperDefensive Failed SuperHyperStable.
Proposition 3.52.
Let N S H G : ( V , E ) is a[an] [r-]SuperHyperUniform-strong-neutrosophic SuperHyperGraph which is a SuperHyperComplete. Then following statements hold;
( i )
a S , | N s ( a ) S | < O 1 2 + 1 if N S H G : ( V , E ) is an 2-SuperHyperDefensive Failed SuperHyperStable;
( i i )
a V S , | N s ( a ) S | > O 1 2 + 1 if N S H G : ( V , E ) is a dual 2-SuperHyperDefensive Failed SuperHyperStable;
( i i i )
a S , | N s ( a ) V S | = 0 if N S H G : ( V , E ) is an ( O 1 ) -SuperHyperDefensive Failed SuperHyperStable;
( i v )
a V S , | N s ( a ) V S | = 0 if N S H G : ( V , E ) is a dual ( O 1 ) -SuperHyperDefensive Failed SuperHyperStable.
Proposition 3.53.
Let N S H G : ( V , E ) is a[an] [r-]SuperHyperUniform-strong-neutrosophic SuperHyperGraph which is a SuperHyperComplete. Then following statements hold;
( i )
if a S , | N s ( a ) S | < O 1 2 + 1 , then N S H G : ( V , E ) is an 2-SuperHyperDefensive Failed SuperHyperStable;
( i i )
if a V S , | N s ( a ) S | > O 1 2 + 1 , then N S H G : ( V , E ) is a dual 2-SuperHyperDefensive Failed SuperHyperStable;
( i i i )
if a S , | N s ( a ) V S | = 0 , then N S H G : ( V , E ) is ( O 1 ) -SuperHyperDefensive Failed SuperHyperStable;
( i v )
if a V S , | N s ( a ) V S | = 0 , then N S H G : ( V , E ) is a dual ( O 1 ) -SuperHyperDefensive Failed SuperHyperStable.
Proposition 3.54.
Let N S H G : ( V , E ) is a[an] [r-]SuperHyperUniform-strong-neutrosophic SuperHyperGraph which is SuperHyperCycle. Then following statements hold;
( i )
a S , | N s ( a ) S | < 2 if N S H G : ( V , E ) ) is an 2-SuperHyperDefensive Failed SuperHyperStable;
( i i )
a V S , | N s ( a ) S | > 2 if N S H G : ( V , E ) is a dual 2-SuperHyperDefensive Failed SuperHyperStable;
( i i i )
a S , | N s ( a ) V S | = 0 if N S H G : ( V , E ) is an 2-SuperHyperDefensive Failed SuperHyperStable;
( i v )
a V S , | N s ( a ) V S | = 0 if N S H G : ( V , E ) is a dual 2-SuperHyperDefensive Failed SuperHyperStable.
Proposition 3.55.
Let N S H G : ( V , E ) is a[an] [r-]SuperHyperUniform-strong-neutrosophic SuperHyperGraph which is SuperHyperCycle. Then following statements hold;
( i )
if a S , | N s ( a ) S | < 2 , then N S H G : ( V , E ) is an 2-SuperHyperDefensive Failed SuperHyperStable;
( i i )
if a V S , | N s ( a ) S | > 2 , then N S H G : ( V , E ) is a dual 2-SuperHyperDefensive Failed SuperHyperStable;
( i i i )
if a S , | N s ( a ) V S | = 0 , then N S H G : ( V , E ) is an 2-SuperHyperDefensive Failed SuperHyperStable;
( i v )
if a V S , | N s ( a ) V S | = 0 , then N S H G : ( V , E ) is a dual 2-SuperHyperDefensive Failed SuperHyperStable.

4. Motivation and Contributions

In this research, there are some ideas in the featured frameworks of motivations. I try to bring the motivations in the narrative ways.
Question 4.1.
How to define the SuperHyperNotions and to do research on them to find the “ amount of Failed SuperHyperStable” of either individual of cells or the groups of cells based on the fixed cell or the fixed group of cells, extensively, the “amount of Failed SuperHyperStable” based on the fixed groups of cells or the fixed groups of group of cells?
Question 4.2.
What are the best descriptions for the “Cancer’s Recognitions” in terms of these messy and dense SuperHyperModels where embedded notions are illustrated?
It’s motivation to find notions to use in this dense model is titled “SuperHyperGraphs”. Thus it motivates us to define different types of “ Failed SuperHyperStable” and “neutrosophic Failed SuperHyperStable” on “SuperHyperGraph” and “Neutrosophic SuperHyperGraph”.

5. Extreme Failed SuperHyperStable in Some Extreme Situations for Cancer without any names or any specific classes

Example 5.1.
  • On the Figure 1, the SuperHyperNotion, namely, Failed SuperHyperStable, is up. E 1 and E 3 Failed SuperHyperStable are some empty SuperHyperEdges but E 2 is a loop SuperHyperEdge and E 4 is a SuperHyperEdge. Thus in the terms of SuperHyperNeighbor, there’s only one SuperHyperEdge, namely, E 4 . The SuperHyperVertex, V 3 is isolated means that there’s no SuperHyperEdge has it as an endpoint. Thus SuperHyperVertex, V 3 , is contained in every given Failed SuperHyperStable. All the following SuperHyperSet of SuperHyperVertices is the simple type-SuperHyperSet of the Failed SuperHyperStable. { V 3 , V 1 , V 2 } . The SuperHyperSet of SuperHyperVertices, { V 3 , V 1 , V 2 } , is the simple type-SuperHyperSet of the Failed SuperHyperStable. The SuperHyperSet of the SuperHyperVertices, { V 3 , V 1 , V 2 } , is corresponded to a Failed SuperHyperStable I ( N S H G ) for a SuperHyperGraph N S H G : ( V , E ) is the maximum cardinality of a SuperHyperSet S of SuperHyperVertices such that there’s a SuperHyperVertex to have a SuperHyperEdge in common. There’re only three SuperHyperVertices inside the intended SuperHyperSet. Thus the non-obvious Failed SuperHyperStable is up. The obvious simple type-SuperHyperSet of the Failed SuperHyperStable is a SuperHyperSet includes only one SuperHyperVertex. But the SuperHyperSet of SuperHyperVertices, { V 3 , V 1 , V 2 } , doesn’t have less than two SuperHyperVertices inside the intended SuperHyperSet. Thus the non-obvious simple type-SuperHyperSet of the Failed SuperHyperStable is up. To sum them up, the SuperHyperSet of SuperHyperVertices, { V 3 , V 1 , V 2 } , is the non-obvious simple type-SuperHyperSet of the Failed SuperHyperStable. Since the SuperHyperSet of the SuperHyperVertices, { V 3 , V 1 , V 2 } , is corresponded to a Failed SuperHyperStable I ( N S H G ) for a SuperHyperGraph N S H G : ( V , E ) is the SuperHyperSet S of SuperHyperVertices such that there’s a SuperHyperVertex to have a SuperHyperEdge in common and they are corresponded to a Failed SuperHyperStable. Since it’sthe maximum cardinality of a SuperHyperSet S of SuperHyperVertices such that there’s a SuperHyperVertex to have a SuperHyperEdge in common. There aren’t only less than two SuperHyperVertices inside the intended SuperHyperSet, { V 3 , V 1 , V 2 } . Thus the non-obvious Failed SuperHyperStable, { V 3 , V 1 , V 2 } , is up. The obvious simple type-SuperHyperSet of the Failed SuperHyperStable, { V 3 , V 1 , V 2 } , is the SuperHyperSet, { V 3 , V 1 , V 2 } , doesn’t include only less than two SuperHyperVertices in a connected neutrosophic SuperHyperGraph N S H G : ( V , E ) . It’s interesting to mention that the only obvious simple type-SuperHyperSet of the neutrosophic Failed SuperHyperStable amid those obvious simple type-SuperHyperSets of the Failed SuperHyperStable, is only { V 3 , V 4 , V 2 } .
  • On the Figure 2, the SuperHyperNotion, namely, Failed SuperHyperStable, is up. E 1 and E 3 Failed SuperHyperStable are some empty SuperHyperEdges but E 2 is a loop SuperHyperEdge and E 4 is a SuperHyperEdge. Thus in the terms of SuperHyperNeighbor, there’s only one SuperHyperEdge, namely, E 4 . The SuperHyperVertex, V 3 is isolated means that there’s no SuperHyperEdge has it as an endpoint. Thus SuperHyperVertex, V 3 , is contained in every given Failed SuperHyperStable. All the following SuperHyperSet of SuperHyperVertices is the simple type-SuperHyperSet of the Failed SuperHyperStable. { V 3 , V 1 , V 2 } . The SuperHyperSet of SuperHyperVertices, { V 3 , V 1 , V 2 } , is the simple type-SuperHyperSet of the Failed SuperHyperStable. The SuperHyperSet of the SuperHyperVertices, { V 3 , V 1 , V 2 } , is corresponded to a Failed SuperHyperStable I ( N S H G ) for a SuperHyperGraph N S H G : ( V , E ) is the maximum cardinality of a SuperHyperSet S of SuperHyperVertices such that there’s a SuperHyperVertex to have a SuperHyperEdge in common. There’re only three SuperHyperVertices inside the intended SuperHyperSet. Thus the non-obvious Failed SuperHyperStable is up. The obvious simple type-SuperHyperSet of the Failed SuperHyperStable is a SuperHyperSet includes only one SuperHyperVertex. But the SuperHyperSet of SuperHyperVertices, { V 3 , V 1 , V 2 } , doesn’t have less than two SuperHyperVertices inside the intended SuperHyperSet. Thus the non-obvious simple type-SuperHyperSet of the Failed SuperHyperStable is up. To sum them up, the SuperHyperSet of SuperHyperVertices, { V 3 , V 1 , V 2 } , is the non-obvious simple type-SuperHyperSet of the Failed SuperHyperStable. Since the SuperHyperSet of the SuperHyperVertices, { V 3 , V 1 , V 2 } , is corresponded to a Failed SuperHyperStable I ( N S H G ) for a SuperHyperGraph N S H G : ( V , E ) is the SuperHyperSet S of SuperHyperVertices such that there’s a SuperHyperVertex to have a SuperHyperEdge in common and they are corresponded to a Failed SuperHyperStable. Since it’sthe maximum cardinality of a SuperHyperSet S of SuperHyperVertices such that there’s a SuperHyperVertex to have a SuperHyperEdge in common. There aren’t only less than two SuperHyperVertices inside the intended SuperHyperSet, { V 3 , V 1 , V 2 } . Thus the non-obvious Failed SuperHyperStable, { V 3 , V 1 , V 2 } , is up. The obvious simple type-SuperHyperSet of the Failed SuperHyperStable, { V 3 , V 1 , V 2 } , is the SuperHyperSet, { V 3 , V 1 , V 2 } , doesn’t include only less than two SuperHyperVertices in a connected neutrosophic SuperHyperGraph N S H G : ( V , E ) . It’s interesting to mention that the only obvious simple type-SuperHyperSet of the neutrosophic Failed SuperHyperStable amid those obvious simple type-SuperHyperSets of the Failed SuperHyperStable, is only { V 3 , V 4 , V 1 } .
  • On the Figure 3, the SuperHyperNotion, namely, Failed SuperHyperStable, is up. E 1 , E 2 and E 3 are some empty SuperHyperEdges but E 4 is a SuperHyperEdge. Thus in the terms of SuperHyperNeighbor, there’s only one SuperHyperEdge, namely, E 4 . The SuperHyperSet of SuperHyperVertices, { V 3 , V 2 } , is the simple type-SuperHyperSet of the Failed SuperHyperStable. The SuperHyperSet of the SuperHyperVertices, { V 3 , V 2 } , is the maximum cardinality of a SuperHyperSet S of SuperHyperVertices such that there’s a SuperHyperVertex to have a SuperHyperEdge in common. There’re only two SuperHyperVertex inside the intended SuperHyperSet. Thus the non-obvious Failed SuperHyperStable is up. The obvious simple type-SuperHyperSet of the Failed SuperHyperStable is a SuperHyperSet includes only one SuperHyperVertex in a connected neutrosophic SuperHyperGraph N S H G : ( V , E ) . But the SuperHyperSet of SuperHyperVertices, { V 3 , V 2 } , doesn’t have less than two SuperHyperVertex inside the intended SuperHyperSet. Thus the non-obvious simple type-SuperHyperSet of the Failed SuperHyperStable is up. To sum them up, the SuperHyperSet of SuperHyperVertices, { V 3 , V 2 } , is the non-obvious simple type-SuperHyperSet of the Failed SuperHyperStable. Since the SuperHyperSet of the SuperHyperVertices, { V 3 , V 2 } , is corresponded to a Failed SuperHyperStable I ( N S H G ) for a SuperHyperGraph N S H G : ( V , E ) is the SuperHyperSet S of SuperHyperVertices such that there’s a SuperHyperVertex to have a SuperHyperEdge in common and they are Failed SuperHyperStable. Since it’sthe maximum cardinality of a SuperHyperSet S of SuperHyperVertices such that there’s a SuperHyperVertex to have a SuperHyperEdge in common. There aren’t only less than two SuperHyperVertices inside the intended SuperHyperSets, { V 3 , V 2 } , Thus the non-obvious Failed SuperHyperStable, { V 3 , V 2 } , is up. The obvious simple type-SuperHyperSet of the Failed SuperHyperStable, { V 3 , V 2 } , is the SuperHyperSet, { V 3 , V 2 } , don’t include only more than one SuperHyperVertex in a connected neutrosophic SuperHyperGraph N S H G : ( V , E ) . It’s interesting to mention that the only obvious simple type-SuperHyperSets of the neutrosophic Failed SuperHyperStable amid those obvious simple type-SuperHyperSets of the Failed SuperHyperStable, is only { V 3 , V 2 } .
  • On the Figure 4, the SuperHyperNotion, namely, a Failed SuperHyperStable, is up. There’s no empty SuperHyperEdge but E 3 are a loop SuperHyperEdge on { F } , and there are some SuperHyperEdges, namely, E 1 on { H , V 1 , V 3 } , alongside E 2 on { O , H , V 4 , V 3 } and E 4 , E 5 on { N , V 1 , V 2 , V 3 , F } . The SuperHyperSet of SuperHyperVertices, { V 2 , V 4 , V 1 } , is the simple type-SuperHyperSet of the Failed SuperHyperStable. The SuperHyperSet of the SuperHyperVertices, { V 2 , V 4 , V 1 } , is the maximum cardinality of a SuperHyperSet S of SuperHyperVertices such that there’s a SuperHyperVertex to have a SuperHyperEdge in common. There’re only three SuperHyperVertices inside the intended SuperHyperSet. Thus the non-obvious Failed SuperHyperStable is up. The obvious simple type-SuperHyperSet of the Failed SuperHyperStable is a SuperHyperSet includes only one SuperHyperVertex since it doesn’t form any kind of pairs titled to SuperHyperNeighbors in a connected neutrosophic SuperHyperGraph N S H G : ( V , E ) . But the SuperHyperSet of SuperHyperVertices, { V 2 , V 4 , V 1 } , doesn’t have less than two SuperHyperVertices inside the intended SuperHyperSet. Thus the non-obvious simple type-SuperHyperSet of the Failed SuperHyperStable is up. To sum them up, the SuperHyperSet of SuperHyperVertices, { V 2 , V 4 , V 1 } , is the non-obvious simple type-SuperHyperSet of the Failed SuperHyperStable. Since the SuperHyperSet of the SuperHyperVertices, { V 2 , V 4 , V 1 } , is the SuperHyperSet Ss of a SuperHyperSet S of SuperHyperVertices such that there’s a SuperHyperVertex to have a SuperHyperEdge in common and it’s Failed SuperHyperStable. Since it’sthe maximum cardinality of a SuperHyperSet S of SuperHyperVertices such that there’s a SuperHyperVertex to have a SuperHyperEdge in common. There aren’t only less than two SuperHyperVertices inside the intended SuperHyperSet, { V 2 , V 4 , V 1 } . Thus the non-obvious Failed SuperHyperStable, { V 2 , V 4 , V 1 } , is up. The obvious simple type-SuperHyperSet of the Failed SuperHyperStable, { V 2 , V 4 , V 1 } , is a SuperHyperSet, { V 2 , V 4 , V 1 } , doesn’t include only less than two SuperHyperVertices in a connected neutrosophic SuperHyperGraph N S H G : ( V , E ) .
  • On the Figure 5, the SuperHyperNotion, namely, Failed SuperHyperStable, is up. There’s neither empty SuperHyperEdge nor loop SuperHyperEdge. The SuperHyperSet of SuperHyperVertices, { V 2 , V 6 , V 9 , V 15 , V 10 } , is the simple type-SuperHyperSet of the Failed SuperHyperStable. The SuperHyperSet of the SuperHyperVertices, { V 2 , V 6 , V 9 , V 15 , V 10 } , is the maximum cardinality of a SuperHyperSet S of SuperHyperVertices such that there’s a SuperHyperVertex to have a SuperHyperEdge in common. There’re not only one SuperHyperVertex inside the intended SuperHyperSet. Thus the non-obvious Failed SuperHyperStable is up. The obvious simple type-SuperHyperSet of the Failed SuperHyperStable is a SuperHyperSet includes only one SuperHyperVertex thus it doesn’t form any kind of pairs titled to SuperHyperNeighbors in a connected neutrosophic SuperHyperGraph N S H G : ( V , E ) . But the SuperHyperSet of SuperHyperVertices, { V 2 , V 6 , V 9 , V 15 , V 10 } , doesn’t have less than two SuperHyperVertices inside the intended SuperHyperSet. Thus the non-obvious simple type-SuperHyperSet of the Failed SuperHyperStable is up. To sum them up, the SuperHyperSet of SuperHyperVertices, { V 2 , V 6 , V 9 , V 15 , V 10 } , is the non-obvious simple type-SuperHyperSet of the Failed SuperHyperStable. Since the SuperHyperSet of the SuperHyperVertices, { V 2 , V 6 , V 9 , V 15 , V 10 } , is the SuperHyperSet Ss of SuperHyperVertices such that there’s a SuperHyperVertex to have a SuperHyperEdge in common. and it’s Failed SuperHyperStable. Since it’sthe maximum cardinality of SuperHyperVertices such that there’s a SuperHyperVertex to have a SuperHyperEdge in common. There aren’t only less than two SuperHyperVertices inside the intended SuperHyperSet, { V 2 , V 6 , V 9 , V 15 , V 10 } . Thus the non-obvious Failed SuperHyperStable, { V 2 , V 6 , V 9 , V 15 , V 10 } , is up. The obvious simple type-SuperHyperSet of the Failed SuperHyperStable, { V 2 , V 6 , V 9 , V 15 , V 10 } , is a SuperHyperSet, { V 2 , V 6 , V 9 , V 15 , V 10 } , doesn’t include only less than two SuperHyperVertices in a connected neutrosophic SuperHyperGraph N S H G : ( V , E ) is mentioned as the SuperHyperModel N S H G : ( V , E ) in the Figure 5.
  • On the Figure 6, the SuperHyperNotion, namely, Failed SuperHyperStable, is up. There’s neither empty SuperHyperEdge nor loop SuperHyperEdge. The SuperHyperSet of SuperHyperVertices,
    { V 2 , V 4 , V 6 , V 8 , V 10 , V 22 , V 19 , V 17 , V 15 , V 13 , V 11 } ,
    is the simple type-SuperHyperSet of the Failed SuperHyperStable. The SuperHyperSet of the SuperHyperVertices,
    { V 2 , V 4 , V 6 , V 8 , V 10 , V 22 , V 19 , V 17 , V 15 , V 13 , V 11 } ,
    is the maximum cardinality of SuperHyperVertices such that there’s a SuperHyperVertex to have a SuperHyperEdge in common. There’re not only one SuperHyperVertex inside the intended SuperHyperSet. Thus the non-obvious Failed SuperHyperStable is up. The obvious simple type-SuperHyperSet of the Failed SuperHyperStable is a SuperHyperSet includes only one SuperHyperVertex doesn’t form any kind of pairs titled to SuperHyperNeighbors in a connected neutrosophic SuperHyperGraph N S H G : ( V , E ) . But the SuperHyperSet of SuperHyperVertices,
    { V 2 , V 4 , V 6 , V 8 , V 10 , V 22 , V 19 , V 17 , V 15 , V 13 , V 11 } ,
    doesn’t have less than two SuperHyperVertices inside the intended SuperHyperSet. Thus the non-obvious simple type-SuperHyperSet of the Failed SuperHyperStable is up. To sum them up, the SuperHyperSet of SuperHyperVertices,
    { V 2 , V 4 , V 6 , V 8 , V 10 , V 22 , V 19 , V 17 , V 15 , V 13 , V 11 } ,
    is the non-obvious simple type-SuperHyperSet of the Failed SuperHyperStable. Since the SuperHyperSet of the SuperHyperVertices,
    { V 2 , V 4 , V 6 , V 8 , V 10 , V 22 , V 19 , V 17 , V 15 , V 13 , V 11 } ,
    is the SuperHyperSet Ss of SuperHyperVertices such that there’s a SuperHyperVertex to have a SuperHyperEdge in common and it’s a Failed SuperHyperStable. Since it’s the maximum cardinality of SuperHyperVertices such that there’s a SuperHyperVertex to have a SuperHyperEdge in common. There aren’t only less than two SuperHyperVertices inside the intended SuperHyperSet,
    { V 2 , V 4 , V 6 , V 8 , V 10 , V 22 , V 19 , V 17 , V 15 , V 13 , V 11 } ,
    Thus the non-obvious Failed SuperHyperStable,
    { V 2 , V 4 , V 6 , V 8 , V 10 , V 22 , V 19 , V 17 , V 15 , V 13 , V 11 } ,
    is up. The obvious simple type-SuperHyperSet of the Failed SuperHyperStable,
    { V 2 , V 4 , V 6 , V 8 , V 10 , V 22 , V 19 , V 17 , V 15 , V 13 , V 11 } ,
    is a SuperHyperSet,
    { V 2 , V 4 , V 6 , V 8 , V 10 , V 22 , V 19 , V 17 , V 15 , V 13 , V 11 } ,
    doesn’t include only less than two SuperHyperVertices in a connected neutrosophic SuperHyperGraph N S H G : ( V , E ) with a illustrated SuperHyperModeling of the Figure 6.
  • On the Figure 7, the SuperHyperNotion, namely, Failed SuperHyperStable, is up. There’s neither empty SuperHyperEdge nor loop SuperHyperEdge. The SuperHyperSet of SuperHyperVertices, { V 2 , V 5 , V 9 , V 7 } , is the simple type-SuperHyperSet of the Failed SuperHyperStable. The SuperHyperSet of the SuperHyperVertices, { V 2 , V 5 , V 9 , V 7 } , is the maximum cardinality of a SuperHyperSet S of SuperHyperVertices such that there’s a SuperHyperVertex to have a SuperHyperEdge in common. There’s only one SuperHyperVertex inside the intended SuperHyperSet. Thus the non-obvious Failed SuperHyperStable is up. The obvious simple type-SuperHyperSet of the Failed SuperHyperStable is a SuperHyperSet includes only one SuperHyperVertex doesn’t form any kind of pairs are titled to SuperHyperNeighbors in a connected neutrosophic SuperHyperGraph N S H G : ( V , E ) . But the SuperHyperSet of SuperHyperVertices, { V 2 , V 5 , V 9 , V 7 } , doesn’t have less than two SuperHyperVertices inside the intended SuperHyperSet. Thus the non-obvious simple type-SuperHyperSet of the Failed SuperHyperStable is up. To sum them up, the SuperHyperSet of SuperHyperVertices, { V 2 , V 5 , V 9 , V 7 } , is the non-obvious simple type-SuperHyperSet of the Failed SuperHyperStable. Since the SuperHyperSet of the SuperHyperVertices, { V 2 , V 5 , V 9 , V 7 } , is the SuperHyperSet Ss of SuperHyperVertices such that there’s a SuperHyperVertex to have a SuperHyperEdge in common and it’s a Failed SuperHyperStable. Since it’sthe maximum cardinality of a SuperHyperSet S of SuperHyperVertices such that there’s a SuperHyperVertex to have a SuperHyperEdge in common. There aren’t only less than two SuperHyperVertices inside the intended SuperHyperSet, { V 2 , V 5 , V 9 , V 7 } . Thus the non-obvious Failed SuperHyperStable, { V 2 , V 5 , V 9 , V 7 } , is up. The obvious simple type-SuperHyperSet of the Failed SuperHyperStable, { V 2 , V 5 , V 9 , V 7 } , is a SuperHyperSet, { V 2 , V 5 , V 9 , V 7 } , doesn’t include only less than two SuperHyperVertices in a connected neutrosophic SuperHyperGraph N S H G : ( V , E ) of depicted SuperHyperModel as the Figure 7.
  • On the Figure 8, the SuperHyperNotion, namely, Failed SuperHyperStable, is up. There’s neither empty SuperHyperEdge nor loop SuperHyperEdge. The SuperHyperSet of SuperHyperVertices, { V 2 , V 5 , V 9 , V 7 } , is the simple type-SuperHyperSet of the Failed SuperHyperStable. The SuperHyperSet of the SuperHyperVertices, { V 2 , V 5 , V 9 , V 7 } , is the maximum cardinality of a SuperHyperSet S of SuperHyperVertices such that there’s a SuperHyperVertex to have a SuperHyperEdge in common. There’s only one SuperHyperVertex inside the intended SuperHyperSet. Thus the non-obvious Failed SuperHyperStable is up. The obvious simple type-SuperHyperSet of the Failed SuperHyperStable is a SuperHyperSet includes only one SuperHyperVertex doesn’t form any kind of pairs are titled to SuperHyperNeighbors in a connected neutrosophic SuperHyperGraph N S H G : ( V , E ) . But the SuperHyperSet of SuperHyperVertices, { V 2 , V 5 , V 9 , V 7 } , doesn’t have less than two SuperHyperVertices inside the intended SuperHyperSet. Thus the non-obvious simple type-SuperHyperSet of the Failed SuperHyperStable is up. To sum them up, the SuperHyperSet of SuperHyperVertices, { V 2 , V 5 , V 9 , V 7 } , is the non-obvious simple type-SuperHyperSet of the Failed SuperHyperStable. Since the SuperHyperSet of the SuperHyperVertices, { V 2 , V 5 , V 9 , V 7 } , is the SuperHyperSet Ss of SuperHyperVertices such that there’s a SuperHyperVertex to have a SuperHyperEdge in common and it’s a Failed SuperHyperStable. Since it’sthe maximum cardinality of a SuperHyperSet S of SuperHyperVertices such that there’s a SuperHyperVertex to have a SuperHyperEdge in common. There aren’t only less than two SuperHyperVertices inside the intended SuperHyperSet, { V 2 , V 5 , V 9 , V 7 } . Thus the non-obvious Failed SuperHyperStable, { V 2 , V 5 , V 9 , V 7 } , is up. The obvious simple type-SuperHyperSet of the Failed SuperHyperStable, { V 2 , V 5 , V 9 , V 7 } , is a SuperHyperSet, { V 2 , V 5 , V 9 , V 7 } , doesn’t include only less than two SuperHyperVertices in a connected neutrosophic SuperHyperGraph N S H G : ( V , E ) of dense SuperHyperModel as the Figure 8.
  • On the Figure 9, the SuperHyperNotion, namely, Failed SuperHyperStable, is up. There’s neither empty SuperHyperEdge nor loop SuperHyperEdge. The SuperHyperSet of SuperHyperVertices,
    { V 2 , V 4 , V 6 , V 8 , V 10 , V 22 , V 19 , V 17 , V 15 , V 13 , V 11 } ,
    is the simple type-SuperHyperSet of the Failed SuperHyperStable. The SuperHyperSet of the SuperHyperVertices,
    { V 2 , V 4 , V 6 , V 8 , V 10 , V 22 , V 19 , V 17 , V 15 , V 13 , V 11 } ,
    is the maximum cardinality of SuperHyperVertices such that there’s a SuperHyperVertex to have a SuperHyperEdge in common. There’re only only SuperHyperVertex inside the intended SuperHyperSet. Thus the non-obvious Failed SuperHyperStable is up. The obvious simple type-SuperHyperSet of the Failed SuperHyperStable is a SuperHyperSet includes only one SuperHyperVertex doesn’t form any kind of pairs titled to SuperHyperNeighbors in a connected neutrosophic SuperHyperGraph N S H G : ( V , E ) . But the SuperHyperSet of SuperHyperVertices,
    { V 2 , V 4 , V 6 , V 8 , V 10 , V 22 , V 19 , V 17 , V 15 , V 13 , V 11 } ,
    doesn’t have less than two SuperHyperVertices inside the intended SuperHyperSet. Thus the non-obvious simple type-SuperHyperSet of the Failed SuperHyperStable is up. To sum them up, the SuperHyperSet of SuperHyperVertices,
    { V 2 , V 4 , V 6 , V 8 , V 10 , V 22 , V 19 , V 17 , V 15 , V 13 , V 11 } ,
    is the non-obvious simple type-SuperHyperSet of the Failed SuperHyperStable. Since the SuperHyperSet of the SuperHyperVertices,
    { V 2 , V 4 , V 6 , V 8 , V 10 , V 22 , V 19 , V 17 , V 15 , V 13 , V 11 } ,
    is the SuperHyperSet Ss of SuperHyperVertices such that there’s a SuperHyperVertex to have a SuperHyperEdge in common and it’s a Failed SuperHyperStable. Since it’s the maximum cardinality of SuperHyperVertices such that there’s a SuperHyperVertex to have a SuperHyperEdge in common. There aren’t only less than two SuperHyperVertices inside the intended SuperHyperSet,
    { V 2 , V 4 , V 6 , V 8 , V 10 , V 22 , V 19 , V 17 , V 15 , V 13 , V 11 } .
    Thus the non-obvious Failed SuperHyperStable,
    { V 2 , V 4 , V 6 , V 8 , V 10 , V 22 , V 19 , V 17 , V 15 , V 13 , V 11 } ,
    is up. The obvious simple type-SuperHyperSet of the Failed SuperHyperStable,
    { V 2 , V 4 , V 6 , V 8 , V 10 , V 22 , V 19 , V 17 , V 15 , V 13 , V 11 } ,
    is a SuperHyperSet,
    { V 2 , V 4 , V 6 , V 8 , V 10 , V 22 , V 19 , V 17 , V 15 , V 13 , V 11 } ,
    doesn’t include only less than two SuperHyperVertices in a connected neutrosophic SuperHyperGraph N S H G : ( V , E ) with a messy SuperHyperModeling of the Figure 9.
  • On the Figure 10, the SuperHyperNotion, namely, Failed SuperHyperStable, is up. There’s neither empty SuperHyperEdge nor loop SuperHyperEdge. The SuperHyperSet of SuperHyperVertices, { V 2 , V 5 , V 8 , V 7 } , is the simple type-SuperHyperSet of the Failed SuperHyperStable. The SuperHyperSet of the SuperHyperVertices, { V 2 , V 5 , V 8 , V 7 } , is the maximum cardinality of a SuperHyperSet S of SuperHyperVertices such that there’s a SuperHyperVertex to have a SuperHyperEdge in common. There’re not only two SuperHyperVertices inside the intended SuperHyperSet. Thus the non-obvious Failed SuperHyperStable is up. The obvious simple type-SuperHyperSet of the Failed SuperHyperStable is a SuperHyperSet includes only two SuperHyperVertices doesn’t form any kind of pairs are titled to SuperHyperNeighbors in a connected neutrosophic SuperHyperGraph N S H G : ( V , E ) . But the SuperHyperSet of SuperHyperVertices, { V 2 , V 5 , V 8 } , doesn’t have less than two SuperHyperVertices inside the intended SuperHyperSet. Thus the non-obvious simple type-SuperHyperSet of the Failed SuperHyperStable is up. To sum them up, the SuperHyperSet of SuperHyperVertices, { V 2 , V 5 , V 8 , V 7 } , is the non-obvious simple type-SuperHyperSet of the Failed SuperHyperStable. Since the SuperHyperSet of the SuperHyperVertices, { V 2 , V 5 , V 8 , V 7 } , is the SuperHyperSet Ss of SuperHyperVertices such that there’s a SuperHyperVertex to have a SuperHyperEdge in common and it’s a Failed SuperHyperStable. Since it’sthe maximum cardinality of a SuperHyperSet S of SuperHyperVertices such that there’s a SuperHyperVertex to have a SuperHyperEdge in common. There aren’t only less than two SuperHyperVertices inside the intended SuperHyperSet, { V 2 , V 5 , V 8 , V 7 } . Thus the non-obvious Failed SuperHyperStable, { V 2 , V 5 , V 8 , V 7 } , is up. The obvious simple type-SuperHyperSet of the Failed SuperHyperStable, { V 2 , V 5 , V 8 , V 7 } , is a SuperHyperSet, { V 2 , V 5 , V 8 , V 7 } , doesn’t include only more than one SuperHyperVertex in a connected neutrosophic SuperHyperGraph N S H G : ( V , E ) of highly-embedding-connected SuperHyperModel as the Figure 10.
  • On the Figure 11, the SuperHyperNotion, namely, Failed SuperHyperStable, is up. There’s neither empty SuperHyperEdge nor loop SuperHyperEdge. The SuperHyperSet of SuperHyperVertices, { V 2 , V 5 } , is the simple type-SuperHyperSet of the Failed SuperHyperStable. The SuperHyperSet of the SuperHyperVertices, { V 2 , V 5 , V 6 } , is the maximum cardinality of a SuperHyperSet S of SuperHyperVertices such that there’s a SuperHyperVertex to have a SuperHyperEdge in common. There’re not only less than one SuperHyperVertices inside the intended SuperHyperSet. Thus the non-obvious Failed SuperHyperStable is up. The obvious simple type-SuperHyperSet of the Failed SuperHyperStable is a SuperHyperSet includes only less than two SuperHyperVertices don’t form any kind of pairs are titled to SuperHyperNeighbors in a connected neutrosophic SuperHyperGraph N S H G : ( V , E ) . But the SuperHyperSet of SuperHyperVertices, { V 2 , V 5 , V 6 } , doesn’t have less than two SuperHyperVertices inside the intended SuperHyperSet. Thus the non-obvious simple type-SuperHyperSet of the Failed SuperHyperStable is up. To sum them up, the SuperHyperSet of SuperHyperVertices, { V 2 , V 5 , V 6 } , is the non-obvious simple type-SuperHyperSet of the Failed SuperHyperStable. Since the SuperHyperSet of the SuperHyperVertices, { V 2 , V 5 , V 6 } , is the SuperHyperSet Ss of SuperHyperVertices such that there’s a SuperHyperVertex to have a SuperHyperEdge in common and it’s a Failed SuperHyperStable. Since it’sthe maximum cardinality of a SuperHyperSet S of SuperHyperVertices such that there’s a SuperHyperVertex to have a SuperHyperEdge in common. There aren’t only less than two SuperHyperVertices inside the intended SuperHyperSet, { V 2 , V 5 , V 6 } . Thus the non-obvious Failed SuperHyperStable, { V 2 , V 5 , V 6 } , is up. The obvious simple type-SuperHyperSet of the Failed SuperHyperStable, { V 2 , V 5 , V 6 } , is a SuperHyperSet, { V 2 , V 5 , V 6 } , doesn’t include only less than two SuperHyperVertices in a connected neutrosophic SuperHyperGraph N S H G : ( V , E ) .
  • On the Figure 12, the SuperHyperNotion, namely, Failed SuperHyperStable, is up. There’s neither empty SuperHyperEdge nor loop SuperHyperEdge. The SuperHyperSet of SuperHyperVertices, { V 4 , V 5 , V 6 , V 9 , V 10 , V 2 } , is the simple type-SuperHyperSet of the Failed SuperHyperStable. The SuperHyperSet of the SuperHyperVertices, { V 4 , V 5 , V 6 , V 9 , V 10 , V 2 } , is the maximum cardinality of SuperHyperVertices such that there’s a SuperHyperVertex to have a SuperHyperEdge in common. There’re not only less than two SuperHyperVertices inside the intended SuperHyperSet. Thus the non-obvious Failed SuperHyperStable is up. The obvious simple type-SuperHyperSet of the Failed SuperHyperStable is a SuperHyperSet includes only less than two SuperHyperVertices doesn’t form any kind of pairs are titled to SuperHyperNeighbors in a connected neutrosophic SuperHyperGraph N S H G : ( V , E ) . But the SuperHyperSet of SuperHyperVertices, { V 4 , V 5 , V 6 , V 9 , V 10 , V 2 } , doesn’t have less than two SuperHyperVertices inside the intended SuperHyperSet. Thus the non-obvious simple type-SuperHyperSet of the Failed SuperHyperStable is up. To sum them up, the SuperHyperSet of SuperHyperVertices, { V 4 , V 5 , V 6 , V 9 , V 10 , V 2 } , is the non-obvious simple type-SuperHyperSet of the Failed SuperHyperStable. Since the SuperHyperSet of the SuperHyperVertices, { V 4 , V 5 , V 6 , V 9 , V 10 , V 2 } , is the SuperHyperSet Ss of SuperHyperVertices such that there’s a SuperHyperVertex to have a SuperHyperEdge in common and they are Failed SuperHyperStable. Since it’sthe maximum cardinality of SuperHyperVertices such that there’s a SuperHyperVertex to have a SuperHyperEdge in common. There aren’t only less than two SuperHyperVertices inside the intended SuperHyperSet, { V 4 , V 5 , V 6 , V 9 , V 10 , V 2 } . Thus the non-obvious Failed SuperHyperStable, { V 4 , V 5 , V 6 , V 9 , V 10 , V 2 } , is up. The obvious simple type-SuperHyperSet of the Failed SuperHyperStable, { V 4 , V 5 , V 6 , V 9 , V 10 , V 2 } , is a SuperHyperSet, { V 4 , V 5 , V 6 , V 9 , V 10 , V 2 } , doesn’t include only more than one SuperHyperVertex in a connected neutrosophic SuperHyperGraph N S H G : ( V , E ) in highly-multiple-connected-style SuperHyperModel On the Figure 12.
  • On the Figure 13, the SuperHyperNotion, namely, Failed SuperHyperStable, is up. There’s neither empty SuperHyperEdge nor loop SuperHyperEdge. The SuperHyperSet of SuperHyperVertices, { V 2 , V 5 , V 6 } , is the simple type-SuperHyperSet of the Failed SuperHyperStable. The SuperHyperSet of the SuperHyperVertices, { V 2 , V 5 , V 6 } , is the maximum cardinality of a SuperHyperSet S of SuperHyperVertices such that there’s a SuperHyperVertex to have a SuperHyperEdge in common. There’re not only less than two SuperHyperVertices inside the intended SuperHyperSet. Thus the non-obvious Failed SuperHyperStable is up. The obvious simple type-SuperHyperSet of the Failed SuperHyperStable is a SuperHyperSet includes only less than two SuperHyperVertices don’t form any kind of pairs are titled to SuperHyperNeighbors in a connected neutrosophic SuperHyperGraph N S H G : ( V , E ) . But the SuperHyperSet of SuperHyperVertices, { V 2 , V 5 , V 6 } , doesn’t have less than two SuperHyperVertices inside the intended SuperHyperSet. Thus the non-obvious simple type-SuperHyperSet of the Failed SuperHyperStable is up. To sum them up, the SuperHyperSet of SuperHyperVertices, { V 2 , V 5 , V 6 } , is the non-obvious simple type-SuperHyperSet of the Failed SuperHyperStable. Since the SuperHyperSet of the SuperHyperVertices, { V 2 , V 5 , V 6 } , is the SuperHyperSet Ss of SuperHyperVertices such that there’s a SuperHyperVertex to have a SuperHyperEdge in common and it’s a Failed SuperHyperStable. Since it’sthe maximum cardinality of a SuperHyperSet S of SuperHyperVertices such that there’s a SuperHyperVertex to have a SuperHyperEdge in common. There aren’t only less than two SuperHyperVertices inside the intended SuperHyperSet, { V 2 , V 5 , V 6 } . Thus the non-obvious Failed SuperHyperStable, { V 2 , V 5 , V 6 } , is up. The obvious simple type-SuperHyperSet of the Failed SuperHyperStable, { V 2 , V 5 , V 6 } , is a SuperHyperSet, { V 2 , V 5 , V 6 } , does includes only less than two SuperHyperVertices in a connected neutrosophic SuperHyperGraph N S H G : ( V , E ) .
  • On the Figure 14, the SuperHyperNotion, namely, Failed SuperHyperStable, is up. There’s neither empty SuperHyperEdge nor loop SuperHyperEdge. The SuperHyperSet of SuperHyperVertices, { V 3 , V 1 } , is the simple type-SuperHyperSet of the Failed SuperHyperStable. The SuperHyperSet of the SuperHyperVertices, { V 3 , V 1 } , is the maximum cardinality of a SuperHyperSet S of SuperHyperVertices such that there’s a SuperHyperVertex to have a SuperHyperEdge in common. There’re only less than two SuperHyperVertices inside the intended SuperHyperSet. Thus the non-obvious Failed SuperHyperStable is up. The obvious simple type-SuperHyperSet of the Failed SuperHyperStable is a SuperHyperSet includes only less than two SuperHyperVertices doesn’t form any kind of pairs are titled to SuperHyperNeighbors in a connected neutrosophic SuperHyperGraph N S H G : ( V , E ) . But the SuperHyperSet of SuperHyperVertices, { V 3 , V 1 } , doesn’t have less than two SuperHyperVertices inside the intended SuperHyperSet. Thus the non-obvious simple type-SuperHyperSet of the Failed SuperHyperStable is up. To sum them up, the SuperHyperSet of SuperHyperVertices, { V 3 , V 1 } , is the non-obvious simple type-SuperHyperSet of the Failed SuperHyperStable. Since the SuperHyperSet of the SuperHyperVertices, { V 3 , V 1 } , is the SuperHyperSet Ss of SuperHyperVertices such that there’s a SuperHyperVertex to have a SuperHyperEdge in common and it’s a Failed SuperHyperStable. Since it’sthe maximum cardinality of a SuperHyperSet S of SuperHyperVertices such that there’s a SuperHyperVertex to have a SuperHyperEdge in common. There aren’t only less than two SuperHyperVertices inside the intended SuperHyperSet, { V 3 , V 1 } . Thus the non-obvious Failed SuperHyperStable, { V 3 , V 1 } , is up. The obvious simple type-SuperHyperSet of the Failed SuperHyperStable, { V 3 , V 1 } , is a SuperHyperSet, { V 3 , V 1 } , does includes only less than two SuperHyperVertices in a connected neutrosophic SuperHyperGraph N S H G : ( V , E ) .
  • On the Figure 15, the SuperHyperNotion, namely, Failed SuperHyperStable, is up. There’s neither empty SuperHyperEdge nor loop SuperHyperEdge. The SuperHyperSet of SuperHyperVertices, { V 5 , V 2 , V 6 , V 4 } , is the simple type-SuperHyperSet of the Failed SuperHyperStable. The SuperHyperSet of the SuperHyperVertices, { V 5 , V 2 , V 6 , V 4 } , is the maximum cardinality of a SuperHyperSet S of SuperHyperVertices such that there’s a SuperHyperVertex to have a SuperHyperEdge in common. There’re only less than two SuperHyperVertices inside the intended SuperHyperSet. Thus the non-obvious Failed SuperHyperStable is up. The obvious simple type-SuperHyperSet of the Failed SuperHyperStable is a SuperHyperSet includes only less than two SuperHyperVertices doesn’t form any kind of pairs are titled to SuperHyperNeighbors in a connected neutrosophic SuperHyperGraph N S H G : ( V , E ) . But the SuperHyperSet of SuperHyperVertices, { V 5 , V 2 , V 6 , V 4 } , doesn’t have less than two SuperHyperVertices inside the intended SuperHyperSet. Thus the non-obvious simple type-SuperHyperSet of the Failed SuperHyperStable is up. To sum them up, the SuperHyperSet of SuperHyperVertices, { V 5 , V 2 , V 6 , V 4 } , is the non-obvious simple type-SuperHyperSet of the Failed SuperHyperStable. Since the SuperHyperSet of the SuperHyperVertices, { V 5 , V 2 , V 6 , V 4 } , is the SuperHyperSet Ss of SuperHyperVertices such that there’s a SuperHyperVertex to have a SuperHyperEdge in common and it’s a Failed SuperHyperStable. Since it’sthe maximum cardinality of a SuperHyperSet S of SuperHyperVertices such that there’s a SuperHyperVertex to have a SuperHyperEdge in common. There aren’t only less than two SuperHyperVertices inside the intended SuperHyperSet, { V 5 , V 2 , V 6 , V 4 } . Thus the non-obvious Failed SuperHyperStable, { V 5 , V 2 , V 6 , V 4 } , is up. The obvious simple type-SuperHyperSet of the Failed SuperHyperStable, { V 5 , V 2 , V 6 , V 4 } , is a SuperHyperSet, { V 5 , V 2 , V 6 , V 4 } , doesn’t include only less than two SuperHyperVertices in a connected neutrosophic SuperHyperGraph N S H G : ( V , E ) as Linearly-Connected SuperHyperModel On the Figure 15.
  • On the Figure 16, the SuperHyperNotion, namely, Failed SuperHyperStable, is up. There’s neither empty SuperHyperEdge nor loop SuperHyperEdge. The SuperHyperSet of SuperHyperVertices, { V 1 , V 3 , V 7 , V 13 , V 22 , V 18 } , is the simple type-SuperHyperSet of the Failed SuperHyperStable. The SuperHyperSet of the SuperHyperVertices, { V 1 , V 3 , V 7 , V 13 , V 22 , V 18 } , is the maximum cardinality of a SuperHyperSet S of SuperHyperVertices such that there’s a SuperHyperVertex to have a SuperHyperEdge in common. There’re only less than two SuperHyperVertices inside the intended SuperHyperSet. Thus the non-obvious Failed SuperHyperStable is up. The obvious simple type-SuperHyperSet of the Failed SuperHyperStable is a SuperHyperSet includes only less than two SuperHyperVertices doesn’t form any kind of pairs are titled to SuperHyperNeighbors in a connected neutrosophic SuperHyperGraph N S H G : ( V , E ) . But the SuperHyperSet of SuperHyperVertices, { V 1 , V 3 , V 7 , V 13 , V 22 , V 18 } , doesn’t have less than two SuperHyperVertices inside the intended SuperHyperSet. Thus the non-obvious simple type-SuperHyperSet of the Failed SuperHyperStable is up. To sum them up, the SuperHyperSet of SuperHyperVertices, { V 1 , V 3 , V 7 , V 13 , V 22 , V 18 } , is the non-obvious simple type-SuperHyperSet of the Failed SuperHyperStable. Since the SuperHyperSet of the SuperHyperVertices, { V 1 , V 3 , V 7 , V 13 , V 22 , V 18 } , is the SuperHyperSet Ss of SuperHyperVertices such that there’s a SuperHyperVertex to have a SuperHyperEdge in common and it’s a Failed SuperHyperStable. Since it’sthe maximum cardinality of a SuperHyperSet S of SuperHyperVertices such that there’s a SuperHyperVertex to have a SuperHyperEdge in common. There aren’t only less than two SuperHyperVertices inside the intended SuperHyperSet, { V 1 , V 3 , V 7 , V 13 , V 22 , V 18 } . Thus the non-obvious Failed SuperHyperStable, { V 1 , V 3 , V 7 , V 13 , V 22 , V 18 } , is up. The obvious simple type-SuperHyperSet of the Failed SuperHyperStable, { V 1 , V 3 , V 7 , V 13 , V 22 , V 18 } , is a SuperHyperSet, { V 1 , V 3 , V 7 , V 13 , V 22 , V 18 } , does includes only less than two SuperHyperVertices in a connected neutrosophic SuperHyperGraph N S H G : ( V , E ) .
  • On the Figure 17, the SuperHyperNotion, namely, Failed SuperHyperStable, is up. There’s neither empty SuperHyperEdge nor loop SuperHyperEdge. The SuperHyperSet of SuperHyperVertices, { V 1 , V 3 , V 7 , V 13 , V 22 , V 18 } , is the simple type-SuperHyperSet of the Failed SuperHyperStable. The SuperHyperSet of the SuperHyperVertices, { V 1 , V 3 , V 7 , V 13 , V 22 , V 18 } , is the maximum cardinality of a SuperHyperSet S of SuperHyperVertices such that there’s a SuperHyperVertex to have a SuperHyperEdge in common. There’re only less than two SuperHyperVertices inside the intended SuperHyperSet. Thus the non-obvious Failed SuperHyperStable is up. The obvious simple type-SuperHyperSet of the Failed SuperHyperStable is a SuperHyperSet includes only less than two SuperHyperVertices doesn’t form any kind of pairs are titled to SuperHyperNeighbors in a connected neutrosophic SuperHyperGraph N S H G : ( V , E ) . But the SuperHyperSet of SuperHyperVertices, { V 1 , V 3 , V 7 , V 13 , V 22 , V 18 } , doesn’t have less than two SuperHyperVertices inside the intended SuperHyperSet. Thus the non-obvious simple type-SuperHyperSet of the Failed SuperHyperStable is up. To sum them up, the SuperHyperSet of SuperHyperVertices, { V 1 , V 3 , V 7 , V 13 , V 22 , V 18 } , is the non-obvious simple type-SuperHyperSet of the Failed SuperHyperStable. Since the SuperHyperSet of the SuperHyperVertices, { V 1 , V 3 , V 7 , V 13 , V 22 , V 18 } , is the SuperHyperSet Ss of SuperHyperVertices such that there’s a SuperHyperVertex to have a SuperHyperEdge in common and it’s a Failed SuperHyperStable. Since it’sthe maximum cardinality of a SuperHyperSet S of SuperHyperVertices such that there’s a SuperHyperVertex to have a SuperHyperEdge in common. There aren’t only less than two SuperHyperVertices inside the intended SuperHyperSet, { V 1 , V 3 , V 7 , V 13 , V 22 , V 18 } . Thus the non-obvious Failed SuperHyperStable, { V 1 , V 3 , V 7 , V 13 , V 22 , V 18 } , is up. The obvious simple type-SuperHyperSet of the Failed SuperHyperStable, { V 1 , V 3 , V 7 , V 13 , V 22 , V 18 } , is a SuperHyperSet, { V 1 , V 3 , V 7 , V 13 , V 22 , V 18 } , does includes only less than two SuperHyperVertices in a connected neutrosophic SuperHyperGraph N S H G : ( V , E ) as Linearly-over-packed SuperHyperModel is featured On the Figure 17.
  • On the Figure 18, the SuperHyperNotion, namely, Failed SuperHyperStable, is up. There’s neither empty SuperHyperEdge nor loop SuperHyperEdge. The SuperHyperSet of SuperHyperVertices, { V 1 , V 3 , V 7 , V 13 , V 22 , V 18 } , is the simple type-SuperHyperSet of the Failed SuperHyperStable. The SuperHyperSet of the SuperHyperVertices, { V 1 , V 3 , V 7 , V 13 , V 22 , V 18 } , is the maximum cardinality of a SuperHyperSet S of SuperHyperVertices such that there’s a SuperHyperVertex to have a SuperHyperEdge in common. There’re only less than two SuperHyperVertices inside the intended SuperHyperSet. Thus the non-obvious Failed SuperHyperStable is up. The obvious simple type-SuperHyperSet of the Failed SuperHyperStable is a SuperHyperSet includes only less than two SuperHyperVertices doesn’t form any kind of pairs are titled to SuperHyperNeighbors in a connected neutrosophic SuperHyperGraph N S H G : ( V , E ) . But the SuperHyperSet of SuperHyperVertices, { V 1 , V 3 , V 7 , V 13 , V 22 , V 18 } , doesn’t have less than two SuperHyperVertices inside the intended SuperHyperSet. Thus the non-obvious simple type-SuperHyperSet of the Failed SuperHyperStable is up. To sum them up, the SuperHyperSet of SuperHyperVertices, { V 1 , V 3 , V 7 , V 13 , V 22 , V 18 } , is the non-obvious simple type-SuperHyperSet of the Failed SuperHyperStable. Since the SuperHyperSet of the SuperHyperVertices, { V 1 , V 3 , V 7 , V 13 , V 22 , V 18 } , is the SuperHyperSet Ss of SuperHyperVertices such that there’s a SuperHyperVertex to have a SuperHyperEdge in common and it’s a Failed SuperHyperStable. Since it’sthe maximum cardinality of a SuperHyperSet S of SuperHyperVertices such that there’s a SuperHyperVertex to have a SuperHyperEdge in common. There’re only less than two SuperHyperVertices inside the intended SuperHyperSet, { V 1 , V 3 , V 7 , V 13 , V 22 , V 18 } . Thus the non-obvious Failed SuperHyperStable, { V 1 , V 3 , V 7 , V 13 , V 22 , V 18 } , is up. The obvious simple type-SuperHyperSet of the Failed SuperHyperStable, { V 1 , V 3 , V 7 , V 13 , V 22 , V 18 } , is a SuperHyperSet, { V 1 , V 3 , V 7 , V 13 , V 22 , V 18 } , does includes only less than two SuperHyperVertices in a connected neutrosophic SuperHyperGraph N S H G : ( V , E )
  • On the Figure 19, the SuperHyperNotion, namely, Failed SuperHyperStable, is up. There’s neither empty SuperHyperEdge nor loop SuperHyperEdge. The SuperHyperSet of SuperHyperVertices,
    { interior SuperHyperVertices } the number of SuperHyperEdges ,
    is the simple type-SuperHyperSet of the Failed SuperHyperStable. The SuperHyperSet of the SuperHyperVertices,
    { interior SuperHyperVertices } the number of SuperHyperEdges ,
    is the maximum cardinality of a SuperHyperSet S of SuperHyperVertices such that there’s a SuperHyperVertex to have a SuperHyperEdge in common. There’re only less than two SuperHyperVertices inside the intended SuperHyperSet. Thus the non-obvious Failed SuperHyperStable is up. The obvious simple type-SuperHyperSet of the Failed SuperHyperStable is a SuperHyperSet includes only less than two SuperHyperVertices doesn’t form any kind of pairs are titled to SuperHyperNeighbors in a connected neutrosophic SuperHyperGraph N S H G : ( V , E ) . But the SuperHyperSet of SuperHyperVertices,
    { interior SuperHyperVertices } the number of SuperHyperEdges ,
    doesn’t have less than two SuperHyperVertices inside the intended SuperHyperSet. Thus the non-obvious simple type-SuperHyperSet of the Failed SuperHyperStable is up. To sum them up, the SuperHyperSet of SuperHyperVertices,
    { interior SuperHyperVertices } the number of SuperHyperEdges ,
    is the non-obvious simple type-SuperHyperSet of the Failed SuperHyperStable. Since the SuperHyperSet of the SuperHyperVertices,
    { interior SuperHyperVertices } the number of SuperHyperEdges ,
    is the SuperHyperSet Ss of SuperHyperVertices such that there’s a SuperHyperVertex to have a SuperHyperEdge in common and it’s a Failed SuperHyperStable. Since it’sthe maximum cardinality of a SuperHyperSet S of SuperHyperVertices such that there’s a SuperHyperVertex to have a SuperHyperEdge in common. There aren’t only less than two SuperHyperVertices inside the intended SuperHyperSet,
    { interior SuperHyperVertices } the number of SuperHyperEdges .
    Thus the non-obvious Failed SuperHyperStable,
    { interior SuperHyperVertices } the number of SuperHyperEdges ,
    is up. The obvious simple type-SuperHyperSet of the Failed SuperHyperStable,
    { interior SuperHyperVertices } the number of SuperHyperEdges ,
    is a SuperHyperSet,
    { interior SuperHyperVertices } the number of SuperHyperEdges ,
    does includes only less than two SuperHyperVertices in a connected neutrosophic SuperHyperGraph N S H G : ( V , E ) .
  • On the Figure 20, the SuperHyperNotion, namely, Failed SuperHyperStable, is up. There’s neither empty SuperHyperEdge nor loop SuperHyperEdge. The SuperHyperSet of SuperHyperVertices,
    { interior SuperHyperVertices } the number of SuperHyperEdges ,
    is the simple type-SuperHyperSet of the Failed SuperHyperStable. The SuperHyperSet of the SuperHyperVertices,
    { interior SuperHyperVertices } the number of SuperHyperEdges ,
    is the maximum cardinality of a SuperHyperSet S of SuperHyperVertices such that there’s a SuperHyperVertex to have a SuperHyperEdge in common. There’re only less than two SuperHyperVertices inside the intended SuperHyperSet. Thus the non-obvious Failed SuperHyperStable is up. The obvious simple type-SuperHyperSet of the Failed SuperHyperStable is a SuperHyperSet includes only less than two SuperHyperVertices doesn’t form any kind of pairs are titled to SuperHyperNeighbors in a connected neutrosophic SuperHyperGraph N S H G : ( V , E ) . But the SuperHyperSet of SuperHyperVertices,
    { interior SuperHyperVertices } the number of SuperHyperEdges ,
    doesn’t have less than two SuperHyperVertices inside the intended SuperHyperSet. Thus the non-obvious simple type-SuperHyperSet of the Failed SuperHyperStable is up. To sum them up, the SuperHyperSet of SuperHyperVertices,
    { interior SuperHyperVertices } the number of SuperHyperEdges ,
    is the non-obvious simple type-SuperHyperSet of the Failed SuperHyperStable. Since the SuperHyperSet of the SuperHyperVertices,
    { interior SuperHyperVertices } the number of SuperHyperEdges ,
    is the SuperHyperSet Ss of SuperHyperVertices such that there’s a SuperHyperVertex to have a SuperHyperEdge in common and it’s a Failed SuperHyperStable. Since it’sthe maximum cardinality of a SuperHyperSet S of SuperHyperVertices such that there’s a SuperHyperVertex to have a SuperHyperEdge in common. There aren’t only less than two SuperHyperVertices inside the intended SuperHyperSet,
    { interior SuperHyperVertices } the number of SuperHyperEdges .
    Thus the non-obvious Failed SuperHyperStable,
    { interior SuperHyperVertices } the number of SuperHyperEdges ,
    is up. The obvious simple type-SuperHyperSet of the Failed SuperHyperStable,
    { interior SuperHyperVertices } the number of SuperHyperEdges ,
    is a SuperHyperSet, does includes only less than two SuperHyperVertices in a connected neutrosophic SuperHyperGraph N S H G : ( V , E ) .
Proposition 5.2.
Assume a connected neutrosophic SuperHyperGraph N S H G : ( V , E ) . Then in the worst case, literally, V V { x , z } , is a Failed SuperHyperStable. In other words, the least cardinality, the lower sharp bound for the cardinality, of a Failed SuperHyperStable is the cardinality of V V { x , z } .
Proof. 
Assume a connected neutrosophic SuperHyperGraph N S H G : ( V , E ) . The SuperHyperSet of the SuperHyperVertices V V { z } is a SuperHyperSet S of SuperHyperVertices such that there’s a SuperHyperVertex to have a SuperHyperEdge in common but it isn’t a Failed SuperHyperStable. Since it doesn’t have the maximum cardinality of a SuperHyperSet S of SuperHyperVertices such that there’s a SuperHyperVertex to have a SuperHyperEdge in common. The SuperHyperSet of the SuperHyperVertices V V { x , y , z } is the maximum cardinality of a SuperHyperSet S of SuperHyperVertices but it isn’t a Failed SuperHyperStable. Since it doesn’t do the procedure such that such that there’s a SuperHyperVertex to have a SuperHyperEdge in common. [there’er at least three SuperHyperVertices inside implying there’s, sometimes in the connected neutrosophic SuperHyperGraph N S H G : ( V , E ) , a SuperHyperVertex, titled its SuperHyperNeighbor, to that SuperHyperVertex in the SuperHyperSet S so as S doesn’t do “the procedure”.]. There’re only two SuperHyperVertices inside the intended SuperHyperSet, V V { x , z } . Thus the obvious Failed SuperHyperStable, V V { x , z } , is up. The obvious simple type-SuperHyperSet of the Failed SuperHyperStable, V V { x , z } , is a SuperHyperSet, V V { x , z } , includes only two SuperHyperVertices doesn’t form any kind of pairs are titled SuperHyperNeighbors in a connected neutrosophic SuperHyperGraph N S H G : ( V , E ) . Since the SuperHyperSet of the SuperHyperVertices V V { x , z } , is the maximum cardinality of a SuperHyperSet S of SuperHyperVertices such that V ( G ) there’s a SuperHyperVertex to have a SuperHyperEdge in common. □
Proposition 5.3.
Assume a connected neutrosophic SuperHyperGraph N S H G : ( V , E ) . Then the extreme number of Failed SuperHyperStable has, the least cardinality, the lower sharp bound for cardinality, is the extreme cardinality of V V { x , z } if there’s a Failed SuperHyperStable with the least cardinality, the lower sharp bound for cardinality.
Proof. 
Assume a connected neutrosophic SuperHyperGraph N S H G : ( V , E ) . Consider there’s a Failed SuperHyperStable with the least cardinality, the lower sharp bound for cardinality. The SuperHyperSet of the SuperHyperVertices V V { z } is a SuperHyperSet S of SuperHyperVertices such that there’s a SuperHyperVertex to have a SuperHyperEdge in common but it isn’t a Failed SuperHyperStable. Since it doesn’t have the maximum cardinality of a SuperHyperSet S of SuperHyperVertices such that there’s a SuperHyperVertex to have a SuperHyperEdge in common. The SuperHyperSet of the SuperHyperVertices V V { x , y , z } is the maximum cardinality of a SuperHyperSet S of SuperHyperVertices but it isn’t a Failed SuperHyperStable. Since it doesn’t do the procedure such that such that there’s a SuperHyperVertex to have a SuperHyperEdge in common. [there’er at least three SuperHyperVertices inside implying there’s, sometimes in the connected neutrosophic SuperHyperGraph N S H G : ( V , E ) , a SuperHyperVertex, titled its SuperHyperNeighbor, to that SuperHyperVertex in the SuperHyperSet S so as S doesn’t do “the procedure”.]. There’re only two SuperHyperVertices inside the intended SuperHyperSet, V V { x , z } . Thus the obvious Failed SuperHyperStable, V V { x , z } , is up. The obvious simple type-SuperHyperSet of the Failed SuperHyperStable, V V { x , z } , is a SuperHyperSet, V V { x , z } , includes only two SuperHyperVertices doesn’t form any kind of pairs are titled SuperHyperNeighbors in a connected neutrosophic SuperHyperGraph N S H G : ( V , E ) . Since the SuperHyperSet of the SuperHyperVertices V V { x , z } , is the maximum cardinality of a SuperHyperSet S of SuperHyperVertices such that V ( G ) there’s a SuperHyperVertex to have a SuperHyperEdge in common. Thus, in a connected neutrosophic SuperHyperGraph N S H G : ( V , E ) , the extreme number of Failed SuperHyperStable has, the least cardinality, the lower sharp bound for cardinality, is the extreme cardinality of V V { x , z } if there’s a Failed SuperHyperStable with the least cardinality, the lower sharp bound for cardinality. □
Proposition 5.4.
Assume a connected neutrosophic SuperHyperGraph N S H G : ( V , E ) . If a SuperHyperEdge has z SuperHyperVertices, then z 2 number of those interior SuperHyperVertices from that SuperHyperEdge exclude to any Failed SuperHyperStable.
Proof. 
Assume a connected neutrosophic SuperHyperGraph N S H G : ( V , E ) . Let a SuperHyperEdge has z SuperHyperVertices. Consider z 2 number of those SuperHyperVertices from that SuperHyperEdge exclude to any given SuperHyperSet of the SuperHyperVertices. Consider there’s a Failed SuperHyperStable with the least cardinality, the lower sharp bound for cardinality. Assume a connected neutrosophic SuperHyperGraph N S H G : ( V , E ) . The SuperHyperSet of the SuperHyperVertices V V { z } is a SuperHyperSet S of SuperHyperVertices such that there’s a SuperHyperVertex to have a SuperHyperEdge in common but it isn’t a Failed SuperHyperStable. Since it doesn’t have the maximum cardinality of a SuperHyperSet S of SuperHyperVertices such that there’s a SuperHyperVertex to have a SuperHyperEdge in common. The SuperHyperSet of the SuperHyperVertices V V { x , y , z } is the maximum cardinality of a SuperHyperSet S of SuperHyperVertices but it isn’t a Failed SuperHyperStable. Since it doesn’t do the procedure such that such that there’s a SuperHyperVertex to have a SuperHyperEdge in common. [there’er at least three SuperHyperVertices inside implying there’s, sometimes in the connected neutrosophic SuperHyperGraph N S H G : ( V , E ) , a SuperHyperVertex, titled its SuperHyperNeighbor, to that SuperHyperVertex in the SuperHyperSet S so as S doesn’t do “the procedure”.]. There’re only two SuperHyperVertices inside the intended SuperHyperSet, V V { x , z } . Thus the obvious Failed SuperHyperStable, V V { x , z } , is up. The obvious simple type-SuperHyperSet of the Failed SuperHyperStable, V V { x , z } , is a SuperHyperSet, V V { x , z } , includes only two SuperHyperVertices doesn’t form any kind of pairs are titled SuperHyperNeighbors in a connected neutrosophic SuperHyperGraph N S H G : ( V , E ) . Since the SuperHyperSet of the SuperHyperVertices V V { x , z } , is the maximum cardinality of a SuperHyperSet S of SuperHyperVertices such that V ( G ) there’s a SuperHyperVertex to have a SuperHyperEdge in common. Thus, in a connected neutrosophic SuperHyperGraph N S H G : ( V , E ) , a SuperHyperEdge has z SuperHyperVertices, then z 2 number of those interior SuperHyperVertices from that SuperHyperEdge exclude to any Failed SuperHyperStable. □
Proposition 5.5.
Assume a connected neutrosophic SuperHyperGraph N S H G : ( V , E ) . There’s only one SuperHyperEdge has only less than three distinct interior SuperHyperVertices inside of any given Failed SuperHyperStable. In other words, there’s only an unique SuperHyperEdge has only two distinct SuperHyperVertices in a Failed SuperHyperStable.
Proof. 
Assume a connected neutrosophic SuperHyperGraph N S H G : ( V , E ) . Let a SuperHyperEdge has some SuperHyperVertices. Consider some numbers of those SuperHyperVertices from that SuperHyperEdge excluding more than two distinct SuperHyperVertices, exclude to any given SuperHyperSet of the SuperHyperVertices. Consider there’s Failed SuperHyperStable with the least cardinality, the lower sharp bound for cardinality. Assume a connected neutrosophic SuperHyperGraph N S H G : ( V , E ) . The SuperHyperSet of the SuperHyperVertices V V { z } is a SuperHyperSet S of SuperHyperVertices such that there’s a SuperHyperVertex to have a SuperHyperEdge in common but it isn’t a Failed SuperHyperStable. Since it doesn’t have the maximum cardinality of a SuperHyperSet S of SuperHyperVertices such that there’s a SuperHyperVertex to have a SuperHyperEdge in common. The SuperHyperSet of the SuperHyperVertices V V { x , y , z } is the maximum cardinality of a SuperHyperSet S of SuperHyperVertices but it isn’t a Failed SuperHyperStable. Since it doesn’t do the procedure such that such that there’s a SuperHyperVertex to have a SuperHyperEdge in common. [there’er at least three SuperHyperVertices inside implying there’s, sometimes in the connected neutrosophic SuperHyperGraph N S H G : ( V , E ) , a SuperHyperVertex, titled its SuperHyperNeighbor, to that SuperHyperVertex in the SuperHyperSet S so as S doesn’t do “the procedure”.]. There’re only two SuperHyperVertices inside the intended SuperHyperSet, V V { x , z } . Thus the obvious Failed SuperHyperStable, V V { x , z } , is up. The obvious simple type-SuperHyperSet of the Failed SuperHyperStable, V V { x , z } , is a SuperHyperSet, V V { x , z } , includes only two SuperHyperVertices doesn’t form any kind of pairs are titled SuperHyperNeighbors in a connected neutrosophic SuperHyperGraph N S H G : ( V , E ) . Since the SuperHyperSet of the SuperHyperVertices V V { x , z } , is the maximum cardinality of a SuperHyperSet S of SuperHyperVertices such that V ( G ) there’s a SuperHyperVertex to have a SuperHyperEdge in common. Thus, in a connected neutrosophic SuperHyperGraph N S H G : ( V , E ) , there’s only one SuperHyperEdge has only less than three distinct interior SuperHyperVertices inside of any given Failed SuperHyperStable. In other words, there’s only an unique SuperHyperEdge has only two distinct SuperHyperVertices in a Failed SuperHyperStable. □
Proposition 5.5.
Assume a connected neutrosophic SuperHyperGraph N S H G : ( V , E ) . The all interior SuperHyperVertices belong to any Failed SuperHyperStable if for any of them, there’s no other corresponded SuperHyperVertex such that the two interior SuperHyperVertices are mutually SuperHyperNeighbors with an exception once.
Proof. 
Let a SuperHyperEdge has some SuperHyperVertices. Consider all numbers of those SuperHyperVertices from that SuperHyperEdge excluding more than two distinct SuperHyperVertices, exclude to any given SuperHyperSet of the SuperHyperVertices. Consider there’s a Failed SuperHyperStable with the least cardinality, the lower sharp bound for cardinality. Assume a connected neutrosophic SuperHyperGraph N S H G : ( V , E ) . The SuperHyperSet of the SuperHyperVertices V V { z } is a SuperHyperSet S of SuperHyperVertices such that there’s a SuperHyperVertex to have a SuperHyperEdge in common but it isn’t a Failed SuperHyperStable. Since it doesn’t have the maximum cardinality of a SuperHyperSet S of SuperHyperVertices such that there’s a SuperHyperVertex to have a SuperHyperEdge in common. The SuperHyperSet of the SuperHyperVertices V V { x , y , z } is the maximum cardinality of a SuperHyperSet S of SuperHyperVertices but it isn’t a Failed SuperHyperStable. Since it doesn’t do the procedure such that such that there’s a SuperHyperVertex to have a SuperHyperEdge in common. [there’er at least three SuperHyperVertices inside implying there’s, sometimes in the connected neutrosophic SuperHyperGraph N S H G : ( V , E ) , a SuperHyperVertex, titled its SuperHyperNeighbor, to that SuperHyperVertex in the SuperHyperSet S so as S doesn’t do “the procedure”.]. There’re only two SuperHyperVertices inside the intended SuperHyperSet, V V { x , z } . Thus the obvious Failed SuperHyperStable, V V { x , z } , is up. The obvious simple type-SuperHyperSet of the Failed SuperHyperStable, V V { x , z } , is a SuperHyperSet, V V { x , z } , includes only two SuperHyperVertices doesn’t form any kind of pairs are titled SuperHyperNeighbors in a connected neutrosophic SuperHyperGraph N S H G : ( V , E ) . Since the SuperHyperSet of the SuperHyperVertices V V { x , z } , is the maximum cardinality of a SuperHyperSet S of SuperHyperVertices such that V ( G ) there’s a SuperHyperVertex to have a SuperHyperEdge in common. Thus, in a connected neutrosophic SuperHyperGraph N S H G : ( V , E ) , the all interior SuperHyperVertices belong to any Failed SuperHyperStable if for any of them, there’s no other corresponded SuperHyperVertex such that the two interior SuperHyperVertices are mutually SuperHyperNeighbors with an exception once. □
Proposition 5.6.
Assume a connected neutrosophic SuperHyperGraph N S H G : ( V , E ) . The any Failed SuperHyperStable only contains all interior SuperHyperVertices and all exterior SuperHyperVertices where there’s any of them has no SuperHyperNeighbors in and there’s no SuperHyperNeighborhoods in with an exception once but everything is possible about SuperHyperNeighborhoods and SuperHyperNeighbors out.
Proof. 
Assume a connected neutrosophic SuperHyperGraph N S H G : ( V , E ) . Let a SuperHyperEdge has some SuperHyperVertices. Consider all numbers of those SuperHyperVertices from that SuperHyperEdge excluding more than two distinct SuperHyperVertices, exclude to any given SuperHyperSet of the SuperHyperVertices. Consider there’s a Failed SuperHyperStable with the least cardinality, the lower sharp bound for cardinality. Assume a connected neutrosophic SuperHyperGraph N S H G : ( V , E ) . The SuperHyperSet of the SuperHyperVertices V V { z } is a SuperHyperSet S of SuperHyperVertices such that there’s a SuperHyperVertex to have a SuperHyperEdge in common but it isn’t a Failed SuperHyperStable. Since it doesn’t have the maximum cardinality of a SuperHyperSet S of SuperHyperVertices such that there’s a SuperHyperVertex to have a SuperHyperEdge in common. The SuperHyperSet of the SuperHyperVertices V V { x , y , z } is the maximum cardinality of a SuperHyperSet S of SuperHyperVertices but it isn’t a Failed SuperHyperStable. Since it doesn’t do the procedure such that such that there’s a SuperHyperVertex to have a SuperHyperEdge in common. [there’er at least three SuperHyperVertices inside implying there’s, sometimes in the connected neutrosophic SuperHyperGraph N S H G : ( V , E ) , a SuperHyperVertex, titled its SuperHyperNeighbor, to that SuperHyperVertex in the SuperHyperSet S so as S doesn’t do “the procedure”.]. There’re only two SuperHyperVertices inside the intended SuperHyperSet, V V { x , z } . Thus the obvious Failed SuperHyperStable, V V { x , z } , is up. The obvious simple type-SuperHyperSet of the Failed SuperHyperStable, V V { x , z } , is a SuperHyperSet, V V { x , z } , includes only two SuperHyperVertices doesn’t form any kind of pairs are titled SuperHyperNeighbors in a connected neutrosophic SuperHyperGraph N S H G : ( V , E ) . Since the SuperHyperSet of the SuperHyperVertices V V { x , z } , is the maximum cardinality of a SuperHyperSet S of SuperHyperVertices such that V ( G ) there’s a SuperHyperVertex to have a SuperHyperEdge in common. Thus, in a connected neutrosophic SuperHyperGraph N S H G : ( V , E ) , the any Failed SuperHyperStable only contains all interior SuperHyperVertices and all exterior SuperHyperVertices where there’s any of them has no SuperHyperNeighbors in and there’s no SuperHyperNeighborhoods in with an exception once but everything is possible about SuperHyperNeighborhoods and SuperHyperNeighbors out. □
Remark 5.8.
The words “ Failed SuperHyperStable” and “SuperHyperDominating” both refer to the maximum type-style. In other words, they both refer to the maximum number and the SuperHyperSet with the maximum cardinality.
Proposition 5.9.
Assume a connected neutrosophic SuperHyperGraph N S H G : ( V , E ) . Consider a SuperHyperDominating. Then a Failed SuperHyperStable is either out with one additional member.
Proof. 
Assume a connected neutrosophic SuperHyperGraph N S H G : ( V , E ) . Consider a SuperHyperDominating. By applying the Proposition (5.7), the results are up. Thus on a connected neutrosophic SuperHyperGraph N S H G : ( V , E ) , and in a SuperHyperDominating, a Failed SuperHyperStable is either out with one additional member. □

6. Results on in Some Specific Extreme Situations Titled Extreme SuperHyperClasses

Proposition 6.1.
Assume a connected SuperHyperPath N S H P : ( V , E ) . Then a Failed SuperHyperStable-style with the maximum SuperHyperCardinality is a SuperHyperSet of the interior SuperHyperVertices.
Proposition 6.2.
Assume a connected SuperHyperPath N S H P : ( V , E ) . Then a Failed SuperHyperStable is a SuperHyperSet of the interior SuperHyperVertices with only all exceptions in the form of interior SuperHyperVertices from the common SuperHyperEdges excluding only two interior SuperHyperVertices from the common SuperHyperEdges. a Failed SuperHyperStable has the number of all the interior SuperHyperVertices minus their SuperHyperNeighborhoods plus one.
Proof. 
Assume a connected SuperHyperPath N S H P : ( V , E ) . Let a SuperHyperEdge has some SuperHyperVertices. Consider all numbers of those SuperHyperVertices from that SuperHyperEdge excluding more than two distinct SuperHyperVertices, exclude to any given SuperHyperSet of the SuperHyperVertices. Consider there’s a Failed SuperHyperStable with the least cardinality, the lower sharp bound for cardinality. Assume a connected neutrosophic SuperHyperGraph N S H G : ( V , E ) . The SuperHyperSet of the SuperHyperVertices V V { z } is a SuperHyperSet S of SuperHyperVertices such that there’s a SuperHyperVertex to have a SuperHyperEdge in common but it isn’t a Failed SuperHyperStable. Since it doesn’t have the maximum cardinality of a SuperHyperSet S of SuperHyperVertices such that there’s a SuperHyperVertex to have a SuperHyperEdge in common. The SuperHyperSet of the SuperHyperVertices V V { x , y , z } is the maximum cardinality of a SuperHyperSet S of SuperHyperVertices but it isn’t a Failed SuperHyperStable. Since it doesn’t do the procedure such that such that there’s a SuperHyperVertex to have a SuperHyperEdge in common. [there’er at least three SuperHyperVertices inside implying there’s, sometimes in the connected neutrosophic SuperHyperGraph N S H G : ( V , E ) , a SuperHyperVertex, titled its SuperHyperNeighbor, to that SuperHyperVertex in the SuperHyperSet S so as S doesn’t do “the procedure”.]. There’re only two SuperHyperVertices inside the intended SuperHyperSet, V V { x , z } . Thus the obvious Failed SuperHyperStable, V V { x , z } , is up. The obvious simple type-SuperHyperSet of the Failed SuperHyperStable, V V { x , z } , is a SuperHyperSet, V V { x , z } , includes only two SuperHyperVertices doesn’t form any kind of pairs are titled SuperHyperNeighbors in a connected neutrosophic SuperHyperGraph N S H G : ( V , E ) . Since the SuperHyperSet of the SuperHyperVertices V V { x , z } , is the maximum cardinality of a SuperHyperSet S of SuperHyperVertices such that V ( G ) there’s a SuperHyperVertex to have a SuperHyperEdge in common. Thus, in a connected SuperHyperPath N S H P : ( V , E ) , a Failed SuperHyperStable is a SuperHyperSet of the interior SuperHyperVertices with only all exceptions in the form of interior SuperHyperVertices from the common SuperHyperEdges excluding only two interior SuperHyperVertices from the common SuperHyperEdges. a Failed SuperHyperStable has the number of all the interior SuperHyperVertices minus their SuperHyperNeighborhoods plus one. □
Example 6.3.
In the Figure 21, the connected SuperHyperPath N S H P : ( V , E ) , is highlighted and featured. The SuperHyperSet, { V 27 , V 2 , V 7 , V 12 , V 22 , V 25 } , of the SuperHyperVertices of the connected SuperHyperPath N S H P : ( V , E ) , in the SuperHyperModel (21), is the Failed SuperHyperStable.
Proposition 6.4.
Assume a connected SuperHyperCycle N S H C : ( V , E ) . Then a Failed SuperHyperStable is a SuperHyperSet of the interior SuperHyperVertices with only all exceptions in the form of interior SuperHyperVertices from the same SuperHyperNeighborhoods excluding one SuperHyperVertex. a Failed SuperHyperStable has the number of all the SuperHyperEdges plus one and the lower bound is the half number of all the SuperHyperEdges plus one.
Proof. 
Assume a connected SuperHyperCycle N S H C : ( V , E ) . Let a SuperHyperEdge has some SuperHyperVertices. Consider all numbers of those SuperHyperVertices from that SuperHyperEdge excluding more than two distinct SuperHyperVertices, exclude to any given SuperHyperSet of the SuperHyperVertices. Consider there’s a Failed SuperHyperStable with the least cardinality, the lower sharp bound for cardinality. Assume a connected neutrosophic SuperHyperGraph N S H G : ( V , E ) . The SuperHyperSet of the SuperHyperVertices V V { z } is a SuperHyperSet S of SuperHyperVertices such that there’s a SuperHyperVertex to have a SuperHyperEdge in common but it isn’t a Failed SuperHyperStable. Since it doesn’t have the maximum cardinality of a SuperHyperSet S of SuperHyperVertices such that there’s a SuperHyperVertex to have a SuperHyperEdge in common. The SuperHyperSet of the SuperHyperVertices V V { x , y , z } is the maximum cardinality of a SuperHyperSet S of SuperHyperVertices but it isn’t a Failed SuperHyperStable. Since it doesn’t do the procedure such that such that there’s a SuperHyperVertex to have a SuperHyperEdge in common. [there’er at least three SuperHyperVertices inside implying there’s, sometimes in the connected neutrosophic SuperHyperGraph N S H G : ( V , E ) , a SuperHyperVertex, titled its SuperHyperNeighbor, to that SuperHyperVertex in the SuperHyperSet S so as S doesn’t do “the procedure”.]. There’re only two SuperHyperVertices inside the intended SuperHyperSet, V V { x , z } . Thus the obvious Failed SuperHyperStable, V V { x , z } , is up. The obvious simple type-SuperHyperSet of the Failed SuperHyperStable, V V { x , z } , is a SuperHyperSet, V V { x , z } , includes only two SuperHyperVertices doesn’t form any kind of pairs are titled SuperHyperNeighbors in a connected neutrosophic SuperHyperGraph N S H G : ( V , E ) . Since the SuperHyperSet of the SuperHyperVertices V V { x , z } , is the maximum cardinality of a SuperHyperSet S of SuperHyperVertices such that V ( G ) there’s a SuperHyperVertex to have a SuperHyperEdge in common. Thus, in a connected SuperHyperCycle N S H C : ( V , E ) , a Failed SuperHyperStable is a SuperHyperSet of the interior SuperHyperVertices with only all exceptions in the form of interior SuperHyperVertices from the same SuperHyperNeighborhoods excluding one SuperHyperVertex. a Failed SuperHyperStable has the number of all the SuperHyperEdges plus one and the lower bound is the half number of all the SuperHyperEdges plus one. □
Example 6.5.
In the Figure 22, the connected SuperHyperCycle N S H C : ( V , E ) , is highlighted and featured. The obtained SuperHyperSet, by the Algorithm in previous result, of the SuperHyperVertices of the connected SuperHyperCycle N S H C : ( V , E ) , in the SuperHyperModel (22),
{ { P 13 , J 13 , K 13 , H 13 } , { Z 13 , W 13 , V 13 } , { U 14 , T 14 , R 14 , S 14 } , { P 15 , J 15 , K 15 , R 15 } , { J 5 , O 5 , K 5 , L 5 } , { J 5 , O 5 , K 5 , L 5 } , V 3 , { U 6 , H 7 , J 7 , K 7 , O 7 , L 7 , P 7 } , { T 8 , U 8 , V 8 , S 8 } , { T 9 , K 9 , J 9 } , { H 10 , J 10 , E 10 , R 10 , W 9 } , { S 11 , R 11 , O 11 , L 11 } , { U 12 , V 12 , W 12 , Z 12 , O 12 } , { S 7 , T 7 , R 7 , U 7 } } ,
is the Failed SuperHyperStable.
Proposition 6.6.
Assume a connected SuperHyperStar N S H S : ( V , E ) . Then a Failed SuperHyperStable is a SuperHyperSet of the interior SuperHyperVertices, excluding the SuperHyperCenter, with only all exceptions in the form of interior SuperHyperVertices from common SuperHyperEdge, excluding only one SuperHyperVertex. a Failed SuperHyperStable has the number of the cardinality of the second SuperHyperPart plus one.
Proof. 
Assume a connected SuperHyperStar N S H S : ( V , E ) . Let a SuperHyperEdge has some SuperHyperVertices. Consider all numbers of those SuperHyperVertices from that SuperHyperEdge excluding more than two distinct SuperHyperVertices, exclude to any given SuperHyperSet of the SuperHyperVertices. Consider there’s a Failed SuperHyperStable with the least cardinality, the lower sharp bound for cardinality. Assume a connected neutrosophic SuperHyperGraph N S H G : ( V , E ) . The SuperHyperSet of the SuperHyperVertices V V { z } is a SuperHyperSet S of SuperHyperVertices such that there’s a SuperHyperVertex to have a SuperHyperEdge in common but it isn’t a Failed SuperHyperStable. Since it doesn’t have the maximum cardinality of a SuperHyperSet S of SuperHyperVertices such that there’s a SuperHyperVertex to have a SuperHyperEdge in common. The SuperHyperSet of the SuperHyperVertices V V { x , y , z } is the maximum cardinality of a SuperHyperSet S of SuperHyperVertices but it isn’t a Failed SuperHyperStable. Since it doesn’t do the procedure such that such that there’s a SuperHyperVertex to have a SuperHyperEdge in common. [there’er at least three SuperHyperVertices inside implying there’s, sometimes in the connected neutrosophic SuperHyperGraph N S H G : ( V , E ) , a SuperHyperVertex, titled its SuperHyperNeighbor, to that SuperHyperVertex in the SuperHyperSet S so as S doesn’t do “the procedure”.]. There’re only two SuperHyperVertices inside the intended SuperHyperSet, V V { x , z } . Thus the obvious Failed SuperHyperStable, V V { x , z } , is up. The obvious simple type-SuperHyperSet of the Failed SuperHyperStable, V V { x , z } , is a SuperHyperSet, V V { x , z } , includes only two SuperHyperVertices doesn’t form any kind of pairs are titled SuperHyperNeighbors in a connected neutrosophic SuperHyperGraph N S H G : ( V , E ) . Since the SuperHyperSet of the SuperHyperVertices V V { x , z } , is the maximum cardinality of a SuperHyperSet S of SuperHyperVertices such that V ( G ) there’s a SuperHyperVertex to have a SuperHyperEdge in common. Thus, in a connected SuperHyperStar N S H S : ( V , E ) , a Failed SuperHyperStable is a SuperHyperSet of the interior SuperHyperVertices, excluding the SuperHyperCenter, with only all exceptions in the form of interior SuperHyperVertices from common SuperHyperEdge, excluding only one SuperHyperVertex. a Failed SuperHyperStable has the number of the cardinality of the second SuperHyperPart plus one. □
Example 6.7.
In the Figure 23, the connected SuperHyperStar N S H S : ( V , E ) , is highlighted and featured. The obtained SuperHyperSet, by the Algorithm in previous result, of the SuperHyperVertices of the connected SuperHyperStar N S H S : ( V , E ) , in the SuperHyperModel (23),
{ { V 14 , O 14 , U 14 } , { W 14 , D 15 , Z 14 , C 15 , E 15 } , { P 3 , O 3 , R 3 , L 3 , S 3 } , { P 2 , T 2 , S 2 , R 2 , O 2 } , { O 6 , O 7 , K 7 , P 6 , H 7 , J 7 , E 7 , L 7 } , { J 8 , Z 10 , W 10 , V 10 } , { W 11 , V 11 , Z 11 , C 12 } , { U 13 , T 13 , R 13 , S 13 } , { H 13 } , { E 13 , D 13 , C 13 , Z 12 } , }
is the Failed SuperHyperStable.
Proposition 6.8.
Assume a connected SuperHyperBipartite N S H B : ( V , E ) . Then a Failed SuperHyperStable is a SuperHyperSet of the interior SuperHyperVertices with only all exceptions in the form of interior SuperHyperVertices titled SuperHyperNeighbors with only one exception. a Failed SuperHyperStable has the number of the cardinality of the first SuperHyperPart multiplies with the cardinality of the second SuperHyperPart plus one.
Proof. 
Assume a connected SuperHyperBipartite N S H B : ( V , E ) . Let a SuperHyperEdge has some SuperHyperVertices. Consider all numbers of those SuperHyperVertices from that SuperHyperEdge excluding more than two distinct SuperHyperVertices, exclude to any given SuperHyperSet of the SuperHyperVertices. Consider there’s a Failed SuperHyperStable with the least cardinality, the lower sharp bound for cardinality. Assume a connected neutrosophic SuperHyperGraph N S H G : ( V , E ) . The SuperHyperSet of the SuperHyperVertices V V { z } is a SuperHyperSet S of SuperHyperVertices such that there’s a SuperHyperVertex to have a SuperHyperEdge in common but it isn’t a Failed SuperHyperStable. Since it doesn’t have the maximum cardinality of a SuperHyperSet S of SuperHyperVertices such that there’s a SuperHyperVertex to have a SuperHyperEdge in common. The SuperHyperSet of the SuperHyperVertices V V { x , y , z } is the maximum cardinality of a SuperHyperSet S of SuperHyperVertices but it isn’t a Failed SuperHyperStable. Since it doesn’t do the procedure such that such that there’s a SuperHyperVertex to have a SuperHyperEdge in common. [there’er at least three SuperHyperVertices inside implying there’s, sometimes in the connected neutrosophic SuperHyperGraph N S H G : ( V , E ) , a SuperHyperVertex, titled its SuperHyperNeighbor, to that SuperHyperVertex in the SuperHyperSet S so as S doesn’t do “the procedure”.]. There’re only two SuperHyperVertices inside the intended SuperHyperSet, V V { x , z } . Thus the obvious Failed SuperHyperStable, V V { x , z } , is up. The obvious simple type-SuperHyperSet of the Failed SuperHyperStable, V V { x , z } , is a SuperHyperSet, V V { x , z } , includes only two SuperHyperVertices doesn’t form any kind of pairs are titled SuperHyperNeighbors in a connected neutrosophic SuperHyperGraph N S H G : ( V , E ) . Since the SuperHyperSet of the SuperHyperVertices V V { x , z } , is the maximum cardinality of a SuperHyperSet S of SuperHyperVertices such that V ( G ) there’s a SuperHyperVertex to have a SuperHyperEdge in common. Thus, in a connected SuperHyperBipartite N S H B : ( V , E ) , a Failed SuperHyperStable is a SuperHyperSet of the interior SuperHyperVertices with only all exceptions in the form of interior SuperHyperVertices titled SuperHyperNeighbors with only one exception. a Failed SuperHyperStable has the number of the cardinality of the first SuperHyperPart multiplies with the cardinality of the second SuperHyperPart plus one. □
Example 6.9.
In the Figure 24, the connected SuperHyperBipartite N S H B : ( V , E ) , is highlighted and featured. The obtained SuperHyperSet, by the Algorithm in previous result, of the SuperHyperVertices of the connected SuperHyperBipartite N S H B : ( V , E ) , in the SuperHyperModel (24),
{ V 1 , { C 4 , D 4 , E 4 , H 4 } , { K 4 , J 4 , L 4 , O 4 } , { W 2 , Z 2 , C 3 } , { C 13 , Z 12 , V 12 , W 12 } ,
is the Failed SuperHyperStable.
Proposition 6.10.
Assume a connected SuperHyperMultipartite N S H M : ( V , E ) . Then a Failed SuperHyperStable is a SuperHyperSet of the interior SuperHyperVertices with only one exception in the form of interior SuperHyperVertices from a SuperHyperPart and only one exception in the form of interior SuperHyperVertices from another SuperHyperPart titled “SuperHyperNeighbors” with neglecting and ignoring one of them. a Failed SuperHyperStable has the number of all the summation on the cardinality of the all SuperHyperParts form distinct SuperHyperEdges plus one.
Proof. 
Assume a connected SuperHyperMultipartite N S H M : ( V , E ) . Let a SuperHyperEdge has some SuperHyperVertices. Consider all numbers of those SuperHyperVertices from that SuperHyperEdge excluding more than two distinct SuperHyperVertices, exclude to any given SuperHyperSet of the SuperHyperVertices. Consider there’s a Failed SuperHyperStable with the least cardinality, the lower sharp bound for cardinality. Assume a connected neutrosophic SuperHyperGraph N S H G : ( V , E ) . The SuperHyperSet of the SuperHyperVertices V V { z } is a SuperHyperSet S of SuperHyperVertices such that there’s a SuperHyperVertex to have a SuperHyperEdge in common but it isn’t a Failed SuperHyperStable. Since it doesn’t have the maximum cardinality of a SuperHyperSet S of SuperHyperVertices such that there’s a SuperHyperVertex to have a SuperHyperEdge in common. The SuperHyperSet of the SuperHyperVertices V V { x , y , z } is the maximum cardinality of a SuperHyperSet S of SuperHyperVertices but it isn’t a Failed SuperHyperStable. Since it doesn’t do the procedure such that such that there’s a SuperHyperVertex to have a SuperHyperEdge in common. [there’er at least three SuperHyperVertices inside implying there’s, sometimes in the connected neutrosophic SuperHyperGraph N S H G : ( V , E ) , a SuperHyperVertex, titled its SuperHyperNeighbor, to that SuperHyperVertex in the SuperHyperSet S so as S doesn’t do “the procedure”.]. There’re only two SuperHyperVertices inside the intended SuperHyperSet, V V { x , z } . Thus the obvious Failed SuperHyperStable, V V { x , z } , is up. The obvious simple type-SuperHyperSet of the Failed SuperHyperStable, V V { x , z } , is a SuperHyperSet, V V { x , z } , includes only two SuperHyperVertices doesn’t form any kind of pairs are titled SuperHyperNeighbors in a connected neutrosophic SuperHyperGraph N S H G : ( V , E ) . Since the SuperHyperSet of the SuperHyperVertices V V { x , z } , is the maximum cardinality of a SuperHyperSet S of SuperHyperVertices such that V ( G ) there’s a SuperHyperVertex to have a SuperHyperEdge in common. Thus, in a connected SuperHyperMultipartite N S H M : ( V , E ) , a Failed SuperHyperStable is a SuperHyperSet of the interior SuperHyperVertices with only one exception in the form of interior SuperHyperVertices from a SuperHyperPart and only one exception in the form of interior SuperHyperVertices from another SuperHyperPart titled “SuperHyperNeighbors” with neglecting and ignoring one of them. a Failed SuperHyperStable has the number of all the summation on the cardinality of the all SuperHyperParts form distinct SuperHyperEdges plus one. □
Example 6.11.
In the Figure 25, the connected SuperHyperMultipartite N S H M : ( V , E ) , is highlighted and featured. The obtained SuperHyperSet, by the Algorithm in previous result, of the SuperHyperVertices of the connected SuperHyperMultipartite N S H M : ( V , E ) ,
{ { { L 4 , E 4 , O 4 , D 4 , J 4 , K 4 , H 4 } , { S 10 , R 10 , P 10 } , { Z 7 , W 7 } , { U 7 , V 7 } } ,
in the SuperHyperModel (25), is the Failed SuperHyperStable.
Proposition 6.12.
Assume a connected SuperHyperWheel N S H W : ( V , E ) . Then a Failed SuperHyperStable is a SuperHyperSet of the interior SuperHyperVertices, excluding the SuperHyperCenter, with only one exception in the form of interior SuperHyperVertices from same SuperHyperEdge with the exclusion once. a Failed SuperHyperStable has the number of all the number of all the SuperHyperEdges have no common SuperHyperNeighbors for a SuperHyperVertex with the exclusion once.
Proof. 
Assume a connected SuperHyperWheel N S H W : ( V , E ) . Let a SuperHyperEdge has some SuperHyperVertices. Consider all numbers of those SuperHyperVertices from that SuperHyperEdge excluding more than two distinct SuperHyperVertices, exclude to any given SuperHyperSet of the SuperHyperVertices. Consider there’s a Failed SuperHyperStable with the least cardinality, the lower sharp bound for cardinality. Assume a connected neutrosophic SuperHyperGraph N S H G : ( V , E ) . The SuperHyperSet of the SuperHyperVertices V V { z } is a SuperHyperSet S of SuperHyperVertices such that there’s a SuperHyperVertex to have a SuperHyperEdge in common but it isn’t a Failed SuperHyperStable. Since it doesn’t have the maximum cardinality of a SuperHyperSet S of SuperHyperVertices such that there’s a SuperHyperVertex to have a SuperHyperEdge in common. The SuperHyperSet of the SuperHyperVertices V V { x , y , z } is the maximum cardinality of a SuperHyperSet S of SuperHyperVertices but it isn’t a Failed SuperHyperStable. Since it doesn’t do the procedure such that such that there’s a SuperHyperVertex to have a SuperHyperEdge in common. [there’er at least three SuperHyperVertices inside implying there’s, sometimes in the connected neutrosophic SuperHyperGraph N S H G : ( V , E ) , a SuperHyperVertex, titled its SuperHyperNeighbor, to that SuperHyperVertex in the SuperHyperSet S so as S doesn’t do “the procedure”.]. There’re only two SuperHyperVertices inside the intended SuperHyperSet, V V { x , z } . Thus the obvious Failed SuperHyperStable, V V { x , z } , is up. The obvious simple type-SuperHyperSet of the Failed SuperHyperStable, V V { x , z } , is a SuperHyperSet, V V { x , z } , includes only two SuperHyperVertices doesn’t form any kind of pairs are titled SuperHyperNeighbors in a connected neutrosophic SuperHyperGraph N S H G : ( V , E ) . Since the SuperHyperSet of the SuperHyperVertices V V { x , z } , is the maximum cardinality of a SuperHyperSet S of SuperHyperVertices such that V ( G ) there’s a SuperHyperVertex to have a SuperHyperEdge in common. Thus, in a connected SuperHyperWheel N S H W : ( V , E ) , a Failed SuperHyperStable is a SuperHyperSet of the interior SuperHyperVertices, excluding the SuperHyperCenter, with only one exception in the form of interior SuperHyperVertices from same SuperHyperEdge with the exclusion once. a Failed SuperHyperStable has the number of all the number of all the SuperHyperEdges have no common SuperHyperNeighbors for a SuperHyperVertex with the exclusion once. □
Example 6.13.
In the Figure 26, the connected SuperHyperWheel N S H W : ( V , E ) , is highlighted and featured. The obtained SuperHyperSet, by the Algorithm in previous result, of the SuperHyperVertices of the connected SuperHyperWheel N S H W : ( V , E ) ,
{ V 5 , { Z 13 , W 13 , U 13 , V 13 , O 14 } , { T 10 , K 10 , J 10 } , { E 7 , C 7 , Z 6 } , { K 7 , J 7 , L 7 } , { T 14 , U 14 , R 15 , S 15 } } ,
in the SuperHyperModel (26), is the Failed SuperHyperStable.

7. Open Problems

In what follows, some “problems” and some “questions” are proposed.
The Failed SuperHyperStable and the neutrosophic Failed SuperHyperStable are defined on a real-world application, titled “Cancer’s Recognitions”.
Question 7.1.
Which the else SuperHyperModels could be defined based on Cancer’s recognitions?
Question 7.2.
Are there some SuperHyperNotions related to Failed SuperHyperStable and the neutrosophic Failed SuperHyperStable?
Question 7.3.
Are there some Algorithms to be defined on the SuperHyperModels to compute them?
Question 7.4.
Which the SuperHyperNotions are related to beyond the Failed SuperHyperStable and the neutrosophic Failed SuperHyperStable?
Problem 7.5.
The Failed SuperHyperStable and the neutrosophic Failed SuperHyperStable do a SuperHyperModel for the Cancer’s recognitions and they’re based on Failed SuperHyperStable, are there else?
Problem 7.6.
Which the fundamental SuperHyperNumbers are related to these SuperHyperNumbers types-results?
Problem 7.7.
What’s the independent research based on Cancer’s recognitions concerning the multiple types of SuperHyperNotions?

8. Conclusion and Closing Remarks

In this research, the cancer is chosen as an phenomenon. Some general approaches are applied on it. Beyond that, some general arrangements of the situations are redefined alongside detailed-oriented illustrations, clarifications, analysis on the featured dense figures. The research proposes theoretical results on the cancer and mentioned cases only give us the perspective on the theoretical aspect with enriched background of the the mathematical framework arise from Extreme Failed SuperHyperClique theory, Neutrosophic Failed SuperHyperClique theory, and (Neutrosophic) SuperHyperGraphs theory.
In the Table 1, the structures of this research on what’s done and what’ll be Done are pointed out and figured out.

References

  1. Henry Garrett, “Properties of SuperHyperGraph and Neutrosophic SuperHyperGraph”, Neutrosophic Sets and Systems 49 (2022) 531-561. http://fs.unm.edu/NSS/NeutrosophicSuperHyperGraph34.pdf. https://digitalrepository.unm.edu/nssjournal/vol49/iss1/34. [CrossRef]
  2. Henry Garrett, “Neutrosophic Co-degree and Neutrosophic Degree alongside Chromatic Numbers in the Setting of Some Classes Related to Neutrosophic Hypergraphs”, J Curr Trends Comp Sci Res 1(1) (2022) 06-14. [CrossRef]
  3. Henry Garrett, “Super Hyper Dominating and Super Hyper Resolving on Neutrosophic Super Hyper Graphs and Their Directions in Game Theory and Neutrosophic Super Hyper Classes”, J Math Techniques Comput Math 1(3) (2022) 242-263. [CrossRef]
  4. Garrett, Henry. “0039 | Closing Numbers and Super-Closing Numbers as (Dual)Resolving and (Dual)Coloring alongside (Dual)Dominating in (Neutrosophic)n-SuperHyperGraph.” CERN European Organization for Nuclear Research - Zenodo, Nov. 2022. CERN European Organization for Nuclear Research. https://oa.mg/work/10.5281/zenodo.6319942. [CrossRef]
  5. Garrett, Henry. “0049 | (Failed)1-Zero-Forcing Number in Neutrosophic Graphs.” CERN European Organization for Nuclear Research - Zenodo, Feb. 2022. CERN European Organization for Nuclear Research. https://oa.mg/work/10.13140/rg.2.2.35241.26724. [CrossRef]
  6. Henry Garrett, “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010105. [CrossRef]
  7. Henry Garrett, “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints”, Preprints 2023, 2023010088. [CrossRef]
  8. Henry Garrett, “Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To Use Neutrosophic SuperHyperGraphs on Cancer's Neutrosophic Recognition And Beyond”, Preprints 2023, 2023010044. [CrossRef]
  9. Henry Garrett, “(Neutrosophic) SuperHyperStable on Cancer's Recognition by Well- SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010043. [CrossRef]
  10. Henry Garrett, “Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic) SuperHyperModeling in Cancer's Recognitions And (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010105. [CrossRef]
  11. Henry Garrett, “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic SuperHyperStable To Act on Cancer's Neutrosophic Recognitions In Special ViewPoints”, Preprints 2023, 2023010088. [CrossRef]
  12. Henry Garrett, “(Neutrosophic) SuperHyperModeling of Cancer's Recognitions Featuring (Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, Preprints 2023, 2022120549. [CrossRef]
  13. Henry Garrett, “(Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With (Neutrosophic) SuperHyperModeling of Cancer's Recognitions And Related (Neutrosophic) SuperHyperClasses”, Preprints 2022, 2022120540. [CrossRef]
  14. Henry Garrett, “SuperHyperGirth on SuperHyperGraph and Neutrosophic SuperHyperGraph With SuperHyperModeling of Cancer's Recognitions”, Preprints 2022, 2022120500. [CrossRef]
  15. Henry Garrett, “Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic SuperHyperGraphs and SuperHyperGraphs Alongside Applications in Cancer's Treatments”, Preprints 2022, 2022120324. [CrossRef]
  16. Henry Garrett, “SuperHyperDominating and SuperHyperResolving on Neutrosophic SuperHyperGraphs And Their Directions in Game Theory and Neutrosophic SuperHyperClasses”, Preprints 2022, 2022110576. [CrossRef]
  17. Henry Garrett, “Extreme Failed SuperHyperClique Decides the Failures on the Cancer's Recognition in the Perfect Connections of Cancer's Attacks By SuperHyperModels Named (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023. [CrossRef]
  18. Henry Garrett, “Extreme Failed SuperHyperClique Decides the Failures on the Cancer's Recognition in the Perfect Connections of Cancer's Attacks By SuperHyperModels Named (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023. [CrossRef]
  19. Henry Garrett, “Perfect Directions Toward Idealism in Cancer's Neutrosophic Recognition Forwarding Neutrosophic SuperHyperClique on Neutrosophic SuperHyperGraphs”, ResearchGate 2023. [CrossRef]
  20. Henry Garrett, “Demonstrating Complete Connections in Every Embedded Regions and Sub-Regions in the Terms of Cancer's Recognition and (Neutrosophic) SuperHyperGraphs With (Neutrosophic) SuperHyperClique”, ResearchGate 2023. [CrossRef]
  21. Henry Garrett, “Different Neutrosophic Types of Neutrosophic Regions titled neutrosophic Failed SuperHyperStable in Cancer's Neutrosophic Recognition modeled in the Form of Neutrosophic SuperHyperGraphs”, ResearchGate 2023. [CrossRef]
  22. Henry Garrett, “Using the Tool As (Neutrosophic) Failed SuperHyperStable To SuperHyperModel Cancer's Recognition Titled (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023. [CrossRef]
  23. Henry Garrett, “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic SuperHyperStable To Act on Cancer's Neutrosophic Recognitions In Special ViewPoints”, ResearchGate 2023. [CrossRef]
  24. Henry Garrett, “(Neutrosophic) SuperHyperStable on Cancer's Recognition by Well-SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023. [CrossRef]
  25. Henry Garrett, “Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To Use Neutrosophic SuperHyperGraphs on Cancer's Neutrosophic Recognition And Beyond”, ResearchGate 2022. [CrossRef]
  26. Henry Garrett, “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer's Recognitions And (Neutrosophic) SuperHyperGraphs”, ResearchGate 2022. [CrossRef]
  27. Henry Garrett, “Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic) SuperHyperModeling in Cancer's Recognitions And (Neutrosophic) SuperHyperGraphs”, ResearchGate 2022. [CrossRef]
  28. Henry Garrett, “Basic Neutrosophic Notions Concerning SuperHyperDominating and Neutrosophic SuperHyperResolving in SuperHyperGraph”, ResearchGate 2022. [CrossRef]
  29. Henry Garrett, “Initial Material of Neutrosophic Preliminaries to Study Some Neutrosophic Notions Based on Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic SuperHyperGraph (NSHG)”, ResearchGate 2022. [CrossRef]
  30. Henry Garrett, (2022). “Beyond Neutrosophic Graphs”, Ohio: E-publishing: Educational Publisher 1091 West 1st Ave Grandview Heights, Ohio 43212 United States. ISBN: 979-1-59973-725-6 (http://fs.unm.edu/BeyondNeutrosophicGraphs.pdf).
  31. Henry Garrett, (2022). “Neutrosophic Duality”, Florida: GLOBAL KNOWLEDGE - Publishing House 848 Brickell Ave Ste 950 Miami, Florida 33131 United States. ISBN: 978-1-59973-743-0 (http://fs.unm.edu/NeutrosophicDuality.pdf).
  32. F. Smarandache, “Extension of HyperGraph to n-SuperHyperGraph and to Plithogenic n-SuperHyperGraph, and Extension of HyperAlgebra to n-ary (Classical-/Neutro-/Anti-) HyperAlgebra”, Neutrosophic Sets and Systems 33 (2020) 290-296. [CrossRef]
  33. M. Akram et al., “Single-valued neutrosophic Hypergraphs”, TWMS J. App. Eng. Math. 8 (1) (2018) 122-135.
  34. S. Broumi et al., “Single-valued neutrosophic graphs”, Journal of New Theory 10 (2016) 86-101.
  35. H. Wang et al., “Single-valued neutrosophic sets”, Multispace and Multistructure 4 (2010) 410-413.
  36. H.T. Nguyen and E.A. Walker, “A First course in fuzzy logic”, CRC Press, 2006.
  37. M. Akram, and G. Shahzadi, “Operations on Single-Valued Neutrosophic Graphs”, Journal of uncertain systems 11 (1) (2017) 1-26.
  38. G. Argiroffo et al., “Polyhedra associated with locating-dominating, open locating-dominating and locating total-dominating sets in graphs”, Discrete Applied Mathematics (2022). [CrossRef]
  39. L. Aronshtam, and H. Ilani, “Bounds on the average and minimum attendance in preference-based activity scheduling”, Discrete Applied Mathematics 306 (2022) 114-119. [CrossRef]
  40. J. Asplund et al., “A Vizing-type result for semi-total domination”, Discrete Applied Mathematics 258 (2019) 8-12. [CrossRef]
  41. K. Atanassov, “Intuitionistic fuzzy sets”, Fuzzy Sets Syst. 20 (1986) 87-96. [CrossRef]
  42. R.A. Beeler et al., “Total domination cover rubbling”, Discrete Applied Mathematics 283 (2020) 133-141. [CrossRef]
  43. S. Bermudo et al., “On the global total k-domination number of graphs”, Discrete Applied Mathematics 263 (2019) 42-50. [CrossRef]
  44. M. Bold, and M. Goerigk, “Investigating the recoverable robust single machine scheduling problem under interval uncertainty”, Discrete Applied Mathematics 313 (2022) 99-114. [CrossRef]
  45. S. Broumi et al., “Single-valued neutrosophic graphs”, Journal of New Theory 10 (2016) 86-101.
  46. V. Gledel et al., “Maker–Breaker total domination game”, Discrete Applied Mathematics 282 (2020) 96-107. [CrossRef]
  47. M.A. Henning, and A. Yeo, “A new upper bound on the total domination number in graphs with minimum degree six”, Discrete Applied Mathematics 302 (2021) 1-7. [CrossRef]
  48. V. Irsic, “Effect of predomination and vertex removal on the game total domination number of a graph”, Discrete Applied Mathematics 257 (2019) 216-225. [CrossRef]
  49. B.S. Panda, and P. Goyal, “Hardness results of global total k-domination problem in graphs”, Discrete Applied Mathematics (2021). [CrossRef]
  50. N. Shah, and A. Hussain, “Neutrosophic soft graphs”, Neutrosophic Set and Systems 11 (2016) 31-44.
  51. A. Shannon and K.T. Atanassov, “A first step to a theory of the intuitionistic fuzzy graphs”, Proceeding of FUBEST (Lakov, D., Ed.) Sofia (1994) 59-61.
  52. F. Smarandache, “A Unifying field in logics neutrosophy: Neutrosophic probability, set and logic, Rehoboth: ” American Research Press (1998).
  53. H. Wang et al., “Single-valued neutrosophic sets”, Multispace and Multistructure 4 (2010) 410-413.
  54. L. A. Zadeh, “Fuzzy sets”, Information and Control 8 (1965) 338-354.
Figure 1. The SuperHyperGraphs Associated to the Notions of Failed SuperHyperStable in the Example (5.1)
Figure 1. The SuperHyperGraphs Associated to the Notions of Failed SuperHyperStable in the Example (5.1)
Preprints 67014 g001
Figure 2. The SuperHyperGraphs Associated to the Notions of Failed SuperHyperStable in the Example (5.1)
Figure 2. The SuperHyperGraphs Associated to the Notions of Failed SuperHyperStable in the Example (5.1)
Preprints 67014 g002
Figure 3. The SuperHyperGraphs Associated to the Notions of Failed SuperHyperStable in the Example (5.1)
Figure 3. The SuperHyperGraphs Associated to the Notions of Failed SuperHyperStable in the Example (5.1)
Preprints 67014 g003
Figure 4. The SuperHyperGraphs Associated to the Notions of Failed SuperHyperStable in the Example (5.1)
Figure 4. The SuperHyperGraphs Associated to the Notions of Failed SuperHyperStable in the Example (5.1)
Preprints 67014 g004
Figure 5. The SuperHyperGraphs Associated to the Notions of Failed SuperHyperStable in the Example (5.1)
Figure 5. The SuperHyperGraphs Associated to the Notions of Failed SuperHyperStable in the Example (5.1)
Preprints 67014 g005
Figure 6. The SuperHyperGraphs Associated to the Notions of Failed SuperHyperStable in the Example (5.1)
Figure 6. The SuperHyperGraphs Associated to the Notions of Failed SuperHyperStable in the Example (5.1)
Preprints 67014 g006
Figure 7. The SuperHyperGraphs Associated to the Notions of Failed SuperHyperStable in the Example (5.1)
Figure 7. The SuperHyperGraphs Associated to the Notions of Failed SuperHyperStable in the Example (5.1)
Preprints 67014 g007
Figure 8. The SuperHyperGraphs Associated to the Notions of Failed SuperHyperStable in the Example (5.1)
Figure 8. The SuperHyperGraphs Associated to the Notions of Failed SuperHyperStable in the Example (5.1)
Preprints 67014 g008
Figure 9. The SuperHyperGraphs Associated to the Notions of Failed SuperHyperStable in the Example (5.1)
Figure 9. The SuperHyperGraphs Associated to the Notions of Failed SuperHyperStable in the Example (5.1)
Preprints 67014 g009
Figure 10. The SuperHyperGraphs Associated to the Notions of Failed SuperHyperStable in the Example (5.1)
Figure 10. The SuperHyperGraphs Associated to the Notions of Failed SuperHyperStable in the Example (5.1)
Preprints 67014 g010
Figure 11. The SuperHyperGraphs Associated to the Notions of Failed SuperHyperStable in the Example (5.1)
Figure 11. The SuperHyperGraphs Associated to the Notions of Failed SuperHyperStable in the Example (5.1)
Preprints 67014 g011
Figure 12. The SuperHyperGraphs Associated to the Notions of Failed SuperHyperStable in the Example (5.1)
Figure 12. The SuperHyperGraphs Associated to the Notions of Failed SuperHyperStable in the Example (5.1)
Preprints 67014 g012
Figure 13. The SuperHyperGraphs Associated to the Notions of Failed SuperHyperStable in the Example (5.1)
Figure 13. The SuperHyperGraphs Associated to the Notions of Failed SuperHyperStable in the Example (5.1)
Preprints 67014 g013
Figure 14. The SuperHyperGraphs Associated to the Notions of Failed SuperHyperStable in the Example (5.1)
Figure 14. The SuperHyperGraphs Associated to the Notions of Failed SuperHyperStable in the Example (5.1)
Preprints 67014 g014
Figure 15. The SuperHyperGraphs Associated to the Notions of Failed SuperHyperStable in the Example (5.1)
Figure 15. The SuperHyperGraphs Associated to the Notions of Failed SuperHyperStable in the Example (5.1)
Preprints 67014 g015
Figure 16. The SuperHyperGraphs Associated to the Notions of Failed SuperHyperStable in the Example (5.1)
Figure 16. The SuperHyperGraphs Associated to the Notions of Failed SuperHyperStable in the Example (5.1)
Preprints 67014 g016
Figure 17. The SuperHyperGraphs Associated to the Notions of Failed SuperHyperStable in the Example (5.1)
Figure 17. The SuperHyperGraphs Associated to the Notions of Failed SuperHyperStable in the Example (5.1)
Preprints 67014 g017
Figure 18. The SuperHyperGraphs Associated to the Notions of Failed SuperHyperStable in the Example (5.1)
Figure 18. The SuperHyperGraphs Associated to the Notions of Failed SuperHyperStable in the Example (5.1)
Preprints 67014 g018
Figure 19. The SuperHyperGraphs Associated to the Notions of Failed SuperHyperStable in the Example (5.1)
Figure 19. The SuperHyperGraphs Associated to the Notions of Failed SuperHyperStable in the Example (5.1)
Preprints 67014 g019
Figure 20. The SuperHyperGraphs Associated to the Notions of Failed SuperHyperStable in the Example (5.1)
Figure 20. The SuperHyperGraphs Associated to the Notions of Failed SuperHyperStable in the Example (5.1)
Preprints 67014 g020
Figure 21. A SuperHyperPath Associated to the Notions of Failed SuperHyperStable in the Example (6.3)
Figure 21. A SuperHyperPath Associated to the Notions of Failed SuperHyperStable in the Example (6.3)
Preprints 67014 g021
Figure 22. A SuperHyperCycle Associated to the Notions of Failed SuperHyperStable in the Example (6.5)
Figure 22. A SuperHyperCycle Associated to the Notions of Failed SuperHyperStable in the Example (6.5)
Preprints 67014 g022
Figure 23. A SuperHyperStar Associated to the Notions of Failed SuperHyperStable in the Example (6.7)
Figure 23. A SuperHyperStar Associated to the Notions of Failed SuperHyperStable in the Example (6.7)
Preprints 67014 g023
Figure 24. A SuperHyperBipartite Associated to the Notions of Failed SuperHyperStable in the Example (6.9)
Figure 24. A SuperHyperBipartite Associated to the Notions of Failed SuperHyperStable in the Example (6.9)
Preprints 67014 g024
Figure 25. A SuperHyperMultipartite Associated to the Notions of Failed SuperHyperStable in the Example (6.11)
Figure 25. A SuperHyperMultipartite Associated to the Notions of Failed SuperHyperStable in the Example (6.11)
Preprints 67014 g025
Figure 26. A SuperHyperWheel Associated to the Notions of Failed SuperHyperStable in the Example (6.13)
Figure 26. A SuperHyperWheel Associated to the Notions of Failed SuperHyperStable in the Example (6.13)
Preprints 67014 g026
Table 1. The Structures of This Research On What’s Done and What’ll be Done
Table 1. The Structures of This Research On What’s Done and What’ll be Done
What’s Done What’ll be Done
1. New Generating Neutrosophic SuperHyperGraph 1. Overall Hypothesis
2. Failed SuperHyperStable
3. Neutrosophic Failed SuperHyperStable 2. Cancer’s SuperHyperNumbers
4. Scheme of Cancer’s Recognitions
5. New Reproductions 3. SuperHyperFamilies-types
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.
Prerpints.org logo

Preprints.org is a free preprint server supported by MDPI in Basel, Switzerland.

Subscribe

© 2024 MDPI (Basel, Switzerland) unless otherwise stated