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

Author

Dylan Thurston, Jul 31 2015

Keywords

• nonn
• more
• hard

Comments

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

Links

• 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).