An exponential dominating set of graph $G = (V,E )$ is a subset $Ssubseteq V(G)$ such that $sum_{uin S}(1/2)^{overline{d}{(u,v)-1}}geq 1$ for every vertex $v$ in $V(G)-S$, where $overline{d}(u,v)$ is the distance between vertices $u in S$ and $v  in V(G)-S$ in the graph $G -(S-{u})$. The exponential domination number, $gamma_{e}(G)$, is the smallest cardinality of an exponential dominating set....

‎we present a characterization of arens regular semigroup algebras‎ ‎$ell^1(s)$‎, ‎for a large class of semigroups‎. ‎mainly‎, ‎we show that‎ ‎if the set of idempotents of an inverse semigroup $s$ is finite‎, ‎then $ell^1(s)$ is arens regular if and only if $s$ is finite‎.

A defensive alliance in a graph is a set $S$ of vertices with the property that every vertex in $S$ has at most one moreneighbor outside of $S$ than it has inside of $S$. A defensive alliance $S$ is called global if it forms a dominating set. The global defensive alliance number of a graph $G$ is the minimum cardinality of a global defensive alliance in $G$. In this article we study the global ...

Let S be a semigroup with a left multiplier  on S. A new product on S is defined by  related to S and  such that S and the new semigroup ST have the same underlying set as S. It is shown that if  is injective then where, is the extension of  on  Also, we show that if  is bijective then is amenable if and only if is so. Moreover, if  S completely regular, then is weakly amenable.