Let be a connected graph. Let be a minimum perfect dominating set and is said to be sub-restrained perfect dominating set of G if every such that . The sub-restrained perfect dominating number of is the minimum cardinality of the sub-restrained perfect dominating set of which is denoted by . 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.
No takes yet. Share an insight, caveat, or question.
Bhatt et al. (2024) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: