Abstract. Let G be a graph. By g(G) and i(g) we denote the domination number and the independent domination number, respectively. For all integers k\ge 3 we prove that, if G is a connected k-regular graph then i(G)/g(G)\le k/2, with equality if and only if G is K_k,k.