|
| |
|
|
A006800
|
|
Number of connected transitive graphs with n nodes.
(Formerly M0345)
|
|
1
| |
|
|
1, 1, 1, 2, 2, 5, 3, 10, 7, 18, 7, 64, 13, 51, 44, 272, 35, 365, 59, 1190, 235, 807, 187, 15422, 461, 4221, 1425, 25792, 1181, 46236, 2191
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,4
|
|
|
REFERENCES
| McKay, Brendan; Royle, Gordon F.; The transitive graphs with at most $26$ vertices. Ars Combin. 30 (1990), 161-176.
B. D. McKay, personal communication.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
|
|
|
LINKS
| Eric Weisstein's World of Mathematics, Vertex-Transitive Graph
Steven Skiena, A Database of Graphs in Combinatorica Format.
|
|
|
CROSSREFS
| Sequence in context: A163298 A133440 A160793 * A190170 A147524 A113177
Adjacent sequences: A006797 A006798 A006799 * A006801 A006802 A006803
|
|
|
KEYWORD
| nonn,nice,changed
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
EXTENSIONS
| More terms from Vladeta Jovovic (vladeta(AT)eunet.rs), Jun 30 2007
|
| |
|
|
