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

Author

Eric W. Weisstein, Jun 20 2025

Keywords

• nonn
• more
• hard

Comments

a(15) > 5000.

Examples

			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.
		

Links

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

Crossrefs

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