GraphTheory - Maple Programming Help

Online Help

All Products    Maple    MapleSim


Home : Support : Online Help : Mathematics : Discrete Mathematics : Graph Theory : GraphTheory Package : GraphTheory/GraphRank

GraphTheory

  

GraphRank

 

Calling Sequence

Parameters

Description

Examples

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.

Examples

withGraphTheory:

GGraph1,2,3,4,4,5:

GraphRankG

3

(1)

GraphRankG,1,2,3,4

2

(2)

See Also

ConnectedComponents

NumberOfVertices