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

2, 4, 2, 56, 654, 915052

Offset

2,1

Links

Table of n, a(n) for n=2..7.

Eric Weisstein's World of Mathematics, Folded Cube Graph

Eric Weisstein's World of Mathematics, Maximal Independent Vertex Set

Prog

(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

Crossrefs

Sequence in context: A361077 A263931 A259685 * A130172 A303320 A029589

Adjacent sequences: A301457 A301458 A301459 * A301461 A301462 A301463

Keyword

nonn,more

Author

Eric W. Weisstein, Mar 21 2018

Status

approved