2,2

CRC Handbook of Combinatorial Designs, 1996, p. 647.

H. Gropp, Enumeration of regular graphs 100 years ago, Discrete Math., 101 (1992), 73-85.

F. Harary, Graph Theory. Addison-Wesley, Reading, MA, 1969, p. 195.

R. C. Read, Some applications of computers in graph theory, in L. W. Beineke and R. J. Wilson, editors, Selected Topics in Graph Theory, Academic Press, NY, 1978, pp. 417-444.

R. C. Read and G. F. Royle, Chromatic roots of families of graphs, pp. 1009-1029 of Y. Alavi et al., eds., Graph Theory, Combinatorics and Applications. Wiley, NY, 2 vols., 1991.

R. C. Read and R. J. Wilson, An Atlas of Graphs, Oxford, 1998.

R. W. Robinson and N. C. Wormald, Numbers of cubic graphs. J. Graph Theory 7 (1983), no. 4, 463-467.

N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

M. Klin, M. R\"ucker, Ch. R\"ucker and G. Tinhofer, Algebraic Combinatorics

M. Meringer, Tables of Regular Graphs

Eric Weisstein's World of Mathematics, Cubic Graph

a(0)=1 by convention.

a(1)=0 because there are no simple connected cubic graphs with 2 nodes.

a(2)=1 because the tetrahedron is the only cubic graph with 4 nodes.

Cf. A005638, A032355.

Connected regular graphs of degree k: A002851 (k=3), A006820 (k=4), A006821 (k=5), A006822 (k=6), A014377 (k=7), A014378 (k=8), A014381 (k=9), A014382 (k=10), A014384 (k=11).

Sequence in context: A138911 A107377 A058132 this_sequence A124348 A052324 A020115

Adjacent sequences: A002848 A002849 A002850 this_sequence A002852 A002853 A002854

nonn,nice

N. J. A. Sloane (njas(AT)research.att.com).

More terms from R. C. Read (rcread(AT)math.uwaterloo.ca).