|
|
A243782
|
|
Number of simple connected graphs on n nodes whose independence number a(g)=3.
|
|
5
|
|
|
|
OFFSET
|
1,5
|
|
COMMENTS
|
The independence number of a graph is the cardinality of the largest independent vertex set.
|
|
LINKS
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|