GraphTheory - Maple Programming Help

Online Help

All Products    Maple    MapleSim


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

GraphTheory

  

MinimumDegree

  

MaximumDegree

 

Calling Sequence

Parameters

Description

Examples

Calling Sequence

MaximumDegree(G)

MinimumDegree(G)

Parameters

G

-

undirected graph

Description

• 

MaximumDegree returns the largest degree of the graph.

• 

MinimumDegree returns the smallest degree of the graph.

• 

A graph is regular if its minimum degree is equal to its maximum degree.

Examples

withGraphTheory:

GGraphTrail1,2,3,4,2,5,6,7,2,8,1

GGraph 1: an undirected unweighted graph with 8 vertices and 10 edge(s)

(1)

MaximumDegreeG

6

(2)

MinimumDegreeG

2

(3)

DrawGraphG

See Also

Degree

DegreeSequence

IsRegular

Trail