Let 𝐺 = (𝑉, 𝐸) be a graph. A dominating set 𝑫 ⊂
𝑽(𝑮) in G is a rings domination set if each vertex 𝒗 ∈ 𝑽 −
𝑫 is adjacent to at least two vertices in 𝑽 − 𝑫. If D is a rings dominating set, then D is called a minimal ring dominating set if it has no proper rings dominating set.
A minimum rings dominating set is a rings dominating set of smallest size in a given graph. The minimum cardinality of all minimal rings dominating set, denoted by 𝜸𝒓𝒊(𝑮), is called the rings domination number. Here, we also obtain 𝜸𝒓𝒊(𝑮) for Sunflower graph and Closed Sunflower graph.
Article Details
Unique Paper ID: 163076
Publication Volume & Issue: Volume 0, Issue no
Page(s): 109 - 112
Article Preview & Download
Share This Article
Join our RMS
Conference Alert
NCSEM 2024
National Conference on Sustainable Engineering and Management - 2024