login
A301460
Number of maximal independent vertex sets in the n-folded cube graph.
2
2, 4, 2, 56, 654, 915052
OFFSET
2,1
LINKS
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: A263931 A375902 A259685 * A130172 A303320 A029589
KEYWORD
nonn,more
AUTHOR
Eric W. Weisstein, Mar 21 2018
STATUS
approved