login
Number of simple connected graphs with n nodes and exactly 3 articulation points (cutpoints).
6

%I #10 Sep 05 2019 22:58:09

%S 0,0,0,0,1,5,32,242,2461,35839

%N Number of simple connected graphs with n nodes and exactly 3 articulation points (cutpoints).

%H Travis Hoppe and Anna Petrone, <a href="https://github.com/thoppe/Encyclopedia-of-Finite-Graphs">Encyclopedia of Finite Graphs</a>

%H T. Hoppe and A. Petrone, <a href="http://arxiv.org/abs/1408.3644">Integer sequence discovery from small graphs</a>, arXiv preprint arXiv:1408.3644, 2014

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/ArticulationVertex.html">Articulation Vertex</a>

%Y Column k=3 of A325111.

%Y Cf. other simple connected graph sequences with k articulation points A002218, A241767, A241768, A241769, A241770, A241771.

%K nonn

%O 1,6

%A _Travis Hoppe_ and _Anna Petrone_, Apr 28 2014