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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A097911 Minimal order of a graph containing as induced subgraphs isomorphic copies of all graphs on n unlabeled nodes. 0
1, 3, 5, 8 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

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

EXAMPLE

a(3) = 5 as (P1 + K1)*K1 + K1 has 5 vertices and is easily seen minimal for 3. Here P1 is the path with one edge and K1 is an isolated vertex.

CROSSREFS

Cf.

Sequence in context: A073695 A268694 A068825 * A019730 A198838 A089103

Adjacent sequences:  A097908 A097909 A097910 * A097912 A097913 A097914

KEYWORD

more,nonn

AUTHOR

Dan Schwarz (dan_schwarz(AT)hotmail.com), Sep 04 2004

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 July 22 08:42 EDT 2019. Contains 325218 sequences. (Running on oeis4.)