Search results for: STRATEGIC BALANCE

• Strategic balance in graphs

  Publication

  • R. Lewoń
  • A. Małafiejska
  • M. Małafiejski

  - DISCRETE MATHEMATICS - Year 2016

  For a given graph G, a nonempty subset S contained in V ( G ) is an alliance iff for each vertex v ∈ S there are at least as many vertices from the closed neighbourhood of v in S as in V ( G ) − S. An alliance is global if it is also a dominating set of G. The alliance partition number of G was defined in Hedetniemi et al. (2004) to be the maximum number of sets in a partition of V ( G ) such that each set is an alliance. Similarly,...

  Full text available to download