For a nontrivial connected graph G with no isolated vertex, a nonempty subset D \(\subseteq\) V (G) is a rings dominating set if D is a dominating set and for each vertex \(\upsilon\) \(\in\) V \ D is adjacent to at least two vertices in V \ D. Thus, the dominating set D of V (G)...
Open access
Research Article10.9734/arjom/2023/v19i4649
For a nontrivial connected graph \(G\) with no isolated vertex, a nonempty subset \(D \subseteq V(G)\) is a rings dominating set if each vertex \(v \in V-D\) is adjacent to at least two vertices in \(V-D\). Thus, the dominating set \(D\) of \(V(G)\) is a rings dominating set if f...
Open access
Research Article10.9734/arjom/2022/v18i12622