| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Bhatt, Tushhar | - |
| dc.date.accessioned | 2025-01-01T11:14:28Z | - |
| dc.date.available | 2025-01-01T11:14:28Z | - |
| dc.date.issued | 2024 | - |
| dc.identifier.issn | 2148-2403 | - |
| dc.identifier.uri | http://10.9.150.37:8080/dspace//handle/atmiyauni/2202 | - |
| dc.description.abstract | et πΊ=(π(πΊ),πΈ(πΊ))be a connected graph. Let πβπ(πΊ)be a minimum perfect dominating set and πβπ(πΊ)\πis said to be sub-restrained perfect dominating setof Gif every π£βπ(πΊ)βπsuch that|π(π£)β©π|=1. The sub-restrained perfect dominating number of πΊis the minimum cardinality of thesub-restrained perfect dominating set of πΊwhich is denoted byπΎπ ππ(G). As a novel approach to the study of domination theory, we can attempt to define sub-restrained perfect dominating set in this paper. We also identify certain novel findings, fundamental characteristics, and so forth. | en_US |
| dc.language.iso | en | en_US |
| dc.publisher | Educational Administration: Theory and Practice | en_US |
| dc.subject | Dominating set | en_US |
| dc.subject | perfect dominating set | en_US |
| dc.subject | sub-restrained perfect dominating set | en_US |
| dc.subject | restraineddominating set | en_US |
| dc.subject | corona productof two graphs | en_US |
| dc.title | Sub-Restrained Perfect Domination In Graphs | en_US |
| dc.type | Article | en_US |
| Appears in Collections: | 01. Journal Articles | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| g-4255.pdf | 271.33 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.