GraphTheory - Maple Programming Help

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

GraphTheory

 MinimumDegree
 MaximumDegree

 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

 > $\mathrm{with}\left(\mathrm{GraphTheory}\right):$
 > $G≔\mathrm{Graph}\left(\mathrm{Trail}\left(1,2,3,4,2,5,6,7,2,8,1\right)\right)$
 ${G}{≔}{\mathrm{Graph 1: an undirected unweighted graph with 8 vertices and 10 edge\left(s\right)}}$ (1)
 > $\mathrm{MaximumDegree}\left(G\right)$
 ${6}$ (2)
 > $\mathrm{MinimumDegree}\left(G\right)$
 ${2}$ (3)
 > $\mathrm{DrawGraph}\left(G\right)$