login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A243784 Number of simple connected graphs on n nodes whose independence number a(g)=5. 5
0, 0, 0, 0, 0, 1, 19, 513, 21782, 1576634 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,7

COMMENTS

The independence number of a graph is the cardinality of the largest independent vertex set.

LINKS

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

Travis Hoppe and Anna Petrone, Encyclopedia of Finite Graphs

T. Hoppe and A. Petrone, Integer sequence discovery from small graphs, arXiv preprint arXiv:1408.3644, 2014

Eric Weisstein's World of Mathematics, Independence Number, Maximum Independent Vertex Set

CROSSREFS

Column 5 of A294490.

Cf. Values of a(g) for simple connected graphs, A243781, A243782, A243783, A243784.

Sequence in context: A159248 A284220 A201711 * A158583 A009081 A057644

Adjacent sequences:  A243781 A243782 A243783 * A243785 A243786 A243787

KEYWORD

nonn,more

AUTHOR

Travis Hoppe and Anna Petrone, Jun 20 2014

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 7 16:57 EDT 2020. Contains 336277 sequences. (Running on oeis4.)