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].
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
Where is the unary operation on the SuperHyperVertices of the SuperHyperGraph to assign the determinacy, the indeterminacy and the neutrality, for 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 be a neutrosophic SuperHyperGraph. Then V is
the dual SuperHyperDefensive Failed SuperHyperStable;
the strong dual SuperHyperDefensive Failed SuperHyperStable;
the connected dual SuperHyperDefensive Failed SuperHyperStable;
the δ-dual SuperHyperDefensive Failed SuperHyperStable;
the strong δ-dual SuperHyperDefensive Failed SuperHyperStable;
the connected δ-dual SuperHyperDefensive Failed SuperHyperStable.
Proposition 3.15. Let be a neutrosophic SuperHyperGraph. Then ∅ is
the SuperHyperDefensive Failed SuperHyperStable;
the strong SuperHyperDefensive Failed SuperHyperStable;
the connected defensive SuperHyperDefensive Failed SuperHyperStable;
the δ-SuperHyperDefensive Failed SuperHyperStable;
the strong δ-SuperHyperDefensive Failed SuperHyperStable;
the connected δ-SuperHyperDefensive Failed SuperHyperStable.
Proposition 3.16 Let be a neutrosophic SuperHyperGraph. Then an independent SuperHyperSet is
the SuperHyperDefensive Failed SuperHyperStable;
the strong SuperHyperDefensive Failed SuperHyperStable;
the connected SuperHyperDefensive Failed SuperHyperStable;
the δ-SuperHyperDefensive Failed SuperHyperStable;
the strong δ-SuperHyperDefensive Failed SuperHyperStable;
the connected δ-SuperHyperDefensive Failed SuperHyperStable.
Proposition 3.17. Let be a neutrosophic SuperHyperUniform SuperHyperGraph which is a SuperHyperCycle/SuperHyperPath. Then V is a maximal
SuperHyperDefensive Failed SuperHyperStable;
strong SuperHyperDefensive Failed SuperHyperStable;
connected SuperHyperDefensive Failed SuperHyperStable;
-SuperHyperDefensive Failed SuperHyperStable;
strong -SuperHyperDefensive Failed SuperHyperStable;
connected -SuperHyperDefensive Failed SuperHyperStable;
Where the exterior SuperHyperVertices and the interior SuperHyperVertices coincide.
Proposition 3.18. Let be a neutrosophic SuperHyperGraph which is a SuperHyperUniform SuperHyperWheel. Then V is a maximal
dual SuperHyperDefensive Failed SuperHyperStable;
strong dual SuperHyperDefensive Failed SuperHyperStable;
connected dual SuperHyperDefensive Failed SuperHyperStable;
-dual SuperHyperDefensive Failed SuperHyperStable;
strong -dual SuperHyperDefensive Failed SuperHyperStable;
connected -dual SuperHyperDefensive Failed SuperHyperStable;
Where the exterior SuperHyperVertices and the interior SuperHyperVertices coincide.
Proposition 3.19. Let be a neutrosophic SuperHyperUniform SuperHyperGraph which is a SuperHyperCycle/SuperHyperPath. Then the number of
the Failed SuperHyperStable;
the Failed SuperHyperStable;
the connected Failed SuperHyperStable;
the -Failed SuperHyperStable;
the strong -Failed SuperHyperStable;
the connected -Failed SuperHyperStable.
is one and it’s only Where the exterior SuperHyperVertices and the interior SuperHyperVertices coincide.
Proposition 3.20. Let be a neutrosophic SuperHyperUniform SuperHyperGraph which is a SuperHyperWheel. Then the number of
the dual Failed SuperHyperStable;
the dual Failed SuperHyperStable;
the dual connected Failed SuperHyperStable;
the dual -Failed SuperHyperStable;
the strong dual -Failed SuperHyperStable;
the connected dual -Failed SuperHyperStable.
is one and it’s only Where the exterior SuperHyperVertices and the interior SuperHyperVertices coincide.
Proposition 3.21. Let 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
dual SuperHyperDefensive Failed SuperHyperStable;
strong dual SuperHyperDefensive Failed SuperHyperStable;
connected dual SuperHyperDefensive Failed SuperHyperStable;
-dual SuperHyperDefensive Failed SuperHyperStable;
strong -dual SuperHyperDefensive Failed SuperHyperStable;
connected -dual SuperHyperDefensive Failed SuperHyperStable.
Proposition 3.22. Let 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
SuperHyperDefensive Failed SuperHyperStable;
strong SuperHyperDefensive Failed SuperHyperStable;
connected SuperHyperDefensive Failed SuperHyperStable;
δ-SuperHyperDefensive Failed SuperHyperStable;
strong δ-SuperHyperDefensive Failed SuperHyperStable;
connected δ-SuperHyperDefensive Failed SuperHyperStable.
Proposition 3.23. Let be a neutrosophic SuperHyperUniform SuperHyperGraph which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperComplete SuperHyperMultipartite. Then Then the number of
dual SuperHyperDefensive Failed SuperHyperStable;
strong dual SuperHyperDefensive Failed SuperHyperStable;
connected dual SuperHyperDefensive Failed SuperHyperStable;
-dual SuperHyperDefensive Failed SuperHyperStable;
strong -dual SuperHyperDefensive Failed SuperHyperStable;
connected -dual SuperHyperDefensive Failed SuperHyperStable.
is one and it’s only 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 be a neutrosophic SuperHyperGraph. The number of connected component is if there’s a SuperHyperSet which is a dual
SuperHyperDefensive Failed SuperHyperStable;
strong SuperHyperDefensive Failed SuperHyperStable;
connected SuperHyperDefensive Failed SuperHyperStable;
Failed SuperHyperStable;
strong 1-SuperHyperDefensive Failed SuperHyperStable;
connected 1-SuperHyperDefensive Failed SuperHyperStable.
Proposition 3.25. Let be a neutrosophic SuperHyperGraph. Then the number is at most and the neutrosophic number is at most
Proposition 3.26. Let be a neutrosophic SuperHyperGraph. Then the number is at most and the neutrosophic number is at most
Proposition 3.27. Let be a neutrosophic SuperHyperGraph which is SuperHyperComplete. The number is and the neutrosophic number is in the setting of dual
SuperHyperDefensive Failed SuperHyperStable;
strong SuperHyperDefensive Failed SuperHyperStable;
connected SuperHyperDefensive Failed SuperHyperStable;
-SuperHyperDefensive Failed SuperHyperStable;
strong -SuperHyperDefensive Failed SuperHyperStable;
connected -SuperHyperDefensive Failed SuperHyperStable.
Proposition 3.28. Let be a neutrosophic SuperHyperGraph which is The number is 0 and the neutrosophic number is for an independent SuperHyperSet in the setting of dual
SuperHyperDefensive Failed SuperHyperStable;
strong SuperHyperDefensive Failed SuperHyperStable;
connected SuperHyperDefensive Failed SuperHyperStable;
0-SuperHyperDefensive Failed SuperHyperStable;
strong 0-SuperHyperDefensive Failed SuperHyperStable;
connected 0-SuperHyperDefensive Failed SuperHyperStable.
Proposition 3.29. Let be a neutrosophic SuperHyperGraph which is SuperHyperComplete. Then there’s no independent SuperHyperSet.
Proposition 3.30. Let be a neutrosophic SuperHyperGraph which is SuperHyperCycle/SuperHyperPath/SuperHyperWheel. The number is and the neutrosophic number is in the setting of a dual
SuperHyperDefensive Failed SuperHyperStable;
strong SuperHyperDefensive Failed SuperHyperStable;
connected SuperHyperDefensive Failed SuperHyperStable;
-SuperHyperDefensive Failed SuperHyperStable;
strong -SuperHyperDefensive Failed SuperHyperStable;
connected -SuperHyperDefensive Failed SuperHyperStable.
Proposition 3.31. Let be a neutrosophic SuperHyperGraph which is SuperHyperStar/complete SuperHyperBipartite/complete SuperHyperMultiPartite. The number is and the neutrosophic number is in the setting of a dual
SuperHyperDefensive Failed SuperHyperStable;
strong SuperHyperDefensive Failed SuperHyperStable;
connected SuperHyperDefensive Failed SuperHyperStable;
-SuperHyperDefensive Failed SuperHyperStable;
strong -SuperHyperDefensive Failed SuperHyperStable;
connected -SuperHyperDefensive Failed SuperHyperStable.
Proposition 3.32. Let be a SuperHyperFamily of the neutrosophic SuperHyperGraphs which are from one-type SuperHyperClass which the result is obtained for the individuals. Then the results also hold for the SuperHyperFamily of these specific SuperHyperClasses of the neutrosophic SuperHyperGraphs.
Proposition 3.33. Let be a strong neutrosophic SuperHyperGraph. If S is a dual SuperHyperDefensive Failed SuperHyperStable, then such that
Proposition 3.34. Let be a strong neutrosophic SuperHyperGraph. If S is a dual SuperHyperDefensive Failed SuperHyperStable, then
S is SuperHyperDominating set;
there’s such that is SuperHyperChromatic number.
Proposition 3.35. Let be a strong neutrosophic SuperHyperGraph. Then
Proposition 3.36. Let be a strong neutrosophic SuperHyperGraph which is connected. Then
Proposition 3.37. Let be an odd SuperHyperPath. Then
the SuperHyperSet is a dual SuperHyperDefensive Failed SuperHyperStable;
and corresponded SuperHyperSet is ;
the SuperHyperSets and are only a dual Failed SuperHyperStable.
Proposition 3.38. Let be an even SuperHyperPath. Then
the set is a dual SuperHyperDefensive Failed SuperHyperStable;
and corresponded SuperHyperSets are and
the SuperHyperSets and are only dual Failed SuperHyperStable.
Proposition 3.39. Let be an even SuperHyperCycle. Then
the SuperHyperSet is a dual SuperHyperDefensive Failed SuperHyperStable;
and corresponded SuperHyperSets are and
the SuperHyperSets and are only dual Failed SuperHyperStable.
Proposition 3.40. Let be an odd SuperHyperCycle. Then
the SuperHyperSet is a dual SuperHyperDefensive Failed SuperHyperStable;
and corresponded SuperHyperSet is ;
the SuperHyperSets and are only dual Failed SuperHyperStable.
Proposition 3.41. Let be SuperHyperStar. Then
the SuperHyperSet is a dual maximal Failed SuperHyperStable;
the SuperHyperSets and are only dual Failed SuperHyperStable.
Proposition 3.42. Let be SuperHyperWheel. Then
the SuperHyperSet is a dual maximal SuperHyperDefensive Failed SuperHyperStable;
the SuperHyperSet is only a dual maximal SuperHyperDefensive Failed SuperHyperStable.
Proposition 3.43. Let be an odd SuperHyperComplete. Then
the SuperHyperSet is a dual SuperHyperDefensive Failed SuperHyperStable;
the SuperHyperSet is only a dual SuperHyperDefensive Failed SuperHyperStable.
Proposition 3.44. Let be an even SuperHyperComplete. Then
the SuperHyperSet is a dual SuperHyperDefensive Failed SuperHyperStable;
the SuperHyperSet is only a dual maximal SuperHyperDefensive Failed SuperHyperStable.
Proposition 3.45. Let be a m-SuperHyperFamily of neutrosophic SuperHyperStars with common neutrosophic SuperHyperVertex SuperHyperSet. Then
the SuperHyperSet is a dual SuperHyperDefensive Failed SuperHyperStable for
for
for
the SuperHyperSets and are only dual Failed SuperHyperStable for
Proposition 3.46. Let be an m-SuperHyperFamily of odd SuperHyperComplete SuperHyperGraphs with common neutrosophic SuperHyperVertex SuperHyperSet. Then
the SuperHyperSet is a dual maximal SuperHyperDefensive Failed SuperHyperStable for
for
for
the SuperHyperSets are only a dual maximal Failed SuperHyperStable for
Proposition 3.47. Let be a m-SuperHyperFamily of even SuperHyperComplete SuperHyperGraphs with common neutrosophic SuperHyperVertex SuperHyperSet. Then
the SuperHyperSet is a dual SuperHyperDefensive Failed SuperHyperStable for
for
for
the SuperHyperSets are only dual maximal Failed SuperHyperStable for
Proposition 3.48. Let be a strong neutrosophic SuperHyperGraph. Then following statements hold;
if and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive Failed SuperHyperStable, then S is an s-SuperHyperDefensive Failed SuperHyperStable;
if 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 be a strong neutrosophic SuperHyperGraph. Then following statements hold;
if and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive Failed SuperHyperStable, then S is an s-SuperHyperPowerful Failed SuperHyperStable;
if 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 be a[an] [r-]SuperHyperUniform-strong-neutrosophic SuperHyperGraph. Then following statements hold;
if then is an 2-SuperHyperDefensive Failed SuperHyperStable;
if then is a dual 2-SuperHyperDefensive Failed SuperHyperStable;
if then is an r-SuperHyperDefensive Failed SuperHyperStable;
if then is a dual r-SuperHyperDefensive Failed SuperHyperStable.
Proposition 3.51. Let is a[an] [r-]SuperHyperUniform-strong-neutrosophic SuperHyperGraph. Then following statements hold;
if is an 2-SuperHyperDefensive Failed SuperHyperStable;
if is a dual 2-SuperHyperDefensive Failed SuperHyperStable;
if is an r-SuperHyperDefensive Failed SuperHyperStable;
if is a dual r-SuperHyperDefensive Failed SuperHyperStable.
Proposition 3.52. Let is a[an] [r-]SuperHyperUniform-strong-neutrosophic SuperHyperGraph which is a SuperHyperComplete. Then following statements hold;
if is an 2-SuperHyperDefensive Failed SuperHyperStable;
if is a dual 2-SuperHyperDefensive Failed SuperHyperStable;
if is an -SuperHyperDefensive Failed SuperHyperStable;
if is a dual -SuperHyperDefensive Failed SuperHyperStable.
Proposition 3.53. Let is a[an] [r-]SuperHyperUniform-strong-neutrosophic SuperHyperGraph which is a SuperHyperComplete. Then following statements hold;
if then is an 2-SuperHyperDefensive Failed SuperHyperStable;
if then is a dual 2-SuperHyperDefensive Failed SuperHyperStable;
if then is -SuperHyperDefensive Failed SuperHyperStable;
if then is a dual -SuperHyperDefensive Failed SuperHyperStable.
Proposition 3.54. Let is a[an] [r-]SuperHyperUniform-strong-neutrosophic SuperHyperGraph which is SuperHyperCycle. Then following statements hold;
if is an 2-SuperHyperDefensive Failed SuperHyperStable;
if is a dual 2-SuperHyperDefensive Failed SuperHyperStable;
if is an 2-SuperHyperDefensive Failed SuperHyperStable;
if is a dual 2-SuperHyperDefensive Failed SuperHyperStable.
Proposition 3.55. Let is a[an] [r-]SuperHyperUniform-strong-neutrosophic SuperHyperGraph which is SuperHyperCycle. Then following statements hold;
if then is an 2-SuperHyperDefensive Failed SuperHyperStable;
if then is a dual 2-SuperHyperDefensive Failed SuperHyperStable;
if then is an 2-SuperHyperDefensive Failed SuperHyperStable;
if then is a dual 2-SuperHyperDefensive Failed SuperHyperStable.
5. Extreme Failed SuperHyperStable in Some Extreme Situations for Cancer without any names or any specific classes
Example 5.1. Assume the SuperHyperGraphs in the
Figure 1,
Figure 2,
Figure 3,
Figure 4,
Figure 5,
Figure 6,
Figure 7,
Figure 8,
Figure 9,
Figure 10,
Figure 11,
Figure 12,
Figure 13,
Figure 14,
Figure 15,
Figure 16,
Figure 17,
Figure 18,
Figure 19 and
Figure 20.
On the
Figure 1, the SuperHyperNotion, namely, Failed SuperHyperStable, is up.
and
Failed SuperHyperStable are some empty SuperHyperEdges but
is a loop SuperHyperEdge and
is a SuperHyperEdge. Thus in the terms of SuperHyperNeighbor, there’s only one SuperHyperEdge, namely,
The SuperHyperVertex,
is isolated means that there’s no SuperHyperEdge has it as an endpoint. Thus SuperHyperVertex,
is contained in every given Failed SuperHyperStable. All the following SuperHyperSet of SuperHyperVertices is the simple type-SuperHyperSet of the Failed SuperHyperStable.
The SuperHyperSet of SuperHyperVertices,
is the simple type-SuperHyperSet of the Failed SuperHyperStable. The SuperHyperSet of the SuperHyperVertices,
is corresponded to a Failed SuperHyperStable
for a SuperHyperGraph
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,
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,
is the non-obvious simple type-SuperHyperSet of the Failed SuperHyperStable. Since the SuperHyperSet of the SuperHyperVertices,
is corresponded to a Failed SuperHyperStable
for a SuperHyperGraph
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,
Thus the non-obvious Failed SuperHyperStable,
is up. The obvious simple type-SuperHyperSet of the Failed SuperHyperStable,
is the SuperHyperSet,
doesn’t include only less than two SuperHyperVertices in a connected neutrosophic SuperHyperGraph
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
On the
Figure 2, the SuperHyperNotion, namely, Failed SuperHyperStable, is up.
and
Failed SuperHyperStable are some empty SuperHyperEdges but
is a loop SuperHyperEdge and
is a SuperHyperEdge. Thus in the terms of SuperHyperNeighbor, there’s only one SuperHyperEdge, namely,
The SuperHyperVertex,
is isolated means that there’s no SuperHyperEdge has it as an endpoint. Thus SuperHyperVertex,
is contained in every given Failed SuperHyperStable. All the following SuperHyperSet of SuperHyperVertices is the simple type-SuperHyperSet of the Failed SuperHyperStable.
The SuperHyperSet of SuperHyperVertices,
is the simple type-SuperHyperSet of the Failed SuperHyperStable. The SuperHyperSet of the SuperHyperVertices,
is corresponded to a Failed SuperHyperStable
for a SuperHyperGraph
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,
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,
is the non-obvious simple type-SuperHyperSet of the Failed SuperHyperStable. Since the SuperHyperSet of the SuperHyperVertices,
is corresponded to a Failed SuperHyperStable
for a SuperHyperGraph
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,
Thus the non-obvious Failed SuperHyperStable,
is up. The obvious simple type-SuperHyperSet of the Failed SuperHyperStable,
is the SuperHyperSet,
doesn’t include only less than two SuperHyperVertices in a connected neutrosophic SuperHyperGraph
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
On the
Figure 3, the SuperHyperNotion, namely, Failed SuperHyperStable, is up.
and
are some empty SuperHyperEdges but
is a SuperHyperEdge. Thus in the terms of SuperHyperNeighbor, there’s only one SuperHyperEdge, namely,
The SuperHyperSet of SuperHyperVertices,
is the simple type-SuperHyperSet of the Failed SuperHyperStable. The SuperHyperSet of the SuperHyperVertices,
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
But the SuperHyperSet of SuperHyperVertices,
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,
is the non-obvious simple type-SuperHyperSet of the Failed SuperHyperStable. Since the SuperHyperSet of the SuperHyperVertices,
is corresponded to a Failed SuperHyperStable
for a SuperHyperGraph
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,
Thus the non-obvious Failed SuperHyperStable,
is up. The obvious simple type-SuperHyperSet of the Failed SuperHyperStable,
is the SuperHyperSet,
don’t include only more than one SuperHyperVertex in a connected neutrosophic SuperHyperGraph
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
On the
Figure 4, the SuperHyperNotion, namely, a Failed SuperHyperStable, is up. There’s no empty SuperHyperEdge but
are a loop SuperHyperEdge on
and there are some SuperHyperEdges, namely,
on
alongside
on
and
on
The SuperHyperSet of SuperHyperVertices,
is the simple type-SuperHyperSet of the Failed SuperHyperStable. The SuperHyperSet of the SuperHyperVertices,
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
But the SuperHyperSet of SuperHyperVertices,
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,
is the non-obvious simple type-SuperHyperSet of the Failed SuperHyperStable. Since the SuperHyperSet of the SuperHyperVertices,
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,
Thus the non-obvious Failed SuperHyperStable,
is up. The obvious simple type-SuperHyperSet of the Failed SuperHyperStable,
is a SuperHyperSet,
doesn’t include only less than two SuperHyperVertices in a connected neutrosophic SuperHyperGraph
On the
Figure 5, the SuperHyperNotion, namely, Failed SuperHyperStable, is up. There’s neither empty SuperHyperEdge nor loop SuperHyperEdge. The SuperHyperSet of SuperHyperVertices,
is the simple type-SuperHyperSet of the Failed SuperHyperStable. The SuperHyperSet of the SuperHyperVertices,
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
But the SuperHyperSet of SuperHyperVertices,
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,
is the non-obvious simple type-SuperHyperSet of the Failed SuperHyperStable. Since the SuperHyperSet of the SuperHyperVertices,
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,
Thus the non-obvious Failed SuperHyperStable,
is up. The obvious simple type-SuperHyperSet of the Failed SuperHyperStable,
is a SuperHyperSet,
doesn’t include only less than two SuperHyperVertices in a connected neutrosophic SuperHyperGraph
is mentioned as the SuperHyperModel
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,
is the simple type-SuperHyperSet of the Failed SuperHyperStable. The SuperHyperSet of the SuperHyperVertices,
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
But the SuperHyperSet of SuperHyperVertices,
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,
is the non-obvious simple type-SuperHyperSet of the Failed SuperHyperStable. Since the SuperHyperSet of the SuperHyperVertices,
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,
Thus the non-obvious Failed SuperHyperStable,
is up. The obvious simple type-SuperHyperSet of the Failed SuperHyperStable,
is a SuperHyperSet,
doesn’t include only less than two SuperHyperVertices in a connected neutrosophic SuperHyperGraph
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,
is the simple type-SuperHyperSet of the Failed SuperHyperStable. The SuperHyperSet of the SuperHyperVertices,
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
But the SuperHyperSet of SuperHyperVertices,
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,
is the non-obvious simple type-SuperHyperSet of the Failed SuperHyperStable. Since the SuperHyperSet of the SuperHyperVertices,
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,
Thus the non-obvious Failed SuperHyperStable,
is up. The obvious simple type-SuperHyperSet of the Failed SuperHyperStable,
is a SuperHyperSet,
doesn’t include only less than two SuperHyperVertices in a connected neutrosophic SuperHyperGraph
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,
is the simple type-SuperHyperSet of the Failed SuperHyperStable. The SuperHyperSet of the SuperHyperVertices,
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
But the SuperHyperSet of SuperHyperVertices,
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,
is the non-obvious simple type-SuperHyperSet of the Failed SuperHyperStable. Since the SuperHyperSet of the SuperHyperVertices,
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,
Thus the non-obvious Failed SuperHyperStable,
is up. The obvious simple type-SuperHyperSet of the Failed SuperHyperStable,
is a SuperHyperSet,
doesn’t include only less than two SuperHyperVertices in a connected neutrosophic SuperHyperGraph
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,
is the simple type-SuperHyperSet of the Failed SuperHyperStable. The SuperHyperSet of the SuperHyperVertices,
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
But the SuperHyperSet of SuperHyperVertices,
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,
is the non-obvious simple type-SuperHyperSet of the Failed SuperHyperStable. Since the SuperHyperSet of the SuperHyperVertices,
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,
Thus the non-obvious Failed SuperHyperStable,
is up. The obvious simple type-SuperHyperSet of the Failed SuperHyperStable,
is a SuperHyperSet,
doesn’t include only less than two SuperHyperVertices in a connected neutrosophic SuperHyperGraph
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,
is the simple type-SuperHyperSet of the Failed SuperHyperStable. The SuperHyperSet of the SuperHyperVertices,
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
But the SuperHyperSet of SuperHyperVertices,
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,
is the non-obvious simple type-SuperHyperSet of the Failed SuperHyperStable. Since the SuperHyperSet of the SuperHyperVertices,
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,
Thus the non-obvious Failed SuperHyperStable,
is up. The obvious simple type-SuperHyperSet of the Failed SuperHyperStable,
is a SuperHyperSet,
doesn’t include only more than one SuperHyperVertex in a connected neutrosophic SuperHyperGraph
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,
is the simple type-SuperHyperSet of the Failed SuperHyperStable. The SuperHyperSet of the SuperHyperVertices,
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
But the SuperHyperSet of SuperHyperVertices,
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,
is the non-obvious simple type-SuperHyperSet of the Failed SuperHyperStable. Since the SuperHyperSet of the SuperHyperVertices,
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,
Thus the non-obvious Failed SuperHyperStable,
is up. The obvious simple type-SuperHyperSet of the Failed SuperHyperStable,
is a SuperHyperSet,
doesn’t include only less than two SuperHyperVertices in a connected neutrosophic SuperHyperGraph
On the
Figure 12, the SuperHyperNotion, namely, Failed SuperHyperStable, is up. There’s neither empty SuperHyperEdge nor loop SuperHyperEdge. The SuperHyperSet of SuperHyperVertices,
is the simple type-SuperHyperSet of the Failed SuperHyperStable. The SuperHyperSet of the SuperHyperVertices,
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
But the SuperHyperSet of SuperHyperVertices,
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,
is the non-obvious simple type-SuperHyperSet of the Failed SuperHyperStable. Since the SuperHyperSet of the SuperHyperVertices,
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,
Thus the non-obvious Failed SuperHyperStable,
is up. The obvious simple type-SuperHyperSet of the Failed SuperHyperStable,
is a SuperHyperSet,
doesn’t include only more than one SuperHyperVertex in a connected neutrosophic SuperHyperGraph
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,
is the simple type-SuperHyperSet of the Failed SuperHyperStable. The SuperHyperSet of the SuperHyperVertices,
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
But the SuperHyperSet of SuperHyperVertices,
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,
is the non-obvious simple type-SuperHyperSet of the Failed SuperHyperStable. Since the SuperHyperSet of the SuperHyperVertices,
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,
Thus the non-obvious Failed SuperHyperStable,
is up. The obvious simple type-SuperHyperSet of the Failed SuperHyperStable,
is a SuperHyperSet,
does includes only less than two SuperHyperVertices in a connected neutrosophic SuperHyperGraph
On the
Figure 14, the SuperHyperNotion, namely, Failed SuperHyperStable, is up. There’s neither empty SuperHyperEdge nor loop SuperHyperEdge. The SuperHyperSet of SuperHyperVertices,
is the simple type-SuperHyperSet of the Failed SuperHyperStable. The SuperHyperSet of the SuperHyperVertices,
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
But the SuperHyperSet of SuperHyperVertices,
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,
is the non-obvious simple type-SuperHyperSet of the Failed SuperHyperStable. Since the SuperHyperSet of the SuperHyperVertices,
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,
Thus the non-obvious Failed SuperHyperStable,
is up. The obvious simple type-SuperHyperSet of the Failed SuperHyperStable,
is a SuperHyperSet,
does includes only less than two SuperHyperVertices in a connected neutrosophic SuperHyperGraph
On the
Figure 15, the SuperHyperNotion, namely, Failed SuperHyperStable, is up. There’s neither empty SuperHyperEdge nor loop SuperHyperEdge. The SuperHyperSet of SuperHyperVertices,
is the simple type-SuperHyperSet of the Failed SuperHyperStable. The SuperHyperSet of the SuperHyperVertices,
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
But the SuperHyperSet of SuperHyperVertices,
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,
is the non-obvious simple type-SuperHyperSet of the Failed SuperHyperStable. Since the SuperHyperSet of the SuperHyperVertices,
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,
Thus the non-obvious Failed SuperHyperStable,
is up. The obvious simple type-SuperHyperSet of the Failed SuperHyperStable,
is a SuperHyperSet,
doesn’t include only less than two SuperHyperVertices in a connected neutrosophic SuperHyperGraph
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,
is the simple type-SuperHyperSet of the Failed SuperHyperStable. The SuperHyperSet of the SuperHyperVertices,
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
But the SuperHyperSet of SuperHyperVertices,
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,
is the non-obvious simple type-SuperHyperSet of the Failed SuperHyperStable. Since the SuperHyperSet of the SuperHyperVertices,
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,
Thus the non-obvious Failed SuperHyperStable,
is up. The obvious simple type-SuperHyperSet of the Failed SuperHyperStable,
is a SuperHyperSet,
does includes only less than two SuperHyperVertices in a connected neutrosophic SuperHyperGraph
On the
Figure 17, the SuperHyperNotion, namely, Failed SuperHyperStable, is up. There’s neither empty SuperHyperEdge nor loop SuperHyperEdge. The SuperHyperSet of SuperHyperVertices,
is the simple type-SuperHyperSet of the Failed SuperHyperStable. The SuperHyperSet of the SuperHyperVertices,
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
But the SuperHyperSet of SuperHyperVertices,
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,
is the non-obvious simple type-SuperHyperSet of the Failed SuperHyperStable. Since the SuperHyperSet of the SuperHyperVertices,
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,
Thus the non-obvious Failed SuperHyperStable,
is up. The obvious simple type-SuperHyperSet of the Failed SuperHyperStable,
is a SuperHyperSet,
does includes only less than two SuperHyperVertices in a connected neutrosophic SuperHyperGraph
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,
is the simple type-SuperHyperSet of the Failed SuperHyperStable. The SuperHyperSet of the SuperHyperVertices,
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
But the SuperHyperSet of SuperHyperVertices,
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,
is the non-obvious simple type-SuperHyperSet of the Failed SuperHyperStable. Since the SuperHyperSet of the SuperHyperVertices,
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,
Thus the non-obvious Failed SuperHyperStable,
is up. The obvious simple type-SuperHyperSet of the Failed SuperHyperStable,
is a SuperHyperSet,
does includes only less than two SuperHyperVertices in a connected neutrosophic SuperHyperGraph
-
On the
Figure 19, the SuperHyperNotion, namely, Failed SuperHyperStable, is up. There’s neither empty SuperHyperEdge nor loop SuperHyperEdge. The SuperHyperSet of SuperHyperVertices,
is the simple type-SuperHyperSet of the Failed SuperHyperStable. The SuperHyperSet of the SuperHyperVertices,
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
But the SuperHyperSet of SuperHyperVertices,
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,
is the non-obvious simple type-SuperHyperSet of the Failed SuperHyperStable. Since the SuperHyperSet of the SuperHyperVertices,
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,
Thus the non-obvious Failed SuperHyperStable,
is up. The obvious simple type-SuperHyperSet of the Failed SuperHyperStable,
is a SuperHyperSet,
does includes only less than two SuperHyperVertices in a connected neutrosophic SuperHyperGraph
-
On the
Figure 20, the SuperHyperNotion, namely, Failed SuperHyperStable, is up. There’s neither empty SuperHyperEdge nor loop SuperHyperEdge. The SuperHyperSet of SuperHyperVertices,
is the simple type-SuperHyperSet of the Failed SuperHyperStable. The SuperHyperSet of the SuperHyperVertices,
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
But the SuperHyperSet of SuperHyperVertices,
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,
is the non-obvious simple type-SuperHyperSet of the Failed SuperHyperStable. Since the SuperHyperSet of the SuperHyperVertices,
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,
Thus the non-obvious Failed SuperHyperStable,
is up. The obvious simple type-SuperHyperSet of the Failed SuperHyperStable,
is a SuperHyperSet, does includes only less than two SuperHyperVertices in a connected neutrosophic SuperHyperGraph
Proposition 5.2. Assume a connected neutrosophic SuperHyperGraph Then in the worst case, literally, 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
Proof. Assume a connected neutrosophic SuperHyperGraph The SuperHyperSet of the SuperHyperVertices 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 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 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, Thus the 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 SuperHyperNeighbors in a connected neutrosophic SuperHyperGraph Since the SuperHyperSet of the SuperHyperVertices is the maximum cardinality of a SuperHyperSet S of SuperHyperVertices such that there’s a SuperHyperVertex to have a SuperHyperEdge in common. □
Proposition 5.3. Assume a connected neutrosophic SuperHyperGraph Then the extreme number of Failed SuperHyperStable has, the least cardinality, the lower sharp bound for cardinality, is the extreme cardinality of if there’s a Failed SuperHyperStable with the least cardinality, the lower sharp bound for cardinality.
Proof. Assume a connected neutrosophic SuperHyperGraph Consider there’s a Failed SuperHyperStable with the least cardinality, the lower sharp bound for cardinality. The SuperHyperSet of the SuperHyperVertices 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 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 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, Thus the 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 SuperHyperNeighbors in a connected neutrosophic SuperHyperGraph Since the SuperHyperSet of the SuperHyperVertices is the maximum cardinality of a SuperHyperSet S of SuperHyperVertices such that there’s a SuperHyperVertex to have a SuperHyperEdge in common. Thus, in a connected neutrosophic SuperHyperGraph the extreme number of Failed SuperHyperStable has, the least cardinality, the lower sharp bound for cardinality, is the extreme cardinality of if there’s a Failed SuperHyperStable with the least cardinality, the lower sharp bound for cardinality. □
Proposition 5.4. Assume a connected neutrosophic SuperHyperGraph If a SuperHyperEdge has z SuperHyperVertices, then number of those interior SuperHyperVertices from that SuperHyperEdge exclude to any Failed SuperHyperStable.
Proof. Assume a connected neutrosophic SuperHyperGraph Let a SuperHyperEdge has z SuperHyperVertices. Consider 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 The SuperHyperSet of the SuperHyperVertices 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 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 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, Thus the 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 SuperHyperNeighbors in a connected neutrosophic SuperHyperGraph Since the SuperHyperSet of the SuperHyperVertices is the maximum cardinality of a SuperHyperSet S of SuperHyperVertices such that there’s a SuperHyperVertex to have a SuperHyperEdge in common. Thus, in a connected neutrosophic SuperHyperGraph a SuperHyperEdge has z SuperHyperVertices, then number of those interior SuperHyperVertices from that SuperHyperEdge exclude to any Failed SuperHyperStable. □
Proposition 5.5. Assume a connected neutrosophic SuperHyperGraph 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 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 The SuperHyperSet of the SuperHyperVertices 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 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 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, Thus the 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 SuperHyperNeighbors in a connected neutrosophic SuperHyperGraph Since the SuperHyperSet of the SuperHyperVertices is the maximum cardinality of a SuperHyperSet S of SuperHyperVertices such that there’s a SuperHyperVertex to have a SuperHyperEdge in common. Thus, in a connected neutrosophic SuperHyperGraph 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 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 The SuperHyperSet of the SuperHyperVertices 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 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 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, Thus the 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 SuperHyperNeighbors in a connected neutrosophic SuperHyperGraph Since the SuperHyperSet of the SuperHyperVertices is the maximum cardinality of a SuperHyperSet S of SuperHyperVertices such that there’s a SuperHyperVertex to have a SuperHyperEdge in common. Thus, in a connected neutrosophic SuperHyperGraph 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 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 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 The SuperHyperSet of the SuperHyperVertices 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 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 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, Thus the 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 SuperHyperNeighbors in a connected neutrosophic SuperHyperGraph Since the SuperHyperSet of the SuperHyperVertices is the maximum cardinality of a SuperHyperSet S of SuperHyperVertices such that there’s a SuperHyperVertex to have a SuperHyperEdge in common. Thus, in a connected neutrosophic SuperHyperGraph 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 Consider a SuperHyperDominating. Then a Failed SuperHyperStable is either out with one additional member.
Proof. Assume a connected neutrosophic SuperHyperGraph Consider a SuperHyperDominating. By applying the Proposition (5.7), the results are up. Thus on a connected neutrosophic SuperHyperGraph 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 Then a Failed SuperHyperStable-style with the maximum SuperHyperCardinality is a SuperHyperSet of the interior SuperHyperVertices.
Proposition 6.2. Assume a connected SuperHyperPath 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 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 The SuperHyperSet of the SuperHyperVertices 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 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 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, Thus the 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 SuperHyperNeighbors in a connected neutrosophic SuperHyperGraph Since the SuperHyperSet of the SuperHyperVertices is the maximum cardinality of a SuperHyperSet S of SuperHyperVertices such that there’s a SuperHyperVertex to have a SuperHyperEdge in common. Thus, in a connected SuperHyperPath 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
is highlighted and featured. The SuperHyperSet,
of the SuperHyperVertices of the connected SuperHyperPath
in the SuperHyperModel (21), is the Failed SuperHyperStable.
Proposition 6.4. Assume a connected SuperHyperCycle 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 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 The SuperHyperSet of the SuperHyperVertices 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 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 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, Thus the 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 SuperHyperNeighbors in a connected neutrosophic SuperHyperGraph Since the SuperHyperSet of the SuperHyperVertices is the maximum cardinality of a SuperHyperSet S of SuperHyperVertices such that there’s a SuperHyperVertex to have a SuperHyperEdge in common. Thus, in a connected SuperHyperCycle 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
is highlighted and featured. The obtained SuperHyperSet, by the Algorithm in previous result, of the SuperHyperVertices of the connected SuperHyperCycle
in the SuperHyperModel (22),
is the Failed SuperHyperStable.
Proposition 6.6. Assume a connected SuperHyperStar 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 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 The SuperHyperSet of the SuperHyperVertices 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 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 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, Thus the 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 SuperHyperNeighbors in a connected neutrosophic SuperHyperGraph Since the SuperHyperSet of the SuperHyperVertices is the maximum cardinality of a SuperHyperSet S of SuperHyperVertices such that there’s a SuperHyperVertex to have a SuperHyperEdge in common. Thus, in a connected SuperHyperStar 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
is highlighted and featured. The obtained SuperHyperSet, by the Algorithm in previous result, of the SuperHyperVertices of the connected SuperHyperStar
in the SuperHyperModel (23),
is the Failed SuperHyperStable.
Proposition 6.8. Assume a connected SuperHyperBipartite 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 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 The SuperHyperSet of the SuperHyperVertices 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 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 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, Thus the 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 SuperHyperNeighbors in a connected neutrosophic SuperHyperGraph Since the SuperHyperSet of the SuperHyperVertices is the maximum cardinality of a SuperHyperSet S of SuperHyperVertices such that there’s a SuperHyperVertex to have a SuperHyperEdge in common. Thus, in a connected SuperHyperBipartite 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
is highlighted and featured. The obtained SuperHyperSet, by the Algorithm in previous result, of the SuperHyperVertices of the connected SuperHyperBipartite
in the SuperHyperModel (24),
is the Failed SuperHyperStable.
Proposition 6.10. Assume a connected SuperHyperMultipartite 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 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 The SuperHyperSet of the SuperHyperVertices 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 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 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, Thus the 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 SuperHyperNeighbors in a connected neutrosophic SuperHyperGraph Since the SuperHyperSet of the SuperHyperVertices is the maximum cardinality of a SuperHyperSet S of SuperHyperVertices such that there’s a SuperHyperVertex to have a SuperHyperEdge in common. Thus, in a connected SuperHyperMultipartite 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
is highlighted and featured. The obtained SuperHyperSet, by the Algorithm in previous result, of the SuperHyperVertices of the connected SuperHyperMultipartite
in the SuperHyperModel (25), is the Failed SuperHyperStable.
Proposition 6.12. Assume a connected SuperHyperWheel 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 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 The SuperHyperSet of the SuperHyperVertices 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 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 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, Thus the 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 SuperHyperNeighbors in a connected neutrosophic SuperHyperGraph Since the SuperHyperSet of the SuperHyperVertices is the maximum cardinality of a SuperHyperSet S of SuperHyperVertices such that there’s a SuperHyperVertex to have a SuperHyperEdge in common. Thus, in a connected SuperHyperWheel 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
is highlighted and featured. The obtained SuperHyperSet, by the Algorithm in previous result, of the SuperHyperVertices of the connected SuperHyperWheel
in the SuperHyperModel (26), is the Failed SuperHyperStable.
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)
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)
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)
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)
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)
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)
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)
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)
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)
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)
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)
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)
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)
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)
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)
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)
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)
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)
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)
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)
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)
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)
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)
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)
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)
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)
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
|