|
| |
|
|
A007721
|
|
Number of distinct degree sequences among all connected graphs with n nodes.
|
|
1
| |
|
|
1, 2, 6, 19, 68, 236, 863, 3137, 11636, 43306, 162728, 614142, 2330454, 8875656, 33924699, 130038017, 499753560, 1924912505, 7429159770, 28723877046
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,2
|
|
|
COMMENTS
| Sometimes called "graphical partitions", although this term is deprecated.
|
|
|
REFERENCES
| F. Ruskey, Alley CATs in search of good homes, Congress. Numerant., 102 (1994) 97-110.
|
|
|
LINKS
| N. Durand, G. Granger, A traffic complexity approach through cluster analysis, in proceedings of the 5th ATM R&D Seminar, Budapest, Hungary (2003)
Index entries for sequences related to graphical partitions
|
|
|
CROSSREFS
| Cf. A000569, A004250, A004251, A029889; A095208 (analogue for all graphs).
Sequence in context: A184018 A148470 A148471 * A150099 A150100 A150101
Adjacent sequences: A007718 A007719 A007720 * A007722 A007723 A007724
|
|
|
KEYWORD
| nonn,nice
|
|
|
AUTHOR
| F. Ruskey [ ruskey(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
|
| |
|
|
