grinpy.invariants.independence.independence_number¶
-
grinpy.invariants.independence.independence_number(G)¶ Return a the independence number of G.
The independence number of a graph is the cardinality of a largest independent set of nodes in the graph.
- G : graph
- A Networkx graph.
- independenceNumber : int
- The independence number of G.
k_independence_number