Global r-alliances and total domination

• Characterized by the vertices in their neighborhood outside of the alliance,written as ∂OA := N[OA] \ OA.• Every such vertex has at least as many bonds to members in the alliancethan to non-members (including itself).• An offensive alliance can attack every neighbor successfully.• graph-theoretic notation: OA ⊆ V , such that for every v ∈ ∂OA: |N

[1]  Michael R. Fellows,et al.  Parameterized Complexity , 1998 .

[2]  Wayne Goddard,et al.  Offensive alliances in graphs , 2004, Discuss. Math. Graph Theory.

[3]  Henning Fernau,et al.  Alliances in Graphs: a Complexity-Theoretic Study , 2007, SOFSEM.

[4]  Frank Harary,et al.  Double Domination in Graphs , 2000, Ars Comb..

[5]  Michael A. Henning,et al.  Global Defensive Alliances in Graphs , 2003, Electron. J. Comb..

[6]  Stephen T. Hedetniemi,et al.  Total domination in graphs , 1980, Networks.

[7]  Juan A. Rodríguez-Velázquez,et al.  Spectral study of alliances in graphs , 2007, Discuss. Math. Graph Theory.