Trees with equal global offensive k-alliance and k-domination numbers
Let \(k \geq 1\) be an integer. A set \(S\) of vertices of a graph \(G = (V(G),E(G))\) is called a global offensive \(k\)-alliance if \(|N(v) \cap S| \geq |N(v) - S| + k\) for every \(v \in V(G)- S\), where \(N(v)\) is the neighborhood of \(v\). The subset \(S\) is a \(k\)-dominating set of \(G\) if...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
AGH Univeristy of Science and Technology Press
2010-01-01
|
| Series: | Opuscula Mathematica |
| Subjects: | |
| Online Access: | http://www.opuscula.agh.edu.pl/vol30/3/art/opuscula_math_3018.pdf |