Partitioning a graph into offensive k-alliances


A defensive k-alliance in a graph is a set S of vertices with the property that every vertex in S has at least k more neighbors in S than it has outside of S. A defensive k-alliance S is called global if it forms a dominating set. In this paper we study the problem of partitioning the vertex set of a graph into (global) defensive k-alliances. The (global… (More)
DOI: 10.1016/j.dam.2010.11.005


  • Presentations referencing similar topics