login
A241904
The number of 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.
1
1, 2, 3, 8, 22, 110
OFFSET
1,2
REFERENCES
R. C. Read and R. J. Wilson, An Atlas of Graphs, Oxford University Press (1999).
LINKS
J. P. McSorley and T. D. Porter, K_p Removable Sequences of Graphs, Journal of Combinatorial Mathematics and Combinatorial Computing, 45, 43-62, (2003).
CROSSREFS
Cf. A004110, A004108, A241905 (similar but with connected graphs).
Sequence in context: A089402 A127940 A006796 * A006076 A263459 A261061
KEYWORD
nonn,more
AUTHOR
Dayana Adatorwovor, May 01 2014
STATUS
approved