login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A185200
Square array O(k,g) containing the least nontrivial order of disconnected k-regular simple graphs with girth at least g.
0
6, 8, 8, 10, 12, 10, 12, 16, 20, 12, 14, 20, 38, 28, 14, 16, 24, 60, 52, 48, 16, 18, 28, 80, 84, 134, 60, 18, 20, 32, 100, 124
OFFSET
0,1
COMMENTS
This array is twice A054760.
(A proof of the monotonicity with respect to girth appears in Holton & Sheehan)
CROSSREFS
Cf. A185204 - A185207: the triangular arrays D(n,k) counting disconnected k-regular simple graphs with girth at least g on n vertices, for 4 <= g <= 7.
Sequence in context: A154476 A316858 A316859 * A216275 A315946 A047876
KEYWORD
nonn,tabl,more,hard
AUTHOR
Jason Kimberley, Jan 25 2011
STATUS
approved