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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A122113 Number of pairwise non-isomorphic biconnected planar bipartite graphs on n vertices. 0
1, 1, 4, 6, 28, 77, 386, 1787, 10354, 62040, 404093 (list; graph; refs; listen; history; text; internal format)
OFFSET

4,3

COMMENTS

Biconnected means "at least 2-connected". The corresponding sequence for 3-connected bipartite planar graph is A007028, where the term "polyhedral graph" is used as shorthand for "3-connected planar graph".

LINKS

Table of n, a(n) for n=4..14.

EXAMPLE

a(4) = 1 because the 4-cycle is the only planar and bipartite graph on 4 vertices that is at least 2-connected and a(5) = 1 because the complete bipartite graph K2,3 is the only such graph on 5 vertices.

CROSSREFS

Cf. A007028.

Sequence in context: A204385 A050881 A229719 * A093815 A142859 A259087

Adjacent sequences:  A122110 A122111 A122112 * A122114 A122115 A122116

KEYWORD

nonn

AUTHOR

Gordon F. Royle, Oct 18 2006

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 January 21 11:21 EST 2019. Contains 319354 sequences. (Running on oeis4.)