|
Search: id:A095268
|
|
|
| A095268 |
|
Number of distinct degree sequences among all n-vertex graphs with no isolated vertices. |
|
+0
2
|
|
| 1, 2, 7, 20, 71, 240, 871, 3148, 11655, 43332, 162769, 614198, 2330537, 8875768, 33924859, 130038230, 499753855, 1924912894, 7429160296, 28723877732, 111236423288, 431403470222
(list; graph; listen)
|
|
|
OFFSET
|
2,2
|
|
|
COMMENT
|
A002494 is the number of graphs on n nodes with no isolated points, and A095268 is the number of these graphs having distinct degree sequences.
Comment from Gordon Royle, Aug 29 2006: Is it true that a(n+1)/a(n) tends to 4? Is there are a heuristic argument why this might be true?
Comment from Paul Hanna, Aug 18, 2006: Now that more terms have been computed, we can see that this is not the self-convolution of any integer sequence.
|
|
LINKS
|
Frank Ruskey, Title?
Eric Weisstein's World of Mathematics, Degree sequence
|
|
EXAMPLE
|
a(4) = 7 because a 4-vertex graph with no isolated vertices can have degree sequence 1111, 2211, 2222, 3111, 3221, 3322 or 3333.
|
|
CROSSREFS
|
Cf. A000569, A002494, A004250; A007721 (analogue for connected graphs).
Adjacent sequences: A095265 A095266 A095267 this_sequence A095269 A095270 A095271
Sequence in context: A000150 A115117 A029890 this_sequence A118397 A009697 A139012
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
Eric Weisstein (eric(AT)weisstein.com), May 31, 2004
|
|
EXTENSIONS
|
Edited by njas, Aug 26 2006
More terms from Gordon Royle (gordon(AT)csse.uwa.edu.au), Aug 21 2006
a(21) and a(22) from Frank Ruskey, Aug 29 2006
a(23) from Frank Ruskey, Aug 31 2006
|
|
|
Search completed in 0.002 seconds
|
