Smallest independent dominating sets in Kronecker products of cycles (Q5951974)

Let \(G= (V,E)\) and \(H= (W,F)\) be two graphs. Their Kronecker product is the graph \(G\times H\) such that \(V(G\times H)= V\times W\) and two vertices \((u,x)\), \((v,y)\) are adjacent in \(G\times H\) if and only if \(u\), \(v\) are adjacent in \(G\) and \(x\), \(y\) are adjacent in \(H\). A subset \(S\) of the vertex set \(V(G)\) of a graph \(G\) is called dominating in \(G\), if each vertex of \(G\) either is in \(S\), or is adjacent to a vertex of \(S\). If moreover no two vertices of \(S\) are adjacent in \(G\), the set \(S\) is called an independent dominating set in \(G\). The main result of the paper is the following: If \(k> 2\), \(n= 2^k+1\) and \(m_0,\dots, m_{k-1}\) are multiples of \(n\), then each connected component of the graph \(C_{m_0}\times\cdots\times C_{m_{k-1}}\) admits a vertex partition into smallest independent dominating sets.