|
|
A290611
|
|
Number of maximal independent vertex sets (and minimal vertex covers) in the n-tetrahedral graph.
|
|
1
|
|
|
|
OFFSET
|
6,1
|
|
LINKS
|
|
|
PROG
|
(Python)
from itertools import combinations
from networkx import empty_graph, find_cliques
G = empty_graph(combinations(range(n), 3))
G.add_edges_from((a, b) for a, b in combinations(G, 2) if len(set(a)&set(b)) != 2)
return sum(1 for c in find_cliques(G)) # Chai Wah Wu, Jan 16 2024
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|