A058932 Number of unlabeled claw-free cubic graphs with 2n nodes and connectivity 1.

0, 0, 0, 0, 0, 0, 1, 1, 3, 5, 11, 20

Offset

1,9

References

G.-B. Chae (chaegabb(AT)pilot.msu.edu), E. M. Palmer and R. W. Robinson, Computing the number of Claw-free Cubic Graphs with given Connectivity, preprint, 2001.

Links

Table of n, a(n) for n=1..12.

G.-B. Chae, Home page

G.-B. Chae, Counting labeled claw-free cubic graphs by connectivity, Discrete Mathematics 308 (2008) 5136-5143.

G.-B. Chae, E. M. Palmer and R. W. Robinson, Computing the number of Claw-free Cubic Graphs with given Connectivity, Preprint, 2000. (Annotated scanned copy)

Crossrefs

Sequence in context: A061068 A263925 A328660 * A118037 A094588 A299027

Adjacent sequences: A058929 A058930 A058931 * A058933 A058934 A058935

Keyword

nonn,more

Author

N. J. A. Sloane, Jan 12 2001

Status

approved