A385173 Smallest number of vertices for which n nonisomorphic connected cubic symmetric graphs exist.

2, 4, 20, 56, 182, 432, 168, 364, 1792, 816, 1024, 1344, 1296, 1536, 6840

Offset

0,1

Comments

a(15) > 5000.

Links

Table of n, a(n) for n=0..14.

Eric Weisstein's World of Mathematics, Cubic Symmetric Graph.

Eric Weisstein's World of Mathematics, Foster Graph.

Example

Let "distinct" mean nonisomorphic connected cubic symmetric graphs.
a(0) = 2 since there are 0 distinct graphs on 2 vertices.
a(1) = 4 since there is 1 distinct graph on 4 vertices (K_4).
a(2) = 20 since there are 2 distinct graphs on 20 vertices (Desargues graph, dodecahedral graph).
a(3) = 56 since there are 3 distinct graphs on 56 vertices.

Crossrefs

Cf. A059282 (connected cubic symmetric graphs on 2n nodes).

Sequence in context: A052004 A353342 A027741 * A137697 A192380 A009336

Adjacent sequences: A385170 A385171 A385172 * A385174 A385175 A385176

Keyword

nonn,more,hard

Author

Eric W. Weisstein, Jun 20 2025

Status

approved