A046082 - OEIS

This site is supported by donations to The OEIS Foundation.

A046082

Number of ultraconnected graphs on n unlabeled nodes.

1, 1, 1, 2, 4, 19, 139, 2319, 77423, 4909331, 554491273 (list; graph; refs; listen; history; internal format)

	OFFSET	`1,4`
	COMMENTS	`The ultraconnected graphs are related to the positive definite matrix completion problem.`
	LINKS	`W. W. Barrett, C. R. Johnson and R. Loewy, Critical graphs for the positive definite completion problem., SIAM J. Matrix Anal. Appl., Vol. 20 (1999), no. 1, 117-130.`
	CROSSREFS	`Sequence in context: A168246 A058130 A191563 * A048774 A061213 A063458` `Adjacent sequences: A046079 A046080 A046081 * A046083 A046084 A046085`
	KEYWORD	`hard,nonn`
	AUTHOR	`Jason Grout (grout(AT)math.byu.edu), May 07 2003`

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

Last modified February 14 10:09 EST 2012. Contains 205614 sequences.