|
Search: id:A122113
|
|
|
| A122113 |
|
Number of pairwise non-isomorphic biconnected planar bipartite graphs on n vertices. |
|
+0
1
|
|
| 1, 1, 4, 6, 28, 77, 386, 1787, 10354, 62040, 404093
(list; graph; listen)
|
|
|
OFFSET
|
4,3
|
|
|
COMMENT
|
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".
|
|
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: A106286 A066293 A050881 this_sequence A093815 A142859 A056221
Adjacent sequences: A122110 A122111 A122112 this_sequence A122114 A122115 A122116
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Gordon Royle (gordon(AT)maths.uwa.edu.au), Oct 18 2006
|
|
|
Search completed in 0.002 seconds
|
