Loss Set A Set A Set A Set A Investment Set B Set B Set B Set B Insurance Set B Set B Set B Set B Furthermore, the subjects face four different types of information in both decision frames and treatments. The ‘precise’ information frame has exact probabilities and exact payments stated. In the ‘ambiguity in probability’ frames, the probability is stated as a range and the payment is fixed. Conv...

in this paper, we introduce λκ−closed sets and study its properties in generalized topological spaces.

The interaction between sodium and calcium, magnesium and calcium and the combined effect of sodium, magnesium and calcium was observed on the growth and ion uptake of Hippophae rhamnoides L. The results demonstrated that an addition of sodium with calcium, (set a, Na 2.5 + Ca 5 mM) showed prominent increase in fresh weight of roots and shoots. The dry weight (average) of roots decreased an...

Let $G$ be a finite group. The graph $D(G)$ is a divisibility graph of $G$. Its vertex set is the non-central conjugacy class sizes of $G$ and there is an edge between vertices $a$ and $b$ if and only if $a|b$ or $b|a$. In this paper, we investigate the structure of the divisibility graph $D(G)$ for a non-solvable group with $sigma^{ast}(G)=2$, a finite simple group $G$ that satisfies the one-p...

The increasing complexity of construction, along with its rapid development, as well as ambiguities and gaps in the legal terms governing constructions, lack of trust in the parties regarding obligations and regulations are the main reasons of disagreements in domestic projects. These disagreements are inevitable even in contracts which are set correctly. Disagreements are costly, time-consumin...

In this article, we have shown, for the add-point monad T, thepartial morphism category Set*is isomorphic to the Kleisli category SetT. Alsowe have proved that the category, SetT, of T-algebras is isomorphic to thecategory Set of pointed sets. Finally we have established commutative squaresinvolving these categories.

Let $G=(V,E)$ be a simple graph. A set $Dsubseteq V$ is adominating set of $G$ if every vertex in $Vsetminus D$ has atleast one neighbor in $D$. The distance $d_G(u,v)$ between twovertices $u$ and $v$ is the length of a shortest $(u,v)$-path in$G$. An $(u,v)$-path of length $d_G(u,v)$ is called an$(u,v)$-geodesic. A set $Xsubseteq V$ is convex in $G$ ifvertices from all $(a, b)$-geodesics belon...