|
%I #8 Jan 16 2024 19:54:01
%S 2,4,2,56,654,915052
%N Number of maximal independent vertex sets in the n-folded cube graph.
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/FoldedCubeGraph.html">Folded Cube Graph</a>
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/MaximalIndependentVertexSet.html">Maximal Independent Vertex Set</a>
%o (Python)
%o from itertools import product
%o from networkx import hypercube_graph, contracted_nodes, find_cliques, complement
%o def A301460(n):
%o G = hypercube_graph(n)
%o for a in product((0,1),repeat=n-1):
%o G = contracted_nodes(G,(0,)+a,(1,)+tuple(1-d for d in a))
%o return sum(1 for c in find_cliques(complement(G))) # _Chai Wah Wu_, Jan 16 2024
%K nonn,more
%O 2,1
%A _Eric W. Weisstein_, Mar 21 2018
|
