|
GraphTheory[MinimumDegree]
GraphTheory[MaximumDegree]
|
|
Calling Sequence
|
|
MaximumDegree(G)
MinimumDegree(G)
|
|
|
Description
|
|
|
•
|
MaximumDegree returns the largest degree of the graph.
|
|
•
|
MinimumDegree returns the smallest degree of the graph.
|
|
•
|
A graph is regular if its minimum degree is equal to its maximum degree.
|
|
|
|
Examples
|
|
|
>
|
|
|
>
|
|
|
| (1) |
|
>
|
|
|
| (2) |
|
>
|
|
|
| (3) |
|
>
|
|
|
|
Download Help Document
Was this information helpful?
