finds the rank of an edge set
graph or network
set of edges of G
Important: The networks package has been deprecated.Use the superseding package GraphTheory instead.
The rank of an edgeset e is the number of vertices of G minus the number of components of the subgraph induced by e.
This routine is normally loaded via the command with(networks) but may also be referenced using the full name networks[rank](...).
G ≔ complete⁡3:
Download Help Document
What kind of issue would you like to report? (Optional)