A301460 Number of maximal independent vertex sets in the n-folded cube graph.

2, 4, 2, 56, 654, 915052

Offset: 2

Author

Eric W. Weisstein, Mar 21 2018

Keywords

• nonn
• more

Links

• Eric Weisstein's World of Mathematics, Folded Cube Graph
• Eric Weisstein's World of Mathematics, Maximal Independent Vertex Set

Programs

Python

from itertools import product
from networkx import hypercube_graph, contracted_nodes, find_cliques, complement
def A301460(n):
    G = hypercube_graph(n)
    for a in product((0,1),repeat=n-1):
        G = contracted_nodes(G,(0,)+a,(1,)+tuple(1-d for d in a))
    return sum(1 for c in find_cliques(complement(G))) # Chai Wah Wu, Jan 16 2024