1 citations · 1 across the 1 of their papers we have counts for
1 paper
S. Mehry, R. Safakish
In a graph G, a vertex dominates itself and its neighbors. A subset S of V is called a dominating set in G if every vertex in V is dominated by at least one vertex in S. The domina…