login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,4

REFERENCES

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

LINKS

Table of n, a(n) for n=1..6.

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: A061143 A123333 A197752 * A012258 A012134 A088946

Adjacent sequences:  A241902 A241903 A241904 * A241906 A241907 A241908

KEYWORD

nonn,more

AUTHOR

Dayana Adatorwovor, May 01 2014

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 26 04:11 EDT 2019. Contains 324369 sequences. (Running on oeis4.)