| Title: | Restrained domination number of some path related graphs |
| Authors: | Vaidya, S.K. Ajani, P.D. |
| Keywords: | Dominating set Restrained dominating set Restrained dominating number |
| Issue Date: | 2017 |
| Publisher: | Journal of Computational Mathematica |
| Citation: | Vaidya, S. K., & Ajani, P. D. (2017). Restrained domination number of some path related graphs. Journal of Computational Mathematica, 1(1), 123-128.http://doi.org/10.26524/cm10 |
| Abstract: | A dominating set S ⊆ V (G)of a graph G is called restrained dominating set if every vertex in V (G) - S is adjacent to a vertex in S and to a vertex in V (G) - S. The restrained domination number of G, denoted by γ_r (G), is the minimum cardinality of a restrained dominating set of G. |
| URI: | http://10.9.150.37:8080/dspace//handle/atmiyauni/825 |
| ISSN: | 2456-8686 |
| Appears in Collections: | 01. Journal Articles |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| 393) 13079_Parag Devrajbhai Ajani.pdf | 312.98 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.