A290606 Number of maximal independent vertex sets (and minimal vertex covers) in the n-halved cube graph.

1, 2, 4, 4, 40, 136, 8080, 17331120

Offset: 1

Author

Eric W. Weisstein, Aug 07 2017

Keywords

• nonn
• more

Links

• Eric Weisstein's World of Mathematics, Halved Cube Graph.
• Eric Weisstein's World of Mathematics, Maximal Independent Vertex Set.
• Eric Weisstein's World of Mathematics, Minimal Vertex Cover.

Crossrefs

Cf. A288943.

Programs

Mathematica

Table[Length@FindIndependentVertexSet[GraphPower[HypercubeGraph[n - 1], 2], Infinity, All], {n, 7}]

Python

from networkx import empty_graph, find_cliques, complement, power
def A290606(n):
    k = 1<Chai Wah Wu, Jan 11 2024