A007101 Number of labeled trivalent (or cubic) cyclically 4-connected graphs with 2n nodes.

1, 10, 3360, 1753920, 1812888000, 3158396841600, 8496995611104000, 33199738565849856000, 180116271096528678912000, 1310903590075375049994240000, 12454930569778045924343408640000

Offset: 2

Author

N. J. A. Sloane

Keywords

• nonn

References

• R. W. Robinson, personal communication.
• R. W. Robinson, Numerical implementation of graph counting algorithms, AGRC Grant, Math. Dept., Univ. Newcastle, Australia, 1976.
• N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Links

• R. W. Robinson, Table of n, a(n) for n = 2..30
• N. C. Wormald, Enumeration of cyclically 4-connected cubic graphs, J. Number Theory 9 (4) (1985) 563, Theorem 4.1.