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

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A243783 Number of simple connected graphs on n nodes whose independence number a(g)=4. 5
0, 0, 0, 0, 1, 13, 205, 4308, 135563, 7161399 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,6

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 4 of A294490.

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

Sequence in context: A299960 A194727 A059355 * A206348 A240393 A319115

Adjacent sequences: A243780 A243781 A243782 * A243784 A243785 A243786

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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 4 16:41 EST 2022. Contains 358563 sequences. (Running on oeis4.)