|
%I #9 Sep 03 2019 15:11:24
%S 0,1,1,2,5,25,185,2459,58156,2617378
%N Number of connected graphs on n unlabeled nodes with exactly two peripheral nodes.
%C These are the graphs that only have two nodes whose distance from each other is equal to the diameter. An example of such a graph is the path graph.
%Y Column 2 of A324244.
%K nonn,more
%O 1,4
%A _Andrew Howroyd_, Sep 02 2019
|
