4. neutrosophic SuperHyperMatching
The SuperHyperNotion, namely, SuperHyperMatching, is up. Thus the non-obvious neutrosophic SuperHyperMatching,
S is up. The obvious simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching, not:
S is the neutrosophic SuperHyperSet, not:
S does includes only less than three SuperHyperVertices in a connected neutrosophic SuperHyperGraph
It’s interesting to mention that the only non-obvious simple neutrosophic type-SuperHyperSet called the
amid those obvious[non-obvious] simple neutrosophic type-SuperHyperSets called the
is only and only
S in a connected neutrosophic SuperHyperGraph
with a illustrated SuperHyperModeling. It’s also, a neutrosophic free-triangle SuperHyperModel. But all only non-obvious simple neutrosophic type-SuperHyperSets of the neutrosophic SuperHyperMatching amid those obvious[non-obvious] simple neutrosophic type-SuperHyperSets, are
A connected neutrosophic SuperHyperGraph
as Linearly-over-packed SuperHyperModel is featured on the Figures.
Example 5. Assume the SuperHyperGraphs in the Figures (
1), (
2), (
3), (
4), (
5), (
6), (
7), (
8), (
9), (
10), (
11), (
12), (
13), (
14), (
15), (
16), (
17), (
18), (
19), and (
20).
-
On the Figure (
1), the neutrosophic SuperHyperNotion, namely, neutrosophic SuperHyperMatching, is up.
and
are some empty neutrosophic SuperHyperEdges but
is a loop neutrosophic SuperHyperEdge and
is a neutrosophic SuperHyperEdge. Thus in the terms of neutrosophic SuperHyperNeighbor, there’s only one neutrosophic SuperHyperEdge, namely,
The neutrosophic SuperHyperVertex,
is neutrosophic isolated means that there’s no neutrosophic SuperHyperEdge has it as a neutrosophic endpoint. Thus the neutrosophic SuperHyperVertex,
is excluded in every given neutrosophic SuperHyperMatching.
The following neutrosophic SuperHyperSet of neutrosophic SuperHyperEdges[SuperHyperVertices] is the simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching. The neutrosophic SuperHyperSet of neutrosophic SuperHyperEdges[SuperHyperVertices],
is the simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching. The neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices],
is an
neutrosophic SuperHyperMatching for an neutrosophic SuperHyperGraph
is a neutrosophic type-SuperHyperSet with
the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet
S of neutrosophic SuperHyperEdges[SuperHyperVertices] such that there’s no neutrosophic SuperHyperVertex of a neutrosophic SuperHyperEdge is common and there’s an neutrosophic SuperHyperEdge for all neutrosophic SuperHyperVertices. There are
not only
two neutrosophic SuperHyperVertices
inside the intended neutrosophic SuperHyperSet. Thus the non-obvious neutrosophic SuperHyperMatching is up. The obvious simple neutrosophic type-SuperHyperSet called the neutrosophic SuperHyperMatching is a neutrosophic SuperHyperSet
includes only
two neutrosophic SuperHyperVertices. But the neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices],
Doesn’t have less than three SuperHyperVertices
inside the intended neutrosophic SuperHyperSet. Thus the non-obvious simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching
is up. To sum them up, the neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices],
Is the non-obvious simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching. Since the neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices],
Is an neutrosophic SuperHyperMatching
for an neutrosophic SuperHyperGraph
is the neutrosophic SuperHyperSet
S of neutrosophic SuperHyperVertices such that there’s no a neutrosophic SuperHyperEdge for some neutrosophic SuperHyperVertices given by that neutrosophic type-SuperHyperSet called the neutrosophic SuperHyperMatching
and it’s an neutrosophic
SuperHyperMatching. Since it
’s the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet
S of neutrosophic SuperHyperEdges[SuperHyperVertices] such that there’s no neutrosophic SuperHyperVertex of a neutrosophic SuperHyperEdge is common and there’s an neutrosophic SuperHyperEdge for all neutrosophic SuperHyperVertices. There aren’t only less than three neutrosophic SuperHyperVertices
inside the intended neutrosophic SuperHyperSet,
Thus the non-obvious neutrosophic SuperHyperMatching,
Is up. The obvious simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching, not:
Is the neutrosophic SuperHyperSet, not:
Does includes only less than three SuperHyperVertices in a connected neutrosophic SuperHyperGraph
It’s interesting to mention that the only non-obvious simple neutrosophic type-SuperHyperSet called the
amid those obvious[non-obvious] simple neutrosophic type-SuperHyperSets called the
is only and only
On the Figure (
2), the SuperHyperNotion, namely, SuperHyperMatching, is up.
and
SuperHyperMatching 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 the neutrosophic SuperHyperVertex,
is excluded in every given neutrosophic SuperHyperMatching.
The following neutrosophic SuperHyperSet of neutrosophic SuperHyperEdges[SuperHyperVertices] is the simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching. The neutrosophic SuperHyperSet of neutrosophic SuperHyperEdges[SuperHyperVertices],
is the simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching. The neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices],
is an
neutrosophic SuperHyperMatching for an neutrosophic SuperHyperGraph
is a neutrosophic type-SuperHyperSet with
the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet
S of neutrosophic SuperHyperEdges[SuperHyperVertices] such that there’s no neutrosophic SuperHyperVertex of a neutrosophic SuperHyperEdge is common and there’s an neutrosophic SuperHyperEdge for all neutrosophic SuperHyperVertices. There are
not only
two neutrosophic SuperHyperVertices
inside the intended neutrosophic SuperHyperSet. Thus the non-obvious neutrosophic SuperHyperMatching is up. The obvious simple neutrosophic type-SuperHyperSet called the neutrosophic SuperHyperMatching is a neutrosophic SuperHyperSet
includes only
two neutrosophic SuperHyperVertices. But the neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices],
Doesn’t have less than three SuperHyperVertices
inside the intended neutrosophic SuperHyperSet. Thus the non-obvious simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching
is up. To sum them up, the neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices],
Is the non-obvious simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching. Since the neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices],
Is an neutrosophic SuperHyperMatching
for an neutrosophic SuperHyperGraph
is the neutrosophic SuperHyperSet
S of neutrosophic SuperHyperVertices such that there’s no a neutrosophic SuperHyperEdge for some neutrosophic SuperHyperVertices given by that neutrosophic type-SuperHyperSet called the neutrosophic SuperHyperMatching
and it’s an neutrosophic
SuperHyperMatching. Since it
’s the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet
S of neutrosophic SuperHyperEdges[SuperHyperVertices] such that there’s no neutrosophic SuperHyperVertex of a neutrosophic SuperHyperEdge is common and there’s an neutrosophic SuperHyperEdge for all neutrosophic SuperHyperVertices. There aren’t only less than three neutrosophic SuperHyperVertices
inside the intended neutrosophic SuperHyperSet,
Thus the non-obvious neutrosophic SuperHyperMatching,
Is up. The obvious simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching, not:
Is the neutrosophic SuperHyperSet, not:
Does includes only less than three SuperHyperVertices in a connected neutrosophic SuperHyperGraph
It’s interesting to mention that the only non-obvious simple neutrosophic type-SuperHyperSet called the
amid those obvious[non-obvious] simple neutrosophic type-SuperHyperSets called the
is only and only
On the Figure (
3), the SuperHyperNotion, namely, SuperHyperMatching, is up.
and
are some empty SuperHyperEdges but
is a SuperHyperEdge. Thus in the terms of SuperHyperNeighbor, there’s only one SuperHyperEdge, namely,
The following neutrosophic SuperHyperSet of neutrosophic SuperHyperEdges[SuperHyperVertices] is the simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching. The neutrosophic SuperHyperSet of neutrosophic SuperHyperEdges[SuperHyperVertices],
is the simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching. The neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices],
is an
neutrosophic SuperHyperMatching for an neutrosophic SuperHyperGraph
is a neutrosophic type-SuperHyperSet with
the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet
S of neutrosophic SuperHyperEdges[SuperHyperVertices] such that there’s no neutrosophic SuperHyperVertex of a neutrosophic SuperHyperEdge is common and there’s an neutrosophic SuperHyperEdge for all neutrosophic SuperHyperVertices. There are
not only
two neutrosophic SuperHyperVertices
inside the intended neutrosophic SuperHyperSet. Thus the non-obvious neutrosophic SuperHyperMatching is up. The obvious simple neutrosophic type-SuperHyperSet called the neutrosophic SuperHyperMatching is a neutrosophic SuperHyperSet
includes only
two neutrosophic SuperHyperVertices. But the neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices],
Doesn’t have less than three SuperHyperVertices
inside the intended neutrosophic SuperHyperSet. Thus the non-obvious simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching
is up. To sum them up, the neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices],
Is the non-obvious simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching. Since the neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices],
Is an neutrosophic SuperHyperMatching
for an neutrosophic SuperHyperGraph
is the neutrosophic SuperHyperSet
S of neutrosophic SuperHyperVertices such that there’s no a neutrosophic SuperHyperEdge for some neutrosophic SuperHyperVertices given by that neutrosophic type-SuperHyperSet called the neutrosophic SuperHyperMatching
and it’s an neutrosophic
SuperHyperMatching. Since it
’s the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet
S of neutrosophic SuperHyperEdges[SuperHyperVertices] such that there’s no neutrosophic SuperHyperVertex of a neutrosophic SuperHyperEdge is common and there’s an neutrosophic SuperHyperEdge for all neutrosophic SuperHyperVertices. There aren’t only less than three neutrosophic SuperHyperVertices
inside the intended neutrosophic SuperHyperSet,
Thus the non-obvious neutrosophic SuperHyperMatching,
Is up. The obvious simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching, not:
Is the neutrosophic SuperHyperSet, not:
Does includes only less than three SuperHyperVertices in a connected neutrosophic SuperHyperGraph
It’s interesting to mention that the only non-obvious simple neutrosophic type-SuperHyperSet called the
amid those obvious[non-obvious] simple neutrosophic type-SuperHyperSets called the
is only and only
On the Figure (
4), the SuperHyperNotion, namely, a SuperHyperMatching, 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 following neutrosophic SuperHyperSet of neutrosophic SuperHyperEdges[SuperHyperVertices] is the simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching. The neutrosophic SuperHyperSet of neutrosophic SuperHyperEdges[SuperHyperVertices],
is the simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching. The neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices],
is an
neutrosophic SuperHyperMatching for an neutrosophic SuperHyperGraph
is a neutrosophic type-SuperHyperSet with
the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet
S of neutrosophic SuperHyperEdges[SuperHyperVertices] such that there’s no neutrosophic SuperHyperVertex of a neutrosophic SuperHyperEdge is common and there’s an neutrosophic SuperHyperEdge for all neutrosophic SuperHyperVertices. There are
not only
two neutrosophic SuperHyperVertices
inside the intended neutrosophic SuperHyperSet. Thus the non-obvious neutrosophic SuperHyperMatching is up. The obvious simple neutrosophic type-SuperHyperSet called the neutrosophic SuperHyperMatching is a neutrosophic SuperHyperSet
includes only
two neutrosophic SuperHyperVertices. But the neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices],
Doesn’t have less than three SuperHyperVertices
inside the intended neutrosophic SuperHyperSet. Thus the non-obvious simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching
is up. To sum them up, the neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices],
Is the non-obvious simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching. Since the neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices],
Is an neutrosophic SuperHyperMatching
for an neutrosophic SuperHyperGraph
is the neutrosophic SuperHyperSet
S of neutrosophic SuperHyperVertices such that there’s no a neutrosophic SuperHyperEdge for some neutrosophic SuperHyperVertices given by that neutrosophic type-SuperHyperSet called the neutrosophic SuperHyperMatching
and it’s an neutrosophic
SuperHyperMatching. Since it
’s the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet
S of neutrosophic SuperHyperEdges[SuperHyperVertices] such that there’s no neutrosophic SuperHyperVertex of a neutrosophic SuperHyperEdge is common and there’s an neutrosophic SuperHyperEdge for all neutrosophic SuperHyperVertices. There aren’t only less than three neutrosophic SuperHyperVertices
inside the intended neutrosophic SuperHyperSet,
Thus the non-obvious neutrosophic SuperHyperMatching,
Is up. The obvious simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching, not:
Is the neutrosophic SuperHyperSet, not:
Does includes only less than three SuperHyperVertices in a connected neutrosophic SuperHyperGraph
It’s interesting to mention that the only non-obvious simple neutrosophic type-SuperHyperSet called the
amid those obvious[non-obvious] simple neutrosophic type-SuperHyperSets called the
is only and only
On the Figure (
5), the SuperHyperNotion, namely, SuperHyperMatching, is up. There’s neither empty SuperHyperEdge nor loop SuperHyperEdge. The following neutrosophic SuperHyperSet of neutrosophic SuperHyperVertices is the simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching.
The following neutrosophic SuperHyperSet of neutrosophic SuperHyperEdges[SuperHyperVertices] is the simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching. The neutrosophic SuperHyperSet of neutrosophic SuperHyperEdges[SuperHyperVertices],
is the simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching. The neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices],
is an
neutrosophic SuperHyperMatching for an neutrosophic SuperHyperGraph
is a neutrosophic type-SuperHyperSet with
the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet
S of neutrosophic SuperHyperEdges[SuperHyperVertices] such that there’s no neutrosophic SuperHyperVertex of a neutrosophic SuperHyperEdge is common and there’s an neutrosophic SuperHyperEdge for all neutrosophic SuperHyperVertices. There are
are only
same neutrosophic SuperHyperVertices
inside the intended neutrosophic SuperHyperSet. Thus the non-obvious neutrosophic SuperHyperMatching is up. The obvious simple neutrosophic type-SuperHyperSet called the neutrosophic SuperHyperMatching is a neutrosophic SuperHyperSet
includes only
same neutrosophic SuperHyperVertices. But the neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices],
Doesn’t have less than same SuperHyperVertices
inside the intended neutrosophic SuperHyperSet. Thus the obvious simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching
is up. To sum them up, the neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices],
Is the obvious simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching. Since the neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices],
Is an neutrosophic SuperHyperMatching
for an neutrosophic SuperHyperGraph
is the neutrosophic SuperHyperSet
S of neutrosophic SuperHyperVertices such that there’s no a neutrosophic SuperHyperEdge for some neutrosophic SuperHyperVertices given by that neutrosophic type-SuperHyperSet called the neutrosophic SuperHyperMatching
and it’s an neutrosophic
SuperHyperMatching. Since it
’s the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet
S of neutrosophic SuperHyperEdges[SuperHyperVertices] such that there’s no neutrosophic SuperHyperVertex of a neutrosophic SuperHyperEdge is common and there’s an neutrosophic SuperHyperEdge for all neutrosophic SuperHyperVertices. There are only less than same neutrosophic SuperHyperVertices
inside the intended neutrosophic SuperHyperSet,
Thus the obvious neutrosophic SuperHyperMatching,
Is up. The obvious simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching, is:
Is the neutrosophic SuperHyperSet, is:
Does includes only less than three SuperHyperVertices in a connected neutrosophic SuperHyperGraph
It’s interesting to mention that the only obvious simple neutrosophic type-SuperHyperSet called the
amid those obvious[non-obvious] simple neutrosophic type-SuperHyperSets called the
is only and only
In a connected neutrosophic SuperHyperGraph
is mentioned as the SuperHyperModel
in the Figure (
5).
On the Figure (
6), the SuperHyperNotion, namely, SuperHyperMatching, is up. There’s neither empty SuperHyperEdge nor loop SuperHyperEdge.
The following neutrosophic SuperHyperSet of neutrosophic SuperHyperEdges[SuperHyperVertices] is the simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching. The neutrosophic SuperHyperSet of neutrosophic SuperHyperEdges[SuperHyperVertices],
is the simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching. The neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices],
Is an
neutrosophic SuperHyperMatching for an neutrosophic SuperHyperGraph
is a neutrosophic type-SuperHyperSet with
the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet
S of neutrosophic SuperHyperEdges[SuperHyperVertices] such that there’s no neutrosophic SuperHyperVertex of a neutrosophic SuperHyperEdge is common and there’s an neutrosophic SuperHyperEdge for all neutrosophic SuperHyperVertices. There are
not only
two neutrosophic SuperHyperVertices
inside the intended neutrosophic SuperHyperSet. Thus the non-obvious neutrosophic SuperHyperMatching is up. The obvious simple neutrosophic type-SuperHyperSet called the neutrosophic SuperHyperMatching is a neutrosophic SuperHyperSet
includes only
two neutrosophic SuperHyperVertices. But the neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices],
Doesn’t have less than three SuperHyperVertices
inside the intended neutrosophic SuperHyperSet. Thus the non-obvious simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching
is up. To sum them up, the neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices],
Is the non-obvious simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching. Since the neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices],
Is an neutrosophic SuperHyperMatching
for an neutrosophic SuperHyperGraph
is the neutrosophic SuperHyperSet
S of neutrosophic SuperHyperVertices such that there’s no a neutrosophic SuperHyperEdge for some neutrosophic SuperHyperVertices given by that neutrosophic type-SuperHyperSet called the neutrosophic SuperHyperMatching
and it’s an neutrosophic
SuperHyperMatching. Since it
’s the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet
S of neutrosophic SuperHyperEdges[SuperHyperVertices] such that there’s no neutrosophic SuperHyperVertex of a neutrosophic SuperHyperEdge is common and there’s an neutrosophic SuperHyperEdge for all neutrosophic SuperHyperVertices. There aren’t only less than three neutrosophic SuperHyperVertices
inside the intended neutrosophic SuperHyperSet,
Thus the non-obvious neutrosophic SuperHyperMatching,
Is up. The obvious simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching, not:
Is the neutrosophic SuperHyperSet, not:
Does includes only less than three SuperHyperVertices in a connected neutrosophic SuperHyperGraph
It’s interesting to mention that the only non-obvious simple neutrosophic type-SuperHyperSet called the
amid those obvious[non-obvious] simple neutrosophic type-SuperHyperSets called the
is only and only
On the Figure (
7), the SuperHyperNotion, namely, SuperHyperMatching, is up. The following neutrosophic SuperHyperSet of neutrosophic SuperHyperEdges[SuperHyperVertices] is the simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching. The neutrosophic SuperHyperSet of neutrosophic SuperHyperEdges[SuperHyperVertices],
is the simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching. The neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices],
Is an
neutrosophic SuperHyperMatching for an neutrosophic SuperHyperGraph
is a neutrosophic type-SuperHyperSet with
the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet
S of neutrosophic SuperHyperEdges[SuperHyperVertices] such that there’s no neutrosophic SuperHyperVertex of a neutrosophic SuperHyperEdge is common and there’s an neutrosophic SuperHyperEdge for all neutrosophic SuperHyperVertices. There are
not only
two neutrosophic SuperHyperVertices
inside the intended neutrosophic SuperHyperSet. Thus the non-obvious neutrosophic SuperHyperMatching is up. The obvious simple neutrosophic type-SuperHyperSet called the neutrosophic SuperHyperMatching is a neutrosophic SuperHyperSet
includes only
two neutrosophic SuperHyperVertices. But the neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices],
Doesn’t have less than three SuperHyperVertices
inside the intended neutrosophic SuperHyperSet. Thus the non-obvious simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching
is up. To sum them up, the neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices],
Is the non-obvious simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching. Since the neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices],
Is an neutrosophic SuperHyperMatching
for an neutrosophic SuperHyperGraph
is the neutrosophic SuperHyperSet
S of neutrosophic SuperHyperVertices such that there’s no a neutrosophic SuperHyperEdge for some neutrosophic SuperHyperVertices given by that neutrosophic type-SuperHyperSet called the neutrosophic SuperHyperMatching
and it’s an neutrosophic
SuperHyperMatching. Since it
’s the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet
S of neutrosophic SuperHyperEdges[SuperHyperVertices] such that there’s no neutrosophic SuperHyperVertex of a neutrosophic SuperHyperEdge is common and there’s an neutrosophic SuperHyperEdge for all neutrosophic SuperHyperVertices. There aren’t only less than three neutrosophic SuperHyperVertices
inside the intended neutrosophic SuperHyperSet,
Thus the non-obvious neutrosophic SuperHyperMatching,
Is up. The obvious simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching, not:
Is the neutrosophic SuperHyperSet, not:
Does includes only less than three SuperHyperVertices in a connected neutrosophic SuperHyperGraph
It’s interesting to mention that the only non-obvious simple neutrosophic type-SuperHyperSet called the
amid those obvious[non-obvious] simple neutrosophic type-SuperHyperSets called the
is only and only
On the Figure (
8), the SuperHyperNotion, namely, SuperHyperMatching, is up. There’s neither empty SuperHyperEdge nor loop SuperHyperEdge. The following neutrosophic SuperHyperSet of neutrosophic SuperHyperEdges[SuperHyperVertices] is the simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching. The neutrosophic SuperHyperSet of neutrosophic SuperHyperEdges[SuperHyperVertices],
is the simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching. The neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices],
Is an
neutrosophic SuperHyperMatching for an neutrosophic SuperHyperGraph
is a neutrosophic type-SuperHyperSet with
the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet
S of neutrosophic SuperHyperEdges[SuperHyperVertices] such that there’s no neutrosophic SuperHyperVertex of a neutrosophic SuperHyperEdge is common and there’s an neutrosophic SuperHyperEdge for all neutrosophic SuperHyperVertices. There are
not only
two neutrosophic SuperHyperVertices
inside the intended neutrosophic SuperHyperSet. Thus the non-obvious neutrosophic SuperHyperMatching is up. The obvious simple neutrosophic type-SuperHyperSet called the neutrosophic SuperHyperMatching is a neutrosophic SuperHyperSet
includes only
two neutrosophic SuperHyperVertices. But the neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices],
Doesn’t have less than three SuperHyperVertices
inside the intended neutrosophic SuperHyperSet. Thus the non-obvious simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching
is up. To sum them up, the neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices],
Is the non-obvious simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching. Since the neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices],
Is an neutrosophic SuperHyperMatching
for an neutrosophic SuperHyperGraph
is the neutrosophic SuperHyperSet
S of neutrosophic SuperHyperVertices such that there’s no a neutrosophic SuperHyperEdge for some neutrosophic SuperHyperVertices given by that neutrosophic type-SuperHyperSet called the neutrosophic SuperHyperMatching
and it’s an neutrosophic
SuperHyperMatching. Since it
’s the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet
S of neutrosophic SuperHyperEdges[SuperHyperVertices] such that there’s no neutrosophic SuperHyperVertex of a neutrosophic SuperHyperEdge is common and there’s an neutrosophic SuperHyperEdge for all neutrosophic SuperHyperVertices. There aren’t only less than three neutrosophic SuperHyperVertices
inside the intended neutrosophic SuperHyperSet,
Thus the non-obvious neutrosophic SuperHyperMatching,
Is up. The obvious simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching, not:
Is the neutrosophic SuperHyperSet, not:
Does includes only less than three SuperHyperVertices in a connected neutrosophic SuperHyperGraph
It’s interesting to mention that the only non-obvious simple neutrosophic type-SuperHyperSet called the
amid those obvious[non-obvious] simple neutrosophic type-SuperHyperSets called the
is only and only
In a connected neutrosophic SuperHyperGraph
of dense SuperHyperModel as the Figure (
8).
On the Figure (
9), the SuperHyperNotion, namely, SuperHyperMatching, is up. There’s neither empty SuperHyperEdge nor loop SuperHyperEdge. The following neutrosophic SuperHyperSet of neutrosophic SuperHyperVertices is the simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching.
The following neutrosophic SuperHyperSet of neutrosophic SuperHyperEdges[SuperHyperVertices] is the simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching. The neutrosophic SuperHyperSet of neutrosophic SuperHyperEdges[SuperHyperVertices],
is the simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching. The neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices],
Is an
neutrosophic SuperHyperMatching for an neutrosophic SuperHyperGraph
is a neutrosophic type-SuperHyperSet with
the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet
S of neutrosophic SuperHyperEdges[SuperHyperVertices] such that there’s no neutrosophic SuperHyperVertex of a neutrosophic SuperHyperEdge is common and there’s an neutrosophic SuperHyperEdge for all neutrosophic SuperHyperVertices. There are
not only
two neutrosophic SuperHyperVertices
inside the intended neutrosophic SuperHyperSet. Thus the non-obvious neutrosophic SuperHyperMatching is up. The obvious simple neutrosophic type-SuperHyperSet called the neutrosophic SuperHyperMatching is a neutrosophic SuperHyperSet
includes only
two neutrosophic SuperHyperVertices. But the neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices],
Doesn’t have less than three SuperHyperVertices
inside the intended neutrosophic SuperHyperSet. Thus the non-obvious simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching
is up. To sum them up, the neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices],
Is the non-obvious simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching. Since the neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices],
Is an neutrosophic SuperHyperMatching
for an neutrosophic SuperHyperGraph
is the neutrosophic SuperHyperSet
S of neutrosophic SuperHyperVertices such that there’s no a neutrosophic SuperHyperEdge for some neutrosophic SuperHyperVertices given by that neutrosophic type-SuperHyperSet called the neutrosophic SuperHyperMatching
and it’s an neutrosophic
SuperHyperMatching. Since it
’s the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet
S of neutrosophic SuperHyperEdges[SuperHyperVertices] such that there’s no neutrosophic SuperHyperVertex of a neutrosophic SuperHyperEdge is common and there’s an neutrosophic SuperHyperEdge for all neutrosophic SuperHyperVertices. There aren’t only less than three neutrosophic SuperHyperVertices
inside the intended neutrosophic SuperHyperSet,
Thus the non-obvious neutrosophic SuperHyperMatching,
Is up. The obvious simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching, not:
Is the neutrosophic SuperHyperSet, not:
Does includes only less than three SuperHyperVertices in a connected neutrosophic SuperHyperGraph
It’s interesting to mention that the only non-obvious simple neutrosophic type-SuperHyperSet called the
amid those obvious[non-obvious] simple neutrosophic type-SuperHyperSets called the
is only and only
In a connected neutrosophic SuperHyperGraph
of highly-embedding-connected SuperHyperModel as the Figure (
9).
On the Figure (
10), the SuperHyperNotion, namely, SuperHyperMatching, is up. There’s neither empty SuperHyperEdge nor loop SuperHyperEdge. The following neutrosophic SuperHyperSet of neutrosophic SuperHyperEdges[SuperHyperVertices] is the simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching. The neutrosophic SuperHyperSet of neutrosophic SuperHyperEdges[SuperHyperVertices],
is the simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching. The neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices],
Is an
neutrosophic SuperHyperMatching for an neutrosophic SuperHyperGraph
is a neutrosophic type-SuperHyperSet with
the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet
S of neutrosophic SuperHyperEdges[SuperHyperVertices] such that there’s no neutrosophic SuperHyperVertex of a neutrosophic SuperHyperEdge is common and there’s an neutrosophic SuperHyperEdge for all neutrosophic SuperHyperVertices. There are
not only
two neutrosophic SuperHyperVertices
inside the intended neutrosophic SuperHyperSet. Thus the non-obvious neutrosophic SuperHyperMatching is up. The obvious simple neutrosophic type-SuperHyperSet called the neutrosophic SuperHyperMatching is a neutrosophic SuperHyperSet
includes only
two neutrosophic SuperHyperVertices. But the neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices],
Doesn’t have less than three SuperHyperVertices
inside the intended neutrosophic SuperHyperSet. Thus the non-obvious simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching
is up. To sum them up, the neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices],
Is the non-obvious simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching. Since the neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices],
Is an neutrosophic SuperHyperMatching
for an neutrosophic SuperHyperGraph
is the neutrosophic SuperHyperSet
S of neutrosophic SuperHyperVertices such that there’s no a neutrosophic SuperHyperEdge for some neutrosophic SuperHyperVertices given by that neutrosophic type-SuperHyperSet called the neutrosophic SuperHyperMatching
and it’s an neutrosophic
SuperHyperMatching. Since it
’s the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet
S of neutrosophic SuperHyperEdges[SuperHyperVertices] such that there’s no neutrosophic SuperHyperVertex of a neutrosophic SuperHyperEdge is common and there’s an neutrosophic SuperHyperEdge for all neutrosophic SuperHyperVertices. There aren’t only less than three neutrosophic SuperHyperVertices
inside the intended neutrosophic SuperHyperSet,
Thus the non-obvious neutrosophic SuperHyperMatching,
Is up. The obvious simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching, not:
Is the neutrosophic SuperHyperSet, not:
Does includes only less than three SuperHyperVertices in a connected neutrosophic SuperHyperGraph
It’s interesting to mention that the only non-obvious simple neutrosophic type-SuperHyperSet called the
amid those obvious[non-obvious] simple neutrosophic type-SuperHyperSets called the
is only and only
In a connected neutrosophic SuperHyperGraph
of dense SuperHyperModel as the Figure (
10).
On the Figure (
11), the SuperHyperNotion, namely, SuperHyperMatching, is up. There’s neither empty SuperHyperEdge nor loop SuperHyperEdge. The following neutrosophic SuperHyperSet of neutrosophic SuperHyperEdges[SuperHyperVertices] is the simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching. The neutrosophic SuperHyperSet of neutrosophic SuperHyperEdges[SuperHyperVertices],
is the simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching. The neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices],
Is an
neutrosophic SuperHyperMatching for an neutrosophic SuperHyperGraph
is a neutrosophic type-SuperHyperSet with
the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet
S of neutrosophic SuperHyperEdges[SuperHyperVertices] such that there’s no neutrosophic SuperHyperVertex of a neutrosophic SuperHyperEdge is common and there’s an neutrosophic SuperHyperEdge for all neutrosophic SuperHyperVertices. There are
not only
two neutrosophic SuperHyperVertices
inside the intended neutrosophic SuperHyperSet. Thus the non-obvious neutrosophic SuperHyperMatching is up. The obvious simple neutrosophic type-SuperHyperSet called the neutrosophic SuperHyperMatching is a neutrosophic SuperHyperSet
includes only
two neutrosophic SuperHyperVertices. But the neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices],
Doesn’t have less than three SuperHyperVertices
inside the intended neutrosophic SuperHyperSet. Thus the non-obvious simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching
is up. To sum them up, the neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices],
Is the non-obvious simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching. Since the neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices],
Is an neutrosophic SuperHyperMatching
for an neutrosophic SuperHyperGraph
is the neutrosophic SuperHyperSet
S of neutrosophic SuperHyperVertices such that there’s no a neutrosophic SuperHyperEdge for some neutrosophic SuperHyperVertices given by that neutrosophic type-SuperHyperSet called the neutrosophic SuperHyperMatching
and it’s an neutrosophic
SuperHyperMatching. Since it
’s the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet
S of neutrosophic SuperHyperEdges[SuperHyperVertices] such that there’s no neutrosophic SuperHyperVertex of a neutrosophic SuperHyperEdge is common and there’s an neutrosophic SuperHyperEdge for all neutrosophic SuperHyperVertices. There aren’t only less than three neutrosophic SuperHyperVertices
inside the intended neutrosophic SuperHyperSet,
Thus the non-obvious neutrosophic SuperHyperMatching,
Is up. The obvious simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching, not:
Is the neutrosophic SuperHyperSet, not:
Does includes only less than three SuperHyperVertices in a connected neutrosophic SuperHyperGraph
It’s interesting to mention that the only non-obvious simple neutrosophic type-SuperHyperSet called the
amid those obvious[non-obvious] simple neutrosophic type-SuperHyperSets called the
is only and only
In a connected neutrosophic SuperHyperGraph
On the Figure (
12), the SuperHyperNotion, namely, SuperHyperMatching, is up. There’s neither empty SuperHyperEdge nor loop SuperHyperEdge. The following neutrosophic SuperHyperSet of neutrosophic SuperHyperEdges[SuperHyperVertices] is the simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching. The neutrosophic SuperHyperSet of neutrosophic SuperHyperEdges[SuperHyperVertices],
is the simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching. The neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices],
Is an
neutrosophic SuperHyperMatching for an neutrosophic SuperHyperGraph
is a neutrosophic type-SuperHyperSet with
the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet
S of neutrosophic SuperHyperEdges[SuperHyperVertices] such that there’s no neutrosophic SuperHyperVertex of a neutrosophic SuperHyperEdge is common and there’s an neutrosophic SuperHyperEdge for all neutrosophic SuperHyperVertices. There are
not only
two neutrosophic SuperHyperVertices
inside the intended neutrosophic SuperHyperSet. Thus the non-obvious neutrosophic SuperHyperMatching is up. The obvious simple neutrosophic type-SuperHyperSet called the neutrosophic SuperHyperMatching is a neutrosophic SuperHyperSet
includes only
two neutrosophic SuperHyperVertices. But the neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices],
Doesn’t have less than three SuperHyperVertices
inside the intended neutrosophic SuperHyperSet. Thus the non-obvious simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching
is up. To sum them up, the neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices],
Is the non-obvious simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching. Since the neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices],
Is an neutrosophic SuperHyperMatching
for an neutrosophic SuperHyperGraph
is the neutrosophic SuperHyperSet
S of neutrosophic SuperHyperVertices such that there’s no a neutrosophic SuperHyperEdge for some neutrosophic SuperHyperVertices given by that neutrosophic type-SuperHyperSet called the neutrosophic SuperHyperMatching
and it’s an neutrosophic
SuperHyperMatching. Since it
’s the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet
S of neutrosophic SuperHyperEdges[SuperHyperVertices] such that there’s no neutrosophic SuperHyperVertex of a neutrosophic SuperHyperEdge is common and there’s an neutrosophic SuperHyperEdge for all neutrosophic SuperHyperVertices. There aren’t only less than three neutrosophic SuperHyperVertices
inside the intended neutrosophic SuperHyperSet,
Thus the non-obvious neutrosophic SuperHyperMatching,
Is up. The obvious simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching, not:
Is the neutrosophic SuperHyperSet, not:
Does includes only less than three SuperHyperVertices in a connected neutrosophic SuperHyperGraph
It’s interesting to mention that the only non-obvious simple neutrosophic type-SuperHyperSet called the
amid those obvious[non-obvious] simple neutrosophic type-SuperHyperSets called the
is only and only
In a connected neutrosophic SuperHyperGraph
On the Figure (
13), the SuperHyperNotion, namely, SuperHyperMatching, is up. There’s neither empty SuperHyperEdge nor loop SuperHyperEdge. The following neutrosophic SuperHyperSet of neutrosophic SuperHyperEdges[SuperHyperVertices] is the simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching. The neutrosophic SuperHyperSet of neutrosophic SuperHyperEdges[SuperHyperVertices],
is the simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching. The neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices],
Is an
neutrosophic SuperHyperMatching for an neutrosophic SuperHyperGraph
is a neutrosophic type-SuperHyperSet with
the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet
S of neutrosophic SuperHyperEdges[SuperHyperVertices] such that there’s no neutrosophic SuperHyperVertex of a neutrosophic SuperHyperEdge is common and there’s an neutrosophic SuperHyperEdge for all neutrosophic SuperHyperVertices. There are
not only
two neutrosophic SuperHyperVertices
inside the intended neutrosophic SuperHyperSet. Thus the non-obvious neutrosophic SuperHyperMatching is up. The obvious simple neutrosophic type-SuperHyperSet called the neutrosophic SuperHyperMatching is a neutrosophic SuperHyperSet
includes only
two neutrosophic SuperHyperVertices. But the neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices],
Doesn’t have less than three SuperHyperVertices
inside the intended neutrosophic SuperHyperSet. Thus the non-obvious simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching
is up. To sum them up, the neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices],
Is the non-obvious simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching. Since the neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices],
Is an neutrosophic SuperHyperMatching
for an neutrosophic SuperHyperGraph
is the neutrosophic SuperHyperSet
S of neutrosophic SuperHyperVertices such that there’s no a neutrosophic SuperHyperEdge for some neutrosophic SuperHyperVertices given by that neutrosophic type-SuperHyperSet called the neutrosophic SuperHyperMatching
and it’s an neutrosophic
SuperHyperMatching. Since it
’s the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet
S of neutrosophic SuperHyperEdges[SuperHyperVertices] such that there’s no neutrosophic SuperHyperVertex of a neutrosophic SuperHyperEdge is common and there’s an neutrosophic SuperHyperEdge for all neutrosophic SuperHyperVertices. There aren’t only less than three neutrosophic SuperHyperVertices
inside the intended neutrosophic SuperHyperSet,
Thus the non-obvious neutrosophic SuperHyperMatching,
Is up. The obvious simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching, not:
Is the neutrosophic SuperHyperSet, not:
Does includes only less than three SuperHyperVertices in a connected neutrosophic SuperHyperGraph
It’s interesting to mention that the only non-obvious simple neutrosophic type-SuperHyperSet called the
amid those obvious[non-obvious] simple neutrosophic type-SuperHyperSets called the
is only and only
In a connected neutrosophic SuperHyperGraph
On the Figure (
14), the SuperHyperNotion, namely, SuperHyperMatching, is up. There’s neither empty SuperHyperEdge nor loop SuperHyperEdge. The following neutrosophic SuperHyperSet of neutrosophic SuperHyperEdges[SuperHyperVertices] is the simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching. The neutrosophic SuperHyperSet of neutrosophic SuperHyperEdges[SuperHyperVertices],
is the simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching. The neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices],
Is an
neutrosophic SuperHyperMatching for an neutrosophic SuperHyperGraph
is a neutrosophic type-SuperHyperSet with
the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet
S of neutrosophic SuperHyperEdges[SuperHyperVertices] such that there’s no neutrosophic SuperHyperVertex of a neutrosophic SuperHyperEdge is common and there’s an neutrosophic SuperHyperEdge for all neutrosophic SuperHyperVertices. There are
not only
two neutrosophic SuperHyperVertices
inside the intended neutrosophic SuperHyperSet. Thus the non-obvious neutrosophic SuperHyperMatching is up. The obvious simple neutrosophic type-SuperHyperSet called the neutrosophic SuperHyperMatching is a neutrosophic SuperHyperSet
includes only
two neutrosophic SuperHyperVertices. But the neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices],
Doesn’t have less than three SuperHyperVertices
inside the intended neutrosophic SuperHyperSet. Thus the non-obvious simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching
is up. To sum them up, the neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices],
Is the non-obvious simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching. Since the neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices],
Is an neutrosophic SuperHyperMatching
for an neutrosophic SuperHyperGraph
is the neutrosophic SuperHyperSet
S of neutrosophic SuperHyperVertices such that there’s no a neutrosophic SuperHyperEdge for some neutrosophic SuperHyperVertices given by that neutrosophic type-SuperHyperSet called the neutrosophic SuperHyperMatching
and it’s an neutrosophic
SuperHyperMatching. Since it
’s the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet
S of neutrosophic SuperHyperEdges[SuperHyperVertices] such that there’s no neutrosophic SuperHyperVertex of a neutrosophic SuperHyperEdge is common and there’s an neutrosophic SuperHyperEdge for all neutrosophic SuperHyperVertices. There aren’t only less than three neutrosophic SuperHyperVertices
inside the intended neutrosophic SuperHyperSet,
Thus the non-obvious neutrosophic SuperHyperMatching,
Is up. The obvious simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching, not:
Is the neutrosophic SuperHyperSet, not:
Does includes only less than three SuperHyperVertices in a connected neutrosophic SuperHyperGraph
It’s interesting to mention that the only non-obvious simple neutrosophic type-SuperHyperSet called the
amid those obvious[non-obvious] simple neutrosophic type-SuperHyperSets called the
is only and only
In a connected neutrosophic SuperHyperGraph
It’s noted that this neutrosophic SuperHyperGraph
is an neutrosophic graph
thus the notions in both settings are coincided.
On the Figure (
15), the SuperHyperNotion, namely, SuperHyperMatching, is up. There’s neither empty SuperHyperEdge nor loop SuperHyperEdge. The following neutrosophic SuperHyperSet of neutrosophic SuperHyperEdges[SuperHyperVertices] is the simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching. The neutrosophic SuperHyperSet of neutrosophic SuperHyperEdges[SuperHyperVertices],
is the simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching. The neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices],
Is an
neutrosophic SuperHyperMatching for an neutrosophic SuperHyperGraph
is a neutrosophic type-SuperHyperSet with
the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet
S of neutrosophic SuperHyperEdges[SuperHyperVertices] such that there’s no neutrosophic SuperHyperVertex of a neutrosophic SuperHyperEdge is common and there’s an neutrosophic SuperHyperEdge for all neutrosophic SuperHyperVertices. There are
not only
two neutrosophic SuperHyperVertices
inside the intended neutrosophic SuperHyperSet. Thus the non-obvious neutrosophic SuperHyperMatching is up. The obvious simple neutrosophic type-SuperHyperSet called the neutrosophic SuperHyperMatching is a neutrosophic SuperHyperSet
includes only
two neutrosophic SuperHyperVertices. But the neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices],
Doesn’t have less than three SuperHyperVertices
inside the intended neutrosophic SuperHyperSet. Thus the non-obvious simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching
is up. To sum them up, the neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices],
Is the non-obvious simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching. Since the neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices],
Is an neutrosophic SuperHyperMatching
for an neutrosophic SuperHyperGraph
is the neutrosophic SuperHyperSet
S of neutrosophic SuperHyperVertices such that there’s no a neutrosophic SuperHyperEdge for some neutrosophic SuperHyperVertices given by that neutrosophic type-SuperHyperSet called the neutrosophic SuperHyperMatching
and it’s an neutrosophic
SuperHyperMatching. Since it
’s the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet
S of neutrosophic SuperHyperEdges[SuperHyperVertices] such that there’s no neutrosophic SuperHyperVertex of a neutrosophic SuperHyperEdge is common and there’s an neutrosophic SuperHyperEdge for all neutrosophic SuperHyperVertices. There aren’t only less than three neutrosophic SuperHyperVertices
inside the intended neutrosophic SuperHyperSet,
Thus the non-obvious neutrosophic SuperHyperMatching,
Is up. The obvious simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching, not:
Is the neutrosophic SuperHyperSet, not:
Does includes only less than three SuperHyperVertices in a connected neutrosophic SuperHyperGraph
It’s interesting to mention that the only non-obvious simple neutrosophic type-SuperHyperSet called the
amid those obvious[non-obvious] simple neutrosophic type-SuperHyperSets called the
is only and only
In a connected neutrosophic SuperHyperGraph
as Linearly-Connected SuperHyperModel On the Figure (
15).
On the Figure (
16), the SuperHyperNotion, namely, SuperHyperMatching, is up. There’s neither empty SuperHyperEdge nor loop SuperHyperEdge. The following neutrosophic SuperHyperSet of neutrosophic SuperHyperEdges[SuperHyperVertices] is the simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching. The neutrosophic SuperHyperSet of neutrosophic SuperHyperEdges[SuperHyperVertices],
is the simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching. The neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices],
Is an
neutrosophic SuperHyperMatching for an neutrosophic SuperHyperGraph
is a neutrosophic type-SuperHyperSet with
the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet
S of neutrosophic SuperHyperEdges[SuperHyperVertices] such that there’s no neutrosophic SuperHyperVertex of a neutrosophic SuperHyperEdge is common and there’s an neutrosophic SuperHyperEdge for all neutrosophic SuperHyperVertices. There are
not only
two neutrosophic SuperHyperVertices
inside the intended neutrosophic SuperHyperSet. Thus the non-obvious neutrosophic SuperHyperMatching is up. The obvious simple neutrosophic type-SuperHyperSet called the neutrosophic SuperHyperMatching is a neutrosophic SuperHyperSet
includes only
two neutrosophic SuperHyperVertices. But the neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices],
Doesn’t have less than three SuperHyperVertices
inside the intended neutrosophic SuperHyperSet. Thus the non-obvious simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching
is up. To sum them up, the neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices],
Is the non-obvious simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching. Since the neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices],
Is an neutrosophic SuperHyperMatching
for an neutrosophic SuperHyperGraph
is the neutrosophic SuperHyperSet
S of neutrosophic SuperHyperVertices such that there’s no a neutrosophic SuperHyperEdge for some neutrosophic SuperHyperVertices given by that neutrosophic type-SuperHyperSet called the neutrosophic SuperHyperMatching
and it’s an neutrosophic
SuperHyperMatching. Since it
’s the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet
S of neutrosophic SuperHyperEdges[SuperHyperVertices] such that there’s no neutrosophic SuperHyperVertex of a neutrosophic SuperHyperEdge is common and there’s an neutrosophic SuperHyperEdge for all neutrosophic SuperHyperVertices. There aren’t only less than three neutrosophic SuperHyperVertices
inside the intended neutrosophic SuperHyperSet,
Thus the non-obvious neutrosophic SuperHyperMatching,
Is up. The obvious simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching, not:
Is the neutrosophic SuperHyperSet, not:
Does includes only less than three SuperHyperVertices in a connected neutrosophic SuperHyperGraph
It’s interesting to mention that the only non-obvious simple neutrosophic type-SuperHyperSet called the
amid those obvious[non-obvious] simple neutrosophic type-SuperHyperSets called the
is only and only
In a connected neutrosophic SuperHyperGraph
On the Figure (
17), the SuperHyperNotion, namely, SuperHyperMatching, is up. There’s neither empty SuperHyperEdge nor loop SuperHyperEdge. The following neutrosophic SuperHyperSet of neutrosophic SuperHyperEdges[SuperHyperVertices] is the simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching. The neutrosophic SuperHyperSet of neutrosophic SuperHyperEdges[SuperHyperVertices],
is the simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching. The neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices],
Is an
neutrosophic SuperHyperMatching for an neutrosophic SuperHyperGraph
is a neutrosophic type-SuperHyperSet with
the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet
S of neutrosophic SuperHyperEdges[SuperHyperVertices] such that there’s no neutrosophic SuperHyperVertex of a neutrosophic SuperHyperEdge is common and there’s an neutrosophic SuperHyperEdge for all neutrosophic SuperHyperVertices. There are
not only
two neutrosophic SuperHyperVertices
inside the intended neutrosophic SuperHyperSet. Thus the non-obvious neutrosophic SuperHyperMatching is up. The obvious simple neutrosophic type-SuperHyperSet called the neutrosophic SuperHyperMatching is a neutrosophic SuperHyperSet
includes only
two neutrosophic SuperHyperVertices. But the neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices],
Doesn’t have less than three SuperHyperVertices
inside the intended neutrosophic SuperHyperSet. Thus the non-obvious simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching
is up. To sum them up, the neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices],
Is the non-obvious simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching. Since the neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices],
Is an neutrosophic SuperHyperMatching
for an neutrosophic SuperHyperGraph
is the neutrosophic SuperHyperSet
S of neutrosophic SuperHyperVertices such that there’s no a neutrosophic SuperHyperEdge for some neutrosophic SuperHyperVertices given by that neutrosophic type-SuperHyperSet called the neutrosophic SuperHyperMatching
and it’s an neutrosophic
SuperHyperMatching. Since it
’s the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet
S of neutrosophic SuperHyperEdges[SuperHyperVertices] such that there’s no neutrosophic SuperHyperVertex of a neutrosophic SuperHyperEdge is common and there’s an neutrosophic SuperHyperEdge for all neutrosophic SuperHyperVertices. There aren’t only less than three neutrosophic SuperHyperVertices
inside the intended neutrosophic SuperHyperSet,
Thus the non-obvious neutrosophic SuperHyperMatching,
Is up. The obvious simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching, not:
Is the neutrosophic SuperHyperSet, not:
Does includes only less than three SuperHyperVertices in a connected neutrosophic SuperHyperGraph
It’s interesting to mention that the only non-obvious simple neutrosophic type-SuperHyperSet called the
amid those obvious[non-obvious] simple neutrosophic type-SuperHyperSets called the
is only and only
In a connected neutrosophic SuperHyperGraph
as Linearly-over-packed SuperHyperModel is featured On the Figure (
17).
On the Figure (
18), the SuperHyperNotion, namely, SuperHyperMatching, is up. There’s neither empty SuperHyperEdge nor loop SuperHyperEdge. The following neutrosophic SuperHyperSet of neutrosophic SuperHyperEdges[SuperHyperVertices] is the simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching. The neutrosophic SuperHyperSet of neutrosophic SuperHyperEdges[SuperHyperVertices],
is the simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching. The neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices],
Is an
neutrosophic SuperHyperMatching for an neutrosophic SuperHyperGraph
is a neutrosophic type-SuperHyperSet with
the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet
S of neutrosophic SuperHyperEdges[SuperHyperVertices] such that there’s no neutrosophic SuperHyperVertex of a neutrosophic SuperHyperEdge is common and there’s an neutrosophic SuperHyperEdge for all neutrosophic SuperHyperVertices. There are
not only
two neutrosophic SuperHyperVertices
inside the intended neutrosophic SuperHyperSet. Thus the non-obvious neutrosophic SuperHyperMatching is up. The obvious simple neutrosophic type-SuperHyperSet called the neutrosophic SuperHyperMatching is a neutrosophic SuperHyperSet
includes only
two neutrosophic SuperHyperVertices. But the neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices],
Doesn’t have less than three SuperHyperVertices
inside the intended neutrosophic SuperHyperSet. Thus the non-obvious simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching
is up. To sum them up, the neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices],
Is the non-obvious simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching. Since the neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices],
Is an neutrosophic SuperHyperMatching
for an neutrosophic SuperHyperGraph
is the neutrosophic SuperHyperSet
S of neutrosophic SuperHyperVertices such that there’s no a neutrosophic SuperHyperEdge for some neutrosophic SuperHyperVertices given by that neutrosophic type-SuperHyperSet called the neutrosophic SuperHyperMatching
and it’s an neutrosophic
SuperHyperMatching. Since it
’s the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet
S of neutrosophic SuperHyperEdges[SuperHyperVertices] such that there’s no neutrosophic SuperHyperVertex of a neutrosophic SuperHyperEdge is common and there’s an neutrosophic SuperHyperEdge for all neutrosophic SuperHyperVertices. There aren’t only less than three neutrosophic SuperHyperVertices
inside the intended neutrosophic SuperHyperSet,
Thus the non-obvious neutrosophic SuperHyperMatching,
Is up. The obvious simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching, not:
Is the neutrosophic SuperHyperSet, not:
Does includes only less than three SuperHyperVertices in a connected neutrosophic SuperHyperGraph
It’s interesting to mention that the only non-obvious simple neutrosophic type-SuperHyperSet called the
amid those obvious[non-obvious] simple neutrosophic type-SuperHyperSets called the
is only and only
In a connected neutrosophic SuperHyperGraph
On the Figure (
19), the SuperHyperNotion, namely, SuperHyperMatching, is up. There’s neither empty SuperHyperEdge nor loop SuperHyperEdge. The following neutrosophic SuperHyperSet of neutrosophic SuperHyperEdges[SuperHyperVertices] is the simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching. The neutrosophic SuperHyperSet of neutrosophic SuperHyperEdges[SuperHyperVertices],
is the simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching. The neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices],
Is an
neutrosophic SuperHyperMatching for an neutrosophic SuperHyperGraph
is a neutrosophic type-SuperHyperSet with
the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet
S of neutrosophic SuperHyperEdges[SuperHyperVertices] such that there’s no neutrosophic SuperHyperVertex of a neutrosophic SuperHyperEdge is common and there’s an neutrosophic SuperHyperEdge for all neutrosophic SuperHyperVertices. There are
not only
two neutrosophic SuperHyperVertices
inside the intended neutrosophic SuperHyperSet. Thus the non-obvious neutrosophic SuperHyperMatching is up. The obvious simple neutrosophic type-SuperHyperSet called the neutrosophic SuperHyperMatching is a neutrosophic SuperHyperSet
includes only
two neutrosophic SuperHyperVertices. But the neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices],
Doesn’t have less than three SuperHyperVertices
inside the intended neutrosophic SuperHyperSet. Thus the non-obvious simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching
is up. To sum them up, the neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices],
Is the non-obvious simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching. Since the neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices],
Is an neutrosophic SuperHyperMatching
for an neutrosophic SuperHyperGraph
is the neutrosophic SuperHyperSet
S of neutrosophic SuperHyperVertices such that there’s no a neutrosophic SuperHyperEdge for some neutrosophic SuperHyperVertices given by that neutrosophic type-SuperHyperSet called the neutrosophic SuperHyperMatching
and it’s an neutrosophic
SuperHyperMatching. Since it
’s the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet
S of neutrosophic SuperHyperEdges[SuperHyperVertices] such that there’s no neutrosophic SuperHyperVertex of a neutrosophic SuperHyperEdge is common and there’s an neutrosophic SuperHyperEdge for all neutrosophic SuperHyperVertices. There aren’t only less than three neutrosophic SuperHyperVertices
inside the intended neutrosophic SuperHyperSet,
Thus the non-obvious neutrosophic SuperHyperMatching,
Is up. The obvious simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching, not:
Is the neutrosophic SuperHyperSet, not:
Does includes only less than three SuperHyperVertices in a connected neutrosophic SuperHyperGraph
It’s interesting to mention that the only non-obvious simple neutrosophic type-SuperHyperSet called the
amid those obvious[non-obvious] simple neutrosophic type-SuperHyperSets called the
is only and only
In a connected neutrosophic SuperHyperGraph
On the Figure (
20), the SuperHyperNotion, namely, SuperHyperMatching, is up. The following neutrosophic SuperHyperSet of neutrosophic SuperHyperEdges[SuperHyperVertices] is the simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching. The neutrosophic SuperHyperSet of neutrosophic SuperHyperEdges[SuperHyperVertices],
is the simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching. The neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices],
Is an
neutrosophic SuperHyperMatching for an neutrosophic SuperHyperGraph
is a neutrosophic type-SuperHyperSet with
the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet
S of neutrosophic SuperHyperEdges[SuperHyperVertices] such that there’s no neutrosophic SuperHyperVertex of a neutrosophic SuperHyperEdge is common and there’s an neutrosophic SuperHyperEdge for all neutrosophic SuperHyperVertices. There are
not only
two neutrosophic SuperHyperVertices
inside the intended neutrosophic SuperHyperSet. Thus the non-obvious neutrosophic SuperHyperMatching is up. The obvious simple neutrosophic type-SuperHyperSet called the neutrosophic SuperHyperMatching is a neutrosophic SuperHyperSet
includes only
two neutrosophic SuperHyperVertices. But the neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices],
Doesn’t have less than three SuperHyperVertices
inside the intended neutrosophic SuperHyperSet. Thus the non-obvious simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching
is up. To sum them up, the neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices],
Is the non-obvious simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching. Since the neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices],
Is an neutrosophic SuperHyperMatching
for an neutrosophic SuperHyperGraph
is the neutrosophic SuperHyperSet
S of neutrosophic SuperHyperVertices such that there’s no a neutrosophic SuperHyperEdge for some neutrosophic SuperHyperVertices given by that neutrosophic type-SuperHyperSet called the neutrosophic SuperHyperMatching
and it’s an neutrosophic
SuperHyperMatching. Since it
’s the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet
S of neutrosophic SuperHyperEdges[SuperHyperVertices] such that there’s no neutrosophic SuperHyperVertex of a neutrosophic SuperHyperEdge is common and there’s an neutrosophic SuperHyperEdge for all neutrosophic SuperHyperVertices. There aren’t only less than three neutrosophic SuperHyperVertices
inside the intended neutrosophic SuperHyperSet,
Thus the non-obvious neutrosophic SuperHyperMatching,
Is up. The obvious simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching, not:
Is the neutrosophic SuperHyperSet, not:
Does includes only less than three SuperHyperVertices in a connected neutrosophic SuperHyperGraph
It’s interesting to mention that the only non-obvious simple neutrosophic type-SuperHyperSet called the
amid those obvious[non-obvious] simple neutrosophic type-SuperHyperSets called the
is only and only
In a connected neutrosophic SuperHyperGraph
Proposition 6.
Assume a connected loopless neutrosophic SuperHyperGraph Then in the worst case, literally,
is a neutrosophic R-SuperHyperMatching. In other words, the least cardinality, the lower sharp bound for the cardinality, of a neutrosophic R-SuperHyperMatching is the cardinality of
Proof. Assume a connected loopless neutrosophic SuperHyperGraph
The SuperHyperSet of the SuperHyperVertices
isn’t a quasi-R-SuperHyperMatching since neither amount of neutrosophic SuperHyperEdges nor amount of SuperHyperVertices where amount refers to the neutrosophic number of SuperHyperVertices(-/SuperHyperEdges) more than one to form any kind of SuperHyperEdges or any number of SuperHyperEdges. Let us consider the neutrosophic SuperHyperSet
This neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices has the eligibilities to propose property such that there’s no neutrosophic SuperHyperVertex of a neutrosophic SuperHyperEdge is common and there’s an neutrosophic SuperHyperEdge for all neutrosophic SuperHyperVertices but the maximum neutrosophic cardinality indicates that these neutrosophic type-SuperHyperSets couldn’t give us the neutrosophic lower bound in the term of neutrosophic sharpness. In other words, the neutrosophic SuperHyperSet
of the neutrosophic SuperHyperVertices implies at least on-quasi-triangle style is up but sometimes the neutrosophic SuperHyperSet
of the neutrosophic SuperHyperVertices is free-quasi-triangle and it doesn’t make a contradiction to the supposition on the connected loopless neutrosophic SuperHyperGraph
Thus the minimum case never happens in the generality of the connected loopless neutrosophic SuperHyperGraphs. Thus if we assume in the worst case, literally,
Is a quasi-R-SuperHyperMatching. In other words, the least cardinality, the lower sharp bound for the cardinality, of a quasi-R-SuperHyperMatching is the cardinality of
Then we’ve lost some connected loopless neutrosophic SuperHyperClasses of the connected loopless neutrosophic SuperHyperGraphs titled free-triangle, on-triangle, and their quasi-types but the SuperHyperStable is only up in this quasi-R-SuperHyperMatching. It’s the contradiction to that fact on the generality. There are some counterexamples to deny this statement. One of them comes from the setting of the graph titled path and cycle as the counterexamples-classes or reversely direction star as the examples-classes, are well-known classes in that setting and they could be considered as the examples-classes and counterexamples-classes for the tight bound of
Let
in mind. There’s no necessity on the SuperHyperEdge since we need at least two SuperHyperVertices to form a SuperHyperEdge. It doesn’t withdraw the principles of the main definition since there’s no condition to be satisfied but the condition is on the existence of the SuperHyperEdge instead of acting on the SuperHyperVertices. In other words, if there’s a SuperHyperEdge, then the neutrosophic SuperHyperSet has the necessary condition for the intended definition to be applied. Thus the
is withdrawn not by the conditions of the main definition but by the necessity of the pre-condition on the usage of the main definition.
To make sense with the precise words in the terms of “R-’, the follow-up illustrations are coming up.
The following neutrosophic SuperHyperSet of neutrosophic SuperHyperVertices is the simple neutrosophic type-SuperHyperSet of the neutrosophic R-SuperHyperMatching.
The neutrosophic SuperHyperSet of neutrosophic SuperHyperVertices,
Is the simple neutrosophic type-SuperHyperSet of the neutrosophic R-SuperHyperMatching. The neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices,
Is an
neutrosophic R-SuperHyperMatching for an neutrosophic SuperHyperGraph
is a neutrosophic type-SuperHyperSet with
the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet
S of neutrosophic SuperHyperVertices such that there’s no a neutrosophic SuperHyperEdge amid some neutrosophic SuperHyperVertices instead of all given by
neutrosophic SuperHyperMatching is related to the neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices,
There’s
not only
one neutrosophic SuperHyperVertex
inside the intended neutrosophic SuperHyperSet. Thus the non-obvious neutrosophic SuperHyperMatching is up. The obvious simple neutrosophic type-SuperHyperSet called the neutrosophic SuperHyperMatching is a neutrosophic SuperHyperSet
includes only
one neutrosophic SuperHyperVertex. But the neutrosophic SuperHyperSet of neutrosophic SuperHyperVertices,
doesn’t have less than two SuperHyperVertices
inside the intended neutrosophic SuperHyperSet since they’ve come from at least so far an SuperHyperEdge. Thus the non-obvious simple neutrosophic type-SuperHyperSet of the neutrosophic R-SuperHyperMatching
is up. To sum them up, the neutrosophic SuperHyperSet of neutrosophic SuperHyperVertices,
Is the non-obvious simple neutrosophic type-SuperHyperSet of the neutrosophic R-SuperHyperMatching. Since the neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices,
or
is an neutrosophic R-SuperHyperMatching
for an neutrosophic SuperHyperGraph
is the neutrosophic SuperHyperSet
S of neutrosophic SuperHyperVertices such that there’s no a neutrosophic SuperHyperEdge for some neutrosophic SuperHyperVertices instead of all given by that neutrosophic type-SuperHyperSet called the neutrosophic SuperHyperMatching
and it’s an neutrosophic
SuperHyperMatching. Since it
’s the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet
S of neutrosophic SuperHyperVertices such that there’s no a neutrosophic SuperHyperEdge for some amount neutrosophic SuperHyperVertices instead of all given by that neutrosophic type-SuperHyperSet called the neutrosophic SuperHyperMatching. There isn’t only less than two neutrosophic SuperHyperVertices
inside the intended neutrosophic SuperHyperSet,
Thus the non-obvious neutrosophic R-SuperHyperMatching,
is up. The non-obvious simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching, not:
Is the neutrosophic SuperHyperSet, not:
does includes only less than two SuperHyperVertices in a connected neutrosophic SuperHyperGraph
but it’s impossible in the case, they’ve corresponded to an SuperHyperEdge. It’s interesting to mention that the only non-obvious simple neutrosophic type-SuperHyperSet called the
amid those obvious[non-obvious] simple neutrosophic type-SuperHyperSets called the
is only and only
In a connected neutrosophic SuperHyperGraph
with a illustrated SuperHyperModeling. It’s also, not only a neutrosophic free-triangle embedded SuperHyperModel and a neutrosophic on-triangle embedded SuperHyperModel but also it’s a neutrosophic stable embedded SuperHyperModel. But all only non-obvious simple neutrosophic type-SuperHyperSets of the neutrosophic R-SuperHyperMatching amid those obvious simple neutrosophic type-SuperHyperSets of the neutrosophic SuperHyperMatching, are
In a connected neutrosophic SuperHyperGraph
To sum them up, assume a connected loopless neutrosophic SuperHyperGraph
Then in the worst case, literally,
is a neutrosophic R-SuperHyperMatching. In other words, the least cardinality, the lower sharp bound for the cardinality, of a neutrosophic R-SuperHyperMatching is the cardinality of
□
Proposition 7.
Assume a simple neutrosophic SuperHyperGraph Then the neutrosophic number of R-SuperHyperMatching has, the least cardinality, the lower sharp bound for cardinality, is the neutrosophic cardinality of
If there’s a R-SuperHyperMatching with the least cardinality, the lower sharp bound for cardinality.
Proof. The neutrosophic structure of the neutrosophic R-SuperHyperMatching decorates the neutrosophic SuperHyperVertices don’t have received any neutrosophic connections so as this neutrosophic style implies different versions of neutrosophic SuperHyperEdges with the maximum neutrosophic cardinality in the terms of neutrosophic SuperHyperVertices are spotlight. The lower neutrosophic bound is to have the maximum neutrosophic groups of neutrosophic SuperHyperVertices have perfect neutrosophic connections inside each of SuperHyperEdges and the outside of this neutrosophic SuperHyperSet doesn’t matter but regarding the connectedness of the used neutrosophic SuperHyperGraph arising from its neutrosophic properties taken from the fact that it’s simple. If there’s no more than one neutrosophic SuperHyperVertex in the targeted neutrosophic SuperHyperSet, then there’s no neutrosophic connection. Furthermore, the neutrosophic existence of one neutrosophic SuperHyperVertex has no neutrosophic effect to talk about the neutrosophic R-SuperHyperMatching. Since at least two neutrosophic SuperHyperVertices involve to make a title in the neutrosophic background of the neutrosophic SuperHyperGraph. The neutrosophic SuperHyperGraph is obvious if it has no neutrosophic SuperHyperEdge but at least two neutrosophic SuperHyperVertices make the neutrosophic version of neutrosophic SuperHyperEdge. Thus in the neutrosophic setting of non-obvious neutrosophic SuperHyperGraph, there are at least one neutrosophic SuperHyperEdge. It’s necessary to mention that the word “Simple” is used as neutrosophic adjective for the initial neutrosophic SuperHyperGraph, induces there’s no neutrosophic appearance of the loop neutrosophic version of the neutrosophic SuperHyperEdge and this neutrosophic SuperHyperGraph is said to be loopless. The neutrosophic adjective “loop” on the basic neutrosophic framework engages one neutrosophic SuperHyperVertex but it never happens in this neutrosophic setting. With these neutrosophic bases, on a neutrosophic SuperHyperGraph, there’s at least one neutrosophic SuperHyperEdge thus there’s at least a neutrosophic R-SuperHyperMatching has the neutrosophic cardinality of a neutrosophic SuperHyperEdge. Thus, a neutrosophic R-SuperHyperMatching has the neutrosophic cardinality at least a neutrosophic SuperHyperEdge. Assume a neutrosophic SuperHyperSet
This neutrosophic SuperHyperSet isn’t a neutrosophic R-SuperHyperMatching since either the neutrosophic SuperHyperGraph is an obvious neutrosophic SuperHyperModel thus it never happens since there’s no neutrosophic usage of this neutrosophic framework and even more there’s no neutrosophic connection inside or the neutrosophic SuperHyperGraph isn’t obvious and as its consequences, there’s a neutrosophic contradiction with the term “neutrosophic R-SuperHyperMatching” since the maximum neutrosophic cardinality never happens for this neutrosophic style of the neutrosophic SuperHyperSet and beyond that there’s no neutrosophic connection inside as mentioned in first neutrosophic case in the forms of drawback for this selected neutrosophic SuperHyperSet. Let
Comes up. This neutrosophic case implies having the neutrosophic style of on-quasi-triangle neutrosophic style on the every neutrosophic elements of this neutrosophic SuperHyperSet. Precisely, the neutrosophic R-SuperHyperMatching is the neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices such that some neutrosophic amount of the neutrosophic SuperHyperVertices are on-quasi-triangle neutrosophic style. The neutrosophic cardinality of the v SuperHypeSet
Is the maximum in comparison to the neutrosophic SuperHyperSet
But the lower neutrosophic bound is up. Thus the minimum neutrosophic cardinality of the maximum neutrosophic cardinality ends up the neutrosophic discussion. The first neutrosophic term refers to the neutrosophic setting of the neutrosophic SuperHyperGraph but this key point is enough since there’s a neutrosophic SuperHyperClass of a neutrosophic SuperHyperGraph has no on-quasi-triangle neutrosophic style amid some amount of its neutrosophic SuperHyperVertices. This neutrosophic setting of the neutrosophic SuperHyperModel proposes a neutrosophic SuperHyperSet has only some amount neutrosophic SuperHyperVertices from one neutrosophic SuperHyperEdge such that there’s no neutrosophic amount of neutrosophic SuperHyperEdges more than one involving these some amount of these neutrosophic SuperHyperVertices. The neutrosophic cardinality of this neutrosophic SuperHyperSet is the maximum and the neutrosophic case is occurred in the minimum neutrosophic situation. To sum them up, the neutrosophic SuperHyperSet
Has the maximum neutrosophic cardinality such that
Contains some neutrosophic SuperHyperVertices such that there’s distinct-covers-order-amount neutrosophic SuperHyperEdges for amount of neutrosophic SuperHyperVertices taken from the neutrosophic SuperHyperSet
It means that the neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices
Is a neutrosophic R-SuperHyperMatching for the neutrosophic SuperHyperGraph as used neutrosophic background in the neutrosophic terms of worst neutrosophic case and the common theme of the lower neutrosophic bound occurred in the specific neutrosophic SuperHyperClasses of the neutrosophic SuperHyperGraphs which are neutrosophic free-quasi-triangle.
To make sense with the precise words in the terms of “R-’, the follow-up illustrations are coming up.
The following neutrosophic SuperHyperSet of neutrosophic SuperHyperVertices is the simple neutrosophic type-SuperHyperSet of the neutrosophic R-SuperHyperMatching.
The neutrosophic SuperHyperSet of neutrosophic SuperHyperVertices,
Is the simple neutrosophic type-SuperHyperSet of the neutrosophic R-SuperHyperMatching. The neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices,
Is an
neutrosophic R-SuperHyperMatching for an neutrosophic SuperHyperGraph
is a neutrosophic type-SuperHyperSet with
the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet
S of neutrosophic SuperHyperVertices such that there’s no a neutrosophic SuperHyperEdge amid some neutrosophic SuperHyperVertices instead of all given by
neutrosophic SuperHyperMatching is related to the neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices,
There’s
not only
one neutrosophic SuperHyperVertex
inside the intended neutrosophic SuperHyperSet. Thus the non-obvious neutrosophic SuperHyperMatching is up. The obvious simple neutrosophic type-SuperHyperSet called the neutrosophic SuperHyperMatching is a neutrosophic SuperHyperSet
includes only
one neutrosophic SuperHyperVertex. But the neutrosophic SuperHyperSet of neutrosophic SuperHyperVertices,
doesn’t have less than two SuperHyperVertices
inside the intended neutrosophic SuperHyperSet since they’ve come from at least so far an SuperHyperEdge. Thus the non-obvious simple neutrosophic type-SuperHyperSet of the neutrosophic R-SuperHyperMatching
is up. To sum them up, the neutrosophic SuperHyperSet of neutrosophic SuperHyperVertices,
Is the non-obvious simple neutrosophic type-SuperHyperSet of the neutrosophic R-SuperHyperMatching. Since the neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices,
or
is an neutrosophic R-SuperHyperMatching
for an neutrosophic SuperHyperGraph
is the neutrosophic SuperHyperSet
S of neutrosophic SuperHyperVertices such that there’s no a neutrosophic SuperHyperEdge for some neutrosophic SuperHyperVertices instead of all given by that neutrosophic type-SuperHyperSet called the neutrosophic SuperHyperMatching
and it’s an neutrosophic
SuperHyperMatching. Since it
’s the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet
S of neutrosophic SuperHyperVertices such that there’s no a neutrosophic SuperHyperEdge for some amount neutrosophic SuperHyperVertices instead of all given by that neutrosophic type-SuperHyperSet called the neutrosophic SuperHyperMatching. There isn’t only less than two neutrosophic SuperHyperVertices
inside the intended neutrosophic SuperHyperSet,
Thus the non-obvious neutrosophic R-SuperHyperMatching,
is up. The non-obvious simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching, not:
Is the neutrosophic SuperHyperSet, not:
does includes only less than two SuperHyperVertices in a connected neutrosophic SuperHyperGraph
but it’s impossible in the case, they’ve corresponded to an SuperHyperEdge. It’s interesting to mention that the only non-obvious simple neutrosophic type-SuperHyperSet called the
amid those obvious[non-obvious] simple neutrosophic type-SuperHyperSets called the
is only and only
In a connected neutrosophic SuperHyperGraph
with a illustrated SuperHyperModeling. It’s also, not only a neutrosophic free-triangle embedded SuperHyperModel and a neutrosophic on-triangle embedded SuperHyperModel but also it’s a neutrosophic stable embedded SuperHyperModel. But all only non-obvious simple neutrosophic type-SuperHyperSets of the neutrosophic R-SuperHyperMatching amid those obvious simple neutrosophic type-SuperHyperSets of the neutrosophic SuperHyperMatching, are
In a connected neutrosophic SuperHyperGraph
To sum them up, assume a simple neutrosophic SuperHyperGraph
Then the neutrosophic number of R-SuperHyperMatching has, the least cardinality, the lower sharp bound for cardinality, is the neutrosophic cardinality of
If there’s a R-SuperHyperMatching with the least cardinality, the lower sharp bound for cardinality. □
Proposition 8.
Assume a connected neutrosophic SuperHyperGraph If a neutrosophic SuperHyperEdge has z neutrosophic SuperHyperVertices, then the neutrosophic cardinality of the neutrosophic R-SuperHyperMatching is at least
It’s straightforward that the neutrosophic cardinality of the neutrosophic R-SuperHyperMatching is at least the maximum neutrosophic number of neutrosophic SuperHyperVertices of the neutrosophic SuperHyperEdges with the maximum number of the neutrosophic SuperHyperEdges. In other words, the maximum number of the neutrosophic SuperHyperEdges contains the maximum neutrosophic number of neutrosophic SuperHyperVertices are renamed to neutrosophic SuperHyperMatching in some cases but the maximum number of the neutrosophic SuperHyperEdge with the maximum neutrosophic number of neutrosophic SuperHyperVertices, has the neutrosophic SuperHyperVertices are contained in a neutrosophic R-SuperHyperMatching.
Proof. Assume a neutrosophic SuperHyperEdge
has
z neutrosophic number of the neutrosophic SuperHyperVertices. Then every neutrosophic SuperHyperVertex has at least no neutrosophic SuperHyperEdge with others in common. Thus those neutrosophic SuperHyperVertices have the eligibles to be contained in a neutrosophic R-SuperHyperMatching. Those neutrosophic SuperHyperVertices are potentially included in a neutrosophic style-R-SuperHyperMatching. Formally, consider
Are the neutrosophic SuperHyperVertices of a neutrosophic SuperHyperEdge
Thus
where the ∼ isn’t an equivalence relation but only the symmetric relation on the neutrosophic SuperHyperVertices of the neutrosophic SuperHyperGraph. The formal definition is as follows.
if and only if
and
are the neutrosophic SuperHyperVertices and there’s only and only one neutrosophic SuperHyperEdge
between the neutrosophic SuperHyperVertices
and
The other definition for the neutrosophic SuperHyperEdge
in the terms of neutrosophic R-SuperHyperMatching is
This definition coincides with the definition of the neutrosophic R-SuperHyperMatching but with slightly differences in the maximum neutrosophic cardinality amid those neutrosophic type-SuperHyperSets of the neutrosophic SuperHyperVertices. Thus the neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices,
and
is formalized with mathematical literatures on the neutrosophic R-SuperHyperMatching. Let
be defined as
and
are the neutrosophic SuperHyperVertices belong to the neutrosophic SuperHyperEdge
Thus,
Or
But with the slightly differences,
Thus
is a neutrosophic quasi-R-SuperHyperMatching where
is fixed that means
for all neutrosophic intended SuperHyperVertices but in a neutrosophic SuperHyperMatching,
could be different and it’s not unique. To sum them up, in a connected neutrosophic SuperHyperGraph
If a neutrosophic SuperHyperEdge
has
z neutrosophic SuperHyperVertices, then the neutrosophic cardinality of the neutrosophic R-SuperHyperMatching is at least
It’s straightforward that the neutrosophic cardinality of the neutrosophic R-SuperHyperMatching is at least the maximum neutrosophic number of neutrosophic SuperHyperVertices of the neutrosophic SuperHyperEdges with the maximum number of the neutrosophic SuperHyperEdges. In other words, the maximum number of the neutrosophic SuperHyperEdges contains the maximum neutrosophic number of neutrosophic SuperHyperVertices are renamed to neutrosophic SuperHyperMatching in some cases but the maximum number of the neutrosophic SuperHyperEdge with the maximum neutrosophic number of neutrosophic SuperHyperVertices, has the neutrosophic SuperHyperVertices are contained in a neutrosophic R-SuperHyperMatching.
To make sense with the precise words in the terms of “R-’, the follow-up illustrations are coming up.
The following neutrosophic SuperHyperSet of neutrosophic SuperHyperVertices is the simple neutrosophic type-SuperHyperSet of the neutrosophic R-SuperHyperMatching.
The neutrosophic SuperHyperSet of neutrosophic SuperHyperVertices,
Is the simple neutrosophic type-SuperHyperSet of the neutrosophic R-SuperHyperMatching. The neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices,
Is an
neutrosophic R-SuperHyperMatching for an neutrosophic SuperHyperGraph
is a neutrosophic type-SuperHyperSet with
the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet
S of neutrosophic SuperHyperVertices such that there’s no a neutrosophic SuperHyperEdge amid some neutrosophic SuperHyperVertices instead of all given by
neutrosophic SuperHyperMatching is related to the neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices,
There’s
not only
one neutrosophic SuperHyperVertex
inside the intended neutrosophic SuperHyperSet. Thus the non-obvious neutrosophic SuperHyperMatching is up. The obvious simple neutrosophic type-SuperHyperSet called the neutrosophic SuperHyperMatching is a neutrosophic SuperHyperSet
includes only
one neutrosophic SuperHyperVertex. But the neutrosophic SuperHyperSet of neutrosophic SuperHyperVertices,
doesn’t have less than two SuperHyperVertices
inside the intended neutrosophic SuperHyperSet since they’ve come from at least so far an SuperHyperEdge. Thus the non-obvious simple neutrosophic type-SuperHyperSet of the neutrosophic R-SuperHyperMatching
is up. To sum them up, the neutrosophic SuperHyperSet of neutrosophic SuperHyperVertices,
Is the non-obvious simple neutrosophic type-SuperHyperSet of the neutrosophic R-SuperHyperMatching. Since the neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices,
or
is an neutrosophic R-SuperHyperMatching
for an neutrosophic SuperHyperGraph
is the neutrosophic SuperHyperSet
S of neutrosophic SuperHyperVertices such that there’s no a neutrosophic SuperHyperEdge for some neutrosophic SuperHyperVertices instead of all given by that neutrosophic type-SuperHyperSet called the neutrosophic SuperHyperMatching
and it’s an neutrosophic
SuperHyperMatching. Since it
’s the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet
S of neutrosophic SuperHyperVertices such that there’s no a neutrosophic SuperHyperEdge for some amount neutrosophic SuperHyperVertices instead of all given by that neutrosophic type-SuperHyperSet called the neutrosophic SuperHyperMatching. There isn’t only less than two neutrosophic SuperHyperVertices
inside the intended neutrosophic SuperHyperSet,
Thus the non-obvious neutrosophic R-SuperHyperMatching,
is up. The non-obvious simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching, not:
Is the neutrosophic SuperHyperSet, not:
does includes only less than two SuperHyperVertices in a connected neutrosophic SuperHyperGraph
but it’s impossible in the case, they’ve corresponded to an SuperHyperEdge. It’s interesting to mention that the only non-obvious simple neutrosophic type-SuperHyperSet called the
amid those obvious[non-obvious] simple neutrosophic type-SuperHyperSets called the
is only and only
In a connected neutrosophic SuperHyperGraph
with a illustrated SuperHyperModeling. It’s also, not only a neutrosophic free-triangle embedded SuperHyperModel and a neutrosophic on-triangle embedded SuperHyperModel but also it’s a neutrosophic stable embedded SuperHyperModel. But all only non-obvious simple neutrosophic type-SuperHyperSets of the neutrosophic R-SuperHyperMatching amid those obvious simple neutrosophic type-SuperHyperSets of the neutrosophic SuperHyperMatching, are
In a connected neutrosophic SuperHyperGraph
To sum them up, assume a connected loopless neutrosophic SuperHyperGraph
Then in the worst case, literally,
is a neutrosophic R-SuperHyperMatching. In other words, the least cardinality, the lower sharp bound for the cardinality, of a neutrosophic R-SuperHyperMatching is the cardinality of
To sum them up, in a connected neutrosophic SuperHyperGraph
If a neutrosophic SuperHyperEdge
has
z neutrosophic SuperHyperVertices, then the neutrosophic cardinality of the neutrosophic R-SuperHyperMatching is at least
It’s straightforward that the neutrosophic cardinality of the neutrosophic R-SuperHyperMatching is at least the maximum neutrosophic number of neutrosophic SuperHyperVertices of the neutrosophic SuperHyperEdges with the maximum number of the neutrosophic SuperHyperEdges. In other words, the maximum number of the neutrosophic SuperHyperEdges contains the maximum neutrosophic number of neutrosophic SuperHyperVertices are renamed to neutrosophic SuperHyperMatching in some cases but the maximum number of the neutrosophic SuperHyperEdge with the maximum neutrosophic number of neutrosophic SuperHyperVertices, has the neutrosophic SuperHyperVertices are contained in a neutrosophic R-SuperHyperMatching. □
Proposition 9. Assume a connected non-obvious neutrosophic SuperHyperGraph There’s only one neutrosophic SuperHyperEdge has only the maximum possibilities of the distinct interior neutrosophic SuperHyperVertices inside of any given neutrosophic quasi-R-SuperHyperMatching minus all neutrosophic SuperHypeNeighbor to some of them but not all of them. In other words, there’s only an unique neutrosophic SuperHyperEdge has only two distinct neutrosophic SuperHyperVertices in an neutrosophic quasi-R-SuperHyperMatching, minus all neutrosophic SuperHypeNeighbor to some of them but not all of them.
Proof. The obvious SuperHyperGraph has no neutrosophic SuperHyperEdges. But the non-obvious neutrosophic SuperHyperModel is up. The quasi-SuperHyperModel addresses some issues about the neutrosophic optimal SuperHyperObject. It specially delivers some remarks on the neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices such that there’s distinct amount of neutrosophic SuperHyperEdges for distinct amount of neutrosophic SuperHyperVertices up to all taken from that neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices but this neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices is either has the maximum neutrosophic SuperHyperCardinality or it doesn’t have maximum neutrosophic SuperHyperCardinality. In a non-obvious SuperHyperModel, there’s at least one neutrosophic SuperHyperEdge containing at least all neutrosophic SuperHyperVertices. Thus it forms a neutrosophic quasi-R-SuperHyperMatching where the neutrosophic completion of the neutrosophic incidence is up in that. Thus it’s, literarily, a neutrosophic embedded R-SuperHyperMatching. The SuperHyperNotions of embedded SuperHyperSet and quasi-SuperHyperSet coincide. In the original setting, these types of SuperHyperSets only don’t satisfy on the maximum SuperHyperCardinality. Thus the embedded setting is elected such that those SuperHyperSets have the maximum neutrosophic SuperHyperCardinality and they’re neutrosophic SuperHyperOptimal. The less than two distinct types of neutrosophic SuperHyperVertices are included in the minimum neutrosophic style of the embedded neutrosophic R-SuperHyperMatching. The interior types of the neutrosophic SuperHyperVertices are deciders. Since the neutrosophic number of SuperHyperNeighbors are only affected by the interior neutrosophic SuperHyperVertices. The common connections, more precise and more formal, the perfect unique connections inside the neutrosophic SuperHyperSet for any distinct types of neutrosophic SuperHyperVertices pose the neutrosophic R-SuperHyperMatching. Thus neutrosophic exterior SuperHyperVertices could be used only in one neutrosophic SuperHyperEdge and in neutrosophic SuperHyperRelation with the interior neutrosophic SuperHyperVertices in that neutrosophic SuperHyperEdge. In the embedded neutrosophic SuperHyperMatching, there’s the usage of exterior neutrosophic SuperHyperVertices since they’ve more connections inside more than outside. Thus the title “exterior” is more relevant than the title “interior”. One neutrosophic SuperHyperVertex has no connection, inside. Thus, the neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices with one SuperHyperElement has been ignored in the exploring to lead on the optimal case implying the neutrosophic R-SuperHyperMatching. The neutrosophic R-SuperHyperMatching with the exclusion of the exclusion of all neutrosophic SuperHyperVertices in one neutrosophic SuperHyperEdge and with other terms, the neutrosophic R-SuperHyperMatching with the inclusion of all neutrosophic SuperHyperVertices in one neutrosophic SuperHyperEdge, is a neutrosophic quasi-R-SuperHyperMatching. To sum them up, in a connected non-obvious neutrosophic SuperHyperGraph There’s only one neutrosophic SuperHyperEdge has only the maximum possibilities of the distinct interior neutrosophic SuperHyperVertices inside of any given neutrosophic quasi-R-SuperHyperMatching minus all neutrosophic SuperHypeNeighbor to some of them but not all of them. In other words, there’s only an unique neutrosophic SuperHyperEdge has only two distinct neutrosophic SuperHyperVertices in an neutrosophic quasi-R-SuperHyperMatching, minus all neutrosophic SuperHypeNeighbor to some of them but not all of them.
To make sense with the precise words in the terms of “R-’, the follow-up illustrations are coming up.
The following neutrosophic SuperHyperSet of neutrosophic SuperHyperVertices is the simple neutrosophic type-SuperHyperSet of the neutrosophic R-SuperHyperMatching.
The neutrosophic SuperHyperSet of neutrosophic SuperHyperVertices,
Is the simple neutrosophic type-SuperHyperSet of the neutrosophic R-SuperHyperMatching. The neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices,
Is an
neutrosophic R-SuperHyperMatching for an neutrosophic SuperHyperGraph
is a neutrosophic type-SuperHyperSet with
the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet
S of neutrosophic SuperHyperVertices such that there’s no a neutrosophic SuperHyperEdge amid some neutrosophic SuperHyperVertices instead of all given by
neutrosophic SuperHyperMatching is related to the neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices,
There’s
not only
one neutrosophic SuperHyperVertex
inside the intended neutrosophic SuperHyperSet. Thus the non-obvious neutrosophic SuperHyperMatching is up. The obvious simple neutrosophic type-SuperHyperSet called the neutrosophic SuperHyperMatching is a neutrosophic SuperHyperSet
includes only
one neutrosophic SuperHyperVertex. But the neutrosophic SuperHyperSet of neutrosophic SuperHyperVertices,
doesn’t have less than two SuperHyperVertices
inside the intended neutrosophic SuperHyperSet since they’ve come from at least so far an SuperHyperEdge. Thus the non-obvious simple neutrosophic type-SuperHyperSet of the neutrosophic R-SuperHyperMatching
is up. To sum them up, the neutrosophic SuperHyperSet of neutrosophic SuperHyperVertices,
Is the non-obvious simple neutrosophic type-SuperHyperSet of the neutrosophic R-SuperHyperMatching. Since the neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices,
or
is an neutrosophic R-SuperHyperMatching
for an neutrosophic SuperHyperGraph
is the neutrosophic SuperHyperSet
S of neutrosophic SuperHyperVertices such that there’s no a neutrosophic SuperHyperEdge for some neutrosophic SuperHyperVertices instead of all given by that neutrosophic type-SuperHyperSet called the neutrosophic SuperHyperMatching
and it’s an neutrosophic
SuperHyperMatching. Since it
’s the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet
S of neutrosophic SuperHyperVertices such that there’s no a neutrosophic SuperHyperEdge for some amount neutrosophic SuperHyperVertices instead of all given by that neutrosophic type-SuperHyperSet called the neutrosophic SuperHyperMatching. There isn’t only less than two neutrosophic SuperHyperVertices
inside the intended neutrosophic SuperHyperSet,
Thus the non-obvious neutrosophic R-SuperHyperMatching,
is up. The non-obvious simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching, not:
Is the neutrosophic SuperHyperSet, not:
does includes only less than two SuperHyperVertices in a connected neutrosophic SuperHyperGraph
but it’s impossible in the case, they’ve corresponded to an SuperHyperEdge. It’s interesting to mention that the only non-obvious simple neutrosophic type-SuperHyperSet called the
amid those obvious[non-obvious] simple neutrosophic type-SuperHyperSets called the
is only and only
In a connected neutrosophic SuperHyperGraph
with a illustrated SuperHyperModeling. It’s also, not only a neutrosophic free-triangle embedded SuperHyperModel and a neutrosophic on-triangle embedded SuperHyperModel but also it’s a neutrosophic stable embedded SuperHyperModel. But all only non-obvious simple neutrosophic type-SuperHyperSets of the neutrosophic R-SuperHyperMatching amid those obvious simple neutrosophic type-SuperHyperSets of the neutrosophic SuperHyperMatching, are
In a connected neutrosophic SuperHyperGraph
To sum them up, assume a connected loopless neutrosophic SuperHyperGraph
Then in the worst case, literally,
is a neutrosophic R-SuperHyperMatching. In other words, the least cardinality, the lower sharp bound for the cardinality, of a neutrosophic R-SuperHyperMatching is the cardinality of
To sum them up, in a connected non-obvious neutrosophic SuperHyperGraph
There’s only one neutrosophic SuperHyperEdge
has only the maximum possibilities of the distinct interior neutrosophic SuperHyperVertices inside of any given neutrosophic quasi-R-SuperHyperMatching minus all neutrosophic SuperHypeNeighbor to some of them but not all of them. In other words, there’s only an unique neutrosophic SuperHyperEdge
has only two distinct neutrosophic SuperHyperVertices in an neutrosophic quasi-R-SuperHyperMatching, minus all neutrosophic SuperHypeNeighbor to some of them but not all of them. □
Proposition 10. Assume a connected neutrosophic SuperHyperGraph The all interior neutrosophic SuperHyperVertices belong to any neutrosophic quasi-R-SuperHyperMatching if for any of them, and any of other corresponded neutrosophic SuperHyperVertex, some interior neutrosophic SuperHyperVertices are mutually neutrosophic SuperHyperNeighbors with no neutrosophic exception at all minus all neutrosophic SuperHypeNeighbors to any amount of them.
Proof. The main definition of the neutrosophic R-SuperHyperMatching has two titles. a neutrosophic quasi-R-SuperHyperMatching and its corresponded quasi-maximum neutrosophic R-SuperHyperCardinality are two titles in the terms of quasi-R-styles. For any neutrosophic number, there’s a neutrosophic quasi-R-SuperHyperMatching with that quasi-maximum neutrosophic SuperHyperCardinality in the terms of the embedded neutrosophic SuperHyperGraph. If there’s an embedded neutrosophic SuperHyperGraph, then the neutrosophic quasi-SuperHyperNotions lead us to take the collection of all the neutrosophic quasi-R-SuperHyperMatchings for all neutrosophic numbers less than its neutrosophic corresponded maximum number. The essence of the neutrosophic SuperHyperMatching ends up but this essence starts up in the terms of the neutrosophic quasi-R-SuperHyperMatching, again and more in the operations of collecting all the neutrosophic quasi-R-SuperHyperMatchings acted on the all possible used formations of the neutrosophic SuperHyperGraph to achieve one neutrosophic number. This neutrosophic number is considered as the equivalence class for all corresponded quasi-R-SuperHyperMatchings. Let
and
be a neutrosophic number, a neutrosophic SuperHyperSet and a neutrosophic SuperHyperMatching. Then
As its consequences, the formal definition of the neutrosophic SuperHyperMatching is re-formalized and redefined as follows.
To get more precise perceptions, the follow-up expressions propose another formal technical definition for the neutrosophic SuperHyperMatching.
In more concise and more convenient ways, the modified definition for the neutrosophic SuperHyperMatching poses the upcoming expressions.
To translate the statement to this mathematical literature, the formulae will be revised.
And then,
To get more visions in the closer look-up, there’s an overall overlook.
Now, the extension of these types of approaches is up. Since the new term, “neutrosophic SuperHyperNeighborhood”, could be redefined as the collection of the neutrosophic SuperHyperVertices such that any amount of its neutrosophic SuperHyperVertices are incident to a neutrosophic SuperHyperEdge. It’s, literarily, another name for “neutrosophic Quasi-SuperHyperMatching” but, precisely, it’s the generalization of “neutrosophic Quasi-SuperHyperMatching” since “neutrosophic Quasi-SuperHyperMatching” happens “neutrosophic SuperHyperMatching” in a neutrosophic SuperHyperGraph as initial framework and background but “neutrosophic SuperHyperNeighborhood” may not happens “neutrosophic SuperHyperMatching” in a neutrosophic SuperHyperGraph as initial framework and preliminarily background since there are some ambiguities about the neutrosophic SuperHyperCardinality arise from it. To get orderly keywords, the terms, “neutrosophic SuperHyperNeighborhood”, “neutrosophic Quasi-SuperHyperMatching”, and “neutrosophic SuperHyperMatching” are up.
Thus, let
and
be a neutrosophic number, a neutrosophic SuperHyperNeighborhood and a neutrosophic SuperHyperMatching and the new terms are up.
And with go back to initial structure,
Thus, in a connected neutrosophic SuperHyperGraph
The all interior neutrosophic SuperHyperVertices belong to any neutrosophic quasi-R-SuperHyperMatching if for any of them, and any of other corresponded neutrosophic SuperHyperVertex, some interior neutrosophic SuperHyperVertices are mutually neutrosophic SuperHyperNeighbors with no neutrosophic exception at all minus all neutrosophic SuperHypeNeighbors to any amount of them.
To make sense with the precise words in the terms of “R-’, the follow-up illustrations are coming up.
The following neutrosophic SuperHyperSet of neutrosophic SuperHyperVertices is the simple neutrosophic type-SuperHyperSet of the neutrosophic R-SuperHyperMatching.
The neutrosophic SuperHyperSet of neutrosophic SuperHyperVertices,
Is the simple neutrosophic type-SuperHyperSet of the neutrosophic R-SuperHyperMatching. The neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices,
Is an
neutrosophic R-SuperHyperMatching for an neutrosophic SuperHyperGraph
is a neutrosophic type-SuperHyperSet with
the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet
S of neutrosophic SuperHyperVertices such that there’s no a neutrosophic SuperHyperEdge amid some neutrosophic SuperHyperVertices instead of all given by
neutrosophic SuperHyperMatching is related to the neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices,
There’s
not only
one neutrosophic SuperHyperVertex
inside the intended neutrosophic SuperHyperSet. Thus the non-obvious neutrosophic SuperHyperMatching is up. The obvious simple neutrosophic type-SuperHyperSet called the neutrosophic SuperHyperMatching is a neutrosophic SuperHyperSet
includes only
one neutrosophic SuperHyperVertex. But the neutrosophic SuperHyperSet of neutrosophic SuperHyperVertices,
doesn’t have less than two SuperHyperVertices
inside the intended neutrosophic SuperHyperSet since they’ve come from at least so far an SuperHyperEdge. Thus the non-obvious simple neutrosophic type-SuperHyperSet of the neutrosophic R-SuperHyperMatching
is up. To sum them up, the neutrosophic SuperHyperSet of neutrosophic SuperHyperVertices,
Is the non-obvious simple neutrosophic type-SuperHyperSet of the neutrosophic R-SuperHyperMatching. Since the neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices,
or
is an neutrosophic R-SuperHyperMatching
for an neutrosophic SuperHyperGraph
is the neutrosophic SuperHyperSet
S of neutrosophic SuperHyperVertices such that there’s no a neutrosophic SuperHyperEdge for some neutrosophic SuperHyperVertices instead of all given by that neutrosophic type-SuperHyperSet called the neutrosophic SuperHyperMatching
and it’s an neutrosophic
SuperHyperMatching. Since it
’s the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet
S of neutrosophic SuperHyperVertices such that there’s no a neutrosophic SuperHyperEdge for some amount neutrosophic SuperHyperVertices instead of all given by that neutrosophic type-SuperHyperSet called the neutrosophic SuperHyperMatching. There isn’t only less than two neutrosophic SuperHyperVertices
inside the intended neutrosophic SuperHyperSet,
Thus the non-obvious neutrosophic R-SuperHyperMatching,
is up. The non-obvious simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching, not:
Is the neutrosophic SuperHyperSet, not:
does includes only less than two SuperHyperVertices in a connected neutrosophic SuperHyperGraph
but it’s impossible in the case, they’ve corresponded to an SuperHyperEdge. It’s interesting to mention that the only non-obvious simple neutrosophic type-SuperHyperSet called the
amid those obvious[non-obvious] simple neutrosophic type-SuperHyperSets called the
is only and only
In a connected neutrosophic SuperHyperGraph
with a illustrated SuperHyperModeling. It’s also, not only a neutrosophic free-triangle embedded SuperHyperModel and a neutrosophic on-triangle embedded SuperHyperModel but also it’s a neutrosophic stable embedded SuperHyperModel. But all only non-obvious simple neutrosophic type-SuperHyperSets of the neutrosophic R-SuperHyperMatching amid those obvious simple neutrosophic type-SuperHyperSets of the neutrosophic SuperHyperMatching, are
In a connected neutrosophic SuperHyperGraph
To sum them up, assume a connected loopless neutrosophic SuperHyperGraph
Then in the worst case, literally,
is a neutrosophic R-SuperHyperMatching. In other words, the least cardinality, the lower sharp bound for the cardinality, of a neutrosophic R-SuperHyperMatching is the cardinality of
To sum them up, in a connected neutrosophic SuperHyperGraph
The all interior neutrosophic SuperHyperVertices belong to any neutrosophic quasi-R-SuperHyperMatching if for any of them, and any of other corresponded neutrosophic SuperHyperVertex, some interior neutrosophic SuperHyperVertices are mutually neutrosophic SuperHyperNeighbors with no neutrosophic exception at all minus all neutrosophic SuperHypeNeighbors to any amount of them. □
Proposition 11. Assume a connected neutrosophic SuperHyperGraph Any neutrosophic R-SuperHyperMatching only contains all interior neutrosophic SuperHyperVertices and all exterior neutrosophic SuperHyperVertices from the unique neutrosophic SuperHyperEdge where there’s any of them has all possible neutrosophic SuperHyperNeighbors in and there’s all neutrosophic SuperHyperNeighborhoods in with no exception minus all neutrosophic SuperHypeNeighbors to some of them not all of them but everything is possible about neutrosophic SuperHyperNeighborhoods and neutrosophic SuperHyperNeighbors out.
Proof. Assume a connected neutrosophic SuperHyperGraph Let a neutrosophic SuperHyperEdge has some neutrosophic SuperHyperVertices Consider all neutrosophic numbers of those neutrosophic SuperHyperVertices from that neutrosophic SuperHyperEdge excluding excluding more than r distinct neutrosophic SuperHyperVertices, exclude to any given neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices. Consider there’s a neutrosophic R-SuperHyperMatching with the least cardinality, the lower sharp neutrosophic bound for neutrosophic cardinality. Assume a connected neutrosophic SuperHyperGraph The neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices is a neutrosophic SuperHyperSet S of the neutrosophic SuperHyperVertices such that there’s a neutrosophic SuperHyperEdge to have some neutrosophic SuperHyperVertices uniquely but it isn’t a neutrosophic R-SuperHyperMatching. Since it doesn’t have the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet S of neutrosophic SuperHyperVertices such that there’s a neutrosophic SuperHyperEdge to have some SuperHyperVertices uniquely. The neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices is the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet S of neutrosophic SuperHyperVertices but it isn’t a neutrosophic R-SuperHyperMatching. Since it doesn’t do the neutrosophic procedure such that such that there’s a neutrosophic SuperHyperEdge to have some neutrosophic SuperHyperVertices uniquely [there are at least one neutrosophic SuperHyperVertex outside implying there’s, sometimes in the connected neutrosophic SuperHyperGraph a neutrosophic SuperHyperVertex, titled its neutrosophic SuperHyperNeighbor, to that neutrosophic SuperHyperVertex in the neutrosophic SuperHyperSet S so as S doesn’t do “the neutrosophic procedure”.]. There’s only one neutrosophic SuperHyperVertex outside the intended neutrosophic SuperHyperSet, in the terms of neutrosophic SuperHyperNeighborhood. Thus the obvious neutrosophic R-SuperHyperMatching, is up. The obvious simple neutrosophic type-SuperHyperSet of the neutrosophic R-SuperHyperMatching, is a neutrosophic SuperHyperSet, includes only all neutrosophic SuperHyperVertices does forms any kind of neutrosophic pairs are titled neutrosophic SuperHyperNeighbors in a connected neutrosophic SuperHyperGraph Since the neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices is the maximum neutrosophic SuperHyperCardinality of a neutrosophic SuperHyperSet S of neutrosophic SuperHyperVertices such that there’s a neutrosophic SuperHyperEdge to have some neutrosophic SuperHyperVertices uniquely. Thus, in a connected neutrosophic SuperHyperGraph Any neutrosophic R-SuperHyperMatching only contains all interior neutrosophic SuperHyperVertices and all exterior neutrosophic SuperHyperVertices from the unique neutrosophic SuperHyperEdge where there’s any of them has all possible neutrosophic SuperHyperNeighbors in and there’s all neutrosophic SuperHyperNeighborhoods in with no exception minus all neutrosophic SuperHypeNeighbors to some of them not all of them but everything is possible about neutrosophic SuperHyperNeighborhoods and neutrosophic SuperHyperNeighbors out.
To make sense with the precise words in the terms of “R-’, the follow-up illustrations are coming up.
The following neutrosophic SuperHyperSet of neutrosophic SuperHyperVertices is the simple neutrosophic type-SuperHyperSet of the neutrosophic R-SuperHyperMatching.
The neutrosophic SuperHyperSet of neutrosophic SuperHyperVertices,
Is the simple neutrosophic type-SuperHyperSet of the neutrosophic R-SuperHyperMatching. The neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices,
Is an
neutrosophic R-SuperHyperMatching for an neutrosophic SuperHyperGraph
is a neutrosophic type-SuperHyperSet with
the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet
S of neutrosophic SuperHyperVertices such that there’s no a neutrosophic SuperHyperEdge amid some neutrosophic SuperHyperVertices instead of all given by
neutrosophic SuperHyperMatching is related to the neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices,
There’s
not only
one neutrosophic SuperHyperVertex
inside the intended neutrosophic SuperHyperSet. Thus the non-obvious neutrosophic SuperHyperMatching is up. The obvious simple neutrosophic type-SuperHyperSet called the neutrosophic SuperHyperMatching is a neutrosophic SuperHyperSet
includes only
one neutrosophic SuperHyperVertex. But the neutrosophic SuperHyperSet of neutrosophic SuperHyperVertices,
doesn’t have less than two SuperHyperVertices
inside the intended neutrosophic SuperHyperSet since they’ve come from at least so far an SuperHyperEdge. Thus the non-obvious simple neutrosophic type-SuperHyperSet of the neutrosophic R-SuperHyperMatching
is up. To sum them up, the neutrosophic SuperHyperSet of neutrosophic SuperHyperVertices,
Is the non-obvious simple neutrosophic type-SuperHyperSet of the neutrosophic R-SuperHyperMatching. Since the neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices,
or
is an neutrosophic R-SuperHyperMatching
for an neutrosophic SuperHyperGraph
is the neutrosophic SuperHyperSet
S of neutrosophic SuperHyperVertices such that there’s no a neutrosophic SuperHyperEdge for some neutrosophic SuperHyperVertices instead of all given by that neutrosophic type-SuperHyperSet called the neutrosophic SuperHyperMatching
and it’s an neutrosophic
SuperHyperMatching. Since it
’s the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet
S of neutrosophic SuperHyperVertices such that there’s no a neutrosophic SuperHyperEdge for some amount neutrosophic SuperHyperVertices instead of all given by that neutrosophic type-SuperHyperSet called the neutrosophic SuperHyperMatching. There isn’t only less than two neutrosophic SuperHyperVertices
inside the intended neutrosophic SuperHyperSet,
Thus the non-obvious neutrosophic R-SuperHyperMatching,
is up. The non-obvious simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching, not:
Is the neutrosophic SuperHyperSet, not:
does includes only less than two SuperHyperVertices in a connected neutrosophic SuperHyperGraph
but it’s impossible in the case, they’ve corresponded to an SuperHyperEdge. It’s interesting to mention that the only non-obvious simple neutrosophic type-SuperHyperSet called the
amid those obvious[non-obvious] simple neutrosophic type-SuperHyperSets called the
is only and only
In a connected neutrosophic SuperHyperGraph
with a illustrated SuperHyperModeling. It’s also, not only a neutrosophic free-triangle embedded SuperHyperModel and a neutrosophic on-triangle embedded SuperHyperModel but also it’s a neutrosophic stable embedded SuperHyperModel. But all only non-obvious simple neutrosophic type-SuperHyperSets of the neutrosophic R-SuperHyperMatching amid those obvious simple neutrosophic type-SuperHyperSets of the neutrosophic SuperHyperMatching, are
In a connected neutrosophic SuperHyperGraph
To sum them up, assume a connected loopless neutrosophic SuperHyperGraph
Then in the worst case, literally,
is a neutrosophic R-SuperHyperMatching. In other words, the least cardinality, the lower sharp bound for the cardinality, of a neutrosophic R-SuperHyperMatching is the cardinality of
To sum them up, assume a connected neutrosophic SuperHyperGraph
Any neutrosophic R-SuperHyperMatching only contains all interior neutrosophic SuperHyperVertices and all exterior neutrosophic SuperHyperVertices from the unique neutrosophic SuperHyperEdge where there’s any of them has all possible neutrosophic SuperHyperNeighbors in and there’s all neutrosophic SuperHyperNeighborhoods in with no exception minus all neutrosophic SuperHypeNeighbors to some of them not all of them but everything is possible about neutrosophic SuperHyperNeighborhoods and neutrosophic SuperHyperNeighbors out. □
Remark 12. The words “ neutrosophic SuperHyperMatching” and “neutrosophic SuperHyperDominating” both refer to the maximum neutrosophic type-style. In other words, they refer to the maximum neutrosophic SuperHyperNumber and the neutrosophic SuperHyperSet with the maximum neutrosophic SuperHyperCardinality.
Proposition 13. Assume a connected neutrosophic SuperHyperGraph Consider a neutrosophic SuperHyperDominating. Then a neutrosophic SuperHyperMatching has the members poses only one neutrosophic representative in a neutrosophic quasi-SuperHyperDominating.
Proof. Assume a connected neutrosophic SuperHyperGraph Consider a neutrosophic SuperHyperDominating. By applying the Proposition (11), the neutrosophic results are up. Thus on a connected neutrosophic SuperHyperGraph Consider a neutrosophic SuperHyperDominating. Then a neutrosophic SuperHyperMatching has the members poses only one neutrosophic representative in a neutrosophic quasi-SuperHyperDominating. □
5. Results on neutrosophic SuperHyperClasses
The previous neutrosophic approaches apply on the upcoming neutrosophic results on neutrosophic SuperHyperClasses.
Proposition 14. Assume a connected neutrosophic SuperHyperPath Then a neutrosophic quasi-R-SuperHyperMatching-style with the maximum neutrosophic SuperHyperCardinality is an neutrosophic SuperHyperSet of the interior neutrosophic SuperHyperVertices.
Proposition 15.
Assume a connected neutrosophic SuperHyperPath Then a neutrosophic quasi-R-SuperHyperMatching is a neutrosophic SuperHyperSet of the interior neutrosophic SuperHyperVertices with only no neutrosophic exceptions in the form of interior neutrosophic SuperHyperVertices from the unique neutrosophic SuperHyperEdges not excluding only any interior neutrosophic SuperHyperVertices from the neutrosophic unique SuperHyperEdges. a neutrosophic quasi-R-SuperHyperMatching has the neutrosophic number of all the interior neutrosophic SuperHyperVertices. Also,
Proof. Assume a connected loopless neutrosophic SuperHyperGraph
The SuperHyperSet of the SuperHyperVertices
isn’t a quasi-R-SuperHyperMatching since neither amount of neutrosophic SuperHyperEdges nor amount of SuperHyperVertices where amount refers to the neutrosophic number of SuperHyperVertices(-/SuperHyperEdges) more than one to form any kind of SuperHyperEdges or any number of SuperHyperEdges. Let us consider the neutrosophic SuperHyperSet
This neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices has the eligibilities to propose property such that there’s no neutrosophic SuperHyperVertex of a neutrosophic SuperHyperEdge is common and there’s an neutrosophic SuperHyperEdge for all neutrosophic SuperHyperVertices but the maximum neutrosophic cardinality indicates that these neutrosophic type-SuperHyperSets couldn’t give us the neutrosophic lower bound in the term of neutrosophic sharpness. In other words, the neutrosophic SuperHyperSet
of the neutrosophic SuperHyperVertices implies at least on-quasi-triangle style is up but sometimes the neutrosophic SuperHyperSet
of the neutrosophic SuperHyperVertices is free-quasi-triangle and it doesn’t make a contradiction to the supposition on the connected loopless neutrosophic SuperHyperGraph
Thus the minimum case never happens in the generality of the connected loopless neutrosophic SuperHyperGraphs. Thus if we assume in the worst case, literally,
Is a quasi-R-SuperHyperMatching. In other words, the least cardinality, the lower sharp bound for the cardinality, of a quasi-R-SuperHyperMatching is the cardinality of
Then we’ve lost some connected loopless neutrosophic SuperHyperClasses of the connected loopless neutrosophic SuperHyperGraphs titled free-triangle, on-triangle, and their quasi-types but the SuperHyperStable is only up in this quasi-R-SuperHyperMatching. It’s the contradiction to that fact on the generality. There are some counterexamples to deny this statement. One of them comes from the setting of the graph titled path and cycle as the counterexamples-classes or reversely direction star as the examples-classes, are well-known classes in that setting and they could be considered as the examples-classes and counterexamples-classes for the tight bound of
Let
in mind. There’s no necessity on the SuperHyperEdge since we need at least two SuperHyperVertices to form a SuperHyperEdge. It doesn’t withdraw the principles of the main definition since there’s no condition to be satisfied but the condition is on the existence of the SuperHyperEdge instead of acting on the SuperHyperVertices. In other words, if there’s a SuperHyperEdge, then the neutrosophic SuperHyperSet has the necessary condition for the intended definition to be applied. Thus the
is withdrawn not by the conditions of the main definition but by the necessity of the pre-condition on the usage of the main definition.
The neutrosophic structure of the neutrosophic R-SuperHyperMatching decorates the neutrosophic SuperHyperVertices don’t have received any neutrosophic connections so as this neutrosophic style implies different versions of neutrosophic SuperHyperEdges with the maximum neutrosophic cardinality in the terms of neutrosophic SuperHyperVertices are spotlight. The lower neutrosophic bound is to have the maximum neutrosophic groups of neutrosophic SuperHyperVertices have perfect neutrosophic connections inside each of SuperHyperEdges and the outside of this neutrosophic SuperHyperSet doesn’t matter but regarding the connectedness of the used neutrosophic SuperHyperGraph arising from its neutrosophic properties taken from the fact that it’s simple. If there’s no more than one neutrosophic SuperHyperVertex in the targeted neutrosophic SuperHyperSet, then there’s no neutrosophic connection. Furthermore, the neutrosophic existence of one neutrosophic SuperHyperVertex has no neutrosophic effect to talk about the neutrosophic R-SuperHyperMatching. Since at least two neutrosophic SuperHyperVertices involve to make a title in the neutrosophic background of the neutrosophic SuperHyperGraph. The neutrosophic SuperHyperGraph is obvious if it has no neutrosophic SuperHyperEdge but at least two neutrosophic SuperHyperVertices make the neutrosophic version of neutrosophic SuperHyperEdge. Thus in the neutrosophic setting of non-obvious neutrosophic SuperHyperGraph, there are at least one neutrosophic SuperHyperEdge. It’s necessary to mention that the word “Simple” is used as neutrosophic adjective for the initial neutrosophic SuperHyperGraph, induces there’s no neutrosophic appearance of the loop neutrosophic version of the neutrosophic SuperHyperEdge and this neutrosophic SuperHyperGraph is said to be loopless. The neutrosophic adjective “loop” on the basic neutrosophic framework engages one neutrosophic SuperHyperVertex but it never happens in this neutrosophic setting. With these neutrosophic bases, on a neutrosophic SuperHyperGraph, there’s at least one neutrosophic SuperHyperEdge thus there’s at least a neutrosophic R-SuperHyperMatching has the neutrosophic cardinality of a neutrosophic SuperHyperEdge. Thus, a neutrosophic R-SuperHyperMatching has the neutrosophic cardinality at least a neutrosophic SuperHyperEdge. Assume a neutrosophic SuperHyperSet
This neutrosophic SuperHyperSet isn’t a neutrosophic R-SuperHyperMatching since either the neutrosophic SuperHyperGraph is an obvious neutrosophic SuperHyperModel thus it never happens since there’s no neutrosophic usage of this neutrosophic framework and even more there’s no neutrosophic connection inside or the neutrosophic SuperHyperGraph isn’t obvious and as its consequences, there’s a neutrosophic contradiction with the term “neutrosophic R-SuperHyperMatching” since the maximum neutrosophic cardinality never happens for this neutrosophic style of the neutrosophic SuperHyperSet and beyond that there’s no neutrosophic connection inside as mentioned in first neutrosophic case in the forms of drawback for this selected neutrosophic SuperHyperSet. Let
Comes up. This neutrosophic case implies having the neutrosophic style of on-quasi-triangle neutrosophic style on the every neutrosophic elements of this neutrosophic SuperHyperSet. Precisely, the neutrosophic R-SuperHyperMatching is the neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices such that some neutrosophic amount of the neutrosophic SuperHyperVertices are on-quasi-triangle neutrosophic style. The neutrosophic cardinality of the v SuperHypeSet
Is the maximum in comparison to the neutrosophic SuperHyperSet
But the lower neutrosophic bound is up. Thus the minimum neutrosophic cardinality of the maximum neutrosophic cardinality ends up the neutrosophic discussion. The first neutrosophic term refers to the neutrosophic setting of the neutrosophic SuperHyperGraph but this key point is enough since there’s a neutrosophic SuperHyperClass of a neutrosophic SuperHyperGraph has no on-quasi-triangle neutrosophic style amid some amount of its neutrosophic SuperHyperVertices. This neutrosophic setting of the neutrosophic SuperHyperModel proposes a neutrosophic SuperHyperSet has only some amount neutrosophic SuperHyperVertices from one neutrosophic SuperHyperEdge such that there’s no neutrosophic amount of neutrosophic SuperHyperEdges more than one involving these some amount of these neutrosophic SuperHyperVertices. The neutrosophic cardinality of this neutrosophic SuperHyperSet is the maximum and the neutrosophic case is occurred in the minimum neutrosophic situation. To sum them up, the neutrosophic SuperHyperSet
Has the maximum neutrosophic cardinality such that
Contains some neutrosophic SuperHyperVertices such that there’s distinct-covers-order-amount neutrosophic SuperHyperEdges for amount of neutrosophic SuperHyperVertices taken from the neutrosophic SuperHyperSet
It means that the neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices
Is a neutrosophic R-SuperHyperMatching for the neutrosophic SuperHyperGraph as used neutrosophic background in the neutrosophic terms of worst neutrosophic case and the common theme of the lower neutrosophic bound occurred in the specific neutrosophic SuperHyperClasses of the neutrosophic SuperHyperGraphs which are neutrosophic free-quasi-triangle.
Assume a neutrosophic SuperHyperEdge
has
z neutrosophic number of the neutrosophic SuperHyperVertices. Then every neutrosophic SuperHyperVertex has at least no neutrosophic SuperHyperEdge with others in common. Thus those neutrosophic SuperHyperVertices have the eligibles to be contained in a neutrosophic R-SuperHyperMatching. Those neutrosophic SuperHyperVertices are potentially included in a neutrosophic style-R-SuperHyperMatching. Formally, consider
Are the neutrosophic SuperHyperVertices of a neutrosophic SuperHyperEdge
Thus
where the ∼ isn’t an equivalence relation but only the symmetric relation on the neutrosophic SuperHyperVertices of the neutrosophic SuperHyperGraph. The formal definition is as follows.
if and only if
and
are the neutrosophic SuperHyperVertices and there’s only and only one neutrosophic SuperHyperEdge
between the neutrosophic SuperHyperVertices
and
The other definition for the neutrosophic SuperHyperEdge
in the terms of neutrosophic R-SuperHyperMatching is
This definition coincides with the definition of the neutrosophic R-SuperHyperMatching but with slightly differences in the maximum neutrosophic cardinality amid those neutrosophic type-SuperHyperSets of the neutrosophic SuperHyperVertices. Thus the neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices,
and
is formalized with mathematical literatures on the neutrosophic R-SuperHyperMatching. Let
be defined as
and
are the neutrosophic SuperHyperVertices belong to the neutrosophic SuperHyperEdge
Thus,
Or
But with the slightly differences,
Thus
is a neutrosophic quasi-R-SuperHyperMatching where
is fixed that means
for all neutrosophic intended SuperHyperVertices but in a neutrosophic SuperHyperMatching,
could be different and it’s not unique. To sum them up, in a connected neutrosophic SuperHyperGraph
If a neutrosophic SuperHyperEdge
has
z neutrosophic SuperHyperVertices, then the neutrosophic cardinality of the neutrosophic R-SuperHyperMatching is at least
It’s straightforward that the neutrosophic cardinality of the neutrosophic R-SuperHyperMatching is at least the maximum neutrosophic number of neutrosophic SuperHyperVertices of the neutrosophic SuperHyperEdges with the maximum number of the neutrosophic SuperHyperEdges. In other words, the maximum number of the neutrosophic SuperHyperEdges contains the maximum neutrosophic number of neutrosophic SuperHyperVertices are renamed to neutrosophic SuperHyperMatching in some cases but the maximum number of the neutrosophic SuperHyperEdge with the maximum neutrosophic number of neutrosophic SuperHyperVertices, has the neutrosophic SuperHyperVertices are contained in a neutrosophic R-SuperHyperMatching.
The obvious SuperHyperGraph has no neutrosophic SuperHyperEdges. But the non-obvious neutrosophic SuperHyperModel is up. The quasi-SuperHyperModel addresses some issues about the neutrosophic optimal SuperHyperObject. It specially delivers some remarks on the neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices such that there’s distinct amount of neutrosophic SuperHyperEdges for distinct amount of neutrosophic SuperHyperVertices up to all taken from that neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices but this neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices is either has the maximum neutrosophic SuperHyperCardinality or it doesn’t have maximum neutrosophic SuperHyperCardinality. In a non-obvious SuperHyperModel, there’s at least one neutrosophic SuperHyperEdge containing at least all neutrosophic SuperHyperVertices. Thus it forms a neutrosophic quasi-R-SuperHyperMatching where the neutrosophic completion of the neutrosophic incidence is up in that. Thus it’s, literarily, a neutrosophic embedded R-SuperHyperMatching. The SuperHyperNotions of embedded SuperHyperSet and quasi-SuperHyperSet coincide. In the original setting, these types of SuperHyperSets only don’t satisfy on the maximum SuperHyperCardinality. Thus the embedded setting is elected such that those SuperHyperSets have the maximum neutrosophic SuperHyperCardinality and they’re neutrosophic SuperHyperOptimal. The less than two distinct types of neutrosophic SuperHyperVertices are included in the minimum neutrosophic style of the embedded neutrosophic R-SuperHyperMatching. The interior types of the neutrosophic SuperHyperVertices are deciders. Since the neutrosophic number of SuperHyperNeighbors are only affected by the interior neutrosophic SuperHyperVertices. The common connections, more precise and more formal, the perfect unique connections inside the neutrosophic SuperHyperSet for any distinct types of neutrosophic SuperHyperVertices pose the neutrosophic R-SuperHyperMatching. Thus neutrosophic exterior SuperHyperVertices could be used only in one neutrosophic SuperHyperEdge and in neutrosophic SuperHyperRelation with the interior neutrosophic SuperHyperVertices in that neutrosophic SuperHyperEdge. In the embedded neutrosophic SuperHyperMatching, there’s the usage of exterior neutrosophic SuperHyperVertices since they’ve more connections inside more than outside. Thus the title “exterior” is more relevant than the title “interior”. One neutrosophic SuperHyperVertex has no connection, inside. Thus, the neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices with one SuperHyperElement has been ignored in the exploring to lead on the optimal case implying the neutrosophic R-SuperHyperMatching. The neutrosophic R-SuperHyperMatching with the exclusion of the exclusion of all neutrosophic SuperHyperVertices in one neutrosophic SuperHyperEdge and with other terms, the neutrosophic R-SuperHyperMatching with the inclusion of all neutrosophic SuperHyperVertices in one neutrosophic SuperHyperEdge, is a neutrosophic quasi-R-SuperHyperMatching. To sum them up, in a connected non-obvious neutrosophic SuperHyperGraph There’s only one neutrosophic SuperHyperEdge has only the maximum possibilities of the distinct interior neutrosophic SuperHyperVertices inside of any given neutrosophic quasi-R-SuperHyperMatching minus all neutrosophic SuperHypeNeighbor to some of them but not all of them. In other words, there’s only an unique neutrosophic SuperHyperEdge has only two distinct neutrosophic SuperHyperVertices in an neutrosophic quasi-R-SuperHyperMatching, minus all neutrosophic SuperHypeNeighbor to some of them but not all of them.
The main definition of the neutrosophic R-SuperHyperMatching has two titles. a neutrosophic quasi-R-SuperHyperMatching and its corresponded quasi-maximum neutrosophic R-SuperHyperCardinality are two titles in the terms of quasi-R-styles. For any neutrosophic number, there’s a neutrosophic quasi-R-SuperHyperMatching with that quasi-maximum neutrosophic SuperHyperCardinality in the terms of the embedded neutrosophic SuperHyperGraph. If there’s an embedded neutrosophic SuperHyperGraph, then the neutrosophic quasi-SuperHyperNotions lead us to take the collection of all the neutrosophic quasi-R-SuperHyperMatchings for all neutrosophic numbers less than its neutrosophic corresponded maximum number. The essence of the neutrosophic SuperHyperMatching ends up but this essence starts up in the terms of the neutrosophic quasi-R-SuperHyperMatching, again and more in the operations of collecting all the neutrosophic quasi-R-SuperHyperMatchings acted on the all possible used formations of the neutrosophic SuperHyperGraph to achieve one neutrosophic number. This neutrosophic number is considered as the equivalence class for all corresponded quasi-R-SuperHyperMatchings. Let
and
be a neutrosophic number, a neutrosophic SuperHyperSet and a neutrosophic SuperHyperMatching. Then
As its consequences, the formal definition of the neutrosophic SuperHyperMatching is re-formalized and redefined as follows.
To get more precise perceptions, the follow-up expressions propose another formal technical definition for the neutrosophic SuperHyperMatching.
In more concise and more convenient ways, the modified definition for the neutrosophic SuperHyperMatching poses the upcoming expressions.
To translate the statement to this mathematical literature, the formulae will be revised.
And then,
To get more visions in the closer look-up, there’s an overall overlook.
Now, the extension of these types of approaches is up. Since the new term, “neutrosophic SuperHyperNeighborhood”, could be redefined as the collection of the neutrosophic SuperHyperVertices such that any amount of its neutrosophic SuperHyperVertices are incident to a neutrosophic SuperHyperEdge. It’s, literarily, another name for “neutrosophic Quasi-SuperHyperMatching” but, precisely, it’s the generalization of “neutrosophic Quasi-SuperHyperMatching” since “neutrosophic Quasi-SuperHyperMatching” happens “neutrosophic SuperHyperMatching” in a neutrosophic SuperHyperGraph as initial framework and background but “neutrosophic SuperHyperNeighborhood” may not happens “neutrosophic SuperHyperMatching” in a neutrosophic SuperHyperGraph as initial framework and preliminarily background since there are some ambiguities about the neutrosophic SuperHyperCardinality arise from it. To get orderly keywords, the terms, “neutrosophic SuperHyperNeighborhood”, “neutrosophic Quasi-SuperHyperMatching”, and “neutrosophic SuperHyperMatching” are up.
Thus, let
and
be a neutrosophic number, a neutrosophic SuperHyperNeighborhood and a neutrosophic SuperHyperMatching and the new terms are up.
And with go back to initial structure,
Thus, in a connected neutrosophic SuperHyperGraph
The all interior neutrosophic SuperHyperVertices belong to any neutrosophic quasi-R-SuperHyperMatching if for any of them, and any of other corresponded neutrosophic SuperHyperVertex, some interior neutrosophic SuperHyperVertices are mutually neutrosophic SuperHyperNeighbors with no neutrosophic exception at all minus all neutrosophic SuperHypeNeighbors to any amount of them.
To make sense with the precise words in the terms of “R-’, the follow-up illustrations are coming up. The following neutrosophic SuperHyperSet of neutrosophic SuperHyperVertices is the simple neutrosophic type-SuperHyperSet of the neutrosophic R-SuperHyperMatching.
The neutrosophic SuperHyperSet of neutrosophic SuperHyperVertices,
Is the simple neutrosophic type-SuperHyperSet of the neutrosophic R-SuperHyperMatching. The neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices,
Is an
neutrosophic R-SuperHyperMatching for an neutrosophic SuperHyperGraph
is a neutrosophic type-SuperHyperSet with
the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet
S of neutrosophic SuperHyperVertices such that there’s no a neutrosophic SuperHyperEdge amid some neutrosophic SuperHyperVertices instead of all given by
neutrosophic SuperHyperMatching is related to the neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices,
There’s
not only
one neutrosophic SuperHyperVertex
inside the intended neutrosophic SuperHyperSet. Thus the non-obvious neutrosophic SuperHyperMatching is up. The obvious simple neutrosophic type-SuperHyperSet called the neutrosophic SuperHyperMatching is a neutrosophic SuperHyperSet
includes only
one neutrosophic SuperHyperVertex. But the neutrosophic SuperHyperSet of neutrosophic SuperHyperVertices,
doesn’t have less than two SuperHyperVertices
inside the intended neutrosophic SuperHyperSet since they’ve come from at least so far an SuperHyperEdge. Thus the non-obvious simple neutrosophic type-SuperHyperSet of the neutrosophic R-SuperHyperMatching
is up. To sum them up, the neutrosophic SuperHyperSet of neutrosophic SuperHyperVertices,
Is the non-obvious simple neutrosophic type-SuperHyperSet of the neutrosophic R-SuperHyperMatching. Since the neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices,
or
is an neutrosophic R-SuperHyperMatching
for an neutrosophic SuperHyperGraph
is the neutrosophic SuperHyperSet
S of neutrosophic SuperHyperVertices such that there’s no a neutrosophic SuperHyperEdge for some neutrosophic SuperHyperVertices instead of all given by that neutrosophic type-SuperHyperSet called the neutrosophic SuperHyperMatching
and it’s an neutrosophic
SuperHyperMatching. Since it
’s the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet
S of neutrosophic SuperHyperVertices such that there’s no a neutrosophic SuperHyperEdge for some amount neutrosophic SuperHyperVertices instead of all given by that neutrosophic type-SuperHyperSet called the neutrosophic SuperHyperMatching. There isn’t only less than two neutrosophic SuperHyperVertices
inside the intended neutrosophic SuperHyperSet,
Thus the non-obvious neutrosophic R-SuperHyperMatching,
is up. The non-obvious simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching, not:
Is the neutrosophic SuperHyperSet, not:
does includes only less than two SuperHyperVertices in a connected neutrosophic SuperHyperGraph
but it’s impossible in the case, they’ve corresponded to an SuperHyperEdge. It’s interesting to mention that the only non-obvious simple neutrosophic type-SuperHyperSet called the
amid those obvious[non-obvious] simple neutrosophic type-SuperHyperSets called the
is only and only
In a connected neutrosophic SuperHyperGraph
with a illustrated SuperHyperModeling. It’s also, not only a neutrosophic free-triangle embedded SuperHyperModel and a neutrosophic on-triangle embedded SuperHyperModel but also it’s a neutrosophic stable embedded SuperHyperModel. But all only non-obvious simple neutrosophic type-SuperHyperSets of the neutrosophic R-SuperHyperMatching amid those obvious simple neutrosophic type-SuperHyperSets of the neutrosophic SuperHyperMatching, are
In a connected neutrosophic SuperHyperGraph
To sum them up, assume a connected loopless neutrosophic SuperHyperGraph
Then in the worst case, literally,
is a neutrosophic R-SuperHyperMatching. In other words, the least cardinality, the lower sharp bound for the cardinality, of a neutrosophic R-SuperHyperMatching is the cardinality of
To sum them up, in a connected neutrosophic SuperHyperGraph
The all interior neutrosophic SuperHyperVertices belong to any neutrosophic quasi-R-SuperHyperMatching if for any of them, and any of other corresponded neutrosophic SuperHyperVertex, some interior neutrosophic SuperHyperVertices are mutually neutrosophic SuperHyperNeighbors with no neutrosophic exception at all minus all neutrosophic SuperHypeNeighbors to any amount of them.
Assume a connected neutrosophic SuperHyperGraph Let a neutrosophic SuperHyperEdge has some neutrosophic SuperHyperVertices Consider all neutrosophic numbers of those neutrosophic SuperHyperVertices from that neutrosophic SuperHyperEdge excluding excluding more than r distinct neutrosophic SuperHyperVertices, exclude to any given neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices. Consider there’s a neutrosophic R-SuperHyperMatching with the least cardinality, the lower sharp neutrosophic bound for neutrosophic cardinality. Assume a connected neutrosophic SuperHyperGraph The neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices is a neutrosophic SuperHyperSet S of the neutrosophic SuperHyperVertices such that there’s a neutrosophic SuperHyperEdge to have some neutrosophic SuperHyperVertices uniquely but it isn’t a neutrosophic R-SuperHyperMatching. Since it doesn’t have the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet S of neutrosophic SuperHyperVertices such that there’s a neutrosophic SuperHyperEdge to have some SuperHyperVertices uniquely. The neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices is the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet S of neutrosophic SuperHyperVertices but it isn’t a neutrosophic R-SuperHyperMatching. Since it doesn’t do the neutrosophic procedure such that such that there’s a neutrosophic SuperHyperEdge to have some neutrosophic SuperHyperVertices uniquely [there are at least one neutrosophic SuperHyperVertex outside implying there’s, sometimes in the connected neutrosophic SuperHyperGraph a neutrosophic SuperHyperVertex, titled its neutrosophic SuperHyperNeighbor, to that neutrosophic SuperHyperVertex in the neutrosophic SuperHyperSet S so as S doesn’t do “the neutrosophic procedure”.]. There’s only one neutrosophic SuperHyperVertex outside the intended neutrosophic SuperHyperSet, in the terms of neutrosophic SuperHyperNeighborhood. Thus the obvious neutrosophic R-SuperHyperMatching, is up. The obvious simple neutrosophic type-SuperHyperSet of the neutrosophic R-SuperHyperMatching, is a neutrosophic SuperHyperSet, includes only all neutrosophic SuperHyperVertices does forms any kind of neutrosophic pairs are titled neutrosophic SuperHyperNeighbors in a connected neutrosophic SuperHyperGraph Since the neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices is the maximum neutrosophic SuperHyperCardinality of a neutrosophic SuperHyperSet S of neutrosophic SuperHyperVertices such that there’s a neutrosophic SuperHyperEdge to have some neutrosophic SuperHyperVertices uniquely. Thus, in a connected neutrosophic SuperHyperGraph Any neutrosophic R-SuperHyperMatching only contains all interior neutrosophic SuperHyperVertices and all exterior neutrosophic SuperHyperVertices from the unique neutrosophic SuperHyperEdge where there’s any of them has all possible neutrosophic SuperHyperNeighbors in and there’s all neutrosophic SuperHyperNeighborhoods in with no exception minus all neutrosophic SuperHypeNeighbors to some of them not all of them but everything is possible about neutrosophic SuperHyperNeighborhoods and neutrosophic SuperHyperNeighbors out.
The SuperHyperNotion, namely, SuperHyperMatching, is up. There’s neither empty SuperHyperEdge nor loop SuperHyperEdge. The following neutrosophic SuperHyperSet of neutrosophic SuperHyperEdges[SuperHyperVertices] is the simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching. The neutrosophic SuperHyperSet of neutrosophic SuperHyperEdges[SuperHyperVertices],
is the simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching. The neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices],
Is an
neutrosophic SuperHyperMatching for an neutrosophic SuperHyperGraph
is a neutrosophic type-SuperHyperSet with
the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet
S of neutrosophic SuperHyperEdges[SuperHyperVertices] such that there’s no neutrosophic SuperHyperVertex of a neutrosophic SuperHyperEdge is common and there’s an neutrosophic SuperHyperEdge for all neutrosophic SuperHyperVertices. There are
not only
two neutrosophic SuperHyperVertices
inside the intended neutrosophic SuperHyperSet. Thus the non-obvious neutrosophic SuperHyperMatching is up. The obvious simple neutrosophic type-SuperHyperSet called the neutrosophic SuperHyperMatching is a neutrosophic SuperHyperSet
includes only
two neutrosophic SuperHyperVertices. But the neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices],
Doesn’t have less than three SuperHyperVertices
inside the intended neutrosophic SuperHyperSet. Thus the non-obvious simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching
is up. To sum them up, the neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices],
Is the non-obvious simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching. Since the neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices],
Is an neutrosophic SuperHyperMatching
for an neutrosophic SuperHyperGraph
is the neutrosophic SuperHyperSet
S of neutrosophic SuperHyperVertices such that there’s no a neutrosophic SuperHyperEdge for some neutrosophic SuperHyperVertices given by that neutrosophic type-SuperHyperSet called the neutrosophic SuperHyperMatching
and it’s an neutrosophic
SuperHyperMatching. Since it
’s the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet
S of neutrosophic SuperHyperEdges[SuperHyperVertices] such that there’s no neutrosophic SuperHyperVertex of a neutrosophic SuperHyperEdge is common and there’s an neutrosophic SuperHyperEdge for all neutrosophic SuperHyperVertices. There aren’t only less than three neutrosophic SuperHyperVertices
inside the intended neutrosophic SuperHyperSet,
Thus the non-obvious neutrosophic SuperHyperMatching,
Is up. The obvious simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching, not:
Is the neutrosophic SuperHyperSet, not:
Does includes only less than three SuperHyperVertices in a connected neutrosophic SuperHyperGraph
It’s interesting to mention that the only non-obvious simple neutrosophic type-SuperHyperSet called the
amid those obvious[non-obvious] simple neutrosophic type-SuperHyperSets called the
is only and only
In a connected neutrosophic SuperHyperGraph
□
Example 16. In the Figure (
21), the connected neutrosophic SuperHyperPath
is highlighted and featured. The neutrosophic SuperHyperSet, in the neutrosophic SuperHyperModel (
21), is the SuperHyperMatching.
Proposition 17.
Assume a connected neutrosophic SuperHyperCycle Then a neutrosophic quasi-R-SuperHyperMatching is a neutrosophic SuperHyperSet of the interior neutrosophic SuperHyperVertices with only no neutrosophic exceptions on the form of interior neutrosophic SuperHyperVertices from the same neutrosophic SuperHyperNeighborhoods not excluding any neutrosophic SuperHyperVertex. a neutrosophic quasi-R-SuperHyperMatching has the neutrosophic half number of all the neutrosophic SuperHyperEdges in the terms of the maximum neutrosophic cardinality. Also,
Proof. Assume a connected loopless neutrosophic SuperHyperGraph
The SuperHyperSet of the SuperHyperVertices
isn’t a quasi-R-SuperHyperMatching since neither amount of neutrosophic SuperHyperEdges nor amount of SuperHyperVertices where amount refers to the neutrosophic number of SuperHyperVertices(-/SuperHyperEdges) more than one to form any kind of SuperHyperEdges or any number of SuperHyperEdges. Let us consider the neutrosophic SuperHyperSet
This neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices has the eligibilities to propose property such that there’s no neutrosophic SuperHyperVertex of a neutrosophic SuperHyperEdge is common and there’s an neutrosophic SuperHyperEdge for all neutrosophic SuperHyperVertices but the maximum neutrosophic cardinality indicates that these neutrosophic type-SuperHyperSets couldn’t give us the neutrosophic lower bound in the term of neutrosophic sharpness. In other words, the neutrosophic SuperHyperSet
of the neutrosophic SuperHyperVertices implies at least on-quasi-triangle style is up but sometimes the neutrosophic SuperHyperSet
of the neutrosophic SuperHyperVertices is free-quasi-triangle and it doesn’t make a contradiction to the supposition on the connected loopless neutrosophic SuperHyperGraph
Thus the minimum case never happens in the generality of the connected loopless neutrosophic SuperHyperGraphs. Thus if we assume in the worst case, literally,
Is a quasi-R-SuperHyperMatching. In other words, the least cardinality, the lower sharp bound for the cardinality, of a quasi-R-SuperHyperMatching is the cardinality of
Then we’ve lost some connected loopless neutrosophic SuperHyperClasses of the connected loopless neutrosophic SuperHyperGraphs titled free-triangle, on-triangle, and their quasi-types but the SuperHyperStable is only up in this quasi-R-SuperHyperMatching. It’s the contradiction to that fact on the generality. There are some counterexamples to deny this statement. One of them comes from the setting of the graph titled path and cycle as the counterexamples-classes or reversely direction star as the examples-classes, are well-known classes in that setting and they could be considered as the examples-classes and counterexamples-classes for the tight bound of
Let
in mind. There’s no necessity on the SuperHyperEdge since we need at least two SuperHyperVertices to form a SuperHyperEdge. It doesn’t withdraw the principles of the main definition since there’s no condition to be satisfied but the condition is on the existence of the SuperHyperEdge instead of acting on the SuperHyperVertices. In other words, if there’s a SuperHyperEdge, then the neutrosophic SuperHyperSet has the necessary condition for the intended definition to be applied. Thus the
is withdrawn not by the conditions of the main definition but by the necessity of the pre-condition on the usage of the main definition.
The neutrosophic structure of the neutrosophic R-SuperHyperMatching decorates the neutrosophic SuperHyperVertices don’t have received any neutrosophic connections so as this neutrosophic style implies different versions of neutrosophic SuperHyperEdges with the maximum neutrosophic cardinality in the terms of neutrosophic SuperHyperVertices are spotlight. The lower neutrosophic bound is to have the maximum neutrosophic groups of neutrosophic SuperHyperVertices have perfect neutrosophic connections inside each of SuperHyperEdges and the outside of this neutrosophic SuperHyperSet doesn’t matter but regarding the connectedness of the used neutrosophic SuperHyperGraph arising from its neutrosophic properties taken from the fact that it’s simple. If there’s no more than one neutrosophic SuperHyperVertex in the targeted neutrosophic SuperHyperSet, then there’s no neutrosophic connection. Furthermore, the neutrosophic existence of one neutrosophic SuperHyperVertex has no neutrosophic effect to talk about the neutrosophic R-SuperHyperMatching. Since at least two neutrosophic SuperHyperVertices involve to make a title in the neutrosophic background of the neutrosophic SuperHyperGraph. The neutrosophic SuperHyperGraph is obvious if it has no neutrosophic SuperHyperEdge but at least two neutrosophic SuperHyperVertices make the neutrosophic version of neutrosophic SuperHyperEdge. Thus in the neutrosophic setting of non-obvious neutrosophic SuperHyperGraph, there are at least one neutrosophic SuperHyperEdge. It’s necessary to mention that the word “Simple” is used as neutrosophic adjective for the initial neutrosophic SuperHyperGraph, induces there’s no neutrosophic appearance of the loop neutrosophic version of the neutrosophic SuperHyperEdge and this neutrosophic SuperHyperGraph is said to be loopless. The neutrosophic adjective “loop” on the basic neutrosophic framework engages one neutrosophic SuperHyperVertex but it never happens in this neutrosophic setting. With these neutrosophic bases, on a neutrosophic SuperHyperGraph, there’s at least one neutrosophic SuperHyperEdge thus there’s at least a neutrosophic R-SuperHyperMatching has the neutrosophic cardinality of a neutrosophic SuperHyperEdge. Thus, a neutrosophic R-SuperHyperMatching has the neutrosophic cardinality at least a neutrosophic SuperHyperEdge. Assume a neutrosophic SuperHyperSet
This neutrosophic SuperHyperSet isn’t a neutrosophic R-SuperHyperMatching since either the neutrosophic SuperHyperGraph is an obvious neutrosophic SuperHyperModel thus it never happens since there’s no neutrosophic usage of this neutrosophic framework and even more there’s no neutrosophic connection inside or the neutrosophic SuperHyperGraph isn’t obvious and as its consequences, there’s a neutrosophic contradiction with the term “neutrosophic R-SuperHyperMatching” since the maximum neutrosophic cardinality never happens for this neutrosophic style of the neutrosophic SuperHyperSet and beyond that there’s no neutrosophic connection inside as mentioned in first neutrosophic case in the forms of drawback for this selected neutrosophic SuperHyperSet. Let
Comes up. This neutrosophic case implies having the neutrosophic style of on-quasi-triangle neutrosophic style on the every neutrosophic elements of this neutrosophic SuperHyperSet. Precisely, the neutrosophic R-SuperHyperMatching is the neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices such that some neutrosophic amount of the neutrosophic SuperHyperVertices are on-quasi-triangle neutrosophic style. The neutrosophic cardinality of the v SuperHypeSet
Is the maximum in comparison to the neutrosophic SuperHyperSet
But the lower neutrosophic bound is up. Thus the minimum neutrosophic cardinality of the maximum neutrosophic cardinality ends up the neutrosophic discussion. The first neutrosophic term refers to the neutrosophic setting of the neutrosophic SuperHyperGraph but this key point is enough since there’s a neutrosophic SuperHyperClass of a neutrosophic SuperHyperGraph has no on-quasi-triangle neutrosophic style amid some amount of its neutrosophic SuperHyperVertices. This neutrosophic setting of the neutrosophic SuperHyperModel proposes a neutrosophic SuperHyperSet has only some amount neutrosophic SuperHyperVertices from one neutrosophic SuperHyperEdge such that there’s no neutrosophic amount of neutrosophic SuperHyperEdges more than one involving these some amount of these neutrosophic SuperHyperVertices. The neutrosophic cardinality of this neutrosophic SuperHyperSet is the maximum and the neutrosophic case is occurred in the minimum neutrosophic situation. To sum them up, the neutrosophic SuperHyperSet
Has the maximum neutrosophic cardinality such that
Contains some neutrosophic SuperHyperVertices such that there’s distinct-covers-order-amount neutrosophic SuperHyperEdges for amount of neutrosophic SuperHyperVertices taken from the neutrosophic SuperHyperSet
It means that the neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices
Is a neutrosophic R-SuperHyperMatching for the neutrosophic SuperHyperGraph as used neutrosophic background in the neutrosophic terms of worst neutrosophic case and the common theme of the lower neutrosophic bound occurred in the specific neutrosophic SuperHyperClasses of the neutrosophic SuperHyperGraphs which are neutrosophic free-quasi-triangle.
Assume a neutrosophic SuperHyperEdge
has
z neutrosophic number of the neutrosophic SuperHyperVertices. Then every neutrosophic SuperHyperVertex has at least no neutrosophic SuperHyperEdge with others in common. Thus those neutrosophic SuperHyperVertices have the eligibles to be contained in a neutrosophic R-SuperHyperMatching. Those neutrosophic SuperHyperVertices are potentially included in a neutrosophic style-R-SuperHyperMatching. Formally, consider
Are the neutrosophic SuperHyperVertices of a neutrosophic SuperHyperEdge
Thus
where the ∼ isn’t an equivalence relation but only the symmetric relation on the neutrosophic SuperHyperVertices of the neutrosophic SuperHyperGraph. The formal definition is as follows.
if and only if
and
are the neutrosophic SuperHyperVertices and there’s only and only one neutrosophic SuperHyperEdge
between the neutrosophic SuperHyperVertices
and
The other definition for the neutrosophic SuperHyperEdge
in the terms of neutrosophic R-SuperHyperMatching is
This definition coincides with the definition of the neutrosophic R-SuperHyperMatching but with slightly differences in the maximum neutrosophic cardinality amid those neutrosophic type-SuperHyperSets of the neutrosophic SuperHyperVertices. Thus the neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices,
and
is formalized with mathematical literatures on the neutrosophic R-SuperHyperMatching. Let
be defined as
and
are the neutrosophic SuperHyperVertices belong to the neutrosophic SuperHyperEdge
Thus,
Or
But with the slightly differences,
Thus
is a neutrosophic quasi-R-SuperHyperMatching where
is fixed that means
for all neutrosophic intended SuperHyperVertices but in a neutrosophic SuperHyperMatching,
could be different and it’s not unique. To sum them up, in a connected neutrosophic SuperHyperGraph
If a neutrosophic SuperHyperEdge
has
z neutrosophic SuperHyperVertices, then the neutrosophic cardinality of the neutrosophic R-SuperHyperMatching is at least
It’s straightforward that the neutrosophic cardinality of the neutrosophic R-SuperHyperMatching is at least the maximum neutrosophic number of neutrosophic SuperHyperVertices of the neutrosophic SuperHyperEdges with the maximum number of the neutrosophic SuperHyperEdges. In other words, the maximum number of the neutrosophic SuperHyperEdges contains the maximum neutrosophic number of neutrosophic SuperHyperVertices are renamed to neutrosophic SuperHyperMatching in some cases but the maximum number of the neutrosophic SuperHyperEdge with the maximum neutrosophic number of neutrosophic SuperHyperVertices, has the neutrosophic SuperHyperVertices are contained in a neutrosophic R-SuperHyperMatching.
The obvious SuperHyperGraph has no neutrosophic SuperHyperEdges. But the non-obvious neutrosophic SuperHyperModel is up. The quasi-SuperHyperModel addresses some issues about the neutrosophic optimal SuperHyperObject. It specially delivers some remarks on the neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices such that there’s distinct amount of neutrosophic SuperHyperEdges for distinct amount of neutrosophic SuperHyperVertices up to all taken from that neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices but this neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices is either has the maximum neutrosophic SuperHyperCardinality or it doesn’t have maximum neutrosophic SuperHyperCardinality. In a non-obvious SuperHyperModel, there’s at least one neutrosophic SuperHyperEdge containing at least all neutrosophic SuperHyperVertices. Thus it forms a neutrosophic quasi-R-SuperHyperMatching where the neutrosophic completion of the neutrosophic incidence is up in that. Thus it’s, literarily, a neutrosophic embedded R-SuperHyperMatching. The SuperHyperNotions of embedded SuperHyperSet and quasi-SuperHyperSet coincide. In the original setting, these types of SuperHyperSets only don’t satisfy on the maximum SuperHyperCardinality. Thus the embedded setting is elected such that those SuperHyperSets have the maximum neutrosophic SuperHyperCardinality and they’re neutrosophic SuperHyperOptimal. The less than two distinct types of neutrosophic SuperHyperVertices are included in the minimum neutrosophic style of the embedded neutrosophic R-SuperHyperMatching. The interior types of the neutrosophic SuperHyperVertices are deciders. Since the neutrosophic number of SuperHyperNeighbors are only affected by the interior neutrosophic SuperHyperVertices. The common connections, more precise and more formal, the perfect unique connections inside the neutrosophic SuperHyperSet for any distinct types of neutrosophic SuperHyperVertices pose the neutrosophic R-SuperHyperMatching. Thus neutrosophic exterior SuperHyperVertices could be used only in one neutrosophic SuperHyperEdge and in neutrosophic SuperHyperRelation with the interior neutrosophic SuperHyperVertices in that neutrosophic SuperHyperEdge. In the embedded neutrosophic SuperHyperMatching, there’s the usage of exterior neutrosophic SuperHyperVertices since they’ve more connections inside more than outside. Thus the title “exterior” is more relevant than the title “interior”. One neutrosophic SuperHyperVertex has no connection, inside. Thus, the neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices with one SuperHyperElement has been ignored in the exploring to lead on the optimal case implying the neutrosophic R-SuperHyperMatching. The neutrosophic R-SuperHyperMatching with the exclusion of the exclusion of all neutrosophic SuperHyperVertices in one neutrosophic SuperHyperEdge and with other terms, the neutrosophic R-SuperHyperMatching with the inclusion of all neutrosophic SuperHyperVertices in one neutrosophic SuperHyperEdge, is a neutrosophic quasi-R-SuperHyperMatching. To sum them up, in a connected non-obvious neutrosophic SuperHyperGraph There’s only one neutrosophic SuperHyperEdge has only the maximum possibilities of the distinct interior neutrosophic SuperHyperVertices inside of any given neutrosophic quasi-R-SuperHyperMatching minus all neutrosophic SuperHypeNeighbor to some of them but not all of them. In other words, there’s only an unique neutrosophic SuperHyperEdge has only two distinct neutrosophic SuperHyperVertices in an neutrosophic quasi-R-SuperHyperMatching, minus all neutrosophic SuperHypeNeighbor to some of them but not all of them.
The main definition of the neutrosophic R-SuperHyperMatching has two titles. a neutrosophic quasi-R-SuperHyperMatching and its corresponded quasi-maximum neutrosophic R-SuperHyperCardinality are two titles in the terms of quasi-R-styles. For any neutrosophic number, there’s a neutrosophic quasi-R-SuperHyperMatching with that quasi-maximum neutrosophic SuperHyperCardinality in the terms of the embedded neutrosophic SuperHyperGraph. If there’s an embedded neutrosophic SuperHyperGraph, then the neutrosophic quasi-SuperHyperNotions lead us to take the collection of all the neutrosophic quasi-R-SuperHyperMatchings for all neutrosophic numbers less than its neutrosophic corresponded maximum number. The essence of the neutrosophic SuperHyperMatching ends up but this essence starts up in the terms of the neutrosophic quasi-R-SuperHyperMatching, again and more in the operations of collecting all the neutrosophic quasi-R-SuperHyperMatchings acted on the all possible used formations of the neutrosophic SuperHyperGraph to achieve one neutrosophic number. This neutrosophic number is considered as the equivalence class for all corresponded quasi-R-SuperHyperMatchings. Let
and
be a neutrosophic number, a neutrosophic SuperHyperSet and a neutrosophic SuperHyperMatching. Then
As its consequences, the formal definition of the neutrosophic SuperHyperMatching is re-formalized and redefined as follows.
To get more precise perceptions, the follow-up expressions propose another formal technical definition for the neutrosophic SuperHyperMatching.
In more concise and more convenient ways, the modified definition for the neutrosophic SuperHyperMatching poses the upcoming expressions.
To translate the statement to this mathematical literature, the formulae will be revised.
And then,
To get more visions in the closer look-up, there’s an overall overlook.
Now, the extension of these types of approaches is up. Since the new term, “neutrosophic SuperHyperNeighborhood”, could be redefined as the collection of the neutrosophic SuperHyperVertices such that any amount of its neutrosophic SuperHyperVertices are incident to a neutrosophic SuperHyperEdge. It’s, literarily, another name for “neutrosophic Quasi-SuperHyperMatching” but, precisely, it’s the generalization of “neutrosophic Quasi-SuperHyperMatching” since “neutrosophic Quasi-SuperHyperMatching” happens “neutrosophic SuperHyperMatching” in a neutrosophic SuperHyperGraph as initial framework and background but “neutrosophic SuperHyperNeighborhood” may not happens “neutrosophic SuperHyperMatching” in a neutrosophic SuperHyperGraph as initial framework and preliminarily background since there are some ambiguities about the neutrosophic SuperHyperCardinality arise from it. To get orderly keywords, the terms, “neutrosophic SuperHyperNeighborhood”, “neutrosophic Quasi-SuperHyperMatching”, and “neutrosophic SuperHyperMatching” are up.
Thus, let
and
be a neutrosophic number, a neutrosophic SuperHyperNeighborhood and a neutrosophic SuperHyperMatching and the new terms are up.
And with go back to initial structure,
Thus, in a connected neutrosophic SuperHyperGraph
The all interior neutrosophic SuperHyperVertices belong to any neutrosophic quasi-R-SuperHyperMatching if for any of them, and any of other corresponded neutrosophic SuperHyperVertex, some interior neutrosophic SuperHyperVertices are mutually neutrosophic SuperHyperNeighbors with no neutrosophic exception at all minus all neutrosophic SuperHypeNeighbors to any amount of them.
To make sense with the precise words in the terms of “R-’, the follow-up illustrations are coming up. The following neutrosophic SuperHyperSet of neutrosophic SuperHyperVertices is the simple neutrosophic type-SuperHyperSet of the neutrosophic R-SuperHyperMatching.
The neutrosophic SuperHyperSet of neutrosophic SuperHyperVertices,
Is the simple neutrosophic type-SuperHyperSet of the neutrosophic R-SuperHyperMatching. The neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices,
Is an
neutrosophic R-SuperHyperMatching for an neutrosophic SuperHyperGraph
is a neutrosophic type-SuperHyperSet with
the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet
S of neutrosophic SuperHyperVertices such that there’s no a neutrosophic SuperHyperEdge amid some neutrosophic SuperHyperVertices instead of all given by
neutrosophic SuperHyperMatching is related to the neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices,
There’s
not only
one neutrosophic SuperHyperVertex
inside the intended neutrosophic SuperHyperSet. Thus the non-obvious neutrosophic SuperHyperMatching is up. The obvious simple neutrosophic type-SuperHyperSet called the neutrosophic SuperHyperMatching is a neutrosophic SuperHyperSet
includes only
one neutrosophic SuperHyperVertex. But the neutrosophic SuperHyperSet of neutrosophic SuperHyperVertices,
doesn’t have less than two SuperHyperVertices
inside the intended neutrosophic SuperHyperSet since they’ve come from at least so far an SuperHyperEdge. Thus the non-obvious simple neutrosophic type-SuperHyperSet of the neutrosophic R-SuperHyperMatching
is up. To sum them up, the neutrosophic SuperHyperSet of neutrosophic SuperHyperVertices,
Is the non-obvious simple neutrosophic type-SuperHyperSet of the neutrosophic R-SuperHyperMatching. Since the neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices,
or
is an neutrosophic R-SuperHyperMatching
for an neutrosophic SuperHyperGraph
is the neutrosophic SuperHyperSet
S of neutrosophic SuperHyperVertices such that there’s no a neutrosophic SuperHyperEdge for some neutrosophic SuperHyperVertices instead of all given by that neutrosophic type-SuperHyperSet called the neutrosophic SuperHyperMatching
and it’s an neutrosophic
SuperHyperMatching. Since it
’s the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet
S of neutrosophic SuperHyperVertices such that there’s no a neutrosophic SuperHyperEdge for some amount neutrosophic SuperHyperVertices instead of all given by that neutrosophic type-SuperHyperSet called the neutrosophic SuperHyperMatching. There isn’t only less than two neutrosophic SuperHyperVertices
inside the intended neutrosophic SuperHyperSet,
Thus the non-obvious neutrosophic R-SuperHyperMatching,
is up. The non-obvious simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching, not:
Is the neutrosophic SuperHyperSet, not:
does includes only less than two SuperHyperVertices in a connected neutrosophic SuperHyperGraph
but it’s impossible in the case, they’ve corresponded to an SuperHyperEdge. It’s interesting to mention that the only non-obvious simple neutrosophic type-SuperHyperSet called the
amid those obvious[non-obvious] simple neutrosophic type-SuperHyperSets called the
is only and only
In a connected neutrosophic SuperHyperGraph
with a illustrated SuperHyperModeling. It’s also, not only a neutrosophic free-triangle embedded SuperHyperModel and a neutrosophic on-triangle embedded SuperHyperModel but also it’s a neutrosophic stable embedded SuperHyperModel. But all only non-obvious simple neutrosophic type-SuperHyperSets of the neutrosophic R-SuperHyperMatching amid those obvious simple neutrosophic type-SuperHyperSets of the neutrosophic SuperHyperMatching, are
In a connected neutrosophic SuperHyperGraph
To sum them up, assume a connected loopless neutrosophic SuperHyperGraph
Then in the worst case, literally,
is a neutrosophic R-SuperHyperMatching. In other words, the least cardinality, the lower sharp bound for the cardinality, of a neutrosophic R-SuperHyperMatching is the cardinality of
To sum them up, in a connected neutrosophic SuperHyperGraph
The all interior neutrosophic SuperHyperVertices belong to any neutrosophic quasi-R-SuperHyperMatching if for any of them, and any of other corresponded neutrosophic SuperHyperVertex, some interior neutrosophic SuperHyperVertices are mutually neutrosophic SuperHyperNeighbors with no neutrosophic exception at all minus all neutrosophic SuperHypeNeighbors to any amount of them.
Assume a connected neutrosophic SuperHyperGraph Let a neutrosophic SuperHyperEdge has some neutrosophic SuperHyperVertices Consider all neutrosophic numbers of those neutrosophic SuperHyperVertices from that neutrosophic SuperHyperEdge excluding excluding more than r distinct neutrosophic SuperHyperVertices, exclude to any given neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices. Consider there’s a neutrosophic R-SuperHyperMatching with the least cardinality, the lower sharp neutrosophic bound for neutrosophic cardinality. Assume a connected neutrosophic SuperHyperGraph The neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices is a neutrosophic SuperHyperSet S of the neutrosophic SuperHyperVertices such that there’s a neutrosophic SuperHyperEdge to have some neutrosophic SuperHyperVertices uniquely but it isn’t a neutrosophic R-SuperHyperMatching. Since it doesn’t have the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet S of neutrosophic SuperHyperVertices such that there’s a neutrosophic SuperHyperEdge to have some SuperHyperVertices uniquely. The neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices is the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet S of neutrosophic SuperHyperVertices but it isn’t a neutrosophic R-SuperHyperMatching. Since it doesn’t do the neutrosophic procedure such that such that there’s a neutrosophic SuperHyperEdge to have some neutrosophic SuperHyperVertices uniquely [there are at least one neutrosophic SuperHyperVertex outside implying there’s, sometimes in the connected neutrosophic SuperHyperGraph a neutrosophic SuperHyperVertex, titled its neutrosophic SuperHyperNeighbor, to that neutrosophic SuperHyperVertex in the neutrosophic SuperHyperSet S so as S doesn’t do “the neutrosophic procedure”.]. There’s only one neutrosophic SuperHyperVertex outside the intended neutrosophic SuperHyperSet, in the terms of neutrosophic SuperHyperNeighborhood. Thus the obvious neutrosophic R-SuperHyperMatching, is up. The obvious simple neutrosophic type-SuperHyperSet of the neutrosophic R-SuperHyperMatching, is a neutrosophic SuperHyperSet, includes only all neutrosophic SuperHyperVertices does forms any kind of neutrosophic pairs are titled neutrosophic SuperHyperNeighbors in a connected neutrosophic SuperHyperGraph Since the neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices is the maximum neutrosophic SuperHyperCardinality of a neutrosophic SuperHyperSet S of neutrosophic SuperHyperVertices such that there’s a neutrosophic SuperHyperEdge to have some neutrosophic SuperHyperVertices uniquely. Thus, in a connected neutrosophic SuperHyperGraph Any neutrosophic R-SuperHyperMatching only contains all interior neutrosophic SuperHyperVertices and all exterior neutrosophic SuperHyperVertices from the unique neutrosophic SuperHyperEdge where there’s any of them has all possible neutrosophic SuperHyperNeighbors in and there’s all neutrosophic SuperHyperNeighborhoods in with no exception minus all neutrosophic SuperHypeNeighbors to some of them not all of them but everything is possible about neutrosophic SuperHyperNeighborhoods and neutrosophic SuperHyperNeighbors out.
The SuperHyperNotion, namely, SuperHyperMatching, is up. There’s neither empty SuperHyperEdge nor loop SuperHyperEdge. The following neutrosophic SuperHyperSet of neutrosophic SuperHyperEdges[SuperHyperVertices] is the simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching. The neutrosophic SuperHyperSet of neutrosophic SuperHyperEdges[SuperHyperVertices],
is the simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching. The neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices],
Is an
neutrosophic SuperHyperMatching for an neutrosophic SuperHyperGraph
is a neutrosophic type-SuperHyperSet with
the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet
S of neutrosophic SuperHyperEdges[SuperHyperVertices] such that there’s no neutrosophic SuperHyperVertex of a neutrosophic SuperHyperEdge is common and there’s an neutrosophic SuperHyperEdge for all neutrosophic SuperHyperVertices. There are
not only
two neutrosophic SuperHyperVertices
inside the intended neutrosophic SuperHyperSet. Thus the non-obvious neutrosophic SuperHyperMatching is up. The obvious simple neutrosophic type-SuperHyperSet called the neutrosophic SuperHyperMatching is a neutrosophic SuperHyperSet
includes only
two neutrosophic SuperHyperVertices. But the neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices],
Doesn’t have less than three SuperHyperVertices
inside the intended neutrosophic SuperHyperSet. Thus the non-obvious simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching
is up. To sum them up, the neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices],
Is the non-obvious simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching. Since the neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices],
Is an neutrosophic SuperHyperMatching
for an neutrosophic SuperHyperGraph
is the neutrosophic SuperHyperSet
S of neutrosophic SuperHyperVertices such that there’s no a neutrosophic SuperHyperEdge for some neutrosophic SuperHyperVertices given by that neutrosophic type-SuperHyperSet called the neutrosophic SuperHyperMatching
and it’s an neutrosophic
SuperHyperMatching. Since it
’s the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet
S of neutrosophic SuperHyperEdges[SuperHyperVertices] such that there’s no neutrosophic SuperHyperVertex of a neutrosophic SuperHyperEdge is common and there’s an neutrosophic SuperHyperEdge for all neutrosophic SuperHyperVertices. There aren’t only less than three neutrosophic SuperHyperVertices
inside the intended neutrosophic SuperHyperSet,
Thus the non-obvious neutrosophic SuperHyperMatching,
Is up. The obvious simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching, not:
Is the neutrosophic SuperHyperSet, not:
Does includes only less than three SuperHyperVertices in a connected neutrosophic SuperHyperGraph
It’s interesting to mention that the only non-obvious simple neutrosophic type-SuperHyperSet called the
amid those obvious[non-obvious] simple neutrosophic type-SuperHyperSets called the
is only and only
In a connected neutrosophic SuperHyperGraph
□
Example 18. In the Figure (
22), the connected neutrosophic SuperHyperCycle
is highlighted and featured. The obtained neutrosophic SuperHyperSet, in the neutrosophic SuperHyperModel (
22), is the neutrosophic SuperHyperMatching.
Proposition 19.
Assume a connected neutrosophic SuperHyperStar Then a neutrosophic quasi-R-SuperHyperMatching is a neutrosophic SuperHyperSet of the interior neutrosophic SuperHyperVertices, corresponded to a neutrosophic SuperHyperEdge. a neutrosophic quasi-R-SuperHyperMatching has the neutrosophic number of the neutrosophic cardinality of the one neutrosophic SuperHyperEdge. Also,
Proof. Assume a connected loopless neutrosophic SuperHyperGraph
The SuperHyperSet of the SuperHyperVertices
isn’t a quasi-R-SuperHyperMatching since neither amount of neutrosophic SuperHyperEdges nor amount of SuperHyperVertices where amount refers to the neutrosophic number of SuperHyperVertices(-/SuperHyperEdges) more than one to form any kind of SuperHyperEdges or any number of SuperHyperEdges. Let us consider the neutrosophic SuperHyperSet
This neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices has the eligibilities to propose property such that there’s no neutrosophic SuperHyperVertex of a neutrosophic SuperHyperEdge is common and there’s an neutrosophic SuperHyperEdge for all neutrosophic SuperHyperVertices but the maximum neutrosophic cardinality indicates that these neutrosophic type-SuperHyperSets couldn’t give us the neutrosophic lower bound in the term of neutrosophic sharpness. In other words, the neutrosophic SuperHyperSet
of the neutrosophic SuperHyperVertices implies at least on-quasi-triangle style is up but sometimes the neutrosophic SuperHyperSet
of the neutrosophic SuperHyperVertices is free-quasi-triangle and it doesn’t make a contradiction to the supposition on the connected loopless neutrosophic SuperHyperGraph
Thus the minimum case never happens in the generality of the connected loopless neutrosophic SuperHyperGraphs. Thus if we assume in the worst case, literally,
Is a quasi-R-SuperHyperMatching. In other words, the least cardinality, the lower sharp bound for the cardinality, of a quasi-R-SuperHyperMatching is the cardinality of
Then we’ve lost some connected loopless neutrosophic SuperHyperClasses of the connected loopless neutrosophic SuperHyperGraphs titled free-triangle, on-triangle, and their quasi-types but the SuperHyperStable is only up in this quasi-R-SuperHyperMatching. It’s the contradiction to that fact on the generality. There are some counterexamples to deny this statement. One of them comes from the setting of the graph titled path and cycle as the counterexamples-classes or reversely direction star as the examples-classes, are well-known classes in that setting and they could be considered as the examples-classes and counterexamples-classes for the tight bound of
Let
in mind. There’s no necessity on the SuperHyperEdge since we need at least two SuperHyperVertices to form a SuperHyperEdge. It doesn’t withdraw the principles of the main definition since there’s no condition to be satisfied but the condition is on the existence of the SuperHyperEdge instead of acting on the SuperHyperVertices. In other words, if there’s a SuperHyperEdge, then the neutrosophic SuperHyperSet has the necessary condition for the intended definition to be applied. Thus the
is withdrawn not by the conditions of the main definition but by the necessity of the pre-condition on the usage of the main definition.
The neutrosophic structure of the neutrosophic R-SuperHyperMatching decorates the neutrosophic SuperHyperVertices don’t have received any neutrosophic connections so as this neutrosophic style implies different versions of neutrosophic SuperHyperEdges with the maximum neutrosophic cardinality in the terms of neutrosophic SuperHyperVertices are spotlight. The lower neutrosophic bound is to have the maximum neutrosophic groups of neutrosophic SuperHyperVertices have perfect neutrosophic connections inside each of SuperHyperEdges and the outside of this neutrosophic SuperHyperSet doesn’t matter but regarding the connectedness of the used neutrosophic SuperHyperGraph arising from its neutrosophic properties taken from the fact that it’s simple. If there’s no more than one neutrosophic SuperHyperVertex in the targeted neutrosophic SuperHyperSet, then there’s no neutrosophic connection. Furthermore, the neutrosophic existence of one neutrosophic SuperHyperVertex has no neutrosophic effect to talk about the neutrosophic R-SuperHyperMatching. Since at least two neutrosophic SuperHyperVertices involve to make a title in the neutrosophic background of the neutrosophic SuperHyperGraph. The neutrosophic SuperHyperGraph is obvious if it has no neutrosophic SuperHyperEdge but at least two neutrosophic SuperHyperVertices make the neutrosophic version of neutrosophic SuperHyperEdge. Thus in the neutrosophic setting of non-obvious neutrosophic SuperHyperGraph, there are at least one neutrosophic SuperHyperEdge. It’s necessary to mention that the word “Simple” is used as neutrosophic adjective for the initial neutrosophic SuperHyperGraph, induces there’s no neutrosophic appearance of the loop neutrosophic version of the neutrosophic SuperHyperEdge and this neutrosophic SuperHyperGraph is said to be loopless. The neutrosophic adjective “loop” on the basic neutrosophic framework engages one neutrosophic SuperHyperVertex but it never happens in this neutrosophic setting. With these neutrosophic bases, on a neutrosophic SuperHyperGraph, there’s at least one neutrosophic SuperHyperEdge thus there’s at least a neutrosophic R-SuperHyperMatching has the neutrosophic cardinality of a neutrosophic SuperHyperEdge. Thus, a neutrosophic R-SuperHyperMatching has the neutrosophic cardinality at least a neutrosophic SuperHyperEdge. Assume a neutrosophic SuperHyperSet
This neutrosophic SuperHyperSet isn’t a neutrosophic R-SuperHyperMatching since either the neutrosophic SuperHyperGraph is an obvious neutrosophic SuperHyperModel thus it never happens since there’s no neutrosophic usage of this neutrosophic framework and even more there’s no neutrosophic connection inside or the neutrosophic SuperHyperGraph isn’t obvious and as its consequences, there’s a neutrosophic contradiction with the term “neutrosophic R-SuperHyperMatching” since the maximum neutrosophic cardinality never happens for this neutrosophic style of the neutrosophic SuperHyperSet and beyond that there’s no neutrosophic connection inside as mentioned in first neutrosophic case in the forms of drawback for this selected neutrosophic SuperHyperSet. Let
Comes up. This neutrosophic case implies having the neutrosophic style of on-quasi-triangle neutrosophic style on the every neutrosophic elements of this neutrosophic SuperHyperSet. Precisely, the neutrosophic R-SuperHyperMatching is the neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices such that some neutrosophic amount of the neutrosophic SuperHyperVertices are on-quasi-triangle neutrosophic style. The neutrosophic cardinality of the v SuperHypeSet
Is the maximum in comparison to the neutrosophic SuperHyperSet
But the lower neutrosophic bound is up. Thus the minimum neutrosophic cardinality of the maximum neutrosophic cardinality ends up the neutrosophic discussion. The first neutrosophic term refers to the neutrosophic setting of the neutrosophic SuperHyperGraph but this key point is enough since there’s a neutrosophic SuperHyperClass of a neutrosophic SuperHyperGraph has no on-quasi-triangle neutrosophic style amid some amount of its neutrosophic SuperHyperVertices. This neutrosophic setting of the neutrosophic SuperHyperModel proposes a neutrosophic SuperHyperSet has only some amount neutrosophic SuperHyperVertices from one neutrosophic SuperHyperEdge such that there’s no neutrosophic amount of neutrosophic SuperHyperEdges more than one involving these some amount of these neutrosophic SuperHyperVertices. The neutrosophic cardinality of this neutrosophic SuperHyperSet is the maximum and the neutrosophic case is occurred in the minimum neutrosophic situation. To sum them up, the neutrosophic SuperHyperSet
Has the maximum neutrosophic cardinality such that
Contains some neutrosophic SuperHyperVertices such that there’s distinct-covers-order-amount neutrosophic SuperHyperEdges for amount of neutrosophic SuperHyperVertices taken from the neutrosophic SuperHyperSet
It means that the neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices
Is a neutrosophic R-SuperHyperMatching for the neutrosophic SuperHyperGraph as used neutrosophic background in the neutrosophic terms of worst neutrosophic case and the common theme of the lower neutrosophic bound occurred in the specific neutrosophic SuperHyperClasses of the neutrosophic SuperHyperGraphs which are neutrosophic free-quasi-triangle.
Assume a neutrosophic SuperHyperEdge
has
z neutrosophic number of the neutrosophic SuperHyperVertices. Then every neutrosophic SuperHyperVertex has at least no neutrosophic SuperHyperEdge with others in common. Thus those neutrosophic SuperHyperVertices have the eligibles to be contained in a neutrosophic R-SuperHyperMatching. Those neutrosophic SuperHyperVertices are potentially included in a neutrosophic style-R-SuperHyperMatching. Formally, consider
Are the neutrosophic SuperHyperVertices of a neutrosophic SuperHyperEdge
Thus
where the ∼ isn’t an equivalence relation but only the symmetric relation on the neutrosophic SuperHyperVertices of the neutrosophic SuperHyperGraph. The formal definition is as follows.
if and only if
and
are the neutrosophic SuperHyperVertices and there’s only and only one neutrosophic SuperHyperEdge
between the neutrosophic SuperHyperVertices
and
The other definition for the neutrosophic SuperHyperEdge
in the terms of neutrosophic R-SuperHyperMatching is
This definition coincides with the definition of the neutrosophic R-SuperHyperMatching but with slightly differences in the maximum neutrosophic cardinality amid those neutrosophic type-SuperHyperSets of the neutrosophic SuperHyperVertices. Thus the neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices,
and
is formalized with mathematical literatures on the neutrosophic R-SuperHyperMatching. Let
be defined as
and
are the neutrosophic SuperHyperVertices belong to the neutrosophic SuperHyperEdge
Thus,
Or
But with the slightly differences,
Thus
is a neutrosophic quasi-R-SuperHyperMatching where
is fixed that means
for all neutrosophic intended SuperHyperVertices but in a neutrosophic SuperHyperMatching,
could be different and it’s not unique. To sum them up, in a connected neutrosophic SuperHyperGraph
If a neutrosophic SuperHyperEdge
has
z neutrosophic SuperHyperVertices, then the neutrosophic cardinality of the neutrosophic R-SuperHyperMatching is at least
It’s straightforward that the neutrosophic cardinality of the neutrosophic R-SuperHyperMatching is at least the maximum neutrosophic number of neutrosophic SuperHyperVertices of the neutrosophic SuperHyperEdges with the maximum number of the neutrosophic SuperHyperEdges. In other words, the maximum number of the neutrosophic SuperHyperEdges contains the maximum neutrosophic number of neutrosophic SuperHyperVertices are renamed to neutrosophic SuperHyperMatching in some cases but the maximum number of the neutrosophic SuperHyperEdge with the maximum neutrosophic number of neutrosophic SuperHyperVertices, has the neutrosophic SuperHyperVertices are contained in a neutrosophic R-SuperHyperMatching.
The obvious SuperHyperGraph has no neutrosophic SuperHyperEdges. But the non-obvious neutrosophic SuperHyperModel is up. The quasi-SuperHyperModel addresses some issues about the neutrosophic optimal SuperHyperObject. It specially delivers some remarks on the neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices such that there’s distinct amount of neutrosophic SuperHyperEdges for distinct amount of neutrosophic SuperHyperVertices up to all taken from that neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices but this neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices is either has the maximum neutrosophic SuperHyperCardinality or it doesn’t have maximum neutrosophic SuperHyperCardinality. In a non-obvious SuperHyperModel, there’s at least one neutrosophic SuperHyperEdge containing at least all neutrosophic SuperHyperVertices. Thus it forms a neutrosophic quasi-R-SuperHyperMatching where the neutrosophic completion of the neutrosophic incidence is up in that. Thus it’s, literarily, a neutrosophic embedded R-SuperHyperMatching. The SuperHyperNotions of embedded SuperHyperSet and quasi-SuperHyperSet coincide. In the original setting, these types of SuperHyperSets only don’t satisfy on the maximum SuperHyperCardinality. Thus the embedded setting is elected such that those SuperHyperSets have the maximum neutrosophic SuperHyperCardinality and they’re neutrosophic SuperHyperOptimal. The less than two distinct types of neutrosophic SuperHyperVertices are included in the minimum neutrosophic style of the embedded neutrosophic R-SuperHyperMatching. The interior types of the neutrosophic SuperHyperVertices are deciders. Since the neutrosophic number of SuperHyperNeighbors are only affected by the interior neutrosophic SuperHyperVertices. The common connections, more precise and more formal, the perfect unique connections inside the neutrosophic SuperHyperSet for any distinct types of neutrosophic SuperHyperVertices pose the neutrosophic R-SuperHyperMatching. Thus neutrosophic exterior SuperHyperVertices could be used only in one neutrosophic SuperHyperEdge and in neutrosophic SuperHyperRelation with the interior neutrosophic SuperHyperVertices in that neutrosophic SuperHyperEdge. In the embedded neutrosophic SuperHyperMatching, there’s the usage of exterior neutrosophic SuperHyperVertices since they’ve more connections inside more than outside. Thus the title “exterior” is more relevant than the title “interior”. One neutrosophic SuperHyperVertex has no connection, inside. Thus, the neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices with one SuperHyperElement has been ignored in the exploring to lead on the optimal case implying the neutrosophic R-SuperHyperMatching. The neutrosophic R-SuperHyperMatching with the exclusion of the exclusion of all neutrosophic SuperHyperVertices in one neutrosophic SuperHyperEdge and with other terms, the neutrosophic R-SuperHyperMatching with the inclusion of all neutrosophic SuperHyperVertices in one neutrosophic SuperHyperEdge, is a neutrosophic quasi-R-SuperHyperMatching. To sum them up, in a connected non-obvious neutrosophic SuperHyperGraph There’s only one neutrosophic SuperHyperEdge has only the maximum possibilities of the distinct interior neutrosophic SuperHyperVertices inside of any given neutrosophic quasi-R-SuperHyperMatching minus all neutrosophic SuperHypeNeighbor to some of them but not all of them. In other words, there’s only an unique neutrosophic SuperHyperEdge has only two distinct neutrosophic SuperHyperVertices in an neutrosophic quasi-R-SuperHyperMatching, minus all neutrosophic SuperHypeNeighbor to some of them but not all of them.
The main definition of the neutrosophic R-SuperHyperMatching has two titles. a neutrosophic quasi-R-SuperHyperMatching and its corresponded quasi-maximum neutrosophic R-SuperHyperCardinality are two titles in the terms of quasi-R-styles. For any neutrosophic number, there’s a neutrosophic quasi-R-SuperHyperMatching with that quasi-maximum neutrosophic SuperHyperCardinality in the terms of the embedded neutrosophic SuperHyperGraph. If there’s an embedded neutrosophic SuperHyperGraph, then the neutrosophic quasi-SuperHyperNotions lead us to take the collection of all the neutrosophic quasi-R-SuperHyperMatchings for all neutrosophic numbers less than its neutrosophic corresponded maximum number. The essence of the neutrosophic SuperHyperMatching ends up but this essence starts up in the terms of the neutrosophic quasi-R-SuperHyperMatching, again and more in the operations of collecting all the neutrosophic quasi-R-SuperHyperMatchings acted on the all possible used formations of the neutrosophic SuperHyperGraph to achieve one neutrosophic number. This neutrosophic number is considered as the equivalence class for all corresponded quasi-R-SuperHyperMatchings. Let
and
be a neutrosophic number, a neutrosophic SuperHyperSet and a neutrosophic SuperHyperMatching. Then
As its consequences, the formal definition of the neutrosophic SuperHyperMatching is re-formalized and redefined as follows.
To get more precise perceptions, the follow-up expressions propose another formal technical definition for the neutrosophic SuperHyperMatching.
In more concise and more convenient ways, the modified definition for the neutrosophic SuperHyperMatching poses the upcoming expressions.
To translate the statement to this mathematical literature, the formulae will be revised.
And then,
To get more visions in the closer look-up, there’s an overall overlook.
Now, the extension of these types of approaches is up. Since the new term, “neutrosophic SuperHyperNeighborhood”, could be redefined as the collection of the neutrosophic SuperHyperVertices such that any amount of its neutrosophic SuperHyperVertices are incident to a neutrosophic SuperHyperEdge. It’s, literarily, another name for “neutrosophic Quasi-SuperHyperMatching” but, precisely, it’s the generalization of “neutrosophic Quasi-SuperHyperMatching” since “neutrosophic Quasi-SuperHyperMatching” happens “neutrosophic SuperHyperMatching” in a neutrosophic SuperHyperGraph as initial framework and background but “neutrosophic SuperHyperNeighborhood” may not happens “neutrosophic SuperHyperMatching” in a neutrosophic SuperHyperGraph as initial framework and preliminarily background since there are some ambiguities about the neutrosophic SuperHyperCardinality arise from it. To get orderly keywords, the terms, “neutrosophic SuperHyperNeighborhood”, “neutrosophic Quasi-SuperHyperMatching”, and “neutrosophic SuperHyperMatching” are up.
Thus, let
and
be a neutrosophic number, a neutrosophic SuperHyperNeighborhood and a neutrosophic SuperHyperMatching and the new terms are up.
And with go back to initial structure,
Thus, in a connected neutrosophic SuperHyperGraph
The all interior neutrosophic SuperHyperVertices belong to any neutrosophic quasi-R-SuperHyperMatching if for any of them, and any of other corresponded neutrosophic SuperHyperVertex, some interior neutrosophic SuperHyperVertices are mutually neutrosophic SuperHyperNeighbors with no neutrosophic exception at all minus all neutrosophic SuperHypeNeighbors to any amount of them.
To make sense with the precise words in the terms of “R-’, the follow-up illustrations are coming up. The following neutrosophic SuperHyperSet of neutrosophic SuperHyperVertices is the simple neutrosophic type-SuperHyperSet of the neutrosophic R-SuperHyperMatching.
The neutrosophic SuperHyperSet of neutrosophic SuperHyperVertices,
Is the simple neutrosophic type-SuperHyperSet of the neutrosophic R-SuperHyperMatching. The neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices,
Is an
neutrosophic R-SuperHyperMatching for an neutrosophic SuperHyperGraph
is a neutrosophic type-SuperHyperSet with
the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet
S of neutrosophic SuperHyperVertices such that there’s no a neutrosophic SuperHyperEdge amid some neutrosophic SuperHyperVertices instead of all given by
neutrosophic SuperHyperMatching is related to the neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices,
There’s
not only
one neutrosophic SuperHyperVertex
inside the intended neutrosophic SuperHyperSet. Thus the non-obvious neutrosophic SuperHyperMatching is up. The obvious simple neutrosophic type-SuperHyperSet called the neutrosophic SuperHyperMatching is a neutrosophic SuperHyperSet
includes only
one neutrosophic SuperHyperVertex. But the neutrosophic SuperHyperSet of neutrosophic SuperHyperVertices,
doesn’t have less than two SuperHyperVertices
inside the intended neutrosophic SuperHyperSet since they’ve come from at least so far an SuperHyperEdge. Thus the non-obvious simple neutrosophic type-SuperHyperSet of the neutrosophic R-SuperHyperMatching
is up. To sum them up, the neutrosophic SuperHyperSet of neutrosophic SuperHyperVertices,
Is the non-obvious simple neutrosophic type-SuperHyperSet of the neutrosophic R-SuperHyperMatching. Since the neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices,
or
is an neutrosophic R-SuperHyperMatching
for an neutrosophic SuperHyperGraph
is the neutrosophic SuperHyperSet
S of neutrosophic SuperHyperVertices such that there’s no a neutrosophic SuperHyperEdge for some neutrosophic SuperHyperVertices instead of all given by that neutrosophic type-SuperHyperSet called the neutrosophic SuperHyperMatching
and it’s an neutrosophic
SuperHyperMatching. Since it
’s the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet
S of neutrosophic SuperHyperVertices such that there’s no a neutrosophic SuperHyperEdge for some amount neutrosophic SuperHyperVertices instead of all given by that neutrosophic type-SuperHyperSet called the neutrosophic SuperHyperMatching. There isn’t only less than two neutrosophic SuperHyperVertices
inside the intended neutrosophic SuperHyperSet,
Thus the non-obvious neutrosophic R-SuperHyperMatching,
is up. The non-obvious simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching, not:
Is the neutrosophic SuperHyperSet, not:
does includes only less than two SuperHyperVertices in a connected neutrosophic SuperHyperGraph
but it’s impossible in the case, they’ve corresponded to an SuperHyperEdge. It’s interesting to mention that the only non-obvious simple neutrosophic type-SuperHyperSet called the
amid those obvious[non-obvious] simple neutrosophic type-SuperHyperSets called the
is only and only
In a connected neutrosophic SuperHyperGraph
with a illustrated SuperHyperModeling. It’s also, not only a neutrosophic free-triangle embedded SuperHyperModel and a neutrosophic on-triangle embedded SuperHyperModel but also it’s a neutrosophic stable embedded SuperHyperModel. But all only non-obvious simple neutrosophic type-SuperHyperSets of the neutrosophic R-SuperHyperMatching amid those obvious simple neutrosophic type-SuperHyperSets of the neutrosophic SuperHyperMatching, are
In a connected neutrosophic SuperHyperGraph
To sum them up, assume a connected loopless neutrosophic SuperHyperGraph
Then in the worst case, literally,
is a neutrosophic R-SuperHyperMatching. In other words, the least cardinality, the lower sharp bound for the cardinality, of a neutrosophic R-SuperHyperMatching is the cardinality of
To sum them up, in a connected neutrosophic SuperHyperGraph
The all interior neutrosophic SuperHyperVertices belong to any neutrosophic quasi-R-SuperHyperMatching if for any of them, and any of other corresponded neutrosophic SuperHyperVertex, some interior neutrosophic SuperHyperVertices are mutually neutrosophic SuperHyperNeighbors with no neutrosophic exception at all minus all neutrosophic SuperHypeNeighbors to any amount of them.
Assume a connected neutrosophic SuperHyperGraph Let a neutrosophic SuperHyperEdge has some neutrosophic SuperHyperVertices Consider all neutrosophic numbers of those neutrosophic SuperHyperVertices from that neutrosophic SuperHyperEdge excluding excluding more than r distinct neutrosophic SuperHyperVertices, exclude to any given neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices. Consider there’s a neutrosophic R-SuperHyperMatching with the least cardinality, the lower sharp neutrosophic bound for neutrosophic cardinality. Assume a connected neutrosophic SuperHyperGraph The neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices is a neutrosophic SuperHyperSet S of the neutrosophic SuperHyperVertices such that there’s a neutrosophic SuperHyperEdge to have some neutrosophic SuperHyperVertices uniquely but it isn’t a neutrosophic R-SuperHyperMatching. Since it doesn’t have the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet S of neutrosophic SuperHyperVertices such that there’s a neutrosophic SuperHyperEdge to have some SuperHyperVertices uniquely. The neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices is the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet S of neutrosophic SuperHyperVertices but it isn’t a neutrosophic R-SuperHyperMatching. Since it doesn’t do the neutrosophic procedure such that such that there’s a neutrosophic SuperHyperEdge to have some neutrosophic SuperHyperVertices uniquely [there are at least one neutrosophic SuperHyperVertex outside implying there’s, sometimes in the connected neutrosophic SuperHyperGraph a neutrosophic SuperHyperVertex, titled its neutrosophic SuperHyperNeighbor, to that neutrosophic SuperHyperVertex in the neutrosophic SuperHyperSet S so as S doesn’t do “the neutrosophic procedure”.]. There’s only one neutrosophic SuperHyperVertex outside the intended neutrosophic SuperHyperSet, in the terms of neutrosophic SuperHyperNeighborhood. Thus the obvious neutrosophic R-SuperHyperMatching, is up. The obvious simple neutrosophic type-SuperHyperSet of the neutrosophic R-SuperHyperMatching, is a neutrosophic SuperHyperSet, includes only all neutrosophic SuperHyperVertices does forms any kind of neutrosophic pairs are titled neutrosophic SuperHyperNeighbors in a connected neutrosophic SuperHyperGraph Since the neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices is the maximum neutrosophic SuperHyperCardinality of a neutrosophic SuperHyperSet S of neutrosophic SuperHyperVertices such that there’s a neutrosophic SuperHyperEdge to have some neutrosophic SuperHyperVertices uniquely. Thus, in a connected neutrosophic SuperHyperGraph Any neutrosophic R-SuperHyperMatching only contains all interior neutrosophic SuperHyperVertices and all exterior neutrosophic SuperHyperVertices from the unique neutrosophic SuperHyperEdge where there’s any of them has all possible neutrosophic SuperHyperNeighbors in and there’s all neutrosophic SuperHyperNeighborhoods in with no exception minus all neutrosophic SuperHypeNeighbors to some of them not all of them but everything is possible about neutrosophic SuperHyperNeighborhoods and neutrosophic SuperHyperNeighbors out.
The SuperHyperNotion, namely, SuperHyperMatching, is up. There’s neither empty SuperHyperEdge nor loop SuperHyperEdge. The following neutrosophic SuperHyperSet of neutrosophic SuperHyperEdges[SuperHyperVertices] is the simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching. The neutrosophic SuperHyperSet of neutrosophic SuperHyperEdges[SuperHyperVertices],
is the simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching. The neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices],
Is an
neutrosophic SuperHyperMatching for an neutrosophic SuperHyperGraph
is a neutrosophic type-SuperHyperSet with
the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet
S of neutrosophic SuperHyperEdges[SuperHyperVertices] such that there’s no neutrosophic SuperHyperVertex of a neutrosophic SuperHyperEdge is common and there’s an neutrosophic SuperHyperEdge for all neutrosophic SuperHyperVertices. There are
not only
two neutrosophic SuperHyperVertices
inside the intended neutrosophic SuperHyperSet. Thus the non-obvious neutrosophic SuperHyperMatching is up. The obvious simple neutrosophic type-SuperHyperSet called the neutrosophic SuperHyperMatching is a neutrosophic SuperHyperSet
includes only
two neutrosophic SuperHyperVertices. But the neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices],
Doesn’t have less than three SuperHyperVertices
inside the intended neutrosophic SuperHyperSet. Thus the non-obvious simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching
is up. To sum them up, the neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices],
Is the non-obvious simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching. Since the neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices],
Is an neutrosophic SuperHyperMatching
for an neutrosophic SuperHyperGraph
is the neutrosophic SuperHyperSet
S of neutrosophic SuperHyperVertices such that there’s no a neutrosophic SuperHyperEdge for some neutrosophic SuperHyperVertices given by that neutrosophic type-SuperHyperSet called the neutrosophic SuperHyperMatching
and it’s an neutrosophic
SuperHyperMatching. Since it
’s the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet
S of neutrosophic SuperHyperEdges[SuperHyperVertices] such that there’s no neutrosophic SuperHyperVertex of a neutrosophic SuperHyperEdge is common and there’s an neutrosophic SuperHyperEdge for all neutrosophic SuperHyperVertices. There aren’t only less than three neutrosophic SuperHyperVertices
inside the intended neutrosophic SuperHyperSet,
Thus the non-obvious neutrosophic SuperHyperMatching,
Is up. The obvious simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching, not:
Is the neutrosophic SuperHyperSet, not:
Does includes only less than three SuperHyperVertices in a connected neutrosophic SuperHyperGraph
It’s interesting to mention that the only non-obvious simple neutrosophic type-SuperHyperSet called the
amid those obvious[non-obvious] simple neutrosophic type-SuperHyperSets called the
is only and only
In a connected neutrosophic SuperHyperGraph
□
Example 20. In the Figure (
23), the connected neutrosophic SuperHyperStar
is highlighted and featured. The obtained neutrosophic SuperHyperSet, by the Algorithm in previous neutrosophic result, of the neutrosophic SuperHyperVertices of the connected neutrosophic SuperHyperStar
in the neutrosophic SuperHyperModel (
23), is the neutrosophic SuperHyperMatching.
Proposition 21.
Assume a connected neutrosophic SuperHyperBipartite Then a neutrosophic R-SuperHyperMatching is a neutrosophic SuperHyperSet of the interior neutrosophic SuperHyperVertices with no neutrosophic exceptions in the form of interior neutrosophic SuperHyperVertices titled neutrosophic SuperHyperNeighbors. a neutrosophic R-SuperHyperMatching has the neutrosophic maximum number of on neutrosophic cardinality of the minimum SuperHyperPart minus those have common neutrosophic SuperHyperNeighbors and not unique neutrosophic SuperHyperNeighbors. Also,
Proof. Assume a connected loopless neutrosophic SuperHyperGraph
The SuperHyperSet of the SuperHyperVertices
isn’t a quasi-R-SuperHyperMatching since neither amount of neutrosophic SuperHyperEdges nor amount of SuperHyperVertices where amount refers to the neutrosophic number of SuperHyperVertices(-/SuperHyperEdges) more than one to form any kind of SuperHyperEdges or any number of SuperHyperEdges. Let us consider the neutrosophic SuperHyperSet
This neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices has the eligibilities to propose property such that there’s no neutrosophic SuperHyperVertex of a neutrosophic SuperHyperEdge is common and there’s an neutrosophic SuperHyperEdge for all neutrosophic SuperHyperVertices but the maximum neutrosophic cardinality indicates that these neutrosophic type-SuperHyperSets couldn’t give us the neutrosophic lower bound in the term of neutrosophic sharpness. In other words, the neutrosophic SuperHyperSet
of the neutrosophic SuperHyperVertices implies at least on-quasi-triangle style is up but sometimes the neutrosophic SuperHyperSet
of the neutrosophic SuperHyperVertices is free-quasi-triangle and it doesn’t make a contradiction to the supposition on the connected loopless neutrosophic SuperHyperGraph
Thus the minimum case never happens in the generality of the connected loopless neutrosophic SuperHyperGraphs. Thus if we assume in the worst case, literally,
Is a quasi-R-SuperHyperMatching. In other words, the least cardinality, the lower sharp bound for the cardinality, of a quasi-R-SuperHyperMatching is the cardinality of
Then we’ve lost some connected loopless neutrosophic SuperHyperClasses of the connected loopless neutrosophic SuperHyperGraphs titled free-triangle, on-triangle, and their quasi-types but the SuperHyperStable is only up in this quasi-R-SuperHyperMatching. It’s the contradiction to that fact on the generality. There are some counterexamples to deny this statement. One of them comes from the setting of the graph titled path and cycle as the counterexamples-classes or reversely direction star as the examples-classes, are well-known classes in that setting and they could be considered as the examples-classes and counterexamples-classes for the tight bound of
Let
in mind. There’s no necessity on the SuperHyperEdge since we need at least two SuperHyperVertices to form a SuperHyperEdge. It doesn’t withdraw the principles of the main definition since there’s no condition to be satisfied but the condition is on the existence of the SuperHyperEdge instead of acting on the SuperHyperVertices. In other words, if there’s a SuperHyperEdge, then the neutrosophic SuperHyperSet has the necessary condition for the intended definition to be applied. Thus the
is withdrawn not by the conditions of the main definition but by the necessity of the pre-condition on the usage of the main definition.
The neutrosophic structure of the neutrosophic R-SuperHyperMatching decorates the neutrosophic SuperHyperVertices don’t have received any neutrosophic connections so as this neutrosophic style implies different versions of neutrosophic SuperHyperEdges with the maximum neutrosophic cardinality in the terms of neutrosophic SuperHyperVertices are spotlight. The lower neutrosophic bound is to have the maximum neutrosophic groups of neutrosophic SuperHyperVertices have perfect neutrosophic connections inside each of SuperHyperEdges and the outside of this neutrosophic SuperHyperSet doesn’t matter but regarding the connectedness of the used neutrosophic SuperHyperGraph arising from its neutrosophic properties taken from the fact that it’s simple. If there’s no more than one neutrosophic SuperHyperVertex in the targeted neutrosophic SuperHyperSet, then there’s no neutrosophic connection. Furthermore, the neutrosophic existence of one neutrosophic SuperHyperVertex has no neutrosophic effect to talk about the neutrosophic R-SuperHyperMatching. Since at least two neutrosophic SuperHyperVertices involve to make a title in the neutrosophic background of the neutrosophic SuperHyperGraph. The neutrosophic SuperHyperGraph is obvious if it has no neutrosophic SuperHyperEdge but at least two neutrosophic SuperHyperVertices make the neutrosophic version of neutrosophic SuperHyperEdge. Thus in the neutrosophic setting of non-obvious neutrosophic SuperHyperGraph, there are at least one neutrosophic SuperHyperEdge. It’s necessary to mention that the word “Simple” is used as neutrosophic adjective for the initial neutrosophic SuperHyperGraph, induces there’s no neutrosophic appearance of the loop neutrosophic version of the neutrosophic SuperHyperEdge and this neutrosophic SuperHyperGraph is said to be loopless. The neutrosophic adjective “loop” on the basic neutrosophic framework engages one neutrosophic SuperHyperVertex but it never happens in this neutrosophic setting. With these neutrosophic bases, on a neutrosophic SuperHyperGraph, there’s at least one neutrosophic SuperHyperEdge thus there’s at least a neutrosophic R-SuperHyperMatching has the neutrosophic cardinality of a neutrosophic SuperHyperEdge. Thus, a neutrosophic R-SuperHyperMatching has the neutrosophic cardinality at least a neutrosophic SuperHyperEdge. Assume a neutrosophic SuperHyperSet
This neutrosophic SuperHyperSet isn’t a neutrosophic R-SuperHyperMatching since either the neutrosophic SuperHyperGraph is an obvious neutrosophic SuperHyperModel thus it never happens since there’s no neutrosophic usage of this neutrosophic framework and even more there’s no neutrosophic connection inside or the neutrosophic SuperHyperGraph isn’t obvious and as its consequences, there’s a neutrosophic contradiction with the term “neutrosophic R-SuperHyperMatching” since the maximum neutrosophic cardinality never happens for this neutrosophic style of the neutrosophic SuperHyperSet and beyond that there’s no neutrosophic connection inside as mentioned in first neutrosophic case in the forms of drawback for this selected neutrosophic SuperHyperSet. Let
Comes up. This neutrosophic case implies having the neutrosophic style of on-quasi-triangle neutrosophic style on the every neutrosophic elements of this neutrosophic SuperHyperSet. Precisely, the neutrosophic R-SuperHyperMatching is the neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices such that some neutrosophic amount of the neutrosophic SuperHyperVertices are on-quasi-triangle neutrosophic style. The neutrosophic cardinality of the v SuperHypeSet
Is the maximum in comparison to the neutrosophic SuperHyperSet
But the lower neutrosophic bound is up. Thus the minimum neutrosophic cardinality of the maximum neutrosophic cardinality ends up the neutrosophic discussion. The first neutrosophic term refers to the neutrosophic setting of the neutrosophic SuperHyperGraph but this key point is enough since there’s a neutrosophic SuperHyperClass of a neutrosophic SuperHyperGraph has no on-quasi-triangle neutrosophic style amid some amount of its neutrosophic SuperHyperVertices. This neutrosophic setting of the neutrosophic SuperHyperModel proposes a neutrosophic SuperHyperSet has only some amount neutrosophic SuperHyperVertices from one neutrosophic SuperHyperEdge such that there’s no neutrosophic amount of neutrosophic SuperHyperEdges more than one involving these some amount of these neutrosophic SuperHyperVertices. The neutrosophic cardinality of this neutrosophic SuperHyperSet is the maximum and the neutrosophic case is occurred in the minimum neutrosophic situation. To sum them up, the neutrosophic SuperHyperSet
Has the maximum neutrosophic cardinality such that
Contains some neutrosophic SuperHyperVertices such that there’s distinct-covers-order-amount neutrosophic SuperHyperEdges for amount of neutrosophic SuperHyperVertices taken from the neutrosophic SuperHyperSet
It means that the neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices
Is a neutrosophic R-SuperHyperMatching for the neutrosophic SuperHyperGraph as used neutrosophic background in the neutrosophic terms of worst neutrosophic case and the common theme of the lower neutrosophic bound occurred in the specific neutrosophic SuperHyperClasses of the neutrosophic SuperHyperGraphs which are neutrosophic free-quasi-triangle.
Assume a neutrosophic SuperHyperEdge
has
z neutrosophic number of the neutrosophic SuperHyperVertices. Then every neutrosophic SuperHyperVertex has at least no neutrosophic SuperHyperEdge with others in common. Thus those neutrosophic SuperHyperVertices have the eligibles to be contained in a neutrosophic R-SuperHyperMatching. Those neutrosophic SuperHyperVertices are potentially included in a neutrosophic style-R-SuperHyperMatching. Formally, consider
Are the neutrosophic SuperHyperVertices of a neutrosophic SuperHyperEdge
Thus
where the ∼ isn’t an equivalence relation but only the symmetric relation on the neutrosophic SuperHyperVertices of the neutrosophic SuperHyperGraph. The formal definition is as follows.
if and only if
and
are the neutrosophic SuperHyperVertices and there’s only and only one neutrosophic SuperHyperEdge
between the neutrosophic SuperHyperVertices
and
The other definition for the neutrosophic SuperHyperEdge
in the terms of neutrosophic R-SuperHyperMatching is
This definition coincides with the definition of the neutrosophic R-SuperHyperMatching but with slightly differences in the maximum neutrosophic cardinality amid those neutrosophic type-SuperHyperSets of the neutrosophic SuperHyperVertices. Thus the neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices,
and
is formalized with mathematical literatures on the neutrosophic R-SuperHyperMatching. Let
be defined as
and
are the neutrosophic SuperHyperVertices belong to the neutrosophic SuperHyperEdge
Thus,
Or
But with the slightly differences,
Thus
is a neutrosophic quasi-R-SuperHyperMatching where
is fixed that means
for all neutrosophic intended SuperHyperVertices but in a neutrosophic SuperHyperMatching,
could be different and it’s not unique. To sum them up, in a connected neutrosophic SuperHyperGraph
If a neutrosophic SuperHyperEdge
has
z neutrosophic SuperHyperVertices, then the neutrosophic cardinality of the neutrosophic R-SuperHyperMatching is at least
It’s straightforward that the neutrosophic cardinality of the neutrosophic R-SuperHyperMatching is at least the maximum neutrosophic number of neutrosophic SuperHyperVertices of the neutrosophic SuperHyperEdges with the maximum number of the neutrosophic SuperHyperEdges. In other words, the maximum number of the neutrosophic SuperHyperEdges contains the maximum neutrosophic number of neutrosophic SuperHyperVertices are renamed to neutrosophic SuperHyperMatching in some cases but the maximum number of the neutrosophic SuperHyperEdge with the maximum neutrosophic number of neutrosophic SuperHyperVertices, has the neutrosophic SuperHyperVertices are contained in a neutrosophic R-SuperHyperMatching.
The obvious SuperHyperGraph has no neutrosophic SuperHyperEdges. But the non-obvious neutrosophic SuperHyperModel is up. The quasi-SuperHyperModel addresses some issues about the neutrosophic optimal SuperHyperObject. It specially delivers some remarks on the neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices such that there’s distinct amount of neutrosophic SuperHyperEdges for distinct amount of neutrosophic SuperHyperVertices up to all taken from that neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices but this neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices is either has the maximum neutrosophic SuperHyperCardinality or it doesn’t have maximum neutrosophic SuperHyperCardinality. In a non-obvious SuperHyperModel, there’s at least one neutrosophic SuperHyperEdge containing at least all neutrosophic SuperHyperVertices. Thus it forms a neutrosophic quasi-R-SuperHyperMatching where the neutrosophic completion of the neutrosophic incidence is up in that. Thus it’s, literarily, a neutrosophic embedded R-SuperHyperMatching. The SuperHyperNotions of embedded SuperHyperSet and quasi-SuperHyperSet coincide. In the original setting, these types of SuperHyperSets only don’t satisfy on the maximum SuperHyperCardinality. Thus the embedded setting is elected such that those SuperHyperSets have the maximum neutrosophic SuperHyperCardinality and they’re neutrosophic SuperHyperOptimal. The less than two distinct types of neutrosophic SuperHyperVertices are included in the minimum neutrosophic style of the embedded neutrosophic R-SuperHyperMatching. The interior types of the neutrosophic SuperHyperVertices are deciders. Since the neutrosophic number of SuperHyperNeighbors are only affected by the interior neutrosophic SuperHyperVertices. The common connections, more precise and more formal, the perfect unique connections inside the neutrosophic SuperHyperSet for any distinct types of neutrosophic SuperHyperVertices pose the neutrosophic R-SuperHyperMatching. Thus neutrosophic exterior SuperHyperVertices could be used only in one neutrosophic SuperHyperEdge and in neutrosophic SuperHyperRelation with the interior neutrosophic SuperHyperVertices in that neutrosophic SuperHyperEdge. In the embedded neutrosophic SuperHyperMatching, there’s the usage of exterior neutrosophic SuperHyperVertices since they’ve more connections inside more than outside. Thus the title “exterior” is more relevant than the title “interior”. One neutrosophic SuperHyperVertex has no connection, inside. Thus, the neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices with one SuperHyperElement has been ignored in the exploring to lead on the optimal case implying the neutrosophic R-SuperHyperMatching. The neutrosophic R-SuperHyperMatching with the exclusion of the exclusion of all neutrosophic SuperHyperVertices in one neutrosophic SuperHyperEdge and with other terms, the neutrosophic R-SuperHyperMatching with the inclusion of all neutrosophic SuperHyperVertices in one neutrosophic SuperHyperEdge, is a neutrosophic quasi-R-SuperHyperMatching. To sum them up, in a connected non-obvious neutrosophic SuperHyperGraph There’s only one neutrosophic SuperHyperEdge has only the maximum possibilities of the distinct interior neutrosophic SuperHyperVertices inside of any given neutrosophic quasi-R-SuperHyperMatching minus all neutrosophic SuperHypeNeighbor to some of them but not all of them. In other words, there’s only an unique neutrosophic SuperHyperEdge has only two distinct neutrosophic SuperHyperVertices in an neutrosophic quasi-R-SuperHyperMatching, minus all neutrosophic SuperHypeNeighbor to some of them but not all of them.
The main definition of the neutrosophic R-SuperHyperMatching has two titles. a neutrosophic quasi-R-SuperHyperMatching and its corresponded quasi-maximum neutrosophic R-SuperHyperCardinality are two titles in the terms of quasi-R-styles. For any neutrosophic number, there’s a neutrosophic quasi-R-SuperHyperMatching with that quasi-maximum neutrosophic SuperHyperCardinality in the terms of the embedded neutrosophic SuperHyperGraph. If there’s an embedded neutrosophic SuperHyperGraph, then the neutrosophic quasi-SuperHyperNotions lead us to take the collection of all the neutrosophic quasi-R-SuperHyperMatchings for all neutrosophic numbers less than its neutrosophic corresponded maximum number. The essence of the neutrosophic SuperHyperMatching ends up but this essence starts up in the terms of the neutrosophic quasi-R-SuperHyperMatching, again and more in the operations of collecting all the neutrosophic quasi-R-SuperHyperMatchings acted on the all possible used formations of the neutrosophic SuperHyperGraph to achieve one neutrosophic number. This neutrosophic number is considered as the equivalence class for all corresponded quasi-R-SuperHyperMatchings. Let
and
be a neutrosophic number, a neutrosophic SuperHyperSet and a neutrosophic SuperHyperMatching. Then
As its consequences, the formal definition of the neutrosophic SuperHyperMatching is re-formalized and redefined as follows.
To get more precise perceptions, the follow-up expressions propose another formal technical definition for the neutrosophic SuperHyperMatching.
In more concise and more convenient ways, the modified definition for the neutrosophic SuperHyperMatching poses the upcoming expressions.
To translate the statement to this mathematical literature, the formulae will be revised.
And then,
To get more visions in the closer look-up, there’s an overall overlook.
Now, the extension of these types of approaches is up. Since the new term, “neutrosophic SuperHyperNeighborhood”, could be redefined as the collection of the neutrosophic SuperHyperVertices such that any amount of its neutrosophic SuperHyperVertices are incident to a neutrosophic SuperHyperEdge. It’s, literarily, another name for “neutrosophic Quasi-SuperHyperMatching” but, precisely, it’s the generalization of “neutrosophic Quasi-SuperHyperMatching” since “neutrosophic Quasi-SuperHyperMatching” happens “neutrosophic SuperHyperMatching” in a neutrosophic SuperHyperGraph as initial framework and background but “neutrosophic SuperHyperNeighborhood” may not happens “neutrosophic SuperHyperMatching” in a neutrosophic SuperHyperGraph as initial framework and preliminarily background since there are some ambiguities about the neutrosophic SuperHyperCardinality arise from it. To get orderly keywords, the terms, “neutrosophic SuperHyperNeighborhood”, “neutrosophic Quasi-SuperHyperMatching”, and “neutrosophic SuperHyperMatching” are up.
Thus, let
and
be a neutrosophic number, a neutrosophic SuperHyperNeighborhood and a neutrosophic SuperHyperMatching and the new terms are up.
And with go back to initial structure,
Thus, in a connected neutrosophic SuperHyperGraph
The all interior neutrosophic SuperHyperVertices belong to any neutrosophic quasi-R-SuperHyperMatching if for any of them, and any of other corresponded neutrosophic SuperHyperVertex, some interior neutrosophic SuperHyperVertices are mutually neutrosophic SuperHyperNeighbors with no neutrosophic exception at all minus all neutrosophic SuperHypeNeighbors to any amount of them.
To make sense with the precise words in the terms of “R-’, the follow-up illustrations are coming up.
The following neutrosophic SuperHyperSet of neutrosophic SuperHyperVertices is the simple neutrosophic type-SuperHyperSet of the neutrosophic R-SuperHyperMatching.
The neutrosophic SuperHyperSet of neutrosophic SuperHyperVertices,
Is the simple neutrosophic type-SuperHyperSet of the neutrosophic R-SuperHyperMatching. The neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices,
Is an
neutrosophic R-SuperHyperMatching for an neutrosophic SuperHyperGraph
is a neutrosophic type-SuperHyperSet with
the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet
S of neutrosophic SuperHyperVertices such that there’s no a neutrosophic SuperHyperEdge amid some neutrosophic SuperHyperVertices instead of all given by
neutrosophic SuperHyperMatching is related to the neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices,
There’s
not only
one neutrosophic SuperHyperVertex
inside the intended neutrosophic SuperHyperSet. Thus the non-obvious neutrosophic SuperHyperMatching is up. The obvious simple neutrosophic type-SuperHyperSet called the neutrosophic SuperHyperMatching is a neutrosophic SuperHyperSet
includes only
one neutrosophic SuperHyperVertex. But the neutrosophic SuperHyperSet of neutrosophic SuperHyperVertices,
doesn’t have less than two SuperHyperVertices
inside the intended neutrosophic SuperHyperSet since they’ve come from at least so far an SuperHyperEdge. Thus the non-obvious simple neutrosophic type-SuperHyperSet of the neutrosophic R-SuperHyperMatching
is up. To sum them up, the neutrosophic SuperHyperSet of neutrosophic SuperHyperVertices,
Is the non-obvious simple neutrosophic type-SuperHyperSet of the neutrosophic R-SuperHyperMatching. Since the neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices,
or
is an neutrosophic R-SuperHyperMatching
for an neutrosophic SuperHyperGraph
is the neutrosophic SuperHyperSet
S of neutrosophic SuperHyperVertices such that there’s no a neutrosophic SuperHyperEdge for some neutrosophic SuperHyperVertices instead of all given by that neutrosophic type-SuperHyperSet called the neutrosophic SuperHyperMatching
and it’s an neutrosophic
SuperHyperMatching. Since it
’s the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet
S of neutrosophic SuperHyperVertices such that there’s no a neutrosophic SuperHyperEdge for some amount neutrosophic SuperHyperVertices instead of all given by that neutrosophic type-SuperHyperSet called the neutrosophic SuperHyperMatching. There isn’t only less than two neutrosophic SuperHyperVertices
inside the intended neutrosophic SuperHyperSet,
Thus the non-obvious neutrosophic R-SuperHyperMatching,
is up. The non-obvious simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching, not:
Is the neutrosophic SuperHyperSet, not:
does includes only less than two SuperHyperVertices in a connected neutrosophic SuperHyperGraph
but it’s impossible in the case, they’ve corresponded to an SuperHyperEdge. It’s interesting to mention that the only non-obvious simple neutrosophic type-SuperHyperSet called the
amid those obvious[non-obvious] simple neutrosophic type-SuperHyperSets called the
is only and only
In a connected neutrosophic SuperHyperGraph
with a illustrated SuperHyperModeling. It’s also, not only a neutrosophic free-triangle embedded SuperHyperModel and a neutrosophic on-triangle embedded SuperHyperModel but also it’s a neutrosophic stable embedded SuperHyperModel. But all only non-obvious simple neutrosophic type-SuperHyperSets of the neutrosophic R-SuperHyperMatching amid those obvious simple neutrosophic type-SuperHyperSets of the neutrosophic SuperHyperMatching, are
In a connected neutrosophic SuperHyperGraph
To sum them up, assume a connected loopless neutrosophic SuperHyperGraph
Then in the worst case, literally,
is a neutrosophic R-SuperHyperMatching. In other words, the least cardinality, the lower sharp bound for the cardinality, of a neutrosophic R-SuperHyperMatching is the cardinality of
To sum them up, in a connected neutrosophic SuperHyperGraph
The all interior neutrosophic SuperHyperVertices belong to any neutrosophic quasi-R-SuperHyperMatching if for any of them, and any of other corresponded neutrosophic SuperHyperVertex, some interior neutrosophic SuperHyperVertices are mutually neutrosophic SuperHyperNeighbors with no neutrosophic exception at all minus all neutrosophic SuperHypeNeighbors to any amount of them.
Assume a connected neutrosophic SuperHyperGraph Let a neutrosophic SuperHyperEdge has some neutrosophic SuperHyperVertices Consider all neutrosophic numbers of those neutrosophic SuperHyperVertices from that neutrosophic SuperHyperEdge excluding excluding more than r distinct neutrosophic SuperHyperVertices, exclude to any given neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices. Consider there’s a neutrosophic R-SuperHyperMatching with the least cardinality, the lower sharp neutrosophic bound for neutrosophic cardinality. Assume a connected neutrosophic SuperHyperGraph The neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices is a neutrosophic SuperHyperSet S of the neutrosophic SuperHyperVertices such that there’s a neutrosophic SuperHyperEdge to have some neutrosophic SuperHyperVertices uniquely but it isn’t a neutrosophic R-SuperHyperMatching. Since it doesn’t have the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet S of neutrosophic SuperHyperVertices such that there’s a neutrosophic SuperHyperEdge to have some SuperHyperVertices uniquely. The neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices is the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet S of neutrosophic SuperHyperVertices but it isn’t a neutrosophic R-SuperHyperMatching. Since it doesn’t do the neutrosophic procedure such that such that there’s a neutrosophic SuperHyperEdge to have some neutrosophic SuperHyperVertices uniquely [there are at least one neutrosophic SuperHyperVertex outside implying there’s, sometimes in the connected neutrosophic SuperHyperGraph a neutrosophic SuperHyperVertex, titled its neutrosophic SuperHyperNeighbor, to that neutrosophic SuperHyperVertex in the neutrosophic SuperHyperSet S so as S doesn’t do “the neutrosophic procedure”.]. There’s only one neutrosophic SuperHyperVertex outside the intended neutrosophic SuperHyperSet, in the terms of neutrosophic SuperHyperNeighborhood. Thus the obvious neutrosophic R-SuperHyperMatching, is up. The obvious simple neutrosophic type-SuperHyperSet of the neutrosophic R-SuperHyperMatching, is a neutrosophic SuperHyperSet, includes only all neutrosophic SuperHyperVertices does forms any kind of neutrosophic pairs are titled neutrosophic SuperHyperNeighbors in a connected neutrosophic SuperHyperGraph Since the neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices is the maximum neutrosophic SuperHyperCardinality of a neutrosophic SuperHyperSet S of neutrosophic SuperHyperVertices such that there’s a neutrosophic SuperHyperEdge to have some neutrosophic SuperHyperVertices uniquely. Thus, in a connected neutrosophic SuperHyperGraph Any neutrosophic R-SuperHyperMatching only contains all interior neutrosophic SuperHyperVertices and all exterior neutrosophic SuperHyperVertices from the unique neutrosophic SuperHyperEdge where there’s any of them has all possible neutrosophic SuperHyperNeighbors in and there’s all neutrosophic SuperHyperNeighborhoods in with no exception minus all neutrosophic SuperHypeNeighbors to some of them not all of them but everything is possible about neutrosophic SuperHyperNeighborhoods and neutrosophic SuperHyperNeighbors out.
The SuperHyperNotion, namely, SuperHyperMatching, is up. There’s neither empty SuperHyperEdge nor loop SuperHyperEdge. The following neutrosophic SuperHyperSet of neutrosophic SuperHyperEdges[SuperHyperVertices] is the simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching. The neutrosophic SuperHyperSet of neutrosophic SuperHyperEdges[SuperHyperVertices],
is the simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching. The neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices],
Is an
neutrosophic SuperHyperMatching for an neutrosophic SuperHyperGraph
is a neutrosophic type-SuperHyperSet with
the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet
S of neutrosophic SuperHyperEdges[SuperHyperVertices] such that there’s no neutrosophic SuperHyperVertex of a neutrosophic SuperHyperEdge is common and there’s an neutrosophic SuperHyperEdge for all neutrosophic SuperHyperVertices. There are
not only
two neutrosophic SuperHyperVertices
inside the intended neutrosophic SuperHyperSet. Thus the non-obvious neutrosophic SuperHyperMatching is up. The obvious simple neutrosophic type-SuperHyperSet called the neutrosophic SuperHyperMatching is a neutrosophic SuperHyperSet
includes only
two neutrosophic SuperHyperVertices. But the neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices],
Doesn’t have less than three SuperHyperVertices
inside the intended neutrosophic SuperHyperSet. Thus the non-obvious simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching
is up. To sum them up, the neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices],
Is the non-obvious simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching. Since the neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices],
Is an neutrosophic SuperHyperMatching
for an neutrosophic SuperHyperGraph
is the neutrosophic SuperHyperSet
S of neutrosophic SuperHyperVertices such that there’s no a neutrosophic SuperHyperEdge for some neutrosophic SuperHyperVertices given by that neutrosophic type-SuperHyperSet called the neutrosophic SuperHyperMatching
and it’s an neutrosophic
SuperHyperMatching. Since it
’s the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet
S of neutrosophic SuperHyperEdges[SuperHyperVertices] such that there’s no neutrosophic SuperHyperVertex of a neutrosophic SuperHyperEdge is common and there’s an neutrosophic SuperHyperEdge for all neutrosophic SuperHyperVertices. There aren’t only less than three neutrosophic SuperHyperVertices
inside the intended neutrosophic SuperHyperSet,
Thus the non-obvious neutrosophic SuperHyperMatching,
Is up. The obvious simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching, not:
Is the neutrosophic SuperHyperSet, not:
Does includes only less than three SuperHyperVertices in a connected neutrosophic SuperHyperGraph
It’s interesting to mention that the only non-obvious simple neutrosophic type-SuperHyperSet called the
amid those obvious[non-obvious] simple neutrosophic type-SuperHyperSets called the
is only and only
In a connected neutrosophic SuperHyperGraph
□
Example 22. In the neutrosophic Figure (
24), the connected neutrosophic SuperHyperBipartite
is neutrosophic highlighted and neutrosophic featured. The obtained neutrosophic SuperHyperSet, by the neutrosophic Algorithm in previous neutrosophic result, of the neutrosophic SuperHyperVertices of the connected neutrosophic SuperHyperBipartite
in the neutrosophic SuperHyperModel (
24), is the neutrosophic SuperHyperMatching.
Proposition 23.
Assume a connected neutrosophic SuperHyperMultipartite Then a neutrosophic R-SuperHyperMatching is a neutrosophic SuperHyperSet of the interior neutrosophic SuperHyperVertices with only no neutrosophic exception in the neutrosophic form of interior neutrosophic SuperHyperVertices from a neutrosophic SuperHyperPart and only no exception in the form of interior SuperHyperVertices from another SuperHyperPart titled “SuperHyperNeighbors” with neglecting and ignoring more than some of them aren’t SuperHyperNeighbors to all. a neutrosophic R-SuperHyperMatching has the neutrosophic maximum number on all the neutrosophic summation on the neutrosophic cardinality of the all neutrosophic SuperHyperParts form some SuperHyperEdges minus those make neutrosophic SuperHypeNeighbors to some not all or not unique. Also,
Proof. Assume a connected loopless neutrosophic SuperHyperGraph
The SuperHyperSet of the SuperHyperVertices
isn’t a quasi-R-SuperHyperMatching since neither amount of neutrosophic SuperHyperEdges nor amount of SuperHyperVertices where amount refers to the neutrosophic number of SuperHyperVertices(-/SuperHyperEdges) more than one to form any kind of SuperHyperEdges or any number of SuperHyperEdges. Let us consider the neutrosophic SuperHyperSet
This neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices has the eligibilities to propose property such that there’s no neutrosophic SuperHyperVertex of a neutrosophic SuperHyperEdge is common and there’s an neutrosophic SuperHyperEdge for all neutrosophic SuperHyperVertices but the maximum neutrosophic cardinality indicates that these neutrosophic type-SuperHyperSets couldn’t give us the neutrosophic lower bound in the term of neutrosophic sharpness. In other words, the neutrosophic SuperHyperSet
of the neutrosophic SuperHyperVertices implies at least on-quasi-triangle style is up but sometimes the neutrosophic SuperHyperSet
of the neutrosophic SuperHyperVertices is free-quasi-triangle and it doesn’t make a contradiction to the supposition on the connected loopless neutrosophic SuperHyperGraph
Thus the minimum case never happens in the generality of the connected loopless neutrosophic SuperHyperGraphs. Thus if we assume in the worst case, literally,
Is a quasi-R-SuperHyperMatching. In other words, the least cardinality, the lower sharp bound for the cardinality, of a quasi-R-SuperHyperMatching is the cardinality of
Then we’ve lost some connected loopless neutrosophic SuperHyperClasses of the connected loopless neutrosophic SuperHyperGraphs titled free-triangle, on-triangle, and their quasi-types but the SuperHyperStable is only up in this quasi-R-SuperHyperMatching. It’s the contradiction to that fact on the generality. There are some counterexamples to deny this statement. One of them comes from the setting of the graph titled path and cycle as the counterexamples-classes or reversely direction star as the examples-classes, are well-known classes in that setting and they could be considered as the examples-classes and counterexamples-classes for the tight bound of
Let
in mind. There’s no necessity on the SuperHyperEdge since we need at least two SuperHyperVertices to form a SuperHyperEdge. It doesn’t withdraw the principles of the main definition since there’s no condition to be satisfied but the condition is on the existence of the SuperHyperEdge instead of acting on the SuperHyperVertices. In other words, if there’s a SuperHyperEdge, then the neutrosophic SuperHyperSet has the necessary condition for the intended definition to be applied. Thus the
is withdrawn not by the conditions of the main definition but by the necessity of the pre-condition on the usage of the main definition.
The neutrosophic structure of the neutrosophic R-SuperHyperMatching decorates the neutrosophic SuperHyperVertices don’t have received any neutrosophic connections so as this neutrosophic style implies different versions of neutrosophic SuperHyperEdges with the maximum neutrosophic cardinality in the terms of neutrosophic SuperHyperVertices are spotlight. The lower neutrosophic bound is to have the maximum neutrosophic groups of neutrosophic SuperHyperVertices have perfect neutrosophic connections inside each of SuperHyperEdges and the outside of this neutrosophic SuperHyperSet doesn’t matter but regarding the connectedness of the used neutrosophic SuperHyperGraph arising from its neutrosophic properties taken from the fact that it’s simple. If there’s no more than one neutrosophic SuperHyperVertex in the targeted neutrosophic SuperHyperSet, then there’s no neutrosophic connection. Furthermore, the neutrosophic existence of one neutrosophic SuperHyperVertex has no neutrosophic effect to talk about the neutrosophic R-SuperHyperMatching. Since at least two neutrosophic SuperHyperVertices involve to make a title in the neutrosophic background of the neutrosophic SuperHyperGraph. The neutrosophic SuperHyperGraph is obvious if it has no neutrosophic SuperHyperEdge but at least two neutrosophic SuperHyperVertices make the neutrosophic version of neutrosophic SuperHyperEdge. Thus in the neutrosophic setting of non-obvious neutrosophic SuperHyperGraph, there are at least one neutrosophic SuperHyperEdge. It’s necessary to mention that the word “Simple” is used as neutrosophic adjective for the initial neutrosophic SuperHyperGraph, induces there’s no neutrosophic appearance of the loop neutrosophic version of the neutrosophic SuperHyperEdge and this neutrosophic SuperHyperGraph is said to be loopless. The neutrosophic adjective “loop” on the basic neutrosophic framework engages one neutrosophic SuperHyperVertex but it never happens in this neutrosophic setting. With these neutrosophic bases, on a neutrosophic SuperHyperGraph, there’s at least one neutrosophic SuperHyperEdge thus there’s at least a neutrosophic R-SuperHyperMatching has the neutrosophic cardinality of a neutrosophic SuperHyperEdge. Thus, a neutrosophic R-SuperHyperMatching has the neutrosophic cardinality at least a neutrosophic SuperHyperEdge. Assume a neutrosophic SuperHyperSet
This neutrosophic SuperHyperSet isn’t a neutrosophic R-SuperHyperMatching since either the neutrosophic SuperHyperGraph is an obvious neutrosophic SuperHyperModel thus it never happens since there’s no neutrosophic usage of this neutrosophic framework and even more there’s no neutrosophic connection inside or the neutrosophic SuperHyperGraph isn’t obvious and as its consequences, there’s a neutrosophic contradiction with the term “neutrosophic R-SuperHyperMatching” since the maximum neutrosophic cardinality never happens for this neutrosophic style of the neutrosophic SuperHyperSet and beyond that there’s no neutrosophic connection inside as mentioned in first neutrosophic case in the forms of drawback for this selected neutrosophic SuperHyperSet. Let
Comes up. This neutrosophic case implies having the neutrosophic style of on-quasi-triangle neutrosophic style on the every neutrosophic elements of this neutrosophic SuperHyperSet. Precisely, the neutrosophic R-SuperHyperMatching is the neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices such that some neutrosophic amount of the neutrosophic SuperHyperVertices are on-quasi-triangle neutrosophic style. The neutrosophic cardinality of the v SuperHypeSet
Is the maximum in comparison to the neutrosophic SuperHyperSet
But the lower neutrosophic bound is up. Thus the minimum neutrosophic cardinality of the maximum neutrosophic cardinality ends up the neutrosophic discussion. The first neutrosophic term refers to the neutrosophic setting of the neutrosophic SuperHyperGraph but this key point is enough since there’s a neutrosophic SuperHyperClass of a neutrosophic SuperHyperGraph has no on-quasi-triangle neutrosophic style amid some amount of its neutrosophic SuperHyperVertices. This neutrosophic setting of the neutrosophic SuperHyperModel proposes a neutrosophic SuperHyperSet has only some amount neutrosophic SuperHyperVertices from one neutrosophic SuperHyperEdge such that there’s no neutrosophic amount of neutrosophic SuperHyperEdges more than one involving these some amount of these neutrosophic SuperHyperVertices. The neutrosophic cardinality of this neutrosophic SuperHyperSet is the maximum and the neutrosophic case is occurred in the minimum neutrosophic situation. To sum them up, the neutrosophic SuperHyperSet
Has the maximum neutrosophic cardinality such that
Contains some neutrosophic SuperHyperVertices such that there’s distinct-covers-order-amount neutrosophic SuperHyperEdges for amount of neutrosophic SuperHyperVertices taken from the neutrosophic SuperHyperSet
It means that the neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices
Is a neutrosophic R-SuperHyperMatching for the neutrosophic SuperHyperGraph as used neutrosophic background in the neutrosophic terms of worst neutrosophic case and the common theme of the lower neutrosophic bound occurred in the specific neutrosophic SuperHyperClasses of the neutrosophic SuperHyperGraphs which are neutrosophic free-quasi-triangle.
Assume a neutrosophic SuperHyperEdge
has
z neutrosophic number of the neutrosophic SuperHyperVertices. Then every neutrosophic SuperHyperVertex has at least no neutrosophic SuperHyperEdge with others in common. Thus those neutrosophic SuperHyperVertices have the eligibles to be contained in a neutrosophic R-SuperHyperMatching. Those neutrosophic SuperHyperVertices are potentially included in a neutrosophic style-R-SuperHyperMatching. Formally, consider
Are the neutrosophic SuperHyperVertices of a neutrosophic SuperHyperEdge
Thus
where the ∼ isn’t an equivalence relation but only the symmetric relation on the neutrosophic SuperHyperVertices of the neutrosophic SuperHyperGraph. The formal definition is as follows.
if and only if
and
are the neutrosophic SuperHyperVertices and there’s only and only one neutrosophic SuperHyperEdge
between the neutrosophic SuperHyperVertices
and
The other definition for the neutrosophic SuperHyperEdge
in the terms of neutrosophic R-SuperHyperMatching is
This definition coincides with the definition of the neutrosophic R-SuperHyperMatching but with slightly differences in the maximum neutrosophic cardinality amid those neutrosophic type-SuperHyperSets of the neutrosophic SuperHyperVertices. Thus the neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices,
and
is formalized with mathematical literatures on the neutrosophic R-SuperHyperMatching. Let
be defined as
and
are the neutrosophic SuperHyperVertices belong to the neutrosophic SuperHyperEdge
Thus,
Or
But with the slightly differences,
Thus
is a neutrosophic quasi-R-SuperHyperMatching where
is fixed that means
for all neutrosophic intended SuperHyperVertices but in a neutrosophic SuperHyperMatching,
could be different and it’s not unique. To sum them up, in a connected neutrosophic SuperHyperGraph
If a neutrosophic SuperHyperEdge
has
z neutrosophic SuperHyperVertices, then the neutrosophic cardinality of the neutrosophic R-SuperHyperMatching is at least
It’s straightforward that the neutrosophic cardinality of the neutrosophic R-SuperHyperMatching is at least the maximum neutrosophic number of neutrosophic SuperHyperVertices of the neutrosophic SuperHyperEdges with the maximum number of the neutrosophic SuperHyperEdges. In other words, the maximum number of the neutrosophic SuperHyperEdges contains the maximum neutrosophic number of neutrosophic SuperHyperVertices are renamed to neutrosophic SuperHyperMatching in some cases but the maximum number of the neutrosophic SuperHyperEdge with the maximum neutrosophic number of neutrosophic SuperHyperVertices, has the neutrosophic SuperHyperVertices are contained in a neutrosophic R-SuperHyperMatching.
The obvious SuperHyperGraph has no neutrosophic SuperHyperEdges. But the non-obvious neutrosophic SuperHyperModel is up. The quasi-SuperHyperModel addresses some issues about the neutrosophic optimal SuperHyperObject. It specially delivers some remarks on the neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices such that there’s distinct amount of neutrosophic SuperHyperEdges for distinct amount of neutrosophic SuperHyperVertices up to all taken from that neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices but this neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices is either has the maximum neutrosophic SuperHyperCardinality or it doesn’t have maximum neutrosophic SuperHyperCardinality. In a non-obvious SuperHyperModel, there’s at least one neutrosophic SuperHyperEdge containing at least all neutrosophic SuperHyperVertices. Thus it forms a neutrosophic quasi-R-SuperHyperMatching where the neutrosophic completion of the neutrosophic incidence is up in that. Thus it’s, literarily, a neutrosophic embedded R-SuperHyperMatching. The SuperHyperNotions of embedded SuperHyperSet and quasi-SuperHyperSet coincide. In the original setting, these types of SuperHyperSets only don’t satisfy on the maximum SuperHyperCardinality. Thus the embedded setting is elected such that those SuperHyperSets have the maximum neutrosophic SuperHyperCardinality and they’re neutrosophic SuperHyperOptimal. The less than two distinct types of neutrosophic SuperHyperVertices are included in the minimum neutrosophic style of the embedded neutrosophic R-SuperHyperMatching. The interior types of the neutrosophic SuperHyperVertices are deciders. Since the neutrosophic number of SuperHyperNeighbors are only affected by the interior neutrosophic SuperHyperVertices. The common connections, more precise and more formal, the perfect unique connections inside the neutrosophic SuperHyperSet for any distinct types of neutrosophic SuperHyperVertices pose the neutrosophic R-SuperHyperMatching. Thus neutrosophic exterior SuperHyperVertices could be used only in one neutrosophic SuperHyperEdge and in neutrosophic SuperHyperRelation with the interior neutrosophic SuperHyperVertices in that neutrosophic SuperHyperEdge. In the embedded neutrosophic SuperHyperMatching, there’s the usage of exterior neutrosophic SuperHyperVertices since they’ve more connections inside more than outside. Thus the title “exterior” is more relevant than the title “interior”. One neutrosophic SuperHyperVertex has no connection, inside. Thus, the neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices with one SuperHyperElement has been ignored in the exploring to lead on the optimal case implying the neutrosophic R-SuperHyperMatching. The neutrosophic R-SuperHyperMatching with the exclusion of the exclusion of all neutrosophic SuperHyperVertices in one neutrosophic SuperHyperEdge and with other terms, the neutrosophic R-SuperHyperMatching with the inclusion of all neutrosophic SuperHyperVertices in one neutrosophic SuperHyperEdge, is a neutrosophic quasi-R-SuperHyperMatching. To sum them up, in a connected non-obvious neutrosophic SuperHyperGraph There’s only one neutrosophic SuperHyperEdge has only the maximum possibilities of the distinct interior neutrosophic SuperHyperVertices inside of any given neutrosophic quasi-R-SuperHyperMatching minus all neutrosophic SuperHypeNeighbor to some of them but not all of them. In other words, there’s only an unique neutrosophic SuperHyperEdge has only two distinct neutrosophic SuperHyperVertices in an neutrosophic quasi-R-SuperHyperMatching, minus all neutrosophic SuperHypeNeighbor to some of them but not all of them.
The main definition of the neutrosophic R-SuperHyperMatching has two titles. a neutrosophic quasi-R-SuperHyperMatching and its corresponded quasi-maximum neutrosophic R-SuperHyperCardinality are two titles in the terms of quasi-R-styles. For any neutrosophic number, there’s a neutrosophic quasi-R-SuperHyperMatching with that quasi-maximum neutrosophic SuperHyperCardinality in the terms of the embedded neutrosophic SuperHyperGraph. If there’s an embedded neutrosophic SuperHyperGraph, then the neutrosophic quasi-SuperHyperNotions lead us to take the collection of all the neutrosophic quasi-R-SuperHyperMatchings for all neutrosophic numbers less than its neutrosophic corresponded maximum number. The essence of the neutrosophic SuperHyperMatching ends up but this essence starts up in the terms of the neutrosophic quasi-R-SuperHyperMatching, again and more in the operations of collecting all the neutrosophic quasi-R-SuperHyperMatchings acted on the all possible used formations of the neutrosophic SuperHyperGraph to achieve one neutrosophic number. This neutrosophic number is considered as the equivalence class for all corresponded quasi-R-SuperHyperMatchings. Let
and
be a neutrosophic number, a neutrosophic SuperHyperSet and a neutrosophic SuperHyperMatching. Then
As its consequences, the formal definition of the neutrosophic SuperHyperMatching is re-formalized and redefined as follows.
To get more precise perceptions, the follow-up expressions propose another formal technical definition for the neutrosophic SuperHyperMatching.
In more concise and more convenient ways, the modified definition for the neutrosophic SuperHyperMatching poses the upcoming expressions.
To translate the statement to this mathematical literature, the formulae will be revised.
And then,
To get more visions in the closer look-up, there’s an overall overlook.
Now, the extension of these types of approaches is up. Since the new term, “neutrosophic SuperHyperNeighborhood”, could be redefined as the collection of the neutrosophic SuperHyperVertices such that any amount of its neutrosophic SuperHyperVertices are incident to a neutrosophic SuperHyperEdge. It’s, literarily, another name for “neutrosophic Quasi-SuperHyperMatching” but, precisely, it’s the generalization of “neutrosophic Quasi-SuperHyperMatching” since “neutrosophic Quasi-SuperHyperMatching” happens “neutrosophic SuperHyperMatching” in a neutrosophic SuperHyperGraph as initial framework and background but “neutrosophic SuperHyperNeighborhood” may not happens “neutrosophic SuperHyperMatching” in a neutrosophic SuperHyperGraph as initial framework and preliminarily background since there are some ambiguities about the neutrosophic SuperHyperCardinality arise from it. To get orderly keywords, the terms, “neutrosophic SuperHyperNeighborhood”, “neutrosophic Quasi-SuperHyperMatching”, and “neutrosophic SuperHyperMatching” are up.
Thus, let
and
be a neutrosophic number, a neutrosophic SuperHyperNeighborhood and a neutrosophic SuperHyperMatching and the new terms are up.
And with go back to initial structure,
Thus, in a connected neutrosophic SuperHyperGraph
The all interior neutrosophic SuperHyperVertices belong to any neutrosophic quasi-R-SuperHyperMatching if for any of them, and any of other corresponded neutrosophic SuperHyperVertex, some interior neutrosophic SuperHyperVertices are mutually neutrosophic SuperHyperNeighbors with no neutrosophic exception at all minus all neutrosophic SuperHypeNeighbors to any amount of them.
To make sense with the precise words in the terms of “R-’, the follow-up illustrations are coming up. The following neutrosophic SuperHyperSet of neutrosophic SuperHyperVertices is the simple neutrosophic type-SuperHyperSet of the neutrosophic R-SuperHyperMatching.
The neutrosophic SuperHyperSet of neutrosophic SuperHyperVertices,
Is the simple neutrosophic type-SuperHyperSet of the neutrosophic R-SuperHyperMatching. The neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices,
Is an
neutrosophic R-SuperHyperMatching for an neutrosophic SuperHyperGraph
is a neutrosophic type-SuperHyperSet with
the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet
S of neutrosophic SuperHyperVertices such that there’s no a neutrosophic SuperHyperEdge amid some neutrosophic SuperHyperVertices instead of all given by
neutrosophic SuperHyperMatching is related to the neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices,
There’s
not only
one neutrosophic SuperHyperVertex
inside the intended neutrosophic SuperHyperSet. Thus the non-obvious neutrosophic SuperHyperMatching is up. The obvious simple neutrosophic type-SuperHyperSet called the neutrosophic SuperHyperMatching is a neutrosophic SuperHyperSet
includes only
one neutrosophic SuperHyperVertex. But the neutrosophic SuperHyperSet of neutrosophic SuperHyperVertices,
doesn’t have less than two SuperHyperVertices
inside the intended neutrosophic SuperHyperSet since they’ve come from at least so far an SuperHyperEdge. Thus the non-obvious simple neutrosophic type-SuperHyperSet of the neutrosophic R-SuperHyperMatching
is up. To sum them up, the neutrosophic SuperHyperSet of neutrosophic SuperHyperVertices,
Is the non-obvious simple neutrosophic type-SuperHyperSet of the neutrosophic R-SuperHyperMatching. Since the neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices,
or
is an neutrosophic R-SuperHyperMatching
for an neutrosophic SuperHyperGraph
is the neutrosophic SuperHyperSet
S of neutrosophic SuperHyperVertices such that there’s no a neutrosophic SuperHyperEdge for some neutrosophic SuperHyperVertices instead of all given by that neutrosophic type-SuperHyperSet called the neutrosophic SuperHyperMatching
and it’s an neutrosophic
SuperHyperMatching. Since it
’s the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet
S of neutrosophic SuperHyperVertices such that there’s no a neutrosophic SuperHyperEdge for some amount neutrosophic SuperHyperVertices instead of all given by that neutrosophic type-SuperHyperSet called the neutrosophic SuperHyperMatching. There isn’t only less than two neutrosophic SuperHyperVertices
inside the intended neutrosophic SuperHyperSet,
Thus the non-obvious neutrosophic R-SuperHyperMatching,
is up. The non-obvious simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching, not:
Is the neutrosophic SuperHyperSet, not:
does includes only less than two SuperHyperVertices in a connected neutrosophic SuperHyperGraph
but it’s impossible in the case, they’ve corresponded to an SuperHyperEdge. It’s interesting to mention that the only non-obvious simple neutrosophic type-SuperHyperSet called the
amid those obvious[non-obvious] simple neutrosophic type-SuperHyperSets called the
is only and only
In a connected neutrosophic SuperHyperGraph
with a illustrated SuperHyperModeling. It’s also, not only a neutrosophic free-triangle embedded SuperHyperModel and a neutrosophic on-triangle embedded SuperHyperModel but also it’s a neutrosophic stable embedded SuperHyperModel. But all only non-obvious simple neutrosophic type-SuperHyperSets of the neutrosophic R-SuperHyperMatching amid those obvious simple neutrosophic type-SuperHyperSets of the neutrosophic SuperHyperMatching, are
In a connected neutrosophic SuperHyperGraph
To sum them up, assume a connected loopless neutrosophic SuperHyperGraph
Then in the worst case, literally,
is a neutrosophic R-SuperHyperMatching. In other words, the least cardinality, the lower sharp bound for the cardinality, of a neutrosophic R-SuperHyperMatching is the cardinality of
To sum them up, in a connected neutrosophic SuperHyperGraph
The all interior neutrosophic SuperHyperVertices belong to any neutrosophic quasi-R-SuperHyperMatching if for any of them, and any of other corresponded neutrosophic SuperHyperVertex, some interior neutrosophic SuperHyperVertices are mutually neutrosophic SuperHyperNeighbors with no neutrosophic exception at all minus all neutrosophic SuperHypeNeighbors to any amount of them.
Assume a connected neutrosophic SuperHyperGraph Let a neutrosophic SuperHyperEdge has some neutrosophic SuperHyperVertices Consider all neutrosophic numbers of those neutrosophic SuperHyperVertices from that neutrosophic SuperHyperEdge excluding excluding more than r distinct neutrosophic SuperHyperVertices, exclude to any given neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices. Consider there’s a neutrosophic R-SuperHyperMatching with the least cardinality, the lower sharp neutrosophic bound for neutrosophic cardinality. Assume a connected neutrosophic SuperHyperGraph The neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices is a neutrosophic SuperHyperSet S of the neutrosophic SuperHyperVertices such that there’s a neutrosophic SuperHyperEdge to have some neutrosophic SuperHyperVertices uniquely but it isn’t a neutrosophic R-SuperHyperMatching. Since it doesn’t have the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet S of neutrosophic SuperHyperVertices such that there’s a neutrosophic SuperHyperEdge to have some SuperHyperVertices uniquely. The neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices is the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet S of neutrosophic SuperHyperVertices but it isn’t a neutrosophic R-SuperHyperMatching. Since it doesn’t do the neutrosophic procedure such that such that there’s a neutrosophic SuperHyperEdge to have some neutrosophic SuperHyperVertices uniquely [there are at least one neutrosophic SuperHyperVertex outside implying there’s, sometimes in the connected neutrosophic SuperHyperGraph a neutrosophic SuperHyperVertex, titled its neutrosophic SuperHyperNeighbor, to that neutrosophic SuperHyperVertex in the neutrosophic SuperHyperSet S so as S doesn’t do “the neutrosophic procedure”.]. There’s only one neutrosophic SuperHyperVertex outside the intended neutrosophic SuperHyperSet, in the terms of neutrosophic SuperHyperNeighborhood. Thus the obvious neutrosophic R-SuperHyperMatching, is up. The obvious simple neutrosophic type-SuperHyperSet of the neutrosophic R-SuperHyperMatching, is a neutrosophic SuperHyperSet, includes only all neutrosophic SuperHyperVertices does forms any kind of neutrosophic pairs are titled neutrosophic SuperHyperNeighbors in a connected neutrosophic SuperHyperGraph Since the neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices is the maximum neutrosophic SuperHyperCardinality of a neutrosophic SuperHyperSet S of neutrosophic SuperHyperVertices such that there’s a neutrosophic SuperHyperEdge to have some neutrosophic SuperHyperVertices uniquely. Thus, in a connected neutrosophic SuperHyperGraph Any neutrosophic R-SuperHyperMatching only contains all interior neutrosophic SuperHyperVertices and all exterior neutrosophic SuperHyperVertices from the unique neutrosophic SuperHyperEdge where there’s any of them has all possible neutrosophic SuperHyperNeighbors in and there’s all neutrosophic SuperHyperNeighborhoods in with no exception minus all neutrosophic SuperHypeNeighbors to some of them not all of them but everything is possible about neutrosophic SuperHyperNeighborhoods and neutrosophic SuperHyperNeighbors out.
The SuperHyperNotion, namely, SuperHyperMatching, is up. There’s neither empty SuperHyperEdge nor loop SuperHyperEdge. The following neutrosophic SuperHyperSet of neutrosophic SuperHyperEdges[SuperHyperVertices] is the simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching. The neutrosophic SuperHyperSet of neutrosophic SuperHyperEdges[SuperHyperVertices],
is the simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching. The neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices],
Is an
neutrosophic SuperHyperMatching for an neutrosophic SuperHyperGraph
is a neutrosophic type-SuperHyperSet with
the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet
S of neutrosophic SuperHyperEdges[SuperHyperVertices] such that there’s no neutrosophic SuperHyperVertex of a neutrosophic SuperHyperEdge is common and there’s an neutrosophic SuperHyperEdge for all neutrosophic SuperHyperVertices. There are
not only
two neutrosophic SuperHyperVertices
inside the intended neutrosophic SuperHyperSet. Thus the non-obvious neutrosophic SuperHyperMatching is up. The obvious simple neutrosophic type-SuperHyperSet called the neutrosophic SuperHyperMatching is a neutrosophic SuperHyperSet
includes only
two neutrosophic SuperHyperVertices. But the neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices],
Doesn’t have less than three SuperHyperVertices
inside the intended neutrosophic SuperHyperSet. Thus the non-obvious simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching
is up. To sum them up, the neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices],
Is the non-obvious simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching. Since the neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices],
Is an neutrosophic SuperHyperMatching
for an neutrosophic SuperHyperGraph
is the neutrosophic SuperHyperSet
S of neutrosophic SuperHyperVertices such that there’s no a neutrosophic SuperHyperEdge for some neutrosophic SuperHyperVertices given by that neutrosophic type-SuperHyperSet called the neutrosophic SuperHyperMatching
and it’s an neutrosophic
SuperHyperMatching. Since it
’s the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet
S of neutrosophic SuperHyperEdges[SuperHyperVertices] such that there’s no neutrosophic SuperHyperVertex of a neutrosophic SuperHyperEdge is common and there’s an neutrosophic SuperHyperEdge for all neutrosophic SuperHyperVertices. There aren’t only less than three neutrosophic SuperHyperVertices
inside the intended neutrosophic SuperHyperSet,
Thus the non-obvious neutrosophic SuperHyperMatching,
Is up. The obvious simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching, not:
Is the neutrosophic SuperHyperSet, not:
Does includes only less than three SuperHyperVertices in a connected neutrosophic SuperHyperGraph
It’s interesting to mention that the only non-obvious simple neutrosophic type-SuperHyperSet called the
amid those obvious[non-obvious] simple neutrosophic type-SuperHyperSets called the
is only and only
In a connected neutrosophic SuperHyperGraph
□
Example 24. In the Figure (
25), the connected neutrosophic SuperHyperMultipartite
is highlighted and neutrosophic featured. The obtained neutrosophic SuperHyperSet, by the Algorithm in previous neutrosophic result, of the neutrosophic SuperHyperVertices of the connected neutrosophic SuperHyperMultipartite
in the neutrosophic SuperHyperModel (
25), is the neutrosophic SuperHyperMatching.
Proposition 25.
Assume a connected neutrosophic SuperHyperWheel Then a neutrosophic R-SuperHyperMatching is a neutrosophic SuperHyperSet of the interior neutrosophic SuperHyperVertices, excluding the neutrosophic SuperHyperCenter, with only no exception in the form of interior neutrosophic SuperHyperVertices from same neutrosophic SuperHyperEdge with the exclusion on neutrosophic SuperHypeNeighbors to some of them and not all. a neutrosophic R-SuperHyperMatching has the neutrosophic maximum number on all the neutrosophic number of all the neutrosophic SuperHyperEdges don’t have common neutrosophic SuperHyperNeighbors. Also,
Proof. Assume a connected loopless neutrosophic SuperHyperGraph
The SuperHyperSet of the SuperHyperVertices
isn’t a quasi-R-SuperHyperMatching since neither amount of neutrosophic SuperHyperEdges nor amount of SuperHyperVertices where amount refers to the neutrosophic number of SuperHyperVertices(-/SuperHyperEdges) more than one to form any kind of SuperHyperEdges or any number of SuperHyperEdges. Let us consider the neutrosophic SuperHyperSet
This neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices has the eligibilities to propose property such that there’s no neutrosophic SuperHyperVertex of a neutrosophic SuperHyperEdge is common and there’s an neutrosophic SuperHyperEdge for all neutrosophic SuperHyperVertices but the maximum neutrosophic cardinality indicates that these neutrosophic type-SuperHyperSets couldn’t give us the neutrosophic lower bound in the term of neutrosophic sharpness. In other words, the neutrosophic SuperHyperSet
of the neutrosophic SuperHyperVertices implies at least on-quasi-triangle style is up but sometimes the neutrosophic SuperHyperSet
of the neutrosophic SuperHyperVertices is free-quasi-triangle and it doesn’t make a contradiction to the supposition on the connected loopless neutrosophic SuperHyperGraph
Thus the minimum case never happens in the generality of the connected loopless neutrosophic SuperHyperGraphs. Thus if we assume in the worst case, literally,
Is a quasi-R-SuperHyperMatching. In other words, the least cardinality, the lower sharp bound for the cardinality, of a quasi-R-SuperHyperMatching is the cardinality of
Then we’ve lost some connected loopless neutrosophic SuperHyperClasses of the connected loopless neutrosophic SuperHyperGraphs titled free-triangle, on-triangle, and their quasi-types but the SuperHyperStable is only up in this quasi-R-SuperHyperMatching. It’s the contradiction to that fact on the generality. There are some counterexamples to deny this statement. One of them comes from the setting of the graph titled path and cycle as the counterexamples-classes or reversely direction star as the examples-classes, are well-known classes in that setting and they could be considered as the examples-classes and counterexamples-classes for the tight bound of
Let
in mind. There’s no necessity on the SuperHyperEdge since we need at least two SuperHyperVertices to form a SuperHyperEdge. It doesn’t withdraw the principles of the main definition since there’s no condition to be satisfied but the condition is on the existence of the SuperHyperEdge instead of acting on the SuperHyperVertices. In other words, if there’s a SuperHyperEdge, then the neutrosophic SuperHyperSet has the necessary condition for the intended definition to be applied. Thus the
is withdrawn not by the conditions of the main definition but by the necessity of the pre-condition on the usage of the main definition.
The neutrosophic structure of the neutrosophic R-SuperHyperMatching decorates the neutrosophic SuperHyperVertices don’t have received any neutrosophic connections so as this neutrosophic style implies different versions of neutrosophic SuperHyperEdges with the maximum neutrosophic cardinality in the terms of neutrosophic SuperHyperVertices are spotlight. The lower neutrosophic bound is to have the maximum neutrosophic groups of neutrosophic SuperHyperVertices have perfect neutrosophic connections inside each of SuperHyperEdges and the outside of this neutrosophic SuperHyperSet doesn’t matter but regarding the connectedness of the used neutrosophic SuperHyperGraph arising from its neutrosophic properties taken from the fact that it’s simple. If there’s no more than one neutrosophic SuperHyperVertex in the targeted neutrosophic SuperHyperSet, then there’s no neutrosophic connection. Furthermore, the neutrosophic existence of one neutrosophic SuperHyperVertex has no neutrosophic effect to talk about the neutrosophic R-SuperHyperMatching. Since at least two neutrosophic SuperHyperVertices involve to make a title in the neutrosophic background of the neutrosophic SuperHyperGraph. The neutrosophic SuperHyperGraph is obvious if it has no neutrosophic SuperHyperEdge but at least two neutrosophic SuperHyperVertices make the neutrosophic version of neutrosophic SuperHyperEdge. Thus in the neutrosophic setting of non-obvious neutrosophic SuperHyperGraph, there are at least one neutrosophic SuperHyperEdge. It’s necessary to mention that the word “Simple” is used as neutrosophic adjective for the initial neutrosophic SuperHyperGraph, induces there’s no neutrosophic appearance of the loop neutrosophic version of the neutrosophic SuperHyperEdge and this neutrosophic SuperHyperGraph is said to be loopless. The neutrosophic adjective “loop” on the basic neutrosophic framework engages one neutrosophic SuperHyperVertex but it never happens in this neutrosophic setting. With these neutrosophic bases, on a neutrosophic SuperHyperGraph, there’s at least one neutrosophic SuperHyperEdge thus there’s at least a neutrosophic R-SuperHyperMatching has the neutrosophic cardinality of a neutrosophic SuperHyperEdge. Thus, a neutrosophic R-SuperHyperMatching has the neutrosophic cardinality at least a neutrosophic SuperHyperEdge. Assume a neutrosophic SuperHyperSet
This neutrosophic SuperHyperSet isn’t a neutrosophic R-SuperHyperMatching since either the neutrosophic SuperHyperGraph is an obvious neutrosophic SuperHyperModel thus it never happens since there’s no neutrosophic usage of this neutrosophic framework and even more there’s no neutrosophic connection inside or the neutrosophic SuperHyperGraph isn’t obvious and as its consequences, there’s a neutrosophic contradiction with the term “neutrosophic R-SuperHyperMatching” since the maximum neutrosophic cardinality never happens for this neutrosophic style of the neutrosophic SuperHyperSet and beyond that there’s no neutrosophic connection inside as mentioned in first neutrosophic case in the forms of drawback for this selected neutrosophic SuperHyperSet. Let
Comes up. This neutrosophic case implies having the neutrosophic style of on-quasi-triangle neutrosophic style on the every neutrosophic elements of this neutrosophic SuperHyperSet. Precisely, the neutrosophic R-SuperHyperMatching is the neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices such that some neutrosophic amount of the neutrosophic SuperHyperVertices are on-quasi-triangle neutrosophic style. The neutrosophic cardinality of the v SuperHypeSet
Is the maximum in comparison to the neutrosophic SuperHyperSet
But the lower neutrosophic bound is up. Thus the minimum neutrosophic cardinality of the maximum neutrosophic cardinality ends up the neutrosophic discussion. The first neutrosophic term refers to the neutrosophic setting of the neutrosophic SuperHyperGraph but this key point is enough since there’s a neutrosophic SuperHyperClass of a neutrosophic SuperHyperGraph has no on-quasi-triangle neutrosophic style amid some amount of its neutrosophic SuperHyperVertices. This neutrosophic setting of the neutrosophic SuperHyperModel proposes a neutrosophic SuperHyperSet has only some amount neutrosophic SuperHyperVertices from one neutrosophic SuperHyperEdge such that there’s no neutrosophic amount of neutrosophic SuperHyperEdges more than one involving these some amount of these neutrosophic SuperHyperVertices. The neutrosophic cardinality of this neutrosophic SuperHyperSet is the maximum and the neutrosophic case is occurred in the minimum neutrosophic situation. To sum them up, the neutrosophic SuperHyperSet
Has the maximum neutrosophic cardinality such that
Contains some neutrosophic SuperHyperVertices such that there’s distinct-covers-order-amount neutrosophic SuperHyperEdges for amount of neutrosophic SuperHyperVertices taken from the neutrosophic SuperHyperSet
It means that the neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices
Is a neutrosophic R-SuperHyperMatching for the neutrosophic SuperHyperGraph as used neutrosophic background in the neutrosophic terms of worst neutrosophic case and the common theme of the lower neutrosophic bound occurred in the specific neutrosophic SuperHyperClasses of the neutrosophic SuperHyperGraphs which are neutrosophic free-quasi-triangle.
Assume a neutrosophic SuperHyperEdge
has
z neutrosophic number of the neutrosophic SuperHyperVertices. Then every neutrosophic SuperHyperVertex has at least no neutrosophic SuperHyperEdge with others in common. Thus those neutrosophic SuperHyperVertices have the eligibles to be contained in a neutrosophic R-SuperHyperMatching. Those neutrosophic SuperHyperVertices are potentially included in a neutrosophic style-R-SuperHyperMatching. Formally, consider
Are the neutrosophic SuperHyperVertices of a neutrosophic SuperHyperEdge
Thus
where the ∼ isn’t an equivalence relation but only the symmetric relation on the neutrosophic SuperHyperVertices of the neutrosophic SuperHyperGraph. The formal definition is as follows.
if and only if
and
are the neutrosophic SuperHyperVertices and there’s only and only one neutrosophic SuperHyperEdge
between the neutrosophic SuperHyperVertices
and
The other definition for the neutrosophic SuperHyperEdge
in the terms of neutrosophic R-SuperHyperMatching is
This definition coincides with the definition of the neutrosophic R-SuperHyperMatching but with slightly differences in the maximum neutrosophic cardinality amid those neutrosophic type-SuperHyperSets of the neutrosophic SuperHyperVertices. Thus the neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices,
and
is formalized with mathematical literatures on the neutrosophic R-SuperHyperMatching. Let
be defined as
and
are the neutrosophic SuperHyperVertices belong to the neutrosophic SuperHyperEdge
Thus,
Or
But with the slightly differences,
Thus
is a neutrosophic quasi-R-SuperHyperMatching where
is fixed that means
for all neutrosophic intended SuperHyperVertices but in a neutrosophic SuperHyperMatching,
could be different and it’s not unique. To sum them up, in a connected neutrosophic SuperHyperGraph
If a neutrosophic SuperHyperEdge
has
z neutrosophic SuperHyperVertices, then the neutrosophic cardinality of the neutrosophic R-SuperHyperMatching is at least
It’s straightforward that the neutrosophic cardinality of the neutrosophic R-SuperHyperMatching is at least the maximum neutrosophic number of neutrosophic SuperHyperVertices of the neutrosophic SuperHyperEdges with the maximum number of the neutrosophic SuperHyperEdges. In other words, the maximum number of the neutrosophic SuperHyperEdges contains the maximum neutrosophic number of neutrosophic SuperHyperVertices are renamed to neutrosophic SuperHyperMatching in some cases but the maximum number of the neutrosophic SuperHyperEdge with the maximum neutrosophic number of neutrosophic SuperHyperVertices, has the neutrosophic SuperHyperVertices are contained in a neutrosophic R-SuperHyperMatching.
The obvious SuperHyperGraph has no neutrosophic SuperHyperEdges. But the non-obvious neutrosophic SuperHyperModel is up. The quasi-SuperHyperModel addresses some issues about the neutrosophic optimal SuperHyperObject. It specially delivers some remarks on the neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices such that there’s distinct amount of neutrosophic SuperHyperEdges for distinct amount of neutrosophic SuperHyperVertices up to all taken from that neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices but this neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices is either has the maximum neutrosophic SuperHyperCardinality or it doesn’t have maximum neutrosophic SuperHyperCardinality. In a non-obvious SuperHyperModel, there’s at least one neutrosophic SuperHyperEdge containing at least all neutrosophic SuperHyperVertices. Thus it forms a neutrosophic quasi-R-SuperHyperMatching where the neutrosophic completion of the neutrosophic incidence is up in that. Thus it’s, literarily, a neutrosophic embedded R-SuperHyperMatching. The SuperHyperNotions of embedded SuperHyperSet and quasi-SuperHyperSet coincide. In the original setting, these types of SuperHyperSets only don’t satisfy on the maximum SuperHyperCardinality. Thus the embedded setting is elected such that those SuperHyperSets have the maximum neutrosophic SuperHyperCardinality and they’re neutrosophic SuperHyperOptimal. The less than two distinct types of neutrosophic SuperHyperVertices are included in the minimum neutrosophic style of the embedded neutrosophic R-SuperHyperMatching. The interior types of the neutrosophic SuperHyperVertices are deciders. Since the neutrosophic number of SuperHyperNeighbors are only affected by the interior neutrosophic SuperHyperVertices. The common connections, more precise and more formal, the perfect unique connections inside the neutrosophic SuperHyperSet for any distinct types of neutrosophic SuperHyperVertices pose the neutrosophic R-SuperHyperMatching. Thus neutrosophic exterior SuperHyperVertices could be used only in one neutrosophic SuperHyperEdge and in neutrosophic SuperHyperRelation with the interior neutrosophic SuperHyperVertices in that neutrosophic SuperHyperEdge. In the embedded neutrosophic SuperHyperMatching, there’s the usage of exterior neutrosophic SuperHyperVertices since they’ve more connections inside more than outside. Thus the title “exterior” is more relevant than the title “interior”. One neutrosophic SuperHyperVertex has no connection, inside. Thus, the neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices with one SuperHyperElement has been ignored in the exploring to lead on the optimal case implying the neutrosophic R-SuperHyperMatching. The neutrosophic R-SuperHyperMatching with the exclusion of the exclusion of all neutrosophic SuperHyperVertices in one neutrosophic SuperHyperEdge and with other terms, the neutrosophic R-SuperHyperMatching with the inclusion of all neutrosophic SuperHyperVertices in one neutrosophic SuperHyperEdge, is a neutrosophic quasi-R-SuperHyperMatching. To sum them up, in a connected non-obvious neutrosophic SuperHyperGraph There’s only one neutrosophic SuperHyperEdge has only the maximum possibilities of the distinct interior neutrosophic SuperHyperVertices inside of any given neutrosophic quasi-R-SuperHyperMatching minus all neutrosophic SuperHypeNeighbor to some of them but not all of them. In other words, there’s only an unique neutrosophic SuperHyperEdge has only two distinct neutrosophic SuperHyperVertices in an neutrosophic quasi-R-SuperHyperMatching, minus all neutrosophic SuperHypeNeighbor to some of them but not all of them.
The main definition of the neutrosophic R-SuperHyperMatching has two titles. a neutrosophic quasi-R-SuperHyperMatching and its corresponded quasi-maximum neutrosophic R-SuperHyperCardinality are two titles in the terms of quasi-R-styles. For any neutrosophic number, there’s a neutrosophic quasi-R-SuperHyperMatching with that quasi-maximum neutrosophic SuperHyperCardinality in the terms of the embedded neutrosophic SuperHyperGraph. If there’s an embedded neutrosophic SuperHyperGraph, then the neutrosophic quasi-SuperHyperNotions lead us to take the collection of all the neutrosophic quasi-R-SuperHyperMatchings for all neutrosophic numbers less than its neutrosophic corresponded maximum number. The essence of the neutrosophic SuperHyperMatching ends up but this essence starts up in the terms of the neutrosophic quasi-R-SuperHyperMatching, again and more in the operations of collecting all the neutrosophic quasi-R-SuperHyperMatchings acted on the all possible used formations of the neutrosophic SuperHyperGraph to achieve one neutrosophic number. This neutrosophic number is considered as the equivalence class for all corresponded quasi-R-SuperHyperMatchings. Let
and
be a neutrosophic number, a neutrosophic SuperHyperSet and a neutrosophic SuperHyperMatching. Then
As its consequences, the formal definition of the neutrosophic SuperHyperMatching is re-formalized and redefined as follows.
To get more precise perceptions, the follow-up expressions propose another formal technical definition for the neutrosophic SuperHyperMatching.
In more concise and more convenient ways, the modified definition for the neutrosophic SuperHyperMatching poses the upcoming expressions.
To translate the statement to this mathematical literature, the formulae will be revised.
And then,
To get more visions in the closer look-up, there’s an overall overlook.
Now, the extension of these types of approaches is up. Since the new term, “neutrosophic SuperHyperNeighborhood”, could be redefined as the collection of the neutrosophic SuperHyperVertices such that any amount of its neutrosophic SuperHyperVertices are incident to a neutrosophic SuperHyperEdge. It’s, literarily, another name for “neutrosophic Quasi-SuperHyperMatching” but, precisely, it’s the generalization of “neutrosophic Quasi-SuperHyperMatching” since “neutrosophic Quasi-SuperHyperMatching” happens “neutrosophic SuperHyperMatching” in a neutrosophic SuperHyperGraph as initial framework and background but “neutrosophic SuperHyperNeighborhood” may not happens “neutrosophic SuperHyperMatching” in a neutrosophic SuperHyperGraph as initial framework and preliminarily background since there are some ambiguities about the neutrosophic SuperHyperCardinality arise from it. To get orderly keywords, the terms, “neutrosophic SuperHyperNeighborhood”, “neutrosophic Quasi-SuperHyperMatching”, and “neutrosophic SuperHyperMatching” are up.
Thus, let
and
be a neutrosophic number, a neutrosophic SuperHyperNeighborhood and a neutrosophic SuperHyperMatching and the new terms are up.
And with go back to initial structure,
Thus, in a connected neutrosophic SuperHyperGraph
The all interior neutrosophic SuperHyperVertices belong to any neutrosophic quasi-R-SuperHyperMatching if for any of them, and any of other corresponded neutrosophic SuperHyperVertex, some interior neutrosophic SuperHyperVertices are mutually neutrosophic SuperHyperNeighbors with no neutrosophic exception at all minus all neutrosophic SuperHypeNeighbors to any amount of them.
To make sense with the precise words in the terms of “R-’, the follow-up illustrations are coming up. The following neutrosophic SuperHyperSet of neutrosophic SuperHyperVertices is the simple neutrosophic type-SuperHyperSet of the neutrosophic R-SuperHyperMatching.
The neutrosophic SuperHyperSet of neutrosophic SuperHyperVertices,
Is the simple neutrosophic type-SuperHyperSet of the neutrosophic R-SuperHyperMatching. The neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices,
Is an
neutrosophic R-SuperHyperMatching for an neutrosophic SuperHyperGraph
is a neutrosophic type-SuperHyperSet with
the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet
S of neutrosophic SuperHyperVertices such that there’s no a neutrosophic SuperHyperEdge amid some neutrosophic SuperHyperVertices instead of all given by
neutrosophic SuperHyperMatching is related to the neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices,
There’s
not only
one neutrosophic SuperHyperVertex
inside the intended neutrosophic SuperHyperSet. Thus the non-obvious neutrosophic SuperHyperMatching is up. The obvious simple neutrosophic type-SuperHyperSet called the neutrosophic SuperHyperMatching is a neutrosophic SuperHyperSet
includes only
one neutrosophic SuperHyperVertex. But the neutrosophic SuperHyperSet of neutrosophic SuperHyperVertices,
doesn’t have less than two SuperHyperVertices
inside the intended neutrosophic SuperHyperSet since they’ve come from at least so far an SuperHyperEdge. Thus the non-obvious simple neutrosophic type-SuperHyperSet of the neutrosophic R-SuperHyperMatching
is up. To sum them up, the neutrosophic SuperHyperSet of neutrosophic SuperHyperVertices,
Is the non-obvious simple neutrosophic type-SuperHyperSet of the neutrosophic R-SuperHyperMatching. Since the neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices,
or
is an neutrosophic R-SuperHyperMatching
for an neutrosophic SuperHyperGraph
is the neutrosophic SuperHyperSet
S of neutrosophic SuperHyperVertices such that there’s no a neutrosophic SuperHyperEdge for some neutrosophic SuperHyperVertices instead of all given by that neutrosophic type-SuperHyperSet called the neutrosophic SuperHyperMatching
and it’s an neutrosophic
SuperHyperMatching. Since it
’s the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet
S of neutrosophic SuperHyperVertices such that there’s no a neutrosophic SuperHyperEdge for some amount neutrosophic SuperHyperVertices instead of all given by that neutrosophic type-SuperHyperSet called the neutrosophic SuperHyperMatching. There isn’t only less than two neutrosophic SuperHyperVertices
inside the intended neutrosophic SuperHyperSet,
Thus the non-obvious neutrosophic R-SuperHyperMatching,
is up. The non-obvious simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching, not:
Is the neutrosophic SuperHyperSet, not:
does includes only less than two SuperHyperVertices in a connected neutrosophic SuperHyperGraph
but it’s impossible in the case, they’ve corresponded to an SuperHyperEdge. It’s interesting to mention that the only non-obvious simple neutrosophic type-SuperHyperSet called the
amid those obvious[non-obvious] simple neutrosophic type-SuperHyperSets called the
is only and only
In a connected neutrosophic SuperHyperGraph
with a illustrated SuperHyperModeling. It’s also, not only a neutrosophic free-triangle embedded SuperHyperModel and a neutrosophic on-triangle embedded SuperHyperModel but also it’s a neutrosophic stable embedded SuperHyperModel. But all only non-obvious simple neutrosophic type-SuperHyperSets of the neutrosophic R-SuperHyperMatching amid those obvious simple neutrosophic type-SuperHyperSets of the neutrosophic SuperHyperMatching, are
In a connected neutrosophic SuperHyperGraph
To sum them up, assume a connected loopless neutrosophic SuperHyperGraph
Then in the worst case, literally,
is a neutrosophic R-SuperHyperMatching. In other words, the least cardinality, the lower sharp bound for the cardinality, of a neutrosophic R-SuperHyperMatching is the cardinality of
To sum them up, in a connected neutrosophic SuperHyperGraph
The all interior neutrosophic SuperHyperVertices belong to any neutrosophic quasi-R-SuperHyperMatching if for any of them, and any of other corresponded neutrosophic SuperHyperVertex, some interior neutrosophic SuperHyperVertices are mutually neutrosophic SuperHyperNeighbors with no neutrosophic exception at all minus all neutrosophic SuperHypeNeighbors to any amount of them.
Assume a connected neutrosophic SuperHyperGraph Let a neutrosophic SuperHyperEdge has some neutrosophic SuperHyperVertices Consider all neutrosophic numbers of those neutrosophic SuperHyperVertices from that neutrosophic SuperHyperEdge excluding excluding more than r distinct neutrosophic SuperHyperVertices, exclude to any given neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices. Consider there’s a neutrosophic R-SuperHyperMatching with the least cardinality, the lower sharp neutrosophic bound for neutrosophic cardinality. Assume a connected neutrosophic SuperHyperGraph The neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices is a neutrosophic SuperHyperSet S of the neutrosophic SuperHyperVertices such that there’s a neutrosophic SuperHyperEdge to have some neutrosophic SuperHyperVertices uniquely but it isn’t a neutrosophic R-SuperHyperMatching. Since it doesn’t have the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet S of neutrosophic SuperHyperVertices such that there’s a neutrosophic SuperHyperEdge to have some SuperHyperVertices uniquely. The neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices is the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet S of neutrosophic SuperHyperVertices but it isn’t a neutrosophic R-SuperHyperMatching. Since it doesn’t do the neutrosophic procedure such that such that there’s a neutrosophic SuperHyperEdge to have some neutrosophic SuperHyperVertices uniquely [there are at least one neutrosophic SuperHyperVertex outside implying there’s, sometimes in the connected neutrosophic SuperHyperGraph a neutrosophic SuperHyperVertex, titled its neutrosophic SuperHyperNeighbor, to that neutrosophic SuperHyperVertex in the neutrosophic SuperHyperSet S so as S doesn’t do “the neutrosophic procedure”.]. There’s only one neutrosophic SuperHyperVertex outside the intended neutrosophic SuperHyperSet, in the terms of neutrosophic SuperHyperNeighborhood. Thus the obvious neutrosophic R-SuperHyperMatching, is up. The obvious simple neutrosophic type-SuperHyperSet of the neutrosophic R-SuperHyperMatching, is a neutrosophic SuperHyperSet, includes only all neutrosophic SuperHyperVertices does forms any kind of neutrosophic pairs are titled neutrosophic SuperHyperNeighbors in a connected neutrosophic SuperHyperGraph Since the neutrosophic SuperHyperSet of the neutrosophic SuperHyperVertices is the maximum neutrosophic SuperHyperCardinality of a neutrosophic SuperHyperSet S of neutrosophic SuperHyperVertices such that there’s a neutrosophic SuperHyperEdge to have some neutrosophic SuperHyperVertices uniquely. Thus, in a connected neutrosophic SuperHyperGraph Any neutrosophic R-SuperHyperMatching only contains all interior neutrosophic SuperHyperVertices and all exterior neutrosophic SuperHyperVertices from the unique neutrosophic SuperHyperEdge where there’s any of them has all possible neutrosophic SuperHyperNeighbors in and there’s all neutrosophic SuperHyperNeighborhoods in with no exception minus all neutrosophic SuperHypeNeighbors to some of them not all of them but everything is possible about neutrosophic SuperHyperNeighborhoods and neutrosophic SuperHyperNeighbors out.
The SuperHyperNotion, namely, SuperHyperMatching, is up. There’s neither empty SuperHyperEdge nor loop SuperHyperEdge. The following neutrosophic SuperHyperSet of neutrosophic SuperHyperEdges[SuperHyperVertices] is the simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching. The neutrosophic SuperHyperSet of neutrosophic SuperHyperEdges[SuperHyperVertices],
is the simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching. The neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices],
Is an
neutrosophic SuperHyperMatching for an neutrosophic SuperHyperGraph
is a neutrosophic type-SuperHyperSet with
the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet
S of neutrosophic SuperHyperEdges[SuperHyperVertices] such that there’s no neutrosophic SuperHyperVertex of a neutrosophic SuperHyperEdge is common and there’s an neutrosophic SuperHyperEdge for all neutrosophic SuperHyperVertices. There are
not only
two neutrosophic SuperHyperVertices
inside the intended neutrosophic SuperHyperSet. Thus the non-obvious neutrosophic SuperHyperMatching is up. The obvious simple neutrosophic type-SuperHyperSet called the neutrosophic SuperHyperMatching is a neutrosophic SuperHyperSet
includes only
two neutrosophic SuperHyperVertices. But the neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices],
Doesn’t have less than three SuperHyperVertices
inside the intended neutrosophic SuperHyperSet. Thus the non-obvious simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching
is up. To sum them up, the neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices],
Is the non-obvious simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching. Since the neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices],
Is an neutrosophic SuperHyperMatching
for an neutrosophic SuperHyperGraph
is the neutrosophic SuperHyperSet
S of neutrosophic SuperHyperVertices such that there’s no a neutrosophic SuperHyperEdge for some neutrosophic SuperHyperVertices given by that neutrosophic type-SuperHyperSet called the neutrosophic SuperHyperMatching
and it’s an neutrosophic
SuperHyperMatching. Since it
’s the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet
S of neutrosophic SuperHyperEdges[SuperHyperVertices] such that there’s no neutrosophic SuperHyperVertex of a neutrosophic SuperHyperEdge is common and there’s an neutrosophic SuperHyperEdge for all neutrosophic SuperHyperVertices. There aren’t only less than three neutrosophic SuperHyperVertices
inside the intended neutrosophic SuperHyperSet,
Thus the non-obvious neutrosophic SuperHyperMatching,
Is up. The obvious simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperMatching, not:
Is the neutrosophic SuperHyperSet, not:
Does includes only less than three SuperHyperVertices in a connected neutrosophic SuperHyperGraph
It’s interesting to mention that the only non-obvious simple neutrosophic type-SuperHyperSet called the
amid those obvious[non-obvious] simple neutrosophic type-SuperHyperSets called the
is only and only
In a connected neutrosophic SuperHyperGraph
□
Example 26. In the neutrosophic Figure (??), the connected neutrosophic SuperHyperWheel is neutrosophic highlighted and featured. The obtained neutrosophic SuperHyperSet, by the Algorithm in previous result, of the neutrosophic SuperHyperVertices of the connected neutrosophic SuperHyperWheel in the neutrosophic SuperHyperModel (??), is the neutrosophic SuperHyperMatching.