|
%I #19 May 13 2017 17:50:51
%S 1,1,2,2,4,2,5,4,8,2,11,4,8,10,15,4,14,3,22,13,8,2,34,11,13,20,26,4,41
%N Number of connected arc-transitive graphs of order n.
%C Care is needed with "symmetric" terminology, which is variously used to mean both arc-transitive and both vertex- and edge-transitive.
%C The first known difference from A133181 (connected vertex- and edge-transitive graphs on n vertices) occurs at a(27), corresponding to the Doyle graph (which is both edge- and vertex-transitive but not arc-transitive). - _Eric W. Weisstein_, May 13 2017
%H Marston Conder, <a href="https://www.math.auckland.ac.nz/~conder/">Home Page</a> (Contains tables of regular maps, hypermaps and polytopes, trivalent symmetric graphs, and surface actions)
%H Marston Conder, <a href="https://www.math.auckland.ac.nz/~conder/symmetricgraphs-orderupto30.txt">Connected symmetric (arc-transitive) graphs of order 2 to 30</a>
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/Arc-TransitiveGraph.html">Arc-Transitive Graph</a>
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/DoyleGraph.html">Doyle Graph</a>
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/Edge-TransitiveGraph.html">Edge-Transitive Graph</a>
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/SymmetricGraph.html">Symmetric Graph</a>
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/Vertex-TransitiveGraph.html">Vertex-Transitive Graph</a>
%Y Cf. A133181 (number of connected vertex- and edge-transitive graphs on n vertices).
%Y Cf. A180240 (number of arc-transitive simple graphs on n nodes).
%K nonn,more
%O 2,3
%A _N. J. A. Sloane_, May 08 2017
|
