|
%I #20 Aug 25 2020 09:52:34
%S 3,4,4,5,4,6,6,6,6,6,6,7,7,8,6,7,7,6,8,8,6,6,8,8,8,8,8,8,9,6,8,8,8,8,
%T 8,8,6,8,10,8,8,6,6,10,6,6,10,7,10,9,8,8,10,10,10,8,8,6,10,8,6,10,10,
%U 8,10,6,8,8,10,6,10,8,8,8,6,8,10,6,10,12,8,6,12,8,6,8,10,8,10,12,6,8,6,8,12,8,10,8,10,8,12,6,10,10,8,6,12,8,10,8,12,8,10,8,8,12,6,8,12,8,8,8,6,11,10,6,12,8,10
%N Maximal girth of a connected transitive trivalent (or cubic) graph with 2n nodes.
%H N. J. A. Sloane, <a href="/A241163/a241163.txt">Table of n, a(n) for n = 2..640</a>, based on 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> (See the sub-page Table.html)
%Y Cf. A032355
%K nonn
%O 2,1
%A _N. J. A. Sloane_, Apr 19 2014
|
