login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A290609 Number of maximal independent vertex sets (and minimal vertex covers) in the n-Mycielski graph. 1
1, 2, 5, 16, 79, 857, 49049, 75511755 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
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, Mycielski Graph
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
Sequence in context: A054960 A004110 A236960 * A048754 A176343 A327062
KEYWORD
nonn,more
AUTHOR
Eric W. Weisstein, Aug 07 2017
EXTENSIONS
a(8) from Pontus von Brömssen, Oct 06 2022
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 09:42 EDT 2024. Contains 371935 sequences. (Running on oeis4.)