|
|
A290609
|
|
Number of maximal independent vertex sets (and minimal vertex covers) in the n-Mycielski graph.
|
|
1
|
|
|
|
OFFSET
|
1,2
|
|
LINKS
|
|
|
PROG
|
(Python)
from networkx import find_cliques, complement, mycielski_graph
def A290609(n): return sum(1 for c in find_cliques(complement(mycielski_graph(n)))) # Chai Wah Wu, Jan 13 2024
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|