login

Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.

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

%I #10 May 01 2023 09:22:26

%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="http://mathworld.wolfram.com/PolygonDiagonalIntersectionGraph.html">Polygon Diagonal Intersection Graph</a>

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

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

%K nonn,more

%O 3,2

%A _Eric W. Weisstein_, Apr 24 2023