|
| |
|
|
A006799
|
|
Number of vertex-transitive graphs with n nodes.
(Formerly M0302)
|
|
2
| |
|
|
1, 2, 2, 4, 3, 8, 4, 14, 9, 22, 8, 74, 14, 56, 48, 286, 36, 380, 60, 1214, 240, 816, 188, 15506, 464, 4236, 1434, 25850, 1182, 46308, 2192
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,2
|
|
|
REFERENCES
| CRC Handbook of Combinatorial Designs, 1996, p. 649.
Brendan McKay, personal communication.
McKay, Brendan D.; Royle, Gordon F.; The transitive graphs with at most $26$ vertices. Ars Combin. 30 (1990), 161-176.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
|
|
|
LINKS
| Steven Skiena, A Database of Graphs in Combinatorica Format.
Eric Weisstein's World of Mathematics, Vertex-Transitive Graph
Eric Weisstein's World of Mathematics, Cayley Graph
|
|
|
CROSSREFS
| Sequence in context: A048676 A049287 A185959 * A056429 A133806 A185333
Adjacent sequences: A006796 A006797 A006798 * A006800 A006801 A006802
|
|
|
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
|
| |
|
|
