Complexity of Computation of Dominating Sets in Geo-Mathmetics Algorithm : A Review
In this paper, the complexity on dominating sets of the graph is suppose the G = (V, E) is a subset D of V each head not in D is adjacent to one member on the dominating number γ (G) is the number of vertices in the smallest dominant sets of G. The dominant sets problem by testing whether γ (G) ≤...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Qubahan
2021-02-01
|
| Series: | Qubahan Academic Journal |
| Subjects: | |
| Online Access: | https://journal.qubahan.com/index.php/qaj/article/view/41 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!