|
|
A241767
|
|
Number of simple connected graphs with n nodes and exactly 1 articulation point (cutpoints).
|
|
7
|
|
|
0, 0, 1, 2, 7, 33, 244, 2792, 52448, 1690206, 96288815, 9873721048, 1841360945834, 629414405238720, 397024508142598996, 464923623652122023478, 1016016289424631486429082, 4162473006943138723685574978, 32096861904411547975392065322659
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,4
|
|
COMMENTS
|
Terms may be computed from A004115. See formula. There is an obvious bijection between a connected graph with 1 articulation point and a multiset of at least two rooted nonseparable graphs joined at the root node. - Andrew Howroyd, Nov 24 2020
|
|
LINKS
|
|
|
FORMULA
|
|
|
CROSSREFS
|
Cf. A004115 (rooted and without articulation points).
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|