Distance compatible set-labeling of a graph G is an injective setassignment f : V (G) → 2X , X a nonempty ground set, such that the corresponding induced function f⊕ : V (G)×V (G) → 2X −{∅}, defined by f⊕(u, v) = f(u) ⊕ f(v) satisfies | f⊕(u, v) |= k (u,v) d(u, v) for all distinct u, v ∈ V (G), where d(u, v) is the distance between u and v, and k (u,v) is a constant, not necessarily an integer;...

Artificial Intelligence deals with the automated simulation of human intelligent behavior. Various aspects of human faculties are tackled using computational models. It is clear that brain as a cognitive machine is significantly different from a computer. A general intelligent machine needs to incorporate primitives that are identical or similar to those intrinsic to human. We argue for the ide...

We consider quasi-martingales indexed by a linearly order set. We show that such processes are isomorphic to a given class of (finitely additive) measures. From this result we easily derive the classical theorem of Stricker as well as the decompositions of Riesz, Rao and the supermartingale decomposition of Doob and Meyer.

Let G be a graph with its vertices and edges. On defining bijective function ρ:V(G) →{0,1,...,p}. For each edge assign the label 1 if ρ*(ab)= | ρ(a) 2 −ρ(b) /ρ(a)−ρ(b) is odd or 0 otherwise such that |eρ(1) − eρ(0)| ≤ then labeling called as divided square difference cordial graph. We prove in this paper for relatively possible set of spider graphs atmost one legs greater than namely J(SP(1 m ,...

the purpose of this article is to test whether the stock price index of the tehran stock exchange is located in the efficeent set of portfolios or not. in this paper the mehtod introduced by elton, gruber and padberg was used to determine the efficiency of the tse stock price index. the results showed that the tse index is not located in the efficient set.