A note on global alliances in trees
For a graph \(G=(V,E)\), a set \(S\subseteq V\) is a dominating set if every vertex in \(V-S\) has at least a neighbor in \(S\). A dominating set \(S\) is a global offensive (respectively, defensive) alliance if for each vertex in \(V-S\) (respectively, in \(S\)) at least half the vertices from the...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
AGH Univeristy of Science and Technology Press
2011-01-01
|
| Series: | Opuscula Mathematica |
| Subjects: | |
| Online Access: | http://www.opuscula.agh.edu.pl/vol31/2/art/opuscula_math_3111.pdf |