Global Defensive Alliances in the Lexicographic Product of Paths and Cycles

Rommel M. Barbosa, Mitre C. Dourado, Leila R. S. da Silva

A set $S$ of vertices of graph $G$ is a \textit{defensive alliance} of $G$ if for every $v\in S$, it holds $|N[v]\cap S|\ge |N[v]-S|$. An alliance $S$ is called $global$ if it…