|
Search: id:A001832
|
|
|
| A001832 |
|
Number of labeled connected bipartite graphs on n nodes.
(Formerly M3063 N1241)
|
|
+0
8
|
|
| 1, 1, 3, 19, 195, 3031, 67263, 2086099, 89224635, 5254054111, 426609529863, 47982981969979, 7507894696005795, 1641072554263066471, 502596525992239961103, 216218525837808950623459, 130887167385831881114006475
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
REFERENCES
|
F. Harary and R. W. Robinson, Labeled bipartite blocks, Canad. J. Math., 31 (1979), 60-68.
D. A. Klarner, The number of graded partially ordered sets, J. Combin. Theory, 6 (1969), 12-19.
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
Eric Weisstein's World of Mathematics, n-Colorable Graph
Eric Weisstein's World of Mathematics, n-Chromatic Graph
|
|
CROSSREFS
|
Cf. A002031.
Sequence in context: A053554 A079145 A000763 this_sequence A123681 A007151 A127502
Adjacent sequences: A001829 A001830 A001831 this_sequence A001833 A001834 A001835
|
|
KEYWORD
|
nonn,nice,easy
|
|
AUTHOR
|
njas
|
|
EXTENSIONS
|
More terms from Vladeta Jovovic (vladeta(AT)Eunet.yu), Apr 12 2003
|
|
|
Search completed in 0.002 seconds
|
