For a graph $G=(V,E)$, a set $D\subseteq V$ is a dominating set if every vertex in $V-D$ is either in $D$ or has a neighbor in $D$. A dominating set $D$ is a global offensive alliance (resp. a global defensive alliance) if for each vertex $v$ in $V-D$ (resp. $v$ in $D$) at least half the vertices from the closed neighborhood of $v$ are in $D$. A global powerful alliance is both global defensive and global offensive.
The global powerful alliance number $\gamma_{pa}(G)$ is the minimum cardinality of a global powerful alliance of $G$. We show that if $T$ is a tree of order $n$ with $l$ leaves and $s$ support vertices, then $\gamma_{pa}(T)\geq\frac{3n-2l-s+2}{5}$. Moreover, we provide a constructive characterization of all extremal trees attaining this bound.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.