GraphTheory - Maple Help

Online Help

All Products    Maple    MapleSim


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

GraphTheory

  

Degree

  

InDegree

  

OutDegree

 

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 number of edges of the graph G which are incident to v. The directions of the edges are ignored.

• 

InDegree returns the number of arcs directed into v.

• 

OutDegree returns the number of arcs directed out of v.

Examples

withGraphTheory:

GDigraphTrail1,2,3,4,2

G:=Graph 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

 


Download Help Document

Was this information helpful?



Please add your Comment (Optional)
E-mail Address (Optional)
What is ? This question helps us to combat spam