Trees with unique minimum glolal offensive alliance sets

Mohamed Bouzefrane, Isma Bouchemakh, Mohamed Zamime +1

Let $G=$ $\left(V,E\right)$ be a simple graph.\ A non-empty set $S\subseteq V$ is called a global offensive alliance if $S$ is a dominating set and for every vertex $v$ in $V-S$…