|
Search: id:A004100
|
|
|
| A004100 |
|
Number of labeled nonseparable bipartite graphs on n nodes.
(Formerly M2878)
|
|
+0
1
|
|
| 0, 1, 0, 3, 10, 355, 6986, 297619, 15077658, 1120452771, 111765799882, 15350524923547, 2875055248515242, 738416821509929731, 260316039943139322858, 126430202628042630866787, 84814075550928212558332858, 78847417416749666369637926851
(list; graph; listen)
|
|
|
OFFSET
|
1,4
|
|
|
REFERENCES
|
F. Harary and R. W. Robinson, Labeled bipartite blocks, Canad. J. Math., 31 (1979), 60-68.
A. Nymeyer and R. W. Robinson, ``Tabulation of the Numbers of Labeled Bipartite Blocks and Related Classes of Bicolored Graphs,'' unpublished manuscript, 1982.
R. W. Robinson, Numerical implementation of graph counting algorithms, AGRC Grant, Math. Dept., Univ. Newcastle, Australia, 1976.
|
|
LINKS
|
R. W. Robinson, Table of n, a(n) for n = 1..32
|
|
CROSSREFS
|
Adjacent sequences: A004097 A004098 A004099 this_sequence A004101 A004102 A004103
Sequence in context: A056006 A067999 A119035 this_sequence A103156 A012865 A006273
|
|
KEYWORD
|
nonn,nice,easy
|
|
AUTHOR
|
njas
|
|
EXTENSIONS
|
a(16) onwards added by njas, Oct 19 2006 from the Robinson reference
|
|
|
Search completed in 0.002 seconds
|
