grinpy.invariants.zero_forcing.min_k_forcing_set

grinpy.invariants.zero_forcing.min_k_forcing_set(G, k)

Return a smallest k-forcing set in G.

The method used to compute the set is brute force.

Parameters:

• G (NetworkX graph) – An undirected graph.
• k (int) – A positive integer.

Returns:

A list of nodes in a smallest k-forcing set in G.

Return type:

list