Degree - Maple Help

Online Help

All Products    Maple    MapleSim


GraphTheory

  

Degree

  

compute degree of vertex

  

InDegree

  

compute in-degree of vertex

  

OutDegree

  

compute out-degree of vertex

 

Calling Sequence

Parameters

Description

Examples

Calling Sequence

Degree(G, v)

InDegree(H, v)

OutDegree(H, v)

Parameters

G

-

directed or undirected graph

H

-

directed graph

v

-

vertex

Description

• 

Degree returns the degree of v; that is, the number of edges of the graph G which are incident to v.  The directions of the edges are ignored.

• 

InDegree returns the in-degree of v; that is, the number of arcs directed into v.

• 

OutDegree returns the out-degree of v; that is, the number of arcs directed out of v.

• 

To find the vertices which are the tails of arcs directed into v, use GraphTheory[Arrivals].

• 

To find the vertices which are the heads of arcs directed out of v, use GraphTheory[Departures].

Examples

withGraphTheory:

GDigraphTrail1,2,3,4,2

GGraph 1: a directed unweighted graph with 4 vertices and 4 arc(s)

(1)

DrawGraphG

DegreeG,2

3

(2)

InDegreeG,2

2

(3)

OutDegreeG,2

1

(4)

See Also

DegreeSequence

DrawGraph

IsRegular

MaximumDegree

MinimumDegree

Trail

UnderlyingGraph