A note on a relation between the weak and strong domination numbers of a graph
In a graph \(G=(V,E)\) a vertex is said to dominate itself and all its neighbors. A set \(D \subset V\) is a weak (strong, respectively) dominating set of \(G\) if every vertex \(v \in V-S\) is adjacent to a vertex \(u \in D\) such that \(d_G(v) \geq d_G(u)\) (\(d_G(v) \leq d_G(u)\), respectively)....
| 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/2/art/opuscula_math_3218.pdf |