A defensive alliance in a graph is a set $S$ of vertices with the property that every vertex in $S$ has at most one more neighbor 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 defensive alliances in Cartesian product graphs, strong product graphs and direct product graphs. Specifically we give several bounds for the global defensive alliance number of these graph products and express them in terms of the global defensive alliance numbers of the factor graphs.
Gonzalez Yero, I., Jakovac, M., Kuziak, D. (2017). On global (strong) defensive alliances in some product graphs. Communications in Combinatorics and Optimization, 2(1), 21-33. doi: 10.22049/cco.2017.13595
MLA
Ismael Gonzalez Yero; Marko Jakovac; Dorota Kuziak. "On global (strong) defensive alliances in some product graphs". Communications in Combinatorics and Optimization, 2, 1, 2017, 21-33. doi: 10.22049/cco.2017.13595
HARVARD
Gonzalez Yero, I., Jakovac, M., Kuziak, D. (2017). 'On global (strong) defensive alliances in some product graphs', Communications in Combinatorics and Optimization, 2(1), pp. 21-33. doi: 10.22049/cco.2017.13595
VANCOUVER
Gonzalez Yero, I., Jakovac, M., Kuziak, D. On global (strong) defensive alliances in some product graphs. Communications in Combinatorics and Optimization, 2017; 2(1): 21-33. doi: 10.22049/cco.2017.13595
)