JavaScript is disabled for your browser. Some features of this site may not work without it.
| dc.contributor.author | S. K., Vaidya | |
| dc.contributor.author | Ajani, P. D. | |
| dc.date.accessioned | 2024-11-21T06:02:45Z | |
| dc.date.available | 2024-11-21T06:02:45Z | |
| dc.date.issued | 219 | |
| dc.identifier.citation | Vaidya, S. K., & Ajani, P. D. (2019). On restrained domination number of some wheel related graphs. Malaya Journal of Matematik, 7(01), 104-107. | en_US |
| dc.identifier.uri | http://10.9.150.37:8080/dspace//handle/atmiyauni/1826 | |
| dc.description.abstract | For a graph G = (V, E), a set S ⊆ V is a restrained dominating set if every vertex not in S is adjacent to a vertex in S and also to a vertex in V − S. The minimum cardinality of a restrained dominating set of G is called restrained domination number of G, denoted by γr(G). We investigate restrained domination number of some wheel related graphs. | en_US |
| dc.language.iso | en | en_US |
| dc.publisher | Malaya Journal of Matematik | en_US |
| dc.subject | Dominating set | en_US |
| dc.subject | restrained dominating set | en_US |
| dc.subject | restrained domination number | en_US |
| dc.title | On restrained domination number of some wheel related graphs | en_US |
| dc.type | Article | en_US |
