[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
login
A046082
Number of ultraconnected graphs on n unlabeled nodes.
1
1, 1, 1, 2, 4, 19, 139, 2319, 77423, 4909331, 554491273
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: A212923 A058130 A191563 * A048774 A061213 A063458
KEYWORD
hard,nonn
AUTHOR
Jason Grout (grout(AT)math.byu.edu), May 07 2003
EXTENSIONS
Broken link fixed by M. F. Hasler, Apr 05 2015
STATUS
approved