Submitted:
04 January 2023
Posted:
12 January 2023
You are already at the latest version
Abstract
Keywords:
1. Background
2. Extreme Applications in Cancer’s Extreme Recognition toward Extreme Failed SuperHyperStable
- 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;
- a neutrosophic Failed SuperHyperStable for a neutrosophic SuperHyperGraph is the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet S of neutrosophic SuperHyperVertices such that there’s a neutrosophic SuperHyperVertex to have a neutrosophic SuperHyperEdge in common.
- an Failed SuperHyperStable is a maximal of SuperHyperVertices with a maximum cardinality such that either of the following expressions hold for the (neutrosophic) cardinalities of SuperHyperNeighbors ofThe Expression (2.1), holds if S is an SuperHyperOffensive. And the Expression (2.2), holds if S is an SuperHyperDefensive;
- a neutrosophic Failed SuperHyperStable is a maximal neutrosophic of SuperHyperVertices with maximum neutrosophic cardinality such that either of the following expressions hold for the neutrosophic cardinalities of SuperHyperNeighbors ofThe Expression (2.3), holds if S is a neutrosophic SuperHyperOffensive. And the Expression (2.4), holds if S is a neutrosophic SuperHyperDefensive.
3. General Extreme Results for Cancer’s Extreme Recognition toward Extreme Failed SuperHyperStable
- 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.
- 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.
- 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.
- SuperHyperDefensive Failed SuperHyperStable;
- strong SuperHyperDefensive Failed SuperHyperStable;
- connected SuperHyperDefensive Failed SuperHyperStable;
- -SuperHyperDefensive Failed SuperHyperStable;
- strong -SuperHyperDefensive Failed SuperHyperStable;
- connected -SuperHyperDefensive Failed SuperHyperStable;
- 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;
- the Failed SuperHyperStable;
- the Failed SuperHyperStable;
- the connected Failed SuperHyperStable;
- the -Failed SuperHyperStable;
- the strong -Failed SuperHyperStable;
- the connected -Failed SuperHyperStable.
- 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.
- 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.
- SuperHyperDefensive Failed SuperHyperStable;
- strong SuperHyperDefensive Failed SuperHyperStable;
- connected SuperHyperDefensive Failed SuperHyperStable;
- δ-SuperHyperDefensive Failed SuperHyperStable;
- strong δ-SuperHyperDefensive Failed SuperHyperStable;
- connected δ-SuperHyperDefensive Failed SuperHyperStable.
- 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.
- SuperHyperDefensive Failed SuperHyperStable;
- strong SuperHyperDefensive Failed SuperHyperStable;
- connected SuperHyperDefensive Failed SuperHyperStable;
- Failed SuperHyperStable;
- strong 1-SuperHyperDefensive Failed SuperHyperStable;
- connected 1-SuperHyperDefensive Failed SuperHyperStable.
- SuperHyperDefensive Failed SuperHyperStable;
- strong SuperHyperDefensive Failed SuperHyperStable;
- connected SuperHyperDefensive Failed SuperHyperStable;
- -SuperHyperDefensive Failed SuperHyperStable;
- strong -SuperHyperDefensive Failed SuperHyperStable;
- connected -SuperHyperDefensive Failed SuperHyperStable.
- 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.
- SuperHyperDefensive Failed SuperHyperStable;
- strong SuperHyperDefensive Failed SuperHyperStable;
- connected SuperHyperDefensive Failed SuperHyperStable;
- -SuperHyperDefensive Failed SuperHyperStable;
- strong -SuperHyperDefensive Failed SuperHyperStable;
- connected -SuperHyperDefensive Failed SuperHyperStable.
- SuperHyperDefensive Failed SuperHyperStable;
- strong SuperHyperDefensive Failed SuperHyperStable;
- connected SuperHyperDefensive Failed SuperHyperStable;
- -SuperHyperDefensive Failed SuperHyperStable;
- strong -SuperHyperDefensive Failed SuperHyperStable;
- connected -SuperHyperDefensive Failed SuperHyperStable.
- S is SuperHyperDominating set;
- there’s such that is SuperHyperChromatic number.
- the SuperHyperSet is a dual SuperHyperDefensive Failed SuperHyperStable;
- and corresponded SuperHyperSet is ;
- the SuperHyperSets and are only a dual Failed SuperHyperStable.
- the set is a dual SuperHyperDefensive Failed SuperHyperStable;
- and corresponded SuperHyperSets are and
- the SuperHyperSets and are only dual Failed SuperHyperStable.
- the SuperHyperSet is a dual SuperHyperDefensive Failed SuperHyperStable;
- and corresponded SuperHyperSets are and
- the SuperHyperSets and are only dual Failed SuperHyperStable.
- the SuperHyperSet is a dual SuperHyperDefensive Failed SuperHyperStable;
- and corresponded SuperHyperSet is ;
- the SuperHyperSets and are only dual Failed SuperHyperStable.
- the SuperHyperSet is a dual maximal Failed SuperHyperStable;
- the SuperHyperSets and are only dual Failed SuperHyperStable.
- the SuperHyperSet is a dual maximal SuperHyperDefensive Failed SuperHyperStable;
- the SuperHyperSet is only a dual maximal SuperHyperDefensive Failed SuperHyperStable.
- the SuperHyperSet is a dual SuperHyperDefensive Failed SuperHyperStable;
- the SuperHyperSet is only a dual SuperHyperDefensive Failed SuperHyperStable.
- the SuperHyperSet is a dual SuperHyperDefensive Failed SuperHyperStable;
- the SuperHyperSet is only a dual maximal SuperHyperDefensive Failed SuperHyperStable.
- the SuperHyperSet is a dual SuperHyperDefensive Failed SuperHyperStable for
- for
- for
- the SuperHyperSets and are only dual Failed SuperHyperStable for
- the SuperHyperSet is a dual maximal SuperHyperDefensive Failed SuperHyperStable for
- for
- for
- the SuperHyperSets are only a dual maximal Failed SuperHyperStable for
- the SuperHyperSet is a dual SuperHyperDefensive Failed SuperHyperStable for
- for
- for
- the SuperHyperSets are only dual maximal Failed SuperHyperStable for
- 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.
- 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.
- 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.
- 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.
- 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.
- 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.
- 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.
- 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.
4. Motivation and Contributions
5. Extreme Failed SuperHyperStable in Some Extreme Situations for Cancer without any names or any specific classes
- 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
6. Results on in Some Specific Extreme Situations Titled Extreme SuperHyperClasses
7. Open Problems
8. Conclusion and Closing Remarks
References
- Henry Garrett, “Properties of SuperHyperGraph and Neutrosophic SuperHyperGraph”, Neutrosophic Sets and Systems 49 (2022) 531-561. http://fs.unm.edu/NSS/NeutrosophicSuperHyperGraph34.pdf. https://digitalrepository.unm.edu/nssjournal/vol49/iss1/34. [CrossRef]
- Henry Garrett, “Neutrosophic Co-degree and Neutrosophic Degree alongside Chromatic Numbers in the Setting of Some Classes Related to Neutrosophic Hypergraphs”, J Curr Trends Comp Sci Res 1(1) (2022) 06-14. [CrossRef]
- Henry Garrett, “Super Hyper Dominating and Super Hyper Resolving on Neutrosophic Super Hyper Graphs and Their Directions in Game Theory and Neutrosophic Super Hyper Classes”, J Math Techniques Comput Math 1(3) (2022) 242-263. [CrossRef]
- Garrett, Henry. “0039 | Closing Numbers and Super-Closing Numbers as (Dual)Resolving and (Dual)Coloring alongside (Dual)Dominating in (Neutrosophic)n-SuperHyperGraph.” CERN European Organization for Nuclear Research - Zenodo, Nov. 2022. CERN European Organization for Nuclear Research. https://oa.mg/work/10.5281/zenodo.6319942. [CrossRef]
- Garrett, Henry. “0049 | (Failed)1-Zero-Forcing Number in Neutrosophic Graphs.” CERN European Organization for Nuclear Research - Zenodo, Feb. 2022. CERN European Organization for Nuclear Research. https://oa.mg/work/10.13140/rg.2.2.35241.26724. [CrossRef]
- Henry Garrett, “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010105. [CrossRef]
- Henry Garrett, “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints”, Preprints 2023, 2023010088. [CrossRef]
- Henry Garrett, “Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To Use Neutrosophic SuperHyperGraphs on Cancer's Neutrosophic Recognition And Beyond”, Preprints 2023, 2023010044. [CrossRef]
- Henry Garrett, “(Neutrosophic) SuperHyperStable on Cancer's Recognition by Well- SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010043. [CrossRef]
- Henry Garrett, “Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic) SuperHyperModeling in Cancer's Recognitions And (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010105. [CrossRef]
- Henry Garrett, “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic SuperHyperStable To Act on Cancer's Neutrosophic Recognitions In Special ViewPoints”, Preprints 2023, 2023010088. [CrossRef]
- Henry Garrett, “(Neutrosophic) SuperHyperModeling of Cancer's Recognitions Featuring (Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, Preprints 2023, 2022120549. [CrossRef]
- Henry Garrett, “(Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With (Neutrosophic) SuperHyperModeling of Cancer's Recognitions And Related (Neutrosophic) SuperHyperClasses”, Preprints 2022, 2022120540. [CrossRef]
- Henry Garrett, “SuperHyperGirth on SuperHyperGraph and Neutrosophic SuperHyperGraph With SuperHyperModeling of Cancer's Recognitions”, Preprints 2022, 2022120500. [CrossRef]
- Henry Garrett, “Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic SuperHyperGraphs and SuperHyperGraphs Alongside Applications in Cancer's Treatments”, Preprints 2022, 2022120324. [CrossRef]
- Henry Garrett, “SuperHyperDominating and SuperHyperResolving on Neutrosophic SuperHyperGraphs And Their Directions in Game Theory and Neutrosophic SuperHyperClasses”, Preprints 2022, 2022110576. [CrossRef]
- Henry Garrett, “Extreme Failed SuperHyperClique Decides the Failures on the Cancer's Recognition in the Perfect Connections of Cancer's Attacks By SuperHyperModels Named (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023. [CrossRef]
- Henry Garrett, “Extreme Failed SuperHyperClique Decides the Failures on the Cancer's Recognition in the Perfect Connections of Cancer's Attacks By SuperHyperModels Named (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023. [CrossRef]
- Henry Garrett, “Perfect Directions Toward Idealism in Cancer's Neutrosophic Recognition Forwarding Neutrosophic SuperHyperClique on Neutrosophic SuperHyperGraphs”, ResearchGate 2023. [CrossRef]
- Henry Garrett, “Demonstrating Complete Connections in Every Embedded Regions and Sub-Regions in the Terms of Cancer's Recognition and (Neutrosophic) SuperHyperGraphs With (Neutrosophic) SuperHyperClique”, ResearchGate 2023. [CrossRef]
- Henry Garrett, “Different Neutrosophic Types of Neutrosophic Regions titled neutrosophic Failed SuperHyperStable in Cancer's Neutrosophic Recognition modeled in the Form of Neutrosophic SuperHyperGraphs”, ResearchGate 2023. [CrossRef]
- Henry Garrett, “Using the Tool As (Neutrosophic) Failed SuperHyperStable To SuperHyperModel Cancer's Recognition Titled (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023. [CrossRef]
- Henry Garrett, “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic SuperHyperStable To Act on Cancer's Neutrosophic Recognitions In Special ViewPoints”, ResearchGate 2023. [CrossRef]
- Henry Garrett, “(Neutrosophic) SuperHyperStable on Cancer's Recognition by Well-SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023. [CrossRef]
- Henry Garrett, “Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To Use Neutrosophic SuperHyperGraphs on Cancer's Neutrosophic Recognition And Beyond”, ResearchGate 2022. [CrossRef]
- Henry Garrett, “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer's Recognitions And (Neutrosophic) SuperHyperGraphs”, ResearchGate 2022. [CrossRef]
- Henry Garrett, “Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic) SuperHyperModeling in Cancer's Recognitions And (Neutrosophic) SuperHyperGraphs”, ResearchGate 2022. [CrossRef]
- Henry Garrett, “Basic Neutrosophic Notions Concerning SuperHyperDominating and Neutrosophic SuperHyperResolving in SuperHyperGraph”, ResearchGate 2022. [CrossRef]
- Henry Garrett, “Initial Material of Neutrosophic Preliminaries to Study Some Neutrosophic Notions Based on Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic SuperHyperGraph (NSHG)”, ResearchGate 2022. [CrossRef]
- Henry Garrett, (2022). “Beyond Neutrosophic Graphs”, Ohio: E-publishing: Educational Publisher 1091 West 1st Ave Grandview Heights, Ohio 43212 United States. ISBN: 979-1-59973-725-6 (http://fs.unm.edu/BeyondNeutrosophicGraphs.pdf).
- Henry Garrett, (2022). “Neutrosophic Duality”, Florida: GLOBAL KNOWLEDGE - Publishing House 848 Brickell Ave Ste 950 Miami, Florida 33131 United States. ISBN: 978-1-59973-743-0 (http://fs.unm.edu/NeutrosophicDuality.pdf).
- F. Smarandache, “Extension of HyperGraph to n-SuperHyperGraph and to Plithogenic n-SuperHyperGraph, and Extension of HyperAlgebra to n-ary (Classical-/Neutro-/Anti-) HyperAlgebra”, Neutrosophic Sets and Systems 33 (2020) 290-296. [CrossRef]
- M. Akram et al., “Single-valued neutrosophic Hypergraphs”, TWMS J. App. Eng. Math. 8 (1) (2018) 122-135.
- S. Broumi et al., “Single-valued neutrosophic graphs”, Journal of New Theory 10 (2016) 86-101.
- H. Wang et al., “Single-valued neutrosophic sets”, Multispace and Multistructure 4 (2010) 410-413.
- H.T. Nguyen and E.A. Walker, “A First course in fuzzy logic”, CRC Press, 2006.
- M. Akram, and G. Shahzadi, “Operations on Single-Valued Neutrosophic Graphs”, Journal of uncertain systems 11 (1) (2017) 1-26.
- G. Argiroffo et al., “Polyhedra associated with locating-dominating, open locating-dominating and locating total-dominating sets in graphs”, Discrete Applied Mathematics (2022). [CrossRef]
- L. Aronshtam, and H. Ilani, “Bounds on the average and minimum attendance in preference-based activity scheduling”, Discrete Applied Mathematics 306 (2022) 114-119. [CrossRef]
- J. Asplund et al., “A Vizing-type result for semi-total domination”, Discrete Applied Mathematics 258 (2019) 8-12. [CrossRef]
- K. Atanassov, “Intuitionistic fuzzy sets”, Fuzzy Sets Syst. 20 (1986) 87-96. [CrossRef]
- R.A. Beeler et al., “Total domination cover rubbling”, Discrete Applied Mathematics 283 (2020) 133-141. [CrossRef]
- S. Bermudo et al., “On the global total k-domination number of graphs”, Discrete Applied Mathematics 263 (2019) 42-50. [CrossRef]
- M. Bold, and M. Goerigk, “Investigating the recoverable robust single machine scheduling problem under interval uncertainty”, Discrete Applied Mathematics 313 (2022) 99-114. [CrossRef]
- S. Broumi et al., “Single-valued neutrosophic graphs”, Journal of New Theory 10 (2016) 86-101.
- V. Gledel et al., “Maker–Breaker total domination game”, Discrete Applied Mathematics 282 (2020) 96-107. [CrossRef]
- M.A. Henning, and A. Yeo, “A new upper bound on the total domination number in graphs with minimum degree six”, Discrete Applied Mathematics 302 (2021) 1-7. [CrossRef]
- V. Irsic, “Effect of predomination and vertex removal on the game total domination number of a graph”, Discrete Applied Mathematics 257 (2019) 216-225. [CrossRef]
- B.S. Panda, and P. Goyal, “Hardness results of global total k-domination problem in graphs”, Discrete Applied Mathematics (2021). [CrossRef]
- N. Shah, and A. Hussain, “Neutrosophic soft graphs”, Neutrosophic Set and Systems 11 (2016) 31-44.
- A. Shannon and K.T. Atanassov, “A first step to a theory of the intuitionistic fuzzy graphs”, Proceeding of FUBEST (Lakov, D., Ed.) Sofia (1994) 59-61.
- F. Smarandache, “A Unifying field in logics neutrosophy: Neutrosophic probability, set and logic, Rehoboth: ” American Research Press (1998).
- H. Wang et al., “Single-valued neutrosophic sets”, Multispace and Multistructure 4 (2010) 410-413.
- L. A. Zadeh, “Fuzzy sets”, Information and Control 8 (1965) 338-354.


























| What’s Done | What’ll be Done |
|---|---|
| 1. New Generating Neutrosophic SuperHyperGraph | 1. Overall Hypothesis |
| 2. Failed SuperHyperStable | |
| 3. Neutrosophic Failed SuperHyperStable | 2. Cancer’s SuperHyperNumbers |
| 4. Scheme of Cancer’s Recognitions | |
| 5. New Reproductions | 3. SuperHyperFamilies-types |
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2023 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).
