‎a set $s$ of vertices of a graph $g=(v,e)$ without isolated vertex‎ ‎is a {em total dominating set} if every vertex of $v(g)$ is‎ ‎adjacent to some vertex in $s$‎. ‎the {em total domatic number} of‎ ‎a graph $g$ is the maximum number of total dominating sets into‎ ‎which the vertex set of $g$ can be partitioned‎. ‎we show that the‎ ‎total domatic number of a random $r$-regular graph is almost‎...

solid lipid nanoparticles (slns) have emerged as an alternative colloidal carriers for sustained release of lipophilic drugs with poor absorption and water solubility. this manuscript describes the effect of process variables on the production of solid lipid nanoparticles (slns) from beeswax and carnauba wax and ketoprofen release from these carriers. it was found that by increasing drug conten...

Let G be an abelian group. We prove that a group G admits a Hausdorff group topology τ such that the von Neumann radical n(G, τ) of (G, τ) is non-trivial and finite iff G has a non-trivial finite subgroup. If G is a topological group, then n(n(G)) 6= n(G) if and only if n(G) is not dually embedded. In particular, n(n(Z, τ)) = n(Z, τ) for any Hausdorff group topology τ on Z. We shall write our a...

Let X be an in®nite, locally ®nite, almost transitive graph with polynomial growth. We show that such a graph X is the inverse limit of an in®nite sequence of ®nite graphs satisfying growth conditions which are closely related to growth properties of the in®nite graph X. 1991 Mathematics Subject Classi®cation. Primary 05C25, Secondary 20F18 1. Introduction and statement of main result. We think...