Submitted:
02 January 2023
Posted:
04 January 2023
You are already at the latest version
Abstract
Keywords:
1. Background
1.1. Motivation and Contributions
1.2. Preliminaries
- a finite set of finite single valued neutrosophic subsets of
- a finite set of finite single valued neutrosophic subsets of
- and the following conditions hold:where
- If then is called vertex;
- if then is called SuperVertex;
- if for all s are incident in and then is called edge;
- if for all s are incident in and then is called HyperEdge;
- if there’s a is incident in such that and then is called SuperEdge;
- if there’s a is incident in such that and then is called SuperHyperEdge.
- If and then
- a finite set of finite single valued neutrosophic subsets of
- a finite set of finite single valued neutrosophic subsets of
- If then is called vertex;
- if then is called SuperVertex;
- if for all s are incident in and then is called edge;
- if for all s are incident in and then is called HyperEdge;
- if there’s a is incident in such that and then is called SuperEdge;
- if there’s a is incident in such that and then is called SuperHyperEdge.
- (i).
- It’s SuperHyperPath if it’s only one SuperVertex as intersection amid two given SuperHyperEdges with two exceptions;
- (ii).
- it’s SuperHyperCycle if it’s only one SuperVertex as intersection amid two given SuperHyperEdges;
- (iii).
- it’s SuperHyperStar it’s only one SuperVertex as intersection amid all SuperHyperEdges;
- (iv).
- it’s SuperHyperBipartite it’s only one SuperVertex as intersection amid two given SuperHyperEdges and these SuperVertices, forming two separate sets, has no SuperHyperEdge in common;
- (v).
- it’s SuperHyperMultiPartite it’s only one SuperVertex as intersection amid two given SuperHyperEdges and these SuperVertices, forming multi separate sets, has no SuperHyperEdge in common;
- (vi).
- it’s SuperHyperWheel if it’s only one SuperVertex as intersection amid two given SuperHyperEdges and one SuperVertex has one SuperHyperEdge with any common SuperVertex.
- there’s a vertex such that
- there’s a SuperVertex such that
- there’s a vertex such that
- there’s a SuperVertex such that
- there are a vertex and a vertex such that
- there are a vertex and a SuperVertex such that
- there are a SuperVertex and a vertex such that
- there are a SuperVertex and a SuperVertex such that
- If for all then NSHP is called path;
- if for all and there’s then NSHP is called SuperPath;
- if for all then NSHP is called HyperPath;
- if there are then NSHP is called SuperHyperPath.
| The Values of The Vertices | The Number of Position in Alphabet |
| The Values of The SuperVertices | The maximum Values of Its Vertices |
| The Values of The Edges | The maximum Values of Its Vertices |
| The Values of The HyperEdges | The maximum Values of Its Vertices |
| The Values of The SuperHyperEdges | The maximum Values of Its Endpoints |
- an SuperHyperStable for a SuperHyperGraph is the maximum cardinality of a SuperHyperSet S of SuperHyperVertices such that there’s no SuperHyperVertex to have a SuperHyperEdge in common;
- a neutrosophic SuperHyperStable for a neutrosophic SuperHyperGraph is the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet S of neutrosophic SuperHyperVertices such that there’s no neutrosophic SuperHyperVertex to have a neutrosophic SuperHyperEdge in common.
-
an 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 (1.1), holds if S is an SuperHyperOffensive. And the Expression (1.2), holds if S is an SuperHyperDefensive;
-
a neutrosophic 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 (1.3), holds if S is a neutrosophic SuperHyperOffensive. And the Expression (1.4), holds if S is a neutrosophic SuperHyperDefensive.
| The Values of The Vertices | The Number of Position in Alphabet |
| The Values of The SuperVertices | The maximum Values of Its Vertices |
| The Values of The Edges | The maximum Values of Its Vertices |
| The Values of The HyperEdges | The maximum Values of Its Vertices |
| The Values of The SuperHyperEdges | The maximum Values of Its Endpoints |
| The Values of The Vertices | The Number of Position in Alphabet |
| The Values of The SuperVertices | The maximum Values of Its Vertices |
| The Values of The Edges | The maximum Values of Its Vertices |
| The Values of The HyperEdges | The maximum Values of Its Vertices |
| The Values of The SuperHyperEdges | The maximum Values of Its Endpoints |
2. Extreme SuperHyperStable
-
On the (Figure 1), the SuperHyperNotion, namely, SuperHyperStable, is up. and SuperHyperStable are some empty SuperHyperEdges but is a loop SuperHyperEdge and is an 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 SuperHyperStable. All the following SuperHyperSets of SuperHyperVertices are the simple type-SuperHyperSet of the SuperHyperStable.The SuperHyperSets of SuperHyperVertices, are the simple type-SuperHyperSet of the SuperHyperStable. The SuperHyperSets of the SuperHyperVertices, are corresponded to a SuperHyperStable for a SuperHyperGraph is the maximum cardinality of a SuperHyperSet S of SuperHyperVertices such that there’s no SuperHyperVertex to have a SuperHyperEdge in common. There’re only two SuperHyperVertices inside the intended SuperHyperSet. Thus the non-obvious SuperHyperStable is up. The obvious simple type-SuperHyperSet of the SuperHyperStable is a SuperHyperSet includes only one SuperHyperVertex. But the SuperHyperSets of SuperHyperVertices, don’t have less than two SuperHyperVertices insdie the intended SuperHyperSet. Thus the non-obvious simple type-SuperHyperSet of the SuperHyperStable are up. To sum them up, the SuperHyperSets of SuperHyperVertices, are the non-obvious simple type-SuperHyperSet of the SuperHyperStable. Since the SuperHyperSets of the SuperHyperVertices, are corresponded to a SuperHyperStable for a SuperHyperGraph is the SuperHyperSet S of SuperHyperVertices such that there’s no SuperHyperVertex to have a SuperHyperEdge in common and they are corresponded to a SuperHyperStable. Since They’ve the maximum cardinality of a SuperHyperSet S of SuperHyperVertices such that there’s no SuperHyperVertex to have a SuperHyperEdge in common. There aren’t only less than two SuperHyperVertices inside the intended SuperHyperSets, Thus the non-obvious SuperHyperStable, are up. The obvious simple type-SuperHyperSets of the SuperHyperStable, are SuperHyperSets, don’t include only less than two SuperHyperVertices in a connected neutrosophic SuperHyperGraph It’s interesting to mention that the only obvious simple type-SuperHyperSets of the neutrosophic SuperHyperStable amid those obvious simple type-SuperHyperSets of the SuperHyperStable, is only
-
On the (Figure 2), the SuperHyperNotion, namely, SuperHyperStable, is up. and SuperHyperStable are some empty SuperHyperEdges but is a loop SuperHyperEdge and is an 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 SuperHyperStable. All the following SuperHyperSets of SuperHyperVertices are the simple type-SuperHyperSet of the SuperHyperStable.The SuperHyperSets of SuperHyperVertices, are the simple type-SuperHyperSet of the SuperHyperStable. The SuperHyperSets of the SuperHyperVertices, are corresponded to a SuperHyperStable for a SuperHyperGraph is the maximum cardinality of a SuperHyperSet S of SuperHyperVertices such that there’s no SuperHyperVertex to have a SuperHyperEdge in common. There’re only two SuperHyperVertices inside the intended SuperHyperSet. Thus the non-obvious SuperHyperStable is up. The obvious simple type-SuperHyperSet of the SuperHyperStable is a SuperHyperSet includes only one SuperHyperVertex. But the SuperHyperSets of SuperHyperVertices, don’t have less than two SuperHyperVertices inside the intended SuperHyperSet. Thus the non-obvious simple type-SuperHyperSet of the SuperHyperStable are up. To sum them up, the SuperHyperSets of SuperHyperVertices, are the non-obvious simple type-SuperHyperSet of the SuperHyperStable. Since the SuperHyperSets of the SuperHyperVertices, are corresponded to a SuperHyperStable for a SuperHyperGraph is the SuperHyperSet S of SuperHyperVertices such that there’s no SuperHyperVertex to have a SuperHyperEdge in common and they are corresponded to a SuperHyperStable. Since They’ve the maximum cardinality of a SuperHyperSet S of SuperHyperVertices such that there’s no SuperHyperVertex to have a SuperHyperEdge in common. There aren’t only less than two SuperHyperVertices inside the intended SuperHyperSets, Thus the non-obvious SuperHyperStable, are up. The obvious simple type-SuperHyperSets of the SuperHyperStable, are SuperHyperSets, don’t include only less than two SuperHyperVertices in a connected neutrosophic SuperHyperGraph It’s interesting to mention that the only obvious simple type-SuperHyperSets of the neutrosophic SuperHyperStable amid those obvious simple type-SuperHyperSets of the SuperHyperStable, is only
- On the (Figure 3), the SuperHyperNotion, namely, SuperHyperStable, is up. and are some empty SuperHyperEdges but is an SuperHyperEdge. Thus in the terms of SuperHyperNeighbor, there’s only one SuperHyperEdge, namely, The SuperHyperSets of SuperHyperVertices, are the simple type-SuperHyperSet of the SuperHyperStable. The SuperHyperSets of the SuperHyperVertices, are the maximum cardinality of a SuperHyperSet S of SuperHyperVertices such that there’s no SuperHyperVertex to have a SuperHyperEdge in common. There’re only one SuperHyperVertex inside the intended SuperHyperSet. Thus the non-obvious SuperHyperStable aren’t up. The obvious simple type-SuperHyperSet of the SuperHyperStable is a SuperHyperSet includes only one SuperHyperVertex in a connected neutrosophic SuperHyperGraph But the SuperHyperSets of SuperHyperVertices, don’t have more than one SuperHyperVertex inside the intended SuperHyperSet. Thus the non-obvious simple type-SuperHyperSets of the SuperHyperStable aren’t up. To sum them up, the SuperHyperSets of SuperHyperVertices, aren’t the non-obvious simple type-SuperHyperSet of the SuperHyperStable. Since the SuperHyperSets of the SuperHyperVertices, are corresponded to a SuperHyperStable for a SuperHyperGraph is the SuperHyperSet S of SuperHyperVertices such that there’s no SuperHyperVertex to have a SuperHyperEdge in common and they are SuperHyperStable. Since they’ve the maximum cardinality of a SuperHyperSet S of SuperHyperVertices such that there’s no SuperHyperVertex to have a SuperHyperEdge in common. There are only less than two SuperHyperVertices inside the intended SuperHyperSets, Thus the non-obvious SuperHyperStable, aren’t up. The obvious simple type-SuperHyperSets of the SuperHyperStable, are the SuperHyperSets, 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 SuperHyperStable amid those obvious simple type-SuperHyperSets of the SuperHyperStable, is only
- On the (Figure 4), the SuperHyperNotion, namely, an 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 SuperHyperStable. The SuperHyperSet of the SuperHyperVertices, is the maximum cardinality of a SuperHyperSet S of SuperHyperVertices such that there’s no SuperHyperVertex to have a SuperHyperEdge in common. There’re only two SuperHyperVertices inside the intended SuperHyperSet. Thus the non-obvious SuperHyperStable isn’t up. The obvious simple type-SuperHyperSet of the 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 SuperHyperStable isn’t up. To sum them up, the SuperHyperSet of SuperHyperVertices, is the non-obvious simple type-SuperHyperSet of the SuperHyperStable. Since the SuperHyperSet of the SuperHyperVertices, is the SuperHyperSet Ss of a SuperHyperSet S of SuperHyperVertices such that there’s no SuperHyperVertex to have a SuperHyperEdge in common and it’s SuperHyperStable. Since it’s the maximum cardinality of a SuperHyperSet S of SuperHyperVertices such that there’s no SuperHyperVertex to have a SuperHyperEdge in common. There aren’t only less than two SuperHyperVertices inside the intended SuperHyperSet, Thus the non-obvious SuperHyperStable, is up. The obvious simple type-SuperHyperSet of the SuperHyperStable, is a SuperHyperSet, doesn’t include only less than two SuperHyperVertices in a connected neutrosophic SuperHyperGraph
- On the (Figure 5), the SuperHyperNotion, namely, SuperHyperStable, is up. There’s neither empty SuperHyperEdge nor loop SuperHyperEdge. The SuperHyperSet of SuperHyperVertices, is the simple type-SuperHyperSet of the SuperHyperStable. The SuperHyperSet of the SuperHyperVertices, is the maximum cardinality of a SuperHyperSet S of SuperHyperVertices such that there’s no SuperHyperVertex to have a SuperHyperEdge in common. There’re only one SuperHyperVertex inside the intended SuperHyperSet. Thus the non-obvious SuperHyperStable is up. The obvious simple type-SuperHyperSet of the 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 SuperHyperStable is up. To sum them up, the SuperHyperSet of SuperHyperVertices, is the non-obvious simple type-SuperHyperSet of the SuperHyperStable. Since the SuperHyperSet of the SuperHyperVertices, is the SuperHyperSet Ss of SuperHyperVertices such that there’s no SuperHyperVertex to have a SuperHyperEdge in common. and it’s SuperHyperStable. Since it’s the maximum cardinality of SuperHyperVertices such that there’s no SuperHyperVertex to have a SuperHyperEdge in common. There aren’t only less than two SuperHyperVertices inside the intended SuperHyperSet, Thus the non-obvious SuperHyperStable, is up. The obvious simple type-SuperHyperSet of the 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, SuperHyperStable, is up. There’s neither empty SuperHyperEdge nor loop SuperHyperEdge. The SuperHyperSet of SuperHyperVertices,is the simple type-SuperHyperSet of the SuperHyperStable. The SuperHyperSet of the SuperHyperVertices,is the maximum cardinality of SuperHyperVertices such that there’s no SuperHyperVertex to have a SuperHyperEdge in common. There’re only only SuperHyperVertex inside the intended SuperHyperSet. Thus the non-obvious SuperHyperStable is up. The obvious simple type-SuperHyperSet of the 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 SuperHyperStable is up. To sum them up, the SuperHyperSet of SuperHyperVertices,is the non-obvious simple type-SuperHyperSet of the SuperHyperStable. Since the SuperHyperSet of the SuperHyperVertices,is the SuperHyperSet Ss of SuperHyperVertices such that there’s no SuperHyperVertex to have a SuperHyperEdge in common and it’s a SuperHyperStable. Since it’s the maximum cardinality of SuperHyperVertices such that there’s no SuperHyperVertex to have a SuperHyperEdge in common. There aren’t only less than two SuperHyperVertices inside the intended SuperHyperSet,Thus the non-obvious SuperHyperStable,is up. The obvious simple type-SuperHyperSet of the 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, SuperHyperStable, is up. There’s neither empty SuperHyperEdge nor loop SuperHyperEdge. The SuperHyperSet of SuperHyperVertices, is the simple type-SuperHyperSet of the SuperHyperStable. The SuperHyperSet of the SuperHyperVertices, is the maximum cardinality of a SuperHyperSet S of SuperHyperVertices such that there’s no SuperHyperVertex to have a SuperHyperEdge in common. There’re only one SuperHyperVertex inside the intended SuperHyperSet. Thus the non-obvious SuperHyperStable is up. The obvious simple type-SuperHyperSet of the 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 SuperHyperStable is up. To sum them up, the SuperHyperSet of SuperHyperVertices, is the non-obvious simple type-SuperHyperSet of the SuperHyperStable. Since the SuperHyperSet of the SuperHyperVertices, is the SuperHyperSet Ss of SuperHyperVertices such that there’s no SuperHyperVertex to have a SuperHyperEdge in common and it’s a SuperHyperStable. Since it’s the maximum cardinality of a SuperHyperSet S of SuperHyperVertices such that there’s no SuperHyperVertex to have a SuperHyperEdge in common. There aren’t only less than two SuperHyperVertices inside the intended SuperHyperSet, Thus the non-obvious SuperHyperStable, is up. The obvious simple type-SuperHyperSet of the 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, SuperHyperStable, is up. There’s neither empty SuperHyperEdge nor loop SuperHyperEdge. The SuperHyperSet of SuperHyperVertices, is the simple type-SuperHyperSet of the SuperHyperStable. The SuperHyperSet of the SuperHyperVertices, is the maximum cardinality of a SuperHyperSet S of SuperHyperVertices such that there’s no SuperHyperVertex to have a SuperHyperEdge in common. There’re not only two SuperHyperVertices inside the intended SuperHyperSet. Thus the non-obvious SuperHyperStable is up. The obvious simple type-SuperHyperSet of the 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 SuperHyperStable is up. To sum them up, the SuperHyperSet of SuperHyperVertices, is the non-obvious simple type-SuperHyperSet of the SuperHyperStable. Since the SuperHyperSet of the SuperHyperVertices, is the SuperHyperSet Ss of SuperHyperVertices such that there’s no SuperHyperVertex to have a SuperHyperEdge in common and it’s a SuperHyperStable. Since it’s the maximum cardinality of a SuperHyperSet S of SuperHyperVertices such that there’s no SuperHyperVertex to have a SuperHyperEdge in common. There aren’t only less than two SuperHyperVertices inside the intended SuperHyperSet, Thus the non-obvious SuperHyperStable, is up. The obvious simple type-SuperHyperSet of the SuperHyperStable, is a SuperHyperSet, doesn’t exclude only more than two SuperHyperVertices in a connected neutrosophic SuperHyperGraph of dense SuperHyperModel as the (Figure 8).
-
On the (Figure 9), the SuperHyperNotion, namely, SuperHyperStable, is up. There’s neither empty SuperHyperEdge nor loop SuperHyperEdge. The SuperHyperSet of SuperHyperVertices,is the simple type-SuperHyperSet of the SuperHyperStable. The SuperHyperSet of the SuperHyperVertices,is the maximum cardinality of SuperHyperVertices such that there’s no SuperHyperVertex to have a SuperHyperEdge in common. There’re only only SuperHyperVertex inside the intended SuperHyperSet. Thus the non-obvious SuperHyperStable is up. The obvious simple type-SuperHyperSet of the 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 SuperHyperStable is up. To sum them up, the SuperHyperSet of SuperHyperVertices,is the non-obvious simple type-SuperHyperSet of the SuperHyperStable. Since the SuperHyperSet of the SuperHyperVertices,is the SuperHyperSet Ss of SuperHyperVertices such that there’s no SuperHyperVertex to have a SuperHyperEdge in common and it’s a SuperHyperStable. Since it’s the maximum cardinality of SuperHyperVertices such that there’s no SuperHyperVertex to have a SuperHyperEdge in common. There aren’t only less than two SuperHyperVertices inside the intended SuperHyperSet,Thus the non-obvious SuperHyperStable,is up. The obvious simple type-SuperHyperSet of the 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, SuperHyperStable, is up. There’s neither empty SuperHyperEdge nor loop SuperHyperEdge. The SuperHyperSet of SuperHyperVertices, is the simple type-SuperHyperSet of the SuperHyperStable. The SuperHyperSet of the SuperHyperVertices, is the maximum cardinality of a SuperHyperSet S of SuperHyperVertices such that there’s no SuperHyperVertex to have a SuperHyperEdge in common. There’re not only two SuperHyperVertices inside the intended SuperHyperSet. Thus the non-obvious SuperHyperStable is up. The obvious simple type-SuperHyperSet of the 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 SuperHyperStable is up. To sum them up, the SuperHyperSet of SuperHyperVertices, is the non-obvious simple type-SuperHyperSet of the SuperHyperStable. Since the SuperHyperSet of the SuperHyperVertices, is the SuperHyperSet Ss of SuperHyperVertices such that there’s no SuperHyperVertex to have a SuperHyperEdge in common and it’s a SuperHyperStable. Since it’s the maximum cardinality of a SuperHyperSet S of SuperHyperVertices such that there’s no SuperHyperVertex to have a SuperHyperEdge in common. There aren’t only less than two SuperHyperVertices inside the intended SuperHyperSet, Thus the non-obvious SuperHyperStable, is up. The obvious simple type-SuperHyperSet of the SuperHyperStable, is a SuperHyperSet, doesn’t exclude only more than two SuperHyperVertices in a connected neutrosophic SuperHyperGraph of highly-embedding-connected SuperHyperModel as the (Figure 10).
- On the (Figure 11), the SuperHyperNotion, namely, SuperHyperStable, is up. There’s neither empty SuperHyperEdge nor loop SuperHyperEdge. The SuperHyperSet of SuperHyperVertices, is the simple type-SuperHyperSet of the SuperHyperStable. The SuperHyperSet of the SuperHyperVertices, is the maximum cardinality of a SuperHyperSet S of SuperHyperVertices such that there’s no SuperHyperVertex to have a SuperHyperEdge in common. There’re only two SuperHyperVertices inside the intended SuperHyperSet. Thus the non-obvious SuperHyperStable is up. The obvious simple type-SuperHyperSet of the 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 SuperHyperStable is up. To sum them up, the SuperHyperSet of SuperHyperVertices, is the non-obvious simple type-SuperHyperSet of the SuperHyperStable. Since the SuperHyperSet of the SuperHyperVertices, is the SuperHyperSet Ss of SuperHyperVertices such that there’s no SuperHyperVertex to have a SuperHyperEdge in common and it’s a SuperHyperStable. Since it’s the maximum cardinality of a SuperHyperSet S of SuperHyperVertices such that there’s no SuperHyperVertex to have a SuperHyperEdge in common. There aren’t only less than two SuperHyperVertices inside the intended SuperHyperSet, Thus the non-obvious SuperHyperStable, is up. The obvious simple type-SuperHyperSet of the SuperHyperStable, is a SuperHyperSet, doesn’t include only less than two SuperHyperVertices in a connected neutrosophic SuperHyperGraph
- On the (Figure 12), the SuperHyperNotion, namely, SuperHyperStable, is up. There’s neither empty SuperHyperEdge nor loop SuperHyperEdge. The SuperHyperSet of SuperHyperVertices, is the simple type-SuperHyperSet of the SuperHyperStable. The SuperHyperSet of the SuperHyperVertices, is the maximum cardinality of SuperHyperVertices such that there’s no SuperHyperVertex to have a SuperHyperEdge in common. There’re not only two SuperHyperVertices inside the intended SuperHyperSet. Thus the non-obvious SuperHyperStable is up. The obvious simple type-SuperHyperSet of the 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 SuperHyperStable is up. To sum them up, the SuperHyperSet of SuperHyperVertices, is the non-obvious simple type-SuperHyperSet of the SuperHyperStable. Since the SuperHyperSet of the SuperHyperVertices, is the SuperHyperSet Ss of SuperHyperVertices such that there’s no SuperHyperVertex to have a SuperHyperEdge in common and they are SuperHyperStable. Since it’s the maximum cardinality of SuperHyperVertices such that there’s no SuperHyperVertex to have a SuperHyperEdge in common. There aren’t only less than two SuperHyperVertices inside the intended SuperHyperSet, Thus the non-obvious SuperHyperStable, is up. The obvious simple type-SuperHyperSet of the 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, SuperHyperStable, is up. There’s neither empty SuperHyperEdge nor loop SuperHyperEdge. The SuperHyperSet of SuperHyperVertices, is the simple type-SuperHyperSet of the SuperHyperStable. The SuperHyperSet of the SuperHyperVertices, is the maximum cardinality of a SuperHyperSet S of SuperHyperVertices such that there’s no SuperHyperVertex to have a SuperHyperEdge in common. There’re only two SuperHyperVertices inside the intended SuperHyperSet. Thus the non-obvious SuperHyperStable is up. The obvious simple type-SuperHyperSet of the 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 SuperHyperStable is up. To sum them up, the SuperHyperSet of SuperHyperVertices, is the non-obvious simple type-SuperHyperSet of the SuperHyperStable. Since the SuperHyperSet of the SuperHyperVertices, is the SuperHyperSet Ss of SuperHyperVertices such that there’s no SuperHyperVertex to have a SuperHyperEdge in common and it’s a SuperHyperStable. Since it’s the maximum cardinality of a SuperHyperSet S of SuperHyperVertices such that there’s no SuperHyperVertex to have a SuperHyperEdge in common. There aren’t only less than two SuperHyperVertices inside the intended SuperHyperSet, Thus the non-obvious SuperHyperStable, is up. The obvious simple type-SuperHyperSet of the SuperHyperStable, is a SuperHyperSet, doesn’t include only less than two SuperHyperVertices in a connected neutrosophic SuperHyperGraph
- On the (Figure 14), the SuperHyperNotion, namely, SuperHyperStable, is up. There’s neither empty SuperHyperEdge nor loop SuperHyperEdge. The SuperHyperSet of SuperHyperVertices, is the simple type-SuperHyperSet of the SuperHyperStable. The SuperHyperSet of the SuperHyperVertices, is the maximum cardinality of a SuperHyperSet S of SuperHyperVertices such that there’s no SuperHyperVertex to have a SuperHyperEdge in common. There’re only two SuperHyperVertices inside the intended SuperHyperSet. Thus the non-obvious SuperHyperStable is up. The obvious simple type-SuperHyperSet of the 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 SuperHyperStable is up. To sum them up, the SuperHyperSet of SuperHyperVertices, is the non-obvious simple type-SuperHyperSet of the SuperHyperStable. Since the SuperHyperSet of the SuperHyperVertices, is the SuperHyperSet Ss of SuperHyperVertices such that there’s no SuperHyperVertex to have a SuperHyperEdge in common and it’s a SuperHyperStable. Since it’s the maximum cardinality of a SuperHyperSet S of SuperHyperVertices such that there’s no SuperHyperVertex to have a SuperHyperEdge in common. There aren’t only less than two SuperHyperVertices inside the intended SuperHyperSet, Thus the non-obvious SuperHyperStable, is up. The obvious simple type-SuperHyperSet of the SuperHyperStable, is a SuperHyperSet, doesn’t include only less than two SuperHyperVertices in a connected neutrosophic SuperHyperGraph
- On the (Figure 15), the SuperHyperNotion, namely, SuperHyperStable, is up. There’s neither empty SuperHyperEdge nor loop SuperHyperEdge. The SuperHyperSet of SuperHyperVertices, is the simple type-SuperHyperSet of the SuperHyperStable. The SuperHyperSet of the SuperHyperVertices, is the maximum cardinality of a SuperHyperSet S of SuperHyperVertices such that there’s no SuperHyperVertex to have a SuperHyperEdge in common. There’re only two SuperHyperVertices inside the intended SuperHyperSet. Thus the non-obvious SuperHyperStable is up. The obvious simple type-SuperHyperSet of the 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 SuperHyperStable is up. To sum them up, the SuperHyperSet of SuperHyperVertices, is the non-obvious simple type-SuperHyperSet of the SuperHyperStable. Since the SuperHyperSet of the SuperHyperVertices, is the SuperHyperSet Ss of SuperHyperVertices such that there’s no SuperHyperVertex to have a SuperHyperEdge in common and it’s a SuperHyperStable. Since it’s the maximum cardinality of a SuperHyperSet S of SuperHyperVertices such that there’s no SuperHyperVertex to have a SuperHyperEdge in common. There aren’t only less than two SuperHyperVertices inside the intended SuperHyperSet, Thus the non-obvious SuperHyperStable, is up. The obvious simple type-SuperHyperSet of the 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, SuperHyperStable, is up. There’s neither empty SuperHyperEdge nor loop SuperHyperEdge. The SuperHyperSet of SuperHyperVertices, is the simple type-SuperHyperSet of the SuperHyperStable. The SuperHyperSet of the SuperHyperVertices, is the maximum cardinality of a SuperHyperSet S of SuperHyperVertices such that there’s no SuperHyperVertex to have a SuperHyperEdge in common. There’re only two SuperHyperVertices inside the intended SuperHyperSet. Thus the non-obvious SuperHyperStable is up. The obvious simple type-SuperHyperSet of the 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 SuperHyperStable is up. To sum them up, the SuperHyperSet of SuperHyperVertices, is the non-obvious simple type-SuperHyperSet of the SuperHyperStable. Since the SuperHyperSet of the SuperHyperVertices, is the SuperHyperSet Ss of SuperHyperVertices such that there’s no SuperHyperVertex to have a SuperHyperEdge in common and it’s a SuperHyperStable. Since it’s the maximum cardinality of a SuperHyperSet S of SuperHyperVertices such that there’s no SuperHyperVertex to have a SuperHyperEdge in common. There aren’t only less than two SuperHyperVertices inside the intended SuperHyperSet, Thus the non-obvious SuperHyperStable, is up. The obvious simple type-SuperHyperSet of the SuperHyperStable, is a SuperHyperSet, doesn’t include only less than two SuperHyperVertices in a connected neutrosophic SuperHyperGraph
- On the (Figure 17), the SuperHyperNotion, namely, SuperHyperStable, is up. There’s neither empty SuperHyperEdge nor loop SuperHyperEdge. The SuperHyperSet of SuperHyperVertices, is the simple type-SuperHyperSet of the SuperHyperStable. The SuperHyperSet of the SuperHyperVertices, is the maximum cardinality of a SuperHyperSet S of SuperHyperVertices such that there’s no SuperHyperVertex to have a SuperHyperEdge in common. There’re only two SuperHyperVertices inside the intended SuperHyperSet. Thus the non-obvious SuperHyperStable is up. The obvious simple type-SuperHyperSet of the 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 SuperHyperStable is up. To sum them up, the SuperHyperSet of SuperHyperVertices, is the non-obvious simple type-SuperHyperSet of the SuperHyperStable. Since the SuperHyperSet of the SuperHyperVertices, is the SuperHyperSet Ss of SuperHyperVertices such that there’s no SuperHyperVertex to have a SuperHyperEdge in common and it’s a SuperHyperStable. Since it’s the maximum cardinality of a SuperHyperSet S of SuperHyperVertices such that there’s no SuperHyperVertex to have a SuperHyperEdge in common. There aren’t only less than two SuperHyperVertices inside the intended SuperHyperSet, Thus the non-obvious SuperHyperStable, is up. The obvious simple type-SuperHyperSet of the SuperHyperStable, is a SuperHyperSet, doesn’t include only less than two SuperHyperVertices in a connected neutrosophic SuperHyperGraph as Lnearly-over-packed SuperHyperModel is featured On the (Figure 17).
- On the (Figure 18), the SuperHyperNotion, namely, SuperHyperStable, is up. There’s neither empty SuperHyperEdge nor loop SuperHyperEdge. The SuperHyperSet of SuperHyperVertices, is the simple type-SuperHyperSet of the SuperHyperStable. The SuperHyperSet of the SuperHyperVertices, is the maximum cardinality of a SuperHyperSet S of SuperHyperVertices such that there’s no SuperHyperVertex to have a SuperHyperEdge in common. There’s only one SuperHyperVertex inside the intended SuperHyperSet. Thus the non-obvious SuperHyperStable isn’t up. The obvious simple type-SuperHyperSet of the 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, does has less than two SuperHyperVertices inside the intended SuperHyperSet. Thus the non-obvious simple type-SuperHyperSet of the SuperHyperStable isn’t up. To sum them up, the SuperHyperSet of SuperHyperVertices, isn’t the non-obvious simple type-SuperHyperSet of the SuperHyperStable. Since the SuperHyperSet of the SuperHyperVertices, is the SuperHyperSet Ss of SuperHyperVertices such that there’s no SuperHyperVertex to have a SuperHyperEdge in common and it’s a SuperHyperStable. Since it’s the maximum cardinality of a SuperHyperSet S of SuperHyperVertices such that there’s no SuperHyperVertex to have a SuperHyperEdge in common. There’s only less than two SuperHyperVertices inside the intended SuperHyperSet, Thus the non-obvious SuperHyperStable, isn’t up. The obvious simple type-SuperHyperSet of the SuperHyperStable, is a SuperHyperSet, does includes only less than two SuperHyperVertices in a connected neutrosophic SuperHyperGraph
- On the (Figure 19), the SuperHyperNotion, namely, SuperHyperStable, is up. There’s neither empty SuperHyperEdge nor loop SuperHyperEdge. The SuperHyperSet of SuperHyperVertices, is the simple type-SuperHyperSet of the SuperHyperStable. The SuperHyperSet of the SuperHyperVertices, is the maximum cardinality of a SuperHyperSet S of SuperHyperVertices such that there’s no SuperHyperVertex to have a SuperHyperEdge in common. There’re only two SuperHyperVertices inside the intended SuperHyperSet. Thus the non-obvious SuperHyperStable is up. The obvious simple type-SuperHyperSet of the 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 SuperHyperStable is up. To sum them up, the SuperHyperSet of SuperHyperVertices, is the non-obvious simple type-SuperHyperSet of the SuperHyperStable. Since the SuperHyperSet of the SuperHyperVertices, is the SuperHyperSet Ss of SuperHyperVertices such that there’s no SuperHyperVertex to have a SuperHyperEdge in common and it’s a SuperHyperStable. Since it’s the maximum cardinality of a SuperHyperSet S of SuperHyperVertices such that there’s no SuperHyperVertex to have a SuperHyperEdge in common. There aren’t only less than two SuperHyperVertices inside the intended SuperHyperSet, Thus the non-obvious SuperHyperStable, is up. The obvious simple type-SuperHyperSet of the SuperHyperStable, is a SuperHyperSet, doesn’t include only less than two SuperHyperVertices in a connected neutrosophic SuperHyperGraph
- On the (Figure 20), the SuperHyperNotion, namely, SuperHyperStable, is up. There’s neither empty SuperHyperEdge nor loop SuperHyperEdge. The SuperHyperSet of SuperHyperVertices, is the simple type-SuperHyperSet of the SuperHyperStable. The SuperHyperSet of the SuperHyperVertices, is the maximum cardinality of a SuperHyperSet S of SuperHyperVertices such that there’s no SuperHyperVertex to have a SuperHyperEdge in common. There’re only two SuperHyperVertices inside the intended SuperHyperSet. Thus the non-obvious SuperHyperStable is up. The obvious simple type-SuperHyperSet of the 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 SuperHyperStable is up. To sum them up, the SuperHyperSet of SuperHyperVertices, is the non-obvious simple type-SuperHyperSet of the SuperHyperStable. Since the SuperHyperSet of the SuperHyperVertices, is the SuperHyperSet Ss of SuperHyperVertices such that there’s no SuperHyperVertex to have a SuperHyperEdge in common and it’s a SuperHyperStable. Since it’s the maximum cardinality of a SuperHyperSet S of SuperHyperVertices such that there’s no SuperHyperVertex to have a SuperHyperEdge in common. There aren’t only less than two SuperHyperVertices inside the intended SuperHyperSet, Thus the non-obvious SuperHyperStable, is up. The obvious simple type-SuperHyperSet of the SuperHyperStable, is a SuperHyperSet, doesn’t include only less than two SuperHyperVertices in a connected neutrosophic SuperHyperGraph




















3. Results on Extreme SuperHyperClasses
4. General Extreme Results
- the dual SuperHyperDefensive SuperHyperStable;
- the strong dual SuperHyperDefensive SuperHyperStable;
- the connected dual SuperHyperDefensive SuperHyperStable;
- the δ-dual SuperHyperDefensive SuperHyperStable;
- the strong δ-dual SuperHyperDefensive SuperHyperStable;
- the connected δ-dual SuperHyperDefensive SuperHyperStable.
- the SuperHyperDefensive SuperHyperStable;
- the strong SuperHyperDefensive SuperHyperStable;
- the connected defensive SuperHyperDefensive SuperHyperStable;
- the δ-SuperHyperDefensive SuperHyperStable;
- the strong δ-SuperHyperDefensive SuperHyperStable;
- the connected δ-SuperHyperDefensive SuperHyperStable.
- the SuperHyperDefensive SuperHyperStable;
- the strong SuperHyperDefensive SuperHyperStable;
- the connected SuperHyperDefensive SuperHyperStable;
- the δ-SuperHyperDefensive SuperHyperStable;
- the strong δ-SuperHyperDefensive SuperHyperStable;
- the connected δ-SuperHyperDefensive SuperHyperStable.
- SuperHyperDefensive SuperHyperStable;
- strong SuperHyperDefensive SuperHyperStable;
- connected SuperHyperDefensive SuperHyperStable;
- -SuperHyperDefensive SuperHyperStable;
- strong -SuperHyperDefensive SuperHyperStable;
- connected -SuperHyperDefensive SuperHyperStable;
- dual SuperHyperDefensive SuperHyperStable;
- strong dual SuperHyperDefensive SuperHyperStable;
- connected dual SuperHyperDefensive SuperHyperStable;
- -dual SuperHyperDefensive SuperHyperStable;
- strong -dual SuperHyperDefensive SuperHyperStable;
- connected -dual SuperHyperDefensive SuperHyperStable;
- the SuperHyperStable;
- the SuperHyperStable;
- the connected SuperHyperStable;
- the -SuperHyperStable;
- the strong -SuperHyperStable;
- the connected -SuperHyperStable.
- the dual SuperHyperStable;
- the dual SuperHyperStable;
- the dual connected SuperHyperStable;
- the dual -SuperHyperStable;
- the strong dual -SuperHyperStable;
- the connected dual -SuperHyperStable.
- dual SuperHyperDefensive SuperHyperStable;
- strong dual SuperHyperDefensive SuperHyperStable;
- connected dual SuperHyperDefensive SuperHyperStable;
- -dual SuperHyperDefensive SuperHyperStable;
- strong -dual SuperHyperDefensive SuperHyperStable;
- connected -dual SuperHyperDefensive SuperHyperStable.
- SuperHyperDefensive SuperHyperStable;
- strong SuperHyperDefensive SuperHyperStable;
- connected SuperHyperDefensive SuperHyperStable;
- δ-SuperHyperDefensive SuperHyperStable;
- strong δ-SuperHyperDefensive SuperHyperStable;
- connected δ-SuperHyperDefensive SuperHyperStable.
- dual SuperHyperDefensive SuperHyperStable;
- strong dual SuperHyperDefensive SuperHyperStable;
- connected dual SuperHyperDefensive SuperHyperStable;
- -dual SuperHyperDefensive SuperHyperStable;
- strong -dual SuperHyperDefensive SuperHyperStable;
- connected -dual SuperHyperDefensive SuperHyperStable.
- SuperHyperDefensive SuperHyperStable;
- strong SuperHyperDefensive SuperHyperStable;
- connected SuperHyperDefensive SuperHyperStable;
- SuperHyperStable;
- strong 1-SuperHyperDefensive SuperHyperStable;
- connected 1-SuperHyperDefensive SuperHyperStable.
- SuperHyperDefensive SuperHyperStable;
- strong SuperHyperDefensive SuperHyperStable;
- connected SuperHyperDefensive SuperHyperStable;
- -SuperHyperDefensive SuperHyperStable;
- strong -SuperHyperDefensive SuperHyperStable;
- connected -SuperHyperDefensive SuperHyperStable.
- SuperHyperDefensive SuperHyperStable;
- strong SuperHyperDefensive SuperHyperStable;
- connected SuperHyperDefensive SuperHyperStable;
- 0-SuperHyperDefensive SuperHyperStable;
- strong 0-SuperHyperDefensive SuperHyperStable;
- connected 0-SuperHyperDefensive SuperHyperStable.
- SuperHyperDefensive SuperHyperStable;
- strong SuperHyperDefensive SuperHyperStable;
- connected SuperHyperDefensive SuperHyperStable;
- -SuperHyperDefensive SuperHyperStable;
- strong -SuperHyperDefensive SuperHyperStable;
- connected -SuperHyperDefensive SuperHyperStable.
- SuperHyperDefensive SuperHyperStable;
- strong SuperHyperDefensive SuperHyperStable;
- connected SuperHyperDefensive SuperHyperStable;
- -SuperHyperDefensive SuperHyperStable;
- strong -SuperHyperDefensive SuperHyperStable;
- connected -SuperHyperDefensive SuperHyperStable.
- S is SuperHyperDominating set;
- there’s such that is SuperHyperChromatic number.
- the SuperHyperSet is a dual SuperHyperDefensive SuperHyperStable;
- and corresponded SuperHyperSet is ;
- the SuperHyperSets and are only a dual SuperHyperStable.
- the set is a dual SuperHyperDefensive SuperHyperStable;
- and corresponded SuperHyperSets are and
- the SuperHyperSets and are only dual SuperHyperStable.
- the SuperHyperSet is a dual SuperHyperDefensive SuperHyperStable;
- and corresponded SuperHyperSets are and
- the SuperHyperSets and are only dual SuperHyperStable.
- the SuperHyperSet is a dual SuperHyperDefensive SuperHyperStable;
- and corresponded SuperHyperSet is ;
- the SuperHyperSets and are only dual SuperHyperStable.
- the SuperHyperSet is a dual maximal SuperHyperStable;
- the SuperHyperSets and are only dual SuperHyperStable.
- the SuperHyperSet is a dual maximal SuperHyperDefensive SuperHyperStable;
- the SuperHyperSet is only a dual maximal SuperHyperDefensive SuperHyperStable.
- the SuperHyperSet is a dual SuperHyperDefensive SuperHyperStable;
- the SuperHyperSet is only a dual SuperHyperDefensive SuperHyperStable.
- the SuperHyperSet is a dual SuperHyperDefensive SuperHyperStable;
- the SuperHyperSet is only a dual maximal SuperHyperDefensive SuperHyperStable.
- the SuperHyperSet is a dual SuperHyperDefensive SuperHyperStable for
- for
- for
- the SuperHyperSets and are only dual SuperHyperStable for
- the SuperHyperSet is a dual maximal SuperHyperDefensive SuperHyperStable for
- for
- for
- the SuperHyperSets are only a dual maximal SuperHyperStable for
- the SuperHyperSet is a dual SuperHyperDefensive SuperHyperStable for
- for
- for
- the SuperHyperSets are only dual maximal SuperHyperStable for
- if and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive SuperHyperStable, then S is an s-SuperHyperDefensive SuperHyperStable;
- if and a SuperHyperSet S of SuperHyperVertices is a dual t-SuperHyperDefensive SuperHyperStable, then S is a dual s-SuperHyperDefensive SuperHyperStable.
- if and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive SuperHyperStable, then S is an s-SuperHyperPowerful SuperHyperStable;
- if and a SuperHyperSet S of SuperHyperVertices is a dual t-SuperHyperDefensive SuperHyperStable, then S is a dual s-SuperHyperPowerful SuperHyperStable.
- if then is an 2-SuperHyperDefensive SuperHyperStable;
- if then is a dual 2-SuperHyperDefensive SuperHyperStable;
- if then is an r-SuperHyperDefensive SuperHyperStable;
- if then is a dual r-SuperHyperDefensive SuperHyperStable.
- if is an 2-SuperHyperDefensive SuperHyperStable;
- if is a dual 2-SuperHyperDefensive SuperHyperStable;
- if is an r-SuperHyperDefensive SuperHyperStable;
- if is a dual r-SuperHyperDefensive SuperHyperStable.
- if is an 2-SuperHyperDefensive SuperHyperStable;
- if is a dual 2-SuperHyperDefensive SuperHyperStable;
- if is an -SuperHyperDefensive SuperHyperStable;
- if is a dual -SuperHyperDefensive SuperHyperStable.
- if then is an 2-SuperHyperDefensive SuperHyperStable;
- if then is a dual 2-SuperHyperDefensive SuperHyperStable;
- if then is -SuperHyperDefensive SuperHyperStable;
- if then is a dual -SuperHyperDefensive SuperHyperStable.
- if is an 2-SuperHyperDefensive SuperHyperStable;
- if is a dual 2-SuperHyperDefensive SuperHyperStable;
- if is an 2-SuperHyperDefensive SuperHyperStable;
- if is a dual 2-SuperHyperDefensive SuperHyperStable.
- if then is an 2-SuperHyperDefensive SuperHyperStable;
- if then is a dual 2-SuperHyperDefensive SuperHyperStable;
- if then is an 2-SuperHyperDefensive SuperHyperStable;
- if then is a dual 2-SuperHyperDefensive SuperHyperStable.
5. Applications in Cancer’s Extreme Recognition
- Step 1.
- (Definition) The recognition of the cancer in the long-term function.
- Step 2.
- (Issue) The specific region has been assigned by the model [it’s called SuperHyperGraph] and the long cycle of the move from the cancer is identified by this research. Sometimes the move of the cancer hasn’t be easily identified since there are some determinacy, indeterminacy and neutrality about the moves and the effects of the cancer on that region; this event leads us to choose another model [it’s said to be neutrosophic SuperHyperGraph] to have convenient perception on what’s happened and what’s done.
- Step 3.
- (Model) There are some specific models, which are well-known and they’ve got the names, and some general models. The moves and the traces of the cancer on the complex tracks and between complicated groups of cells could be fantasized by a neutrosophic SuperHyperPath(-/SuperHyperCycle, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find either the SuperHyperStable or the neutrosophic SuperHyperStable in those neutrosophic SuperHyperModels.
5.1. Case 1: The Initial Steps Toward SuperHyperBipartite as SuperHyperModel
- Step 4.
- (Solution) In the (Figure 27), the SuperHyperBipartite is highlighted and featured.
| The Values of The Vertices | The Number of Position in Alphabet |
| The Values of The SuperVertices | The maximum Values of Its Vertices |
| The Values of The Edges | The maximum Values of Its Vertices |
| The Values of The HyperEdges | The maximum Values of Its Vertices |
| The Values of The SuperHyperEdges | The maximum Values of Its Endpoints |
-
The obtained SuperHyperSet, by the Algorithm in previous result, of the SuperHyperVertices of the connected SuperHyperBipartite in the SuperHyperModel (Figure 27),is the SuperHyperStable.
5.2. Case 2: The Increasing Steps Toward SuperHyperMultipartite as SuperHyperModel
6. Open Problems
- Question 99. Which the else SuperHyperModels could be defined based on Cancer’s recognitions?
- Question 100. Are there some SuperHyperNotions related to SuperHyperStable and the neutrosophic SuperHyperStable?
- Question 101. Are there some Algorithms to be defined on the SuperHyperModels to compute them?
- Question 102. Which the SuperHyperNotions are related to beyond the SuperHyperStable and the neutrosophic SuperHyperStable?
- Problem 103. The SuperHyperStable and the neutrosophic SuperHyperStable do a SuperHyperModel for the Cancer’s recognitions and they’re based on SuperHyperStable, are there else?
- Problem 104. Which the fundamental SuperHyperNumbers are related to these SuperHyperNumbers types-results?
- Problem 105. What’s the independent research based on Cancer’s recognitions concerning the multiple types of SuperHyperNotions?
7. Conclusion and Closing Remarks
References
- Henry, Garrett. Properties of SuperHyperGraph and Neutrosophic SuperHyperGraph. Neutrosophic Sets and Systems 2022, 49, 531–561. Available online: http://fs.unm.edu/NSS/NeutrosophicSuperHyperGraph34.pdf https://digitalrepository.unm.edu/nss_journal/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 2022, 1, 6–14. [Google Scholar]
- Henry, Garrett. (Neutrosophic) SuperHyperModeling of Cancer’s Recognitions Featuring (Neutrosophic) SuperHyperDefensive SuperHyperAlliances. Preprints 2022, 2022, 120549. [Google Scholar] [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. [Google Scholar] [CrossRef]
- Henry, Garrett. SuperHyperGirth on SuperHyperGraph and Neutrosophic SuperHyperGraph With SuperHyperModeling of Cancer’s Recognitions. Preprints 2022, 2022120500. [Google Scholar] [CrossRef]
- Henry, Garrett. Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic SuperHyperGraphs and SuperHyperGraphs Alongside Applications in Cancer’s Treatments. Preprints 2022, 2022120324. [Google Scholar] [CrossRef]
- Henry, Garrett. SuperHyperDominating and SuperHyperResolving on Neutrosophic SuperHyperGraphs And Their Directions in Game Theory and Neutrosophic SuperHyperClasses. Preprints 2022, 2022110576. [Google Scholar] [CrossRef]
- Henry, Garrett. Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To Use Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond. ResearchGate 2022. [Google Scholar] [CrossRef]
- Henry, Garrett. (Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs. ResearchGate 2022. [Google Scholar] [CrossRef]
- Henry, Garrett. Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic) SuperHyperModeling in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs. ResearchGate 2022. [Google Scholar] [CrossRef]
- Henry, Garrett. Basic Neutrosophic Notions Concerning SuperHyperDominating and Neutrosophic SuperHyperResolving in SuperHyperGraph. ResearchGate 2022. [Google Scholar] [CrossRef]
- Henry, Garrett. Initial Material of Neutrosophic reliminaries to Study Some Neutrosophic Notions Based on Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic SuperHyperGraph (NSHG). ResearchGate, 2022. [Google Scholar] [CrossRef]
- Henry, Garrett. Beyond Neutrosophic Graphs; E-publishing: Educational Publisher 1091 West 1st Ave Grandview Heights: Ohio, USA, 2022; Available online: http://fs.unm.edu/BeyondNeutrosophicGraphs.pdfISBN 979-1-59973-725-6.
- Henry, Garrett. Neutrosophic Duality; GLOBAL KNOWLEDGE - Publishing House 848 Brickell Ave Ste 950 Miami: Florida, USA, 2022; Available online: http://fs.unm.edu/NeutrosophicDuality.pdfISBN 978-1-59973-743-0.
- Smarandache, F. 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 2020, 33, 290–296. [Google Scholar] [CrossRef]
- Akram, M.; et al. Single-valued neutrosophic Hypergraphs. TWMS J. App. Eng. Math. 2018, 8, 122–135. [Google Scholar] [CrossRef]
- Broumi, S.; et al. Single-valued neutrosophic graphs. Journal of New Theory 2016, 10, 86–101. [Google Scholar]
- Wang, H.; et al. Single-valued neutrosophic sets. Multispace and Multistructure 2010, 4, 410–413. [Google Scholar]
- Nguyen, H.T.; Walker, E.A. A First course in fuzzy logic; CRC Press, 2006. [Google Scholar]








| The Values of The Vertices | The Number of Position in Alphabet |
| The Values of The SuperVertices | The maximum Values of Its Vertices |
| The Values of The Edges | The maximum Values of Its Vertices |
| The Values of The HyperEdges | The maximum Values of Its Vertices |
| The Values of The SuperHyperEdges | The maximum Values of Its Endpoints |
| Advantages | Limitations |
| 1.Redefining Neutrosophic SuperHyperGraph | 1.General Results |
| 2.SuperHyperStable | |
| 3.Neutrosophic SuperHyperStable | 2.Other SuperHyperNumbers |
| 4.Modeling of Cancer’s Recognitions | |
| 5.SuperHyperClasses | 3.SuperHyperFamilies |
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/).