|
Search: id:A000171
|
|
|
| A000171 |
|
Number of self-complementary graphs with n nodes.
(Formerly M0014 N0780)
|
|
+0
9
|
|
| 1, 0, 0, 1, 2, 0, 0, 10, 36, 0, 0, 720, 5600, 0, 0, 703760, 11220000, 0, 0, 9168331776, 293293716992, 0, 0, 1601371799340544, 102484848265030656, 0, 0, 3837878966366932639744, 491247277315343649710080, 0, 0
(list; graph; listen)
|
|
|
OFFSET
|
1,5
|
|
|
COMMENT
|
a(n)=A007869(n)-A054960(n), where A007869(n) is number of unlabeled graphs with n nodes and an even number of edges and A054960(n) is number of unlabeled graphs with n nodes and an odd nu mber of edges.
|
|
REFERENCES
|
F. Harary and E. M. Palmer, Graphical Enumeration, Academic Press, NY, 1973, p. 139, Table 6.1.1.
R. C. Read, On the number of self-complementary graphs and digraphs, J. London Math. Soc., 38 (1963), 99-104.
R. C. Read and R. J. Wilson, An Atlas of Graphs, Oxford, 1998.
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
D. Wille, Enumeration of self-complementary structures, J. Comb. Theory B 25 (1978) 143-150.
|
|
LINKS
|
H. Fripertinger, Self-complementary graphs
Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.
|
|
CROSSREFS
|
A000171(4*n)=A003086(2*n). Cf. A047660, A051251, A047832.
Sequence in context: A113036 A000425 A010893 this_sequence A054922 A061848 A120556
Adjacent sequences: A000168 A000169 A000170 this_sequence A000172 A000173 A000174
|
|
KEYWORD
|
nonn,nice,easy
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
EXTENSIONS
|
More terms from R. C. Read (rcread(AT)math.uwaterloo.ca) and Vladeta Jovovic (vladeta(AT)eunet.rs).
|
|
|
Search completed in 0.002 seconds
|
