Rank of an undirected graph is defined as n - c where n is the number of vertices in the graph and c is the number of connected components of the graph. This is the same rank as the representative incidence matrix.
| Parameters : | graph : NetworkX Graph
|
|---|---|
| Returns : | rank : int
|