AbstractThe k-restricted domination number of a graph G is the minimum number d k such that for any subset U of k vertices of G, there is a dominating set in G including U and having at most d k vertices. Some new upper bounds in terms of order and degrees for this number are found.