The queens graph Qn has the squares of then x n chessboard as its vertices; two squares
are adjacent if they are in the same row, column or diagonal. A set D of squares of
Qn is a dominating set for Qn if every square ...
For a graph G = (V (G), E (G)), a set S ~ V (G) dominates G if each vertex
in V (G) \S is adjacent to a vertex in S. The domination number I (G) (independent
domination number i (G)) of G is the minimum cardinality ...