|
Search: id:A097911
|
|
|
| A097911 |
|
Minimal order of a graph containing as induced subgraphs isomorphic copies of all graphs on n unlabeled nodes. |
|
+0
1
|
| |
|
|
OFFSET
|
1,2
|
|
|
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: A110336 A073695 A068825 this_sequence A019730 A089103 A010617
Adjacent sequences: A097908 A097909 A097910 this_sequence A097912 A097913 A097914
|
|
KEYWORD
|
more,nonn,bref
|
|
AUTHOR
|
Dan Schwarz (dan_schwarz(AT)hotmail.com), Sep 04 2004
|
|
|
Search completed in 0.002 seconds
|
