let c be a field of subsets of a set i. also, let     1 i i be a non-decreasing positivesequence of real numbers such that 1, 1 0 1   i  and    11 i i . in this paper we prove thatbv of all the games of -bounded variation on c is a non-separable and norm dual banach space of thespace of simple games on c . we use this fact to establish the existence of a linear mapping t from...

a set $s$ of vertices in a graph $g$ is a dominating set if every vertex of $v-s$ is adjacent to some vertex in $s$. the domination number $gamma(g)$ is the minimum cardinality of a dominating set in $g$. the annihilation number $a(g)$ is the largest integer $k$ such that the sum of the first $k$ terms of the non-decreasing degree sequence of $g$ is at most the number of edges in $g$. in this p...

we denote by $ls[n](t,k,v)$ a large set of $t$-$(v,k,lambda)$ designs of size $n$, which is a partition of all  $k$-subsets ofa $v$-set into $n$ disjoint  $t$-$(v,k,lambda)$ designs and$n={v-t choose k-t}/lambda$.   we use the notation$n(t,v,k,lambda)$ as the maximum possible number of mutuallydisjoint cyclic $t$-$(v,k,lambda)$designs. in this paper we givesome new bounds for $n(2,29,4,3)$ and ...

the degree set of a graph is the set of its degrees. kapoor et al. [degree sets for graphs, fund. math. 95 (1977) 189-194] proved that for every set of positive integers, there exists a graph of diameter at most two and radius one with that degree set. furthermore, the minimum order of such a graph is determined. a graph is 2-self- centered if its radius and diameter are two. in this paper for ...

in this paper, we consider the production possibility set with n production units such that the following four principles that governs: inclusion observations, conceivability, immensity and convexity. our goal is to estimate the output of a same and new production unit with existing production possibility and amount of input is specified. so, initially we find the interval changes of each input...

let $g=(v,e)$ be a connected simple graph. a labeling $f:v to z_2$ induces two edge labelings $f^+, f^*: e to z_2$ defined by $f^+(xy) = f(x)+f(y)$ and $f^*(xy) = f(x)f(y)$ for each $xy in e$. for $i in z_2$, let $v_f(i) = |f^{-1}(i)|$, $e_{f^+}(i) = |(f^{+})^{-1}(i)|$ and $e_{f^*}(i) = |(f^*)^{-1}(i)|$. a labeling $f$ is called friendly if $|v_f(1)-v_f(0)| le 1$. for a friendly labeling $f$ of...

0

in this paper, we study the existence of generalized solutions for the infinite dimensional nonlinear stochastic differential inclusions $dx(t) in f(t,x(t))dt +g(t,x(t))dw_t$ in which the multifunction $f$ is semimonotone and hemicontinuous and the operator-valued multifunction $g$ satisfies a lipschitz condition. we define the it^{o} stochastic integral of operator set-valued stochastic pr...

in this paper, the concept of countably near ps-compactness inl-topological spaces is introduced, where l is a completely distributive latticewith an order-reversing involution. countably near ps-compactness is definedfor arbitrary l-subsets and some of its fundamental properties are studied.