A367681 Number of maximal independent vertex sets in the n-Lucas cube graph.

1, 2, 2, 4, 17, 64, 731, 43388, 20087577

Offset

1,2

Links

Table of n, a(n) for n=1..9.

Eric Weisstein's World of Mathematics, Lucas Cube Graph

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

Eric Weisstein's World of Mathematics, Minimal Vertex Cover

Prog

(Python)
from itertools import product, combinations
from networkx import empty_graph, find_cliques
def A367681(n):
    v = tuple(int(q, 2) for q in (''.join(p) for p in product('01', repeat=n)) if '11' not in q+q[0])
    G = empty_graph(v)
    e = tuple((a, b) for a, b in combinations(v, 2) if (lambda m: (m&-m)^m if m else 1)(a^b))
    G.add_edges_from(e)
    return sum(1 for c in find_cliques(G)) # Chai Wah Wu, Jan 11 2024

Crossrefs

Sequence in context: A267218 A051285 A079556 * A232161 A335684 A052628

Adjacent sequences: A367678 A367679 A367680 * A367682 A367683 A367684

Keyword

nonn,more

Author

Eric W. Weisstein, Nov 26 2023

Status

approved