A290610 Number of maximal independent vertex sets (and minimal vertex covers) in the n-odd graph.

1, 3, 15, 6127

Offset

1,2

Links

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

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

Eric Weisstein's World of Mathematics, Minimal Vertex Cover.

Eric Weisstein's World of Mathematics, Odd Graph.

Prog

(Python)
from itertools import combinations
from networkx import empty_graph, find_cliques
def A290610(n):
    G = empty_graph(combinations(range((n<<1)-1), n-1))
    G.add_edges_from((a, b) for a, b in combinations(G, 2) if not set(a).isdisjoint(b))
    return sum(1 for c in find_cliques(G)) # Chai Wah Wu, Jan 11 2024

Crossrefs

Sequence in context: A076046 A202380 A383483 * A134807 A364799 A004002

Adjacent sequences: A290607 A290608 A290609 * A290611 A290612 A290613

Keyword

nonn,more

Author

Eric W. Weisstein, Aug 07 2017

Status

approved