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 | 2024-11-24T06:16:14Z | |
| dc.date.available | 2024-11-24T06:16:14Z | |
| dc.date.issued | 2018 | |
| dc.identifier.citation | S K Vaidya, P D Ajani,On Restrained Domination Number of Graphs,Vol.8, No.1 (2018), 17 - 23. doi: 10.26708/IJMSC.2018.1.8.03 Available online at www.ijmsc.com | en_US |
| dc.identifier.issn | 2319 – 5215 | |
| dc.identifier.uri | http://10.9.150.37:8080/dspace//handle/atmiyauni/1973 | |
| 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 domination number | en_US |
| dc.title | On Restrained Domination Number of Graphs | en_US |
| dc.type | Article | en_US |
