A097911 - OEIS

This site is supported by donations to The OEIS Foundation.

A097911

Minimal order of a graph containing as induced subgraphs isomorphic copies of all graphs on n unlabeled nodes.

1, 3, 5, 8 (list; graph; refs; listen; history; internal format)

	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 * A019730 A198838 A089103` `Adjacent sequences: A097908 A097909 A097910 * A097912 A097913 A097914`
	KEYWORD	`more,nonn,bref`
	AUTHOR	`Dan Schwarz (dan_schwarz(AT)hotmail.com), Sep 04 2004`

Content is available under The OEIS End-User License Agreement .

Last modified February 14 23:53 EST 2012. Contains 205689 sequences.