We find a lower bound for the k-subdomination number on the set of graphs with a given upper bound for vertex degrees. We study the cases where the proposed lower bound is sharp, construct the optimal graphs and indicate the corresponding k-subdominating functions. The results are interpreted in terms of social structures.
