Return the k-domination number the graph.
The k-domination number of a graph is the cardinality of a smallest k-dominating set of nodes in the graph.
The method to compute this number is modified brute force.
Parameters: G (NetworkX graph) – An undirected graph. Returns: The k-domination number of the graph. Return type: int