OFFSET
0,59
LINKS
Andries E. Brouwer, Cages
House of Graphs, Cubic graphs
EXAMPLE
The null graph is vacuously regular; there is one 0-regular simple graph with 1 vertex, and one 1-regular simple graph with 2 vertices; each of those three graphs, being acyclic, has infinite girth.
The n-cycle is the connected 2-regular graph with girth n.
The (3,9)-cages have order 58 and there are 18 of them.
CROSSREFS
KEYWORD
nonn,hard,more
AUTHOR
Jason Kimberley, Oct 22 2011
STATUS
approved