A290609 - OEIS

%I #11 Jan 14 2024 00:15:04

%S 1,2,5,16,79,857,49049,75511755

%N Number of maximal independent vertex sets (and minimal vertex covers) in the n-Mycielski graph.

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/MaximalIndependentVertexSet.html">Maximal Independent Vertex Set</a>

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/MinimalVertexCover.html">Minimal Vertex Cover</a>

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/MycielskiGraph.html">Mycielski Graph</a>

%o (Python)

%o from networkx import find_cliques, complement, mycielski_graph

%o def A290609(n): return sum(1 for c in find_cliques(complement(mycielski_graph(n)))) # _Chai Wah Wu_, Jan 13 2024

%K nonn,more

%O 1,2

%A _Eric W. Weisstein_, Aug 07 2017

%E a(8) from _Pontus von Brömssen_, Oct 06 2022