|
GraphTheory[GraphRank]
|
|
Calling Sequence
|
|
GraphRank(G)
GraphRank(G, E)
|
|
|
Parameters
|
|
|
G
|
-
|
graph
|
|
E
|
-
|
(optional) set of edges or arcs of the (di)graph
|
|
|
|
|
|
Description
|
|
|
•
|
GraphRank returns rank of a graph G which is the number of vertices minus the number of connected components of G. If a set of edges (arcs) E of the (di)graph is specified, then the rank is number of vertices minus the number of connected components of the spanning subgraph of G with edge set E.
|
|
|
Download Help Document
Was this information helpful?
