On the Domination Numbers of Certain Prism Graphs
A dominating set S of a graph , is a subset of the vertex set V (G) such that any vertex not in S is adjacent to at least one vertex in S .The domination number of a graph G denoted by is the minimum size of the dominating sets of G. In this paper we introduced the domination numbers of certain...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Tikrit University
2022-12-01
|
| Series: | Tikrit Journal of Pure Science |
| Subjects: | |
| Online Access: | https://tjpsj.org/index.php/tjps/article/view/85 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|