|
%I #5 Apr 05 2015 02:11:48
%S 1,1,1,2,4,19,139,2319,77423,4909331,554491273
%N Number of ultraconnected graphs on n unlabeled nodes.
%C The ultraconnected graphs are related to the positive definite matrix completion problem.
%H W. W. Barrett, C. R. Johnson and R. Loewy, <a href="http://dx.doi.org/10.1137/S0895479897324573">Critical graphs for the positive definite completion problem.</a>, SIAM J. Matrix Anal. Appl., Vol. 20 (1999), no. 1, 117-130.
%K hard,nonn
%O 1,4
%A Jason Grout (grout(AT)math.byu.edu), May 07 2003
%E Broken link fixed by _M. F. Hasler_, Apr 05 2015
|
