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 a previous paper, the second author established that, given finite fields $f < e$ and certain subgroups $c leq e^times$, there is a galois connection between the intermediate field lattice ${l mid f leq l leq e}$ and $c$'s subgroup lattice. based on the galois connection, the paper then calculated the irreducible, complex character degrees of the semi-direct product $c rtimes {rm gal} (e/f)$...

introduction: the aim of this work was to evaluate the effects of four different concentrations of aloe vera extract on healing of second degree burns in male wistar rats. materials and methods: by an experimental study 42 male wistar rats were divided into 7 equal groups. the burn injury was made on the back of all rats, according to standard methods. the burned areas in the group1: were left ...

the total version of geometric–arithmetic index of graphs is introduced based on the endvertexdegrees of edges of their total graphs. in this paper, beside of computing the total gaindex for some graphs, its some properties especially lower and upper bounds are obtained.

the purpose of this study was to determ the degree, level and capacity indices of agricultural mechanization in sarab region (n: 37º45', e: 47º30') in eastern azarbayjan province, comprising about 65,164 hectares of farming land. the number of tractors, types of machines, and degree, level, and capacity of mechanization were calculated as the method of study. data showed that the average level ...

We introduce a natural strengthening of prompt simplicity which we call strong promptness, and study its relationship with existing lowness classes. This notion provides a ≤wtt version of superlow cuppability. We show that every strongly prompt c.e. set is superlow cuppable. Unfortunately, strong promptness is not a Turing degree notion, and so cannot characterize the sets which are superlow cu...