login
Number of independent vertex sets and vertex covers in the n-polygon diagonal intersection graph.
4

%I #27 Feb 16 2025 08:33:51

%S 4,8,46,1301,9594689,2547502844,81612865961374672886095,

%T 83148730861613724622207922410,

%U 42669506698822879024139962361064916979679786913819225043370,52055549652690422060940235190389701045195623263738558

%N Number of independent vertex sets and vertex covers in the n-polygon diagonal intersection graph.

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

%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/VertexCover.html">Vertex Cover</a>

%Y Cf. A292356, A292923, A296517, A300569.

%K nonn,changed

%O 3,1

%A _Eric W. Weisstein_, Mar 09 2018

%E a(9)-a(12) from _Andrew Howroyd_, Mar 10 2018