login
Number of simple connected graphs g on n nodes with |Aut(g)| = 2.
24

%I #19 Jun 16 2018 15:07:14

%S 0,1,1,2,9,37,317,4098,84602,2933996

%N Number of simple connected graphs g on n nodes with |Aut(g)| = 2.

%H Travis Hoppe and Anna Petrone, <a href="https://github.com/thoppe/Encyclopedia-of-Finite-Graphs">Encyclopedia of Finite Graphs</a>

%H T. Hoppe and A. Petrone, <a href="http://arxiv.org/abs/1408.3644">Integer sequence discovery from small graphs</a>, arXiv preprint arXiv:1408.3644, 2014

%H T. Hoppe and A. Petrone, <a href="http://doi.org/10.1016/j.dam.2015.07.017">Integer sequence discovery from small graphs</a>, Discr. Appl. Math. 201 (2016) 172-181.

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/GraphAutomorphism.html">Graph Automorphism</a>

%Y Cf. Values of |Aut(g)| for simple connected graphs, A124059, A241454, A241455, A241456, A241457, A241458, A241459, A241460, A241461, A241462, A241463, A241464, A241465, A241466, A241467, A241468, A241469, A241470, A241471.

%K nonn

%O 1,4

%A _Travis Hoppe_ and _Anna Petrone_, Apr 22 2014