|
%I #36 Feb 20 2023 22:08:38
%S 1,2,2,3,4,3,4,5,7,3,11,5,6,10,10,5,12,5,12,10,7,5,32,9,10,13,16,7,38,
%T 7,26,11,12,11,37,9,11,14,33,9,30,9,17,21,13,9,90,13,25,16,22,11,42,
%U 19,38,18,18,11,105,13,17,26,83,19,35,13,28,19,35,13,124,15,22,28,27,19,46,15,104,43,24,15,99,23,23,23,45,17,80,25,31,26,25,23,274,19,35,31,61,19
%N Number of connected transitive trivalent (or cubic) graphs with 2n nodes.
%C Read and Wilson give counts of connected transitive graphs. Gordon Royle states that there are 17 transitive 32-node graphs. Read and Wilson state that 10 of them are connected. - _Richard Sabey_, Oct 11 2012
%D R. C. Read and R. J. Wilson, An Atlas of Graphs, Oxford, 1998.
%H N. J. A. Sloane, <a href="/A032355/b032355.txt">Table of n, a(n) for n = 2..640</a>, taken from the work of Primož Potočnik, Pablo Spiga and Gabriel Verret.
%H Primož Potočnik, Pablo Spiga and Gabriel Verret, <a href="http://staff.matapp.unimib.it/~spiga/census.html">A census of small connected cubic vertex-transitive graphs</a>
%H Gordon Royle, <a href="http://symomega.wordpress.com/2012/02/27/there-are-677402-vertex-transitive-graphs-on-32-vertices/">There are 677402 vertex-transitive graphs on 32 vertices</a>
%H Gordon Royle, <a href="http://staffhome.ecm.uwa.edu.au/~00013890/remote/cubtrans/index.html">Cubic transitive graphs</a> [Broken link]
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/CubicVertex-TransitiveGraph.html">Cubic Vertex-Transitive Graph</a>
%Y Cf. A005638, A002851, A241167 (Euler transf.).
%K nonn,nice
%O 2,2
%A Ronald C. Read
%E "Connected" added by _Richard Sabey_, Oct 11 2012
%E Link provided that, in principle, gives values up to n=640. Extended to n=30 from that link by _Allan C. Wechsler_, Apr 18 2014
%E Extended to 640 from same source by _N. J. A. Sloane_, Apr 19 2014
|
