Submitted:
15 January 2023
Posted:
16 January 2023
You are already at the latest version
Abstract
In this research, assume a SuperHyperGraph. Then a neutrosophic SuperHyperMatching \(\mathcal{C}(NSHG)\) for a neutrosophic SuperHyperGraph $NSHG:(V,E)$ is the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet \(S\) of high neutrosophic cardinality neutrosophic SuperHyperEdges such that there's no neutrosophic SuperHyperVertex not to in a neutrosophic SuperHyperEdge and there's no neutrosophic SuperHyperEdge to have a neutrosophic SuperHyperVertex in a neutrosophic SuperHyperEdge; a neutrosophic SuperHyperMatching SuperHyperPolynomial \(\mathcal{C}(NSHG)\) for a neutrosophic SuperHyperGraph $NSHG:(V,E)$ is the neutrosophic SuperHyperPolynomial contains the neutrosophic coefficients defined as the neutrosophic number of the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet \(S\) of high neutrosophic cardinality neutrosophic SuperHyperEdges such that there's no neutrosophic SuperHyperVertex not to in a neutrosophic SuperHyperEdge and there's no neutrosophic SuperHyperEdge to have a neutrosophic SuperHyperVertex in a neutrosophic SuperHyperEdge and the neutrosophic power is neutrosophicly corresponded to its neutrosophic coefficient; a neutrosophic R-SuperHyperMatching \(\mathcal{C}(NSHG)\) for a neutrosophic SuperHyperGraph $NSHG:(V,E)$ is the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet \(S\) of high neutrosophic cardinality neutrosophic SuperHyperVertices such that there's no neutrosophic SuperHyperVertex not to in a neutrosophic SuperHyperEdge and there's no neutrosophic SuperHyperEdge to have a neutrosophic SuperHyperVertex in a neutrosophic SuperHyperEdge; a neutrosophic R-SuperHyperMatching SuperHyperPolynomial \(\mathcal{C}(NSHG)\) for a neutrosophic SuperHyperGraph $NSHG:(V,E)$ is the neutrosophic SuperHyperPolynomial contains the neutrosophic coefficients defined as the neutrosophic number of the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet \(S\) of high neutrosophic cardinality neutrosophic SuperHyperVertices such that there's no neutrosophic SuperHyperVertex not to in a neutrosophic SuperHyperEdge and there's no neutrosophic SuperHyperEdge to have a neutrosophic SuperHyperVertex in a neutrosophic SuperHyperEdge and the neutrosophic power is neutrosophicly corresponded to its neutrosophic coefficient. It's useful to define a ``neutrosophic'' version of a SuperHyperMatching . Since there's more ways to get type-results to make a SuperHyperMatching more understandable. For the sake of having neutrosophic SuperHyperMatching, there's a need to ``redefine'' the notion of a ``SuperHyperMatching ''. A basic familiarity with neutrosophic SuperHyperMatching theory, SuperHyperGraphs theory, and neutrosophic SuperHyperGraphs theory are proposed.
Keywords:
Neutrosophic SuperHyperGraph
; (Neutrosophic) SuperHyperMatching
; Cancer's Neutrosophic Recognition
AMS Subject Classification: 05C17, 05C22, 05E45
1. Background
Fuzzy set in Ref.[57] by Zadeh (1965), intuitionistic fuzzy sets in Ref. [44] by Atanassov (1986), a first step to a theory of the intuitionistic fuzzy graphs in Ref. [54] by Shannon and Atanassov (1994), a unifying field in logics neutrosophy: neutrosophic probability, set and logic, rehoboth in Ref. [55] by Smarandache (1998), single-valued neutrosophic sets in Ref. [56] by Wang et al. (2010), single-valued neutrosophic graphs in Ref. [48] by Broumi et al. (2016), operations on single-valued neutrosophic graphs in Ref. [40] by Akram and Shahzadi (2017), neutrosophic soft graphs in Ref. [53] by Shah and Hussain (2016), bounds on the average and minimum attendance in preference-based activity scheduling in Ref. [42] by Aronshtam and Ilani (2022), investigating the recoverable robust single machine scheduling problem under interval uncertainty in Ref. [47] by Bold and Goerigk (2022), polyhedra associated with locating-dominating, open locating-dominating and locating total-dominating sets in graphs in Ref. [41] by G. Argiroffo et al. (2022), a Vizing-type result for semi-total domination in Ref. [43] by J. Asplund et al. (2020), total domination cover rubbling in Ref. [45] by R.A. Beeler et al. (2020), on the global total k-domination number of graphs in Ref. [46] by S. Bermudo et al. (2019), maker–breaker total domination game in Ref. [49] by V. Gledel et al. (2020), a new upper bound on the total domination number in graphs with minimum degree six in Ref. [50] by M.A. Henning, and A. Yeo (2021), effect of predomination and vertex removal on the game total domination number of a graph in Ref. [51] by V. Irsic (2019), hardness results of global total k-domination problem in graphs in Ref. [52] by B.S. Panda, and P. Goyal (2021), are studied.
Look at [35,36,37,38,39] for further researches on this topic. See the seminal researches [1,2,3]. The formalization of the notions on the framework of Extreme Failed SuperHyperClique theory, Neutrosophic Failed SuperHyperClique theory, and (Neutrosophic) SuperHyperGraphs theory at [4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32]. Two popular research books in Scribd in the terms of high readers, 2702 and 3466 respectively, on neutrosophic science is on [33,34].
2. Motivation and Contributions
In this research, there are some ideas in the featured frameworks of motivations.
Question 1.
How to define the SuperHyperNotions and to do research on them to find the “ amount of SuperHyperMatching” of either individual of cells or the groups of cells based on the fixed cell or the fixed group of cells, extensively, the “amount of SuperHyperMatching” based on the fixed groups of cells or the fixed groups of group of cells?
Question 2.
What are the best descriptions for the “Cancer’s Recognition” in terms of these messy and dense SuperHyperModels where embedded notions are illustrated?
It’s motivation to find notions to use in this dense model is titled “SuperHyperGraphs”. Thus it motivates us to define different types of “ SuperHyperMatching” and “neutrosophic SuperHyperMatching” on “SuperHyperGraph” and “Neutrosophic SuperHyperGraph”.
3. Preliminaries
In this subsection, the basic material which is used in this research, is presented. Also, the new ideas and their clarifications are elicited.
Definition 3.
((neutrosophic) SuperHyperMatching).
Assume a SuperHyperGraph. Then
- an extreme SuperHyperMatching for a neutrosophic SuperHyperGraph is the maximum cardinality of a SuperHyperSet S of high cardinality SuperHyperEdges such that there’s no SuperHyperVertex not to in a SuperHyperEdge and there’s no SuperHyperEdge to have a SuperHyperVertex in a SuperHyperEdge;
- a neutrosophic SuperHyperMatching for a neutrosophic SuperHyperGraph is the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet S of high neutrosophic cardinality neutrosophic SuperHyperEdges such that there’s no neutrosophic SuperHyperVertex not to in a neutrosophic SuperHyperEdge and there’s no neutrosophic SuperHyperEdge to have a neutrosophic SuperHyperVertex in a neutrosophic SuperHyperEdge;
- an extreme SuperHyperMatching SuperHyperPolynomial for a neutrosophic SuperHyperGraph is the extreme SuperHyperPolynomial contains the coefficients defined as the number of the maximum cardinality of a SuperHyperSet S of high cardinality SuperHyperEdges such that there’s no SuperHyperVertex not to in a SuperHyperEdge and there’s no SuperHyperEdge to have a SuperHyperVertex in a SuperHyperEdge and the power is corresponded to its coefficient;
- a neutrosophic SuperHyperMatching SuperHyperPolynomial for a neutrosophic SuperHyperGraph is the neutrosophic SuperHyperPolynomial contains the neutrosophic coefficients defined as the neutrosophic number of the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet S of high neutrosophic cardinality neutrosophic SuperHyperEdges such that there’s no neutrosophic SuperHyperVertex not to in a neutrosophic SuperHyperEdge and there’s no neutrosophic SuperHyperEdge to have a neutrosophic SuperHyperVertex in a neutrosophic SuperHyperEdge and the neutrosophic power is neutrosophicly corresponded to its neutrosophic coefficient;
- an extreme R-SuperHyperMatching for a neutrosophic SuperHyperGraph is the maximum cardinality of a SuperHyperSet S of high cardinality SuperHyperVertices such that there’s no SuperHyperVertex not to in a SuperHyperEdge and there’s no SuperHyperEdge to have a SuperHyperVertex in a SuperHyperEdge;
- a neutrosophic R-SuperHyperMatching for a neutrosophic SuperHyperGraph is the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet S of high neutrosophic cardinality neutrosophic SuperHyperVertices such that there’s no neutrosophic SuperHyperVertex not to in a neutrosophic SuperHyperEdge and there’s no neutrosophic SuperHyperEdge to have a neutrosophic SuperHyperVertex in a neutrosophic SuperHyperEdge;
- an extreme R-SuperHyperMatching SuperHyperPolynomial for a neutrosophic SuperHyperGraph is the extreme SuperHyperPolynomial contains the coefficients defined as the number of the maximum cardinality of a SuperHyperSet S of high cardinality SuperHyperVertices such that there’s no SuperHyperVertex not to in a SuperHyperEdge and there’s no SuperHyperEdge to have a SuperHyperVertex in a SuperHyperEdge and the power is corresponded to its coefficient;
- a neutrosophic R-SuperHyperMatching SuperHyperPolynomial for a neutrosophic SuperHyperGraph is the neutrosophic SuperHyperPolynomial contains the neutrosophic coefficients defined as the neutrosophic number of the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet S of high neutrosophic cardinality neutrosophic SuperHyperVertices such that there’s no neutrosophic SuperHyperVertex not to in a neutrosophic SuperHyperEdge and there’s no neutrosophic SuperHyperEdge to have a neutrosophic SuperHyperVertex in a neutrosophic SuperHyperEdge and the neutrosophic power is neutrosophicly corresponded to its neutrosophic coefficient.
Definition 4.
((neutrosophic)SuperHyperMatching).
Assume a SuperHyperGraph. Then
-
an SuperHyperMatching is a maximal of SuperHyperVertices with a maximum cardinality such that either of the following expressions hold for the (neutrosophic) cardinalities of SuperHyperNeighbors ofThe Expression (3.1), holds if S is an SuperHyperOffensive. And the Expression (3.2), holds if S is an SuperHyperDefensive;
-
a neutrosophic SuperHyperMatching is a maximal neutrosophic of SuperHyperVertices with maximum neutrosophic cardinality such that either of the following expressions hold for the neutrosophic cardinalities of SuperHyperNeighbors ofThe Expression (3.3), holds if S is a neutrosophic SuperHyperOffensive. And the Expression (3.4), holds if S is a neutrosophic SuperHyperDefensive.
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.
“neutrosophic SuperHyperMatching”
neutrosophic SuperHyperMatching,
Example 5.
-
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 theamid those obvious[non-obvious] simple neutrosophic type-SuperHyperSets called the“neutrosophic SuperHyperMatching”is only and onlyneutrosophic SuperHyperMatching,
- 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 theamid those obvious[non-obvious] simple neutrosophic type-SuperHyperSets called the“neutrosophic SuperHyperMatching”is only and onlyneutrosophic SuperHyperMatching,
- 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 theamid those obvious[non-obvious] simple neutrosophic type-SuperHyperSets called the“neutrosophic SuperHyperMatching”is only and onlyneutrosophic SuperHyperMatching,
- 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 onThe 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 theamid those obvious[non-obvious] simple neutrosophic type-SuperHyperSets called the“neutrosophic SuperHyperMatching”is only and onlyneutrosophic SuperHyperMatching,
- 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 theamid those obvious[non-obvious] simple neutrosophic type-SuperHyperSets called the“neutrosophic SuperHyperMatching”is only and onlyneutrosophic SuperHyperMatching,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 theamid those obvious[non-obvious] simple neutrosophic type-SuperHyperSets called the“neutrosophic SuperHyperMatching”is only and onlyneutrosophic SuperHyperMatching,
- 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 theamid those obvious[non-obvious] simple neutrosophic type-SuperHyperSets called the“neutrosophic SuperHyperMatching”is only and onlyneutrosophic SuperHyperMatching,
- 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 theamid those obvious[non-obvious] simple neutrosophic type-SuperHyperSets called the“neutrosophic SuperHyperMatching”is only and onlyneutrosophic SuperHyperMatching,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 theamid those obvious[non-obvious] simple neutrosophic type-SuperHyperSets called the“neutrosophic SuperHyperMatching”is only and onlyneutrosophic SuperHyperMatching,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 theamid those obvious[non-obvious] simple neutrosophic type-SuperHyperSets called the“neutrosophic SuperHyperMatching”is only and onlyneutrosophic SuperHyperMatching,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 theamid those obvious[non-obvious] simple neutrosophic type-SuperHyperSets called the“neutrosophic SuperHyperMatching”is only and onlyneutrosophic SuperHyperMatching,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 theamid those obvious[non-obvious] simple neutrosophic type-SuperHyperSets called the“neutrosophic SuperHyperMatching”is only and onlyneutrosophic SuperHyperMatching,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 theamid those obvious[non-obvious] simple neutrosophic type-SuperHyperSets called the“neutrosophic SuperHyperMatching”is only and onlyneutrosophic SuperHyperMatching,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 theamid those obvious[non-obvious] simple neutrosophic type-SuperHyperSets called the“neutrosophic SuperHyperMatching”is only and onlyneutrosophic SuperHyperMatching,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 theamid those obvious[non-obvious] simple neutrosophic type-SuperHyperSets called the“neutrosophic SuperHyperMatching”is only and onlyneutrosophic SuperHyperMatching,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 theamid those obvious[non-obvious] simple neutrosophic type-SuperHyperSets called the“neutrosophic SuperHyperMatching”is only and onlyneutrosophic SuperHyperMatching,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 theamid those obvious[non-obvious] simple neutrosophic type-SuperHyperSets called the“neutrosophic SuperHyperMatching”is only and onlyneutrosophic SuperHyperMatching,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 theamid those obvious[non-obvious] simple neutrosophic type-SuperHyperSets called the“neutrosophic SuperHyperMatching”is only and onlyneutrosophic SuperHyperMatching,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 theamid those obvious[non-obvious] simple neutrosophic type-SuperHyperSets called the“neutrosophic SuperHyperMatching”is only and onlyneutrosophic SuperHyperMatching,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 theamid those obvious[non-obvious] simple neutrosophic type-SuperHyperSets called the“neutrosophic SuperHyperMatching”is only and onlyneutrosophic SuperHyperMatching,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
“neutrosophic R-SuperHyperMatching”
neutrosophic R-SuperHyperMatching,
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. □
“neutrosophic R-SuperHyperMatching”
neutrosophic R-SuperHyperMatching,
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
“neutrosophic R-SuperHyperMatching”
neutrosophic R-SuperHyperMatching,
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
“neutrosophic R-SuperHyperMatching”
neutrosophic R-SuperHyperMatching,
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
“neutrosophic R-SuperHyperMatching”
neutrosophic R-SuperHyperMatching,
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
“neutrosophic R-SuperHyperMatching”
neutrosophic R-SuperHyperMatching,
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
“neutrosophic R-SuperHyperMatching”
neutrosophic R-SuperHyperMatching,
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 □
“neutrosophic SuperHyperMatching”
neutrosophic SuperHyperMatching,
Example 16.
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
“neutrosophic R-SuperHyperMatching”
neutrosophic R-SuperHyperMatching,
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 □
“neutrosophic SuperHyperMatching”
neutrosophic SuperHyperMatching,
Example 18.
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
“neutrosophic R-SuperHyperMatching”
neutrosophic R-SuperHyperMatching,
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 □
“neutrosophic SuperHyperMatching”
neutrosophic SuperHyperMatching,
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
“neutrosophic R-SuperHyperMatching”
neutrosophic R-SuperHyperMatching,
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 □
“neutrosophic SuperHyperMatching”
neutrosophic SuperHyperMatching,
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.
“neutrosophic R-SuperHyperMatching”
neutrosophic R-SuperHyperMatching,
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 □
“neutrosophic SuperHyperMatching”
neutrosophic SuperHyperMatching,
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
“neutrosophic R-SuperHyperMatching”
neutrosophic R-SuperHyperMatching,
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 □
“neutrosophic SuperHyperMatching”
neutrosophic SuperHyperMatching,
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.
6. General Neutrosophic Results
For the neutrosophic SuperHyperMatching theory, some general results are introduced in the setting of SuperHyperGraph theory and neutrosophic SuperHyperGraph theory.
Remark 27.
Let remind that the neutrosophic SuperHyperMatching is “redefined” on the positions of the alphabets.
Corollary 28.
Assume neutrosophic SuperHyperMatching. Then
plus one SuperHypeNeighbor to one. Where is the unary operation on the SuperHyperVertices of the SuperHyperGraph to assign the determinacy, the indeterminacy and the neutrality, for respectively.
Corollary 29.
Assume a neutrosophic SuperHyperGraph on the same identical letter of the alphabet. Then the notion of neutrosophic SuperHyperMatching and neutrosophic SuperHyperMatching coincide.
Corollary 30.
Assume a neutrosophic SuperHyperGraph on the same identical letter of the alphabet. Then a consecutive sequence of the SuperHyperVertices is a neutrosophic SuperHyperMatching if and only if it’s a neutrosophic SuperHyperMatching.
Corollary 31.
Assume a neutrosophic SuperHyperGraph on the same identical letter of the alphabet. Then a consecutive sequence of the SuperHyperVertices is a strongest SuperHyperCycle if and only if it’s a longest SuperHyperCycle.
Corollary 32.
Assume SuperHyperClasses of a neutrosophic SuperHyperGraph on the same identical letter of the alphabet. Then its neutrosophic SuperHyperMatching is its neutrosophic SuperHyperMatching and reversely.
Corollary 33.
Assume a neutrosophic SuperHyperPath(-/SuperHyperCycle, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel) on the same identical letter of the alphabet. Then its neutrosophic SuperHyperMatching is its neutrosophic SuperHyperMatching and reversely.
Corollary 34.
Assume a neutrosophic SuperHyperGraph. Then its neutrosophic SuperHyperMatching isn’t well-defined if and only if its neutrosophic SuperHyperMatching isn’t well-defined.
Corollary 35.
Assume SuperHyperClasses of a neutrosophic SuperHyperGraph. Then its neutrosophic SuperHyperMatching isn’t well-defined if and only if its neutrosophic SuperHyperMatching isn’t well-defined.
Corollary 36.
Assume a neutrosophic SuperHyperPath(-/SuperHyperCycle, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). Then its neutrosophic SuperHyperMatching isn’t well-defined if and only if its neutrosophic SuperHyperMatching isn’t well-defined.
Corollary 37.
Assume a neutrosophic SuperHyperGraph. Then its neutrosophic SuperHyperMatching is well-defined if and only if its neutrosophic SuperHyperMatching is well-defined.
Corollary 38.
Assume SuperHyperClasses of a neutrosophic SuperHyperGraph. Then its neutrosophic SuperHyperMatching is well-defined if and only if its neutrosophic SuperHyperMatching is well-defined.
Corollary 39.
Assume a neutrosophic SuperHyperPath(-/SuperHyperCycle, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). Then its neutrosophic SuperHyperMatching is well-defined if and only if its neutrosophic SuperHyperMatching is well-defined.
Proposition 40.
Let be a neutrosophic SuperHyperGraph. Then V is
- the dual SuperHyperDefensive neutrosophic SuperHyperMatching;
- the strong dual SuperHyperDefensive neutrosophic SuperHyperMatching;
- the connected dual SuperHyperDefensive neutrosophic SuperHyperMatching;
- the δ-dual SuperHyperDefensive neutrosophic SuperHyperMatching;
- the strong δ-dual SuperHyperDefensive neutrosophic SuperHyperMatching;
- the connected δ-dual SuperHyperDefensive neutrosophic SuperHyperMatching.
Proposition 41.
Let be a neutrosophic SuperHyperGraph. Then ∅ is
- the SuperHyperDefensive neutrosophic SuperHyperMatching;
- the strong SuperHyperDefensive neutrosophic SuperHyperMatching;
- the connected defensive SuperHyperDefensive neutrosophic SuperHyperMatching;
- the δ-SuperHyperDefensive neutrosophic SuperHyperMatching;
- the strong δ-SuperHyperDefensive neutrosophic SuperHyperMatching;
- the connected δ-SuperHyperDefensive neutrosophic SuperHyperMatching.
Proposition 42.
Let be a neutrosophic SuperHyperGraph. Then an independent SuperHyperSet is
- the SuperHyperDefensive neutrosophic SuperHyperMatching;
- the strong SuperHyperDefensive neutrosophic SuperHyperMatching;
- the connected SuperHyperDefensive neutrosophic SuperHyperMatching;
- the δ-SuperHyperDefensive neutrosophic SuperHyperMatching;
- the strong δ-SuperHyperDefensive neutrosophic SuperHyperMatching;
- the connected δ-SuperHyperDefensive neutrosophic SuperHyperMatching.
Proposition 43.
Let be a neutrosophic SuperHyperUniform SuperHyperGraph which is a SuperHyperCycle/SuperHyperPath. Then V is a maximal
- SuperHyperDefensive neutrosophic SuperHyperMatching;
- strong SuperHyperDefensive neutrosophic SuperHyperMatching;
- connected SuperHyperDefensive neutrosophic SuperHyperMatching;
- -SuperHyperDefensive neutrosophic SuperHyperMatching;
- strong -SuperHyperDefensive neutrosophic SuperHyperMatching;
- connected -SuperHyperDefensive neutrosophic SuperHyperMatching;
Where the exterior SuperHyperVertices and the interior SuperHyperVertices coincide.
Proposition 44.
Let be a neutrosophic SuperHyperGraph which is a SuperHyperUniform SuperHyperWheel. Then V is a maximal
- dual SuperHyperDefensive neutrosophic SuperHyperMatching;
- strong dual SuperHyperDefensive neutrosophic SuperHyperMatching;
- connected dual SuperHyperDefensive neutrosophic SuperHyperMatching;
- -dual SuperHyperDefensive neutrosophic SuperHyperMatching;
- strong -dual SuperHyperDefensive neutrosophic SuperHyperMatching;
- connected -dual SuperHyperDefensive neutrosophic SuperHyperMatching;
Where the exterior SuperHyperVertices and the interior SuperHyperVertices coincide.
Proposition 45.
Let be a neutrosophic SuperHyperUniform SuperHyperGraph which is a SuperHyperCycle/SuperHyperPath. Then the number of
- the neutrosophic SuperHyperMatching;
- the neutrosophic SuperHyperMatching;
- the connected neutrosophic SuperHyperMatching;
- the -neutrosophic SuperHyperMatching;
- the strong -neutrosophic SuperHyperMatching;
- the connected -neutrosophic SuperHyperMatching.
is one and it’s only Where the exterior SuperHyperVertices and the interior SuperHyperVertices coincide.
Proposition 46.
Let be a neutrosophic SuperHyperUniform SuperHyperGraph which is a SuperHyperWheel. Then the number of
- the dual neutrosophic SuperHyperMatching;
- the dual neutrosophic SuperHyperMatching;
- the dual connected neutrosophic SuperHyperMatching;
- the dual -neutrosophic SuperHyperMatching;
- the strong dual -neutrosophic SuperHyperMatching;
- the connected dual -neutrosophic SuperHyperMatching.
is one and it’s only Where the exterior SuperHyperVertices and the interior SuperHyperVertices coincide.
Proposition 47.
Let be a neutrosophic SuperHyperUniform SuperHyperGraph which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperComplete SuperHyperMultipartite. Then a SuperHyperSet contains [the SuperHyperCenter and] the half of multiplying r with the number of all the SuperHyperEdges plus one of all the SuperHyperVertices is a
- dual SuperHyperDefensive neutrosophic SuperHyperMatching;
- strong dual SuperHyperDefensive neutrosophic SuperHyperMatching;
- connected dual SuperHyperDefensive neutrosophic SuperHyperMatching;
- -dual SuperHyperDefensive neutrosophic SuperHyperMatching;
- strong -dual SuperHyperDefensive neutrosophic SuperHyperMatching;
- connected -dual SuperHyperDefensive neutrosophic SuperHyperMatching.
Proposition 48.
Let be a neutrosophic SuperHyperUniform SuperHyperGraph which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperComplete SuperHyperMultipartite. Then a SuperHyperSet contains the half of multiplying r with the number of all the SuperHyperEdges plus one of all the SuperHyperVertices in the biggest SuperHyperPart is a
- SuperHyperDefensive neutrosophic SuperHyperMatching;
- strong SuperHyperDefensive neutrosophic SuperHyperMatching;
- connected SuperHyperDefensive neutrosophic SuperHyperMatching;
- δ-SuperHyperDefensive neutrosophic SuperHyperMatching;
- strong δ-SuperHyperDefensive neutrosophic SuperHyperMatching;
- connected δ-SuperHyperDefensive neutrosophic SuperHyperMatching.
Proposition 49.
Let be a neutrosophic SuperHyperUniform SuperHyperGraph which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperComplete SuperHyperMultipartite. Then Then the number of
- dual SuperHyperDefensive neutrosophic SuperHyperMatching;
- strong dual SuperHyperDefensive neutrosophic SuperHyperMatching;
- connected dual SuperHyperDefensive neutrosophic SuperHyperMatching;
- -dual SuperHyperDefensive neutrosophic SuperHyperMatching;
- strong -dual SuperHyperDefensive neutrosophic SuperHyperMatching;
- connected -dual SuperHyperDefensive neutrosophic SuperHyperMatching.
is one and it’s only a SuperHyperSet contains [the SuperHyperCenter and] the half of multiplying r with the number of all the SuperHyperEdges plus one of all the SuperHyperVertices. Where the exterior SuperHyperVertices and the interior SuperHyperVertices coincide.
Proposition 50.
Let be a neutrosophic SuperHyperGraph. The number of connected component is if there’s a SuperHyperSet which is a dual
- SuperHyperDefensive neutrosophic SuperHyperMatching;
- strong SuperHyperDefensive neutrosophic SuperHyperMatching;
- connected SuperHyperDefensive neutrosophic SuperHyperMatching;
- neutrosophic SuperHyperMatching;
- strong 1-SuperHyperDefensive neutrosophic SuperHyperMatching;
- connected 1-SuperHyperDefensive neutrosophic SuperHyperMatching.
Proposition 51.
Let be a neutrosophic SuperHyperGraph. Then the number is at most and the neutrosophic number is at most
Proposition 52.
Let be a neutrosophic SuperHyperGraph which is SuperHyperComplete. The number is and the neutrosophic number is in the setting of dual
- SuperHyperDefensive neutrosophic SuperHyperMatching;
- strong SuperHyperDefensive neutrosophic SuperHyperMatching;
- connected SuperHyperDefensive neutrosophic SuperHyperMatching;
- -SuperHyperDefensive neutrosophic SuperHyperMatching;
- strong -SuperHyperDefensive neutrosophic SuperHyperMatching;
- connected -SuperHyperDefensive neutrosophic SuperHyperMatching.
Proposition 53.
Let be a neutrosophic SuperHyperGraph which is The number is 0 and the neutrosophic number is for an independent SuperHyperSet in the setting of dual
- SuperHyperDefensive neutrosophic SuperHyperMatching;
- strong SuperHyperDefensive neutrosophic SuperHyperMatching;
- connected SuperHyperDefensive neutrosophic SuperHyperMatching;
- 0-SuperHyperDefensive neutrosophic SuperHyperMatching;
- strong 0-SuperHyperDefensive neutrosophic SuperHyperMatching;
- connected 0-SuperHyperDefensive neutrosophic SuperHyperMatching.
Proposition 54.
Let be a neutrosophic SuperHyperGraph which is SuperHyperComplete. Then there’s no independent SuperHyperSet.
Proposition 55.
Let be a neutrosophic SuperHyperGraph which is SuperHyperCycle/SuperHyperPath/SuperHyperWheel. The number is and the neutrosophic number is in the setting of a dual
- SuperHyperDefensive neutrosophic SuperHyperMatching;
- strong SuperHyperDefensive neutrosophic SuperHyperMatching;
- connected SuperHyperDefensive neutrosophic SuperHyperMatching;
- -SuperHyperDefensive neutrosophic SuperHyperMatching;
- strong -SuperHyperDefensive neutrosophic SuperHyperMatching;
- connected -SuperHyperDefensive neutrosophic SuperHyperMatching.
Proposition 56.
Let be a neutrosophic SuperHyperGraph which is SuperHyperStar/complete SuperHyperBipartite/complete SuperHyperMultiPartite. The number is and the neutrosophic number is in the setting of a dual
- SuperHyperDefensive neutrosophic SuperHyperMatching;
- strong SuperHyperDefensive neutrosophic SuperHyperMatching;
- connected SuperHyperDefensive neutrosophic SuperHyperMatching;
- -SuperHyperDefensive neutrosophic SuperHyperMatching;
- strong -SuperHyperDefensive neutrosophic SuperHyperMatching;
- connected -SuperHyperDefensive neutrosophic SuperHyperMatching.
Proposition 57.
Let be a SuperHyperFamily of the neutrosophic SuperHyperGraphs which are from one-type SuperHyperClass which the result is obtained for the individuals. Then the results also hold for the SuperHyperFamily of these specific SuperHyperClasses of the neutrosophic SuperHyperGraphs.
Proposition 58.
Let be a strong neutrosophic SuperHyperGraph. If S is a dual SuperHyperDefensive neutrosophic SuperHyperMatching, then such that
Proposition 59.
Let be a strong neutrosophic SuperHyperGraph. If S is a dual SuperHyperDefensive neutrosophic SuperHyperMatching, then
- S is SuperHyperDominating set;
- there’s such that is SuperHyperChromatic number.
Proposition 60.
Let be a strong neutrosophic SuperHyperGraph. Then
Proposition 61.
Let be a strong neutrosophic SuperHyperGraph which is connected. Then
Proposition 62.
Let be an odd SuperHyperPath. Then
- the SuperHyperSet is a dual SuperHyperDefensive neutrosophic SuperHyperMatching;
- and corresponded SuperHyperSet is ;
- the SuperHyperSets and are only a dual neutrosophic SuperHyperMatching.
Proposition 63.
Let be an even SuperHyperPath. Then
- the set is a dual SuperHyperDefensive neutrosophic SuperHyperMatching;
- and corresponded SuperHyperSets are and
- the SuperHyperSets and are only dual neutrosophic SuperHyperMatching.
Proposition 64.
Let be an even SuperHyperCycle. Then
- the SuperHyperSet is a dual SuperHyperDefensive neutrosophic SuperHyperMatching;
- and corresponded SuperHyperSets are and
- the SuperHyperSets and are only dual neutrosophic SuperHyperMatching.
Proposition 65.
Let be an odd SuperHyperCycle. Then
- the SuperHyperSet is a dual SuperHyperDefensive neutrosophic SuperHyperMatching;
- and corresponded SuperHyperSet is ;
- the SuperHyperSets and are only dual neutrosophic SuperHyperMatching.
Proposition 66.
Let be SuperHyperStar. Then
- the SuperHyperSet is a dual maximal neutrosophic SuperHyperMatching;
- the SuperHyperSets and are only dual neutrosophic SuperHyperMatching.
Proposition 67.
Let be SuperHyperWheel. Then
- the SuperHyperSet is a dual maximal SuperHyperDefensive neutrosophic SuperHyperMatching;
- the SuperHyperSet is only a dual maximal SuperHyperDefensive neutrosophic SuperHyperMatching.
Proposition 68.
Let be an odd SuperHyperComplete. Then
- the SuperHyperSet is a dual SuperHyperDefensive neutrosophic SuperHyperMatching;
- the SuperHyperSet is only a dual SuperHyperDefensive neutrosophic SuperHyperMatching.
Proposition 69.
Let be an even SuperHyperComplete. Then
- the SuperHyperSet is a dual SuperHyperDefensive neutrosophic SuperHyperMatching;
- the SuperHyperSet is only a dual maximal SuperHyperDefensive neutrosophic SuperHyperMatching.
Proposition 70.
Let be a m-SuperHyperFamily of neutrosophic SuperHyperStars with common neutrosophic SuperHyperVertex SuperHyperSet. Then
- the SuperHyperSet is a dual SuperHyperDefensive neutrosophic SuperHyperMatching for
- for
- for
- the SuperHyperSets and are only dual neutrosophic SuperHyperMatching for
Proposition 71.
Let be an m-SuperHyperFamily of odd SuperHyperComplete SuperHyperGraphs with common neutrosophic SuperHyperVertex SuperHyperSet. Then
- the SuperHyperSet is a dual maximal SuperHyperDefensive neutrosophic SuperHyperMatching for
- for
- for
- the SuperHyperSets are only a dual maximal neutrosophic SuperHyperMatching for
Proposition 72.
Let be a m-SuperHyperFamily of even SuperHyperComplete SuperHyperGraphs with common neutrosophic SuperHyperVertex SuperHyperSet. Then
- the SuperHyperSet is a dual SuperHyperDefensive neutrosophic SuperHyperMatching for
- for
- for
- the SuperHyperSets are only dual maximal neutrosophic SuperHyperMatching for
Proposition 73.
Let be a strong neutrosophic SuperHyperGraph. Then following statements hold;
- if and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive neutrosophic SuperHyperMatching, then S is an s-SuperHyperDefensive neutrosophic SuperHyperMatching;
- if and a SuperHyperSet S of SuperHyperVertices is a dual t-SuperHyperDefensive neutrosophic SuperHyperMatching, then S is a dual s-SuperHyperDefensive neutrosophic SuperHyperMatching.
Proposition 74.
Let be a strong neutrosophic SuperHyperGraph. Then following statements hold;
- if and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive neutrosophic SuperHyperMatching, then S is an s-SuperHyperPowerful neutrosophic SuperHyperMatching;
- if and a SuperHyperSet S of SuperHyperVertices is a dual t-SuperHyperDefensive neutrosophic SuperHyperMatching, then S is a dual s-SuperHyperPowerful neutrosophic SuperHyperMatching.
Proposition 75.
Let be a[an] [r-]SuperHyperUniform-strong-neutrosophic SuperHyperGraph. Then following statements hold;
- if then is an 2-SuperHyperDefensive neutrosophic SuperHyperMatching;
- if then is a dual 2-SuperHyperDefensive neutrosophic SuperHyperMatching;
- if then is an r-SuperHyperDefensive neutrosophic SuperHyperMatching;
- if then is a dual r-SuperHyperDefensive neutrosophic SuperHyperMatching.
Proposition 76.
Let is a[an] [r-]SuperHyperUniform-strong-neutrosophic SuperHyperGraph. Then following statements hold;
- if is an 2-SuperHyperDefensive neutrosophic SuperHyperMatching;
- if is a dual 2-SuperHyperDefensive neutrosophic SuperHyperMatching;
- if is an r-SuperHyperDefensive neutrosophic SuperHyperMatching;
- if is a dual r-SuperHyperDefensive neutrosophic SuperHyperMatching.
Proposition 77.
Let is a[an] [r-]SuperHyperUniform-strong-neutrosophic SuperHyperGraph which is a SuperHyperComplete. Then following statements hold;
- if is an 2-SuperHyperDefensive neutrosophic SuperHyperMatching;
- if is a dual 2-SuperHyperDefensive neutrosophic SuperHyperMatching;
- if is an -SuperHyperDefensive neutrosophic SuperHyperMatching;
- if is a dual -SuperHyperDefensive neutrosophic SuperHyperMatching.
Proposition 78.
Let is a[an] [r-]SuperHyperUniform-strong-neutrosophic SuperHyperGraph which is a SuperHyperComplete. Then following statements hold;
- if then is an 2-SuperHyperDefensive neutrosophic SuperHyperMatching;
- if then is a dual 2-SuperHyperDefensive neutrosophic SuperHyperMatching;
- if then is -SuperHyperDefensive neutrosophic SuperHyperMatching;
- if then is a dual -SuperHyperDefensive neutrosophic SuperHyperMatching.
Proposition 79.
Let is a[an] [r-]SuperHyperUniform-strong-neutrosophic SuperHyperGraph which is SuperHyperCycle. Then following statements hold;
- if is an 2-SuperHyperDefensive neutrosophic SuperHyperMatching;
- if is a dual 2-SuperHyperDefensive neutrosophic SuperHyperMatching;
- if is an 2-SuperHyperDefensive neutrosophic SuperHyperMatching;
- if is a dual 2-SuperHyperDefensive neutrosophic SuperHyperMatching.
Proposition 80.
Let is a[an] [r-]SuperHyperUniform-strong-neutrosophic SuperHyperGraph which is SuperHyperCycle. Then following statements hold;
- if then is an 2-SuperHyperDefensive neutrosophic SuperHyperMatching;
- if then is a dual 2-SuperHyperDefensive neutrosophic SuperHyperMatching;
- if then is an 2-SuperHyperDefensive neutrosophic SuperHyperMatching;
- if then is a dual 2-SuperHyperDefensive neutrosophic SuperHyperMatching.
7. Neutrosophic Problems and Neutrosophic Questions
In what follows, some “neutrosophic problems” and some “neutrosophic questions” are neutrosophicly proposed.
The SuperHyperMatching and the neutrosophic SuperHyperMatching are neutrosophicly defined on a real-world neutrosophic application, titled “Cancer’s neutrosophic recognitions”.
Question 81.
Which the else neutrosophic SuperHyperModels could be defined based on Cancer’s neutrosophic recognitions?
Question 82.
Are there some neutrosophic SuperHyperNotions related to SuperHyperMatching and the neutrosophic SuperHyperMatching?
Question 83.
Are there some neutrosophic Algorithms to be defined on the neutrosophic SuperHyperModels to compute them neutrosophicly?
Question 84.
Which the neutrosophic SuperHyperNotions are related to beyond the SuperHyperMatching and the neutrosophic SuperHyperMatching?
Problem 85.
The SuperHyperMatching and the neutrosophic SuperHyperMatching do neutrosophicly a neutrosophic SuperHyperModel for the Cancer’s neutrosophic recognitions and they’re based neutrosophicly on neutrosophic SuperHyperMatching, are there else neutrosophicly?
Problem 86.
Which the fundamental neutrosophic SuperHyperNumbers are related to these neutrosophic SuperHyperNumbers types-results?
Problem 87.
What’s the independent research based on Cancer’s neutrosophic recognitions concerning the multiple types of neutrosophic SuperHyperNotions?
In the Table (Table 1), benefits and avenues for this research are, figured out pointed out and spoken out.
References
- Henry Garrett, “Properties of SuperHyperGraph and Neutrosophic SuperHyperGraph”, Neutrosophic Sets and Systems 49 (2022) 531-561. (http://fs.unm.edu/NSS/NeutrosophicSuperHyperGraph34.pdf). (https://digitalrepository.unm.edu/nss_journal/vol49/iss1/34). [CrossRef]
- Henry Garrett, “Neutrosophic Co-degree and Neutrosophic Degree alongside Chromatic Numbers in the Setting of Some Classes Related to Neutrosophic Hypergraphs”, J Curr Trends Comp Sci Res 1(1) (2022) 06-14.
- Henry Garrett, “Super Hyper Dominating and Super Hyper Resolving on Neutrosophic Super Hyper Graphs and Their Directions in Game Theory and Neutrosophic Super Hyper Classes”, J Math Techniques Comput Math 1(3) (2022) 242-263.
- Garrett, Henry. “0039 | Closing Numbers and Super-Closing Numbers as (Dual)Resolving and (Dual)Coloring alongside (Dual)Dominating in (Neutrosophic)n-SuperHyperGraph.” CERN European Organization for Nuclear Research - Zenodo, Nov. 2022. CERN European Organization for Nuclear Research, https://oa.mg/work/10.5281/zenodo.6319942. [CrossRef]
- GGarrett, Henry. “0049 | (Failed)1-Zero-Forcing Number in Neutrosophic Graphs.” CERN European Organization for Nuclear Research - Zenodo, Feb. 2022. CERN European Organization for Nuclear Research, https://oa.mg/work/10.13140/rg.2.2.35241.26724. [CrossRef]
- Henry Garrett, “Neutrosophic Failed SuperHyperStable as the Survivors on the Cancer’s Neutrosophic Recognition Based on Uncertainty to All Modes in Neutrosophic SuperHyperGraphs”, Preprints 2023, 2023010240. [CrossRef]
- Henry Garrett, “Extremism of the Attacked Body Under the Cancer’s Circumstances Where Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010224. [CrossRef]
- Henry Garrett, “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010105. [CrossRef]
- Henry Garrett, “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints”, Preprints 2023, 2023010088. [CrossRef]
- Henry Garrett, “Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To Use Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond”, Preprints 2023, 2023010044.
- Henry Garrett, “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well- SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010043 . [CrossRef]
- Henry Garrett, “Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic) SuperHyperModeling in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010105. [CrossRef]
- Henry Garrett, “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints”, Preprints 2023, 2023010088. [CrossRef]
- Henry Garrett, “(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions Featuring (Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, Preprints 2022, 2022120549. [CrossRef]
- Henry Garrett, “(Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With (Neutrosophic) SuperHyperModeling of Cancer’s Recognitions And Related (Neutrosophic) SuperHyperClasses”, Preprints 2022, 2022120540. [CrossRef]
- Henry Garrett, “SuperHyperGirth on SuperHyperGraph and Neutrosophic SuperHyperGraph With SuperHyperModeling of Cancer’s Recognitions”, Preprints 2022, 2022120500. [CrossRef]
- Henry Garrett, “Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic SuperHyperGraphs and SuperHyperGraphs Alongside Applications in Cancer’s Treatments”, Preprints 2022, 2022120324 . [CrossRef]
- Henry Garrett, “SuperHyperDominating and SuperHyperResolving on Neutrosophic SuperHyperGraphs And Their Directions in Game Theory and Neutrosophic SuperHyperClasses”, Preprints 2022, 2022110576. [CrossRef]
- Henry Garrett,“The Focus on The Partitions Obtained By Parallel Moves In The Cancer’s Extreme Recognition With Different Types of Extreme SuperHyperMatching Set and Polynomial on (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023. [CrossRef]
- Henry Garrett,“Extreme Failed SuperHyperClique Decides the Failures on the Cancer’s Recognition in the Perfect Connections of Cancer’s Attacks By SuperHyperModels Named (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023 . [CrossRef]
- Henry Garrett,“Indeterminacy On The All Possible Connections of Cells In Front of Cancer’s Attacks In The Terms of Neutrosophic Failed SuperHyperClique on Cancer’s Recognition called Neutrosophic SuperHyperGraphs”, ResearchGate 2023. [CrossRef]
- Henry Garrett,“Perfect Directions Toward Idealism in Cancer’s Neutrosophic Recognition Forwarding Neutrosophic SuperHyperClique on Neutrosophic SuperHyperGraphs”, ResearchGate 2023. [CrossRef]
- Henry Garrett,“Demonstrating Complete Connections in Every Embedded Regions and Sub-Regions in the Terms of Cancer’s Recognition and (Neutrosophic) SuperHyperGraphs With (Neutrosophic) SuperHyperClique”, ResearchGate 2023. [CrossRef]
- Henry Garrett,“Different Neutrosophic Types of Neutrosophic Regions titled neutrosophic Failed SuperHyperStable in Cancer’s Neutrosophic Recognition modeled in the Form of Neutrosophic SuperHyperGraphs”, ResearchGate 2023. [CrossRef]
- Henry Garrett, “Using the Tool As (Neutrosophic) Failed SuperHyperStable To SuperHyperModel Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023. [CrossRef]
- Henry Garrett, “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints”, ResearchGate 2023. [CrossRef]
- enry Garrett, “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well-SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023. [CrossRef]
- Henry Garrett, “Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To Use Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond”, ResearchGate 2022. [CrossRef]
- Henry Garrett, “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs”, ResearchGate 2022. [CrossRef]
- Henry Garrett, “Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic) SuperHyperModeling in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs”, ResearchGate 2022. [CrossRef]
- Henry Garrett, “Basic Neutrosophic Notions Concerning SuperHyperDominating and Neutrosophic SuperHyperResolving in SuperHyperGraph”, ResearchGate 2022. [CrossRef]
- Henry Garrett, “Initial Material of Neutrosophic Preliminaries to Study Some Neutrosophic Notions Based on Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic SuperHyperGraph (NSHG)”, ResearchGate 2022. [CrossRef]
- Henry Garrett, (2022). “Beyond Neutrosophic Graphs”, Ohio: E-publishing: Educational Publisher 1091 West 1st Ave Grandview Heights, Ohio 43212 United States. ISBN: 979-1-59973-725-6 (http://fs.unm.edu/BeyondNeutrosophicGraphs.pdf).
- Henry Garrett, (2022). “Neutrosophic Duality”, Florida: GLOBAL KNOWLEDGE - Publishing House 848 Brickell Ave Ste 950 Miami, Florida 33131 United States. ISBN: 978-1-59973-743-0 (http://fs.unm.edu/NeutrosophicDuality.pdf).
- F. Smarandache, “Extension of HyperGraph to n-SuperHyperGraph and to Plithogenic n-SuperHyperGraph, and Extension of HyperAlgebra to n-ary (Classical-/Neutro-/Anti-) HyperAlgebra”, Neutrosophic Sets and Systems 33 (2020) 290-296. [CrossRef]
- M. Akram et al., “Single-valued neutrosophic Hypergraphs”, TWMS J. App. Eng. Math. 8 (1) (2018) 122-135.
- S. Broumi et al., “Single-valued neutrosophic graphs”, Journal of New Theory 10 (2016) 86-101.
- H. Wang et al., “Single-valued neutrosophic sets”, Multispace and Multistructure 4 (2010) 410-413.
- H.T. Nguyen and E.A. Walker, “A First course in fuzzy logic”, CRC Press, 2006.
- M. Akram, and G. Shahzadi, “Operations on Single-Valued Neutrosophic Graphs”, Journal of uncertain systems 11 (1) (2017) 1-26.
- G. Argiroffo et al., “Polyhedra associated with locating-dominating, open locating-dominating and locating total-dominating sets in graphs”, Discrete Applied Mathematics (2022). [CrossRef]
- L. Aronshtam, and H. Ilani, “Bounds on the average and minimum attendance in preference-based activity scheduling”, Discrete Applied Mathematics 306 (2022) 114-119. [CrossRef]
- J. Asplund et al., “A Vizing-type result for semi-total domination”, Discrete Applied Mathematics 258 (2019) 8-12. [CrossRef]
- K. Atanassov, “Intuitionistic fuzzy sets”, Fuzzy Sets Syst. 20 (1986) 87-96.
- R.A. Beeler et al., “Total domination cover rubbling”, Discrete Applied Mathematics 283 (2020) 133-141. [CrossRef]
- S. Bermudo et al., “On the global total k-domination number of graphs”, Discrete Applied Mathematics 263 (2019) 42-50. [CrossRef]
- M. Bold, and M. Goerigk, “Investigating the recoverable robust single machine scheduling problem under interval uncertainty”, Discrete Applied Mathematics 313 (2022) 99-114. [CrossRef]
- S. Broumi et al., “Single-valued neutrosophic graphs”, Journal of New Theory 10 (2016) 86-101.
- V. Gledel et al., “Maker–Breaker total domination game”, Discrete Applied Mathematics 282 (2020) 96-107. [CrossRef]
- M.A. Henning, and A. Yeo, “A new upper bound on the total domination number in graphs with minimum degree six”, Discrete Applied Mathematics 302 (2021) 1-7. [CrossRef]
- V. Irsic, “Effect of predomination and vertex removal on the game total domination number of a graph”, Discrete Applied Mathematics 257 (2019) 216-225. [CrossRef]
- B.S. Panda, and P. Goyal, “Hardness results of global total k-domination problem in graphs”, Discrete Applied Mathematics (2021). [CrossRef]
- N. Shah, and A. Hussain, “Neutrosophic soft graphs”, Neutrosophic Set and Systems 11 (2016) 31-44.
- A. Shannon and K.T. Atanassov, “A first step to a theory of the intuitionistic fuzzy graphs”, Proceeding of FUBEST (Lakov, D., Ed.) Sofia (1994) 59-61.
- F. Smarandache, “A Unifying field in logics neutrosophy: Neutrosophic probability, set and logic, Rehoboth:” American Research Press (1998).
- H. Wang et al., “Single-valued neutrosophic sets”, Multispace and Multistructure 4 (2010) 410-413.
- L. A. Zadeh, “Fuzzy sets”, Information and Control 8 (1965) 338-354.
Figure 1.
The SuperHyperGraphs Associated to the Notions of SuperHyperMatching in the Example (5).

Figure 2.
The SuperHyperGraphs Associated to the Notions of SuperHyperMatching in the Example (5).

Figure 3.
The SuperHyperGraphs Associated to the Notions of SuperHyperMatching in the Example (5).

Figure 4.
The SuperHyperGraphs Associated to the Notions of SuperHyperMatching in the Example (5).

Figure 5.
The SuperHyperGraphs Associated to the Notions of SuperHyperMatching in the Example (5).

Figure 6.
The SuperHyperGraphs Associated to the Notions of SuperHyperMatching in the Example (5).

Figure 7.
The SuperHyperGraphs Associated to the Notions of SuperHyperMatching in the Example (5).

Figure 8.
The SuperHyperGraphs Associated to the Notions of SuperHyperMatching in the Example (5).

Figure 9.
The SuperHyperGraphs Associated to the Notions of SuperHyperMatching in the Example (5).

Figure 10.
The SuperHyperGraphs Associated to the Notions of SuperHyperMatching in the Example (5).

Figure 11.
The SuperHyperGraphs Associated to the Notions of SuperHyperMatching in the Example (5).

Figure 12.
The SuperHyperGraphs Associated to the Notions of SuperHyperMatching in the Example (5).

Figure 13.
The SuperHyperGraphs Associated to the Notions of SuperHyperMatching in the Example (5).

Figure 14.
The SuperHyperGraphs Associated to the Notions of SuperHyperMatching in the Example (5).

Figure 15.
The SuperHyperGraphs Associated to the Notions of SuperHyperMatching in the Example (5).

Figure 16.
The SuperHyperGraphs Associated to the Notions of SuperHyperMatching in the Example (5).

Figure 17.
The SuperHyperGraphs Associated to the Notions of SuperHyperMatching in the Example (5).

Figure 18.
The SuperHyperGraphs Associated to the Notions of SuperHyperMatching in the Example (5).

Figure 19.
The SuperHyperGraphs Associated to the Notions of SuperHyperMatching in the Example (5).

Figure 20.
The SuperHyperGraphs Associated to the Notions of SuperHyperMatching in the Example (5).

Figure 21.
A neutrosophic SuperHyperPath Associated to the Notions of neutrosophic SuperHyperMatching in the Example (16).
Figure 21.
A neutrosophic SuperHyperPath Associated to the Notions of neutrosophic SuperHyperMatching in the Example (16).

Figure 22.
A neutrosophic SuperHyperCycle Associated to the neutrosophic Notions of neutrosophic SuperHyperMatching in the neutrosophic Example (18).
Figure 22.
A neutrosophic SuperHyperCycle Associated to the neutrosophic Notions of neutrosophic SuperHyperMatching in the neutrosophic Example (18).

Figure 23.
A neutrosophic SuperHyperStar Associated to the neutrosophic Notions of neutrosophic SuperHyperMatching in the neutrosophic Example (20).
Figure 23.
A neutrosophic SuperHyperStar Associated to the neutrosophic Notions of neutrosophic SuperHyperMatching in the neutrosophic Example (20).

Figure 24.
A neutrosophic SuperHyperBipartite neutrosophic Associated to the neutrosophic Notions of neutrosophic SuperHyperMatching in the Example (22).
Figure 24.
A neutrosophic SuperHyperBipartite neutrosophic Associated to the neutrosophic Notions of neutrosophic SuperHyperMatching in the Example (22).

Figure 25.
A neutrosophic SuperHyperMultipartite Associated to the Notions of neutrosophic SuperHyperMatching in the Example (24).
Figure 25.
A neutrosophic SuperHyperMultipartite Associated to the Notions of neutrosophic SuperHyperMatching in the Example (24).

Figure 26.
A neutrosophic SuperHyperWheel neutrosophic Associated to the neutrosophic Notions of neutrosophic SuperHyperMatching in the neutrosophic Example (26).
Figure 26.
A neutrosophic SuperHyperWheel neutrosophic Associated to the neutrosophic Notions of neutrosophic SuperHyperMatching in the neutrosophic Example (26).

Table 1.
An Overlook On This Research And Beyond
| Advantages | Limitations |
|---|---|
| 1.Redefining Neutrosophic SuperHyperGraph | 1.General Results |
| 2.SuperHyperMatching | |
| 3.Neutrosophic SuperHyperMatching | 2.Other SuperHyperNumbers |
| 4.Modeling of Cancer’s Recognitions | |
| 5.SuperHyperClasses | 3.SuperHyperFamilies |
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2023 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.