11 citations · 14 across the 9 of their papers we have counts for
1 paper · 1 filter
M. Ghebleh, L. Niepel
A set S of vertices of a graph G is a dominating set of G if every vertex u of G is either in S or it has a neighbour in S. In other words, S is dominating if the sets S\cap N[u] w…