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 Independent Domination in Some Classes of Graphs
2008
Electronic Journal of Combinatorics
A dominating set $S$ of a graph $G$ is a global (strong) defensive alliance if for every vertex $v\in S$, the number of neighbors $v$ has in $S$ plus one is at least (greater than) the number of neighbors it has in $V\setminus S$. The dominating set $S$ is a global (strong) offensive alliance if for every vertex $v\in V\setminus S$, the number of neighbors $v$ has in $S$ is at least (greater than) the number of neighbors it has in $V\setminus S$ plus one. The minimum cardinality of a global
doi:10.37236/847
fatcat:tffdj7juxfdenmrlfmbvrkfq6m