A260811 Number of trivalent bipartite connected simple graphs with 2n nodes and girth at least 6.

1, 0, 0, 0, 0, 0, 0, 1, 1, 3, 10, 28, 162, 1201, 11415, 125571, 1514489

Offset

0,10

Comments

The null graph on 0 vertices is vacuously connected, 3-regular, and bipartite; since it is acyclic, it has infinite girth.

Links

Table of n, a(n) for n=0..16.

G. Brinkmann, Fast generation of cubic graphs, Journal of Graph Theory, 23(2):139-149, 1996.

House of Graphs, Cubic bipartite graphs

Crossrefs

Connected 3-regular simple graphs with girth at least g: A185131 (triangle); chosen g: A002851 (g=3), A014371 (g=4), A014372 (g=5), A014374 (g=6), A014375 (g=7), A014376 (g=8).

Connected bipartite trivalent simple graphs with girth at least g: A006823 (g=4), this sequence (g=6), A260813 (g=8).

Sequence in context: A262251 A246974 A278294 * A108912 A350821 A361741

Adjacent sequences: A260808 A260809 A260810 * A260812 A260813 A260814

Keyword

nonn,more,hard

Author

Dylan Thurston, Jul 31 2015

Status

approved