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.
Parameters: G (NetworkX graph) – An undirected graph. Returns: The independence number of G. Return type: int See also