Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A046082
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A046082 Number of ultraconnected graphs on n unlabeled nodes. +0
2
1, 1, 1, 2, 4, 19, 139, 2319, 77423, 4909331, 554491273 (list; graph; listen)
OFFSET

1,4

COMMENT

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: A047092 A064228 A058130 this_sequence A048774 A061213 A063458

Adjacent sequences: A046079 A046080 A046081 this_sequence A046083 A046084 A046085

KEYWORD

hard,nonn

AUTHOR

Jason Grout (grout(AT)math.byu.edu), May 07 2003

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 24 23:16 EST 2009. Contains 167481 sequences.


AT&T Labs Research