A241905 - OEIS

A241905

The number of connected graphs G on n vertices such that every unlabeled automorphism of the reduced graph of G is a labeled automorphism of the reduced graph of G.

%I #14 May 21 2014 00:28:33

%S 1,1,1,4,13,83

%N The number of connected graphs G on n vertices such that every unlabeled automorphism of the reduced graph of G is a labeled automorphism of the reduced graph of G.

%D R. C. Read and R. J. Wilson, An Atlas of Graphs, Oxford University Press (1999).

%H J. P. McSorley and T. D. Porter, <a href="http://lagrange.math.siu.edu/mcsorley/papers/seqJJFIN.pdf">K_p Removable Sequences of Graphs</a>, Journal of Combinatorial Mathematics and Combinatorial Computing, 45, 43-62, (2003).

%Y Cf. A004110, A004108, A241904 (similar but graphs not necessarily connected).

%K nonn,more

%O 1,4

%A _Dayana Adatorwovor_, May 01 2014