login
Number of vertex cuts in the n-diagonal intersection graph.
0

%I #11 Feb 16 2025 08:34:05

%S 0,2,360,297491,3972214805675,129224325071359397,

%T 43529535229249752071113759341113692482719

%N Number of vertex cuts in the n-diagonal intersection graph.

%H Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/PolygonDiagonalIntersectionGraph.html">Polygon Diagonal Intersection Graph</a>

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

%Y Cf. A300528 (number of connected induced subgraphs).

%K nonn,more,changed

%O 3,2

%A _Eric W. Weisstein_, Apr 24 2023