1 research outputs found
Global Defensive Alliances in the Lexicographic Product of Paths and Cycles
A set of vertices of graph is a \textit{defensive alliance} of if
for every , it holds . An alliance is
called if it is also a dominating set. In this paper, we determine the
exact values of the global defensive alliance number of lexicographic products
of path and cycles.Comment: 25 pages, 12 table