A324263 Number of simple connected graphs on n unlabeled nodes with exactly two peripheral nodes.

0, 1, 1, 2, 5, 25, 185, 2459, 58156, 2617378

Offset: 1

Author

Andrew Howroyd, Sep 02 2019

Keywords

• nonn
• more

Comments

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.

Crossrefs

Column 2 of A324244.