|
Search: id:A000684
|
|
|
| A000684 |
|
Number of colored labeled n-node graphs with 2 interchangeable colors.
(Formerly M2954 N1192)
|
|
+0
1
|
|
| 1, 3, 13, 81, 721, 9153, 165313, 4244481, 154732801, 8005686273, 587435092993, 61116916981761, 9011561121239041, 1882834327457349633, 557257804202631217153, 233610656002563147038721, 138681207656726645785559041
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
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
S. R. Finch, Bipartite, k-colorable and k-colored graphs (2*A000684)
|
|
CROSSREFS
|
2 * A000683(n) + 1. Cf. A058872.
Adjacent sequences: A000681 A000682 A000683 this_sequence A000685 A000686 A000687
Sequence in context: A135921 A005923 A089461 this_sequence A057993 A000904 A135743
|
|
KEYWORD
|
nonn,nice,easy
|
|
AUTHOR
|
njas
|
|
EXTENSIONS
|
a(15) onwards added by njas, Oct 19 2006 from the Robinson reference
|
|
|
Search completed in 0.002 seconds
|
