cp's OEIS Frontend

A059282 Number of symmetric trivalent (or cubic) connected graphs on 2n nodes (the Foster census).

%I A059282 #60 Feb 16 2025 08:32:43
%S A059282 0,1,1,1,1,0,1,1,1,2,0,1,1,1,1,1,0,0,1,1,1,0,0,1,1,0,1,3,0,1,1,1,0,0,
%T A059282 0,1,1,0,1,1,0,1,1,0,1,0,0,2,2,0,1,1,0,1,1,3,1,0,0,2,1,0,1,2,0,0,1,0,
%U A059282 0,0,0,2,1,0,1,1,0,0,1,0,3,0,0,6,0,0,0,0,0,0,4,0,1,0,0,3,1,0,0,1,0,1,1,1,0,0,0,3,1,3,1,3,0,0,0,0,2,0,0,3,1,0,0,1,1,0,1,4,1,0,0,0,2,0,0,0,0,0,1,0,0,0,0,2,0,0,2,1,0,0,1
%N A059282 Number of symmetric trivalent (or cubic) connected graphs on 2n nodes (the Foster census).
%C A059282 Potočnik et al. refer to these as arc-transitive connected cubic vertex-transitive graphs.
%C A059282 Marston Conder (Email to N. J. A. Sloane, May 08 2017) remarks that "the first 5000 terms of A091430 are the same as the first 5000 terms of this sequence, with the exception of the 5th and 14th terms (corresponding to the Petersen graph and the Coxeter graph).  I verified this soon after completing the determination of all connected symmetric 3-valent graphs of order up to 10000, in June 2011."
%D A059282 I. Z. Bouwer, W. W. Chernoff, B. Monson and Z. Star, The Foster Census (Charles Babbage Research Centre, 1988), ISBN 0-919611-19-2.
%H A059282 Marston Conder, <a href="/A059282/b059282.txt">Table of n, a(n) for n = 1..5000</a> [The first 640 terms were added by N. J. A. Sloane, based on the work of Primož Potočnik, Pablo Spiga and Gabriel Verret]
%H A059282 Marston Conder, <a href="https://www.math.auckland.ac.nz/~conder/">Home Page</a> (Contains tables of regular maps, hypermaps and polytopes, trivalent symmetric graphs, and surface actions)
%H A059282 Marston Conder, <a href="https://www.math.auckland.ac.nz/~conder/symmcubic10000list.txt">Trivalent (cubic) symmetric graphs on up to 10000 vertices</a>
%H A059282 Marston Conder and P. Dobcsányi, <a href="https://citeseerx.ist.psu.edu/pdf/4486b9caf0ec26582ab1ae70bab6b743e84c66fd">Trivalent symmetric graphs on up to 768 vertices</a>, J. Combinatorial Mathematics & Combinatorial Computing 40 (2002), 41-63.
%H A059282 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> (See the sub-page Table.html)  [Broken link]
%H A059282 Gordon Royle et al., <a href="http://staffhome.ecm.uwa.edu.au/~00013890/remote/foster/">Cubic symmetric graphs (The Foster Census)</a> [Broken link]
%H A059282 Gordon Royle, <a href="http://staffhome.ecm.uwa.edu.au/~00013890/remote/cubtrans/index.html">Cubic transitive graphs</a>
%H A059282 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/CubicSymmetricGraph.html">Cubic Symmetric Graph</a>
%e A059282 The first example is K_4 with 4 nodes, thus a(2) = 1.
%Y A059282 Cf. A005638, A002851, A032355, A091430.
%K A059282 nonn,nice
%O A059282 1,10
%A A059282 _N. J. A. Sloane_, Jan 24 2001
%E A059282 Updated all links. Corrected entries based on the Potočnik et al. table. - _N. J. A. Sloane_, Apr 19 2014