OFFSET
0,8
COMMENTS
Since the nontrivial 11-regular graph with the least number of vertices is K_12, there are no disconnected 11-regular graphs with less than 24 vertices. Thus for n<24 this sequence also gives the number of all 11-regular graphs on 2n vertices. - Jason Kimberley, Sep 25 2009
REFERENCES
CRC Handbook of Combinatorial Designs, 1996, p. 648.
I. A. Faradzev, Constructive enumeration of combinatorial objects, pp. 131-135 of Problèmes combinatoires et théorie des graphes (Orsay, 9-13 Juillet 1976). Colloq. Internat. du C.N.R.S., No. 260, Centre Nat. Recherche Scient., Paris, 1978.
LINKS
Jason Kimberley, Index of sequences counting connected k-regular simple graphs with girth at least g
M. Meringer, Tables of Regular Graphs
Eric Weisstein's World of Mathematics, Regular Graph
EXAMPLE
The null graph on 0 vertices is vacuously connected and 11-regular; since it is acyclic, it has infinite girth. - Jason Kimberley, Feb 10 2011
CROSSREFS
11-regular simple graphs: this sequence (connected), A185213 (disconnected).
KEYWORD
nonn,hard,more
AUTHOR
EXTENSIONS
a(9)-a(10) from Andrew Howroyd, Mar 13 2020
a(11)-a(12) from Andrew Howroyd, May 19 2020
STATUS
approved