|
|
A340486
|
|
Number of unlabeled graphs on n vertices whose independence number is equal to clique number.
|
|
0
|
|
|
|
OFFSET
|
1,3
|
|
LINKS
|
|
|
EXAMPLE
|
a(3) = 2 because, of the four graphs of order three, only the path graph and its complement have equal independence and clique number, 2 in this case.
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|