Global offensive k-alliance in bipartite graphs
Let \(k \geq 0\) 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) \cap S|+k\) for every \(v \in V(G)-S\), where \(0 \leq k \leq \Delta\) and \(\Delta\) is the maximum degree of \(G\). The global offensive \(...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
AGH Univeristy of Science and Technology Press
2012-01-01
|
| Series: | Opuscula Mathematica |
| Subjects: | |
| Online Access: | http://www.opuscula.agh.edu.pl/vol32/1/art/opuscula_math_3207.pdf |