Secure paired domination in graphs
This thesis introduces a new strategy of defending the vertices of a graph - secure paired domination, where guards are required to be paired and, when a vertex is attacked, one or two guards move to defend the attacked vertex, while keeping the graph dominated and the guards paired after the mov...
| Main Author: | |
|---|---|
| Other Authors: | |
| Language: | English en |
| Published: |
2010
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1828/3015 |