|
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
|
|
|
•
|
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.
|
>
|
|
|
>
|
|
|
>
|
|
|
| (1) |
|
>
|
|
|
| (2) |
|
|
Download Help Document
Was this information helpful?
