# isRegular -- determines whether a graph is regular

## Synopsis

• Usage:
r = isRegular G
• Inputs:
• G, an instance of the type Graph,
• Outputs:
• r, , whether the graph G is regular or not.

## Description

A graph is regular if all of its vertices have the same degree.

 i1 : G = cycleGraph 5; i2 : isRegular G o2 = true