A205295 Number of connected 5-regular simple graphs on 2n vertices with girth at least 5.

1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 90

Offset: 0

Author

Jason Kimberley, Jan 25 2012

Keywords

• nonn
• more
• hard

References

• M. Meringer, Fast Generation of Regular Graphs and Construction of Cages. Journal of Graph Theory, 30 (1999), 137-146.

Links

• Jason Kimberley, Index of sequences counting connected k-regular simple graphs with girth at least g
• M. Meringer, Tables of Regular Graphs

Crossrefs

Connected k-regular simple graphs with girth at least 5: A185115 (k=2), A014372 (k=3), A058343 (k=4), this sequence (k=5).

Connected 5-regular simple graphs with girth at least g: A006821 (g=3), A058275 (g=4), this sequence (g=5).

Connected 5-regular simple graphs with girth exactly g: A184953 (g=3), A184954 (g=4), A184955 (g=5).