networks(deprecated)/rank - Maple Help

networks

 rank
 finds the rank of an edge set

 Calling Sequence rank(e, G)

Parameters

 G - graph or network e - set of edges of G

Description

 • 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](...).

Examples

Important: The networks package has been deprecated.Use the superseding package GraphTheory instead.

 > $\mathrm{with}\left(\mathrm{networks}\right):$
 > $G≔\mathrm{complete}\left(3\right):$
 > $\mathrm{rank}\left(\left\{\mathrm{e1}\right\},G\right)$
 ${1}$ (1)
 > $\mathrm{rank}\left(\left\{\mathrm{e1},\mathrm{e2}\right\},G\right)$
 ${2}$ (2)