In this research, new setting is introduced for new SuperHyperNotions, namely, SuperHyperDefensive SuperHyperAlliances and Neutrosophic SuperHyperDefensive SuperHyperAlliances. Two different types of SuperHyperDefinitions are debut for them but the research goes further and the SuperHyperNotion, SuperHyperUniform, and SuperHyperClass based on that are well-defined and well-reviewed. The literature review is implemented in the whole of this research. For shining the elegancy and the significancy of this research, the comparison between this SuperHyperNotion with other SuperHyperNotions and fundamental SuperHyperNumbers are featured. The definitions are followed by the examples and the instances thus the clarifications are driven with different tools. The applications are figured out to make sense about the theoretical aspect of this ongoing research. The “Cancer’s Recognitions” are the under research to figure out the challenges make sense about ongoing and upcoming research. The special case is up. The cells are viewed in the deemed ways. There are different types of them. Some of them are individuals and some of them are well-modeled by the group of cells. These types are all officially called “SuperHyperVertex” but the relations amid them all officially called “SuperHyperEdge”. The frameworks “SuperHyperGraph” and “neutrosophic SuperHyperGraph” are chosen and elected to research about “Cancer’s Recognitions”. Thus these complex and dense SuperHyperModels open up some avenues to research on theoretical segments and “Cancer’s Recognitions”. Some avenues are posed to pursue this research. It’s also officially collected in the form of some questions and some problems. Assume a SuperHyperGraph. An “SuperHyperAlliance” is a minimal SuperHyperSet of SuperHyperVertices with minimum cardinality such that either of the following expressions hold for the cardinalities of SuperHyperNeighbors of s∈S:,|S∩N(s)|>|S∩(V \N(s))|,and|S∩N(s)|<|S∩(V \N(s))|.Thefirst Expression, holds if S is SuperHyperOffensive. And the second Expression, holds if S is “SuperHyperDefensive”. It’s useful to define “neutrosophic” version of SuperHyperDefensive SuperHyperAlliances. Since there’s more ways to get type-results to make SuperHyperDefensive SuperHyperAlliances more understandable. For the sake of having neutrosophic SuperHyperDefensive SuperHyperAlliances, there’s a need to “redefine” the notion of “SuperHyperDefensive SuperHyperAlliances”. The SuperHyperVertices and the SuperHyperEdges are assigned by the labels from the letters of the alphabets. In this procedure, there’s the usage of the position of labels to assign to the values. Assume a SuperHyperAlliance. It’s redefined neutrosophic SuperHyperAlliance if the mentioned Table holds, concerning, “The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges Belong to The Neutrosophic SuperHyperGraph” with the key points, “The Values of The Vertices & The Number of Position in Alphabet”, “The Values of The SuperVertices&The Minimum Values of Its Vertices”, “The Values of The Edges&The Minimum Values of Its Vertices”, “The Values of The HyperEdges&The Minimum Values of Its Vertices”, “The Values of The SuperHyperEdges&The Minimum Values of Its Endpoints”. To get structural examples and instances, I’m going to introduce the next SuperHyperClass of SuperHyperGraph based on SuperHyperDefensive SuperHyperAlliances. It’s the main. It’ll be disciplinary to have the foundation of previous definition in the kind of SuperHyperClass. If there’s a need to have all SuperHyperConnectivities until the SuperHyperDefensive SuperHyperAlliances, then it’s officially called “SuperHyperDefensive SuperHyperAlliances” but otherwise, it isn’t SuperHyperDefensive SuperHyperAlliances. There are some instances about the clarifications for the main definition titled “SuperHyperDefensive SuperHyperAlliances”. These two examples get more scrutiny and discernment since there are characterized in the disciplinary ways of the SuperHyperClass based on SuperHyperDefensive SuperHyperAlliances. For the sake of having neutrosophic SuperHyperDefensive SuperHyperAlliances, there’s a need to “redefine” the notion of “neutrosophic SuperHyperDefensive SuperHyperAlliances” and “neutrosophic SuperHyperDefensive SuperHyperAlliances”. The SuperHyperVertices and the SuperHyperEdges are assigned by the labels from the letters of the alphabets. In this procedure, there’s the usage of the position of labels to assign to the values. Assume a neutrosophic SuperHyperGraph. It’s redefined “neutrosophic SuperHyperGraph” if the intended Table holds. And SuperHyperDefensive SuperHyperAlliances are redefined “neutrosophic SuperHyperDefensive SuperHyperAlliances” if the intended Table holds. It’s useful to define “neutrosophic” version of SuperHyperClasses. Since there’s more ways to get neutrosophic type-results to make neutrosophic SuperHyperDefensive SuperHyperAlliances more understandable. Assume a neutrosophic SuperHyperGraph. There are some neutrosophic SuperHyperClasses if the intended Table holds. Thus SuperHyperPath, SuperHyperCycle, SuperHyperStar, SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, are “neutrosophic SuperHyperPath”, “neutrosophic SuperHyperCycle”, “neutrosophic SuperHyperStar”, “neutrosophic SuperHyperBipartite”, “neutrosophic SuperHyperMultiPartite”, and “neutrosophic SuperHyperWheel” if the intended Table holds. A SuperHyperGraph has “neutrosophic SuperHyperDefensive SuperHyperAlliances” where it’s the strongest [the maximum neutrosophic value from all SuperHyperDefensive SuperHyperAlliances amid the maximum value amid all SuperHyperVertices from a SuperHyperDefensive SuperHyperAlliances.] SuperHyperDefensive SuperHyperAlliances. A graph is SuperHyperUniform if it’s SuperHyperGraph and the number of elements of SuperHyperEdges are the same. Assume a neutrosophic SuperHyperGraph. There are some SuperHyperClasses as follows. It’s SuperHyperPath if it’s only one SuperVertex as intersection amid two given SuperHyperEdges with two exceptions; it’s SuperHyperCycle if it’s only one SuperVertex as intersection amid two given SuperHyperEdges; it’s SuperHyperStar it’s only one SuperVertex as intersection amid all SuperHyperEdges; it’s SuperHyperBipartite it’s only one SuperVertex as intersection amid two given SuperHyperEdges and these SuperVertices, forming two separate sets, has no SuperHyperEdge in common; it’s SuperHyperMultiPartite it’s only one SuperVertex as intersection amid two given SuperHyperEdges and these SuperVertices, forming multi separate sets, has no SuperHyperEdge in common; it’s SuperHyperWheel if it’s only one SuperVertex as intersection amid two given SuperHyperEdges and one SuperVertex has one SuperHyperEdge with any common SuperVertex. The SuperHyperModel proposes the specific designs and the specific architectures. The SuperHyperModel is officially called “SuperHyperGraph” and “Neutrosophic SuperHyperGraph”. In this SuperHyperModel, The “specific” cells and “specific group” of cells are SuperHyperModeled as “SuperHyperVertices” and the common and intended properties between “specific” cells and “specific group” of cells are SuperHyperModeled as “SuperHyperEdges”. Sometimes, it’s useful to have some degrees of determinacy, indeterminacy, and neutrality to have more precise SuperHyperModel which in this case the SuperHyperModel is called “neutrosophic”. In the future research, the foundation will be based on the “Cancer’s Recognitions” and the results and the definitions will be introduced in redeemed ways. The recognition of the cancer in the long-term function. The specific region has been assigned by the model [it’s called SuperHyperGraph] and the long cycle of the move from the cancer is identified by this research. Sometimes the move of the cancer hasn’t be easily identified since there are some determinacy, indeterminacy and neutrality about the moves and the effects of the cancer on that region; this event leads us to choose another model [it’s said to be neutrosophic SuperHyperGraph] to have convenient perception on what’s happened and what’s done. There are some specific models, which are well-known and they’ve got the names, and some SuperHyperGeneral SuperHyperModels. The moves and the traces of the cancer on the complex tracks and between complicated groups of cells could be fantasized by a neutrosophic SuperHyperPath(-/SuperHyperCycle, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find either the longest SuperHyperDefensive SuperHyperAlliances or the strongest SuperHyperDefensive SuperHyperAlliances in those neutrosophic SuperHyperModels. For the longest SuperHyperDefensive SuperHyperAlliances, called SuperHyperDefensive SuperHyperAlliances, and the strongest SuperHyperCycle, called neutrosophic SuperHyperDefensive SuperHyperAlliances, some general results are introduced. Beyond that in SuperHyperStar, all possible SuperHyperPaths have only two SuperHyperEdges but it’s not enough since it’s essential to have at least three SuperHyperEdges to form any style of a SuperHyperCycle. There isn’t any formation of any SuperHyperCycle but literarily, it’s the deformation of any SuperHyperCycle. It, literarily, deforms and it doesn’t form. A basic familiarity with SuperHyperGraph theory and neutrosophic SuperHyperGraph theory are proposed.

In this research, new setting is introduced for new SuperHyperNotions, namely, SuperHyperAlliances and Neutrosophic SuperHyperAlliances. Two different types of SuperHyperDefinitions are debut for them but the research goes further and the SuperHyperNotion, SuperHyperUniform, and SuperHyperClass based on that are well-defined and well-reviewed. The literature review is implemented in the whole of this research. For shining the elegancy and the significancy of this research, the comparison between this SuperHyperNotion with other SuperHyperNotions and fundamental SuperHyperNumbers are featured. The definitions are followed by the examples and the instances thus the clarifications are driven with different tools. The applications are figured out to make sense about the theoretical aspect of this ongoing research. The “Cancer’s Recognitions” are the under research to figure out the challenges make sense about ongoing and upcoming research. The special case is up. The cells are viewed in the deemed ways. There are different types of them. Some of them are individuals and some of them are well-modeled by the group of cells. These types are all officially called “SuperHyperVertex” but the relations amid them all officially called “SuperHyperEdge”. The frameworks “SuperHyperGraph” and “neutrosophic SuperHyperGraph” are chosen and elected to research about “Cancer’s Recognitions”. Thus these complex and dense SuperHyperModels open up some avenues to research on theoretical segments and “Cancer’s Recognitions”. Some avenues are posed to pursue this research. It’s also officially collected in the form of some questions and some problems. Assume a SuperHyperGraph. An “SuperHyperAlliance” is a minimal SuperHyperSet of SuperHyperVertices with minimum cardinality such that either of the following expressions hold for the cardinalities of SuperHyperNeighbors of s∈S:,|S∩N(s)|>|S∩(V \N(s))|,and|S∩N(s)|<|S∩(V \N(s))|.Thefirst Expression, holds if S is SuperHyperOffensive. And the second Expression, holds if S is “SuperHyperDefensive”. It’s useful to define “neutrosophic” version of SuperHyperAlliances. Since there’s more ways to get type-results to make SuperHyperAlliances more understandable. For the sake of having neutrosophic SuperHyperAlliances, there’s a need to “redefine” the notion of “SuperHyperAlliances”. The SuperHyperVertices and the SuperHyperEdges are assigned by the labels from the letters of the alphabets. In this procedure, there’s the usage of the position of labels to assign to the values. Assume a SuperHyperAlliance. It’s redefined neutrosophic SuperHyperAlliance if the mentioned Table holds, concerning, “The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges Belong to The Neutrosophic SuperHyperGraph” with the key points, “The Values of The Vertices & The Number of Position in Alphabet”, “The Values of The SuperVertices&The Minimum Values of Its Vertices”, “The Values of The Edges&The Minimum Values of Its Vertices”, “The Values of The HyperEdges&The Minimum Values of Its Vertices”, “The Values of The SuperHyperEdges&The Minimum Values of Its Endpoints”. To get structural examples and instances, I’m going to introduce the next SuperHyperClass of SuperHyperGraph based on SuperHyperAlliances. It’s the main. It’ll be disciplinary to have the foundation of previous definition in the kind of SuperHyperClass. If there’s a need to have all SuperHyperConnectivities until the SuperHyperAlliances, then it’s officially called “SuperHyperAlliances” but otherwise, it isn’t SuperHyperAlliances. There are some instances about the clarifications for the main definition titled “SuperHyperAlliances”. These two examples get more scrutiny and discernment since there are characterized in the disciplinary ways of the SuperHyperClass based on SuperHyperAlliances. For the sake of having neutrosophic SuperHyperAlliances, there’s a need to “redefine” the notion of “neutrosophic SuperHyperAlliances” and “neutrosophic SuperHyperAlliances”. The SuperHyperVertices and the SuperHyperEdges are assigned by the labels from the letters of the alphabets. In this procedure, there’s the usage of the position of labels to assign to the values. Assume a neutrosophic SuperHyperGraph. It’s redefined “neutrosophic SuperHyperGraph” if the intended Table holds. And SuperHyperAlliances are redefined “neutrosophic SuperHyperAlliances” if the intended Table holds. It’s useful to define “neutrosophic” version of SuperHyperClasses. Since there’s more ways to get neutrosophic type-results to make neutrosophic SuperHyperAlliances more understandable. Assume a neutrosophic SuperHyperGraph. There are some neutrosophic SuperHyperClasses if the intended Table holds. Thus SuperHyperPath, SuperHyperCycle, SuperHyperStar, SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, are “neutrosophic SuperHyperPath”, “neutrosophic SuperHyperCycle”, “neutrosophic SuperHyperStar”, “neutrosophic SuperHyperBipartite”, “neutrosophic SuperHyperMultiPartite”, and “neutrosophic SuperHyperWheel” if the intended Table holds. A SuperHyperGraph has “neutrosophic SuperHyperAlliances” where it’s the strongest [the maximum neutrosophic value from all SuperHyperAlliances amid the maximum value amid all SuperHyperVertices from a SuperHyperAlliances.] SuperHyperAlliances. A graph is SuperHyperUniform if it’s SuperHyperGraph and the number of elements of SuperHyperEdges are the same. Assume a neutrosophic SuperHyperGraph. There are some SuperHyperClasses as follows. It’s SuperHyperPath if it’s only one SuperVertex as intersection amid two given SuperHyperEdges with two exceptions; it’s SuperHyperCycle if it’s only one SuperVertex as intersection amid two given SuperHyperEdges; it’s SuperHyperStar it’s only one SuperVertex as intersection amid all SuperHyperEdges; it’s SuperHyperBipartite it’s only one SuperVertex as intersection amid two given SuperHyperEdges and these SuperVertices, forming two separate sets, has no SuperHyperEdge in common; it’s SuperHyperMultiPartite it’s only one SuperVertex as intersection amid two given SuperHyperEdges and these SuperVertices, forming multi separate sets, has no SuperHyperEdge in common; it’s SuperHyperWheel if it’s only one SuperVertex as intersection amid two given SuperHyperEdges and one SuperVertex has one SuperHyperEdge with any common SuperVertex. The SuperHyperModel proposes the specific designs and the specific architectures. The SuperHyperModel is officially called “SuperHyperGraph” and “Neutrosophic SuperHyperGraph”. In this SuperHyperModel, The “specific” cells and “specific group” of cells are SuperHyperModeled as “SuperHyperVertices” and the common and intended properties between “specific” cells and “specific group” of cells are SuperHyperModeled as “SuperHyperEdges”. Sometimes, it’s useful to have some degrees of determinacy, indeterminacy, and neutrality to have more precise SuperHyperModel which in this case the SuperHyperModel is called “neutrosophic”. In the future research, the foundation will be based on the “Cancer’s Recognitions” and the results and the definitions will be introduced in redeemed ways. The recognition of the cancer in the long-term function. The specific region has been assigned by the model [it’s called SuperHyperGraph] and the long cycle of the move from the cancer is identified by this research. Sometimes the move of the cancer hasn’t be easily identified since there are some determinacy, indeterminacy and neutrality about the moves and the effects of the cancer on that region; this event leads us to choose another model [it’s said to be neutrosophic SuperHyperGraph] to have convenient perception on what’s happened and what’s done. There are some specific models, which are well-known and they’ve got the names, and some SuperHyperGeneral SuperHyperModels. The moves and the traces of the cancer on the complex tracks and between complicated groups of cells could be fantasized by a neutrosophic SuperHyperPath(-/SuperHyperCycle, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find either the longest SuperHyperAlliances or the strongest SuperHyperAlliances in those neutrosophic SuperHyperModels. For the longest SuperHyperAlliances, called SuperHyperAlliances, and the strongest SuperHyperCycle, called neutrosophic SuperHyperAlliances, some general results are introduced. Beyond that in SuperHyperStar, all possible SuperHyperPaths have only two SuperHyperEdges but it’s not enough since it’s essential to have at least three SuperHyperEdges to form any style of a SuperHyperCycle. There isn’t any formation of any SuperHyperCycle but literarily, it’s the deformation of any SuperHyperCycle. It, literarily, deforms and it doesn’t form. A basic familiarity with SuperHyperGraph theory and neutrosophic SuperHyperGraph theory are proposed.

In this research, assume a SuperHyperGraph. Then a “SuperHyperForcing” Z(NSHG) for a neutrosophic SuperHyperGraph NSHG : (V,E) is the minimum cardinality of a SuperHyperSet S of black SuperHyperVertices (whereas SuperHyperVertices in V (G) \ S are colored white) such that V (G) is turned black after finitely many applications of “the color-change rule”: a white SuperHyperVertex is converted to a black SuperHyperVertex if it is the only white SuperHyperNeighbor of a black SuperHyperVertex; a “neutrosophic SuperHyperForcing” Zn(NSHG) for a neutrosophic SuperHyperGraph NSHG : (V,E) is the minimum neutrosophic cardinality of a SuperHyperSet S of black SuperHyperVertices (whereas SuperHyperVertices in V (G) \ S are colored white) such that V (G) is turned black after finitely many applications of “the color-change rule”: a white SuperHyperVertex is converted to a black SuperHyperVertex if it is the only white SuperHyperNeighbor of a black SuperHyperVertex. Assume a SuperHyperGraph. Then a “SuperHyperForcing” Z(NSHG) for a neutrosophic SuperHyperGraph NSHG : (V,E) is the minimum cardinality of a SuperHyperSet S of black SuperHyperVertices (whereas SuperHyperVertices in V (G) \ S are colored white) such that V (G) is turned black after finitely many applications of “the color-change rule”: a white SuperHyperVertex is converted to a black SuperHyperVertex if it is the only white SuperHyperNeighbor of a black SuperHyperVertex; a “neutrosophic SuperHyperForcing” Zn(NSHG) for a neutrosophic SuperHyperGraph NSHG : (V,E) is the minimum neutrosophic cardinality of a SuperHyperSet S of black SuperHyperVertices (whereas SuperHyperVertices in V (G) \ S are colored white) such that V (G) is turned black after finitely many applications of “the color-change rule”: a white SuperHyperVertex is converted to a black SuperHyperVertex if it is the only white SuperHyperNeighbor of a black SuperHyperVertex. Assume a SuperHyperGraph. Then an “δ−SuperHyperForcing” is a minimal SuperHyperForcing of SuperHyperVertices with minimum cardinality such that either of the following expressions hold for the (neutrosophic) cardinalities of SuperHyperNeighbors of s ∈ S : |S∩N(s)|>|S∩(V \N(s))|+δ, |S∩N(s)|<|S∩(V \N(s))|+δ.Thefirst Expression, holds if S is an “δ−SuperHyperOffensive”. And the second Expression, holds if S is an “δ−SuperHyperDefensive”; a“neutrosophic δ−SuperHyperForcing” is a minimal neutrosophic SuperHyperForcing of SuperHyperVertices with minimum neutrosophic cardinality such that either of the following expressions hold for the neutrosophic cardinalities of SuperHyperNeighbors of s ∈ S : |S ∩ N(s)|neutrosophic > |S ∩ (V \ N (s))|neutrosophic + δ, |S ∩ N (s)|neutrosophic < |S ∩ (V \ N (s))|neutrosophic + δ. The first Expression, holds if S is a “neutrosophic δ−SuperHyperOffensive”. And the second Expression, holds if S is a “neutrosophic δ−SuperHyperDefensive”. It’s useful to define “neutrosophic” version of SuperHyperForcing. Since there’s more ways to get type-results to make SuperHyperForcing more understandable. For the sake of having neutrosophic SuperHyperForcing, there’s a need to “redefine” the notion of “SuperHyperForcing”. The SuperHyperVertices and the SuperHyperEdges are assigned by the labels from the letters of the alphabets. In this procedure, there’s the usage of the position of labels to assign to the values. A basic familiarity with SuperHyperGraph theory and neutrosophic SuperHyperGraph theory are proposed.

In this research, the neutrosophic SuperHyperNotion, namely, neutrosophic SuperHyperGirth, is up. $E_1$ and $E_3$ are some empty neutrosophic SuperHyperEdges but $E_2$ is a loop neutrosophic SuperHyperEdge and $E_4$ is an neutrosophic SuperHyperEdge. Thus in the terms of neutrosophic SuperHyperNeighbor, there's only one neutrosophic SuperHyperEdge, namely, $E_4.$ The neutrosophic SuperHyperVertex, $V_3$ is neutrosophic isolated means that there's no neutrosophic SuperHyperEdge has it as an neutrosophic endpoint. Thus the neutrosophic SuperHyperVertex, $V_3,$ is excluded in every given neutrosophic SuperHyperGirth. $ \mathcal{C}(NSHG)=\{E_i\}~\text{is an neutrosophic SuperHyperGirth.} \ \ \mathcal{C}(NSHG)=jz^i~\text{is an neutrosophic SuperHyperGirth SuperHyperPolynomial.} \ \ \mathcal{C}(NSHG)=\{V_i\}~\text{is an neutrosophic R-SuperHyperGirth.} \ \ \mathcal{C}(NSHG)=jz^I~{\small\text{is an neutrosophic R-SuperHyperGirth SuperHyperPolynomial.}} $ The following neutrosophic SuperHyperSet of neutrosophic SuperHyperEdges[SuperHyperVertices] is the neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperGirth. The neutrosophic SuperHyperSet of neutrosophic SuperHyperEdges[SuperHyperVertices], is the neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperGirth. The neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices], is an neutrosophic SuperHyperGirth $\mathcal{C}(ESHG)$ for an neutrosophic SuperHyperGraph $ESHG:(V,E)$ is an neutrosophic type-SuperHyperSet with the maximum neutrosophic cardinality of an neutrosophic SuperHyperSet $S$ of neutrosophic SuperHyperEdges[SuperHyperVertices] such that there's only one neutrosophic consecutive sequence of the neutrosophic SuperHyperVertices and the neutrosophic SuperHyperEdges form only one neutrosophic SuperHyperCycle. There are not only four neutrosophic SuperHyperVertices inside the intended neutrosophic SuperHyperSet. Thus the non-obvious neutrosophic SuperHyperGirth isn't up. The obvious simple neutrosophic type-SuperHyperSet called the neutrosophic SuperHyperGirth is an neutrosophic SuperHyperSet includes only less than four neutrosophic SuperHyperVertices. But the neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices], doesn't have less than four SuperHyperVertices inside the intended neutrosophic SuperHyperSet. Thus the non-obvious simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperGirth isn't up. To sum them up, the neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices], isn't the non-obvious simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperGirth. Since the neutrosophic SuperHyperSet of the neutrosophic SuperHyperEdges[SuperHyperVertices], is an neutrosophic SuperHyperGirth $\mathcal{C}(ESHG)$ for an neutrosophic SuperHyperGraph $ESHG:(V,E)$ is the neutrosophic SuperHyperSet $S$ of neutrosophic SuperHyperVertices[SuperHyperEdges] such that there's only one neutrosophic consecutive neutrosophic sequence of neutrosophic SuperHyperVertices and neutrosophic SuperHyperEdges form only one neutrosophic SuperHyperCycle given by that neutrosophic type-SuperHyperSet called the neutrosophic SuperHyperGirth and it's an neutrosophic SuperHyperGirth . Since it 's the maximum neutrosophic cardinality of an neutrosophic SuperHyperSet $S$ of neutrosophic SuperHyperEdges[SuperHyperVertices] such that there's only one neutrosophic consecutive neutrosophic sequence of neutrosophic SuperHyperVertices and neutrosophic SuperHyperEdges form only one neutrosophic SuperHyperCycle. There are only less than four neutrosophic SuperHyperVertices inside the intended neutrosophic SuperHyperSet, thus the obvious neutrosophic SuperHyperGirth, is up. The obvious simple neutrosophic type-SuperHyperSet of the neutrosophic SuperHyperGirth, is: ,is the neutrosophic SuperHyperSet, is: does includes only less than four SuperHyperVertices in a connected neutrosophic SuperHyperGraph $ESHG:(V,E).$ It's interesting to mention that the only simple neutrosophic type-SuperHyperSet called the neutrosophic SuperHyperGirth amid those obvious[non-obvious] simple neutrosophic type-SuperHyperSets called the neutrosophic SuperHyperGirth , is only and only. A basic familiarity with neutrosophic SuperHyperGirth theory, SuperHyperGraphs, and neutrosophic SuperHyperGraphs theory are proposed.

in this research, new setting is introduced for new SuperHyperNotion, namely, Neutrosophic SuperHyperStable. In this research article, there are some research segments for ``Neutrosophic SuperHyperStable'' about some researches on neutrosophic SuperHyperStable. With researches on the basic properties, the research article starts to make neutrosophic SuperHyperStable theory more understandable. Assume a neutrosophic SuperHyperGraph. Then a ``neutrosophic SuperHyperStable'' $\mathcal{I}_n(NSHG)$ for a neutrosophic SuperHyperGraph $NSHG:(V,E)$ is the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet $S$ of neutrosophic SuperHyperVertices such that there's no neutrosophic SuperHyperVertex to have a neutrosophic SuperHyperEdge in common. A basic familiarity with SuperHyperGraph theory and neutrosophic SuperHyperGraph theory are proposed.

In this research, new setting is introduced for new SuperHyperNotion, namely, 11 Neutrosophic 1-failed SuperHyperForcing. Two different types of SuperHyperDefinitions 12 are debut for them but the research goes further and the SuperHyperNotion, 13 SuperHyperUniform, and SuperHyperClass based on that are well-defined and 14 well-reviewed. The literature review is implemented in the whole of this research. For 15 shining the elegancy and the significancy of this research, the comparison between this 16 SuperHyperNotion with other SuperHyperNotions and fundamental 17 SuperHyperNumbers are featured. The definitions are followed by the examples and the 18 instances thus the clarifications are driven with different tools. The applications are 19 figured out to make sense about the theoretical aspect of this ongoing research. The 20 “Cancer’s Neutrosophic Recognition” are the under research to figure out the challenges 21 make sense about ongoing and upcoming research. The special case is up. The cells are 22 viewed in the deemed ways. There are different types of them. Some of them are 23 individuals and some of them are well-modeled by the group of cells. These types are all 24 officially called “SuperHyperVertex” but the relations amid them all officially called 25 “SuperHyperEdge”. The frameworks “SuperHyperGraph” and “neutrosophic 26 SuperHyperGraph” are chosen and elected to research about “Cancer’s Neutrosophic 27 Recognition”. Thus these complex and dense SuperHyperModels open up some avenues 28 to research on theoretical segments and “Cancer’s Neutrosophic Recognition”. Some 29 avenues are posed to pursue this research. It’s also officially collected in the form of 30 some questions and some problems. Assume a SuperHyperGraph. Then a “1-failed 31 SuperHyperForcing” Z(NSHG) for a neutrosophic SuperHyperGraph NSHG : (V,E) 32 is the maximum cardinality of a SuperHyperSet S of black SuperHyperVertices 33 (whereas SuperHyperVertices in V (G) \ S are colored white) such that V (G) isn’t 34 turned black after finitely many applications of “the color-change rule”: a white 35 SuperHyperVertex is converted to a black SuperHyperVertex if it is the only white 36 SuperHyperNeighbor of a black SuperHyperVertex. The additional condition is referred 37 by “1-” about the usage of any black SuperHyperVertex only once to act on white 38 SuperHyperVertex to be black SuperHyperVertex; a “neutrosophic 1-failed 39 SuperHyperForcing” Zn(NSHG) for a neutrosophic SuperHyperGraph NSHG : (V,E) 40 is the maximum neutrosophic cardinality of a SuperHyperSet S of black 41 SuperHyperVertices (whereas SuperHyperVertices in V (G) \ S are colored white) such 42 that V (G) isn’t turned black after finitely many applications of “the color-change rule”: 43 a white SuperHyperVertex is converted to a black SuperHyperVertex if it is the only 44 1/128 white SuperHyperNeighbor of a black SuperHyperVertex. The additional condition is 45 referred by “1-” about the usage of any black SuperHyperVertex only once to act on 46 white SuperHyperVertex to be black SuperHyperVertex. Assume a SuperHyperGraph. 47 Then an “δ−1-failed SuperHyperForcing” is a maximal 1-failed SuperHyperForcing of 48 SuperHyperVertices with maximum cardinality such that either of the following 49 expressions hold for the (neutrosophic) cardinalities of SuperHyperNeighbors of s ∈ S : 50 |S ∩N(s)| > |S ∩(V \N(s))|+δ, |S ∩N(s)| < |S ∩(V \N(s))|+δ. The first Expression, 51 holds if S is an “δ−SuperHyperOffensive”. And the second Expression, holds if S is an 52 “δ−SuperHyperDefensive”; a“neutrosophic δ−1-failed SuperHyperForcing” is a maximal 53 neutrosophic 1-failed SuperHyperForcing of SuperHyperVertices with maximum 54 neutrosophic cardinality such that either of the following expressions hold for the 55 neutrosophic cardinalities of SuperHyperNeighbors of s ∈ S : |S ∩ N(s)|neutrosophic > 56 |S ∩ (V \ N (s))|neutrosophic + δ, |S ∩ N (s)|neutrosophic < |S ∩ (V \ N (s))|neutrosophic + δ. 57 The first Expression, holds if S is a “neutrosophic δ−SuperHyperOffensive”. And the 58 second Expression, holds if S is a “neutrosophic δ−SuperHyperDefensive”. It’s useful to 59 define “neutrosophic” version of 1-failed SuperHyperForcing. Since there’s more ways to 60 get type-results to make 1-failed SuperHyperForcing more understandable. For the sake 61 of having neutrosophic 1-failed SuperHyperForcing, there’s a need to “redefine” the 62 notion of “1-failed SuperHyperForcing”. The SuperHyperVertices and the 63 SuperHyperEdges are assigned by the labels from the letters of the alphabets. In this 64 procedure, there’s the usage of the position of labels to assign to the values. Assume a 65 1-failed SuperHyperForcing. It’s redefined neutrosophic 1-failed SuperHyperForcing if 66 the mentioned Table holds, concerning, “The Values of Vertices, SuperVertices, Edges, 67 HyperEdges, and SuperHyperEdges Belong to The Neutrosophic SuperHyperGraph” 68 with the key points, “The Values of The Vertices & The Number of Position in 69 Alphabet”, “The Values of The SuperVertices&The maximum Values of Its Vertices”, 70 “The Values of The Edges&The maximum Values of Its Vertices”, “The Values of The 71 HyperEdges&The maximum Values of Its Vertices”, “The Values of The 72 SuperHyperEdges&The maximum Values of Its Endpoints”. To get structural examples 73 and instances, I’m going to introduce the next SuperHyperClass of SuperHyperGraph 74 based on 1-failed SuperHyperForcing. It’s the main. It’ll be disciplinary to have the 75 foundation of previous definition in the kind of SuperHyperClass. If there’s a need to 76 have all SuperHyperConnectivities until the 1-failed SuperHyperForcing, then it’s 77 officially called “1-failed SuperHyperForcing” but otherwise, it isn’t 1-failed 78 SuperHyperForcing. There are some instances about the clarifications for the main 79 definition titled “1-failed SuperHyperForcing”. These two examples get more scrutiny 80 and discernment since there are characterized in the disciplinary ways of the 81 SuperHyperClass based on 1-failed SuperHyperForcing. For the sake of having 82 neutrosophic 1-failed SuperHyperForcing, there’s a need to “redefine” the notion of 83 “neutrosophic 1-failed SuperHyperForcing” and “neutrosophic 1-failed 84 SuperHyperForcing”. The SuperHyperVertices and the SuperHyperEdges are assigned 85 by the labels from the letters of the alphabets. In this procedure, there’s the usage of 86 the position of labels to assign to the values. Assume a neutrosophic SuperHyperGraph. 87 It’s redefined “neutrosophic SuperHyperGraph” if the intended Table holds. And 88 1-failed SuperHyperForcing are redefined “neutrosophic 1-failed SuperHyperForcing” if 89 the intended Table holds. It’s useful to define “neutrosophic” version of 90 SuperHyperClasses. Since there’s more ways to get neutrosophic type-results to make 91 neutrosophic 1-failed SuperHyperForcing more understandable. Assume a neutrosophic 92 SuperHyperGraph. There are some neutrosophic SuperHyperClasses if the intended 93 Table holds. Thus SuperHyperPath, SuperHyperCycle, SuperHyperStar, 94 SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, are 95 “neutrosophic SuperHyperPath”, “neutrosophic SuperHyperCycle”, “neutrosophic 96 SuperHyperStar”, “neutrosophic SuperHyperBipartite”, “neutrosophic 97 2/128 SuperHyperMultiPartite”, and “neutrosophic SuperHyperWheel” if the intended Table 98 holds. A SuperHyperGraph has “neutrosophic 1-failed SuperHyperForcing” where it’s 99 the strongest [the maximum neutrosophic value from all 1-failed SuperHyperForcing 100 amid the maximum value amid all SuperHyperVertices from a 1-failed 101 SuperHyperForcing.] 1-failed SuperHyperForcing. A graph is SuperHyperUniform if it’s 102 SuperHyperGraph and the number of elements of SuperHyperEdges are the same. 103 Assume a neutrosophic SuperHyperGraph. There are some SuperHyperClasses as 104 follows. It’s SuperHyperPath if it’s only one SuperVertex as intersection amid two given 105 SuperHyperEdges with two exceptions; it’s SuperHyperCycle if it’s only one 106 SuperVertex as intersection amid two given SuperHyperEdges; it’s SuperHyperStar it’s 107 only one SuperVertex as intersection amid all SuperHyperEdges; it’s 108 SuperHyperBipartite it’s only one SuperVertex as intersection amid two given 109 SuperHyperEdges and these SuperVertices, forming two separate sets, has no 110 SuperHyperEdge in common; it’s SuperHyperMultiPartite it’s only one SuperVertex as 111 intersection amid two given SuperHyperEdges and these SuperVertices, forming multi 112 separate sets, has no SuperHyperEdge in common; it’s SuperHyperWheel if it’s only one 113 SuperVertex as intersection amid two given SuperHyperEdges and one SuperVertex has 114 one SuperHyperEdge with any common SuperVertex. The SuperHyperModel proposes 115 the specific designs and the specific architectures. The SuperHyperModel is officially 116 called “SuperHyperGraph” and “Neutrosophic SuperHyperGraph”. In this 117 SuperHyperModel, The “specific” cells and “specific group” of cells are 118 SuperHyperModeled as “SuperHyperVertices” and the common and intended properties 119 between “specific” cells and “specific group” of cells are SuperHyperModeled as 120 “SuperHyperEdges”. Sometimes, it’s useful to have some degrees of determinacy, 121 indeterminacy, and neutrality to have more precise SuperHyperModel which in this case 122 the SuperHyperModel is called “neutrosophic”. In the future research, the foundation 123 will be based on the “Cancer’s Neutrosophic Recognition” and the results and the 124 definitions will be introduced in redeemed ways. The neutrosophic recognition of the 125 cancer in the long-term function. The specific region has been assigned by the model 126 [it’s called SuperHyperGraph] and the long cycle of the move from the cancer is 127 identified by this research. Sometimes the move of the cancer hasn’t be easily identified 128 since there are some determinacy, indeterminacy and neutrality about the moves and 129 the effects of the cancer on that region; this event leads us to choose another model [it’s 130 said to be neutrosophic SuperHyperGraph] to have convenient perception on what’s 131 happened and what’s done. There are some specific models, which are well-known and 132 they’ve got the names, and some SuperHyperGeneral SuperHyperModels. The moves 133 and the traces of the cancer on the complex tracks and between complicated groups of 134 cells could be fantasized by a neutrosophic SuperHyperPath(-/SuperHyperCycle, 135 SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). 136 The aim is to find either the longest 1-failed SuperHyperForcing or the strongest 137 1-failed SuperHyperForcing in those neutrosophic SuperHyperModels. For the longest 138 1-failed SuperHyperForcing, called 1-failed SuperHyperForcing, and the strongest 139 SuperHyperCycle, called neutrosophic 1-failed SuperHyperForcing, some general results 140 are introduced. Beyond that in SuperHyperStar, all possible SuperHyperPaths have 141 only two SuperHyperEdges but it’s not enough since it’s essential to have at least three 142 SuperHyperEdges to form any style of a SuperHyperCycle. There isn’t any formation of 143 any SuperHyperCycle but literarily, it’s the deformation of any SuperHyperCycle. It, 144 literarily, deforms and it doesn’t form. A basic familiarity with SuperHyperGraph 145 theory and neutrosophic SuperHyperGraph theory are proposed.

In this research, new setting is introduced for new SuperHyperNotions, namely, an 1-failed SuperHyperForcing and Neutrosophic 1-failed SuperHyperForcing. Assume a SuperHyperGraph. Then an ``1-failed SuperHyperForcing'' $\mathcal{Z}(NSHG)$ for a neutrosophic SuperHyperGraph $NSHG:(V,E)$ is the maximum cardinality of a SuperHyperSet $S$ of black SuperHyperVertices (whereas SuperHyperVertices in $V(G) \setminus S$ are colored white) such that $V(G)$ isn't turned black after finitely many applications of ``the color-change rule'': a white SuperHyperVertex is converted to a black SuperHyperVertex if it is the only white SuperHyperNeighbor of a black SuperHyperVertex. The additional condition is referred by ``1-'' about the usage of any black SuperHyperVertex only once to act on white SuperHyperVertex to be black SuperHyperVertex; a ``neutrosophic 1-failed SuperHyperForcing'' $\mathcal{Z}_n(NSHG)$ for a neutrosophic SuperHyperGraph $NSHG:(V,E)$ is the maximum neutrosophic cardinality of a SuperHyperSet $S$ of black SuperHyperVertices (whereas SuperHyperVertices in $V(G) \setminus S$ are colored white) such that $V(G)$ isn't turned black after finitely many applications of ``the color-change rule'': a white SuperHyperVertex is converted to a black SuperHyperVertex if it is the only white SuperHyperNeighbor of a black SuperHyperVertex. The additional condition is referred by ``1-'' about the usage of any black SuperHyperVertex only once to act on white SuperHyperVertex to be black SuperHyperVertex. Assume a SuperHyperGraph. Then an ``$\delta-$1-failed SuperHyperForcing'' is a \underline{maximal} 1-failed SuperHyperForcing of SuperHyperVertices with \underline{maximum} cardinality such that either of the following expressions hold for the (neutrosophic) cardinalities of SuperHyperNeighbors of $s\in S:$ $~|S\cap N(s)| > |S\cap (V\setminus N(s))|+\delta,~|S\cap N(s)| < |S\cap (V\setminus N(s))|+\delta.$ The first Expression, holds if $S$ is an ``$\delta-$SuperHyperOffensive''. And the second Expression, holds if $S$ is an ``$\delta-$SuperHyperDefensive''; a``neutrosophic $\delta-$1-failed SuperHyperForcing'' is a \underline{maximal} neutrosophic 1-failed SuperHyperForcing of SuperHyperVertices with \underline{maximum} neutrosophic cardinality such that either of the following expressions hold for the neutrosophic cardinalities of SuperHyperNeighbors of $s\in S:$ $~|S\cap N(s)|_{neutrosophic} > |S\cap (V\setminus N(s))|_{neutrosophic}+\delta,~ |S\cap N(s)|_{neutrosophic} < |S\cap (V\setminus N(s))|_{neutrosophic}+\delta.$ The first Expression, holds if $S$ is a ``neutrosophic $\delta-$SuperHyperOffensive''. And the second Expression, holds if $S$ is a ``neutrosophic $\delta-$SuperHyperDefensive''. A basic familiarity with SuperHyperGraph theory and neutrosophic SuperHyperGraph theory are proposed.

In this research, new setting is introduced for new SuperHyperNotions, namely, an SuperHyperStable and Neutrosophic SuperHyperStable. Two different types of SuperHyperDefinitions are debut for them but the research goes further and the SuperHyperNotion, SuperHyperUniform, and SuperHyperClass based on that are well-defined and well-reviewed. The literature review is implemented in the whole of this research. For shining the elegancy and the significancy of this research, the comparison between this SuperHyperNotion with other SuperHyperNotions and fundamental SuperHyperNumbers are featured. The definitions are followed by the examples and the instances thus the clarifications are driven with different tools. The applications are figured out to make sense about the theoretical aspect of this ongoing research. The ``Cancer's Recognitions'' are the under research to figure out the challenges make sense about ongoing and upcoming research. The special case is up. The cells are viewed in the deemed ways. There are different types of them. Some of them are individuals and some of them are well-modeled by the group of cells. These types are all officially called ``SuperHyperVertex'' but the relations amid them all officially called ``SuperHyperEdge''. The frameworks ``SuperHyperGraph'' and ``neutrosophic SuperHyperGraph'' are chosen and elected to research about ``Cancer's Recognitions''. Thus these complex and dense SuperHyperModels open up some avenues to research on theoretical segments and ``Cancer's Recognitions''. Some avenues are posed to pursue this research. It's also officially collected in the form of some questions and some problems. Assume a SuperHyperGraph. Then a``SuperHyperStable'' $\mathcal{I}(NSHG)$ for a SuperHyperGraph $NSHG:(V,E)$ is the maximum cardinality of a SuperHyperSet $S$ of SuperHyperVertices such that there's no SuperHyperVertex to have a SuperHyperEdge in common. Assume a SuperHyperGraph. Then an ``$\delta-$SuperHyperStable'' is a \underline{maximal} SuperHyperStable of SuperHyperVertices with \underline{maximum} cardinality such that either of the following expressions hold for the (neutrosophic) cardinalities of SuperHyperNeighbors of $s\in S:$ $~|S\cap N(s)| > |S\cap (V\setminus N(s))|+\delta,~|S\cap N(s)| < |S\cap (V\setminus N(s))|+\delta.$ The first Expression, holds if $S$ is an ``$\delta-$SuperHyperOffensive''. And the second Expression, holds if $S$ is an ``$\delta-$SuperHyperDefensive''; a``neutrosophic $\delta-$SuperHyperStable'' is a \underline{maximal} neutrosophic SuperHyperStable of SuperHyperVertices with \underline{maximum} neutrosophic cardinality such that either of the following expressions hold for the neutrosophic cardinalities of SuperHyperNeighbors of $s\in S:$ $~|S\cap N(s)|_{neutrosophic} > |S\cap (V\setminus N(s))|_{neutrosophic}+\delta,~ |S\cap N(s)|_{neutrosophic} < |S\cap (V\setminus N(s))|_{neutrosophic}+\delta.$ The first Expression, holds if $S$ is a ``neutrosophic $\delta-$SuperHyperOffensive''. And the second Expression, holds if $S$ is a ``neutrosophic $\delta-$SuperHyperDefensive''. It's useful to define a ``neutrosophic'' version of an SuperHyperStable. Since there's more ways to get type-results to make an SuperHyperStable more understandable. For the sake of having neutrosophic SuperHyperStable, there's a need to ``redefine'' the notion of an ``SuperHyperStable''. The SuperHyperVertices and the SuperHyperEdges are assigned by the labels from the letters of the alphabets. In this procedure, there's the usage of the position of labels to assign to the values. Assume an SuperHyperStable. It's redefined a neutrosophic SuperHyperStable if the mentioned Table holds, concerning, ``The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges Belong to The Neutrosophic SuperHyperGraph'' with the key points, ``The Values of The Vertices \& The Number of Position in Alphabet'', ``The Values of The SuperVertices\&The maximum Values of Its Vertices'', ``The Values of The Edges\&The maximum Values of Its Vertices'', ``The Values of The HyperEdges\&The maximum Values of Its Vertices'', ``The Values of The SuperHyperEdges\&The maximum Values of Its Endpoints''. To get structural examples and instances, I'm going to introduce the next SuperHyperClass of SuperHyperGraph based on an SuperHyperStable. It's the main. It'll be disciplinary to have the foundation of previous definition in the kind of SuperHyperClass. If there's a need to have all SuperHyperConnectivities until the SuperHyperStable, then it's officially called an ``SuperHyperStable'' but otherwise, it isn't an SuperHyperStable. There are some instances about the clarifications for the main definition titled an ``SuperHyperStable''. These two examples get more scrutiny and discernment since there are characterized in the disciplinary ways of the SuperHyperClass based on an SuperHyperStable. For the sake of having a neutrosophic SuperHyperStable, there's a need to ``redefine'' the notion of a ``neutrosophic SuperHyperStable'' and a ``neutrosophic SuperHyperStable''. The SuperHyperVertices and the SuperHyperEdges are assigned by the labels from the letters of the alphabets. In this procedure, there's the usage of the position of labels to assign to the values. Assume a neutrosophic SuperHyperGraph. It's redefined ``neutrosophic SuperHyperGraph'' if the intended Table holds. And an SuperHyperStable are redefined to an ``neutrosophic SuperHyperStable'' if the intended Table holds. It's useful to define ``neutrosophic'' version of SuperHyperClasses. Since there's more ways to get neutrosophic type-results to make a neutrosophic SuperHyperStable more understandable. Assume a neutrosophic SuperHyperGraph. There are some neutrosophic SuperHyperClasses if the intended Table holds. Thus SuperHyperPath, SuperHyperCycle, SuperHyperStar, SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, are ``neutrosophic SuperHyperPath'', ``neutrosophic SuperHyperCycle'', ``neutrosophic SuperHyperStar'', ``neutrosophic SuperHyperBipartite'', ``neutrosophic SuperHyperMultiPartite'', and ``neutrosophic SuperHyperWheel'' if the intended Table holds. A SuperHyperGraph has a ``neutrosophic SuperHyperStable'' where it's the strongest [the maximum neutrosophic value from all the SuperHyperStable amid the maximum value amid all SuperHyperVertices from an SuperHyperStable.] SuperHyperStable. A graph is a SuperHyperUniform if it's a SuperHyperGraph and the number of elements of SuperHyperEdges are the same. Assume a neutrosophic SuperHyperGraph. There are some SuperHyperClasses as follows. It's SuperHyperPath if it's only one SuperVertex as intersection amid two given SuperHyperEdges with two exceptions; it's SuperHyperCycle if it's only one SuperVertex as intersection amid two given SuperHyperEdges; it's SuperHyperStar it's only one SuperVertex as intersection amid all SuperHyperEdges; it's SuperHyperBipartite it's only one SuperVertex as intersection amid two given SuperHyperEdges and these SuperVertices, forming two separate sets, has no SuperHyperEdge in common; it's SuperHyperMultiPartite it's only one SuperVertex as intersection amid two given SuperHyperEdges and these SuperVertices, forming multi separate sets, has no SuperHyperEdge in common; it's a SuperHyperWheel if it's only one SuperVertex as intersection amid two given SuperHyperEdges and one SuperVertex has one SuperHyperEdge with any common SuperVertex. The SuperHyperModel proposes the specific designs and the specific architectures. The SuperHyperModel is officially called ``SuperHyperGraph'' and ``Neutrosophic SuperHyperGraph''. In this SuperHyperModel, The ``specific'' cells and ``specific group'' of cells are SuperHyperModeled as ``SuperHyperVertices'' and the common and intended properties between ``specific'' cells and ``specific group'' of cells are SuperHyperModeled as ``SuperHyperEdges''. Sometimes, it's useful to have some degrees of determinacy, indeterminacy, and neutrality to have more precise SuperHyperModel which in this case the SuperHyperModel is called ``neutrosophic''. In the future research, the foundation will be based on the ``Cancer's Recognitions'' and the results and the definitions will be introduced in redeemed ways. The recognition of the cancer in the long-term function. The specific region has been assigned by the model [it's called SuperHyperGraph] and the long cycle of the move from the cancer is identified by this research. Sometimes the move of the cancer hasn't be easily identified since there are some determinacy, indeterminacy and neutrality about the moves and the effects of the cancer on that region; this event leads us to choose another model [it's said to be neutrosophic SuperHyperGraph] to have convenient perception on what's happened and what's done. There are some specific models, which are well-known and they've got the names, and some SuperHyperGeneral SuperHyperModels. The moves and the traces of the cancer on the complex tracks and between complicated groups of cells could be fantasized by a neutrosophic SuperHyperPath(-/SuperHyperCycle, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find either the longest SuperHyperStable or the strongest SuperHyperStable in those neutrosophic SuperHyperModels. For the longest SuperHyperStable, called SuperHyperStable, and the strongest SuperHyperCycle, called neutrosophic SuperHyperStable, some general results are introduced. Beyond that in SuperHyperStar, all possible SuperHyperPaths have only two SuperHyperEdges but it's not enough since it's essential to have at least three SuperHyperEdges to form any style of a SuperHyperCycle. There isn't any formation of any SuperHyperCycle but literarily, it's the deformation of any SuperHyperCycle. It, literarily, deforms and it doesn't form. A basic familiarity with SuperHyperGraph theory and neutrosophic SuperHyperGraph theory are proposed.

I introduce now for the first time the neutrosophic modal logic. The Neutrosophic Modal Logic includes the neutrosophic operators that express the modalities. It is an extension of neutrosophic predicate logic, and of neutrosophic propositional logic. In order for the paper to be self-contained, I also recall the etymology and definition of neutrosophy and of neutrosophic logic. Several examples are presented as well.

In this research, Assume a neutrosophic SuperHyperGraph. Then a ``Failed SuperHyperStable $\mathcal{I}(NSHG)$ for a SuperHyperGraph $NSHG:(V,E)$ is the maximum cardinality of a SuperHyperSet $S$ of SuperHyperVertices such that there's a SuperHyperVertex to have a SuperHyperEdge in common; a ``neutrosophic Failed SuperHyperStable'' $\mathcal{I}_n(NSHG)$ for a neutrosophic SuperHyperGraph $NSHG:(V,E)$ is the maximum neutrosophic cardinality of a neutrosophic SuperHyperSet $S$ of neutrosophic SuperHyperVertices such that there's a neutrosophic SuperHyperVertex to have a neutrosophic SuperHyperEdge in common. Assume a SuperHyperGraph. Then an ``$\delta-$Failed SuperHyperStable'' is a \underline{maximal} Failed SuperHyperStable of SuperHyperVertices with \underline{maximum} cardinality such that either of the following expressions hold for the (neutrosophic) cardinalities of SuperHyperNeighbors of $s\in S:$ $~|S\cap N(s)| > |S\cap (V\setminus N(s))|+\delta,~|S\cap N(s)| < |S\cap (V\setminus N(s))|+\delta.$ The first Expression, holds if $S$ is an ``$\delta-$SuperHyperOffensive''. And the second Expression, holds if $S$ is an ``$\delta-$SuperHyperDefensive''; a``neutrosophic $\delta-$Failed SuperHyperStable'' is a \underline{maximal} neutrosophic Failed SuperHyperStable of SuperHyperVertices with \underline{maximum} neutrosophic cardinality such that either of the following expressions hold for the neutrosophic cardinalities of SuperHyperNeighbors of $s\in S:$ $~|S\cap N(s)|_{neutrosophic} > |S\cap (V\setminus N(s))|_{neutrosophic}+\delta,~ |S\cap N(s)|_{neutrosophic} < |S\cap (V\setminus N(s))|_{neutrosophic}+\delta.$ The first Expression, holds if $S$ is a ``neutrosophic $\delta-$SuperHyperOffensive''. And the second Expression, holds if $S$ is a ``neutrosophic $\delta-$SuperHyperDefensive''. A basic familiarity with Extreme Failed SuperHyperClique theory, Neutrosophic Failed SuperHyperClique theory, and (Neutrosophic) SuperHyperGraphs theory are proposed.

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.

New setting is introduced to study neutrosophic failed-independent number and failed independent neutrosophic-number arising neighborhood of different vertices. Neighbor is a key term to have these notions. Having all possible edges amid vertices in a set is a key type of approach to have these notions namely neutrosophic failed-independent number and failed independent neutrosophic-number. Two numbers are obtained but now both settings leads to approach is on demand which is finding biggest set which have all vertices which are neighbors. Let NTG : (V,E,σ,μ) be a neutrosophic graph. Then failed independent number I(NTG) for a neutrosophic graph NTG : (V,E,σ,μ) is maximum cardinality of a set S of vertices such that every two vertices of S are endpoints for an edge, simultaneously; failed independent neutrosophic-number In(NTG) for a neutrosophic graph NTG : (V,E,σ,μ) is maximum neutrosophic cardinality of a set S of vertices such that every two vertices of S are endpoints for an edge, simultaneously. As concluding results, there are some statements, remarks, examples and clarifications about some classes of neutrosophic graphs namely path-neutrosophic graphs, cycle-neutrosophic graphs, complete-neutrosophic graphs, star-neutrosophic graphs, complete-bipartite-neutrosophic graphs and complete-t-partite-neutrosophic graphs. The clarifications are also presented in both sections “Setting of Neutrosophic Failed-Independent Number,” and “Setting of Failed Independent Neutrosophic-Number,” for introduced results and used classes. Neutrosophic number is reused in this way. It’s applied to use the type of neutrosophic number in the way that, three values of a vertex are used and they’ve same share to construct this number to compare with other vertices. Summation of three values of vertex makes one number and applying it to a comparison. This approach facilitates identifying vertices which form neutrosophic failed-independent number and failed independent neutrosophic-number arising neighborhoods of vertices. In path-neutrosophic graphs, two neighbors, form maximal set but with slightly differences, in cycle-neutrosophic graphs, two neighbors forms maximal set. Other classes have same approaches. In complete-neutrosophic graphs, a set of all vertices leads us to neutrosophic failed-independent number and failed independent neutrosophic-number. In star-neutrosophic graphs, a set of vertices containing only center and one other vertex, makes maximal set. In complete-bipartite-neutrosophic graphs, a set of vertices including two vertices from different parts makes intended set but with slightly differences, in complete-t-partite-neutrosophic graphs, a set of t vertices from different parts makes intended set. In both settings, some classes of well-known neutrosophic graphs are studied. Some clarifications for each result and each definition are provided. Using basic set to extend this set to set of all vertices has key role to have these notions in the form of neutrosophic failed-independent number and failed independent neutrosophic-number arising neighborhood of vertices. The cardinality of a set has eligibility to neutrosophic failed-independent number but the neutrosophic cardinality of a set has eligibility to call failed independent neutrosophic-number. Some results get more frameworks and perspective about these definitions. The way in that, two vertices have connections amid each other, opens the way to do some approaches. A vertex could affect on other vertex but there’s no usage of edges. These notions are applied into neutrosophic graphs as individuals but not family of them as drawbacks for these notions. Finding special neutrosophic graphs which are well-known, is an open way to pursue this study. Some problems are proposed to pursue this study. Basic familiarities with graph theory and neutrosophic graph theory are proposed for this article.

New setting is introduced to study quasi-degree and quasi-co-degree arising from co-neighborhood. quasi-degree and quasi-co-degree is about a vertex which are applied into the setting of neutrosophic graphs. . The structure of set is studied and general results are obtained. Also, some classes of neutrosophic graphs namely path-neutrosophic graphs, cycle-neutrosophic graphs, complete-neutrosophic graphs and star-neutrosophic graphs, complete-bipartite-neutrosophic graphs and complete-multipartite-neutrosophic graphs are investigated in the terms of a vertex which is called either quasi-degree or quasi-co-degree. Neutrosophic number is reused in this way. It’s applied to use the type of neutrosophic number in the way that, three values of a vertex are used and they’ve same share to construct this number to compare with other vertices. Summation of three values of vertex makes one number and applying it to a comparison. This approach facilitates identifying vertices which form quasi-degree and quasi-co-degree. Quasi-degree is a value of a vertex which is maximum amid all values of vertices which are neighbors to a fixed vertex. Quasi-co-degree is a value of an edge which is maximum amid all values of edges which are neighbors to a fixed vertex but corresponded vertex is representative for this notion. Using different values which are related to a vertex inspire us to focus on edge and vertices which are corresponded to a fixed vertex. The notion of neighborhood is used to collect either vertices are titled neighbors or edges are incident to fixed vertex. In both settings, some classes of well-known neutrosophic graphs are studied. Some clarifications for each result and each definitions are provided. Using fixed vertex has key role to have these notions in the form of vertex or edge. The value of an edge has eligibility to call quasi-co-degree but the value of a vertex has eligibility to call quasi-degree. Some results get more frameworks and perspective about these definitions. The way in that, two vertices have connection together, open the way to define neighborhood and co-neighborhood. The maximum values in neighborhood and co-neighborhood introduces quasi-degree and quasi-co-degree, respectively. New name is chosen from degree. Since amid all vertices with different degrees, one vertex is chosen. In other words, one vertex is fixed and its degree turns out quasi-degree where two degrees could be assigned to a vertex. Degree of edges and degree of vertices. The number of edges which are incident to the vertex and the number of vertices which are neighbors to the vertex. Degree and co-degree are the notions which are transformed to use in quasi-style. Two neutrosophic values introduce two neutrosophic vertices separately in each settings. These notions are applied into neutrosophic graphs as individuals but not family of them as drawbacks for these notions. Finding special neutrosophic graphs which are well-known, is an open way to purse this study. Some problems are proposed to pursue this study. Basic familiarities with graph theory and neutrosophic graph theory are proposed for this article.

Many various using of this new-born fuzzy model for solving real-world problems and urgent requirements involve introducing new concept for analyzing the situations which leads to solve them by proper, quick and ecient method based on statistical data. This gap between the model and its solution cause that we introduce nikfar domination in neutrosophic graphs as creative and eective tool for studying a few selective vertices of this model instead of all ones by using special edges. Being special selection of these edges aect to achieve quick and proper solution to these problems. Domination hasn't ever been introduced. So we don't have any comparison with another de nitions. The most used graphs which have properties of being complete, empty, bipartite, tree and like stu and they also achieve the names for themselves, are studied as fuzzy models for getting nikfar dominating set or at least becoming so close to it. We also get the relations between this special edge which plays main role in doing dominating with other special types of edges of graph like bridges. Finally, the relation between this number with other special numbers and characteristic of graph like order are discussed.

In this research article, the notions of SuperHyperDominating and SuperHyperResolving are defined in the setting of neutrosophic SuperHyperGraphs. Some ideas are introduced on both notions of SuperHyperDominating and SuperHyperResolving, simultaneously and as the same with each other. Some neutrosophic SuperHyperClasses are defined based on the notion, SuperHyperResolving. The terms of duality, totality, perfectness, connectedness, and stable, are added to basic framework and initial notions, SuperHyperDominating and SuperHyperResolving but the concentration is on the “perfectness” to figure out what’s going on when for all targeted SuperHyperVertices, there’s only one SuperHyperVertex in the intended set. There are some instances and some clarifications to make sense about what’s happened and what’s done in the starting definitions. The key point is about the minimum sets. There are some questions and some problems to be taken as some avenues to pursue this study and this research. A basic familiarity with SuperHyperGraph theory and neutrosophic SuperHyperGraph theory are proposed.

New setting is introduced to study chromatic number. Different types of chromatic numbers and neutrosophic chromatic number are proposed in this way, some results are obtained. Classes of neutrosophic graphs are used to obtains these numbers and the representatives of the colors. Using colors to assign to the vertices of neutrosophic graphs is applied. Some questions and problems are posed concerning ways to do further studies on this topic. Using different types of edges from connectedness in same neutrosophic graphs and in modified neutrosophic graphs to define the relation amid vertices which implies having different colors amid them and as consequences, choosing one vertex as a representative of each color to use them in a set of representatives and finally, using neutrosophic cardinality of this set to compute types of chromatic numbers. This specific relation amid edges is necessary to compute both types of chromatic number concerning the number of representative in the set of representatives and types of neutrosophic chromatic number concerning neutrosophic cardinality of set of representatives. If two vertices have no intended edge, then they can be assigned to same color even they’ve common edge. Basic familiarities with neutrosophic graph theory and graph theory are proposed for this article.

New setting is introduced to study chromatic number. vital chromatic number and n-vital chromatic number are proposed in this way, some results are obtained. Classes of neutrosophic graphs are used to obtains these numbers and the representatives of the colors. Using colors to assign to the vertices of neutrosophic graphs is applied. Some questions and problems are posed concerning ways to do further studies on this topic. Using vital edge from connectedness to define the relation amid vertices which implies having different colors amid them and as consequences, choosing one vertex as a representative of each color to use them in a set of representatives and finally, using neutrosophic cardinality of this set to compute vital chromatic number. This specific relation amid edges is necessary to compute both vital chromatic number concerning the number of representative in the set of representatives and n-vital chromatic number concerning neutrosophic cardinality of set of representatives. If two vertices have no vital edge, then they can be assigned to same color even they’ve common edge. Basic familiarities with neutrosophic graph theory and graph theory are proposed for this article.

New setting is introduced to study chromatic number. Neutrosophic chromatic number and chromatic number are proposed in this way, some results are obtained. Classes of neutrosophic graphs are used to obtains these numbers and the representatives of the colors. Using colors to assigns to the vertices of neutrosophic graphs is applied. Some questions and problems are posed concerning ways to do further studies on this topic. Using strong edge to define the relation amid vertices which implies having different colors amid them and as consequences, choosing one vertex as a representative of each color to use them in a set of representatives and finally, using neutrosophic cardinality of this set to compute neutrosophic chromatic number. This specific relation amid edges is necessary to compute both chromatic number concerning the number of representative in the set of representatives and neutrosophic chromatic number concerning neutrosophic cardinality of set of representatives. If two vertices have no strong edge, then they can be assigned to same color even they’ve common edge. Basic familiarities with neutrosophic graph theory and graph theory are proposed for this article.

New setting is introduced to study co-neighborhood, neutrosophic t-neighborhood, neutrosophic quasi-vertex set, neutrosophic quasi-order, neutrosophic neighborhood, neutrosophic co-t-neighborhood, neutrosophic quasi-edge set, neutrosophic quasi-size, Neutrosophic number, neutrosophic co-neighborhood, co-neutrosophic number, quasi-number and quasi-co-number. Some classes of neutrosophic graphs are investigated.

New setting is introduced to study failed zero-forcing number and failed zero-forcing neutrosophic-number. Leaf-like is a key term to have these notions. Forcing a vertex to change its color is a type of approach to force that vertex to be zero-like. Forcing a vertex which is only neighbor for zero-like vertex to be zero-like vertex but now reverse approach is on demand which is finding biggest set which doesn’t force. LetNTG : (V,E,σ,μ) be a neutrosophic graph. Then failed zero-forcing number Z(NTG) for a neutrosophic graph NTG : (V,E,σ,μ) is maximal cardinality of a set S of black vertices (whereas vertices in V (G) \ S are colored white) such that V (G) isn’t turned black after finitely many applications of “the color-change rule”: a white vertex is converted to a black vertex if it is the only white neighbor of a black vertex. Failed zero-forcing neutrosophic-number Zn(NTG) for a neutrosophic graphNTG : (V,E,σ,μ) is maximal neutrosophic cardinality of a set S of black vertices (whereas vertices in V (G) \ S are colored white) such that V (G) isn’t turned black afterfinitely many applications of “the color-change rule”: a white vertex is converted to a black vertex if it is the only white neighbor of a black vertex. Failed zero-forcing number and failed zero-forcing neutrosophic-number are about a set of vertices which are applied into the setting of neutrosophic graphs. The structure of set is studied and general results are obtained. Also, some classes of neutrosophic graphs namely path-neutrosophic graphs, cycle-neutrosophic graphs, complete-neutrosophic graphs, star-neutrosophic graphs, bipartite-neutrosophic graphs, and t-partite-neutrosophic graphs are investigated in the terms of maximal set which forms both of failed zero-forcing number and failed zero-forcing neutrosophic-number. Neutrosophic number is reused in this way. It’s applied to use the type of neutrosophic number in the way that, three values of a vertex are used and they’ve same share to construct this number to compare with other vertices. Summation of three values of vertex makes one number and applying it to a comparison. This approach facilitates identifying vertices which form failed zero-forcing number and failed zero-forcing neutrosophic-number. In path-neutrosophic graphs, the set of vertices such that every given two vertices in the set, have distance at least two, forms maximal set but with slightly differences, in cycle-neutrosophic graphs, the set of vertices such that every given two vertices in the set, have distance at least two, forms maximal set. Other classes have same approaches. In complete-neutrosophic graphs, a set of vertices excluding two vertices leads us to failed zero-forcing number and failed zero-forcing neutrosophic-number. In star-neutrosophic graphs, a set of vertices excluding only two vertices and containing center, makes maximal set. In complete-bipartite-neutrosophic graphs, a set of vertices excluding two vertices from same parts makes intended set but with slightly differences, in complete-t-partite-neutrosophic graphs, a set of vertices excluding two vertices from same parts makes intended set. In both settings, some classes of well-known neutrosophic graphs are studied. Some clarifications for each result and each definition are provided. Using basic set not to extend this set to set of all vertices has key role to have these notions in the form of failed zero-forcing number and failed zero-forcing neutrosophic-number. The cardinality of a set has eligibility to form failed zero-forcing number but the neutrosophic cardinality of a set has eligibility to call failed zero-forcing neutrosophic-number. Some results get more frameworks and perspective about these definitions. The way in that, two vertices don’t have unique connection together, opens the way to do some approaches. A vertex could affect on other vertex but there’s no usage of edges. These notions are applied into neutrosophic graphs as individuals but not family of them as drawbacks for these notions. Finding special neutrosophic graphs which are well-known, is an open way to pursue this study. Some problems are proposed to pursue this study. Basic familiarities with graph theory and neutrosophic graph theory are proposed for this article.

New setting is introduced to study the global powerful alliance. Global powerful alliance is about a set of vertices which are applied into the setting of neutrosophic graphs. Neighborhood has the key role to define this notion. Also, neighborhood is defined based on strong edges. Strong edge gets a framework as neighborhood and after that, too close vertices have key role to define global powerful alliance based on strong edges. The structure of set is studied and general results are obtained. Also, some classes of neutrosophic graphs excluding empty, path, star, and wheel and containing complete, cycle and r-regular-strong are investigated in the terms of set, minimal set, number, and neutrosophic number. Neutrosophic number is used in this way. It’s applied to use the type of neutrosophic number in the way that, three values of a vertex are used and they’ve same share to construct this number. It’s called “modified neutrosophic number”. Summation of three values of vertex makes one number and applying it to a set makes neutrosophic number of set. This approach facilitates identifying minimal set and optimal set which forms minimal-global-powerful-alliance number and minimal-global-powerful-alliance-neutrosophic number. Two different types of sets namely global-powerful alliance and minimal-global-powerful alliance are defined. Global-powerful alliance identifies the sets in general vision but minimal-global-powerful alliance takes focus on the sets which deleting a vertex is impossible. Minimal-global-powerful-alliance number is about minimum cardinality amid the cardinalities of all minimal-global-powerful alliances in a given neutrosophic graph. New notions are applied in the settings both individual and family. Family of neutrosophic graphs has an open avenue, in the way that, the family only contains same classes of neutrosophic graphs. The results are about minimal-global-powerful alliance, minimal-global-powerful-alliance number and its corresponded sets, minimal-global-powerful-alliance-neutrosophic number and its corresponded sets, and characterizing all minimal-global-powerful alliances, minimal-t-powerful alliance, minimal-t-powerful-alliance number and its corresponded sets, minimal-t-powerful-alliance-neutrosophic number and its corresponded sets, and characterizing all minimal-t-powerful alliances. The connections amid t-powerful-alliances are obtained. The number of connected components has some relations with this new concept and it gets some results. Some classes of neutrosophic graphs behave differently when the parity of vertices are different and in this case, cycle, and complete illustrate these behaviors. Two applications concerning complete model as individual and family, under the titles of time table and scheduling conclude the results and they give more clarifications and closing remarks. In this study, there’s an open way to extend these results into the family of these classes of neutrosophic graphs. The family of neutrosophic graphs aren’t study deeply and with more results but it seems that analogous results are determined. Slight progress is obtained in the family of these models but there are open avenues to study family of other models as same models and different models. There’s a question. How can be related to each other, two sets partitioning the vertex set of a graph? The ideas of neighborhood and neighbors based on strong edges illustrate open way to get results. A set is global powerful alliance when two sets partitioning vertex set have uniform structure. All members of set have more amount of neighbors in the set than out of set and reversely for non-members of set with less members in the way that the set is simultaneously t-offensive and(t-2)-defensive. A set is global if t=0. It leads us to the notion of global powerful alliance. Different edges make different neighborhoods but it’s used one style edge titled strong edge. These notions are applied into neutrosophic graphs as individuals and family of them. Independent set as an alliance is a special set which has no neighbor inside and it implies some drawbacks for these notions. Finding special sets which are well-known, is an open way to purse this study. Special set which its members have only one neighbor inside, characterize the connected components where the cardinality of its complement is the number of connected components. Some problems are proposed to pursue this study. Basic familiarities with graph theory and neutrosophic graph theory are proposed for this article.

New setting is introduced to study the global offensive alliance. Global offensive alliance is about a set of vertices which are applied into the setting of neutrosophic graphs. Neighborhood has the key role to define this notion. Also, neighborhood is defined based on strong edges. Strong edge gets a framework as neighborhood and after that, too close vertices have key role to define global offensive alliance based on strong edges. The structure of set is studied and general results are obtained. Also, some classes of neutrosophic graphs containing complete, empty, path, cycle, star, and wheel are investigated in the terms of set, minimal set, number, and neutrosophic number. Neutrosophic number is defined in new way. It’s first time to define this type of neutrosophic number in the way that, three values of a vertex are used and they’ve same share to construct this number. It’s called “modified neutrosophic number”. Summation of three values of vertex makes one number and applying it to a set makes neutrosophic number of set. This approach facilitates identifying minimal set and optimal set which forms minimal-global-offensive-alliance number and minimal-global-offensive-alliance-neutrosophic number. Two different types of sets namely global-offensive alliance and minimal-global-offensive alliance are defined. Global-offensive alliance identifies the sets in general vision but minimal-global-offensive alliance takes focus on the sets which deleting a vertex is impossible. Minimal-global-offensive-alliance number is about minimum cardinality amid the cardinalities of all minimal-global-offensive alliances in a given neutrosophic graph. New notions are applied in the settings both individual and family. Family of neutrosophic graphs is studied in the way that, the family only contains same classes of neutrosophic graphs. Three types of family of neutrosophic graphs including m-family of neutrosophic stars with common neutrosophic vertex set, m-family of odd complete graphs with common neutrosophic vertex set, and m-family of odd complete graphs with common neutrosophic vertex set are studied. The results are about minimal-global-offensive alliance, minimal-global-offensive-alliance number and its corresponded sets, minimal-global-offensive-alliance-neutrosophic number and its corresponded sets, and characterizing all minimal-global-offensive alliances. The connection of global-offensive-alliances with dominating set and chromatic number are obtained. The number of connected components has some relations with this new concept and it gets some results. Some classes of neutrosophic graphs behave differently when the parity of vertices are different and in this case, path, cycle, and complete illustrate these behaviors. Two applications concerning complete model as individual and family, under the titles of time table and scheduling conclude the results and they give more clarifications. In this study, there’s an open way to extend these results into the family of these classes of neutrosophic graphs. The family of neutrosophic graphs aren’t study deeply and with more results but it seems that analogous results are determined. Slight progress is obtained in the family of these models but there are open avenues to study family of other models as same models and different models. There’s a question. How can be related to each other, two sets partitioning the vertex set of a graph? The ideas of neighborhood and neighbors based on strong edges illustrate open way to get results. A set is global offensive alliance when two sets partitioning vertex set have uniform structure. All members of set have more amount of neighbors in the set than out of set. It leads us to the notion of global offensive alliance. Different edges make different neighborhoods but it’s used one style edge titled strong edge. These notions are applied into neutrosophic graphs as individuals and family of them. Independent set as an alliance is a special set which has no neighbor inside and it implies some drawbacks for these notions. Finding special sets which are well-known, is an open way to purse this study. Special set which its members have only one neighbor inside, characterize the connected components where the cardinality of its complement is the number of connected components. Some problems are proposed to pursue this study. Basic familiarities with graph theory and neutrosophic graph theory are proposed for this article.

New notion of dimension as set, as two optimal numbers including metric number, dimension number and as optimal set are introduced in individual framework and in formation of family. Behaviors of twin and antipodal are explored in fuzzy(neutrosophic) graphs. Fuzzy(neutrosophic) graphs, under conditions, fixed-edges, fixed-vertex and strong fixed-vertex are studied. Some classes as path, cycle, complete, strong, t-partite, bipartite, star and wheel in the formation of individual case and in the case, they form a family are studied in the term of dimension. Fuzzification(neutrosofication) of twin vertices but using crisp concept of antipodal vertices are another approaches of this study. Thus defining two notions concerning vertices which one of them is fuzzy(neutrosophic) titled twin and another is crisp titled antipodal to study the behaviors of cycles which are partitioned into even and odd, are concluded. Classes of cycles according to antipodal vertices are divided into two classes as even and odd. Parity of the number of edges in cycle causes to have two subsections under the section is entitled to antipodal vertices. In this study, the term dimension is introduced on fuzzy(neutrosophic) graphs. The locations of objects by a set of some junctions which have distinct distance from any couple of objects out of the set, are determined. Thus it’s possible to have the locations of objects outside of this set by assigning partial number to any objects. The classes of these specific graphs are chosen to obtain some results based on dimension. The types of crisp notions and fuzzy(neutrosophic) notions are used to make sense about the material of this study and the outline of this study uses some new notions which are crisp and fuzzy(neutrosophic). Some questions and problems are posed concerning ways to do further studies on this topic. Basic familiarities with fuzzy(neutrosophic) graph theory and graph theory are proposed for this article.

This article presents a new method of segmenting images with gray levels. The method is based on determining several thresholds for separation of gray levels. The determination of these thresholds is done using the certainty of the neutrosophic information. The concept of this method can be stated simply: to choose the local maximums for the neutrosophic certainty.

In this paper, a geometric model is introduced for Neutrosophic data problem for the first time. This model is based on neutrosophic sets and neutrosophic relations. Neutrosophic control points are defined according to these points, resulting in neutrosophic Bézier curves.

New setting is introduced to study resolving number and chromatic number alongside dominating number. Different types of procedures including set, optimal set, and optimal number alongside study on the family of neutrosophic hypergraphs are proposed in this way, some results are obtained. General classes of neutrosophic hypergraphs are used to obtains these numbers and the representatives of the colors, dominating sets and resolving sets. Using colors to assign to the vertices of neutrosophic hypergraphs and characterizing resolving sets and dominating sets are applied. Some questions and problems are posed concerning ways to do further studies on this topic. Using different ways of study on neutrosophic hypergraphs to get new results about numbers and sets in the way that some numbers get understandable perspective. Family of neutrosophic hypergraphs are studied to investigate about the notions, dimension and coloring alongside domination in neutrosophic hypergraphs. In this way, sets of representatives of colors, resolving sets and dominating sets have key role. Optimal sets and optimal numbers have key points to get new results but in some cases, there are usages of sets and numbers instead of optimal ones. Simultaneously, three notions are applied into neutrosophic hypergraphs to get sensible results about their structures. Basic familiarities with neutrosophic hypergraphs theory and hypergraph theory are proposed for this article.

This article presents a new method of segmenting grayscale images by minimizing Shannon's neutrosophic entropy. For the proposed segmentation method, the neutrosophic information components, i.e., the degree of truth, the degree of neutrality and the degree of falsity are defined taking into account the belonging to the segmented regions and at the same time to the separation threshold area. The principle of the method is simple and easy to understand and can lead to multiple thresholds. The efficacy of the method is illustrated using some test gray level images. The experimental results show that the proposed method has good performance for segmentation with optimal gray level thresholds.

New setting is introduced to study types of coloring numbers, degree of vertices, degree of hyperedges, co-degree of vertices, co-degree of hyperedges, neutrosophic degree of vertices, neutrosophic degree of hyperedges, neutrosophic co-degree of vertices, neutrosophic co-degree of hyperedges, neutrosophic number of vertices, neutrosophic number of hyperedges in neutrosophic hypergraphs. Different types of procedures including neutrosophic (r, n)−regular hypergraphs and neutrosophic complete r−partite hypergraphs are proposed in this way, some results are obtained. General classes of neutrosophic hypergraphs are used to obtain chromatic number, the representatives of the colors, degree of vertices, degree of hyperedges, co-degree of vertices, co-degree of hyperedges, neutrosophic degree of vertices, neutrosophic degree of hyperedges, neutrosophic co-degree of vertices, neutrosophic co-degree of hyperedges, neutrosophic number of vertices, neutrosophic number of hyperedges in neutrosophic hypergraphs. Using colors to assign to the vertices of neutrosophic hypergraphs and characterizing representatives of the colors are applied in neutrosophic (r, n)−regular hypergraphs and neutrosophic complete r−partite hypergraphs. Some questions and problems are posed concerning ways to do further studies on this topic. Using different ways of study on neutrosophic hypergraphs to get new results about number, degree and co-degree in the way that some number, degree and co-degree get understandable perspective. Neutrosophic (r, n)−regular hypergraphs and neutrosophic complete r−partite hypergraphs are studied to investigate about the notions, coloring, the representatives of the colors, degree of vertices, degree of hyperedges, co-degree of vertices, co-degree of hyperedges, neutrosophic degree of vertices, neutrosophic degree of hyperedges, neutrosophic co-degree of vertices, neutrosophic co-degree of hyperedges, neutrosophic number of vertices, neutrosophic number of hyperedges in neutrosophic (r, n)−regular hypergraphs and neutrosophic complete r−partite hypergraphs. In this way, sets of representatives of colors, degree of vertices, degree of hyperedges, co-degree of vertices, co-degree of hyperedges, neutrosophic degree of vertices, neutrosophic degree of hyperedges, neutrosophic co-degree of vertices, neutrosophic co-degree of hyperedges, neutrosophic number of vertices, neutrosophic number of hyperedges have key points to get new results but in some cases, there are usages of sets and numbers instead of optimal ones. Simultaneously, notions chromatic number, the representatives of the colors, degree of vertices, degree of hyperedges, co-degree of vertices, co-degree of hyperedges, neutrosophic degree of vertices, neutrosophic degree of hyperedges, neutrosophic co-degree of vertices, neutrosophic co-degree of hyperedges, neutrosophic number of vertices, neutrosophic number of hyperedges are applied into neutrosophic hypergraphs, especially, neutrosophic (r, n)−regular hypergraphs and neutrosophic complete r−partite hypergraphs to get sensible results about their structures. Basic familiarities with neutrosophic hypergraphs theory and hypergraph theory are proposed for this article.

Neutrosophic cubic set is the hybridization of the concept of neutrosophic set and interval neutrosophic set. Neutrosophic cubic set has the capacity to express the hybrid information of both the interval neutrosophic set and the single valued neutrosophic set simultaneously. As newly defined, little research on the operations and applications of neutrosophic cubic sets appear in the current literature. In the present paper we propose the score, accuracy functions for neutrosophic cubic sets and prove their basic properties. We firstly develop TODIM method to solve multi attribute group decision making in neutrosophic cubic set environment, which we call NC-TODIM. Also, we solve a MAGDM problem using the proposed NC-TODIM method to show the applicability and effectiveness of the developed method. We also conduct sensitivity analysis to show the impact of ranking order of the alternatives for different values of attenuation factor of losses for multi-attribute group decision making problem.

In this research, assume a SuperHyperGraph. Then a ``Failed SuperHyperClique'' $\mathcal{C}(NSHG)$ for a neutrosophic SuperHyperGraph $NSHG:(V,E)$ is the maximum cardinality of a SuperHyperSet $S$ of SuperHyperVertices such that there's a SuperHyperVertex to have a SuperHyperEdge in common. Assume a SuperHyperGraph. Then an ``$\delta-$Failed SuperHyperClique'' is a \underline{maximal} Failed SuperHyperClique of SuperHyperVertices with \underline{maximum} cardinality such that either of the following expressions hold for the (neutrosophic) cardinalities of SuperHyperNeighbors of $s\in S:$ $~|S\cap N(s)| > |S\cap (V\setminus N(s))|+\delta,~|S\cap N(s)| < |S\cap (V\setminus N(s))|+\delta.$ The first Expression, holds if $S$ is an ``$\delta-$SuperHyperOffensive''. And the second Expression, holds if $S$ is an ``$\delta-$SuperHyperDefensive''; a``neutrosophic $\delta-$Failed SuperHyperClique'' is a \underline{maximal} neutrosophic Failed SuperHyperClique of SuperHyperVertices with \underline{maximum} neutrosophic cardinality such that either of the following expressions hold for the neutrosophic cardinalities of SuperHyperNeighbors of $s\in S:$ $~|S\cap N(s)|_{neutrosophic} > |S\cap (V\setminus N(s))|_{neutrosophic}+\delta,~ |S\cap N(s)|_{neutrosophic} < |S\cap (V\setminus N(s))|_{neutrosophic}+\delta.$ The first Expression, holds if $S$ is a ``neutrosophic $\delta-$SuperHyperOffensive''. And the second Expression, holds if $S$ is a ``neutrosophic $\delta-$SuperHyperDefensive''. A basic familiarity with Neutrosophic Failed SuperHyperClique theory, SuperHyperGraphs theory, and Neutrosophic SuperHyperGraphs theory are proposed.

Neutrosophic cubic set (NCS) is one of the important family members of neutrosophic hybrid sets. Neutrosophic cubic set has more strength than other family members of neutrosophic hybrid sets to express incomplete information due to the presence of interval valued neutrosophic set (IVNS) and single valued neutrosophic set (SVNS) in its structure. Cross entropy measure is one of the best way to calculate the divergence of any variable from the priori one variable. In this paper we first define a new cross entropy measure under NCSs environment which we call NC- cross entropy measure. We investigate the basic properties of NC-cross entropy. We also propose weighted NC-cross entropy and investigate its basic properties. We develop a novel multi attribute decision making (MADM) strategy based on weighted NC-cross entropy. To show the feasibility and applicability, we solve a MADM problem using the proposed strategy.

The research is on the SuperHyperGirth and the neutrosophic SuperHyperGirth. A SuperHyperGraph has SuperHyperGirth where it’s the longest SuperHyperCycle. To get structural examples and instances, I’m going to introduce the next SuperHyperClass of SuperHyperGraph based on SuperHyperGirth. It’s the main. It’ll be disciplinary to have the foundation of previous definition in the kind of SuperHyperClass. This SuperHyperClass is officially called “SuperHyperFlower”. If there’s a need to have all SuperHyperCycles until the SuperHyperGirth, then it’s officially called “SuperHyperOrder” but otherwise, it isn’t SuperHyperOrder. There are two instances about the clarifications for the main definition titled “SuperHyperGirth”. These two examples get more scrutiny and discernment since there are characterized in the disciplinary ways of the SuperHyperClass based on SuperHyperGirth and they’re called “SuperHyperFlower.” A SuperHyperGraph has “neutrosophic SuperHyperGirth” where it’s the strongest [the maximum value from all SuperHyperCycles amid the minimum value amid all SuperHyperEdges from a SuperHyperCycle.] SuperHyperCycle. In “Cancer’s Recognitions”, the aim is to find either the longest SuperHyperCycle or the strongest SuperHyperCycle in those neutrosophic SuperHyperModels. For the longest SuperHyperCycle, called SuperHyperGirth, and the strongest SuperHyperCycle, called neutrosophic SuperHyperGirth, some general results are introduced. Beyond that in SuperHyperStar, all possible SuperHyperPaths have only two SuperHyperEdges but it’s not enough since it’s essential to have at least three SuperHyperEdges to form any style of a SuperHyperCycle. There isn’t any formation of any SuperHyperCycle but literarily, it’s the deformation of any SuperHyperCycle. It, literarily, deforms and it doesn’t form. A basic familiarity with SuperHyperGraph theory and neutrosophic SuperHyperGraph theory are proposed.

New setting is introduced to study the alliances. Alliances are about a set of vertices which are applied into the setting of neutrosophic graphs. Neighborhood has the key role to define these notions. Also, neighborhood is defined based on the edges, strong edges and some edges which are coming from connectedness. These three types of edges get a framework as neighborhood and after that, too close vertices have key role to define offensive alliance, defensive alliance, t-offensive alliance, and t-defensive alliance based on three types of edges, common edges, strong edges and some edges which are coming from connectedness. The structure of set is studied and general results are obtained. Also, some classes of neutrosophic graphs containing complete, empty, path, cycle, bipartite, t-partite, star and wheel are investigated in the terms of set, minimal set, number, and neutrosophic number. In this study, there’s an open way to extend these results into the family of these classes of neutrosophic graphs. The family of neutrosophic graphs aren’t study but it seems that analogous results are determined. There’s a question. How can be related to each other, two sets partitioning the vertex set of a graph? The ideas of neighborhood and neighbors based on different edges illustrate open way to get results. A set is alliance when two sets partitioning vertex set have uniform structure. All members of set have different amount of neighbors in the set and out of set. It leads us to the notion of offensive and defensive. New ideas, offensive alliance, defensive alliance, t-offensive alliance, t-defensive alliance, strong offensive alliance, strong defensive alliance, strong t-offensive alliance, strong t-defensive alliance, connected offensive alliance, connected defensive alliance, connected t-offensive alliance, and connected t-defensive alliance are introduced. Two numbers concerning cardinality and neutrosophic cardinality of alliances are introduced. A set is alliance when its complement make a relation in the terms of neighborhood. Different edges make different neighborhoods. Three types of edges are applied to define three styles of neighborhoods. General edges, strong edges and connected edges are used where connected edges are the edges arising from connectedness amid two endpoints of the edges. These notions are applied into neutrosophic graphs as individuals and family of them. Independent set as an alliance is a special set which has no neighbor inside and it implies some drawbacks for this notions. Finding special sets which are well-known, is an open way to purse this study. Special set which its members have only one neighbor inside, characterize the connected components where the cardinality of its complement is the number of connected components. Some problems are proposed to pursue this study. Basic familiarities with graph theory and neutrosophic graph theory are proposed for this article.

Single valued neutrosophic set has king power to express uncertainty characterized by indeterminacy, inconsistency and incompleteness. Most of the existing single valued neutrosophic cross entropy bears an asymmetrical behavior and produce an undefined phenomenon in some situations. In order to deal with these disadvantages, we propose a new cross entropy measure under single valued neutrosophic set (SVNS) environment namely SN- cross entropy and prove its basic properties. Also we define weighted SN-cross entropy measure and investigate its basic properties. We develop a new multi attribute group decision making (MAGDM) strategy for ranking of the alternatives based on the proposed weighted SN-cross entropy measure between each alternative and the ideal alternative. Finally, a numerical example of MAGDM problem of investment potential is solved to show the validity and efficiency of proposed decision making strategy. We also present comparative anslysis of the obtained result with the results obtained form the existing solution strategies in the solution.

The concept of neutrosophic number is a significant mathematical tool to deal with real scientific problems because it can tackle indeterminate and incomplete information which exists generally in real problems. In this article, we use neutrosophic numbers (a + bI), where a and bI denote determinate component and indeterminate component respectively. We explore the situations in which the input information is needed to express in terms of neutrosophic numbers. We define score functions and accuracy functions for ranking neutrosophic numbers. We then define a cosine function to determine unknown criteria weights. We define neutrosophic number harmonic mean operators and proved their basic properties. Then, we develop two novel MCGDM strategies using the proposed aggregation operators. We solve a numerical example to demonstrate the feasibility and effectiveness of the proposed two strategies. Sensitivity analysis with variation of “I” on neutrosophic numbers is performed to demonstrate how the preference ranking order of alternatives is sensitive to the change of “I”. The efficiency of the developed strategies is ascertained by comparing the obtained results from the proposed strategies with the existing strategies in the literature.

The paper investigates some similarity measures in interval bipolar neutrosophic environment for multi-attribute decision making problems. At first, we define Hamming and Euclidean distances measures between interval bipolar neutrosophic sets and establish their basic properties. We also propose two similarity measures based on the Hamming and Euclidean distance functions. Using maximum and minimum operators, we define new similarity measures and prove their basic properties. Using the proposed similarity measures, we propose a novel multi attribute decision making strategy in interval bipolar neutrosophic set environment. Lastly, we solve an illustrative example of multi attribute decision making and present comparison analysis to show the feasibility, applicability and effectiveness of the proposed strategy.

In this research, the extreme SuperHyperNotion, namely, extreme SuperHyperGirth, is up. $E_1$ and $E_3$ are some empty extreme SuperHyperEdges but $E_2$ is a loop extreme SuperHyperEdge and $E_4$ is an extreme SuperHyperEdge. Thus in the terms of extreme SuperHyperNeighbor, there's only one extreme SuperHyperEdge, namely, $E_4.$ The extreme SuperHyperVertex, $V_3$ is extreme isolated means that there's no extreme SuperHyperEdge has it as an extreme endpoint. Thus the extreme SuperHyperVertex, $V_3,$ is excluded in every given extreme SuperHyperGirth. $ \mathcal{C}(NSHG)=\{E_i\}~\text{is an extreme SuperHyperGirth.} \ \ \mathcal{C}(NSHG)=jz^i~\text{is an extreme SuperHyperGirth SuperHyperPolynomial.} \ \ \mathcal{C}(NSHG)=\{V_i\}~\text{is an extreme R-SuperHyperGirth.} \ \ \mathcal{C}(NSHG)=jz^I~{\small\text{is an extreme R-SuperHyperGirth SuperHyperPolynomial.}} $ The following extreme SuperHyperSet of extreme SuperHyperEdges[SuperHyperVertices] is the extreme type-SuperHyperSet of the extreme SuperHyperGirth. The extreme SuperHyperSet of extreme SuperHyperEdges[SuperHyperVertices], is the extreme type-SuperHyperSet of the extreme SuperHyperGirth. The extreme SuperHyperSet of the extreme SuperHyperEdges[SuperHyperVertices], is an extreme SuperHyperGirth $\mathcal{C}(ESHG)$ for an extreme SuperHyperGraph $ESHG:(V,E)$ is an extreme type-SuperHyperSet with the maximum extreme cardinality of an extreme SuperHyperSet $S$ of extreme SuperHyperEdges[SuperHyperVertices] such that there's only one extreme consecutive sequence of the extreme SuperHyperVertices and the extreme SuperHyperEdges form only one extreme SuperHyperCycle. There are not only four extreme SuperHyperVertices inside the intended extreme SuperHyperSet. Thus the non-obvious extreme SuperHyperGirth isn't up. The obvious simple extreme type-SuperHyperSet called the extreme SuperHyperGirth is an extreme SuperHyperSet includes only less than four extreme SuperHyperVertices. But the extreme SuperHyperSet of the extreme SuperHyperEdges[SuperHyperVertices], doesn't have less than four SuperHyperVertices inside the intended extreme SuperHyperSet. Thus the non-obvious simple extreme type-SuperHyperSet of the extreme SuperHyperGirth isn't up. To sum them up, the extreme SuperHyperSet of the extreme SuperHyperEdges[SuperHyperVertices], isn't the non-obvious simple extreme type-SuperHyperSet of the extreme SuperHyperGirth. Since the extreme SuperHyperSet of the extreme SuperHyperEdges[SuperHyperVertices], is an extreme SuperHyperGirth $\mathcal{C}(ESHG)$ for an extreme SuperHyperGraph $ESHG:(V,E)$ is the extreme SuperHyperSet $S$ of extreme SuperHyperVertices[SuperHyperEdges] such that there's only one extreme consecutive extreme sequence of extreme SuperHyperVertices and extreme SuperHyperEdges form only one extreme SuperHyperCycle given by that extreme type-SuperHyperSet called the extreme SuperHyperGirth and it's an extreme SuperHyperGirth . Since it 's the maximum extreme cardinality of an extreme SuperHyperSet $S$ of extreme SuperHyperEdges[SuperHyperVertices] such that there's only one extreme consecutive extreme sequence of extreme SuperHyperVertices and extreme SuperHyperEdges form only one extreme SuperHyperCycle. There are only less than four extreme SuperHyperVertices inside the intended extreme SuperHyperSet, thus the obvious extreme SuperHyperGirth, is up. The obvious simple extreme type-SuperHyperSet of the extreme SuperHyperGirth, is: ,is the extreme SuperHyperSet, is: does includes only less than four SuperHyperVertices in a connected extreme SuperHyperGraph $ESHG:(V,E).$ It's interesting to mention that the only simple extreme type-SuperHyperSet called the extreme SuperHyperGirth amid those obvious[non-obvious] simple extreme type-SuperHyperSets called the neutrosophic SuperHyperGirth , is only and only. A basic familiarity with extreme SuperHyperGirth theory, SuperHyperGraphs, and extreme SuperHyperGraphs theory are proposed.

New ideas on the framework of Neutrosophic SuperHyperGraph for different styles of Neutrosophic SuperHyper-Bipartite and Neutrosophic SuperHyper-Path are introduced. More instances and more clarifications alongside sufficient references.

In this research, assume a SuperHyperGraph. Then a ``Failed SuperHyperStable'' $\mathcal{I}(NSHG)$ for a neutrosophic SuperHyperGraph $NSHG:(V,E)$ is the maximum cardinality of a SuperHyperSet $S$ of SuperHyperVertices such that there's a SuperHyperVertex to have a SuperHyperEdge in common. Assume a SuperHyperGraph. Then an ``$\delta-$Failed SuperHyperStable'' is a \underline{maximal} Failed SuperHyperStable of SuperHyperVertices with \underline{maximum} cardinality such that either of the following expressions hold for the (neutrosophic) cardinalities of SuperHyperNeighbors of $s\in S:$ $~|S\cap N(s)| > |S\cap (V\setminus N(s))|+\delta,~|S\cap N(s)| < |S\cap (V\setminus N(s))|+\delta.$ The first Expression, holds if $S$ is an ``$\delta-$SuperHyperOffensive''. And the second Expression, holds if $S$ is an ``$\delta-$SuperHyperDefensive''; a``neutrosophic $\delta-$Failed SuperHyperStable'' is a \underline{maximal} neutrosophic Failed SuperHyperStable of SuperHyperVertices with \underline{maximum} neutrosophic cardinality such that either of the following expressions hold for the neutrosophic cardinalities of SuperHyperNeighbors of $s\in S:$ $~|S\cap N(s)|_{neutrosophic} > |S\cap (V\setminus N(s))|_{neutrosophic}+\delta,~ |S\cap N(s)|_{neutrosophic} < |S\cap (V\setminus N(s))|_{neutrosophic}+\delta.$ The first Expression, holds if $S$ is a ``neutrosophic $\delta-$SuperHyperOffensive''. And the second Expression, holds if $S$ is a ``neutrosophic $\delta-$SuperHyperDefensive''. A basic familiarity with Extreme Failed SuperHyperClique theory, Neutrosophic Failed SuperHyperClique theory, and (Neutrosophic) SuperHyperGraphs theory are proposed.

In this research, new setting is introduced for new notions, namely, SuperHyperDegree and Co-SuperHyperDegree. Two different types of definitions are debut for them but the research goes further and the SuperHyperNotion, SuperHyperUniform, and SuperHyperClass based on that are well-defined and well-reviewed. The literature review is implemented in the whole of this research. For shining the elegancy and the significancy of this research, the comparison between this SuperHyperNotion with other SuperHyperNotions and fundamental SuperHyperNumbers are featured. The definitions are followed by the examples and the instances thus the clarifications are driven with different tools. The applications are figured out to make sense about the theoretical aspect of this ongoing research. The cancer’s treatments are the under research to figure out the challenges make sense about ongoing and upcoming research. The special case is up. The cells are viewed in the deemed ways. There are different types of them. Some of them are individuals and some of them are well-modeled by the group of cells. These types are all officially called “SuperHyperVertex” but the relations amid them all officially called “SuperHyperEdge”. The frameworks “SuperHyperGraph” and “neutrosophic SuperHyperGraph” are chosen and elected to research about “cancer’s treatments”. Thus these complex and dense SuperHyperModels open up some avenues to research on theoretical segments and “cancer’s treatments”. Some avenues are posed to pursue this research. It’s also officially collected in the form of some questions and some problems. If there’s a SuperHyperEdge between two SuperHyperVertices, then these two SuperHyperVertices are called SuperHyperNeighbors. The number of SuperHyperNeighbors for a given SuperHyperVertex is called SuperHyperDegree. The number of common SuperHyperNeighbors for some SuperHyperVertices is called Co-SuperHyperDegree for them and used SuperHyperVertices are called Co-SuperHyperNeighbors. A graph is SuperHyperUniform if it’s SuperHyperGraph and the number of elements of SuperHyperEdges are the same. Assume a neutrosophic SuperHyperGraph. There are some SuperHyperClasses as follows. It’s SuperHyperPath if it’s only one SuperVertex as intersection amid two given SuperHyperEdges with two exceptions; it’s SuperHyperCycle if it’s only one SuperVertex as intersection amid two given SuperHyperEdges; it’s SuperHyperStar it’s only one SuperVertex as intersection amid all SuperHyperEdges; it’s SuperHyperBipartite it’s only one SuperVertex as intersection amid two given SuperHyperEdges and these SuperVertices, forming two separate sets, has no SuperHyperEdge in common; it’s SuperHyperMultiPartite it’s only one SuperVertex as intersection amid two given SuperHyperEdges and these SuperVertices, forming multi separate sets, has no SuperHyperEdge in common; it’s SuperHyperWheel if it’s only one SuperVertex as intersection amid two given SuperHyperEdges and one SuperVertex has one SuperHyperEdge with any common SuperVertex. The number of SuperHyperEdges for a given SuperHyperVertex is called SuperHyperDegree. The number of common SuperHyperEdges for some SuperHyperVertices is called Co-SuperHyperDegree for them. The number of SuperHyperVertices for a given SuperHyperEdge is called SuperHyperDegree. The number of common SuperHyperVertices for some SuperHyperEdges is called Co-SuperHyperDegree for them. The model proposes the specific designs. The model is officially called “SuperHyperGraph” and “Neutrosophic SuperHyperGraph”. In this model, The “specific” cells and “specific group” of cells are modeled as “SuperHyperVertices” and the common and intended properties between “specific” cells and “specific group” of cells are modeled as “SuperHyperEdges”. Sometimes, it’s useful to have some degrees of determinacy, indeterminacy, and neutrality to have more precise model which in this case the model is called “neutrosophic”. In the future research, the foundation will be based on the caner’s treatment and the results and the definitions will be introduced in redeemed ways. A basic familiarity with SuperHyperGraph theory and neutrosophic SuperHyperGraph theory are proposed.

In this research, assume a SuperHyperGraph. Then an extreme SuperHyperMatching $\mathcal{C}(NSHG)$ for a neutrosophic SuperHyperGraph $NSHG:(V,E)$ 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 $\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; an extreme SuperHyperMatching SuperHyperPolynomial $\mathcal{C}(NSHG)$ for a neutrosophic SuperHyperGraph $NSHG:(V,E)$ 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 $\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; an extreme R-SuperHyperMatching $\mathcal{C}(NSHG)$ for a neutrosophic SuperHyperGraph $NSHG:(V,E)$ 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 $\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; an extreme R-SuperHyperMatching SuperHyperPolynomial $\mathcal{C}(NSHG)$ for a neutrosophic SuperHyperGraph $NSHG:(V,E)$ 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 $\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. Assume a SuperHyperGraph. Then $\delta-$SuperHyperMatching is a maximal of SuperHyperVertices with a maximum cardinality such that either of the following expressions hold for the (neutrosophic) cardinalities of SuperHyperNeighbors of $s\in S:$ there are $|S\cap N(s)| > |S\cap (V\setminus N(s))|+\delta;$ and $ |S\cap N(s)| < |S\cap (V\setminus N(s))|+\delta.$ The first Expression, holds if $S$ is an $\delta-$SuperHyperOffensive. And the second Expression, holds if $S$ is an $\delta-$SuperHyperDefensive; a neutrosophic $\delta-$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 of $s\in S$ there are: $|S\cap N(s)|_{neutrosophic} > |S\cap (V\setminus N(s))|_{neutrosophic}+\delta;$ and $ |S\cap N(s)|_{neutrosophic} < |S\cap (V\setminus N(s))|_{neutrosophic}+\delta.$ The first Expression, holds if $S$ is a neutrosophic $\delta-$SuperHyperOffensive. And the second Expression, holds if $S$ is a neutrosophic $\delta-$SuperHyperDefensive 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 Extreme SuperHyperMatching theory, SuperHyperGraphs, and Neutrosophic SuperHyperGraphs theory are proposed.

New ideas on the framework of Neutrosophic SuperHyperGraph for different styles of Neutrosophic SuperHyper-Wheel and Neutrosophic SuperHyper-Star are introduced. More instances and more clarifications alongside sufficient references are featured with a specific type of independency of SuperHyperVertices.

Bipolar neutrosophic set is an important extension of bipolar fuzzy set. This set is a hybridization of bipolar fuzzy set and neutrosophic set. Every element of a bipolar neutrosophic set consists of three independent positive membership functions and three independent negative membership functions. In this paper, we develop cross entropy measures of bipolar neutrosophic sets and prove its properties. We also define cross entropy measures of interval bipolar neutrosophic sets and prove its properties. Thereafter, we develop two novel multi-attribute decision making methods based on the proposed cross entropy measures. In the decision making framework, we calculate the weighted cross entropy measures between each alternative and the ideal alternative to rank the alternatives and choose the best one. We solve two illustrative examples of multi-attribute decision making problems and compare the obtained result with the results of other existing methods to show the applicability and effectiveness of the developed method. In the end, the main conclusion and future scope of research are summarized.

Along with the economic growth, the companies must contribute to social progress and promote environmental sustainability in equal harmony. Sustainable human resource management (SHRM) strategies make it possible to attain the economic, social and environmental goals of a firm. In this regard, a survey method is discussed using the literature review and online questionnaire to identify the main factors/indicators during the SHRM evaluation of manufacturing firms in India. Uncertainty is commonly occurred in the assessment of SHRM factors. As a generalized version of fuzzy sets, single-valued neutrosophic set (SVNS) has been demonstrated as a valuable tool to illustrate the indeterminate, inconsistent and uncertain data of realistic decision-making problems. Considering the idea of SVNSs, this study develops a hybrid multi-criteria group decision-making (MCGDM) approach for assessing the SHRM of manufacturing firms under uncertainty settings. For this purpose, an SVN-alternative ranking order method accounting for two-step normalization (AROMAN) is proposed based on VIFI-score function-based decision experts’ (DEs’) weighting tool and integrated criteria weight-determining model to solve the MCGDM problems with fully unknown DEs and criteria weights. In this regard, we develop new SVN-distance measure to compute the degree of difference between SVNSs. Some examples are presented to demonstrate the efficacy of developed measure over the existing ones. In addition, new criteria weight-determination model is presented with the integration of objective weights through IVIF-distance measure-based model and subjective weights through ranking comparison (RANCOM) tool on SVNSs. The proposed ranking method is applied to an empirical study of SHRM assessment for manufacturing firms in India, which shows its applicability and feasibility. In this study, the evaluation criteria are characterized into social, environmental and economic aspects with DE’s opinions. Comparative and sensitivity analyses are made to show the strength and steadiness of presented approach. This study provides an innovative MCGDM analysis framework, which makes a significant contribution to the SHRM assessment problem under indeterminate, inconsistent and uncertain setting.

New setting is introduced to study “closing numbers” and “super-closing numbers” as optimal-super-resolving number, optimal-super-coloring number and optimal-super-dominating number. In this way, some approaches are applied to get some sets from (Neutrosophic)n-SuperHyperGraph and after that, some ideas are applied to get different types of super-closing numbers which are called by optimal-super-resolving number, optimal-super-coloring number and optimal-super-dominating number. The notion of dual is another new idea which is covered by these notions and results. In the setting of dual, the set of super-vertices is exchanged with the set of super-edges. Thus these results and definitions hold in the setting of dual. Setting of neutrosophic n-SuperHyperGraph is used to get some examples and solutions for two applications which are proposed. Both setting of SuperHyperGraph and neutrosophic n-SuperHyperGraph are simultaneously studied but the results are about the setting of n-SuperHyperGraphs. Setting of neutrosophic n-SuperHyperGraph get some examples where neutrosophic hypergraphs as special case of neutrosophic n-SuperHyperGraph are used. The clarifications use neutrosophic n-SuperHyperGraph and theoretical study is to use n-SuperHyperGraph but these results are also applicable into neutrosophic n-SuperHyperGraph. Special usage from different attributes of neutrosophic n-SuperHyperGraph are appropriate to have open ways to pursue this study. Different types of procedures including optimal-super-set, and optimal-super-number alongside study on the family of (neutrosophic)n-SuperHyperGraph are proposed in this way, some results are obtained. General classes of (neutrosophic)n-SuperHyperGraph are used to obtains these closing numbers and super-closing numbers and the representatives of the optimal-super-coloring sets, optimal-super-dominating sets and optimal-super-resolving sets. Using colors to assign to the super-vertices of n-SuperHyperGraph and characterizing optimal-super-resolving sets and optimal-super-dominating sets are applied. Some questions and problems are posed concerning ways to do further studies on this topic. Using different ways of study on n-SuperHyperGraph to get new results about closing numbers and super-closing numbers alongside sets in the way that some closing numbers super-closing numbers get understandable perspective. Family of n-SuperHyperGraph are studied to investigate about the notions, super-resolving and super-coloring alongside super-dominating in n-SuperHyperGraph. In this way, sets of representatives of optimal-super-colors, optimal-super-resolving sets and optimal-super-dominating sets have key role. Optimal-super sets and optimal-super numbers have key points to get new results but in some cases, there are usages of sets and numbers instead of optimal-super ones. Simultaneously, three notions are applied into (neutrosophic)n-SuperHyperGraph to get sensible results about their structures. Basic familiarities with n-SuperHyperGraph theory and neutrosophic n-SuperHyperGraph theory are proposed for this article.

In this research, new setting is introduced for assuming a SuperHyperGraph. Then a ``SuperHyperClique'' $\mathcal{C}(NSHG)$ for a neutrosophic SuperHyperGraph $NSHG:(V,E)$ is the maximum cardinality of a SuperHyperSet $S$ of SuperHyperVertices such that there's a SuperHyperVertex to have a SuperHyperEdge in common. Assume a SuperHyperGraph. Then an ``$\delta-$SuperHyperClique'' is a \underline{maximal} SuperHyperClique of SuperHyperVertices with \underline{maximum} cardinality such that either of the following expressions hold for the (neutrosophic) cardinalities of SuperHyperNeighbors of $s\in S:$ $~|S\cap N(s)| > |S\cap (V\setminus N(s))|+\delta,~|S\cap N(s)| < |S\cap (V\setminus N(s))|+\delta.$ The first Expression, holds if $S$ is an ``$\delta-$SuperHyperOffensive''. And the second Expression, holds if $S$ is an ``$\delta-$SuperHyperDefensive''; a``neutrosophic $\delta-$SuperHyperClique'' is a \underline{maximal} neutrosophic SuperHyperClique of SuperHyperVertices with \underline{maximum} neutrosophic cardinality such that either of the following expressions hold for the neutrosophic cardinalities of SuperHyperNeighbors of $s\in S:$ $~|S\cap N(s)|_{neutrosophic} > |S\cap (V\setminus N(s))|_{neutrosophic}+\delta,~ |S\cap N(s)|_{neutrosophic} < |S\cap (V\setminus N(s))|_{neutrosophic}+\delta.$ The first Expression, holds if $S$ is a ``neutrosophic $\delta-$SuperHyperOffensive''. And the second Expression, holds if $S$ is a ``neutrosophic $\delta-$SuperHyperDefensive''. A basic familiarity with Extreme SuperHyperClique theory, SuperHyperGraphs, and Neutrosophic SuperHyperGraphs theory are proposed.

In this research, assume a SuperHyperGraph. Then a ``Failed SuperHyperClique'' $\mathcal{C}(NSHG)$ for a neutrosophic SuperHyperGraph $NSHG:(V,E)$ is the maximum cardinality of a SuperHyperSet $S$ of SuperHyperVertices such that there's a SuperHyperVertex to have a SuperHyperEdge in common. Assume a SuperHyperGraph. Then an ``$\delta-$Failed SuperHyperClique'' is a \underline{maximal} Failed SuperHyperClique of SuperHyperVertices with \underline{maximum} cardinality such that either of the following expressions hold for the (neutrosophic) cardinalities of SuperHyperNeighbors of $s\in S:$ $~|S\cap N(s)| > |S\cap (V\setminus N(s))|+\delta,~|S\cap N(s)| < |S\cap (V\setminus N(s))|+\delta.$ The first Expression, holds if $S$ is an ``$\delta-$SuperHyperOffensive''. And the second Expression, holds if $S$ is an ``$\delta-$SuperHyperDefensive''; a``neutrosophic $\delta-$Failed SuperHyperClique'' is a \underline{maximal} neutrosophic Failed SuperHyperClique of SuperHyperVertices with \underline{maximum} neutrosophic cardinality such that either of the following expressions hold for the neutrosophic cardinalities of SuperHyperNeighbors of $s\in S:$ $~|S\cap N(s)|_{neutrosophic} > |S\cap (V\setminus N(s))|_{neutrosophic}+\delta,~ |S\cap N(s)|_{neutrosophic} < |S\cap (V\setminus N(s))|_{neutrosophic}+\delta.$ The first Expression, holds if $S$ is a ``neutrosophic $\delta-$SuperHyperOffensive''. And the second Expression, holds if $S$ is a ``neutrosophic $\delta-$SuperHyperDefensive''. A basic familiarity with Extreme Failed SuperHyperClique theory, Extreme SuperHyperGraphs theory, and Neutrosophic SuperHyperGraphs theory are proposed.

Purpose: The aim of this article is to analyze the incidence of undiagnosed obstructive sleep apnea OSA in patients affected by dento-skeletal malformation. We also evaluated the patterns most affected by the condition and calculated the post surgical changes. Methods: We conducted a retrospective cohort study on 71 patients including 35 men and 36 women. Patients were evaluated with Polysomnography before surgery and at least 6 months after surgery to assess any improvement or worsening of the apnea hypopnea index AHI index. Regarding AHI evaluation criteria an AHI > 5 was considered indicative of OSA, 4 5, com-pared to 20.5% described in the Italian population. Conclusion: In patients who receive orthognathic surgery the presence of Obstructive Sleep Apnea is significantly higher than in the general population. When planning the surgical correction of a dentoskeletal malformation, the surgeon must aim not only to the aesthetics results, but also to a proper stomatognathic and respiratory function, this cannot be done without taking poly-somnography information into account.

This study examines the attitudes and practices of dentists and dental students towards envi-ronmental issues within their professional context. Data was selected based on their responses on a Google Forms e-questionnaire, designed specifically for the study. The sample consisted of 78 professional dentists and 75 dental students in Greece and their attitudes towards environmental protection, awareness of the environmental impact of dental practices, and factors influencing the adoption of environmentally friendly practices were assessed. Results reveal generally positive attitudes towards environmental protection, with students demonstrating higher levels of proper waste management practices. Dentists express awareness of their environmental impact but ex-hibit varying levels of engagement in eco-friendly practices. Factors such as moral consciousness and believing in the severity of climate change significantly influence environmental awareness in dental practice. Notably, dental students exhibit greater environmental awareness compared to practicing dentists. These findings emphasize the importance of integrating environmental edu-cation into dental curricula and continuing education programs to foster sustainable practices in dental care. Future research could explore interventions to enhance environmental consciousness among practicing dentists and assess the long-term impact of environmental education initiatives on dental care sustainability.

Abstract: Background: Nurses worldwide are acknowledged for their role in health education across various settings. However, doubts often arise regarding their competence in this domain. This study aims to validate the Nurse Health Education Competence Instrument (NHECI) linguis-tically and culturally for the Italian context. Methods: Following Beaton et al.’s (2000) guidelines, we conducted cross-cultural adaptation to develop the Italian version of the questionnaire. Results: The Italian version demonstrates good internal consistency and stability, making it suita-ble for assessing nursing students during clinical internships and practicing nurses. Availability of Italian tools promotes research in healthcare, ensuring patient-centric care. Conclusions: The validity and reliability of the Italian version of the instrument for assessing health education competencies, essential for self-assessment among health education nurses, are established.

In air quality management, at urban and regional levels, road transport remains the cornerstone of residential, commercial, and industrial activities, and the vehicle exhaust emissions maintain the position of one of the key contributing sources. In Indian cities, big and small, vehicle exhaust emissions and dust from vehicle movement on the roads, contribute to as much as 50% of particulate matter pollution in a year. So, having access to a vehicle exhaust emissions inventory that is reliable and replicable is critical for air quality management and this exercise starts with access to vehicle stock numbers. These numbers are typically obtained from vehicle registration databases, traffic surveys, and other governmental records, and often require time consuming data cleaning protocols before they can used for emissions and pollution baseline analysis. This paper provides a cleaned and open-access vehicle stock database, as registered and in-use fleet, for the period covering 1993 and 2018, for all India and states, along with an estimate of age-mix of the vehicles using survival functions.

Counter-current spontaneous imbibition of water is a critical oil-recovery mechanism. In the laboratory, the Amott test is a widely used technique to assess efficacy of brine imbibition into oil-saturated core plugs. The classic Amott-cell methodology was designed to estimate ultimate oil recovery, but not the recovery dynamics that provides essential information about the imbibition mechanisms. Retention of oil droplets at the external core surface and delayed onset of oil production are the two key artifacts of the classic Amott experiment. This retention, referred to here as the ``external-surface oil holdup effect'', often results in stepwise recovery curves that obscure true dynamics of spontaneous imbibition. To address these holdup drawbacks of the classic Amott method, we modified the Amott cell and experimental procedure. For the first time, using water-wet Indiana limestone cores saturated with brine and mineral oil, we showed that our improvements of the Amott method enabled accurate and reproducible measurements of oil-recovery dynamics. We used the Generalized Extreme Value (GEV) statistics to describe oil-production histories from water-wet heterogeneous limestone cores with finite initial water saturations, for the first time. We demonstrated that our four-parameter GEV model accurately described the recovery dynamics, and that optimal GEV parameter values systematically reflected the key characteristics of the oil-rock system, such as oil viscosity and rock permeability. These findings gave us a more fundamental understanding of spontaneous, counter-current imbibition mechanisms and insights into what constitutes a predictive model of counter-current water imbibition into oil-saturated rocks with finite initial water saturation.

In this study, a new diphosphate compound, Ag0.2Na0.6FeP2O7, was synthesized using a solid-state reaction method and extensively studied using various techniques. The compound's structure was confirmed through X-ray diffraction analysis, revealing a single-phase monoclinic structure with the P21/C space group. The electrical behavior of the compound was investigated, and its conductivity followed Jonscher's universal law. The correlated barrier hopping (CBH) model explained the temperature-dependent ac conductivity and parameter "s" well. The study also explored the contribution of single-polaron and bipolaron hopping to the a.c. conductivity and discussed the ionic conductivity in relation to the structural characteristics of the sample. Overall, this investigation significantly enhances our comprehension of the distinctive electrical properties of Ag0.2Na0.6FeP2O7 and its potential practical applications.

La integration (at various nominal contents) in SBA-15 prepared under acidic medium was intended from corresponding direct nitrate addition during mesoporous silica formation. Materials were impregnated with Pt (1.5 w%) and studied through several textural (N2 physisorption), structural (XRD, TG-DTG) and surface (FTIR, STEM-HAADF, SEM-EDS, NH3 and CO2 TPD) instrumental techniques. Pt-impregnated solids were tested in phenol hydrodeoxygenation (HDO, T=250 °C, 3.2 MPa, batch reactor, n-decane as solvent). Catalytic activity (in pseudo first order kinetic constant, kHDO basis) was related to Pt dispersion which was, however, not determined by nominal rare earth content. Determining actual composition of modified SBA-15 materials is crucial in reaching sound conclusions regarding their physicochemical properties, especially when La modifier is directly added during mesoporous matrices formation where efficient interaction among constituents could be difficult to get. Otherwise, results from some characterization techniques (N2 physisorption and FTIR, for instance) could be misleading and even contradictory. Indeed, extant modifier precursors when under SBA-15 synthesis conditions could affect the properties of prepared materials even though they were absent in obtained| formulations. Performing a simple compositional analysis could eliminate uncertainties regarding the role of various modifiers on characteristics of final catalysts. However, several groups have failed in doing so.

Among earth’s microbial populations are the genes, functional capacities, generational memory and sentient cognition that enable microorganisms to adapt and thrive in the full range of ecological conditions found on planet earth. In prior sequential publications, we considered fundamental properties (e.g., use of and responses to sound, light, vibrations) and features of microorganisms that cause them to be critical co-partners of human and other holobionts as well as the potential benefits for humanity that can be gained by fully applying quantum-related and novel capacities of microbial life. In this narrative review we: 1) discuss key concepts concerning a microbially-enhanced and sustainable future, and 2) focus on electric- and magnetic- based features of microorganisms that make them pivotal for myriad benefits ranging from beyond pharma-based health and wellness to free- and/or renewable energy and restorative agriculture to improved human networking. While the benefits are many, the risks posed by hazardous electric or magnetic field exposures to both holobionts and microbial communities are significant. This review concludes that microbes and their remarkable capacities offer both humanity and the planet a much brighter future if we reverse the demonization of microbes and wanton microbiome degradation that has predominated much of the past century.

Based on the need for real-time sag monitoring of Overhead Power Lines (OPL) for electricity transmission, this article presents the implementation of a hardware and software system for online monitoring of OPL cables and cable sag determination. The mathematical model based on differential equations and the methods of algorithmic calculation of OPL cable sag are presented. Considering that, based on the mathematical model presented, the calculation of OPL cable sag can be done in different ways depending on the sensors used, and the presented application uses a variety of sensors. Therefore, a direct calculation is made using one of the different methods. Subsequently, the verification relations are highlighted directly and, respectively, the calculation by the alternative method, which uses another group of sensors, to generate both a verification of the calculation and the functionality of the sensors, thus obtaining a defect observer of the sensors. The hardware architecture of the OPL cable online monitoring application is presented, together with the main characteristics of the sensors and communication equipment used. The configurations required to transmit data using the ModBUS and ZigBee protocols are also presented. The main software modules of the OPL cable condition monitoring application are described, which ensure the monitoring of the main parameters of the power line and the visualisation of the results both on the electricity provider's intranet using a web server and MySQL database, and on the Internet using an Internet of Things (IoT) server. This categorisation of the data visualisation mode is done in such a way as to ensure a high level of cyber security. Starting from the mathematical model of the OPL cable sag calculation, it goes through the stages of creating such a monitoring system, from the numerical simulations carried out using Matlab to the real-time implementation of this monitoring application. The main modules of the application software are: the software module for reading quantities from the sensor network through a ModBUS Input/Output (I/O) server, the software module for real-time calculation of the OPL cable sag, the software module for read/write operations based on MySQL type data, the software module for transferring data to the user's intranet through a web server, and the software module for viewing data by authorised users based on user and password through an IoT server. The development software environments used are Matlab and Laboratory Virtual Instrument Engineering Workbench (LabVIEW).

Bistatic radar experiments have been used to study surface characteristics of extra-terrestrial bodies in the Solar System, including the Moon, Venus, Mars, and Titan. This paper proposes a 3D model to characterize the scattered field of a Gaussian rough surface on an extra-terrestrial body for an orbital bistatic radar configuration. Specifically, this model will investigate how the variability of surface roughness impacts the spectral broadening of the received signal using physical optics approximations and ray tracing on a surface model using a facet approach with Gaussian properties. A linear relationship between spectral broadening of the signal and surface roughness was found. This relationship is in line with results obtained by commonly used analytical models for bistatic radar on planetary surfaces.

Skin inflammation associated with chronic diseases has the direct action of keratinocytes in its immunopathogenesis, leading to a series of immune responses. However, there are still no highly targeted treatments, and the development of more specific therapies is highly desirable. In the present work, nanocapsules containing quinizarin (QZ/NC) were developed, evaluating their act in a model of the keratinocytes inflammatory process in vitro with the action of Photodynamic Therapy, analyzing the permeation in a 3D skin model. Physicochemical, stability, cytotoxicity and permeation analyses of the nanomaterials were carried out. The nanocapsules showed desirable physicochemical characteristics and were stable during the analysis period, without spectroscopic modifications. The cell viability test carried out showed no cytotoxicity at the lowest QZ/NC concentrations. The permeation and cellular uptake studies showed the permeation of QZ/NC in 3D skin models and the intracellular incorporation and internalization of the drug, enhancing its action in the drug delivery technique. Promising results were presented using the model developed to induce the inflammatory process in vitro and applying the synthesized nanomaterial in conjunction with PDT, where a decrease in the levels of cytokines analyzed was observed, representing a possible new therapeutic approach for inflammatory skin diseases.

Endometriosis is a prevalent chronic inflammatory disease characterized by a considerable delay between initial symptoms and diagnosis through surgery. The pressing need for a timely, non-invasive diagnostic solution underscores the focus of current research efforts. This study examines the diagnostic potential of the menstrual blood lipidome. The lipid profile of 39 samples (23 women with endometriosis and 16 patient of control group) was acquired using reverse-phase high-performance liquid chromatography-mass spectrometry with LipidMatch processing and identification. Profiles were normalized based on total ion counts. Significant differences in lipids were determined using the Mann-Whitney test. Lipids for the diagnostic model, based on logistic regression, were selected using a combination of variance importance projection filters and Akaike information criteria. Levels of ceramides, sphingomyelins, cardiolipins, triacylglycerols, acyl- and alkenyl-phosphatidylethanolamines, and alkenyl-phosphatidylcholines increased, while acyl- and alkyl-phosphatidylcholines decreased in cases of endometriosis. PE P-16:0/18:1 and CL 16:0_18:0_22:5_22:6 serve as marker lipids in the diagnostic model, exhibiting a sensitivity of 81% and specificity of 85%. The diagnostic approach based on dried spots of menstrual blood holds promise as an alternative to traditional non-invasive methods for endometriosis screening.

Sesame seeds are abundant in sesamin, which exerts health-promoting effects such as extending the lifespan of adult Drosophila and suppression of oxidative stress accumulation by activating the Nrf2 transcription factor. Here, we investigated whether sesamin activated Nrf2 in larval tissues and induced the expression of Nrf2 target genes. In sesamin-fed larvae, Nrf2 was activated in the central nervous system (CNS), gut, and salivary glands. However, ectopic expression of Keap1 (Nrf2 inhibitor) in glial cells inhibited sesamin-induced Nrf2 activation in all tissues except in the neurons, indicating that sesamin activates Nrf2 in glia. We labeled the astrocytes as well as cortex and surface glia with red fluorescence to identify these glial cell types in which Nrf2 was activated; we observed their activation in both cell types. These data suggest that sesamin may stimulate the expression of antioxidative genes in glial cells. Among the 17 candidate Nrf2 targets, the mRNA levels of Cyp6a2 and Cyp6g1 in cytochrome P450 were elevated in the CNS, gut, and salivary glands of sesamin-fed larvae. However, this did not lead to resistance against imidacloprid, which is detoxified by these enzymes. Our results suggest that sesamin may exert similar health-promoting effects on the human CNS and digestive tissues.

Background/Objectives: The aim of this study was to investigate feasibility and safety of neuromuscular electrical stimulation (NMES) in patients on extracorporeal membrane oxygenation (ECMO) and assess thoroughly any potential adverse events. Methods: We conducted a safety and feasibility study including 16 ICU patients on ECMO support who were admitted to the cardiac surgery ICU from January 2022 to December 2023. Patients underwent a 45-minute NMES session, still on ECMO support, that included a warm up phase of 5 minutes, a main phase of 35 minutes and a recovery phase of 5 minutes. NMES was implemented on vastus lateralis, vastus medialis, gastrocnemius and peroneus longus muscle of both lower extremities. Two stimulators delivered biphasic, symmetric impulses of 75 Hz, with 400 μsec pulse duration, 5 sec on (1,6 sec ramp up and 0,8 sec ramp down) and 21 sec off. The intensity levels aimed to cause visible contractions and be well tolerated. Primary outcomes of the study were feasibility and safety, evaluated by whether the NMES sessions were successfully achieved, and by any adverse events and complications. Secondary outcomes included indices of rhabdomyolysis from biochemical blood test, 24 hours after the application of NMES. Results: All patients successfully completed their 45-minute NMES session, without presenting hemodynamic deterioration, adverse events or signs of rhabdomyolysis. The majority of patients achieved type 4 and 5 quality of muscle contraction. Conclusions: NMES is a safe and feasible exercise methodology in patients supported with ECMO.

In this paper, the deformation behavior of S32750 duplex stainless steel during low cycle fatigue was studied by controlling number of cycles. The microstructure of the specimens under different cycles was characterized by optical microscope (OM), scanning electron microscope (SEM), electron backscatter diffraction (EBSD) and transmission electron microscope (TEM). Microhardness of two phases was measured by a digital microhardness instrument. The results showed that the microhardness of ferrite increases significantly after the first 4000 cycles, while the austenite shows a higher strain hardening rate after fatigue fracture, and the microhardness of ferrite and austenite increases by 23 HV and 87 HV, respectively. Two-phase kernel average misorientation (KAM) diagram showed that the continuous accumulation of plastic deformation easily leads to the initiation of cracks inside the austenite and at the phase boundaries. The evolution of dislocation morphology in two phases was obviously different. With the increase of cycle number, the dislocation in ferrite gradually transforms from dislocation bundles and dislocation array to sub-grain structure, while the dislocation in austenite gradually develops from dipole array to ordered Taylor lattice network structure.

In Ethiopia, farmers have changed cropland to Eucalyptus globulus plantations for construction, fuelwood and economic benefits. However, it has adverse effects on soil properties. The investigation was, therefore, to evaluate the impact of Eucalyptus globulus plantations on soil properties in northwestern Ethiopia. About 30 soil samples were collected from two soil depths (0-20 and 20-40 cm) and three land uses (Eucalyptus globulus plantations, cropland and grazing land) with five replications. Soil properties were analyzed using a two-way analysis of variance (ANOVA). Based on the result, soil properties such as silt particles, moisture content (MC), organic matter (OM), total nitrogen (TN) and cation exchange capacity (CEC) were significantly higher under the soil of Eucalyptus globulus plantations than in cropland and grazing land. Whereas the lower contents of bulk density (BD), soil pH, available phosphorus (AP), electrical conductivity (EC) and exchangeable bases (Ca, Mg, K, and Na) were recorded in Eucalyptus globulus plantations. Besides, clay, BD, MC, pH, EC, CEC, percent base saturation (PBS) and basic cations increased with soil depth while decreasing sand, silt, TP, OM and AP. The basic cations ( Ca, Mg, K), PBS and AP decreased in the soil of the 25-year old Eucalyptus globulus plantation compared to cropland by 38%, 36%, 43 %, 45% and 47% and grazing land by 56%, 60%, 76 %, 60% and 56%, respectively. Therefore, appropriate and effective land use management principles should be implemented in the study area.

Dark energy and dark matter are described as different manifestations of vacuum energy in a new cyclic universe framework of Extra Dimensional Symmetry (EDS) that doubles large spatial dimensions with microscopic partners. In this testable framework, vacuum energy, constrained by a Planck density constraint, exists in a gravitationally dark state where actual gravitational constant G_o = 0G. While a small repulsive component is constrained by an asymptotically evolving asymmetry to the active state where G_o = 2G, some components in the inert state are enabled to gravitationally attract by neutrino induced gravitational constant with light and shear activated heavy components. Observational and experimental tests are briefly discussed.

The insufficient of fish meal has been become a prominent problem with the development of the aquaculture industry. Therefore, it is great significance that replacement fish meal using other protein sources for the sustainable development of aquaculture industry. In this study, fermented cottonseed meal (FCM) and fermented rapeseed meal (FRM) were used to replace fish meal in Chinese mitten crab. The ratio of FCM and FRM were set according to 1:2, 1:1, and 2:1, and were supplemented into 25% fish meal (FM-25) and 15% fish meal (FM-15) diets, respectively, to formulated 6 kinds of experimental diets. The feeding duration was 8 weeks. The results showed that the weight gain (WG) and specific growth rate (SGR) of crabs fed the diets containing 25% fish meal were significantly higher than crabs fed 15% fish meal diets. At 25% fish meal level, the WG and SGR of crabs fed the diet with 1FCM:1FRM were significantly higher than those fed the 1FCM:2FRM and 2FCM:1FRM diets. At 25% fish meal level, the crude lipid (CL) content of crabs fed the diet with 1FCM:2FRM were significantly higher than those fed the 2FCM:1FRM and 1FCM:1FRM. At 25% fish meal level, the activities of glutathione peroxidase (GPX) and peroxidase (POD) of crabs fed the diet with 1FCM:2FRM were significantly higher than those fed the 2FCM:1FRM and 1FCM:1FRM. At 25% fish meal level, the relative expression of peroxiredoxin (PRX) of crabs fed the diet with 1FCM:1FRM were significantly higher than those fed the 2FCM:1FRM and 1FCM:2FRM. In summary, diets supplemented with a mixture of fermented cotton meal and fermented rapeseed meal (1:1) can significantly improve the growth and antioxidant capacity of Chinese mitten crab.

To identify factors associated with interstitial lung disease (ILD) in patients with systemic sclerosis (SSc) and build an algorithm to better define this association, for a personalized application in clinical practice. Methods. 78 SSc patients underwent HRCT to assess ILD. Demographic, clinical and laboratory variables were collected, focusing on those associated either directly or indirectly with lung involvement. The discriminant value of each variable was determined using the operating characteristic curves (ROC) and included in a model to estimate the strength of ILD association in SSc. Results. Thirty-three (42.31%) patients showed ILD on HRCT. DLco, M-Borg, GERD-Q, and capillary density were significantly associated with the presence of ILD-SSc. A model including these variables had a coefficient of determination (R2) of 0.697. DLco had an AUC of 0.861 (p&lt;0.001) with a cut-off ≤72.3% (sensitivity 78.8%, specificity 91.1%, +LR 8.86). The m-Borg scale showed an AUC of 0.883 (p&lt;0.001) with a cut-off &gt;2 (sensitivity 84.8%, specificity 82.2%, +LR 4.77), GERD-Q had an AUC of 0.815 (p&lt;0.001) with a cut-off &gt;7 (sensitivity 72.7%, specificity 86.7%, +LR 5.45). The capillary density showed an AUC of 0.815 (p&lt;0.001) with a cut-off ≤4.78 (sensitivity 87.9%, specificity 68.9%, +LR 2.82). Based on the pre-test probability values, these four variables were applied to Fagan's nomogram to calculate the post-test probability of this association. Conclusions. Our study identified four associated clinical factors of ILD in SSc patients. Moreover, their inclusion in an algorithm for the post-test probability, tailored to the specific patients’ characteristics, significantly increases the ability to find out the presence of SSc-ILD.

The study of coherent vortices remains an urgent field of singular optics of vortex beams. In this paper, coherent properties of partially coherent vortex Bessel—Gaussian optical beams propagating through a uniform medium (free space) or a turbulent atmosphere are examined theoretically. The consideration is based on analytical solution of the equation for the transverse second-order mutual coherence function of the field of a partially coherent optical radiation in a turbulent atmosphere. For the partially coherent Bessel—Gaussian beam, the second-order mutual coherence function of the source field is taken as a Gaussian Shell-model. In this approximation, we analyze the behavior of the coherence degree and the integral coherence scale of these beams as a function of the propagation pathlength, propagation conditions, and beam parameters, such as the radius of the Gauss factor of the beam, parameter of the Bessel factor of the beam, topological charge, and correlation width of the source field of partially coherent radiation. In addition, the integral coherence scale of the partially coherent vortex Bessel—Gaussian beam is compared with that of the partially coherent Gaussian beam. It is found that as a partially coherent vortex Bessel—Gaussian beam propagates through a turbulent atmosphere, there appear not two (as might be expected: one due to atmospheric turbulence and another due to partial coherence of the source field), but only one ring dislocation of the coherence degree (due to the simultaneous effect of both these factors on the optical radiation). In addition, it is shown that the dislocation of the coherence degree that affects significantly the beam coherence level is formed only for beams, for which the coherence width of the source field is larger than the diameter of the first Fresnel zone.

This study, serving as Part-2 of the research titled "Comparative Analysis of Length Deformation in Classical and Relativistic Mechanics," investigates the behaviour of matter within gravitationally bound systems. Through meticulous examination of projected length alterations, the research highlights differences between classical and relativistic mechanics frameworks, emphasizing the necessity of considering relativistic effects beyond velocity alone. Additionally, the study underscores the crucial role of gravitational effects on the effective mass of moving objects, which emerges as a critical factor in predicting length deformation across scientific disciplines. The incomplete treatment of relativistic effects within Relativistic Mechanics, including acceleration and material stiffness, emphasizes the importance of comprehensively understanding gravitational influences on effective mass. This is evident in gravitational equations, where the gravitational force depends not only on the object's mass but also on its effective mass, influenced by kinetic energy. Thus, incorporating the gravitational effect on effective mass enhances the understanding of length deformation phenomena within gravitationally bound systems, enriching scientific discourse.

The rise in population density, vehicle ownership, and urban development has significantly influenced travel demand and altered travel patterns, leading to traffic congestion in rapidly growing urban centers like Accra, Ghana. The traditional approach of expanding roadways to accommodate rising traffic is no longer environmentally sustainable. Instead, emphasis has shifted towards travel demand management (TDM) strategies as a more sustainable solution. This study aimed to investigate a range of TDM strategies that can be adopted in Accra to improve traffic flow through the lenses of everyday road users. The study employed a questionnaire survey and a stratified sampling technique to gather data from 615 respondents for relative importance index (RII) ranking, and Chi-square statistical analysis. The findings reveal that the topmost preferred strategies were mass transit improvements, walking and cycling improvements, and alternative work schedules. Notably, mass transit improvements emerged as the most preferred strategy. The study also unveiled a statistically significant correlation between variables such as age, education level, marital status, income level, and mode of transportation with all selected TDM preferences. However, no significant relationship was found between gender and car ownership with all selected TDM preferences. The study provides valuable insights regarding road users’ preferences for TDM strategies that can aid in planning future urban mobility systems to proactively manage travel demand, alleviate congestion, and promote sustainable transportation options for the city’s residents.

In southern South America, zonal flora, defined by macroclimatic conditions, is strongly influenced by an aridity filter near 29°S. Cushion bogs, high-altitude wetlands along the Andes, display homogeneous flora with cushion species dominance, contrasting with zonal vegetation. Despite being influenced by microclimatic conditions, these ecosystems experience varied environmental effects. This study identifies environmental filters affecting bog communities along a broad-scale latitudinal gradient from 15°S to 42°S. We analyzed 420 bogs and 284 species across three macroclimatic regions with distinct summer, winter, and transitional arid rainfall regimes. Using variance partitioning and membership-based regionalization models, we examined the impacts of climatic, edaphic, and spatial variables on beta diversity. We also assessed species' niche overlap and the influence of environmental filters on the communities' phylogenetic diversity. Results show that species turnover and niche overlap vary with macroclimatic differences, delineating three distinct regions. Notably, phylogenetic clustering in the driest part of the gradient (23°S —24°S) highlights the impact of the environmental filter. Aridity and temperature variations at a broad scale serve as environmental filters shaping the composition of bog communities across southern South America.

Reduced-order electrothermal models play a key role in the design and control of lithium- ion cell stacks, calling for accurate model parameter calibration. This paper presents a complete electrical and thermal experimental characterization procedure for coupled modeling of cylindrical lithium-ion cells in order to implement them in a prototype Formula SAE hybrid racing car. The main 4goal of the tests is to determine cell capacity variations with temperatures and discharge currents, to predict the open circuit voltage of the cell and its entropic component. A simple approach for the characterization of the battery equivalent electrical circuit and a two-steps thermal characterization method are also shown. The investigations are carried out on four commercial 18650 NMC lithium cells. The model demonstrated to predict the battery voltage at a RMS error lower than 20mV and the temperature to a RMS error equal to 0.5 ◦C. The authors hope that this manuscript can contribute to the development of standardized characterization techniques for such cells, while offering experimental data and validated models that can be used by researchers and BMS designers in different applications.

Boutique hotels emerged in the late 1970s since then the product has become more mainstream. The draw of boutique hotels is more personalized services. When marketing and providing services to a niche market it is smart to be able to differentiate potential guests to best meet their needs. The generational cohort theory states that a population may be divided into segments based on their generation. This research focuses on Generation X to find out what they are seeking in a boutique hotel product. Based upon how they chose their travel destination there were significant differences between culinary experience, attractions/activities, and cost/budget.

During the last decade, Bangladesh has been experienced a significant climatic anomalies which lead to an increase in magnitude and frequency of various climate relate extreme events. Climate scientists substantiate that global temperature and precipitation pattern is expected to change, which may result in consequential impact on agriculture, livelihood, and ecosystem. Bangladesh is therefore likely to face substantial challenges in the coming decades. In order to adequately understand this complex, dynamic phenomena, Analyzing historical Climate change scenarios as well as projecting its future trends is a great concern for researcher. This study aims to analyzes/ historical climatic data from (1901-2020), and predict future temperature and precipitation patterns in Bangladesh using CMIP6 data. Data used in this study (Observed data is from CRU TS 4.05 and future data is from CMIP6) have been acquired from WorldClim v2.1. Various methods including correlation, regression, standard deviation, correlation matrix, percentiles, cell statistics, and IDW interpolation were performed to analyze the trends, variability and spatial patterns of temperature and rainfall. This study revealed that Over the historical study period (1901-2020) Bangladesh has been experienced a significant warming trend with an average increase in temperature 2°C and with annual decline of the total precipitation 607.26 mm along with a shift towards drier conditions despite weak correlation with hotter years. Projected climate models represents that Bangladesh minimum temperature is expected to increase from 1°C to 4.4°C as well as maximum temperatures from 1°C to 4.1°C by 2100. Moreover, projected precipitation is expected to increase by 480.38 mm, with the biggest rises during monsoon months. Regional variations in temperature and precipitation are again expected, with the Southeast (SE) likely experiencing the most significant warming and the Northeast (NE) seeing the most substantial increase in precipitation.

The overall contribution of otolith receptors to eye movements, postural control and perceptual functions is the basis for clinical testing of otolith function. With such wide range of contributions, it is important to recognize that the functional outcomes of these tests may vary depending on the specific method employed to stimulate the hair cells. In this article, we review common methods used for clinical evaluation of otolith function and how different aspects of physiology may affect the functional measurements in these tests. We compare the properties and performance of various clinical tests with the emphasis on the newly-developed video ocular counter roll (vOCR), measurement of ocular torsion on fundus photography, and subjective visual vertical or horizontal (SVV/SVH) testing.

Ovarian cancer (OC) represents a significant challenge in the realm of gynecological cancers, characterized by poor survival rates and complex etiology. In this review, we delve into the se-lected genetic, environmental, and hormonal factors underpinning OC development. We have reviewed scientific databases searching for ovarian cancer genetic and epigenetic factors. We have included studies based on their relevancy. As a result of exploring ovarian carcinogen-esis, this systematic review contains data collected from 126 various works. The role of prominent genetic players such as BRCA mutations, DNA repair mechanisms, un-derscores the intricate landscape of OC susceptibility. We explore Li-Fraumeni and Lynch syn-drome, which impart a heightened predisposition to OC development. Hormonal factors such as estrogen, progesterone, and androgens are also discussed. Environmental alterations, ranging from lifestyle influences on OC to microbiome dysbiosis and lifestyle factors such as obesity, al-cohol consumption, and physical activity intersect with genetic and epigenetic pathways, shaping the risk landscape for OC. Through a meticulous examination of current literature, this review provides a nuanced under-standing of the multifactorial nature of OC, emphasizing the need for holistic approaches to prevention, diagnosis, and treatment.

Many farms are replacing the lighting with light emitting diode (LED) bulbs because of the technological modernization. We aimed to investigate the effects of incandescent light (IL) and LED lighting on Cobb500 broiler chickens for six weeks. Production parameters (body weight, feed consumption, feed conversion ratio), calculated slaughter values (yield%, relative breast%, thigh%) and breast meat quality parameters (pH at 45 min and 24 h postmortem, color, drip loss, kitchen equipment losses, shear force, meat composition) were recorded. Non-stop recordings were used to analyze the behavior of the birds in several periods of the rearing. LED group was significantly better in body weigh parameter between week 1-5 and feed conversion ratio between week 2-3. The most significant difference in behavior was observed in the middle of the rearing period. The chickens in the LED group spent more eating time, drinking time, interacting, and resting less. There was no difference in the meat quality parameters, only shear force was significantly lower in the LED group (1781.95±0.33 g/s vs. 2098.82±0.42 g/s). Based on our results, LED lighting can bring positive changes in animal production efficiency, behavior, and important characteristics for meat consumers.

In a business environment that is constantly changing, intellectual capital stands out as the most valuable asset for companies. Those who invest in developing their employees, especially their Chief Financial Officers (CFOs), tend to outperform their competitors. This study explores the relationship between the intellectual Capital of CFOs and the financial performance of companies listed on B3. The 100 companies with the largest capitalization listed on B3 in 2022 were analyzed, with available data on the CFO. A statistical model was applied in a cross-section analysis, considering two of the three subdivisions of Intellectual Capital: Human Capital ( experience, education, and certifications) and Relational/Social Capital ( network and reputation of the CFO). The results indicated a statistically significant relationship between CFOs' Human Capital level and the performance of the companies they manage, measured by EPS, ROA, and ROE. However, no statistical significance was found for Relational/Social Capital. This study contributes to the literature on intellectual capital and corporate finance in the Brazilian context, providing new evidence on the importance of CFOs' intellectual capital for company performance. It was observed that there are few equivalent studies in Brazil on the topic, especially about the Intellectual Capital of CFOs of companies listed on the stock exchange (BOVESPA).

The calculation of the global shear capacity of steel-concrete composite downstand cellular beams with precast hollow-core units is important as it affects the span to depth ratios and the amount of material used, hence affects the embodied CO2 calculation when designers are deciding on the floor grids. This paper presents a reliable tool that can be used by designers to alter and optimise grip options during the preliminary design stages, without the need to run onerous calculations. The global shear capacity prediction formula is developed using five machine learning models. First, a finite element model database is developed. The influence of the opening diameter, web opening spacing, tee-section height, concrete topping thickness, the interaction degree, and the number of shear studs above the web opening are investigated. Reliability analysis is conducted to assess the design method and propose new partial safety factors. The Catboost Regressor algorithm presented better accuracy compared to the other algorithms. An equation to predict the shear capacity of composite cellular beams with hollow-core units is proposed by Gene Expression Programming. In general, the partial safety factor for resistance, according to the reliability analysis, varied between 1.25 and 1.26.

To address the requirements of sonar imaging, such as high receiving sensitivity, wide bandwidth, wide receiving angle, an AlN PMUT with an optimized ratio of 0.6 for the piezoelectric layer diameter to backside cavity diameter is proposed in this paper. A sample AlN PMUT is designed and fabricated with SOI substrate-based bulk MEMS process. The characterization test result of the sample demonstrates a -6 dB bandwidth of approximately 500 kHz and a measured receiving sensitivity per unit area of at 1.37 V/μPa/mm2, which significantly surpasses the performance of previously reported PMUTs. The -6 dB horizontal angles of the AlN PMUT at 300 kHz and 500 kHz are measured 68.30° and 54.24°, respectively. To achieve an accurate prediction of its characteristics when being packaged and assembled in a receive array, numerical simulations with the consideration of film stress are conducted. The numerical result shows a maximum deviation of ±7% in the underwater receiving sensitivity across the frequency range of 200 kHz to 1000 kHz and a deviation of about 0.33% in the peak of underwater receiving sensitivity comparing to the experimental data. By such good agreement, the simulation method reveals its capability of providing theoretical foundation for enhancing the uniformity of the AlN PMUTs in future studies.

The study examines projected changes in dry- and wet-spell probabilities in West Africa using a Markov chain approach. Four simulations of regional climate models from the CORDEX-Africa program were used to analyze projected changes in intraseasonal variability. The results show an increase in the probability of having a dry day, a dry day preceding a wet day and a dry day preceding a dry day, and a decrease in the probability of wet days in the Sahel region under anthropogenic forcing scenarios RCP4.5 and RCP8.5. The decrease in wet days is stronger in the far future and under the RCP8.5 scenario (up to -30%). The study also finds that the probability of consecutive dry days (lasting at least 7 days and 10 days) is expected to increase in the Western Sahel, the Central Sahel, and the Sudanian Area under both scenarios, with stronger increases in the RCP8.5 scenario. In contrast, the decrease is expected over the Guinea Coast, with the changes more important under the RCP4.5. These changes in dry- and wet-spell probabilities are important for water management decisions and risk reduction in the energy and agricultural sectors. The study also highlights the need for decision-makers to implement mitigation and adaptation policies to minimize the adverse effects of climate change.

Abstract This study delved into the application of various machine learning (ML) models for the classification of lung cancer levels. Through meticulous monitoring of parameters such as minimum child weight and learning rate, efforts were made to mitigate overfitting while optimizing model performance. The Deep Neural Network (DNN) emerged as a standout performer, showcasing robust performance across training, validation, and testing stages. Ensemble methods like voting and bagging also demonstrated promising results. However, Support Vector Machine (SVM) models with the Sigmoid kernel faced challenges in achieving satisfactory performance. Overall, the investigation sheds light on the efficacy of different ML models in lung cancer level classification and underscores the importance of parameter tuning to address overfitting concerns.

Transcatheter Aortic Valve Implantation (TAVI) now represents the mainstay in the treatment of severe aortic stenosis. Owing to its exceptional procedural efficacy and safety, TAVI has been extended to include patients at lower surgical risk, thus now encompassing a diverse patient population receiving this treatment. Yet, long-term outcomes also depend on optimal medical therapy for secondary vascular prevention, with antithrombotic therapy serving as a cornerstone. Leveraging data from multiple randomized controlled trials, current guidelines generally recommend single antithrombotic therapy, with either single antiplatelet therapy (SAPT) or oral anticoagulation (OAC) alone in those patients without, or with atrial fibrillation respectively. Yet, individualization of this pattern, as well as specific case uses, may be needed based on individual-patient characteristics and concurrent procedures. This review aims to discuss the evidence supporting antithrombotic treatments in patients treated with TAVI, indications for a standardized treatment, as well as specific considerations for an individualized approach to treatment.

The design of an antimicrobial coating materials becomes ideal in order to prevent infections caused by the transmision of pathogens coming from human’s contact with contaminated surfaces. In that aim layered single hydroxides (LSH) and layered double hydroxides (LDH) containing Zn and Cu, in nitrate form and intercalated with antimicrobial molecules, were synthe-sized and characterized. Cinnamate and salicylate anions were chosen to be intercalated in the fillers because of their well known antimicrobial activity. Several coatings based on polyvinyl alcohol (PVA) and LDH or LSH with increasing amounts of filler were prepared and filmed on a polyethylene terephthalate (PET) substrate. Coatings were characterized and their antimi-crobial activity was evaluated against pathogens critical in nosocomial infections, giving interesting results.

Effective waste elimination is critical for the success of construction projects. Although several studies have focused on various aspects of construction waste, limited efforts have investigated the dynamic effect of Making-Do (MD) practices on productivity, rework, defects, and materials wastage. From a lean construction perspective, this study aims to address MD waste using the Last Planner System (LPS) and BIM. First, the casual structure that can cause MD in construction projects was expressed in a casual loop diagram (CLD), and thematic analysis uncovered the strategies of LPS-BIM to eliminate MD identified by reviewing the literature. Secondly, twenty-five strategies from the LPS and BIM strategies to address MD using Structural Equation Modeling (SEM) were assessed. Subsequently, a system dynamics model (SDM) for investigating LPS-BIM strategies on MD decisions in a construction project was formulated based on the underlying causal loop diagrams and the mathematical relations among the variables. Finally, the model was applied to three projects, and simulations for four LPS-BIM scenarios were carried out. The findings show that dynamic interactions among diverse production planning and control factors are critical in evaluating MD impacts on a construction project. The results demonstrate that the LPS-BIM approach resulted in an average 43.8% reduction in the tasks performed with MD, 45.3% of constraints, 66.5% of construction waste, increasing 13.7% completion rate, and 29.3% cost reduction, demonstrating that LPS-BIM as a more efficient solution for MD mitigation and construction planning.

Abstract Incretin mimetics, also known as glucagon-like peptide-1 (GLP-1) receptor agonists, are a class of medications used to treat type 2 diabetes by mimicking the actions of incretin hormones in the body. These hormones are responsible for promoting insulin release from the pancreas in response to nutrient intake, as well as decreasing glucagon secretion, slowing gastric emptying, and promoting satiety. By imitating these actions, incretin mimetics help to regulate blood sugar levels in individuals with diabetes and glucose intolerance. One of the key benefits of incretin mimetics is its ability to lower blood sugar levels without causing hypoglycemia. This is especially important for individuals with diabetes who may experience dangerous drops in blood sugar levels when using other medications. Additionally, incretin mimetics have been shown to promote weight loss in some individuals, making them a valuable option for those struggling with obesity in addition to diabetes. Incretin mimetics are administered by injection, once or twice daily, depending on the specific medication. They are often combined with other diabetes medications, such as metformin or insulin, for optimal blood sugar control. These medications are generally well-tolerated, with common side effects including nausea, vomiting, and diarrhea, which usually diminish over time as the body adjusts to the medication. Studies have shown that incretin mimetics can help improve cardiovascular outcomes in individuals with diabetes, including reducing the risk of heart attacks and strokes. This is particularly significant given the increased risk of cardiovascular disease in individuals with diabetes. Incretin mimetics also have been shown to preserve pancreatic beta-cell function, which is responsible for producing insulin. This can help slow the progression of diabetes and reduce the need for higher insulin doses over time. Despite their many benefits, incretin mimetics are not without limitations. They can be expensive compared to other diabetes medications, which may make them less accessible for some individuals. Additionally, there have been concerns about the potential risk of pancreatitis and pancreatic cancer associated with the use of these medications. However, more research is needed to fully understand these risks. It is important for healthcare providers to carefully assess each individual's unique needs and medical history when considering the use of incretin mimetics. They may not be appropriate for everyone, particularly those with a history of pancreatitis or pancreatic cancer. Patients should also be educated about these medications' proper administration and potential side effects to ensure their safety and efficacy. Overall, incretin mimetics have emerged as an important therapeutic option for individuals with type 2 diabetes, offering a unique mechanism of action that can help improve blood sugar control, promote weight loss, and reduce cardiovascular risk. With ongoing research and development in this field, incretin mimetics continue to show promise as valuable tools in managing diabetes and its associated complications and comorbidities.

Background: Youth experiencing homelessness (YEH) in East Asia Pacific (EAP) represent one of the most at-risk populations due to cultural and geographical factors. Effective mental health interventions, primarily researched in Western contexts, may not fully apply to YEH in EAP. Their lack of stable shelter, disrupted social networks, and limited access to mental health services elevate their susceptibility to adverse mental health, making urgent interventions essential to address their needs. Objective: To explore and provide systematic evidence on the types of mental health services and interventions for YEH in EAP and their impact on overall quality of life and wellbeing. Methods: Electronic databases(e.g., Medline, PsychInfo, PubMed, Scopus) were systematically searched(publication dates between 01/01/1990-13/05/2023), as well as additional online resources specific to homelessness. Articles were screened, and a critical appraisal assessed the quality of the included studies. Results: Eight studies with different interventions were identified in Indonesia(n = 2), Malaysia(n = 1), South Korea(n = 3), and The Philippines(n = 1). These were thematically clustered into six categories: art, cognitive behavioural therapy, life skills education, resilience enhancement, family strengthening and government interventions/services. Conclusion: This review highlights effective mental health interventions’ positive impact on YEH mental health outcomes and quality of life in EAP, stressing the urgent need to implement socio-culturally sensitive services. Future research should address knowledge gaps through comprehensive studies covering diverse EAP regions and populations, prioritising socio-culturally specific psychological measures.

Phosphodiesterase type 5 (PDE5) inhibitors are widely used in the treatment of various conditions, including erectile dysfunction and pulmonary hypertension. Despite their clinical efficacy, these drugs quite often cause visual disturbances due to off-target effects on Phosphodiesterase type 5 (PDE6) in the retina. This review explores the application of a general intermolecular binding affinity calculator (GIBAC)-based binding selectivity strategy in the design of PDE5 inhibitors, aiming to enhance binding selectivity and minimize visual side effects. This GIBAC strategy integrates computational structural biological approaches to iteratively refine drug-target binding affinities, thereby improving target specificity and the structural biophysical limit for the efficacy-safety balance of PDE5 inhibitors. Through detailed analysis of PDE5’s and PDE6’s biological role and the molecular mechanisms underlying visual disturbances, this article underscores the necessity of target binding selectivity in PDE5 inhibitor design in future. Additionally, this article discusses the practical applications of GIBAC in computational drug discovery and design, along with the future directions and the potential for GIBAC to transform PDE5 inhibitor development, ultimately enhancing therapeutic outcomes and patient safety. Finally, this article calls for a GIBAC-based paradigm shift in computational drug discovery and design towards the continued development of the pharmaceutical industry.

ct (Do not insert blank lines, i.e. \\) \abstract{We propose an $E_8 \otimes E_8$ unification of the standard model with pre-gravitation, on an exceptional Lie algebra-valued space . Each of the $E_8$ has in its branching an $SU(3)$ for space-time and an $SU(3)$ for three fermion generations. The first $E_8$ further branches to the standard model $SU(3)_c \otimes SU(2)_L \otimes U(1)_Y$ and describes the gauge bosons, Higgs and the left chiral fermions of the standard model. The second $E_8$ further branches into a right-handed counterpart (pre-gravitation) $SU(3)_{grav}\otimes SU(2)_R \otimes U(1)_g$ of the standard model, and describes right chiral fermions, a Higgs, and twelve gauge bosons associated with pre-gravitation, from which general relativity is emergent. We account for 208 out of the 496 degrees of freedom of $E_8 \otimes E_8$ and propose an interpretation for the remaining 288, motivated by the trace dynamics Lagrangian of our theory. We explain how the two copies of $SU(3)_{spacetime}$ together give rise to a 6D spacetime with signature $(3,3)$ which upon symmetry breaking gives rise to our 4D spacetime and to a second 4D anti-spacetime with flipped signature.

Businesses now formally enter the phase of "think power differentiation and gap" in response to the new economic climate. While AI, big data, empowerment via the internet, and other aspects of the digital economy help to improve technical capabilities and save operating costs, they also push businesses to innovate their strategies at a faster rate. Enterprises are strategically choosing to de-enterprise, moving from focusing on a single business functioning benefit to building an ecosystem of platform services that will give them a competitive edge. Additionally, the organization's structure is evolving continually from a vertical model to a curved working style, in order to achieve this, businesses must recognize the importance of data analysis in day-to-day management and operations, encourage the development of an organizational atmosphere that is driven by data, fully utilize digital technology, modularize areas or production links that perform related tasks, and encourage the reform of organizational structures. By streamlining the output of the product or service to the external community while also enhancing the company's financial performance model, switching from process-to result-oriented evaluation, and putting in place a customized authority and accountability framework. Replace outcome-focused evaluation with process-focused evaluation, and create a customized incentive scheme that balances power, accountability, and rewards.

This research delves into librarians' perceptions of artificial intelligence (AI) support in learning experiences, lifelong learning, and digital literacy within the library context, undertaking a comparative analysis between Malaysia and Indonesia. Employing a survey methodology, a self-developed questionnaire was administered to 59 librarians in Malaysia and 85 in Indonesia. The questionnaire, utilizing a Likert scale, systematically explored subjective judgments on AI's impact across various dimensions. A noteworthy finding is the consistent and harmonized perception among librarians in both countries, underscoring a universal recognition of AI's perceived support for learning experiences, lifelong learning, and digital literacy. Of particular interest is the emphasis on sustainability in librarians' perspectives, as they recognize the enduring value of AI in fostering educational growth. Despite the limitations inherent in perceptual measures and a relatively modest sample size, the empirical and practical contributions of this study are significant. It offers a nuanced exploration of librarians' viewpoints, providing valuable insights for future research endeavors. Moreover, the study's findings have immediate practical implications for the integration of AI tools in library services, policy-making, and professional development, with a focus on ensuring sustainable implementation for long-term benefits.

Cerebral ischemic stroke poses a significant global cause of death, with ischemia-reperfusion injury contributing to neuronal cell death and tissue damage. However, significant therapeutic approaches with meaningful treatment effects for patients with ischemic stroke in actual clinical practice are lacking. This study investigated the potential neuroprotective effects of sildenafil, a phosphodiesterase-5 inhibitor, in a global cerebral ischemia model. We explored the impact of sildenafil on GFAP and AQP-4 expression, which are markers associated with astrocyte activation and water homeostasis, respectively. The immunofluorescence analysis revealed that the number of cells co-expressing the markers, which increased in the ischemia-induced group, was significantly reduced in sildenafil-treated groups, suggesting a potential mitigating effect on ischemia-induced astrocyte activation. Additionally, we conducted diverse behavioral tests, including the open-field test, novel object recognition, Barnes maze, Y-maze, and passive avoidance tests, to assess the effect of sildenafil on the cognitive function impaired by ischemia. Cognitive improvements were observed following sildenafil administration (20mg/kg) compared to the untreated group. Taken together, the results presented here suggest sildenafil's potential as a neuroprotective agent for alleviating delayed neuronal cell death and cognitive function impaired by ischemia.

This qualitative study investigates consumer perceptions of price inflation within renewable energy markets. Renewable energy markets have seen significant growth due to global sustainability efforts, yet understanding consumer responses to price inflation remains limited. Through semi-structured interviews and thematic analysis, this research explores consumer awareness, factors influencing perceptions, attitudes towards price fluctuations, and strategies for enhancing acceptance. Findings reveal varied levels of awareness among consumers, with economic, environmental, social, and cultural factors shaping their perceptions. While some view price fluctuations as natural market dynamics, others express concerns about affordability and equity. Strategies to address negative perceptions include enhancing transparency, implementing progressive pricing schemes, and promoting community engagement. Ultimately, this study contributes to a deeper understanding of consumer attitudes towards renewable energy pricing mechanisms, providing insights for policymakers and industry stakeholders to foster greater acceptance and support for renewable energy adoption.

As modern technologies, particularly home assistant devices, become more integrated into our daily lives, they are also making their way into the domain of energy management within our homes. Homeowners, now acting as prosumers, have access to detailed information in 15-minute or even 5-minute intervals, including weather forecasts, outputs from Renewable Energy Sources (RES)-based systems, appliance schedules and the current energy balance, which details any deficits or surpluses along with their quantities and the predicted prices on the Local Energy Market (LEM). The goal for these prosumers is to reduce costs while ensuring their home’s comfort levels are maintained. However, given the complexity and the rapid decision-making required in managing this information, the need for a supportive system is evident. This is particularly true given the routine nature of these decisions, highlighting the potential for a system that provides personalized recommendations to optimize energy consumption, whether that involves adjusting the load or engaging in transactions with the LEM. In this context, we propose a recommendation system powered by Large Language Models (LLM), Scikit-llm and Zero-Shot Classifiers, designed to evaluate specific scenarios and offer tailored advice for prosumers based on the available data at any given moment. Two scenarios for a prosumer of 5.9 kW are assessed using candidate labels, such as Decrease, Increase, Sell and Buy.

A flat-plate unglazed solar water heater (SWH) with polymer thermal absorber was developed and tested. Polymer thermal absorber as a viable alternative to metal thermal absorber that is found in most SWH systems. The performance of this polymer SWH system is measured based on inlet and outlet water temperature, water flowrate, ambient air temperature and solar irradiance. The polymer thermal absorbers are hollow Polyvinyl Chloride (PVC) pipes with 20mm external diameter and 3 mm thick, painted in black to enhance radiation absorption. The pipes are arranged in a rectangular spiral inward-outward opposing-flow (RSioof). The collector pipes are placed in a 1 m2 square enclosure with bottom insulation and reflective surface for better radiation capture. Water circulation is a closed loop with a 16-liter uninsulated storage tank, driven by a pump and controlled by valves to maintain a mass flow rate of 0.00031 to 0.00034 kg/s. The test was conducted under partially clouded sky from 9 am to 5 pm, with solar irradiance between 105 and 1003 W/m2 and 27-36oC ambient air temperature. The SHW produced outlet hot water at 65oC by mid-day and maintained the storage temperature at 63oC until the end of test duration. Photo-thermal energy conversion was recorded with 23% maximum value. Results indicate that a flat plate solar water heater with polymer thermal absorber in RSioof design can be an effective alternative to the metal thermal absorber solar water heater and can be further optimized with glazing and tube sizing.

Introduction: Emotional intelligence plays a critical role in nursing leadership, influencing organizational dynamics and patient care. However, there is limited understanding of the impact of Emotional Intelligence on leadership in Primary Health Care in the Greek context. Methods: A longitudinal experimental design assessed the effects of an educational intervention on EI and leadership among Greek Primary Health Care nurses. Questionnaires, including the Wong and Law Emotional Intelligence Scale (WLEIS) and Multifactor Leadership Questionnaire - form 5x (MLQ), were administered pre- and post-intervention. Results: The intervention group exhibited significant improvements in Emotional Intelligence and adoption of transformational leadership styles compared to the control group. Tables highlighted nuanced changes in leadership dynamics post-intervention. Conclusions: Educational interventions effectively enhance nurses' Emotional Intelligence and influence leadership styles, emphasizing the need for tailored professional development programs in nursing education.

Splenic rupture and hematoma are significant complications that can arise in patients with non-Hodgkin lymphoma (NHL). Understanding these associations is essential for optimal patient management and patients' enhancing outcomes. Histopathological and immunohistochemistry analyses are crucial in diagnosing NHL and assessing splenic involvement. A judicial autopsy was requested by the Prosecutor's Office for a malpractice claim due to a fall in the hospital. In the Emergency Department, a 72-year-old man fell from the gurney, reporting a wound to his forehead. No other symptoms were reported. A face and brain CT scan showed no abnormalities. Nine days after discharge, the patient presented with abdominal pain. Abdominal CT revealed splenic rupture and hemoperitoneum. The patient underwent open splenectomy, but the patient showed signs of hemodynamic shock and subsequently died. The evidence emerging from the autopsy allowed us to diagnose a Mantle Cell non-Hodgkin lymphoma with spleen involvement, previously unknown. Histopathological and immunohistochemical analyses were performed to assess splenic rupture's diagnosis and time estimation. The findings strongly suggest that the splenic rupture was associated with the patient's fall and the pre-existing malignancy. This case highlights the importance of considering underlying hematological malignancies when investigating delayed splenic rupture. Immunohistochemical study of spleen samples allowed the assessment of the timing of splenic hematoma and rupture, leading to establishing a causal relationship with trauma.

The prognostic abilities of artificial intelligence and neuroscience in forensics and the criminal justice system stand as a reformatory paradigm for understanding any criminal conduct. While the use of artificial intelligence has been labeled transformational data analytical capabilities, neural predictive approaches also enable an intricate understanding of culpability and criminal propensities. The literature on the complex nature of neuroprediction and artificial intelligence, its ethical deliberations and its usability in curving recidivism are analyzed. This theoretical review elucidates the complex interplay, nuptial relationships and convergence of these relationships in the quest for justice. The consequences of not protecting individual rights in the criminal justice system are surveyed using grounded theory. The degree of acceptability and dependability of AI-generated evidence in legal proceedings are also reviewed. All these topics are yet to be contemplated under one roof to offer an argumentative view. The author expects to prompt readers and new commers to embrace more sociolegal and technological research before incorporating such research in the Indian Judiciary. The review focuses on the question of whether to blame such technology inclusion wholly or rather to prioritize the acquisition of bias-free pretrained datasets and processing models.

Phosphorus (P) is an important and irreplaceable macronutrient. It is central to energy and information storage and exchange in living cell. P is an element with “broken geochemical cycle” since it lacks abundant volatile compounds capable of closing the P cycle. P fertilizers are critical for global food security, but the reserves of minable P are scarce and non-evenly distributed between countries of the world. Accordingly, the risks of global crisis due to limited access to P reserves is expected to be graver than those entailed by competition for fossil hydrocarbons. Paradoxically, despite the scarcity and value of P reserves, its usage is extremely inefficient: current waste rate reaches 80% giving rise to a plethora of unwanted consequences such as eutrophication leading to harmful algal blooms. Microalgal biotechnology comprise a promising solution to tackle this challenge. The proposed review briefly presents the relevant aspects of microalgal P metabolism such as cell P reserve composition and turnover, and the regulation of P uptake kinetics for maximization of P uptake efficiency with the focus on novel knowledge. Multifaceted role of polyPhosphates, the largest cell depot for P, is discussed with emphasis on the P toxicity mediated by short-chain polyPhosphates. Opportunities and hurdles of P bioremoval via P uptake from waste streams with microalgal cultures, either suspended or immobilized, is discussed along with the role of bacterial components of microalgal-bacterial consortia in these processes. Possible avenues of P-rich microalgal biomass such as biofertilizer production or extraction of valuable polyPhosphates and other bioproducts are considered. The review concludes with a comprehensive assessment of the current potential of microalgal biotechnology for ensuring the sustainable usage of phosphorus.

Trichoderma has been widely studied for its potential as a biocontrol agent against plant pathogenic organisms. Trichoderma's biological control mechanisms include competition, modification of environmental conditions, antibiosis, induction of plant defensive mechanisms, and mycoparasitism. Trichoderma species are known to produce a variety of secondary metabolites that have antifungal activity. These metabolites include peptaibols, gliotoxin, and trichokonins. Trichoderma also produces chitinases and β-1,3-glucanases that can degrade the cell walls of fungal pathogens. In addition to direct antagonism against fungal pathogens, Trichoderma can also induce systemic or localised resistance in plants, which is achieved through the production of elicitors such as chitin oligosaccharides and β-glucans that activate plant defence responses. Trichoderma can also form mutualistic associations with plants. In these associations, Trichoderma colonises the roots of plants and promotes plant growth by increasing nutrient uptake and inducing systemic resistance. Using Trichoderma as a biocontrol agent has several advantages over conventional crop protection techniques based on applying synthetic pesticides.

Water is a fundamental resource for ecosystems, humans, and the development of all economic sectors; it is necessary to identify and evaluate its environmental pressures or impacts. The water footprint (WF) is an appropriate indicator for the consumption of water used to produce a product. The present study uses this tool to evaluate the green and blue water requirements and the sustainability of irrigation water use for agroindustrial avocado production in Ziracuaretiro, Michoacán (2012-2021). Our analysis was based on aggregating weather and soil data at the municipal level and official government databases of avocado cultivated surface, fruit production, and water rights concessions. The analysis considers the homogeneity of information throughout the study area. We estimated that rainfed plantations require 839.03 m³/ton and irrigated plantations require 2355.80 m³/ton, with an average of 1597.47 m³/ton. In addition, we determined that avocado cultivation can demand up to 124.3% of agricultural water concessions in this municipality. In addition to the WF estimates, the analysis indicates that such studies are fundamental for decision-makers to develop and implement water use-efficiency strategies and shows the need for further research related to water consumption of avocado as a crop at more detailed scales to reduce uncertainty.