Inverse Clique Domination in Graphs
Let G be a connected simple graph. A nonempty subset S of the vertex set V (G) is a clique in G if the graph <S> induced by S is complete. A clique S in G is a clique dominating set if it is a dominating set. Let C be a minimum clique dominating set in G. The clique dominating set S⊆V(G)\C...
| 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/163 |