Smallest independent dominating sets in Kronecker products of cycles

Let k greater than or equal to 2, n = 2(k) + 1, and let m(0),...,m(k-1) eac h be a multiple of n. The graph C-m0 x...x Cmk-1 consists of isomorphic con nected components, each of which is (n - 1)-regular and admits of a vertex partition into n smallest independent dominating sets. Accordingly, (indepe ndent) domination number of each connected component of this graph is equal to (1/n)th of the number of vertices in it. (C) 2001 Elsevier Science B.V. All rights reserved.