|
GraphTheory[IsRegular]
|
|
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
|
|
|
>
|
|
|
>
|
|
|
>
|
|
|
| (1) |
|
>
|
|
|
![[2, 2, 3, 1]](/support/helpjp/helpview.aspx?si=6088/file01843/math92.png)
| (2) |
|
>
|
|
|
| (3) |
|
>
|
|
|
| (4) |
|
>
|
|
|
![[3, 3, 3, 3, 3, 3, 3, 3, 3, 3]](/support/helpjp/helpview.aspx?si=6088/file01843/math113.png)
| (5) |
|
>
|
|
|
| (6) |
|
>
|
|
|
| (7) |
|
>
|
|
|
>
|
|
|
| (8) |
|
>
|
|
|
| (9) |
|
>
|
|
|
| (10) |
|
>
|
|
|
|
Download Help Document
Was this information helpful?
