A note on k-Roman graphs
Let \(G=\left(V,E\right)\) be a graph and let \(k\) be a positive integer. A subset \(D\) of \(V\left( G\right) \) is a \(k\)-dominating set of \(G\) if every vertex in \(V\left( G\right) \backslash D\) has at least \(k\) neighbours in \(D\). The \(k\)-domination number \(\gamma_{k}(G)\) is the min...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
AGH Univeristy of Science and Technology Press
2013-01-01
|
| Series: | Opuscula Mathematica |
| Subjects: | |
| Online Access: | http://www.opuscula.agh.edu.pl/vol33/4/art/opuscula_math_3335.pdf |