A058929 Number of 2-connected claw-free labeled cubic graphs with 2n nodes.

0, 1, 60, 2520, 453600, 59875200, 10897286400, 6701831136000, 2623194782208000, 1338096104497152000, 1633313557551836160000, 1324107982344764897280000, 1408369399403068118016000000

Offset: 1

Author

N. J. A. Sloane, Jan 12 2001

Keywords

• nonn

References

• G.-B. Chae, E. M. Palmer and R. W. Robinson, Computing the number of Claw-free Cubic Graphs with given Connectivity, preprint, 2001.

Links

• G.-B. Chae, Table of n, a(n) for n = 1..18
• 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

Cf. A057848 (1-connected).