| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Vaidya, S. K | - |
| dc.contributor.author | Ajani, P. D | - |
| dc.date.accessioned | 2024-11-24T07:17:03Z | - |
| dc.date.available | 2024-11-24T07:17:03Z | - |
| dc.date.issued | 2021 | - |
| dc.identifier.citation | Vaidya, S. K., & Ajani, P. D. (2021). Restrained Edge Domination Number of Some Path Related Graphs. J Sci Res, 13(1), 145-151. | en_US |
| dc.identifier.issn | 2070-0237 | - |
| dc.identifier.uri | http://10.9.150.37:8080/dspace//handle/atmiyauni/1979 | - |
| dc.description.abstract | For a graph, a set is a restrained dominating (restrained edge dominating) set if every vertex (edge) not in S is adjacent (incident) to a vertex (edge) in S and to a vertex (edge) in The minimum cardinality of a restrained dominating (restrained edge dominating) set of G is called restrained domination (restrained edge domination) number of G, denoted by The restrained edge domination number of some standard graphs are already investigated while in this paper the restrained edge domination number like degree splitting, switching, square and middle graph obtained from path. | en_US |
| dc.language.iso | en | en_US |
| dc.publisher | JSR Publications | en_US |
| dc.subject | Dominating set | en_US |
| dc.subject | Restrained dominating set | en_US |
| dc.subject | Restrained edge dominating set | en_US |
| dc.subject | Restrained edge domination number | en_US |
| dc.title | Restrained Edge 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 | |
|---|---|---|---|---|
| Restrained Edge Domination Number of Some Path Related Graphs.pdf | 303.7 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.