|
|
A294217
|
|
Triangle read by rows: T(n,k) is the number of graphs with n vertices and minimum vertex degree k, (0 <= k < n).
|
|
9
|
|
|
1, 1, 1, 2, 1, 1, 4, 4, 2, 1, 11, 12, 8, 2, 1, 34, 60, 43, 15, 3, 1, 156, 378, 360, 121, 25, 3, 1, 1044, 3843, 4869, 2166, 378, 41, 4, 1, 12346, 64455, 113622, 68774, 14306, 1095, 65, 4, 1, 274668, 1921532, 4605833, 3953162, 1141597, 104829, 3441, 100, 5, 1
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,4
|
|
COMMENTS
|
Terms may be computed without generating each graph by enumerating the number of graphs by degree sequence. A PARI program showing this technique for graphs with labeled vertices is given in A327366. Burnside's lemma can be used to extend this method to the unlabeled case. - Andrew Howroyd, Mar 10 2020
|
|
LINKS
|
|
|
FORMULA
|
T(n, n-1) = 1.
|
|
EXAMPLE
|
Triangle begins:
1;
1, 1;
2, 1, 1;
4, 4, 2, 1;
11, 12, 8, 2, 1;
34, 60, 43, 15, 3, 1;
156, 378, 360, 121, 25, 3, 1;
...
|
|
CROSSREFS
|
Row sums are A000088 (simple graphs on n nodes).
Cf. A263293 (triangle of n-node maximum vertex degree counts).
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|