A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Global alliances and independence in trees

2007
*
Discussiones Mathematicae Graph Theory
*

A global defensive (respectively, offensive) alliance in a graph G = (V, E) is a set of vertices S ⊆ V with the properties that every vertex in V − S has at least one neighbor in S, and for each vertex v in S (respectively, in V − S) at least half the vertices from the closed neighborhood of v are in S. These alliances are called strong if a strict majority of vertices from the closed neighborhood of v must be in S. For each kind of alliance, the associated parameter is the minimum cardinality

doi:10.7151/dmgt.1340
fatcat:l4mze3qe2vb27hef4qkojpawyi