|
|
A007028
|
|
Number of bipartite polyhedral graphs with n nodes.
(Formerly M3743)
|
|
1
|
|
|
1, 0, 1, 1, 5, 5, 21, 40, 176, 500, 2053, 7532, 31206, 124552, 521332, 2167599, 9183879, 38965327, 166956753, 718004565, 3107450143, 13502835176, 58956369552, 258398671525
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
8,5
|
|
REFERENCES
|
M. B. Dillencourt, Polyhedra of small orders and their Hamiltonian properties. Tech. Rep. 92-91, Info. and Comp. Sci. Dept., Univ. Calif. Irvine, 1992.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
|
|
LINKS
|
Gunnar Brinkmann and Brendan McKay, plantri and fullgen programs for generation of certain types of planar graph.
Gunnar Brinkmann and Brendan McKay, plantri and fullgen programs for generation of certain types of planar graph [Cached copy, pdf file only, no active links, with permission]
|
|
PROG
|
(bash/plantri) for n in {8..25}; do plantri -bpu ${n}; done # - Sean A. Irvine, Apr 29 2016
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|