JavaScript is disabled for your browser. Some features of this site may not work without it.
| dc.contributor.author | Vaidya, S.K. | |
| dc.contributor.author | Ajani, P.D. | |
| dc.date.accessioned | 2023-05-01T06:23:15Z | |
| dc.date.available | 2023-05-01T06:23:15Z | |
| dc.date.issued | 2018 | |
| dc.identifier.citation | Vaidya, S. K., & Ajani, P. D. (2018). On restrained domination number of graphs. International Journal of Mathematics and Soft Computing, 8(1), 17-23.https://doi.org/10.26708/IJMSC.2018.1.8.03 | en_US |
| dc.identifier.issn | 2319-5215 | |
| dc.identifier.uri | http://10.9.150.37:8080/dspace//handle/atmiyauni/826 | |
| 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 to a vertex in V − S. The smallest 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 cycle related graphs which are obtained by means of various graph operations on cycle | en_US |
| dc.language.iso | en | en_US |
| dc.publisher | International Journal of Mathematics and Soft Computing | en_US |
| dc.subject | Dominating set | en_US |
| dc.subject | Restrained dominating set | en_US |
| dc.subject | Restrained dominating number | en_US |
| dc.title | On restrained domination number of graphs | en_US |
| dc.type | Article | en_US |
