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 a graph g = (v,e), a subset s  v is said to be an open packing set if no two vertices of s have a common neighbour in g. the maximum cardinality of an open packing set is called the open packing number and is denoted by rho^o. this paper further studies on this parameter by obtaining some new bounds.

In [BN] the authors construct a special complex of degree 20 over M , which for an open three dimensional set parametrizes smooth complex surfaces of degree four invariant which are Heisenberg invariant, and each member of the family contains 32 lines but only 16 skew lines. The coordinates of the lines however need not be real. For a point l in a Zariski open set of M an algorithm is presented...

an equitable domination has interesting application in the contextof social networks. in a network, nodes with nearly equal capacitymay interact with each other in a better way. in the societypersons with nearly equal status, tend to be friendly. in thispaper, we introduce new variant of equitable domination of agraph. basic properties and some interesting results have beenobtained.

In this paper, using pre-semi-open L-sets and their inequality, a new notion of PS-compactness is introduced in L-topological spaces, where L is a complete De Morgan algebra. This notion does not depend on the structure of the basis lattice L and L does not need any distributivity.

in this paper, we introduce fuzzy banach algebra and study the properties of invertible elements and its relation with opensets. we obtain some interesting results.

The IP3R calcium release channel has been simulated using a stochastic simulation algorithm (SSA;Gillespie algorithm) and De young-Keiser model. A set of different concentration for Cat' and IP3 havebeen used. Considering the Number of molecules in each state, a non linear behavior of the system can beseen clearly. The inhibiting role of the Ca+2 on the open state (X110) has been studied. The d...

Let T be an n-node tree of maximum degree 4, and let P be a set of n points in the plane with no two points on the same horizontal or vertical line. It is an open question whether T always has a planar drawing on P such that each edge is drawn as an orthogonal path with one bend (an “L-shaped” edge). By giving new methods for drawing trees, we improve the bounds on the size of the point set P f...

a {em 2-rainbow dominating function} (2rdf) of a graph $g$ is a function $f$ from the vertex set $v(g)$ to the set of all subsets of the set ${1,2}$ such that for any vertex $vin v(g)$ with $f(v)=emptyset$ the condition $bigcup_{uin n(v)}f(u)={1,2}$ is fulfilled, where $n(v)$ is the open neighborhood of $v$. the {em weight} of a 2rdf $f$ is the value $omega(f)=sum_{vin v}|f (v)|$. the {em $2$-r...