Sub-Restrained Perfect Domination In Graphs

Bhatt, Tushhar

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