| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Vaidya, S.K. | - |
| dc.contributor.author | Ajani, P.D. | - |
| dc.date.accessioned | 2023-05-01T06:15:44Z | - |
| dc.date.available | 2023-05-01T06:15:44Z | - |
| dc.date.issued | 2017 | - |
| dc.identifier.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 | en_US |
| dc.identifier.issn | 2456-8686 | - |
| dc.identifier.uri | http://10.9.150.37:8080/dspace//handle/atmiyauni/825 | - |
| dc.description.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. | en_US |
| dc.language.iso | en | en_US |
| dc.publisher | Journal of Computational Mathematica | en_US |
| dc.subject | Dominating set | en_US |
| dc.subject | Restrained dominating set | en_US |
| dc.subject | Restrained dominating number | en_US |
| dc.title | Restrained domination number of some path related graphs | en_US |
| dc.type | Article | en_US |
| 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.