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 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, 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.

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 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.

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 ``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.

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.

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 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, 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 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, 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, 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.

Objectives to assess COVID-19 mortality rates per country population. To determine what if any independent country-specific variables from 9 different databases were correlated. Design population based retrospective cohort study. Setting analysis of global COVID-19 treatment and containment strategies using data from 9 worldwide websites. Participants 108 countries worldwide. Interventions none. Main Outcome Measures were COVID-19 death rates per country population analyzed by univariate and multivariate analysis. The main outcome parameters were to determine if there are any correlations between the percentage of countrywide COVID-19 deaths/population by the countries’ percent vaccinated. Secondary outcome measures include the effect of other independent variables on COVID-19 death rates per country population including: health expenditures per capita, annual income per capita, COVID-19 tests per 1000 people, stringency index (a measure of each countries containment strategies), hydroxychloroquine score (a measure of each countries use), ivermectin score (a measure of each countries use), hypertension, obesity, diabetes, and specific countries and geographic locations. Results COVID-19 vaccination rates ranged from 0-99% in 108 countries. Univariate analysis demonstrates the following independent variables to correlate with COVID-19 deaths/population (correlation coefficient, p value): countrywide COVID-19 vaccination rates (+0.2936, p=0.002); healthcare costs per capita (+0.3212, p=0.0007), income per capita (+0.3051, p=0.0013), COVID-19 tests per 1000 population (+0.6981 p=0.0307); stringency index (+0.3098, p=0.0011); hydroxychloroquine index (-0.1337, p=0.0678); and ivermectin index (-0.1383, p=0.1535). Conclusions Increasing rates of COVID-19 vaccination are associated with increase COVID-19 death rates per country population (p=0.002). Other variables associated include healthcare costs per capita (+0.3212, p=0.0007), income per capita (+0.3051, p=0.0013), COVID-19 tests per 1000 population (+0.6981 p=0.0307); and stringency index (+0.3098, p=0.0011).

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.

Various authors have highlighted the importance of marriage as a social marker that alter the so-cial categorization of individuals and their relationships from youth to adulthood according to the cultural construction of the life course in Arab countries. This article aims to analyze the in-teraction between the socio-political framework (structure) and the capacity for individual action (agency) in the context of biographical experiences to achieve emancipation in Morocco. This per-spective responds to the demand of different authors to include the subjective approaches of young people in the process of analysis. This analysis will be guided by some questions: Which is the capacity of young Arabs to decide the orientation of their life trajectories? What factors (cultural, family, socioeconomic, educational, etc.) create and shape the expectations of young people re-garding their transition to adult life? Is there a specific model of emancipation in the Arab Medi-terranean countries?

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 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.

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.

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.

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.

Purpose: There is limited research on the reasons behind startup failure, and none of the available studies use a competency approach. In this study we applied Spencer’s competency model to identify the competencies in startups which, according to their CEOs, contributed to failure. Methodology: Three coders analyzed the stories of 50 startup failures published online using modified Critical Incident Technique. Findings: Two salient competencies were identified playing a fundamental role in startup failures if missing: Information seeking and Customer service orientation. A network pattern of 9 more prevalent competency deficits was created: Technical/professional/managerial expertise, Analytical thinking, Flexibility, Self-control, Concern for order, quality and accuracy, Interpersonal understanding, Self-confidence, Team leadership and Teamwork and cooperation. Besides startup-specific behavior descriptions were added to Spencer’s competencies. Research implications: Competency approach and Critical Incident Technique method proved to be feasible to identify competency deficits in failed startups. Practical implications: The identified competency deficits offer relevant focus areas for the assessment and development of startup teams. Originality: The study provided research evidence to describe the competency deficits of startup teams that are connected to their failure.

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.

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.

Myostatin inhibition therapy has held much promise for the treatment of muscle wasting disorders. This is particularly true for the fatal myopathy, Duchenne Muscular Dystrophy (DMD). Following on from promising pre-clinical data in dystrophin-deficient mice and dogs, several clinical trials were initiated in DMD patients using different modality myostatin inhibition therapies. All failed to show modification of disease course as dictated by the primary and secondary outcomes measures selected: the myostatin inhibition story thus far, is a failed clinical story. These trials have recently been extensively reviewed and reasons why pre-clinical data collected in animal models has failed to translate into clinical benefit to patients has been purported. However, the biological mechanisms underlying translational failure need to be examined to ensure future myostatin inhibitor development endeavors do not meet with the same fate. Here, we explore the biology which could explain the failed translation of myostatin inhibitors in the treatment of DMD.

Despite all scientific efforts and many protracted and expensive clinical trials, no new drug has been approved by FDA for treatment of Alzheimer disease (AD) since 2003. Indeed, more than 200 investigational programs have failed or have been abandoned in the last decade. The most probable explanations for failures of disease-modifying treatments (DMTs) for AD may include late initiation of treatments during the course of AD development, inappropriate drug dosages, erroneous selection of treatment targets, and mainly an inadequate understanding of the complex pathophysiology of AD, which may necessitate combination treatments rather than monotherapy. Clinical trials’ methodological issues have also been criticized. Current drug-development research for AD is aimed to overcome these drawbacks. Preclinical and prodromal AD populations, as well as traditionally investigated populations representing all the clinical stages of AD, are included in recent trials. Systematic use of biomarkers in staging preclinical and prodromal AD and of a single primary outcome in trials of prodromal AD are regularly integrated. The application of amyloid, tau, and neurodegeneration biomarkers, including new biomarkers—such as Tau positron emission tomography, neurofilament light chain (blood and CSF biomarker of axonal degeneration) and neurogranin (CSF biomarker of synaptic functioning)—to clinical trials allows more precise staging of AD. Additionally, use of the Bayesian statistics, modifiable clinical trial designs, and clinical trial simulators enrich the trial methodology. Besides, combination therapy regimens are currently assessed in clinical trials. The abovementioned diagnostic and statistical advances, which have been recently integrated in clinical trials, are consequential to the recent failures of studies of disease-modifying treatments. Their experiential rather than theoretical origins may better equip potentially successful drug-development strategies.

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.

I review the solution of QCD in two spacetime dimensions. Following the analysis of Baluni, for a single flavor the model can be analyzed using Abelian bosonization. The theory can be analyzed in strong coupling, when the quarks are much lighter than the gauge coupling. In this limit, the theory is given by a Luttinger liquid.

Extracorporeal membrane oxygenation (ECMO) can be a life-saving intervention in cases of potentially reversible refractory respiratory failure. One such indication can be bleomycin-induced lung injury. However, in some cases, the injury can be so severe that it becomes irreversible and creates complex medical decisions regarding life support and the continuation of care when no additional therapeutic options are feasible, particularly in cases of patients who were young and fully functional prior to an acute illness. In cases of full pulmonary replacement with mechanical support and the degree of functionality that can be attained utilizing modalities such as ECMO can obscure the true severity of illness and make end-of-life decisions significantly harder for families and caregivers.

Background: The coronavirus disease-19 (COVID-19) has spread globally with more than 80,000 people infected, and nearly 3000 patients died. Currently, we are in an urgent need for effective treatment strategy to control the clinical deterioration of COVID-19 patients. Methods: The clinical data of 10 COVID-19 patients receiving short-term moderate-dose corticosteroid (160mg/d) plus immunoglobulin (20g/d) were studied in the North Yard of The First Hospital of Changsha, Hunan from January 17^th to February 27^th, 2020. Epidemiological, clinical, laboratory, radiological findings were analyzed. Results: After treatment with combination of low-dose corticosteroid (40-80mg/d) and immunoglobulin (10g/d), patients’ lymphocyte count (0.88±0.34 vs 0.59±0.18, P<0.05), oxygenation index including SPO₂ (94.90±2.51 vs 90.50±5.91, P<0.05) and PaO₂/FiO₂ (321.36±136.91 vs 129.30±64.97, P<0.05) were significantly lower than pre-treatment, and CT showed that the pulmonary lesion deteriorated in all patients. While after treatment of short-term moderate-dose corticosteroid plus immunoglobulin, patients’ APACHE Ⅱ score (9.10±6.15 vs 5.50±9.01, P<0.05), body temperature (37.59±1.16 vs 36.46±0.25, P<0.05), lymphocyte count (0.59±0.18 vs 1.36±0.51, P<0.05), Lactate dehydrogenase (419.24±251.31 vs 257.40±177.88, P<0.05), and C-reactive protein (49.94±26.21 vs 14.58±15.25, P<0.05) significantly improved compared with post-treatment with low-dose therapy. In addition, oxygenation index including SPO₂ (90.50±5.91 vs 97.50±1.18, P<0.05), PaO₂ (60.47±14.53 vs 99.07±34.31, P<0.05), and PaO₂/FiO₂ (129.30±64.97 vs 340.86±146.72, P<0.05) significant improved. Furthermore, CT showed that pulmonary lesions obviously improved in 7 patients. After systematic therapy, 4 out of 10 COVID-19 patients recovered and discharged. Conclusions: Short-term moderate-dose corticosteroid plus immunoglobulin is effective for reversing the continued deterioration of COVID-19 patients who failed to respond to the low-dose therapy. Funding: This work was supported by the Innovative Major Emergency Project Funding against the New Coronavirus Pneumonia in Hunan Province (Dr. Ji-Yang Liu, number 2020SK3014; Dr. Yuan-Lin Xie, number 2020SK3013).

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.

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.

The lymphocyte function–associated antigen-1 (LFA-1) (also CD11a/CD18 and αLβ2), is just one of many integrins in the human body, but its significance derives from its exclusive presence in leukocytes. In this review, we summarize the studies relating LFA-1 and its major ligand ICAM-1 (CD54) with cancer, through the function of lymphocytes and myeloid cells on tumor cells. We consider how LFA-1 mediates the interaction of leukocytes with tumors and the role of ICAM-1 in tumor dynamics, which can be independent of its interaction with LFA-1. A more detailed examination of LFA’s role within B-cell chronic lymphocytic leukemia is made. Finally, we discuss the role of LFA-1-harboring exosomes in tumor growth and metastasis.

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 article, we investigate two types of double dispersion equations in two dierent dimensions. Double dispersion equation were derived to describe long nonlinear wave evolution in a thin hyperelastic rod. Conservation laws are obtained for these equations by the application of the multiplier method. Finally, travelling waves and line travelling waves are respectively considered for these two equations.

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.

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.

Vilsmeier–Haack reaction of (E)-1-(1-(3,5-difluorophenyl)ethylidene)-2-phenylhydrazine (1) using dimethyl formamide in excess of phosphorous oxychloride by conventional method, resulted in the synthesis of title compound 3-(3,5-difluorophenyl)-1-phenyl-1H-pyrazole-4- carbaldehyde (2) in good yield and high purity. Structure characterization of the novel title compound was done by IR, ¹H NMR, ¹³C NMR and mass spectral analysis.

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.

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.

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.

In this paper, we study the dynamics of following system of nonlinear difference equations x_n+1 = x_n-1y_n - 1, y_n+1 = y_n-1z_n - 1, z_n+1 = z_n-1x_n - 1. Especially we investigate the periodicity, boundedness and stability of related system of difference equations.

The 3x+1 problem asks the following: Suppose we start with a positive integer, and if it is odd then multiply it by 3 and add 1, and if it is even, divide it by 2. Then repeat this process as long as you can. Do you eventually reach the integer 1, no matter what you started with? Collatz conjecture (or 3n+1 problem) has been explored for about 85 years. In this paper, we convert an integer number from decimal to binary number, and convert the Collatz function to binary function, which is multiplication and division of two binary numbers. Finally the iternation of the Collatz function, eventually reach the integer 1, thus we solve the 3x+1 problem completely.

We study the Gaudin models with gl(1|1) symmetry that are twisted by a diagonal matrix and defined on tensor products of polynomial evaluation gl(1|1)[t]-modules, extending all the results of to the twisted case. Namely, we give an explicit description of the algebra of Hamiltonians (Gaudin Hamiltonians) acting on tensor products of polynomial evaluation gl(1|1)[t]-modules and show that there exists a bijection between common eigenvectors (up to proportionality) of the algebra of Hamiltonians and monic divisors of an explicit polynomial written in terms of the highest weights and evaluation parameters. In particular, our result implies that each common eigenspace of the algebra of Hamiltonians has dimension one. We also give dimensions of the generalized eigenspaces.

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.

Background: Hepatic erythrophagocytosis is augmented in NASH and amplifies inflammation and fibrosis. Although various pro-phagocytic signals have been identified on erythrocytes of NASH patients, the role of bound thrombospondin-1 (TSP-1), which acts as an “eat-me” signal, arginase-1, which regulates the levels of nitric oxide in erythrocytes, and phosphatidylethano-lamine (PE) which can amplify erythrophagocytosis and hepatic inflammation have not been explored. Hence, we sought to investigate the levels of arginase-1 and TSP-1 in erythrocyte lysate and PE in erythrocyte membranes of NASH patients. Methods: Twenty-four patients and 14 healthy controls participated in our study. The levels of TSP-1 and arginase were quantified by ELISA in erythrocyte lysates, and the levels of PE in erythrocyte membranes by thin layer chro-matography. Results: Erythrocytes of NAFLD patients exhibit lower levels of arginase-1 and TSP-1 (p<0.01). Erythrocyte-bound TSP-1 levels correlated with the levels of erythrocyte surface CD47. Phosphatidylethanolamine was increased in erythrocytes of NASH patients and was accompanied by increased release, indicating exposure. Conclusion: Our results imply reduced TSP-1 binding by erythrocytes which could allow free TSP-1 molecules to act on macrophages, enhancing erythrophagocytosis. Increased PE which could amplify inflammation after efferocytosis, while downregulation of arginase-1 could lead to defective efferocytosis.

PG9, PG16, PGT121, and PGT145 antibodies were identified from culture media of activated memory B-cells of an infected donor and shown to neutralize many HIV-1 strains. Since HIV-1 spreads via both free virions and cell-cell fusion, we examined the effect of the antibodies on HIV-1 Env-mediated cell-cell fusion. Clone69TRevEnv cells that express Env in the absence of tetracycline were labeled with Calcein-AM Green, and incubated with CD4+ SupT1 cells labeled with CellTrace™ Calcein Red-Orange, with or without antibodies. Monoclonal antibodies PG9, PG16, 2G12, PGT121, and PGT145 (at up to 50 µg/mL) had little or no inhibitory effect on fusion between HIV-Env and SupT1 cells. By contrast, Hippeastrum hybrid agglutinin completely inhibited fusion. Our results indicate that transmission of the virus or viral genetic material would not be inhibited by these broadly neutralizing antibodies. Thus, antibodies generated by HIV-1 vaccines should be screened for their inhibitory effect on Env-mediated cell-cell fusion.

Brazil, Russia, China, India, and the Republic of South Africa (BRICS) represent developing economies facing different energy and economic development challenges. The current study aims to forecast energy consumption in BRICS at aggregate and disaggregate levels using the annual time series data set from 1992 to 2019 and to compare results obtained from a set of models. The time-series data are from the British Petroleum (BP-2019) Statistical Review of World Energy. The forecasting methodology bases on a novel Fractional-order Grey Model (FGM) with different order parameters. This study contributes to the literature by comparing the forecasting accuracy and the forecasting ability of the FGM(1,1) with traditional ones, like standard GM(1,1) and ARIMA(1,1,1) models. Also, it illustrates the view of BRICS's nexus of energy consumption at aggregate and disaggregates levels using the latest available data set, which will provide a reliable and broader perspective. The Diebold-Mariano test results confirmed the equal predictive ability of FGM(1,1) for a specific range of order parameters and the ARIMA(1,1,1) model and the usefulness of both approaches for energy consumption efficient forecasting.

The reaction of 2-bromo-1-(5-methyl-1-(4-nitrophenyl)-1H-1,2,3-triazol-4-yl)ethan-1-one (1) with 4-amino-5-((2,4-dichlorophenoxy)methyl)-4H-1,2,4-triazole-3-thiol (2) in absolute ethanol in the presence of triethyl amine as catalyst gave 2-((4-amino-5-((2,4-dichlorophenoxy)methyl)-4H-1,2,4-triazol-3-yl)thio)-1-(5-methyl-1-(4-nitrophenyl)-1H-1,2,3-triazol-4-yl)ethan-1-one (3) in 73% yield. The structure of the title heterocycle (3) was confirmed by X-ray single crystal diffraction and spectral analyses (NMR and IR).

Zwitterionic polymers emerge as very useful materials for applications in antifouling surfaces. The properties of these polymers can be tuned by variation of the chemical structure of the corresponding monomer. In this study, two zwitterionic ammonium sulfonate monomers bearing an hydroxyl function and a styrenic polymerizable groups were prepared in two steps. The two monomers were obtained using 4-vinylbenzyl chloride as the key precursor. The zwitterionic monomers were characterized by 1H NMR, 13C NMR, IR spectroscopy and high-resolution mass spectrometry (HRMS). These two monomers enable the preparation of novel zwitterionic polymers with enhanced hydrophilicity due to the presence of a hydroxyl group.

In the fast-paced internet world that we live in today, internet technologies and tools that enable us to connect online are rapidly changing and improving. To adapt to the changing environment, many game developers are changing their business models to adjust to this online environment by developing games that are centred around online gaming. As such, the internet demands of consumers such as gamers are increasing because of the need for quality internet connection for optimal gameplay. There are too many factors that can affect online gameplay. Moreover, not all gamers are equipped with the network knowledge and skills to diagnose and troubleshoot any internet issues that may arise during their gameplay session. The main contribution of this research was to gather insights from Malaysian broadband internet consumers, mainly from gamers and general users regarding their opinions of their ISP service experience in gaming, general use and service quality. A 1-click solution is presented as a smart autonomous network monitoring tool that can autonomously monitor, diagnose, and troubleshoot network problems with minimal input from the user. This research was conducted using a mixed-mode research methodology where the participants were asked to fill up a questionnaire regarding the user experience of their Internet Service Provider (ISP), and their perception of the 1 click-automated networking tool for their personal use. It is shown that there is a market demand for a 1 click-automated networking tool as gamers and general users both agree that such a tool would be beneficial to them by improving the internet quality of a network.

The cellular model we teach and have theorized assumes that the cell is the basic unit of multicellular living beings. This fundamental element has been the subject of many theories concerning its properties and the exchanges that exist with its environment. In this article, we demonstrate that certain functional aspects, in particular the electrical aspects related to diffusion, have not been correctly assumed or that certain initial conditions have been purely ignored and are in contradiction with physics, chemistry and thermodynamics.

Ataxin-2 (human gene symbol ATXN2, protein ATXN2) is the disease protein of Spinocerebellar Ataxia type 2 (SCA2). The large expansions of a polyglutamine (polyQ) stretch above a threshold of ~33 glutamines cause the multi-system nervous atrophy SCA2, while intermediate expansions of 29-32 glutamines contribute to the risk of the motor neuron diseases Amyotrophic Lateral Sclerosis (ALS) and Fronto-Temporal Lobar Dementia (FTLD). To elucidate the cellular function of ATXN2, we further characterized its direct interaction with alpha-Actinin-1 (symbol ACTN1), which had been observed in high-throughput yeast-two-hybrid surveys. An endogenous complex of ATXN2 and ACTN1 proteins was detected by co-immunoprecipitation. In vitro GST-tag pull-down experiments showed that the Calponin-Homology-domain at the N-terminus of ACTN1 binds to the N-terminus of ATXN2. Although an impact of the polyQ expansion on the interaction was not evident in pull-down experiments, a recent characterization of aged Atxn2-CAG100-KnockIn mice provides evidence. Both proteins associated in the cytosol and at the plasma membrane, as determined by sedimentation experiments in mouse brain, and by immunofluorescence microscopy of a transfected monkey cell line and of rat primary hippocampal neurons. In view of the roles of ACTN1 for spine plasticity and postsynaptic receptor control via reassembly of cortical actin, our data help to explain the impaired dendrite maintenance in SCA2.

Background and Aim. Since virus-related hepatocellular carcinoma (HCC) pathogenesis involves liver inflammation, therefore, post-hepatitis C virus (HCV) infection would be a cause for liver cirrhosis that would progress to HCC. Cytotoxic T cells (Tc) are known to be involved in post-HCV complications and HCC pathogenesis. The inhibitory checkpoint Leukocyte-Associated Immunoglobulin-like Receptor-1 (LAIR-1) is expressed on Tc. Therefore, we aimed to determine whether the Tc expression level of LAIR-1 is associated with HCC progression post-HCV and moreover, to evaluate LAIR-1 expression as a non-invasive biomarker for HCC progression in the context of liver cirrhosis post-HCV genotype 4 (G4) in Egyptian patients’ peripheral venous blood liquid biopsy. We studied LAIR-1 expression on Tc related to the progression of liver cirrhosis in a case-controlled study enrolled 64 patients with post-HCV G4-HCC and 37 patients with post-HCV G4-liver cirrhosis. Methods: LAIR-1 expression was analyzed by flow cytometry. Results: LAIR-1 expression on Tc and the percentage of Tc positive for LAIR-1 (LAIR-1+Tc %) were significantly higher in the post-HCV G4-HCC group compared to the post-HCV G4-liver cirrhosis

Solid tumor cells have an altered metabolism that can protect them from cytotoxic lymphocytes. The antidiabetic drug metformin modifies tumor cell metabolism and several clinical trials are testing its effectiveness for the treatment of solid cancers. The use of metformin in hematologic cancers has received much less attention, although allogeneic cytotoxic lymphocytes are very effective against these tumors. We show here that metformin induces expression of Natural Killer G2-D (NKG2D) ligands (NKG2DL) and intercellular adhesion molecule-1 (ICAM-1), a ligand of the lymphocyte function-associated antigen 1 (LFA-1). This leads to enhance sensitivity to cytotoxic lymphocytes. Overexpression of antiapoptotic Bcl-2 family members decrease both metformin effects. The sensitization to activated cytotoxic lymphocytes is mainly mediated by the increase on ICAM-1 levels, which favors cytotoxic lymphocytes binding to tumor cells. Finally, metformin decreases the growth of human hematological tumor cells in xenograft models, mainly in presence of monoclonal antibodies that recognize tumor antigens. Our results suggest that metformin could improve cytotoxic lymphocyte-mediated therapy.

A second order rational difference equation $$x_{n+1}=px_{n}+\frac{q}{x_{n-1}^2}$$ with the parameters $p$ and $q$ which lies in $(0,1)$, is studied. The dynamics of the equilibrium is characterized through the trichotomy of the parameter $p<\frac{1}{2}$, $p=\frac{1}{2}$ and $p>\frac{1}{2}$. It is found that there is no periodic solution of period $2$ and $3$ but there exists periodic solutions with only periodic solution $5$ and $10$ are achieved computationally.

Before the adaptive immune response is established, retroviruses can be targeted by several cellular host factors at different stages of the viral replication cycle. This intrinsic immunity relies on a large diversity of antiviral processes. In the case of HTLV-1 infection, these active innate host defence mechanisms are debated. Among these mechanisms, we focused on a RNA decay pathway called nonsense-mediated mRNA decay (NMD), which can target multiple viral RNAs, including HTLV-1 unspliced RNA, as it has been recently demonstrated. NMD is a cotranslational process that depends on the RNA helicase UPF1 and regulates the expression of multiple types of host mRNAs. RNA sensitivity to NMD depends on mRNA organization and the ribonucleoprotein (mRNP) composition. HTLV-1 has evolved several means to evade the NMD threat, leading to NMD inhibition. In the early steps of infection, NMD inhibition favours the production of HTLV-1 infectious particles, which may contribute to the survival of the most fit clones despite genome instability; however, its direct long-term impact remains to be investigated.

Background; Programmed death-1 (PD-1) and PD-1 ligand 1 (PD-L1) are target molecules for immunotherapy in non-small cell lung cancer. PD-L1 is expressed not only in cancer cells, but also on macrophages, and has been suggested to contribute to macrophage-mediated immune suppression. Methods; Clinical significance of PD-L1 expression on macrophages in human lung adenocarcinoma was examined. The mechanisms of PD-L1 overexpression on macrophages were investigated by means of cell culture studies. Results; High PD-L1 expression on macrophages was correlated with the presence of EGFR mutation, a lower cancer grade, and a shorter cancer-specific overall survival. In an in vitro study using lung cancer cell lines and human monocyte-derived macrophages, the conditioned medium from cancer cells was found to up-regulate PD-L1 expression on macrophages via STAT3 activation, and a cytokine array revealed that granulocyte-macrophage colony-stimulating factor (GM-CSF) was a candidate factor that induced PD-L1 expression. Culture studies using recombinant GM-CSF, neutralizing antibody, and inhibitors indicated that PD-L1 overexpression was induced via STAT3 activation by GM-CSF derived from cancer cells. Conclusions; PD-L1 overexpression on macrophages via the GM-CSF/STAT3 pathway was suggested to promote cancer progression in lung adenocarcinoma. Cancer cell-derived GM-CSF might be a promising target for anti-cancer therapy.

A regional organisation (RO) is a group of states that, through the formation of mutual relationships, work together for shared regional goals such as economic growth, social welfare, security, and democracy. The Association of South East Asian Nations (ASEAN) is one such organisation, of interest because of its operative paradoxes. However, current theory to study ROs is both fragmented across the field of study, and inadequate. Taking ROs to be complex adaptive systems, diagnosing ROs requires theory that can to explore their hidden aspects. The metacybernetics framework enables the creation of a critical realism configurative a-priori inquiry approach to theory building, the configurations providing coordinative schemas able to respond to predefined complex modelling needs. To analyse ROs using metacybernetics, we offer a derivative schema, Cultural Agency Theory (CAT). Currently this is limited to exploring modes of information acquisition processes through cognitive style, and until now has had no inherent mechanism to explore social relationships as is required to explore ROs. To enable CAT to explore such relationships, we configure the Tönnies social organisation paradigm for CAT. Mindset Agency Theory (MAT) is a specific elaboration of CAT, and creates an empirical setting for the set of formative traits that de-fine an RO character. A related derivative of CAT is that of Multiple Identity Theory (MIT) which enables organisational pathologies to be explored in terms of identity conflicts. This multifaceted paradigm provides a relatively simple approach to the RO diagnosis, in particular in terms of stability/coherence. This paper is in two parts. In this part 1, the CAT theory will be further developed through the joint configuration of Tönnies social organisation paradigm allowing its pathologies to be diagnosed. In part 2 of the paper, the theory will be applied to ASEAN and the diagnosis will show that it is an inherently incoherent organisation.

Anti-islet autoantibodies serve as key markers in immune-mediated type 1 diabetes (T1D) and slowly-progressive T1D (SPIDDM), also known as latent autoimmune diabetes in adults (LADA). Autoantibodies to insulin (IAA), glutamic acid decarboxylase (GADA), tyrosine phosphatase-like protein IA-2 (IA-2A), and zinc transporter 8 (ZnT8A) are currently employed in the diagnosis, pathological analysis, and prediction of T1D. GADA can also be detected in non-diabetic patients with autoimmune diseases other than T1D and may not necessarily reflect insulitis. Conversely, IA-2A and ZnT8A serve as surrogate markers of pancreatic β-cell destruction. Combinatorial analysis of these four anti-islet autoantibodies demonstrated that 93-96% of acute-onset T1D and SPIDDM cases were diagnosed as immune-mediated T1D, while the majority of fulminant T1D cases were autoantibody-negative. Evaluating the epitopes and immunoglobulin subclasses of anti-islet autoantibodies help distinguish between diabetes-associated and non-diabetes-associated autoantibodies and is valuable for predicting future insulin deficiency in SPIDDM (LADA) patients. Additionally, GADA in T1D patients with autoimmune thyroid disease reveals the polyclonal expansion of autoantibody epitopes and immunoglobulin subclasses. Recent advancements in anti-islet autoantibody assays include nonradioactive fluid-phase assays and the simultaneous determination of multiple biochemically defined autoantibodies. Developing a high-throughput assay for detecting epitope-specific or immunoglobulin isotype-specific autoantibodies will facilitate more accurate diagnosis and prediction of autoimmune disorders.

(R)-(+)-3,5-Dinitro-N-(1-phenylethyl)benzothioamide 1 is a potential chiral solvating agent (CSA) for the spectral resolution of enantiomers by 1H NMR spectroscopy. The single enantiomer of 1 was synthesized from commercially (R)-(+)-a-methylbenzylamine 2 in two-steps with 85% yield.

A sparse language is a formal language such that the number of strings of length $n$ is bounded by a polynomial function of $n$. We create a class with the opposite definition, that is a class of languages that are dense instead of sparse. We define a dense language on $m$ as a formal language (a set of binary strings) where there exists a positive integer $n_{0}$ such that the counting of the number of strings of length $n \geq n_{0}$ in the language is greater than or equal to $2^{n - m}$ where $m$ is a real number and $0 < m \leq 1$. We call the complexity class of all dense languages on $m$ as $DENSE(m)$. We prove that there exists an $\textit{NP--complete}$ problem that belongs to $DENSE(m)$ for every possible value of $0 < m \leq 1$.

The Maxwell equations of electrodynamics describe electrical and magnetic forces with great accuracy in the vacuum of space. But the equations of electrodynamics applied to material systems are usually written in a way that obscures their accuracy. The usual formulation of the Maxwell equations includes a dielectric constant as a single real number that grossly over-approximates the actual properties of matter, particularly liquid matter so important in applications of electrodynamics to biology and chemistry. We rewrite two Maxwell equations here to make clear the precision of the Maxwell equations in the presence or absence of matter. We discuss and derive two well known corollaries that are as universal and precise as the Maxwell equations themselves: (1) a continuity equation that relates charge and flux and (2) a conservation equation in which total current never accumulates at all. The total current is the right hand side of the Ampere-Maxwell law. Total current is perfectly incompressible. It is conserved exactly, everywhere and at every time, independent of the microphysics of charge conduction. The total current combines the flux of charges and the ethereal current. The ethereal current \varepsilon_{o\ }\sfrac{\partial\mathbf{E}}{\partial t}\ exists everywhere, including the interior of atoms, because it is a property of space, not matter. The ethereal current exists, and thus flows, in a vacuum devoid of mass. The ethereal current is a consequence of the relativistic (Lorentz) invariance of charge. Charge does not change even if it moves at speeds approaching the velocity of light. Total current has properties quite distinct from flux of mass because of the ethereal current. Most strikingly, in the one dimensional unbranched systems of electronic circuits and biological ion channels, the total current is independent of location, even if the flux of charges varies a great deal. Indeed, the Maxwell equations—and thus conservation of total current—act as a perfect low pass spatial filter, converting the infinite variation of (the Brownian model of) thermal motion of charges to the zero variation of the total current.

2-(Adamantan-1-yl)-2H-isoindole-1-carbonitrile (1) has been identified as a neurobiological fluorescent ligand that may be used to develop receptor and enzyme binding affinity assays. Compound 1 was synthesised using an optimised microwave irradiation reaction and crystallised from ethanol. Crystallization occurred in the orthorhombic space group P212121 with unit cell parameters: a = 6.4487(12) Å, b = 13.648(3) Å, c = 16.571(3) Å, V = 1458(5) Å3, Z = 4. Density functional theory (DFT) (B3LYP/6-311++G (d,p)) calculations of 1 were carried out. Results showed that the optimised geometry is similar to the crystal structure parameters with a root-mean-squared deviation of 0.143 Å. Frontier molecular orbital energies and net atomic charges are discussed with a focus on potential biological interactions. Docking experiments within the active site of the neuronal nitric oxide synthase (nNOS) protein crystal structure were carried out and analysed. Important binding interactions between the DFT optimised structure and amino acids within the nNOS active site were identified that explain the strong NOS binding affinity reported. Fluorescent properties of 1 were studied using aprotic solvents of different polarities. Compound 1 showed the highest fluorescence intensity in polar solvents with excitation and emission values of 336 nm and 380 nm, respectively.

Protein O-GlcNAcylation has been associated with neurodegenerative diseases such as Alzheimer´s disease (AD). O-GlcNAcylation of Amyloid Precursor Protein (APP) regulates both the trafficking and the processing of the APP through the amyloidogenic pathway, resulting in the release and aggregation of the Aβ1-42 peptide. Microglia clear Aβ aggregates and dead cells to maintain brain homeostasis. Here, using LC-MS/MS we reveal that the Aβ1-42 peptide modifies the microglia O-GlcNAcome. We have identified 55 proteins, focusing our research on Galectin-1 protein, since it is a very versatile protein from a functional point of view. Combining biochemical with genetic approaches we demonstrate that Aβ1-42 peptide specifically targets Galectin-1S8 O-GlcNAcylation via OGT. In addition, this Gal-1-O-GlcNAcylated form, in turn, controls human microglia migration. Given the importance of microglia migration in the progression of AD, this study reports the relationship between Aβ1-42 peptide and Serine 8- O-GlcNAcylation of Galectin to drive microglial migration

Postharvest 1-MCP treatment can inhibit lignification of fruit and vegetables. It has been suggested that the mode of action of 1-MCP is through inhibiting ethylene production, but the effect of 1-MCP and ethylene on lignification of common bean remain unknown. This work compared the effect of 0.5 μL L-1 1-MCP and 100 μL L-1 ethylene on lignification of common bean during storage. Postharvest 1-MCP significantly inhibited the increase of lignified cell group, sclerenchyma became thicker, vascular bundles thickened and lignified cells grew during storage, while ethylene is the opposite. 1-MCP inhibited the increase in respiration rate, sucrose phosphate synthase (SPS), sucrose synthase (SuSy), phenylalanine ammonialyase (PAL), cinnamyl-alcohol dehydrogenase (CAD), and peroxidase (POD) activities, whereas ethylene hastened all. Ethylene treatment can be stimulated and 1-MCP inhibited the decline of reducing sugar and cellulose content. Expression of genes, including PvACO1, PvAOG1, PvSuSy, PvPAL3, and Pv4CL1, PvCOMT1 together with lignin content were significantly increased in common bean during storage. 1-MCP treatment markedly inhibited expression of PvACO1, PvSuSy2, PvPAL3, Pv4CL1 and PvCOMT1 genes, while strengthened expression of PvETR1 and PvAOG1, while ethylene was opposite. This work provides evidence that ethylene plays a key role in regulating the lignin biosynthesis of common bean, and also provides strategies for the maintenance of fruit quality during storage.

The aim of the study was to determine the possibility of suppression of the prostaglandin synthesis by new derivatives of N-phenylanthranilic acids; they inhibit the activity of the microsomal prostaglandin E synthase-1 (mPGES-1) enzyme using the method of a flexible molecular docking. For the docking studies the crystallographic structural models with high resolution from Protein Data Bank were used: mPGES-1 in the complex with glutathione (pdb code 4AL0). A flexible molecular docking was carried out using the Molecular Operating Environment (MOE) software package. According to the results of the docking studies four scoring functions were calculated (Affinity dG Scoring, Alpha HB Scoring, London dG Scoring, GBVI/WSA dG Scoring). The values of the scoring functions calculated indicate the thermodynamic probability and energy favorability of forming complexes between molecules of the substances under research and the specified receptor, in which arrangement of ligands in the active site of the receptor and residues of amino acids of side chains are of similar geometry and types of binding of the known inhibitors of mPGES-1 determined on the basis of the crystallographic studies.

The paper discusses the classification of fuzzy metrics based on their continuity conditions, dividing them into Erceg, Deng, Yang-Shi, and Chen metrics. It explores the relationships between these types of fuzzy metrics, concluding that a Deng metric in [0,1]-topology must also be Erceg, Chen, and Yang-Shi metrics. The paper also proves that the product of countably many Deng pseudo-metric spaces remains a Deng pseudo-metric space, and demonstrates some σ-locally finite properties of Deng metric space. Additionally, the paper constructs two interrelated mappings based on normal space and concludes that if a [0,1]-topological space is T1 and regular, and its topology has a σ-locally finite base, then it is Deng metrizable, and thus Erceg, Yang-Shi, and Chen metrizable as well.

Melanocortins play crucial roles in regulating the stress response, inflammation, and skin pigmentation. In this review, we focus on the melanocortin 1 receptor (MC1R), a G protein-coupled receptor primarily known for regulating skin pigmentation and exhibiting anti-inflammatory effects. First, we provide an overview of the structure, signaling pathways, and related diseases of MC1R. Next, we discuss the potential therapeutic use of synthetic peptides and small molecule modulators of MC1R, highlighting the development of various drugs that enhance stability through amino acid sequence modifications and small molecule drugs to overcome limitations associated with peptide characteristics. Notably, MC1R-targeted drugs have applications beyond skin pigmentation-related diseases, which predominantly affect MC1R in melanocytes. These drugs can also be useful in treating inflammatory diseases with MC1R expression present in various cells. Our review underscores the potential of MC1R-targeted drugs to treat a wide range of diseases and encourages further research in this area.

The RV144 trial represents the only vaccine trial to demonstrate any protective effect against HIV-1 infection. While the reason(s) for this protection are still being evaluated, it serves as justification for widespread efforts aimed at developing new, more effective HIV-1 vaccines. Advances in our knowledge of HIV-1 immunogens and host antibody responses to these immunogens are crucial to informing vaccine design. While the envelope (Env) protein is the only viral protein present on the surface of virions, it exists in a complex trimeric conformation and is decorated with an array of variable N-linked glycans, making it an important but difficult target for vaccine design. Thus far, efforts to elicit a protective humoral immune response using structural mimics of native Env trimers have been unsuccessful. Notably, the aforementioned N-linked glycans serve as a component of many of the epitopes crucial for the induction of potentially protective broadly neutralizing antibodies (bnAbs). Thus, a greater understanding of Env structural determinants, most critically Env glycosylation, will no doubt be of importance in generating effective immunogens. Recent studies have identified the HIV-1 Env signal peptide (SP) as an important contributor to Env glycosylation. Further investigation into the mechanisms by which the SP directs glycosylation will be important, both in the context of understanding HIV-1 biology and in order to inform HIV-1 vaccine design.

Solid porous materials, like zeolites, have been widely used in a variety of fields such as size and shape-selective absorption/separation and catalysis because of their porosity. But there are few liquid materials exhibit permanent porosity. Porous liquids are a novel material that combine the properties of fluidity and permanent porosity. It has potential applications in many fields such as gas separation, storage and transport. Herein, we report a novel Type 1 porous liquid prepared based on Silicalite-1. The pore size of this porous liquid was determined by positron annihilation lifetime spectroscopy (PALS), and the CO2 capacities was determined by the intelligent gravimetric analyser (IGA). The unique properties of this porous liquid can promote its application in many fields such as gas storage and transport.

In recent decades, a number of high-profile cases involving fraud as research misconduct have been in the media and resulted in severe consequences for those convicted. According to the increased cases of allegations and coverage in the media, this reflects a heightened awareness that fraudulent actions exist. Nonetheless, the Office of Research Integrity data suggests that despite the growth in the number of the cases of allegation there has not been a commensurate increase in findings of misconduct. The purpose of this paper is to explore misconduct to better understand what it entails. An analysis of misconduct from the perspective of the definitions of allegations and fraud of is conducted and potential frameworks for understanding both are considered. The paper considers serial-positioning effects of primacy and recency on allegation phenomena, as well as supervenience theory and contextualism as a lens for understanding fraud. Discussion of the relational semantics of the core aspects of fraud and de facto grouping of forms of misconduct. It is concluded that the interrogative pronouns of “what” and “when” could be used to categorize forms of misconduct laying the foundation for the next paper that deconstructs the definition of falsification according to the Public Health Service.

Alphaherpesviruses cause genital lesions and reproductive failure in both humans and animals. Their control is mainly based on prevention by hygienic prophylactic measures, due to the ab-sence of vaccines and limitations of antiviral drug therapy. Ozone is an oxidating gas showing a strong microbicidal activity on bacteria, fungi, viruses, and protozoa. The present study assessed the in vitro virucidal and antiviral activity of ozone against Caprine herpesvirus type 1. Virucidal activity of a gaseous mixture containing O3 at 20 and 50 μg /mL was assessed against the virus for different contact times (30 s, 60s, 90s, 120s, 180s and 300s). Antiviral activity of a gaseous mix-ture containing O3 at 20 and 50 μg /mL was evaluated against the virus to for 30s and 60s. Ozone displayed significant virucidal activity when used at all the tested concentrations whilst signifi-cant antiviral activity was observed using ozone at 50 μg/ml. The gaseous mixture, tested in the present study, showed virucidal and antiviral activity against CpHV-1 with a dose- and a time-contact -dependent fashion. Ozone therapy could be evaluated in vivo for the treatment of CpHV-1-induced genital lesions in goats, through topical applications.

This study's main target was to analyze and design rectangular edges supported two ways solid slabs by using ES EN 1992-1-1:2015. Slab design is often carried out either manually or with the use of design and analytic software. The researcher sees that some software cannot accept some countries' standard codes. For example, currently in Ethiopia analysis and design of two-way solid slab is done using readily available Excel sheet template. But working with this might have many problems, firstly the structure that is already analyzed by SAP or SAFE or any other international software application that uses international codes but which cannot design structure using ES EN 1992; for instant euro codes and designed by excel sheet can create failure and uneconomical analysis and design result. In this paper, the slab is designed and analyzed based on the chosen concrete grade, chosen reinforcement bar diameter, chosen steel grade for design and analysis of slabs calculations like load, moment, shear, and deflection checking using the moment coefficient method for analysis and design and Microsoft Visual Basic 2010 for coding. All input values are given by the International Standard units and are also used to represent output values. Using manual calculations delays time and mostly the result is not correct. But using this Computer program can increase computation accuracy and save time. The procedure the researcher followed is, first the manual calculation has been done and then SADSE2021 has been done. The result is that both are 99.9% identical, and the disadvantage of this method is that it cannot be used to determine the detailed drawing.

Expression of Krüppel–like factor 15 (KLF15), a stress induced transcription factor, is induced during bovine herpesvirus 1 (BoHV-1) reactivation from latency, and KLF15 stimulates BoHV-1 replication. Transient transfection studies revealed KLF15 and glucocorticoid receptor (GR) cooperatively transactivate the BoHV-1 immediate early transcription unit 1 (IEtu1), herpes sim-plex virus type 1 (HSV-1) infected cell protein 0 (ICP0), and ICP4 promoter. The IEtu1 promoter drives expression of bICP0 and bICP4, two key BoHV-1 transcriptional regulatory proteins. Based on these studies, we hypothesized infection is a stressful stimulus that increases KLF15 ex-pression and enhances productive infection. New studies demonstrated that silencing KLF15 impaired HSV-1 productive infection and KLF15 steady state protein levels were increased at late stages of productive infection. KLF15 was primarily localized to the nucleus following in-fection of cultured cells with HSV-1, but not BoHV-1. When cells were transfected with a KLF15 promoter construct and then infected with HSV-1, promoter activity was significantly increased. The ICP0 gene and to a lesser extent bICP0 transactivated the KLF15 promoter in the absence of other viral proteins. In contrast, BoHV-1 or HSV-1 encoded VP16 had no effect on KLF15 pro-moter activity. Collectively, these studies revealed HSV-1 and BoHV-1 productive infection in-creased KLF15 steady state protein levels, which correlated with increased virus production.

The present work reports on the calculated electronic and magnetic structure of the binary Co-Ga system at high Co content. β-CoGa adopts a simple cubic CsCl type structure. Well-ordered CoGa does not exhibit collective magnetism but is a paramagnetic, metallic compound. Neither Co nor Ga deficiency induces magnetic order, however, ferromagnetism is observed for Co-Ga anti-site disorder. The magnetic moment per cell increases up to about 1.2 μB in the completely disordered body centered cubic structure. With increasing Co content, Co1+xGa1−x maintains the CsCl type structure and becomes ferromagnetic. Most important, a discontinuity of the magnetic order with composition is observed at about 10% excess Co, where a change from a low magnetic moment state to a high moment state is observed. This is accompanied by a change in the electronic structure and transport properties. The discontinuity is forced by the increasing exchange splitting related to the localized moment of the additional Co atoms that replace Ga. Subsequently, the magnetic moment increases continuously up to 2.5 μB for x=0.6. For x≳0.6, the structure changes to face centered cubic with random site occupation and the magnetic moment further increases. Above the magnetic discontinuity, the Curie temperature increases linearly with the Co content from the onset of ferromagnetism, until it reaches its maximum in pure Co.

First of all the paper presents a solid solution of piezoelectric ceramic that was synthesized according to the general formula Pb(1-x)Srx(Ti0.48Zr0.52)(1-y)NbyO3 with x = 0.05 and y = 0.02, using wet ceramic processing technology and using an oxide mix as prime material. The effects of dopants (Sr2+ and Nb5+) on phase constitution, on microstructure and on the dielectric and piezoelectric properties were determinate. The Zr/Ti ratio was chosen near the morphotropic phase boundary of the PZT system in studied composition. The XRD data revealed that the PZT doped composition had tetragonal perovskite structure. Secondly the paper presents the design of the novel piezo-motor based on a surface wave which translates the linear extension of different piezoelectric segments of a piezoelectric cylinder into a rotational bending movement. This rotational bending of the piezoelectric cylinder is then transformed into a continuous rotation of the rotor through a calculated contact. The design of the motor takes advantage of the high piezoelectric constants of the developed material in an optimal way in order to increase the energetic efficiency. A brief mathematical model of electromechanical answer of piezoelectric materials is presented as it was used in the modeling of the material during the numerical simulations.

Here we draw insights from the latest serendipitous findings made on the opposing roles of a validated drug-target protein Keap1. We weigh up how natural reactive electrophiles and electrophilic small-molecule drugs in clinical use directly impinge on seemingly conflicting, yet both Keap1-electrophile-modification-dependent, cell-survival- vs. cell-death-promoting behaviors. In the process, we convey how understanding reactive chemical-signal regulation at a single-protein-specific level is an enabling necessity in deconstructing otherwise intricate reactive-small-molecule-responsive cellular pathways. We hope this opinion piece further spurs the broader interests of basic and pharmaceutical research communities toward better understanding of molecular mechanisms underpinning reactive small-molecule-regulated signaling subsystems.

Infection with Zika virus (ZIKV), a member of the Flavivirus genus of the Flaviviridae family, typically results in mild self-limited illness, but severe neurological disease occurs in a limited subset of patients. In contrast, serious outcomes commonly occur in pregnancy that affect the developing fetus, including microcephaly and other major birth defects. The genetic similarity of ZIKV to other widespread flaviviruses, such as dengue virus (DENV), presents a challenge to the development of specific ZIKV diagnostic assays. Nonstructural protein 1 (NS1) is established for use in immunodiagnostic assays for flaviviruses. To address the cross-reactivity of ZIKV NS1 with proteins from other flaviviruses we used site-directed mutagenesis to modified putative epitopes. Goat polyclonal antibodies to variant ZIKV NS1 were affinity-purified to remove antibodies binding to the closely related NS1 protein of DENV. An antigen-capture ELISA configured with the affinity-purified polyclonal antibody showed a linear dynamic range between approximately 500 to 30 ng/mL, with a limit of detection of between 1.95 and 7.8 ng/mL. NS1 proteins from DENV, yellow fever virus, St. Louis encephalitis virus and West Nile virus showed significantly reduced reactivity in the ZIKV antigen-capture ELISA. Refinement of approaches similar to those employed here could lead to development of ZIKV-specific immunoassays suitable for use in areas where infections with related flaviviruses are common.

HIV-1 Tat protein interacts with TAR RNA and recruits CDK9/cyclin T1 and other host factors to induce HIV-1 transcription. Thus Tat-TAR RNA interaction, which is unique for HIV-1, represents an attractive target for anti-HIV-1 therapeutics. To target Tat-TAR RNA interaction, we used a crystal structure of TAR RNA with acetylpromazine bound to the bulge of TAR RNA, to dock compounds from Enamine database containing 1.6 million individual compounds. Docking identified 173 compounds that were analyzed for the inhibition of HIV-1 infection. Top ten inhibitory compounds with IC50 ≤ 6 µM were selected and the three least toxic compounds, T6780107 (IC50=2.97 μM), T0516-4834 (IC50=0.2 μM) and T5628834 (IC50=3.46 μM), were further tested for HIV-1 transcription inhibition. Only T0516-4834 compound showed selective inhibition of Tat-induced HIV-1 transcription, whereas T6780107 compound inhibited equally basal and Tat-induced transcription and T5628834 compound only inhibited basal HIV-1 transcription. The T0516-4834 compound also showed strongest inhibition of HIV-1 gag RNA expression and p24 production in CEM T cells infected with HIV-1 IIIB. Of the three compounds, only the T0516-4834 compound disrupted Tat-TAR RNA interaction indicating that it might target TAR RNA. Also, of the three tested compounds, T5628834 but not T6780107 or T0516-4834 disrupted Tat-CDK9/cyclin T1 interaction. Taken together, our study identified novel compound T0516-4834 that disrupted Tat-TAR RNA interaction and inhibited Tat-induced transcription and HIV-1 infection suggesting that this compound might serve as a new lead for anti-HIV-1 therapeutics.

AbstractBackground: The World Health Organization (WHO) said the situation in India was a "devastating reminder" of what the coronavirus could do. COVID-19 cases suddenly spiked across India. Union Health Minister Harsh Vardhan has said that one of the major reasons for the spike in coronavirus cases was people not following COVID-appropriate behaviour. The Union minister noted that the sudden rise in cases is largely or maybe event-driven comprising local body elections, grand weddings, and farmers' protest. These events may cause asymptomatic covid-19 carriers to spread wide covid-19 to others. Malaysia is also facing a surge in Covid-19 may due to the spread of covid-19 by asymptomatic covid-19 carriers. Therefore, it is important to develop an application that can publicize information on asymptomatic covid-19 carriers. The purpose of this application is to provide sufficient information and scientific research evidence to ensure that prevention strategies for asymptomatic covid-19 carriers must be implemented. The app is also open to anyone who uses it to educate others so that information can be shared more quickly to prevent other countries from becoming "Second India or Malaysia".Method: The homepage of the app shows that asymptomatic covid-19 carriers may have a lower viral load, the same viral load, or a higher viral load than symptomatic covid-19 carriers. When the user app is pressed by each category, they will see sufficient information and scientifically based research evidence about each category. These apps also show the evidence that on January 13, 2021 - Malaysian Health Department Director Dr Noor Hisham Abdullah instructs test Only those Close Contacts With Symptoms and The Malaysian Medical Association (MMA) has urged the Health Ministry to urgently improve the management of mild Covid-19 cases and revert to its policy of testing all close contacts. In addition, These apps also show App raise public awareness of the importance of COVID-19 vaccination(version 4) [Peter Chew, 2021] can intuitively see that countries with high vaccination rates can solve the problem of asymptomatic transmission of covid-19 carriers.Result: This application displays sufficient information and scientifically based research evidence to prove asymptomatic covid-19 carriers are the main key to the outbreak of covid-19. Some countries are using covid-19 symptom prevention strategies. They are only testing the symptomatic closed contact of covid-19 patients, because they may think that asymptomatic covid-19 carrier is just a low viral load and a low transmission rate, which is wrong. Some asymptomatic covid-19 carriers of covid-19 have high viral loads. The accumulation of asymptomatic covid-19 carriers with high viral load is the main cause of the covid-19 outbreak. Conclusion: Three apps have been developed to educate the public about the importance of asymptomatic covid-19 carriers. The asymptomatic covid-19 carrier education app (1) will provide sufficient information and scientific research evidence to educate citizens of any country to ensure that preventive strategies must be implemented for asymptomatic carriers to prevent the country’s Covid-19 outbreak. App, Game Base Learning to Prevent Infection from COVID-19 (version 3) [Peter Chew, 2020 ]. The app allows anyone to intuitively see that when the second wave covid-19 arrives, the accumulation of a large number of asymptomatic carriers in some countries has led to the high infection rate of covid-19. This is what is happening in India now. App raise public awareness of the importance of COVID-19 vaccination(version 4) can intuitively see that countries with high vaccination rates can solve the problem of asymptomatic transmission of covid-19 carriers. This is what is happening in Israel now.

The quantitative and qualitative assessment of gold grains from samples of glacial till is a well-established method for exploring gold deposits hidden under glaciated cover. This method, widely used by the industry and which produced numerous successes in locating gold deposits in glaciated terrain, is still based on artisanal gravity separation techniques and visual identification. However, being artisanal, it is limited by inconsistent recoveries and the difficulty to visually identify the predominantly occurring small gold grains. These limitations hinder its capability to deceipher subtle or complex signal. To improve detection limits through recovery of small gold grains, a new approach has recently been introduced in the industry (commercially referred as “ARTGold” procedure) using an optimized miniature sluice box coupled with an automated scanning electron microscopy routine. The capabilities of this improved method are highlighted by comparing till surveys conducted around the Borden gold deposit (Ontario, Canada) using the conventional and improved methods at both local and regional scales. Relative to the conventional approach, the improved method recovered almost one order of magnitude more gold grains from samples (regional and down-ice mineralization), dominantly in small size fractions. Increasing the counts in low-abundance regional samples enables better discrimination between background signals and significant dispersions. The method offers an alternative to improve characterization of gold dispersal in glaciated terrain and the related gold deposit footprints.

Skin involvement is an overlooked aspect in the management of paediatric patients with type 1 diabetes. A comprehensive search of published literature using the PubMed database was carried out using the following key terms: “children”, “pediatric/paediatric patients”, “skin”, “skin disorders”, “type 1 diabetes”. Dermatological side effects are frequently observed among diabetic children and adolescents. Insulin-induced lipodystrophies and allergic contact dermatitis caused by insulin pumps or glycaemic sensors are the most common skin reactions in these patients. Furthermore, several diabetes-associated skin diseases such as necrobiosis lipoidica, granuloma annulare, vitiligo, and bullosis diabeticorum may already be present in paediatric age. Paediatric diabetes specialists should pay attention to their patients’ skin so as to recognize these disorders, identify the potential causes, and choose the most suitable treatment. Finally, the evaluation of skin concentrations of advanced glycation end-products using non-invasive diagnostic techniques may be used to assess the risk of chronic complications of diabetes as early as adolescence.

Astronauts at are risk of losing 1.0 – 1.5% of their bone mass for every month they spend in space despite their adherence to high impact exercise training programs designed to preserve the musculoskeletal system. This article reviews the basics of bone formation and resorption and details how exposure to microgravity or simulated microgravity affects the structure and function of osteoblasts, osteocytes, osteoclasts, and their mesenchymal and hematologic stem cell precursors. It details the critical roles that insulin-like growth facor-1 and its receptor IGFR1 play in maintaining bone homeostasis and how exposure of bone cells to microgravity affects the function of these growth factors. Lastly, it discusses the potential of tumor necrosis factor-related apoptosis-inducing ligand, syncytin-A, and sclerostin inhibitors and recombinant IGF-1 as a bone-saving treatment for astronauts in space and during their colonization of the Moon.