|
|
A284707
|
|
Number of maximal independent vertex sets in the n-hypercube graph Q_n.
|
|
3
|
|
|
|
OFFSET
|
0,2
|
|
LINKS
|
|
|
FORMULA
|
a(n) ~ 2*n*2^(N/4) where N = 2^n [Kahn and Park]. - N. J. A. Sloane, Sep 11 2019
|
|
MATHEMATICA
|
Table[Length @ FindIndependentVertexSet[HypercubeGraph[n], Infinity, All], {n, 0, 6}] (* Eric W. Weisstein, Jan 01 2024 *)
|
|
PROG
|
(Python)
from networkx import empty_graph, find_cliques
k = 1<<n
G = empty_graph(list(range(k)))
G.add_edges_from((a, b) for a in range(k) for b in range(a) if (lambda m: (m&-m)^m if m else 1)(a^b))
return sum(1 for c in find_cliques(G)) # Chai Wah Wu, Jan 11 2024
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|