|
Search: id:A003400
|
|
|
| A003400 |
|
Number of asymmetric (not necessarily connected) graphs with n nodes.
(Formerly M4575)
|
|
+0
8
|
|
| 1, 0, 0, 0, 0, 8, 152, 3696, 135004, 7971848, 805364776
(list; graph; listen)
|
|
|
OFFSET
|
1,6
|
|
|
COMMENT
|
Number of simple graphs g on n nodes with |Aut(g)| = 1.
|
|
REFERENCES
|
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
F. Harary and E. M. Palmer, Graphical Enumeration, Academic Press, NY, 1973, p. 220, Section P3.4.
P. Steinbach, Field Guide to Simple Graphs. Design Lab, Albuquerque NM, 1990.
|
|
LINKS
|
Klaus Brockhaus, The 6-node asymmetric graphs
Zoran Maksimovic, Number of graphs on n nodes whose automorphism group orders are k, n<=11
Eric Weisstein's World of Mathematics, Identity Graph
Eric Weisstein's World of Mathematics, Graph Automorphism
|
|
CROSSREFS
|
See A124059 for connected asymmetric graphs. Cf. A000088.
Sequence in context: A003491 A053606 A123770 this_sequence A059510 A094059 A113268
Adjacent sequences: A003397 A003398 A003399 this_sequence A003401 A003402 A003403
|
|
KEYWORD
|
nonn,nice,hard
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
EXTENSIONS
|
a(8) and a(9) from Eric Weisstein (eric(AT)weisstein.com), Jun 09, 2004
a(10) and a(11) from Zoran Maksimovic, Vladeta Jovovic (vladeta(AT)eunet.rs), Jan 21 2005
|
|
|
Search completed in 0.002 seconds
|
