A global offensive alliance in a graph G is a set S of vertices with the property that every vertex not belonging to S has at least one more neighbor in S ...

Apr 2, 2012 · In this work we obtain closed formulas for the global offensive alliance number of several families of Cartesian product graphs.

A global offensive alliance in a graph $G$ is a set $S$ of vertices with the property that every vertex not belonging to $S$ has at least one more neighbor ...

A defensive alliance in a graph is a set $S$ of vertices with the property that every vertex in $S$ has at most one moreneighbor outside of $S$ than it has ...

Jul 25, 2012 · Abstract. A global offensive alliance in a graph G is a set S of vertices with the property that every vertex not belonging to S has ...

Jan 1, 2013 · In this work we obtain closed formulas for the global offensive alliance number of several families of Cartesian product graphs, we also prove ...

Computing global offensive alliances in Cartesian product graphs. Yero, I.G.; Rodríguez-Velázquez, J.A.. Discrete Applied Mathematics 161(1-2): 284-293.

Oct 22, 2024 · We investigate the relationship between global offensive k-alliances and some characteristic sets of a graph including r-dependent sets, ...

In this work we obtain closed formulas for the global offensive alliance number of several families of Cartesian product graphs, we also prove that γo(G□H)≥γ(G) ...

Computing global offensive alliances in Cartesian product graphs. A global offensive alliance in a graph G is a set S of vertices with the property that ...