|
Search: id:A007721
|
|
|
| A007721 |
|
Number of distinct degree sequences among all connected graphs with n nodes. |
|
+0
2
|
|
| 1, 2, 6, 19, 68, 236, 863, 3137, 11636, 43306, 162728, 614142, 2330454, 8875656, 33924699, 130038017, 499753560, 1924912505, 7429159770, 28723877046
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Sometimes called "graphical partitions", although this term is deprecated.
|
|
LINKS
|
F. Ruskey, Alley CATs in search of good homes, Congress. Numerant., 102 (1994) 97-110.
Index entries for sequences related to graphical partitions
N. Durand, G. Granger, A traffic complexity approach through cluster analysis, in proceedings of the 5th ATM R&D Seminar, Budapest, Hungary (2003)
|
|
CROSSREFS
|
Cf. A000569, A004250, A004251, A029889; A095208 (analogue for all graphs).
Sequence in context: A047016 A005654 A121655 this_sequence A058122 A038392 A044045
Adjacent sequences: A007718 A007719 A007720 this_sequence A007722 A007723 A007724
|
|
KEYWORD
|
nonn,nice
|
|
AUTHOR
|
F. Ruskey [ fruskey(AT)cs.uvic.ca ]
|
|
EXTENSIONS
|
a(9) corrected by Gordon Royle, Aug 30 2006
More terms from Herman Jamke (hermanjamke(AT)fastmail.fm), May 19 2007
|
|
|
Search completed in 0.002 seconds
|
