Previous topic


Next topic

Matrix Utility Functions

This Page



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

Undirected graph.

Returns :

rank : int

Rank of the graph.