| Title: | On restrained domination number of graphs |
| Authors: | Vaidya, S.K. Ajani, P.D. |
| Keywords: | Dominating set Restrained dominating set Restrained dominating number |
| Issue Date: | 2018 |
| Publisher: | International Journal of Mathematics and Soft Computing |
| 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 |
| 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 |
| URI: | http://10.9.150.37:8080/dspace//handle/atmiyauni/826 |
| ISSN: | 2319-5215 |
| Appears in Collections: | 01. Journal Articles |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| 394) 13079_Parag Devrajbhai Ajani.pdf | 442.49 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.