login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A260811 Number of trivalent bipartite connected simple graphs with 2n nodes and girth at least 6. 1
1, 0, 0, 0, 0, 0, 0, 1, 1, 3, 10, 28, 162, 1201, 11415, 125571, 1514489 (list; graph; refs; listen; history; text; internal format)
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 A055336 A092325

Adjacent sequences:  A260808 A260809 A260810 * A260812 A260813 A260814

KEYWORD

nonn,more,hard

AUTHOR

Dylan Thurston, Jul 31 2015

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified February 21 15:11 EST 2019. Contains 320374 sequences. (Running on oeis4.)