# grinpy.invariants.independence.is_independent_set¶

grinpy.invariants.independence.is_independent_set(G, nbunch)

Return whether or not the nodes in nbunch comprise an independent set.

An set S of nodes in G is called an independent set if no two nodes in S are neighbors of one another.

Parameters: G (NetworkX graph) – An undirected graph. nbunch – A single node or iterable container or nodes. True if the nodes in nbunch comprise an independent set, False otherwise. bool