A205295 - OEIS

%I #7 May 01 2014 02:36:27

%S 1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,90

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

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

%H Jason Kimberley, <a href="/wiki/User:Jason_Kimberley/C_k-reg_girth_ge_g_index">Index of sequences counting connected k-regular simple graphs with girth at least g</a>

%H M. Meringer, <a href="http://www.mathe2.uni-bayreuth.de/markus/reggraphs.html">Tables of Regular Graphs</a>

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

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

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

%K nonn,more,hard

%O 0,16

%A _Jason Kimberley_, Jan 25 2012