A241163 Maximal girth of a connected transitive trivalent (or cubic) graph with 2n nodes.

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, 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, 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

Offset: 2

Author

N. J. A. Sloane, Apr 19 2014

Keywords

• nonn

Links

• N. J. A. Sloane, Table of n, a(n) for n = 2..640, based on the work of Primož Potočnik, Pablo Spiga and Gabriel Verret
• Primož Potočnik, Pablo Spiga and Gabriel Verret, A census of small connected cubic vertex-transitive graphs (See the sub-page Table.html)

Crossrefs

Cf. A032355