A324264 Number of simple connected graphs on n unlabeled nodes with diameter equal to radius.

1, 1, 1, 2, 5, 28, 223, 3151, 79673, 3853870

Offset: 1

Author

Andrew Howroyd, Sep 02 2019

Keywords

• nonn
• more

Comments

When the graph diameter is equal to the radius, every node has the same eccentricity and is in both the graph center and the graph periphery.

Links

• Eric Weisstein's World of Mathematics, Graph Center.
• Eric Weisstein's World of Mathematics, Graph Periphery.
• Wikipedia, Distance (graph theory).

Crossrefs

Rightmost diagonal of A294525 and A324244.