Rings Domination Number of Some Mycielski Graphs
Marvanessa G. Dinorog & Isagani S. Cabahug, Jr. · Asian Research Journal of Mathematics · 2022
A set S of a graph G = (V (G);E(G)) is a rings dominating set if S is a dominating set and for every vertex in the complement of S has atleast two adjacent vertices. The caridinality of the minimum rings dominating set is the rings domination number of graph G, denoted by \(\gamm...
Open access
Research Article
10.9734/arjom/2022/v18i12621