Disjoint Secure Domination in the Join of Graphs
Let G = (V(G),E(G)) be a simple connected graph. A dominating set S in G is called a secure dominating set in G if for every u ∈ V (G) \ S, there exists v ∈ S ∩ NG(u) such that (S \ {v}) ∪ {u} is a dominating set. The minimum cardinality of secure dominating set is called the secure domination numbe...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Center for Policy, Research and Development Studies
2016-12-01
|
| Series: | Recoletos Multidisciplinary Research Journal |
| Subjects: | |
| Online Access: | https://rmrj.usjr.edu.ph/rmrj/index.php/RMRJ/article/view/162 |