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, 2, 3, 8, 22, 110
Offset: 1
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).