A note on the p-domination number of trees
Let \(p\) be a positive integer and \(G =(V(G),E(G))\) a graph. A \(p\)-dominating set of \(G\) is a subset \(S\) of \(V(G)\) such that every vertex not in \(S\) is dominated by at least \(p\) vertices in \(S\). The \(p\)-domination number \(\gamma_p(G)\) is the minimum cardinality among the \(p\)-d...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
AGH Univeristy of Science and Technology Press
2009-01-01
|
| Series: | Opuscula Mathematica |
| Subjects: | |
| Online Access: | http://www.opuscula.agh.edu.pl/vol29/2/art/opuscula_math_2914.pdf |