Doubly Restrained Domination in Graphs

Author(s)	Ms. Jessa Mae Sale Leuveras, Dr. Enrico Limbo Enriquez
Country	Philippines
Abstract	Let G be a connected simple graph. A subset S of V(G) is a dominating set of G if for every v∈V(G)∖S, there exists x∈S such that xv∈E(G). A set S⊆V(G) is a restrained dominating set if every vertex not in S is adjacent to a vertex in S and to a vertex in V(G)∖S. A nonempty subset S⊆V(G) is doubly restrained dominating set of G, if S is a dominating set and both 〈S〉 and 〈V(G)∖S〉 have no isolated vertices. The minimum cardinality of a doubly restrained dominating set of G, denoted by γ_rr (G), is called the doubly restrained domination number of G. In this paper, we initiate the study of the concept and give the domination number of some special graphs and the corona of two graphs.
Keywords	dominating set, restrained dominating set, doubly restrained dominating set
Field	Mathematics
Published In	Volume 7, Issue 2, March-April 2025
Published On	2025-04-12
DOI	https://doi.org/10.36948/ijfmr.2025.v07i02.41412

About IJFMR Fees & Payment Current Issue Publication Archive	Submit Research Paper Track Submission Status Publication Guidelines Publication Ethics Peer Review & Plagiarism	Join as a Reviewer Editors & Reviewers Reviewer Referral Program Get Reviewer Membership Certi.	Website/Journal Policies Usage Policy Content Policies Privacy Policy

Contact Us		+91-9687-828-838	editor@ijfmr.com

International Journal For Multidisciplinary Research