[go: up one dir, main page]

login
Number of disconnected 3-regular simple graphs on 2n vertices with girth at least 4.
13

%I #12 May 01 2014 02:37:02

%S 0,0,0,0,0,0,1,2,9,35,177,1153,10341,120523,1702432,27507351,

%T 492377298,9600913017,201990426697,4555849947783

%N Number of disconnected 3-regular simple graphs on 2n vertices with girth at least 4.

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

%Y Disconnected k-regular simple graphs with girth at least 4: A185214 (any k), A185204 (triangle); specified degree k: A185224 (k=2), this sequence (k=3), A185244 (k=4), A185254 (k=5), A185264 (k=6), A185274 (k=7), A185284 (k=8), A185294 (k=9).

%K nonn,hard,more

%O 0,8

%A _Jason Kimberley_, Feb 22 2011