|
GraphTheory[SpecialGraphs][CageGraph]
|
|
Calling Sequence
|
|
CageGraph(K, G)
|
|
|
Parameters
|
|
|
K
|
-
|
degree of graph
|
|
G
|
-
|
girth of graph
|
|
|
|
|
|
Description
|
|
|
•
|
The CageGraph(K,G) command creates the smallest K-regular graph(s) with girth G. If more than one graph meets these criteria, a sequence of graphs is returned. In the cases where the smallest graph is not known, FAIL is returned.
|
|
|
|
Examples
|
|
|
>
|
|
|
>
|
|
This is the Petersen graph
|
>
|
|
|
| (1) |
|
>
|
|
A sequence of graphs
|
>
|
|
|
| (2) |
Not known
|
>
|
|
|
| (3) |
|
|
Download Help Document
Was this information helpful?
