GraphTheory - Maple Programming Help

Online Help

All Products    Maple    MapleSim


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

GraphTheory

  

IsRegular

 

Calling Sequence

Parameters

Description

Examples

Calling Sequence

IsRegular(G)

IsRegular(G, d)

Parameters

G

-

graph

d

-

(optional) name

Description

• 

An undirected graph G is regular if each vertex has the same degree. For example, CycleGraph(4) is a regular graph of degree 2.

• 

The IsRegular command returns true if the graph is regular and false otherwise. If a name d is specified, then this name is assigned the degree of the graph. If the graph is not regular and a name is specified, then the name is assigned FAIL.

Examples

withGraphTheory:

withSpecialGraphs:

GGraph1,2,1,3,2,3,3,4

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

(1)

DegreeSequenceG

2,2,3,1

(2)

IsRegularG

false

(3)

PPetersenGraph

PGraph 2: an undirected unweighted graph with 10 vertices and 15 edge(s)

(4)

DegreeSequenceP

3,3,3,3,3,3,3,3,3,3

(5)

IsRegularP,r

true

(6)

r

3

(7)

DrawGraphP

CClebschGraph

CGraph 3: an undirected unweighted graph with 16 vertices and 40 edge(s)

(8)

IsRegularC,r

true

(9)

r

5

(10)

DrawGraphC

See Also

Degree

DegreeSequence

IsStronglyRegular

MaximumDegree

MinimumDegree