Macaulay2 » Documentation
Packages » Graphs :: isRegular
next | previous | forward | backward | up | index | toc

isRegular -- determines whether a graph is regular

Description

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

i1 : G = cycleGraph 5;
i2 : isRegular G

o2 = true

See also

Ways to use isRegular:

  • isRegular(Graph)

For the programmer

The object isRegular is a method function.


The source of this document is in Graphs.m2:4569:0.