Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Marvanessa G. Dinorog"'
Publikováno v:
Asian Research Journal of Mathematics. :16-26
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