login
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.
1
1, 1, 1, 4, 13, 83
OFFSET
1,4
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, A241904 (similar but graphs not necessarily connected).
Sequence in context: A354409 A123333 A197752 * A012258 A012134 A088946
KEYWORD
nonn,more
AUTHOR
Dayana Adatorwovor, May 01 2014
STATUS
approved