GraphTheory
IsRegular
Calling Sequence
Parameters
Description
Examples
IsRegular(G)
IsRegular(G, d)
G
-
graph
d
(optional) name
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.
See Also
Degree
DegreeSequence
IsStronglyRegular
MaximumDegree
MinimumDegree
Download Help Document