Let ≥ 2, = 2 + 1, and let , …, each be a multiple of . The graph × … × consists of isomorphic connected components, each of which is ( – 1)-regular and admits of a vertex partition into smallest independent dominating sets. Accordingly, (independent) domination number of each connected...