A006799 Number of vertex-transitive graphs with n nodes.

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, 677402, 6768, 132580, 11150, 1963202, 14602, 814216, 48462, 13104170, 52488, 9462226, 99880, 39134640, 399420, 34333800, 364724

Offset: 1

Author

N. J. A. Sloane

Keywords

• nonn
• nice
• hard

References

• CRC Handbook of Combinatorial Designs, 1996, p. 649.
• Brendan McKay, personal communication.
• N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Links

• Nino Bašić, Martin Knor, and Riste Škrekovski, On regular graphs with Šoltés vertices, arXiv:2303.11996 [math.CO], 2023.
• Derek Holt and Gordon Royle, A Census of Small Transitive Groups and Vertex-Transitive Graphs, arXiv:1811.09015 [math.CO], 2018.
• B. D. McKay and G. F. Royle, The transitive graphs with at most 26 vertices, Ars Combin. 30 (1990), 161-176. (Annotated scanned copy)
• Brendan D. McKay, Gordon F. Royle, The transitive graphs with at most 26 vertices, Ars Combin. 30 (1990), 161-176.
• G. Royle, Transitive graphs
• 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

Row sums of A319367.

Cf. A006792, A006793, A006800, A185959.

Formula

Inverse Moebius transform of A006800. - Andrew Howroyd, Sep 18 2018

Extensions

More terms from Vladeta Jovovic, Jun 30 2007

a(32)-a(47) from Danny Rorabaugh, Nov 26 2018