A340486 Number of unlabeled graphs on n vertices whose independence number is equal to clique number.
1, 0, 2, 3, 8, 54, 380, 3462, 83606, 4822240
Offset: 1
Examples
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.
Links
- Eric Weisstein's World of Mathematics, Clique number.
- Eric Weisstein's World of Mathematics, Independence Number.